---

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

tree node for trees w/o data hooks More...

#include <vgtl_tree.h>

Inheritance diagram for _Tree_node< _Tp, _Ctr, _Iterator >:

[legend]Collaboration diagram for _Tree_node< _Tp, _Ctr, _Iterator >:

[legend]List of all members.

Public Methods
	_Tree_node ()
void	initialize ()
void	get_rid_of ()
void	clear_tree ()
void	clear_children ()
_Ctr_iterator	get_childentry_iterator (_Void_pointer __p)
template<class _Output_Iterator> void	add_all_children (_Output_Iterator fi, _Self *_parent)
template<class Compare> void	sort_children (_Ctr_iterator first, _Ctr_iterator last, Compare comp)
template<class Compare> void	sort_parents (_Ctr_iterator first, _Ctr_iterator last, Compare comp)
Public Attributes
_Tp	_C_data
_Void_pointer	_C_parent
_Ctr	_C_children

---

Detailed Description

template<class _Tp, class _Ctr, class _Iterator>
class _Tree_node< _Tp, _Ctr, _Iterator >

This is the tree node for a tree without data hooks

Definition at line 63 of file vgtl_tree.h.

---

Constructor & Destructor Documentation

template<class _Tp, class _Ctr, class _Iterator> _Tree_node< _Tp, _Ctr, _Iterator >::_Tree_node (    )  [inline]

standard constructor Definition at line 79 of file vgtl_tree.h.

---

Member Function Documentation

template<class _Tp, class _Ctr, class _Iterator> template<class _Output_Iterator> void _Tree_node< _Tp, _Ctr, _Iterator >::add_all_children (  _Output_Iterator    fi, _Self *    _parent )

add all children to parent _parent. fi is an iterator to the children container of _parent Definition at line 180 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> void _Tree_node< _Tp, _Ctr, _Iterator >::clear_children (    )  [inline]

erase all children entries Definition at line 100 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> void _Tree_node< _Tp, _Ctr, _Iterator >::clear_tree (    )

remove the whole subtree below this node Definition at line 195 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> _Ctr_iterator _Tree_node< _Tp, _Ctr, _Iterator >::get_childentry_iterator (  _Void_pointer    __p )  [inline]

find the iterator into the children container for child __p Definition at line 104 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> void _Tree_node< _Tp, _Ctr, _Iterator >::get_rid_of (    )  [inline]

remove the children container Reimplemented in _ITree_node< _Tp, _Ctr, _Iterator >. Definition at line 93 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> void _Tree_node< _Tp, _Ctr, _Iterator >::initialize (    )  [inline]

initialize the data structure Reimplemented in _ITree_node< _Tp, _Ctr, _Iterator >. Definition at line 87 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> template<class Compare> void _Tree_node< _Tp, _Ctr, _Iterator >::sort_children (  _Ctr_iterator    first, _Ctr_iterator    last, Compare    comp )  [inline]

sort the children according to comp Definition at line 121 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> template<class Compare> void _Tree_node< _Tp, _Ctr, _Iterator >::sort_parents (  _Ctr_iterator    first, _Ctr_iterator    last, Compare    comp )  [inline]

sort the children according to comp, i.e. do nothing here Definition at line 128 of file vgtl_tree.h.

---

Member Data Documentation

template<class _Tp, class _Ctr, class _Iterator> _Ctr _Tree_node< _Tp, _Ctr, _Iterator >::_C_children

the edges to the children Definition at line 76 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> _Tp _Tree_node< _Tp, _Ctr, _Iterator >::_C_data

the node data Definition at line 72 of file vgtl_tree.h.

template<class _Tp, class _Ctr, class _Iterator> _Void_pointer _Tree_node< _Tp, _Ctr, _Iterator >::_C_parent

the edge to the parent Definition at line 74 of file vgtl_tree.h.

---

The documentation for this class was generated from the following file:

• vgtl_tree.h

---