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

Tree base class. More...

#include <vgtl_tree.h>

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

Collaboration diagram for __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >:

List of all members.

Public Types

typedef _Iterator children_iterator

typedef __one_iterator< void * > parents_iterator

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 _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

Public Member Functions

allocator_type get_allocator () const

__Tree_t (const allocator_type &__a=allocator_type())

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)

_Node * erase_subtree (const __walker_base &__position, const children_iterator &__It)

size_type depth (const walker &__position)

void clear ()

__Tree_t (size_type __n, const _Tp &__value, const allocator_type &__a=allocator_type())

__Tree_t (size_type __n)

__Tree_t (const _Self &__x)

virtual ~__Tree_t ()

_Self & operator= (const _Self &__x)

_Self & operator= (_Node *__x)

void clear_children ()

void add_all_children (_Output_Iterator fi, _Node *_parent)

Protected Member Functions

_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

Detailed Description

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Node, class _Alloc>
class __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >

This is the toplevel base class for all trees independent of allocators

Definition at line 1559 of file vgtl_tree.h.

Member Typedef Documentation

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

typedef _Iterator __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::children_iterator

iterator for accessing the children

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

Definition at line 1563 of file vgtl_tree.h.

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

typedef _Tree_iterator<_Tp,const _Tp&,const _Tp*,container_type,children_iterator,node_type> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::const_iterator

the const iterator

Definition at line 1593 of file vgtl_tree.h.

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

typedef const value_type* __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::const_pointer

standard typedef

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

Definition at line 1578 of file vgtl_tree.h.

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

typedef const value_type& __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::const_reference

standard typedef

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

Definition at line 1580 of file vgtl_tree.h.

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

typedef std::reverse_iterator<const_iterator> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::const_reverse_iterator

the const reverse iterator

Definition at line 1597 of file vgtl_tree.h.

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

typedef _RTree_walker<_Tp,const _Tp&,const _Tp*,container_type,children_iterator,node_type> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::const_walker

the (recursive) const walker

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

Definition at line 1614 of file vgtl_tree.h.

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

typedef ptrdiff_t __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::difference_type

standard typedef

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

Definition at line 1582 of file vgtl_tree.h.

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

typedef _Tree_iterator<_Tp,_Tp&,_Tp*,container_type,children_iterator,node_type> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::iterator

the iterator

Definition at line 1591 of file vgtl_tree.h.

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

typedef _Node __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::node_type

standard typedef

Definition at line 1576 of file vgtl_tree.h.

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

typedef __one_iterator<void *> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::parents_iterator

iterator for accessing the parents

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

Definition at line 1564 of file vgtl_tree.h.

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

typedef value_type* __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::pointer

standard typedef

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

Definition at line 1577 of file vgtl_tree.h.

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

typedef value_type& __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::reference

standard typedef

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

Definition at line 1579 of file vgtl_tree.h.

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

typedef std::reverse_iterator<iterator> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::reverse_iterator

the reverse iterator

Definition at line 1599 of file vgtl_tree.h.

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

typedef size_t __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::size_type

standard typedef

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

Definition at line 1581 of file vgtl_tree.h.

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

typedef _Tp __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::value_type

standard typedef

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

Definition at line 1575 of file vgtl_tree.h.

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

typedef _RTree_walker<_Tp,_Tp&,_Tp*,container_type,children_iterator,node_type> __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::walker

the (recursive) walker

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

Definition at line 1612 of file vgtl_tree.h.

Constructor & Destructor Documentation

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

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

standard constructor

Definition at line 1654 of file vgtl_tree.h.

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

__Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::__Tree_t	(	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 1823 of file vgtl_tree.h.

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

__Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::__Tree_t ( size_type __n ) [inline, explicit]

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

Definition at line 1830 of file vgtl_tree.h.

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

__Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::__Tree_t ( const _Self & __x ) [inline]

copy constructor

Definition at line 1849 of file vgtl_tree.h.

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

virtual __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::~__Tree_t ( ) [inline, virtual]

standard destructor

Definition at line 1858 of file vgtl_tree.h.

Member Function Documentation

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

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

construct a new tree node containing default data

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

Definition at line 1641 of file vgtl_tree.h.

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

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

construct a new tree node containing data __x

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

Definition at line 1629 of file vgtl_tree.h.

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

allocate a new node

Definition at line 1375 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 , _Ctr , _Iterator , _Node , _IsStatic >::_C_put_node ( _Node * __p ) [inline, protected, inherited]

deallocate a node

Definition at line 1378 of file vgtl_tree.h.

void _Tree_base< _Tp, _Ctr, _Iterator, _Node, _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

Definition at line 1539 of file vgtl_tree.h.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::clear ( ) [inline]

empty the tree

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

Definition at line 1817 of file vgtl_tree.h.

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

clear all children of the root node

Definition at line 1466 of file vgtl_tree.h.

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

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

return the depth of node __position in the tree

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

Definition at line 1805 of file vgtl_tree.h.

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

bool __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::empty ( ) const [inline]

is the tree empty?

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

Definition at line 1657 of file vgtl_tree.h.

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

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

erase the node at position __position.

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

Definition at line 1713 of file vgtl_tree.h.

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

bool __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::erase_child	(	const __walker_base &	__position,
		const children_iterator &	__It
	)			`[inline]`

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

Reimplemented in __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >.

Definition at line 1770 of file vgtl_tree.h.

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

_Node* __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::erase_subtree	(	const __walker_base &	__position,
		const children_iterator &	__It
	)			`[inline]`

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

Reimplemented in __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >.

Definition at line 1790 of file vgtl_tree.h.

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

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

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

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

Definition at line 1743 of file vgtl_tree.h.

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

allocator_type __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::get_allocator ( ) const [inline]

construct an allocator object

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

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

Definition at line 1587 of file vgtl_tree.h.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _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 in __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >, __Tree< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >, __Tree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc >, and __Tree< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Alloc >.

Definition at line 1676 of file vgtl_tree.h.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _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 in __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >, __Tree< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >, __Tree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc >, and __Tree< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Alloc >.

Definition at line 1668 of file vgtl_tree.h.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::insert_children	(	const __walker_base &	__position,
		size_type	__n,
		const _Tp &	__x,
		const children_iterator &	__It
	)			`[inline]`

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

Reimplemented in __Tree< _Tp, _Ctr, _Iterator, _Inserter, _Alloc >.

Definition at line 1682 of file vgtl_tree.h.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::insert_subtree	(	const __walker_base &	__position,
		_Self &	__subtree,
		const children_iterator &	__It
	)			`[inline]`

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

Definition at line 1702 of file vgtl_tree.h.

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

size_type __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::max_size ( ) const [inline]

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

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

Definition at line 1660 of file vgtl_tree.h.

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

_Self& __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _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.

Definition at line 1867 of file vgtl_tree.h.

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

_Self& __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::operator= ( const _Self & __x )

standard assignment operator

Reimplemented in __ITree< _Tp, _SequenceCtr< void *, _PtrAlloc >, _SequenceCtr< void *, _PtrAlloc >::iterator, _SequenceCtr< void *, _PtrAlloc >::iterator, _Alloc >, __ITree< _Tp, _AssocCtr< _Key, void *, _Compare, _PtrAlloc >, pair_adaptor< _AssocCtr< _Key, void *, _Compare, _PtrAlloc >::iterator >, _Key, _Alloc >, and __ITree< _Key, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >, _AssocCtr< _Key &, pointer_adaptor< _Compare >, _PtrAlloc >::iterator, _Key &, _Alloc >.

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

void __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >::swap ( _Self & __x ) [inline]

swap two trees

Definition at line 1663 of file vgtl_tree.h.

Member Data Documentation

_Node* _Tree_alloc_base< _Tp , _Ctr , _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 file:

vgtl_tree.h


Public Types
typedef _Iterator	children_iterator
typedef __one_iterator< void * >	parents_iterator
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 _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
Public Member Functions
allocator_type	get_allocator () const
	__Tree_t (const allocator_type &__a=allocator_type())
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)
_Node *	erase_subtree (const __walker_base &__position, const children_iterator &__It)
size_type	depth (const walker &__position)
void	clear ()
	__Tree_t (size_type __n, const _Tp &__value, const allocator_type &__a=allocator_type())
	__Tree_t (size_type __n)
	__Tree_t (const _Self &__x)
virtual	~__Tree_t ()
_Self &	operator= (const _Self &__x)
_Self &	operator= (_Node *__x)
void	clear_children ()
void	add_all_children (_Output_Iterator fi, _Node *_parent)
Protected Member Functions
_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

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

Public Types

Public Member Functions

Protected Member Functions

Protected Attributes

Detailed Description

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Node, class _Alloc> class __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

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

template<class _Tp, class _Ctr, class _Iterator, class _Inserter, class _Node, class _Alloc>
class __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >