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/AdaptiveLegeIntegration.h // This is really -*- C++ -*- #ifndef AdaptiveLegeIntegration_h #define AdaptiveLegeIntegration_h #include "gaussQ.h" #include "Integration.h" #include <map> // STL's unique associative map #include "Serializable.h" namespace BIE { //+ CLICLASS AdaptiveLegeIntegration SUPER Integration class AdaptiveLegeIntegration : public Integration { public: static int min_nlb; static int max_nlb; //+ CLICONSTR double double AdaptiveLegeIntegration(double dx, double dy); ~AdaptiveLegeIntegration(); void ParameterChange(double dx, double dy); double NormValue(Model* m, Tile* t, SampleDistribution* d); vector<double> Value(Model* m, Tile* t, SampleDistribution* d); double NormValue(Model* m, Tile* t, SampleDistribution* d, int irank, int nrank); vector<double> Value(Model* m, Tile* t, SampleDistribution* d, int irank, int nrank, MPI_Comm& comm); double NormValue(LikelihoodComputation* p_likelihoodComputation, Model* p_model, Tile* p_tile, SampleDistribution* p_dist); vector<double> Value(LikelihoodComputation* p_likelihoodComputation, Model* p_model, Tile* p_tile, SampleDistribution* p_dist); private: double dx, dy; int nV, nU; LegeQuad *U, *V; // Store the integration cache map<const int, LegeQuad*> table; // Retrieve the integration grid from // the cache or create it if necessary void SetKnots(double X, double Y); // AUTO GENERATED BY ../persistence/autopersist.py protected: AdaptiveLegeIntegration() {} 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(Integration); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(min_nlb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(max_nlb); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(dx); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(dy); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } // namespace BIE BIE_CLASS_TYPE_INFO(BIE::AdaptiveLegeIntegration) BIE_CLASS_EXPORT_KEY(BIE::AdaptiveLegeIntegration) #endif