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/MultipleChains.h // This is really -*- C++ -*- #ifndef MultipleChains_h #define MultipleChains_h #include "Serializable.h" #include <LikelihoodComputation.h> #include <MHWidth.h> #include <MHWidthOne.h> #include <Simulation.h> #include <Chain.h> namespace BIE { class MixturePrior; //+ CLICLASS MultipleChains SUPER Simulation class MultipleChains : public Simulation { public: enum Control { parallel, serial }; static Control cntrl; static unsigned nfifo; static int state_iter; //+ CLICONSTR int int int MHWidth* BaseDataTree* Model* Integration* Converge* MixturePrior* LikelihoodComputation* MCAlgorithm* MultipleChains(int max, int ndim, int number, MHWidth *width, BaseDataTree* d, Model* m, Integration* i, Converge* c, MixturePrior* mp, LikelihoodComputation* l, MCAlgorithm* mca); //+ CLICONSTR int int int MHWidth* BaseDataTree* Model* Integration* Converge* MixturePrior* LikelihoodComputation* MCAlgorithm* Simulation* MultipleChains(int max, int ndim, int number, MHWidth *width, BaseDataTree* d, Model* m, Integration* i, Converge* c, MixturePrior* mp, LikelihoodComputation* l, MCAlgorithm* mca, Simulation *last); virtual ~MultipleChains(); void NewState(int Mcur, vector<double>& w, vector< vector<double> >& p); void NewState(Chain& ch); void NewState(State& s); virtual void Initialize(); virtual void Reinitialize(MHWidth* width, MixturePrior *mp); //+ CLIMETHOD void SetControl int void SetControl(int); //+ CLIMETHOD void EnableLogging void EnableLogging() { caching = true; CreateChains(); } double GetValue(); double GetPrior(); double GetLikelihood(); State GetState(); virtual void ReportState(); virtual void LogState(string& logfile); virtual void LogState(int level, int iterno, string& outfile); void PrintState() { chains[0].PrintState(); } virtual void PrintStepDiagnostic(); virtual void PrintStateDiagnostic(); vector<double> GetStat(void); void AdditionalInfo(); protected: virtual void MCMethod(); MHWidth * width; bool caching; vector<unsigned char> update_flag; vector<unsigned char> update_flag1; vector<unsigned long> nstat0; vector<unsigned long> nstat1; deque< vector<unsigned char> > arate; void CreateChains(); void SampleNewState(int k); void SampleNewStateParallel(int k); void SampleNewStateSerial(int k); unsigned ncount; unsigned totalnum; unsigned totaltry; void ResetChainStats(); vector<int> stat0, stat1; void getChainCounts(); bool chains_initialized; private: // Save the RNG // template<class Archive> void post_save(Archive &ar, const unsigned int file_version) const { vector<Serializable*> s; s.push_back(BIEgen); ar << BOOST_SERIALIZATION_NVP(s); } // Reassign pointer to fiducial chain and restore the RNG // template<class Archive> void post_load(Archive &ar, const unsigned int file_version) { vector<Serializable *>s; ar >> BOOST_SERIALIZATION_NVP(s); BIEgen = dynamic_cast<BIEACG*>(s[0]); chfid = &chains[0]; } // AUTO GENERATED BY ../persistence/autopersist.py protected: MultipleChains() {} private: friend class boost::serialization::access; BOOST_SERIALIZATION_SPLIT_MEMBER(); template<class Archive> void save(Archive & ar, const unsigned int version) const { this->pre_save(ar, version); try { ar << BOOST_SERIALIZATION_BASE_OBJECT_NVP(Simulation); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(cntrl); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(nfifo); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(state_iter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(width); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(caching); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(update_flag); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(update_flag1); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(nstat0); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(nstat1); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(arate); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(ncount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(totalnum); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(totaltry); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(chains_initialized); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_save(ar, version); } template<class Archive> void load(Archive & ar, const unsigned int version) { this->pre_load(ar, version); try { ar >> BOOST_SERIALIZATION_BASE_OBJECT_NVP(Simulation); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(cntrl); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(nfifo); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(state_iter); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(width); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(caching); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(update_flag); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(update_flag1); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(nstat0); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(nstat1); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(arate); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(ncount); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(totalnum); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(totaltry); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(chains_initialized); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_load(ar, version); } }; } BIE_CLASS_TYPE_INFO(BIE::MultipleChains) BIE_CLASS_EXPORT_KEY(BIE::MultipleChains) #endif