atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc > Class Template Reference
[Classes and types for external use]

$n$-ary forest with labelled edges More...

#include <vgtl_tree.h>

Inheritance diagram for atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >:

Inheritance graph
[legend]
Collaboration diagram for atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >:

Collaboration graph
[legend]

List of all members.

Public Types

typedef _Node node_type
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 pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > 		children_iterator
typedef __one_iterator< void * > parents_iterator
typedef _RTree_walker< _Tp,
_Tp &, _Tp *, container_type,
children_iterator, node_type > 		walker
typedef _RTree_walker< _Tp,
const _Tp &, const _Tp
*, container_type,
children_iterator, node_type > 		const_walker
typedef _Tp value_type
typedef _Node node_type
typedef value_type * pointer
typedef const value_type * const_pointer
typedef value_type & reference
typedef const value_type & const_reference
typedef size_t size_type
typedef ptrdiff_t difference_type
typedef _Tree_iterator< _Tp,
_Tp &, _Tp *, container_type,
container_iterator > 		iterator
typedef _Tree_iterator< _Tp,
const _Tp &, const _Tp
*, container_type,
container_iterator > 		const_iterator
typedef reverse_iterator
< const_iterator > 		const_reverse_iterator
typedef 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 pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > 		children_iterator
typedef _TI children_iterator
typedef __one_iterator< void * > parents_iterator
typedef __one_iterator< void * > parents_iterator
typedef _Tp value_type
typedef value_type * pointer
typedef const value_type * const_pointer
typedef value_type & reference
typedef const value_type & const_reference
typedef size_t size_type
typedef ptrdiff_t difference_type

Public Member Functions

_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)
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 _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)
_ITree_node< _Tp, _AssocCtr
< _Key, void *, _Compare,
_PtrAlloc >, pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > > * 		erase_tree (const __walker_base &__position)
bool erase_child (const __walker_base &__position, const children_iterator &__It)
_ITree_node< _Tp, _AssocCtr
< _Key, void *, _Compare,
_PtrAlloc >, pair_adaptor
< _AssocCtr< _Key, void
*, _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 _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, _AssocCtr
< _Key, void *, _Compare,
_PtrAlloc >, pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > > * 		erase_subtree (const __walker_base &__position, const children_iterator &__It)
size_type depth (const recursive_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 Member Functions

_ITree_node< _Tp, _AssocCtr
< _Key, void *, _Compare,
_PtrAlloc >, pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > > * 		_C_create_node (const _Tp &__x)
_ITree_node< _Tp, _AssocCtr
< _Key, void *, _Compare,
_PtrAlloc >, pair_adaptor
< _AssocCtr< _Key, void
*, _Compare, _PtrAlloc >
::iterator > > * 		_C_create_node ()
_Node * _C_get_node ()
void _C_put_node (_Node *__p)
void _C_put_node (_Node *__p)
_Node * _C_create_node (const _Tp &__x)
_Node * _C_create_node ()
void _C_put_node (_Node *__p)
void _C_put_node (_Node *__p)
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)

Detailed Description

template<class _Tp, template< class __Key, class __Ty, class __Compare, class __AllocT > class _AssocCtr = multimap, class _Key = string, class _Compare = less<_Key>, class _PtrAlloc = __VGTL_DEFAULT_ALLOCATOR(void *), class _Alloc = __VGTL_DEFAULT_ALLOCATOR(_Tp)>
class atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >

This class constructs an $n$-ary forest with data hooks and labelled edges. By default, the children are collected in a STL multimap, but the container can be replaced by any other associative map container.

Definition at line 1770 of file vgtl_graph.h.

Member Typedef Documentation

template<class _Tp, class _Ctr, class _TI, class _Alloc>
typedef _TI _Tree_base< _Tp, _Ctr, _TI, _Alloc >::children_iterator [inherited]

iterator for accessing the children

