BIE Overview Quick Start Theoretical overview Available methods Parallel chains Computation engine Command Line Interface Graphical User Interface Assigning Output Visualization tool Data handling Software technology Parallel debugging Results to date Recent developments Links User guide Future features Project goals Project Team Copyright and license

/home/weinberg/src/BIE/include/HistogramND.h // This is really -*- C++ -*- #ifndef HistogramND_h #define HistogramND_h #include "SmplHist.h" #include "Distribution.h" #include "Histogram1D.h" #include "clivector.h" #include "Serializable.h" namespace BIE { //+ CLICLASS HistogramND SUPER BinnedDistribution class HistogramND : public BinnedDistribution { private: int dim, nbins; vector<double> bins; vector<double> low, high, width; vector < vector<double> > centers; vector<int> irank, imarg; double vol, mass; vector<double> mean, square, stdev; inline int IN(vector<int> i) { int iret = i[dim-1]; for (int indx=dim-2; indx>=0; indx--) iret = i[indx] + irank[indx]*iret; return iret; } inline bool OK(State& x) { for (int i=0; i<dim; i++) if (x[i]<low[i] || x[i] >= high[i]) return false; return true; } inline int INDX(State& x) { vector<int> iv(dim); for (int i=0; i<dim; i++) iv[i] = (int)( (x[i] - low[i])/width[i] ); return IN(iv); } inline vector<int> IV(int i) { vector<int> ret(dim); for (int indx=dim-1; indx>=0; indx--) { ret[indx] = i/imarg[indx]; i -= ret[indx]*imarg[indx]; } return ret; } void initialize(); bool AccumulateData(double v, State& x); bool AccumulateData(double v, RecordBuffer * datapoint); public: //+ CLICONSTR HistogramND(); //+ CLICONSTR clivectord* clivectord* clivectord* RecordType* HistogramND(vector<double> *lo_in, vector<double> *hi_in, vector<double> *width_in, RecordType* type); //+ CLICONSTR clivectord* clivectord* clivectord* clivectors* HistogramND(vector<double> *lo_in, vector<double> *hi_in, vector<double> *width_in, vector<string> * names); ~HistogramND(); HistogramND* New(); double PDF(State& x); double logPDF(State& x); double CDF(State& x); vector<double> lower(void) { return low;} vector<double> upper(void) { return high;} vector<double> Mean(void) { return mean;} vector<double> StdDev(void) { return stdev;} vector<double> Moments(int i) { if (i==0) return vector<double>(1, 1.0); if (i==2) return square; return mean; } vector<double> Sample(void) { cerr << "HistogramND::Sample: Not implemented\n"; return vector<double>(dim, 0.0); } void ComputeDistribution(); int numberData() {return nbins;} double getValue(int i) { if (i>=0 && i<nbins) return bins[i]; else return 0.0; } vector<double> getLow(int i) { vector<double> ret(dim, 0.0); if (i>=0 && i<nbins) { vector<int> in = IV(i); for (int j=0; j<dim; j++) ret[j] = centers[j][in[j]] - 0.5*width[j]; }; return ret; } vector<double> getHigh(int i) { vector<double> ret(dim, 0.0); if (i>=0 && i<nbins) { vector<int> in = IV(i); for (int j=0; j<dim; j++) ret[j] = centers[j][in[j]] + 0.5*width[j]; }; return ret; } int getdim(int i) {return dim;} void dumpraw(string file, int i=0, int j=1); void dumpsm(string file, int i=0, int j=1); void dumpmat(vector< vector<double> >&mat, vector<double>& x, vector<double>& y, int i=0, int j=1); // AUTO GENERATED BY ../persistence/autopersist.py private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int version) { this->pre_serialize(ar, version); try { ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(BinnedDistribution); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(dim); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(nbins); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(bins); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(low); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(high); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(width); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(centers); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(irank); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(imarg); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(vol); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(mass); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(mean); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(square); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(stdev); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } // namespace BIE BIE_CLASS_TYPE_INFO(BIE::HistogramND) BIE_CLASS_EXPORT_KEY(BIE::HistogramND) #endif