Main Page   Modules   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members  

__Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > Class Template Reference
[Classes and types for internal use]

Tree base class without data hooks. More...

#include <vgtl_tree.h>

Inheritance diagram for __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >:

Inheritance graph
[legend]
Collaboration diagram for __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >:

Collaboration graph
[legend]
List of all members.

Public Types

typedef _Tp value_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 _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 std::reverse_iterator<
const_iterator > 		const_reverse_iterator
typedef std::reverse_iterator<
iterator > 		reverse_iterator
typedef _Iterator children_iterator
typedef __one_iterator< void * > parents_iterator
typedef _Iterator children_iterator
typedef __one_iterator< void * > parents_iterator

Public Methods

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 erase (const __walker_base &__position)
_Node * erase_tree (const __walker_base &__position)
size_type depth (const walker &__position)
_Self & operator= (const _Self &__x)
 __Tree (const allocator_type &__a=allocator_type())
walker ground ()
const_walker ground () const
walker root (children_iterator __it)
const_walker root (children_iterator __it) const
walker root ()
const_walker root () const
iterator begin ()
iterator end ()
const_iterator begin () const
const_iterator end () const
reverse_iterator rbegin ()
reverse_iterator rend ()
const_reverse_iterator rbegin () const
const_reverse_iterator rend () const
reference getroot ()
const_reference getroot () const
 __Tree (size_type __n, const _Tp &__value, const allocator_type &__a=allocator_type())
 __Tree (size_type __n)
 __Tree (const _Self &__x)
virtual ~__Tree ()
_Self & operator= (const _Self &__x)
_Self & operator= (_Node *__x)
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)
bool erase_child (const __walker_base &__position, const children_iterator &__It)
_Tree_node< _Tp, _Ctr, _Iterator > * erase_subtree (const __walker_base &__position, const children_iterator &__It)
void clear_children ()
void add_all_children (_Output_Iterator fi, _Node *_parent)
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)

Detailed Description

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
class __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >

This is the base class for all trees without data hooks

Definition at line 1233 of file vgtl_graph.h.

Member Typedef Documentation

typedef _Iterator _Tree_base< _Tp, _Ctr, _Iterator, _Alloc >::children_iterator [inherited]
 

iterator for accessing the children

Definition at line 1444 of file vgtl_tree.h.

typedef _Iterator __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >::children_iterator [inherited]
 

iterator for accessing the children

Reimplemented from _Tree_base< _Tp, _Ctr, _Iterator, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1562 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_iterator<_Tp,const _Tp&,const _Tp*,container_type,children_iterator,node_type> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::const_iterator
 

the const iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1900 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_iterator<_Tp,const _Tp&,const _Tp*,container_type,container_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::const_iterator
 

the const iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1262 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef std::reverse_iterator<const_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::const_reverse_iterator
 

the const reverse iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1904 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef reverse_iterator<const_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::const_reverse_iterator
 

the const reverse iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1265 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_walker<_Tp,const _Tp&,const _Tp*,container_type,container_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::const_walker
 

the (recursive) const walker

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1277 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_iterator<_Tp,_Tp&,_Tp*,container_type,children_iterator,node_type> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::iterator
 

the iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1898 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_iterator<_Tp,_Tp&,_Tp*,container_type,container_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::iterator
 

the iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1261 of file vgtl_graph.h.

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

iterator for accessing the parents

Definition at line 1446 of file vgtl_tree.h.

typedef __one_iterator<void *> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >::parents_iterator [inherited]
 

iterator for accessing the parents

Reimplemented from _Tree_base< _Tp, _Ctr, _Iterator, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1563 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef std::reverse_iterator<iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::reverse_iterator
 

the reverse iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1906 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef reverse_iterator<iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::reverse_iterator
 

the reverse iterator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1266 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tp __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::value_type
 

standard typedef

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1247 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
typedef _Tree_walker<_Tp,_Tp&,_Tp*,container_type,container_iterator> __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::walker
 

the (recursive) walker

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1276 of file vgtl_graph.h.

Constructor & Destructor Documentation

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
__Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::__Tree (  const allocator_type &    __a = allocator_type() )  [inline, explicit]
 

standard constructor

Definition at line 1931 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
__Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::__Tree (  size_type    __n,
const _Tp &    __value,
const allocator_type &    __a = allocator_type()
)  [inline]
 

construct a tree containing __n nodes with value __value at the root spot.

Definition at line 2003 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
__Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::__Tree (  size_type    __n )  [inline, explicit]
 

construct a tree containing __n nodes with default value at the root spot.

Definition at line 2010 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
__Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::__Tree (  const _Self &    __x )  [inline]
 

copy constructor

Definition at line 2015 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
virtual __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::~__Tree (    )  [inline, virtual]
 

standard destructor

Definition at line 2018 of file vgtl_tree.h.

Member Function Documentation

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Node* __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::_C_create_node (    )  [inline, protected]
 

construct a new tree node containing default data

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1307 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Node* __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::_C_create_node (  const _Tp &    __x )  [inline, protected]
 

construct a new tree node containing data __x

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1294 of file vgtl_graph.h.