Reimplemented in __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >, __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >, __Tree_t< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Tree_node< _Key,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _ITree_node< _Key,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Tree_node< _Tp,_SequenceCtr< void *, _PtrAlloc >,_SequenceCtr< void *, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _ITree_node< _Tp,_SequenceCtr< void *, _PtrAlloc >,_SequenceCtr< void *, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >, and __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _ITree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1445 of file vgtl_tree.h.

typedef pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::children_iterator [inherited]

iterator for accessing the children

Reimplemented from _Tree_base< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1563 of file vgtl_tree.h.

typedef pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::children_iterator [inherited]

iterator for accessing the children

Reimplemented from _Tree_base< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1563 of file vgtl_tree.h.

typedef _Tree_walker<_Tp ,const _Tp &,const _Tp *,container_type,children_iterator,_Node> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_iterative_walker [inherited]

the const iterative walker

Definition at line 2065 of file vgtl_tree.h.

typedef _Tree_iterator<_Tp ,const _Tp &,const _Tp *,container_type,container_iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_iterator [inherited]

the const iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1263 of file vgtl_graph.h.

typedef _Tree_iterator<_Tp ,const _Tp &,const _Tp *,container_type,children_iterator,node_type> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_iterator [inherited]

the const iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 2060 of file vgtl_tree.h.

