#include <vgtl_tree.h>
Inheritance diagram for atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >:
Public Types | |
typedef _Tree_iterator< _Tp, _Tp &, _Tp *, container_type, children_iterator, node_type > | iterator |
typedef _Tree_iterator< _Tp, const _Tp &, const _Tp *, container_type, children_iterator, node_type > | const_iterator |
typedef _Tree_walker< _Tp, _Tp &, _Tp *, container_type, children_iterator, _Node > | iterative_walker |
typedef _Tree_walker< _Tp, const _Tp &, const _Tp *, container_type, children_iterator, _Node > | const_iterative_walker |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef _I | children_iterator |
typedef __one_iterator< void * > | parents_iterator |
Public Methods | |
_Self & | operator= (_Node *__x) |
void | insert (const __walker_base &__position, const _Tp &__x, const _Key &__k) |
void | insert (const __walker_base &__position, const _Key &__k) |
iterative_walker | root (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) |
const_iterative_walker | root (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) const |
iterative_walker | through () |
const_iterative_walker | through () const |
iterative_walker | begin (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) |
const_iterative_walker | begin (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) const |
iterative_walker | end (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) |
const_iterative_walker | end (walker_type wt=cw_pre_post, bool front_to_back=true, bool depth_first=true) const |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
size_type | size () const |
reference | getroot () |
const_reference | getroot () const |
size_type | depth (const iterative_walker &__position) |
walker | root (children_iterator __it) |
const_walker | root (children_iterator __it) const |
walker | root () |
const_walker | root () const |
iterator | begin () |
const_iterator | begin () const |
iterator | end () |
const_iterator | end () const |
walker | ground () |
const_walker | ground () const |
void | clear_children () |
template<class _Output_Iterator> void | add_all_children (_Output_Iterator fi, _Node *_parent) |
Protected Methods | |
_Node * | _C_get_node () |
void | _C_put_node (_Node *__p) |
void | _C_put_node (_Node *__p) |
Protected Attributes | |
_Node * | _C_node |
Friends | |
bool | operator==__VGTL_NULL_TMPL_ARGS (const __ITree &__x, const __ITree &__y) |
Definition at line 1769 of file vgtl_graph.h.
|
|
the const iterative walker Definition at line 2064 of file vgtl_tree.h. |
|
the const iterator Definition at line 2059 of file vgtl_tree.h. |
|
the const reverse iterator Definition at line 2068 of file vgtl_tree.h. |
|
the iterative walker Definition at line 2062 of file vgtl_tree.h. |
|
the iterator Definition at line 2057 of file vgtl_tree.h. |
|
|
the reverse iterator Definition at line 2070 of file vgtl_tree.h. |
|
allocate a new node Definition at line 1374 of file vgtl_tree.h. |
|
deallocate a node Definition at line 1377 of file vgtl_tree.h. |
|
deallocate a node Definition at line 1377 of file vgtl_tree.h. |
|
add all children to the parent |
|
return a const iterator to the first node in walk Definition at line 1972 of file vgtl_tree.h. |
|
return an iterator to the first node in walk Definition at line 1963 of file vgtl_tree.h. |
|
the const walker to the first node of the complete walk Definition at line 2128 of file vgtl_tree.h. |
|
the walker to the first node of the complete walk Definition at line 2121 of file vgtl_tree.h. |
|
clear all children of the root node Definition at line 1465 of file vgtl_tree.h. |
|
return the depth of this Definition at line 2176 of file vgtl_tree.h. |
|
return a const iterator beyond the last node in walk Definition at line 1976 of file vgtl_tree.h. |
|
return an iterator beyond the last node in walk Definition at line 1967 of file vgtl_tree.h. |
|
the const walker beyond the last node of the walk Definition at line 2142 of file vgtl_tree.h. |
|
the walker beyond the last node of the walk Definition at line 2136 of file vgtl_tree.h. |
|
get a const reference to the virtual root node Definition at line 2173 of file vgtl_tree.h. |
|
get a reference to the virtual root node Definition at line 2171 of file vgtl_tree.h. |
|
return a const walker to the virtual root node. Definition at line 1942 of file vgtl_tree.h. |
|
return a walker to the virtual root node. Definition at line 1938 of file vgtl_tree.h. |
|
Insert a node with default data and key Definition at line 2747 of file vgtl_tree.h. |
|
Insert a node with data Definition at line 2721 of file vgtl_tree.h. |
|
assign a tree from one node -> make this node the root node. This is useful for making trees out of erased subtrees. Reimplemented from __Tree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc >. Definition at line 2712 of file vgtl_tree.h. |
|
return a const reverse iterator to the first node in walk Definition at line 2157 of file vgtl_tree.h. |
|
return a reverse iterator to the first node in walk Definition at line 2150 of file vgtl_tree.h. |
|
return a const reverse iterator beyond the last node in walk Definition at line 2160 of file vgtl_tree.h. |
|
return a reverse iterator beyond the last node in walk Definition at line 2153 of file vgtl_tree.h. |
|
return a const walker to the first non-virtual tree root Definition at line 1959 of file vgtl_tree.h. |
|
return a walker to the first non-virtual tree root Definition at line 1956 of file vgtl_tree.h. |
|
return a const walker to a root node. Definition at line 1951 of file vgtl_tree.h. |
|
return a walker to a root node. Definition at line 1946 of file vgtl_tree.h. |
|
return a const iterative walker of type Definition at line 2105 of file vgtl_tree.h. |
|
return an iterative walker of type Definition at line 2098 of file vgtl_tree.h. |
|
return the size of the tree (# of nodes) Definition at line 2164 of file vgtl_tree.h. |
|
the const walker beyond the complete walk Definition at line 2116 of file vgtl_tree.h. |
|
the walker beyond the complete walk Definition at line 2112 of file vgtl_tree.h. |
|
comparison operator |
|
This is the node Definition at line 1386 of file vgtl_tree.h. |