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/Tessellation.h // This is really -*- C++ -*- #ifndef Tessellation_h #define Tessellation_h #include <string> #include <iostream> #include "Tile.h" #include "Node.h" #include "RecordInputStream.h" #include "Serializable.h" using namespace std; namespace BIE { class twodcoords: public Serializable { public: twodcoords(){}; twodcoords(double px, double py): x(px), y(py){} double x; double y; // 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(Serializable); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(x); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(y); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; //+ CLICLASS Tessellation class Tessellation: public Serializable { public: Tessellation() {}; virtual ~Tessellation() {}; virtual Tile* GetTile(int tileid); virtual void FindAll(double x, double y, vector<int> &found); virtual vector<int> GetRootTiles() = 0; virtual vector<Node*> GetRootNodes() = 0; //+ CLIMETHOD bool IsValidTileID int virtual bool IsValidTileID(int tileid); //+ CLIMETHOD int MinID virtual int MinID() { return 0; } //+ CLIMETHOD int MaxID virtual int MaxID() { return NumberTiles() - 1; } //+ CLIMETHOD int NumberTiles virtual int NumberTiles(); void PrintPreOrder(vector<Node*> rootnodes, ostream & outputstream); void PrintPreOrder(ostream & outputstream); void GetLimits(double &x1, double &x2, double &y1, double &y2) { x1 = Xmin; x2 = Xmax; y1 = Ymin; y2 = Ymax; } protected: double Xmin, Xmax; double Ymin, Ymax; map<int, Tile*> _tiles; int Ntiles; void PrintPreOrder(Node *tree, ostream & outputstream); void findall(double, double, vector<int>&, Node*); void compute_sampling (RecordInputStream *, vector<twodcoords>*, double pts, double minx, double maxx, double miny, double maxy); struct compx { bool operator() (const twodcoords &a, const twodcoords &b) const { return a.x<b.x; } }; compx compX; struct compy { bool operator()(const twodcoords &a, const twodcoords &b) const { return a.y<b.y; } }; compy compY; struct compxy { bool operator()(const twodcoords &a, const twodcoords &b) const { return a.x == b.x && a.y == b.y; } }; struct hashCoords { size_t operator()( const twodcoords &a) const { size_t res = 0; size_t len = sizeof(a); const char* p = reinterpret_cast<const char*>(&a); while (len--) res = (res<<2)^*p++; return res; } }; // 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(Serializable); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Xmin); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Xmax); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Ymin); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Ymax); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(_tiles); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(Ntiles); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } // namespace BIE BIE_CLASS_TYPE_INFO(BIE::twodcoords) BIE_CLASS_EXPORT_KEY(BIE::twodcoords) BIE_CLASS_EXPORT_KEY(BIE::Tessellation) #endif