#include <vgtl_tree.h>
Inheritance diagram for rntree< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >:
Public Types | |
typedef _Tp | value_type |
typedef _Tree_iterator< _Tp, _Tp &, _Tp *, container_type, container_iterator > | iterator |
typedef _Tree_iterator< _Tp, _Tp &, _Tp *, container_type, children_iterator, node_type > | iterator |
typedef _Tree_iterator< _Tp, const _Tp &, const _Tp *, container_type, container_iterator > | const_iterator |
typedef _Tree_iterator< _Tp, const _Tp &, const _Tp *, container_type, children_iterator, node_type > | const_iterator |
typedef reverse_iterator< const_iterator > | const_reverse_iterator |
typedef std::reverse_iterator< const_iterator > | const_reverse_iterator |
typedef reverse_iterator< iterator > | reverse_iterator |
typedef std::reverse_iterator< iterator > | reverse_iterator |
typedef _Tree_walker< _Tp, _Tp &, _Tp *, container_type, container_iterator > | walker |
typedef _Tree_walker< _Tp, const _Tp &, const _Tp *, container_type, container_iterator > | const_walker |
typedef _SequenceCtr< void *, _PtrAlloc >::iterator | children_iterator |
typedef _I | children_iterator |
typedef __one_iterator< void * > | parents_iterator |
typedef __one_iterator< void * > | parents_iterator |
Public Methods | |
void | insert (const __walker_base &__position, const _Tp &__x) |
void | insert (const __walker_base &__position) |
void | push_child (const __walker_base &__position, const _Tp &__x) |
void | push_child (const __walker_base &__position) |
void | push_children (const __walker_base &__position, size_type __n, const _Tp &__x) |
void | push_children (const __walker_base &__position, size_type __n) |
void | unshift_child (const __walker_base &__position, const _Tp &__x) |
void | unshift_child (const __walker_base &__position) |
void | unshift_children (const __walker_base &__position, size_type __n, const _Tp &__x) |
void | unshift_children (const __walker_base &__position, size_type __n) |
void | push_subtree (const __walker_base &__position, _Self &__subtree) |
void | unshift_subtree (const __walker_base &__position, _Self &__subtree) |
bool | pop_child (const __walker_base &__position) |
bool | shift_child (const __walker_base &__position) |
_Node * | pop_subtree (const __walker_base &__position) |
_Node * | shift_subtree (const __walker_base &__position) |
_Self & | operator= (_Node *__x) |
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 |
reverse_iterator | rbegin () |
const_reverse_iterator | rbegin () const |
reverse_iterator | rend () |
const_reverse_iterator | rend () const |
bool | empty () const |
size_type | max_size () const |
reference | getroot () |
const_reference | getroot () const |
void | swap (_Self &__x) |
void | insert_child (const __walker_base &__position, const _Tp &__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 _Tp &__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< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _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 | clear_children () |
void | add_all_children (_Output_Iterator fi, _Node *_parent) |
template<class _Output_Iterator> void | add_all_children (_Output_Iterator fi, _Node *_parent) |
Protected Methods | |
_Node * | _C_create_node (const _Tp &__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 __Tree &__x, const __Tree &__y) |
Definition at line 2508 of file vgtl_tree.h.
|
|
iterator for accessing the children Definition at line 1562 of file vgtl_tree.h. |
|
the const iterator Definition at line 1900 of file vgtl_tree.h. |
|
the const iterator Definition at line 1262 of file vgtl_graph.h. |
|
the const reverse iterator Definition at line 1904 of file vgtl_tree.h. |
|
the const reverse iterator Definition at line 1265 of file vgtl_graph.h. |
|
the (recursive) const walker Definition at line 1277 of file vgtl_graph.h. |
|
the iterator Definition at line 1898 of file vgtl_tree.h. |
|
the iterator Definition at line 1261 of file vgtl_graph.h. |
|
|
iterator for accessing the parents Definition at line 1563 of file vgtl_tree.h. |
|
the reverse iterator Definition at line 1906 of file vgtl_tree.h. |
|
the reverse iterator Definition at line 1266 of file vgtl_graph.h. |
|
standard typedef Definition at line 1247 of file vgtl_graph.h. |
|
the (recursive) walker Definition at line 1276 of file vgtl_graph.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. |
|
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 |
|
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. |
|
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. |
|
is the tree empty? Definition at line 1391 of file vgtl_graph.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. |
|
erase the node at position Definition at line 1443 of file vgtl_graph.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 starting at position Definition at line 1470 of file vgtl_graph.h. |
|
construct an allocator object Definition at line 1258 of file vgtl_graph.h. |
|
get a const reference to the virtual root node Definition at line 1997 of file vgtl_tree.h. |
|
get a reference to the virtual root node Definition at line 1995 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 at position Definition at line 2550 of file vgtl_tree.h. |
|
Insert a node with data Definition at line 2522 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 Definition at line 1681 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. |
|
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, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >. Definition at line 2677 of file vgtl_tree.h. |
|
erase the last (leaf) child of node Definition at line 2619 of file vgtl_tree.h. |
|
erase the subtree position Definition at line 2647 of file vgtl_tree.h. |
|
add a child below Definition at line 2560 of file vgtl_tree.h. |
|
add a child below Definition at line 2555 of file vgtl_tree.h. |
|
add Definition at line 2571 of file vgtl_tree.h. |
|
add Definition at line 2565 of file vgtl_tree.h. |
|
add a complete subtree Definition at line 2599 of file vgtl_tree.h. |
|
return a const reverse iterator to the first node in walk Definition at line 1988 of file vgtl_tree.h. |
|
return a reverse iterator to the first node in walk Definition at line 1981 of file vgtl_tree.h. |
|
return a const reverse iterator beyond the last node in walk Definition at line 1991 of file vgtl_tree.h. |
|
return a reverse iterator beyond the last node in walk Definition at line 1984 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. |
|
erase the first (leaf) child of node Definition at line 2633 of file vgtl_tree.h. |
|
erase the subtree position Definition at line 2662 of file vgtl_tree.h. |
|
swap two trees Definition at line 1404 of file vgtl_graph.h. |
|
add a child below Definition at line 2581 of file vgtl_tree.h. |
|
add a child below Definition at line 2576 of file vgtl_tree.h. |
|
add Definition at line 2592 of file vgtl_tree.h. |
|
add Definition at line 2586 of file vgtl_tree.h. |
|
add a complete subtree Definition at line 2609 of file vgtl_tree.h. |
|
comparison operator |
|
This is the node Definition at line 1386 of file vgtl_tree.h. |