_Node* _Tree_alloc_base< _Tp, _Ctr, _Iterator, _Node, _IsStatic >::_C_get_node (    )  [inline, protected, inherited]
 

allocate a new node

Definition at line 1374 of file vgtl_tree.h.

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

deallocate a node

Definition at line 1377 of file vgtl_tree.h.

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

deallocate a node

Definition at line 1377 of file vgtl_tree.h.

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

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

void _Tree_base< _Tp, _Ctr, _Iterator, _Tree_node< _Tp, _Ctr, _Iterator > >::add_all_children (  _Output_Iterator    fi,
_Node *    _parent
)  [inherited]
 

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

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::begin (    )  const [inline]
 

return a const iterator to the first node in walk

Definition at line 1972 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::begin (    )  [inline]
 

return an iterator to the first node in walk

Definition at line 1963 of file vgtl_tree.h.

void _Tree_base< _Tp, _Ctr, _Iterator, _Tree_node< _Tp, _Ctr, _Iterator > >::clear_children (    )  [inline, inherited]
 

clear all children of the root node

Definition at line 1465 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
size_type __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::depth (  const walker &    __position )  [inline]
 

return the depth of node __position in the tree

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1525 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
bool __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::empty (    )  const [inline]
 

is the tree empty?

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1391 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::end (    )  const [inline]
 

return a const iterator beyond the last node in walk

Definition at line 1976 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::end (    )  [inline]
 

return an iterator beyond the last node in walk

Definition at line 1967 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
void __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::erase (  const __walker_base &    __position )  [inline]
 

erase the node at position __position.

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1443 of file vgtl_graph.h.

bool __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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 1769 of file vgtl_tree.h.

_Tree_node< _Tp, _Ctr, _Iterator >* __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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 1789 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Node* __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::erase_tree (  const __walker_base &    __position )  [inline]
 

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

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1470 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
allocator_type __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::get_allocator (    )  const [inline]
 

construct an allocator object

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1258 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_reference __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::getroot (    )  const [inline]
 

get a const reference to the virtual root node

Definition at line 1997 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
reference __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::getroot (    )  [inline]
 

get a reference to the virtual root node

Definition at line 1995 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::ground (    )  const [inline]
 

return a const walker to the virtual root node.

Definition at line 1942 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::ground (    )  [inline]
 

return a walker to the virtual root node.

Definition at line 1938 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
void __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::insert_child (  const __walker_base &    __position,
const container_insert_arg &    __It
)  [inline]
 

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

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1414 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
void __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::insert_child (  const __walker_base &    __position,
const _Tp &    __x,
const container_insert_arg &    __It
)  [inline]
 

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

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1408 of file vgtl_graph.h.

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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 1681 of file vgtl_tree.h.

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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 1701 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
size_type __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::max_size (    )  const [inline]
 

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

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1399 of file vgtl_graph.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Self& __Tree< _Tp, _Ctr, _Iterator, _Inserter, _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 in ntree< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >, rntree< _Tp, _SequenceCtr, _PtrAlloc, _Alloc >, atree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >, stree< _Key, _Compare, _AssocCtr, _PtrAlloc, _Alloc >, ratree< _Tp, _AssocCtr, _Key, _Compare, _PtrAlloc, _Alloc >, and rstree< _Key, _Compare, _AssocCtr, _PtrAlloc, _Alloc >.

Definition at line 2027 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Self& __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::operator= (  const _Self &    __x ) 
 

standard assignment operator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
_Self& __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::operator= (  const _Self &    __x ) 
 

standard assignment operator

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_reverse_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::rbegin (    )  const [inline]
 

return a const reverse iterator to the first node in walk

Definition at line 1988 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
reverse_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::rbegin (    )  [inline]
 

return a reverse iterator to the first node in walk

Definition at line 1981 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_reverse_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::rend (    )  const [inline]
 

return a const reverse iterator beyond the last node in walk

Definition at line 1991 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
reverse_iterator __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::rend (    )  [inline]
 

return a reverse iterator beyond the last node in walk

Definition at line 1984 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::root (    )  const [inline]
 

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

Definition at line 1959 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::root (    )  [inline]
 

return a walker to the first non-virtual tree root

Definition at line 1956 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
const_walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::root (  children_iterator    __it )  const [inline]
 

return a const walker to a root node.

Definition at line 1951 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
walker __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::root (  children_iterator    __it )  [inline]
 

return a walker to a root node.

Definition at line 1946 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
void __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >::swap (  _Self &    __x )  [inline]
 

swap two trees

Reimplemented from __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _Iterator >, _Alloc >.

Definition at line 1404 of file vgtl_graph.h.

Friends And Related Function Documentation

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Alloc>
bool operator==__VGTL_NULL_TMPL_ARGS (  const __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > &    __x,
const __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc > &    __y
)  [friend]
 

comparison operator

Member Data Documentation

_Node* _Tree_alloc_base< _Tp, _Ctr, _Iterator, _Node, _IsStatic >::_C_node [protected, inherited]
 

This is the node

Definition at line 1386 of file vgtl_tree.h.

The documentation for this class was generated from the following files:
Generated on Tue Nov 4 01:41:31 2003 for Vienna Graph Template Library by doxygen1.2.18