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/Frontier.h // This is really -*- C++ -*- #ifndef Frontier_h #define Frontier_h #include <string> #include <algorithm> #include "Serializable.h" #include "BIEmpi.h" #include "Node.h" #include "Tessellation.h" #include "FrontierExpansionHeuristic.h" namespace BIE { class FrontierExpansionHeuristic; //+ CLICLASS Frontier class Frontier: public Serializable { public: Frontier(Tessellation * tess); Frontier(const Frontier*); //+ CLIMETHOD Frontier* Copy Frontier* Copy(); /* virtual */ ~Frontier() {}; inline Tessellation * getTessellation() { return frontier_tessellation; } inline vector<int> ExportFrontier() { return frontier_tiles; } //+ CLIMETHOD void RetractToTopLevel void RetractToTopLevel(); //+ CLIMETHOD void UpDownLevels int void UpDownLevels(int n); void Set(vector<int> FrontierState); //+ CLIMETHOD bool IncreaseResolution FrontierExpansionHeuristic* int //+ CLIMETHOD bool IncreaseResolution FrontierExpansionHeuristic* bool IncreaseResolution (FrontierExpansionHeuristic * heuristic, int numlevels = 1); Node * Find(double x, double y); inline int First(void) { return frontier_tiles[0]; } inline int Last(void) { return frontier_tiles[frontier_tiles.size()-1]; } int Next(void); int CurrentItem(void); inline void Reset(void) { frontier_index = 0; } inline bool IsDone(void) { return (frontier_index == frontier_tiles.size()); } unsigned int Size() { return frontier_tiles.size(); } //+ CLIMETHOD void printSize void printSize() { if (myid==0) cout << "Frontier size=" << frontier_tiles.size() << endl; } inline bool AccumulateMode() { return accumulate_mode; } private: vector<int> frontier_tiles; vector<bool> frontier_infrontier; unsigned int frontier_index; Tessellation * frontier_tessellation; bool accumulate_mode; void ExpandOneLevel(); void ContractOneLevel(); Node * GetNode(int tileid); void EraseFrontier(); void AddToFrontier(int tileid); bool WalkAndAdd(vector<bool>& frontiercopy, int& parentid); vector<int> TrueFrontier(); void TrueFrontier(vector<int>& real_frontier, int& parentid); void RecursivelySelect(Node *node, vector<bool> & nodesetbitvector); Node * FindInTree(Node* node, double x, double y); // AUTO GENERATED BY ../persistence/autopersist.py protected: Frontier() {} 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(frontier_tiles); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(frontier_infrontier); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(frontier_index); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(frontier_tessellation); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(accumulate_mode); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } // namespace BIE BIE_CLASS_TYPE_INFO(BIE::Frontier) BIE_CLASS_EXPORT_KEY(BIE::Frontier) #endif