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/Node.h // This is really -*- C++ -*- #ifndef Node_h #define Node_h #include <cstddef> // for NULL #include <vector> #include <iostream> #include "Serializable.h" using namespace std; namespace BIE { class Tile; class Node: public Serializable { public: Node(); Node(Tile* t, int tileid, int depth, int numchildren); Node * copytree(int tileidoffset = 0); int ID() { return tileid; }; Tile* GetTile() { return tile; } void print(ostream & outputstream); Node * First(); Node * Last(); Node * CurrentItem(); Node * Next(); bool IsDone(); void Reset(); protected: vector<Node*> children; private: Tile *tile; int tileid; int depth; int childindex; // 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(children); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(tile); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(tileid); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(depth); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } try { ar & BOOST_SERIALIZATION_NVP(childindex); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; class BinaryNode : public Node { public: BinaryNode() : Node() { children = vector<Node*>(2, static_cast<Node*>(NULL)); } BinaryNode(Tile* t, int tid, int d) : Node(t, tid, d, 2) {} void setLeft(Node* l) { children[0] = l; } void setRight(Node* r) { children[1] = r; } // 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(Node); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; class QuadNode : public Node { public: QuadNode() : Node() { children = vector<Node*>(4, static_cast<Node*>(NULL)); } QuadNode(Tile* t, int tid, int d) : Node(t, tid, d, 4) {} void setNorthEast(Node* n) { children[0] = n; } void setSouthEast(Node* n) { children[1] = n; } void setSouthWest(Node* n) { children[2] = n; } void setNorthWest(Node* n) { children[3] = n; } // 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(Node); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; class MonoNode : public Node { public: MonoNode() : Node() { children = vector<Node*>(1, static_cast<Node*>(NULL)); } MonoNode(Tile* t, int tid, int d) : Node(t, tid, d, 1) {} void setChild(Node* n) { children[0] = n; } // 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(Node); BIE_CATCH_BOOST_SERIALIZATION_EXCEPTION; } this->post_serialize(ar, version); } }; } // namespace BIE BIE_CLASS_TYPE_INFO(BIE::Node) BIE_CLASS_TYPE_INFO(BIE::BinaryNode) BIE_CLASS_TYPE_INFO(BIE::QuadNode) BIE_CLASS_TYPE_INFO(BIE::MonoNode) BIE_CLASS_EXPORT_KEY(BIE::Node) BIE_CLASS_EXPORT_KEY(BIE::BinaryNode) BIE_CLASS_EXPORT_KEY(BIE::QuadNode) BIE_CLASS_EXPORT_KEY(BIE::MonoNode) #endif