Changeset 1064 for library/bdm/stat/discrete.h
- Timestamp:
- 06/09/10 14:00:40 (14 years ago)
- Files:
-
- 1 modified
-
library/bdm/stat/discrete.h (modified) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
library/bdm/stat/discrete.h
r896 r1064 26 26 class rectangular_support: public root { 27 27 protected: 28 29 30 31 32 33 34 35 36 37 38 39 40 41 28 //! Array of boundaries (2D vectors: [begining,end]) for each dimension 29 Array<vec> ranges; 30 //! Number of support points in each dimension 31 ivec gridsizes; 32 //! dimension 33 int dim; 34 //! Number of data points 35 int Npoints; 36 //! active vector for first_vec and next_vec 37 vec actvec; 38 //! indices of active vector 39 vec actvec_ind; 40 //! length of steps in each dimension 41 vec steps; 42 42 public: 43 44 45 43 //! default constructor 44 rectangular_support() : dim ( 0 ), Npoints ( 0 ) { 45 } 46 46 47 48 47 //! set parameters 48 void set_parameters ( const Array<vec> &ranges0, const ivec &gridsize0 ); 49 49 50 51 50 //! Internal functio to set temporaries correctly 51 void initialize(); 52 52 53 54 53 //! return vector at position given by vector of indices 54 vec get_vec ( const ivec &inds ); 55 55 56 57 56 //! convert dimension indices into linear index, the indexing is in the same way as in \c next_vec() 57 long linear_index ( const ivec inds ); 58 58 59 60 59 //! set the first vector to corner and store result in actvec 60 const vec& first_vec(); 61 61 62 63 62 //! Get next active vector, call ONLY after first_vector()! 63 const vec& next_vec(); 64 64 65 66 67 68 65 //! return active vector, call ONLY after first_vector()! 66 const vec& act_vec() { 67 return actvec; 68 }; 69 69 70 71 70 //! \todo to je asi navic .. v predkovi! 71 ivec nearest_point ( const vec &val ); 72 72 73 74 75 76 73 //! Access function 74 int points() const { 75 return Npoints; 76 } 77 77 78 79 80 81 82 78 //! access function 79 //! \todo opet pouze do potomka.. 80 const vec& _steps() const { 81 return steps; 82 } 83 83 84 84 void from_setting ( const Setting &set ); 85 85 }; 86 86 UIREGISTER ( rectangular_support ); … … 89 89 class discrete_support: public root { 90 90 protected: 91 92 93 94 91 //! storage of support points 92 Array<vec> Spoints; 93 //! index in iterators 94 int idx; 95 95 public: 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 96 //! Default constructor 97 discrete_support() : Spoints ( 0 ), idx ( 0 ) {} 98 //! Access function 99 int points() const { 100 return Spoints.length(); 101 } 102 //! set the first vector to corner and store result in actvec 103 const vec& first_vec() { 104 bdm_assert_debug ( Spoints.length() > 0, "Empty support" ); 105 idx = 0; 106 return Spoints ( idx ); 107 } 108 //! set next vector after calling first_vec() 109 const vec& next_vec() { 110 bdm_assert_debug ( Spoints.length() > idx - 1, "Out of support points" ); 111 return Spoints ( ++idx ); 112 } 113 113 114 115 116 117 118 119 120 121 122 123 114 /*! 115 \code 116 class = "discrete_support"; 117 points = ( [1,2..], [2,2..], ...); // list of points 118 === OR === 119 epdf = {class="epdf_offspring",...}; // epdf rfom which to sample 120 npoints = 100; // number of samples 121 \endcode 122 */ 123 void from_setting ( const Setting &set ); 124 124 125 126 127 128 125 //! access function 126 Array<vec> & _Spoints() { 127 return Spoints; 128 } 129 129 }; 130 130 UIREGISTER ( discrete_support ); … … 133 133 class grid_fnc: public fnc { 134 134 protected: 135 136 137 138 135 //! grid - function support 136 rectangular_support sup; 137 //! function values on the grid 138 vec values; 139 139 public: 140 141 142 143 144 145 146 140 //! constructor function 141 void set_support ( rectangular_support &sup0 ) { 142 sup = sup0; 143 values = zeros ( sup.points() ); 144 } 145 //! constructor function fills values by calling function \c f , double f(vec&), given by a pointer 146 void set_values ( double ( *evalptr ) ( const vec& ) ); 147 147 148 149 148 //! constructor function fills values by calling function \c f , double f(vec&), given by a pointer 149 void set_values ( const epdf &ep ); 150 150 151 152 153 154 151 //! get value nearest to the given point 152 double nearest_val ( const vec &val ) { 153 return values ( sup.linear_index ( sup.nearest_point ( val ) ) ); 154 } 155 155 156 157 158 159 160 161 156 vec eval ( const vec &val ) { 157 return vec_1 ( nearest_val ( val ) ); 158 } 159 const vec & _values() const { 160 return values; 161 } 162 162 }; 163 163 UIREGISTER ( grid_fnc ); … … 168 168 class egrid: public epdf { 169 169 protected: 170 171 172 173 170 //! support of the pdf - grid 171 rectangular_support sup; 172 //! values at the grid 173 vec values; 174 174 public: 175 176 177 178 175 //! we assume that evallog is not called too often otherwise we should cache log(values) 176 double evallog ( const vec &val ) { 177 return log ( values ( sup.linear_index ( sup.nearest_point ( val ) ) ) ); 178 } 179 179 180 180 };
