#include <vgtl_tree.h>
Public Member Functions | |
_ITree_node () | |
void | initialize () |
void | get_rid_of () |
ctree_data_hook & | data_hook () |
void | clear_tree () |
void | clear_children () |
_Ctr_iterator | get_childentry_iterator (_Void_pointer __p) |
void | add_all_children (_Output_Iterator fi, _Self *_parent) |
void | sort_children (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
void | sort_parents (_Ctr_iterator first, _Ctr_iterator last, Compare comp) |
Public Attributes | |
ctree_data_hook | _C_data_hook |
_Tp | _C_data |
_Void_pointer | _C_parent |
_Ctr | _C_children |
Definition at line 139 of file vgtl_tree.h.
_ITree_node< _Tp, _Ctr, _Iterator >::_ITree_node | ( | ) | [inline] |
standard constructor
Definition at line 151 of file vgtl_tree.h.
void _Tree_node< _Tp, _Ctr, _Iterator >::add_all_children | ( | _Output_Iterator | fi, | |
_Self * | _parent | |||
) | [inline, inherited] |
add all children to parent _parent
. fi
is an iterator to the children container of _parent
Definition at line 181 of file vgtl_tree.h.
void _Tree_node< _Tp , _Ctr , _Iterator >::clear_children | ( | ) | [inline, inherited] |
erase all children entries
Definition at line 101 of file vgtl_tree.h.
void _Tree_node< _Tp, _Ctr, _Iterator >::clear_tree | ( | ) | [inline, inherited] |
remove the whole subtree below this node
Definition at line 196 of file vgtl_tree.h.
ctree_data_hook& _ITree_node< _Tp, _Ctr, _Iterator >::data_hook | ( | ) | [inline] |
return the data of the data hook
Definition at line 172 of file vgtl_tree.h.
_Ctr_iterator _Tree_node< _Tp , _Ctr , _Iterator >::get_childentry_iterator | ( | _Void_pointer | __p | ) | [inline, inherited] |
find the iterator into the children container for child __p
Definition at line 105 of file vgtl_tree.h.
void _ITree_node< _Tp, _Ctr, _Iterator >::get_rid_of | ( | ) | [inline] |
remove the children container
Reimplemented from _Tree_node< _Tp, _Ctr, _Iterator >.
Definition at line 166 of file vgtl_tree.h.
void _ITree_node< _Tp, _Ctr, _Iterator >::initialize | ( | ) | [inline] |
initialize the data structure
Reimplemented from _Tree_node< _Tp, _Ctr, _Iterator >.
Definition at line 159 of file vgtl_tree.h.
void _Tree_node< _Tp , _Ctr , _Iterator >::sort_children | ( | _Ctr_iterator | first, | |
_Ctr_iterator | last, | |||
Compare | comp | |||
) | [inline, inherited] |
sort the children according to comp
Definition at line 122 of file vgtl_tree.h.
void _Tree_node< _Tp , _Ctr , _Iterator >::sort_parents | ( | _Ctr_iterator | first, | |
_Ctr_iterator | last, | |||
Compare | comp | |||
) | [inline, inherited] |
sort the children according to comp
, i.e. do nothing here
Definition at line 129 of file vgtl_tree.h.
_Ctr _Tree_node< _Tp , _Ctr , _Iterator >::_C_children [inherited] |
the edges to the children
Definition at line 77 of file vgtl_tree.h.
_Tp _Tree_node< _Tp , _Ctr , _Iterator >::_C_data [inherited] |
the node data
Definition at line 73 of file vgtl_tree.h.
ctree_data_hook _ITree_node< _Tp, _Ctr, _Iterator >::_C_data_hook |
the data hook for trees with data hook
Definition at line 148 of file vgtl_tree.h.
_Void_pointer _Tree_node< _Tp , _Ctr , _Iterator >::_C_parent [inherited] |
the edge to the parent
Definition at line 75 of file vgtl_tree.h.