typedef const value_type* __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_pointer [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1251 of file vgtl_graph.h.

typedef const value_type* __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::const_pointer [inherited]

standard typedef

Definition at line 1578 of file vgtl_tree.h.

typedef const value_type& __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_reference [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1253 of file vgtl_graph.h.

typedef const value_type& __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::const_reference [inherited]

standard typedef

Definition at line 1580 of file vgtl_tree.h.

typedef reverse_iterator<const_iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_reverse_iterator [inherited]

the const reverse iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1266 of file vgtl_graph.h.

typedef std::reverse_iterator<const_iterator> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_reverse_iterator [inherited]

the const reverse iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 2069 of file vgtl_tree.h.

typedef _Tree_walker<_Tp ,const _Tp &,const _Tp *,container_type,container_iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::const_walker [inherited]

the (recursive) const walker

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1278 of file vgtl_graph.h.

typedef _RTree_walker<_Tp ,const _Tp &,const _Tp *,container_type,children_iterator,node_type> __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::const_walker [inherited]

the (recursive) const walker

Definition at line 1614 of file vgtl_tree.h.

typedef ptrdiff_t __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::difference_type [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1255 of file vgtl_graph.h.

typedef ptrdiff_t __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::difference_type [inherited]

standard typedef

Definition at line 1582 of file vgtl_tree.h.

typedef _Tree_walker<_Tp ,_Tp &,_Tp *,container_type,children_iterator,_Node> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::iterative_walker [inherited]

the iterative walker

Definition at line 2063 of file vgtl_tree.h.

typedef _Tree_iterator<_Tp ,_Tp &,_Tp *,container_type,container_iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::iterator [inherited]

the iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1262 of file vgtl_graph.h.

typedef _Tree_iterator<_Tp ,_Tp &,_Tp *,container_type,children_iterator,node_type> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::iterator [inherited]

the iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 2058 of file vgtl_tree.h.

typedef _Node __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::node_type [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1249 of file vgtl_graph.h.

typedef _Node __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::node_type [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 2055 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _TI, class _Alloc>
typedef __one_iterator<void *> _Tree_base< _Tp, _Ctr, _TI, _Alloc >::parents_iterator [inherited]

iterator for accessing the parents

Reimplemented in __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >, __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >, __Tree_t< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Tree_node< _Key,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _ITree_node< _Key,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >,_AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Tree_node< _Tp,_SequenceCtr< void *, _PtrAlloc >,_SequenceCtr< void *, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _ITree_node< _Tp,_SequenceCtr< void *, _PtrAlloc >,_SequenceCtr< void *, _PtrAlloc >::iterator >, _Alloc >, __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >, and __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _ITree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1447 of file vgtl_tree.h.

typedef __one_iterator<void *> __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::parents_iterator [inherited]

iterator for accessing the parents

Reimplemented from _Tree_base< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1564 of file vgtl_tree.h.

typedef __one_iterator<void *> __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::parents_iterator [inherited]

iterator for accessing the parents

Reimplemented from _Tree_base< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1564 of file vgtl_tree.h.

typedef value_type* __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::pointer [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1250 of file vgtl_graph.h.

typedef value_type* __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::pointer [inherited]

standard typedef

Definition at line 1577 of file vgtl_tree.h.

typedef value_type& __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::reference [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1252 of file vgtl_graph.h.

typedef value_type& __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::reference [inherited]

standard typedef

Definition at line 1579 of file vgtl_tree.h.

typedef reverse_iterator<iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::reverse_iterator [inherited]

the reverse iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1267 of file vgtl_graph.h.

typedef std::reverse_iterator<iterator> __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::reverse_iterator [inherited]

the reverse iterator

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _ITree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 2071 of file vgtl_tree.h.

typedef size_t __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::size_type [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1254 of file vgtl_graph.h.

typedef size_t __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::size_type [inherited]

standard typedef

Definition at line 1581 of file vgtl_tree.h.

typedef _Tp __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::value_type [inherited]

standard typedef

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1248 of file vgtl_graph.h.

typedef _Tp __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::value_type [inherited]

standard typedef

Definition at line 1575 of file vgtl_tree.h.

typedef _Tree_walker<_Tp ,_Tp &,_Tp *,container_type,container_iterator> __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::walker [inherited]

the (recursive) walker

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1277 of file vgtl_graph.h.

typedef _RTree_walker<_Tp ,_Tp &,_Tp *,container_type,children_iterator,node_type> __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::walker [inherited]

the (recursive) walker

Definition at line 1612 of file vgtl_tree.h.

Member Function Documentation

_Node* __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::_C_create_node (  )  [inline, protected, inherited]

construct a new tree node containing default data

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1308 of file vgtl_graph.h.

_Node* __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::_C_create_node ( const _Tp &  __x  )  [inline, protected, inherited]

construct a new tree node containing data __x

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1295 of file vgtl_graph.h.

_ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > * __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::_C_create_node (  )  [inline, protected, inherited]

construct a new tree node containing default data

Definition at line 1641 of file vgtl_tree.h.

_ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > * __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::_C_create_node ( const _Tp &  __x  )  [inline, protected, inherited]

construct a new tree node containing data __x

Definition at line 1629 of file vgtl_tree.h.

_Node* _Tree_alloc_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Node , _IsStatic >::_C_get_node (  )  [inline, protected, inherited]

allocate a new node

Definition at line 1375 of file vgtl_tree.h.

void _Tree_alloc_base< _Tp , _Ctr , _TI , _Alloc , _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

void _Tree_alloc_base< _Tp , _Ctr , _TI , _Node , _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _TI, class _Allocator, bool _IsStatic>
void _Tree_alloc_base< _Tp, _Ctr, _TI, _Allocator, _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

void _Tree_alloc_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Node , _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _TI, class _Allocator, bool _IsStatic>
void _Tree_alloc_base< _Tp, _Ctr, _TI, _Allocator, _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

void _Tree_alloc_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Node , _IsStatic >::_C_put_node ( _Node *  __p  )  [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _TI, class _Alloc>
template<class _Output_Iterator >
void _Tree_base< _Tp, _Ctr, _TI, _Alloc >::add_all_children ( _Output_Iterator  fi,
_Node *  _parent 
) [inline, inherited]

add all children to the parent _parent. fi is a iterator to the children container of the parent

void _Tree_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > >::add_all_children ( _Output_Iterator  fi,
_Node *  _parent 
) [inline, inherited]

add all children to the parent _parent. fi is a iterator to the children container of the parent

void _Tree_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > >::add_all_children ( _Output_Iterator  fi,
_Node *  _parent 
) [inline, inherited]

add all children to the parent _parent. fi is a iterator to the children container of the parent

const_iterator __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::begin (  )  const [inline, inherited]

return a const iterator to the first node in walk

Definition at line 1973 of file vgtl_tree.h.

iterator __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::begin (  )  [inline, inherited]

return an iterator to the first node in walk

Definition at line 1964 of file vgtl_tree.h.

const_iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::begin ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) const [inline, inherited]

the const walker to the first node of the complete walk

Definition at line 2129 of file vgtl_tree.h.

iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::begin ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) [inline, inherited]

the walker to the first node of the complete walk

Definition at line 2122 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::clear (  )  [inline, inherited]

empty the tree

Reimplemented from _Tree_base< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1817 of file vgtl_tree.h.

void _Tree_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > >::clear_children (  )  [inline, inherited]

clear all children of the root node

Definition at line 1466 of file vgtl_tree.h.

size_type __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::depth ( const recursive_walker &  __position  )  [inline, inherited]

return the depth of node __position in the tree

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1529 of file vgtl_graph.h.

size_type __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::depth ( const walker &  __position  )  [inline, inherited]

return the depth of node __position in the tree

Definition at line 1805 of file vgtl_tree.h.

size_type __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::depth ( const iterative_walker &  __position  )  [inline, inherited]

return the depth of this __position in the tree

Definition at line 2177 of file vgtl_tree.h.

bool __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::empty (  )  const [inline, inherited]

is the tree empty?

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1392 of file vgtl_graph.h.

bool __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::empty (  )  const [inline, inherited]

is the tree empty?

Definition at line 1657 of file vgtl_tree.h.

const_iterator __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::end (  )  const [inline, inherited]

return a const iterator beyond the last node in walk

Definition at line 1977 of file vgtl_tree.h.

iterator __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::end (  )  [inline, inherited]

return an iterator beyond the last node in walk

Definition at line 1968 of file vgtl_tree.h.

const_iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::end ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) const [inline, inherited]

the const walker beyond the last node of the walk

Definition at line 2143 of file vgtl_tree.h.

iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::end ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) [inline, inherited]

the walker beyond the last node of the walk

Definition at line 2137 of file vgtl_tree.h.

void __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::erase ( const __walker_base &  __position  )  [inline, inherited]

erase the node at position __position.

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1444 of file vgtl_graph.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase ( const __walker_base &  __position  )  [inline, inherited]

erase the node at position __position.

Definition at line 1713 of file vgtl_tree.h.

bool __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase_child ( const __walker_base &  __position,
const children_iterator &  __It 
) [inline, inherited]

erase the (leaf) child __It of node __position. This works if and only if the child is a leaf.

Definition at line 1770 of file vgtl_tree.h.

bool __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase_child ( const __walker_base &  __position,
const children_iterator &  __It 
) [inline, inherited]

erase the (leaf) child __It of node __position. This works if and only if the child is a leaf.

Definition at line 1770 of file vgtl_tree.h.

_Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > * __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase_subtree ( const __walker_base &  __position,
const children_iterator &  __It 
) [inline, inherited]

erase the subtree position __position, whose top node is the child at children_iterator position __It, and return its top node.

Definition at line 1790 of file vgtl_tree.h.

_ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > * __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase_subtree ( const __walker_base &  __position,
const children_iterator &  __It 
) [inline, inherited]

erase the subtree position __position, whose top node is the child at children_iterator position __It, and return its top node.

Definition at line 1790 of file vgtl_tree.h.

_Node* __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::erase_tree ( const __walker_base &  __position  )  [inline, inherited]

erase the subtree starting at position __position, and return its top node.

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1471 of file vgtl_graph.h.

_ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > * __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::erase_tree ( const __walker_base &  __position  )  [inline, inherited]

erase the subtree starting at position __position, and return its top node.

Definition at line 1743 of file vgtl_tree.h.

allocator_type __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::get_allocator (  )  const [inline, inherited]

construct an allocator object

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1259 of file vgtl_graph.h.

allocator_type __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::get_allocator (  )  const [inline, inherited]

construct an allocator object

Reimplemented from _Tree_alloc_base< _Tp, _Ctr, _TI, _Allocator, _IsStatic >.

Definition at line 1587 of file vgtl_tree.h.

const_reference __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::getroot (  )  const [inline, inherited]

get a const reference to the virtual root node

Definition at line 2174 of file vgtl_tree.h.

reference __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::getroot (  )  [inline, inherited]

get a reference to the virtual root node

Definition at line 2172 of file vgtl_tree.h.

const_walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::ground (  )  const [inline, inherited]

return a const walker to the virtual root node.

Definition at line 1943 of file vgtl_tree.h.

walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::ground (  )  [inline, inherited]

return a walker to the virtual root node.

Definition at line 1939 of file vgtl_tree.h.

template<class _Tp , template< class __Key, class __Ty, class __Compare, class __AllocT > class _AssocCtr = multimap, class _Key = string, class _Compare = less<_Key>, class _PtrAlloc = __VGTL_DEFAULT_ALLOCATOR(void *), class _Alloc = __VGTL_DEFAULT_ALLOCATOR(_Tp)>
void atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >::insert ( const __walker_base &  __position,
const _Key &  __k 
) [inline]

Insert a node with default data and key __k at position __position.

Definition at line 2748 of file vgtl_tree.h.

template<class _Tp , template< class __Key, class __Ty, class __Compare, class __AllocT > class _AssocCtr = multimap, class _Key = string, class _Compare = less<_Key>, class _PtrAlloc = __VGTL_DEFAULT_ALLOCATOR(void *), class _Alloc = __VGTL_DEFAULT_ALLOCATOR(_Tp)>
void atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >::insert ( const __walker_base &  __position,
const _Tp &  __x,
const _Key &  __k 
) [inline]

Insert a node with data __x and key _k at position __position.

Definition at line 2722 of file vgtl_tree.h.

void __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::insert_child ( const __walker_base &  __position,
const container_insert_arg &  __It 
) [inline, inherited]

add a child below __position with default data, at the __It position in the __position - node's children container

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1415 of file vgtl_graph.h.

void __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::insert_child ( const __walker_base &  __position,
const _Tp &  __x,
const container_insert_arg &  __It 
) [inline, inherited]

add a child below __position with data __x, at the __It position in the __position - node's children container

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1409 of file vgtl_graph.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_child ( const __walker_base &  __position,
const container_insert_arg &  __It 
) [inline, inherited]

add a child below __position with default data, at the __It position in the __position - node's children container

Definition at line 1676 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_child ( const __walker_base &  __position,
const _Tp &  __x,
const container_insert_arg &  __It 
) [inline, inherited]

add a child below __position with data __x, at the __It position in the __position - node's children container

Definition at line 1668 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_children ( const __walker_base &  __position,
size_type  __n,
const _Tp &  __x,
const children_iterator &  __It 
) [inline, inherited]

add __n children below __position with data __x, after the __It position in the __position - node's children container

Definition at line 1682 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_children ( const __walker_base &  __position,
size_type  __n,
const _Tp &  __x,
const children_iterator &  __It 
) [inline, inherited]

add __n children below __position with data __x, after the __It position in the __position - node's children container

Definition at line 1682 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_subtree ( const __walker_base &  __position,
_Self &  __subtree,
const children_iterator &  __It 
) [inline, inherited]

add a complete subtree __subtree below position __position and children iterator position __It.

Definition at line 1702 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::insert_subtree ( const __walker_base &  __position,
_Self &  __subtree,
const children_iterator &  __It 
) [inline, inherited]

add a complete subtree __subtree below position __position and children iterator position __It.

Definition at line 1702 of file vgtl_tree.h.

size_type __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::max_size (  )  const [inline, inherited]

return the maximum possible size of the tree (theor. infinity)

Reimplemented from __Tree_t< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Tree_node< _Tp,_AssocCtr< _Key, void *, _Compare, _PtrAlloc >,pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > >, _Alloc >.

Definition at line 1400 of file vgtl_graph.h.

size_type __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::max_size (  )  const [inline, inherited]

return the maximum possible size of the tree (theor. infinity)

Definition at line 1660 of file vgtl_tree.h.

template<class _Tp , template< class __Key, class __Ty, class __Compare, class __AllocT > class _AssocCtr = multimap, class _Key = string, class _Compare = less<_Key>, class _PtrAlloc = __VGTL_DEFAULT_ALLOCATOR(void *), class _Alloc = __VGTL_DEFAULT_ALLOCATOR(_Tp)>
_Self& atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >::operator= ( _Node *  __x  )  [inline]

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 2713 of file vgtl_tree.h.

const_reverse_iterator __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::rbegin (  )  const [inline, inherited]

return a const reverse iterator to the first node in walk

Definition at line 2158 of file vgtl_tree.h.

reverse_iterator __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::rbegin (  )  [inline, inherited]

return a reverse iterator to the first node in walk

Definition at line 2151 of file vgtl_tree.h.

const_reverse_iterator __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::rend (  )  const [inline, inherited]

return a const reverse iterator beyond the last node in walk

Definition at line 2161 of file vgtl_tree.h.

reverse_iterator __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::rend (  )  [inline, inherited]

return a reverse iterator beyond the last node in walk

Definition at line 2154 of file vgtl_tree.h.

const_walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root (  )  const [inline, inherited]

return a const walker to the first non-virtual tree root

Definition at line 1960 of file vgtl_tree.h.

walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root (  )  [inline, inherited]

return a walker to the first non-virtual tree root

Definition at line 1957 of file vgtl_tree.h.

const_walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root ( children_iterator  __it  )  const [inline, inherited]

return a const walker to a root node.

Definition at line 1952 of file vgtl_tree.h.

walker __Tree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root ( children_iterator  __it  )  [inline, inherited]

return a walker to a root node.

Definition at line 1947 of file vgtl_tree.h.

const_iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) const [inline, inherited]

return a const iterative walker of type wt to the ground node

Definition at line 2106 of file vgtl_tree.h.

iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::root ( walker_type  wt = cw_pre_post,
bool  front_to_back = true,
bool  depth_first = true 
) [inline, inherited]

return an iterative walker of type wt to the ground node

Definition at line 2099 of file vgtl_tree.h.

size_type __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::size (  )  const [inline, inherited]

return the size of the tree (# of nodes)

Definition at line 2165 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Tree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::swap ( _Self &  __x  )  [inline, inherited]

swap two trees

Definition at line 1663 of file vgtl_tree.h.

void __Tree_t< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _ITree_node< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > > , _Alloc >::swap ( _Self &  __x  )  [inline, inherited]

swap two trees

Definition at line 1663 of file vgtl_tree.h.

const_iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::through (  )  const [inline, inherited]

the const walker beyond the complete walk

Definition at line 2117 of file vgtl_tree.h.

iterative_walker __ITree< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Key , _Alloc >::through (  )  [inline, inherited]

the walker beyond the complete walk

Definition at line 2113 of file vgtl_tree.h.

Friends And Related Function Documentation

bool operator==__VGTL_NULL_TMPL_ARGS ( const __ITree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc > &  __x,
const __ITree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc > &  __y 
) [friend, inherited]

comparison operator

Member Data Documentation

_Node* _Tree_alloc_base< _Tp , _AssocCtr< _Key, void *, _Compare, _PtrAlloc > , pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator > , _Node , _IsStatic >::_C_node [protected, inherited]

This is the node

Definition at line 1387 of file vgtl_tree.h.

The documentation for this class was generated from the following files:
Generated on Tue Feb 9 14:42:42 2010 for Vienna Graph Template Library by  doxygen 1.5.8