#include <vgtl_tree.h>
Inheritance diagram for stree< _Key, _Compare, _AssocCtr, _PtrAlloc, _Alloc >:
Public Types | |
typedef _Tree_iterator< _Key, _Key &, _Key *, container_type, children_iterator, node_type > | iterator |
typedef _Tree_iterator< _Key, const _Key &, const _Key *, container_type, children_iterator, node_type > | const_iterator |
typedef _Tree_walker< _Key, _Key &, _Key *, container_type, children_iterator, _Node > | iterative_walker |
typedef _Tree_walker< _Key, const _Key &, const _Key *, 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 _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator | children_iterator |
typedef __one_iterator< void * > | parents_iterator |
typedef _Key | value_type |
typedef _RTree_walker< _Key, _Key &, _Key *, container_type, children_iterator, node_type > | walker |
typedef _RTree_walker< _Key, const _Key &, const _Key *, container_type, children_iterator, node_type > | const_walker |
typedef _Key | value_type |
typedef _Tree_iterator< _Key, _Key &, _Key *, container_type, container_iterator > | iterator |
typedef _Tree_iterator< _Key, const _Key &, const _Key *, container_type, container_iterator > | const_iterator |
typedef reverse_iterator< const_iterator > | const_reverse_iterator |
typedef reverse_iterator< iterator > | reverse_iterator |
typedef _Tree_walker< _Key, _Key &, _Key *, container_type, container_iterator > | walker |
typedef _Tree_walker< _Key, const _Key &, const _Key *, container_type, container_iterator > | const_walker |
typedef _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator | children_iterator |
typedef _I | children_iterator |
typedef __one_iterator< void * > | parents_iterator |
typedef __one_iterator< void * > | parents_iterator |
Public Methods | |
_Self & | operator= (_Node *__x) |
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) |
size_type | depth (const walker &__position) |
allocator_type | get_allocator () const |
bool | empty () const |
size_type | max_size () const |
void | swap (_Self &__x) |
void | insert_child (const __walker_base &__position, const _Key &__x, const container_insert_arg &__It) |
void | insert_child (const __walker_base &__position, const container_insert_arg &__It) |
void | insert_children (const __walker_base &__position, size_type __n, const _Key &__x, const children_iterator &__It) |
void | insert_subtree (const __walker_base &__position, _Self &__subtree, const children_iterator &__It) |
void | erase (const __walker_base &__position) |
_ITree_node< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator > * | erase_tree (const __walker_base &__position) |
bool | erase_child (const __walker_base &__position, const children_iterator &__It) |
_ITree_node< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator > * | erase_subtree (const __walker_base &__position, const children_iterator &__It) |
void | clear () |
void | clear_children () |
void | add_all_children (_Output_Iterator fi, _Node *_parent) |
allocator_type | get_allocator () const |
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 |
bool | empty () const |
size_type | max_size () const |
void | swap (_Self &__x) |
void | insert_child (const __walker_base &__position, const _Key &__x, const container_insert_arg &__It) |
void | insert_child (const __walker_base &__position, const container_insert_arg &__It) |
void | insert_children (const __walker_base &__position, size_type __n, const _Key &__x, const children_iterator &__It) |
void | insert_subtree (const __walker_base &__position, _Self &__subtree, const children_iterator &__It) |
void | erase (const __walker_base &__position) |
_Node * | erase_tree (const __walker_base &__position) |
bool | erase_child (const __walker_base &__position, const children_iterator &__It) |
_Tree_node< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator > * | erase_subtree (const __walker_base &__position, const children_iterator &__It) |
size_type | depth (const walker &__position) |
walker | ground () |
const_walker | ground () const |
void | add_all_children (_Output_Iterator fi, _Node *_parent) |
template<class _Output_Iterator> void | add_all_children (_Output_Iterator fi, _Node *_parent) |
Protected Methods | |
_ITree_node< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator > * | _C_create_node (const _Key &__x) |
_ITree_node< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator > * | _C_create_node () |
_Node * | _C_create_node (const _Key &__x) |
_Node * | _C_create_node () |
_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 1817 of file vgtl_graph.h.
|
|
iterator for accessing the children Definition at line 1562 of file vgtl_tree.h. |
|
iterator for accessing the children Definition at line 1562 of file vgtl_tree.h. |
|
the const iterative walker Definition at line 2064 of file vgtl_tree.h. |
|
the const iterator Definition at line 1262 of file vgtl_graph.h. |
|
the const iterator Definition at line 2059 of file vgtl_tree.h. |
|
the const reverse iterator Definition at line 1265 of file vgtl_graph.h. |
|
the const reverse iterator Definition at line 2068 of file vgtl_tree.h. |
|
the (recursive) const walker Definition at line 1277 of file vgtl_graph.h. |
|
the (recursive) const walker Definition at line 1613 of file vgtl_tree.h. |
|
the iterative walker Definition at line 2062 of file vgtl_tree.h. |
|
the iterator Definition at line 1261 of file vgtl_graph.h. |
|
the iterator Definition at line 2057 of file vgtl_tree.h. |
|
|
iterator for accessing the parents Definition at line 1563 of file vgtl_tree.h. |
|
iterator for accessing the parents Definition at line 1563 of file vgtl_tree.h. |
|
the reverse iterator Definition at line 1266 of file vgtl_graph.h. |
|
the reverse iterator Definition at line 2070 of file vgtl_tree.h. |
|
standard typedef Definition at line 1247 of file vgtl_graph.h. |
|
standard typedef Definition at line 1574 of file vgtl_tree.h. |
|
the (recursive) walker Definition at line 1276 of file vgtl_graph.h. |
|
the (recursive) walker Definition at line 1611 of file vgtl_tree.h. |
|
construct a new tree node containing default data Definition at line 1307 of file vgtl_graph.h. |
|
construct a new tree node containing data Definition at line 1294 of file vgtl_graph.h. |
|
construct a new tree node containing default data Definition at line 1640 of file vgtl_tree.h. |
|
construct a new tree node containing data Definition at line 1628 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 |
|
add all children to the parent |
|
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. |
|
empty the tree Definition at line 1816 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 node Definition at line 1525 of file vgtl_graph.h. |
|
return the depth of node Definition at line 1804 of file vgtl_tree.h. |
|
return the depth of this Definition at line 2176 of file vgtl_tree.h. |
|
is the tree empty? Definition at line 1391 of file vgtl_graph.h. |
|
is the tree empty? Definition at line 1656 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. |
|
erase the node at position Definition at line 1443 of file vgtl_graph.h. |
|
erase the node at position Definition at line 1712 of file vgtl_tree.h. |
|
erase the (leaf) child Definition at line 1769 of file vgtl_tree.h. |
|
erase the (leaf) child Definition at line 1769 of file vgtl_tree.h. |
|
erase the subtree position Definition at line 1789 of file vgtl_tree.h. |
|
erase the subtree position Definition at line 1789 of file vgtl_tree.h. |
|
erase the subtree starting at position Definition at line 1470 of file vgtl_graph.h. |
|
erase the subtree starting at position Definition at line 1742 of file vgtl_tree.h. |
|
construct an allocator object Definition at line 1258 of file vgtl_graph.h. |
|
construct an allocator object Definition at line 1586 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. |
|
add a child below Definition at line 1414 of file vgtl_graph.h. |
|
add a child below Definition at line 1408 of file vgtl_graph.h. |
|
add a child below Definition at line 1675 of file vgtl_tree.h. |
|
add a child below Definition at line 1667 of file vgtl_tree.h. |
|
add Definition at line 1681 of file vgtl_tree.h. |
|
add Definition at line 1681 of file vgtl_tree.h. |
|
add a complete subtree Definition at line 1701 of file vgtl_tree.h. |
|
add a complete subtree Definition at line 1701 of file vgtl_tree.h. |
|
return the maximum possible size of the tree (theor. infinity) Definition at line 1399 of file vgtl_graph.h. |
|
return the maximum possible size of the tree (theor. infinity) Definition at line 1659 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< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Alloc >. Definition at line 2779 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. |
|
swap two trees Definition at line 1404 of file vgtl_graph.h. |
|
swap two trees Definition at line 1662 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. |