|
| TreeRoot (RefineableElement *const &object_pt) |
| Constructor for the (empty) root tree. More...
|
|
| TreeRoot (const TreeRoot &dummy) |
| Broken copy constructor. More...
|
|
void | operator= (const TreeRoot &) |
| Broken assignment operator. More...
|
|
TreeRoot *& | neighbour_pt (const int &direction) |
| Return the pointer to the neighbouring TreeRoots in specified direction. Returns NULL if there's no neighbour in this direction. More...
|
|
bool | is_neighbour_periodic (const int &direction) |
| Return whether the neighbour in the particular direction is periodic. More...
|
|
void | set_neighbour_periodic (const int &direction) |
| Set the neighbour in particular direction to be periodic. More...
|
|
void | set_neighbour_nonperiodic (const int &direction) |
| Set the neighbour in particular direction to be nonperiodic. More...
|
|
unsigned | nneighbour () |
| Return the number of neighbours. More...
|
|
virtual | ~Tree () |
| Destructor. Note: Deleting a tree also deletes the objects associated with its non-leave nodes. More...
|
|
| Tree (const Tree &dummy) |
| Broken copy constructor. More...
|
|
void | operator= (const Tree &) |
| Broken assignment operator. More...
|
|
RefineableElement * | object_pt () const |
| Return the pointer to the object (RefineableElement) represented by the tree. More...
|
|
void | flush_object () |
| Flush the object represented by the tree. More...
|
|
Tree * | son_pt (const int &son_index) const |
| Return pointer to the son for a given index. Note that to aid code readability specific enums have been defined for specific trees. However, these are simply aliases for ints and the general interface can be implemented once, here. More...
|
|
void | set_son_pt (const Vector< Tree *> &son_pt) |
| Set vector of pointers to sons, indexed by the appropriate enum that identies son types. (To aid code readability specific enums have been defined for specific trees. However, these are simply aliases for ints and the general interface can be implemented once, here). More...
|
|
unsigned | nsons () const |
| Return number of sons (zero if it's a leaf node) More...
|
|
void | flush_sons () |
| Flush the sons. More...
|
|
TreeRoot *& | root_pt () |
| Return pointer to root of the tree. More...
|
|
TreeRoot * | root_pt () const |
| Return pointer to root of the tree (const version) More...
|
|
template<class ELEMENT > |
void | split_if_required () |
| If required, split the leaf and create its sons – criterion: bool object_pt()-> to_be_refined() = true. More...
|
|
template<class ELEMENT > |
void | p_refine_if_required (Mesh *&mesh_pt) |
| If required, p-refine the leaf – criterion: bool object_pt()-> to_be_p_refined() = true or bool object_pt()-> to_be_p_unrefined() = true. More...
|
|
void | merge_sons_if_required (Mesh *&mesh_pt) |
| If required, merge the four sons for unrefinement – criterion: bool object_pt()-> sons_to_be_unrefined() = true. More...
|
|
void | deactivate_object () |
| Call the RefineableElement's deactivate_element() function. More...
|
|
virtual Tree * | construct_son (RefineableElement *const &object_pt, Tree *const &father_pt, const int &son_type)=0 |
| A function that constructs a specific type of tree. This MUST be overloaded for each specific tree type. The use of such a function allows the generic implementation of split_if_required(). More...
|
|
void | traverse_all (Tree::VoidMemberFctPt member_function) |
| Traverse the tree and execute void Tree member function member_function() at all its "nodes". More...
|
|
void | traverse_all (Tree::VoidMeshPtArgumentMemberFctPt member_function, Mesh *&mesh_pt) |
| Traverse the tree and excute void Tree member function that takes a pointer to a mesh as an argument. More...
|
|
void | traverse_all_but_leaves (Tree::VoidMemberFctPt member_function) |
| Traverse the tree and execute void Tree member function. More...
|
|
void | traverse_leaves (Tree::VoidMemberFctPt member_function) |
| Traverse the tree and execute void Tree member function member_function() only at its leaves. More...
|
|
void | traverse_leaves (Tree::VoidMeshPtArgumentMemberFctPt member_function, Mesh *&mesh_pt) |
| Traverse the tree and execute void Tree member function that takes a pointer to a mesh as an argument only at its leaves. More...
|
|
void | stick_leaves_into_vector (Vector< Tree * > &) |
| Traverse tree and stick pointers to leaf "nodes" (only) into Vector. More...
|
|
void | stick_all_tree_nodes_into_vector (Vector< Tree * > &) |
| Traverse and stick pointers to all "nodes" into Vector. More...
|
|
int | son_type () const |
| Return son type. More...
|
|
bool | is_leaf () |
| Return true if the tree is a leaf node. More...
|
|
Tree * | father_pt () const |
| Return pointer to father: NULL if it's a root node. More...
|
|
void | set_father_pt (Tree *const &father_pt) |
| Set the father. More...
|
|
unsigned | level () const |
| Return the level of the Tree (root=0) More...
|
|
|
typedef void(Tree::* | VoidMemberFctPt) () |
| Function pointer to argument-free void Tree member function. More...
|
|
typedef void(Tree::* | VoidMeshPtArgumentMemberFctPt) (Mesh *&mesh_pt) |
|
static double & | max_neighbour_finding_tolerance () |
| Max. allowed discrepancy in neighbour finding routine (distance between points when identified from two neighbouring elements) More...
|
|
static const int | OMEGA =26 |
| Default value for an unassigned neighbour. More...
|
|
| Tree () |
| Default constructor (empty and broken) More...
|
|
| Tree (RefineableElement *const &object_pt) |
| Default constructor for empty (root) tree: no father, no sons; just pass a pointer to its object Protected because Trees can only be created internally, during the split operation. Only TreeRoots can be created externally. More...
|
|
| Tree (RefineableElement *const &object_pt, Tree *const &father_pt, const int &son_type) |
| Constructor for tree that has a father: Pass it the pointer to its object, the pointer to its father and tell it what type of son it is. Protected because Trees can only be created internally, during the split operation. Only TreeRoots can be created externally. More...
|
|
static double | Max_neighbour_finding_tolerance =1.0e-14 |
| Max. allowed discrepancy in neighbour finding routine (distance between points when identified from two neighbouring elements) More...
|
|
TreeRoot is a Tree that forms the root of a (recursive) tree. The "root node" is special as it holds additional information about its neighbours and their relative rotation (inside a TreeForest).
Definition at line 303 of file tree.h.