---

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

-ary forest with labelled edges More...

#include <vgtl_tree.h>

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

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

[legend]List of all members.

Public Types
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 _I	children_iterator
typedef __one_iterator< void * >	parents_iterator
Public Methods
_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)
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
walker	ground ()
const_walker	ground () const
void	clear_children ()
template<class _Output_Iterator> void	add_all_children (_Output_Iterator fi, _Node *_parent)
Protected Methods
_Node *	_C_get_node ()
void	_C_put_node (_Node *__p)
void	_C_put_node (_Node *__p)
Protected Attributes
_Node *	_C_node
Friends
bool	operator==__VGTL_NULL_TMPL_ARGS (const __ITree &__x, const __ITree &__y)

---

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 -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 1769 of file vgtl_graph.h.

---

Member Typedef Documentation

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

iterator for accessing the children Reimplemented in __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _ITree_node< _Tp, _Ctr, _Iterator >, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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< _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< _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 >, and __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 >. Definition at line 1444 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 2064 of file vgtl_tree.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 Definition at line 2059 of file vgtl_tree.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 Definition at line 2068 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 2062 of file vgtl_tree.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 Definition at line 2057 of file vgtl_tree.h.

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

iterator for accessing the parents Reimplemented in __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Node, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _ITree_node< _Tp, _Ctr, _Iterator >, _Alloc >, __Tree_t< _Tp, _Ctr, _Iterator, _Inserter, _Tree_node< _Tp, _Ctr, _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< _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< _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 >, and __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 >. Definition at line 1446 of file vgtl_tree.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 Definition at line 2070 of file vgtl_tree.h.

---

Member Function Documentation

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

allocate a new node Definition at line 1374 of file vgtl_tree.h.

void _Tree_alloc_base< _Tp, _Ctr, _I, _Alloc, _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, _I, _Node, _IsStatic >::_C_put_node (  _Node *    __p )  [inline, protected, inherited]

deallocate a node Definition at line 1377 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _I, class _Alloc> template<class _Output_Iterator> void _Tree_base< _Tp, _Ctr, _I, _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

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 1972 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 1963 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 2128 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 2121 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _I, class _Alloc> void _Tree_base< _Tp, _Ctr, _I, _Alloc >::clear_children (    )  [inline, inherited]

clear all children of the root node Definition at line 1465 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 2176 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 1976 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 1967 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 2142 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 2136 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 2173 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 2171 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 1942 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 1938 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 2747 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 2721 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 2712 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 2157 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 2150 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 2160 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 2153 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 1959 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 1956 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 1951 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 1946 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 2105 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 2098 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 2164 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 2116 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 2112 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, _Ctr, _I, _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:

• vgtl_graph.h
• vgtl_tree.h

---