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/BIEACG.h // This is really -*- C++ -*- #ifndef BIEACG_H #define BIEACG_H #include "Serializable.h" #include "BIEmpi.h" #include "ACG.h" using namespace std; namespace BIE { extern int myid; extern int numprocs; extern bool mpi_used; extern streambuf * checkTable(const char *function_name); //+ CLASS BIEACG SUPER ACG class BIEACG : public ACG { private: vector< vector<unsigned> > states; vector<unsigned> seeds, lcgs; vector<unsigned short> statesizes, auxsizes; vector<short> js, ks; void pre_clean() const; void send_state() const; void pack_state(const int) const; void unpack_state(const int) const; void recv_state() const; public: BIEACG(); BIEACG(uint32_t seed, int size = 55); virtual ~BIEACG() {} void dump_acg(string); private: template<class Archive> void pre_save(Archive & ar, const unsigned int version) const { if (mpi_used) { if (myid==0) { pre_clean(); for (int n=1; n<numprocs; n++) pack_state(n); } else { send_state(); } } } template<class Archive> void post_load(Archive & ar, const unsigned int version) { if (mpi_used) { // Allow a consistent restore if numprocs // has a different value int lprocs = min<int>(numprocs, seeds.size()+1); if (myid==0) { for (int n=1; n<lprocs; n++) unpack_state(n); } else { if (myid<lprocs) recv_state(); } } } // AUTO GENERATED BY ../persistence/autopersist.py 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(ACG); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(states); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(seeds); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(lcgs); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(statesizes); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(auxsizes); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(js); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar << BOOST_SERIALIZATION_NVP(ks); 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(ACG); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(states); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(seeds); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(lcgs); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(statesizes); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(auxsizes); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(js); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar >> BOOST_SERIALIZATION_NVP(ks); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_load(ar, version); } }; } BIE_CLASS_TYPE_INFO(BIE::BIEACG) BIE_CLASS_EXPORT_KEY(BIE::BIEACG) #endif