#include <vgtl_tree.h>
Inheritance diagram for _Tree_node< _Tp, _Ctr, _Iterator >:
Public Methods | |
_Tree_node () | |
void | initialize () |
void | get_rid_of () |
void | clear_tree () |
void | clear_children () |
_Ctr_iterator | get_childentry_iterator (_Void_pointer __p) |
template<class _Output_Iterator> void | add_all_children (_Output_Iterator fi, _Self *_parent) |
template<class Compare> void | sort_children (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
template<class Compare> void | sort_parents (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
Public Attributes | |
_Tp | _C_data |
_Void_pointer | _C_parent |
_Ctr | _C_children |
Definition at line 63 of file vgtl_tree.h.
|
standard constructor Definition at line 79 of file vgtl_tree.h. |
|
add all children to parent Definition at line 180 of file vgtl_tree.h. |
|
erase all children entries Definition at line 100 of file vgtl_tree.h. |
|
remove the whole subtree below this node Definition at line 195 of file vgtl_tree.h. |
|
find the iterator into the children container for child Definition at line 104 of file vgtl_tree.h. |
|
remove the children container Reimplemented in _ITree_node< _Tp, _Ctr, _Iterator >. Definition at line 93 of file vgtl_tree.h. |
|
initialize the data structure Reimplemented in _ITree_node< _Tp, _Ctr, _Iterator >. Definition at line 87 of file vgtl_tree.h. |
|
sort the children according to Definition at line 121 of file vgtl_tree.h. |
|
sort the children according to Definition at line 128 of file vgtl_tree.h. |
|
the edges to the children Definition at line 76 of file vgtl_tree.h. |
|
the node data Definition at line 72 of file vgtl_tree.h. |
|
the edge to the parent Definition at line 74 of file vgtl_tree.h. |