tree< T, tree_node_allocator >::tree::post_order_iterator Class Reference

Depth-first iterator, first accessing the children, then the node itself. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::tree::post_order_iterator:

List of all members.

Public Member Functions
void	descend_all ()
	Set iterator to the first child as deep as possible down the tree.
bool	operator!= (const post_order_iterator &) const
post_order_iterator	operator++ (int)
post_order_iterator &	operator++ ()
post_order_iterator &	operator+= (unsigned int)
post_order_iterator	operator-- (int)
post_order_iterator &	operator-- ()
post_order_iterator &	operator-= (unsigned int)
bool	operator== (const post_order_iterator &) const
	post_order_iterator (const sibling_iterator &)
	post_order_iterator (const iterator_base &)
	post_order_iterator (tree_node *)
	post_order_iterator ()

---

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::post_order_iterator

Depth-first iterator, first accessing the children, then the node itself.

---

Constructor & Destructor Documentation

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree::post_order_iterator::post_order_iterator

(

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree::post_order_iterator::post_order_iterator

(

tree_node *

tn

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree::post_order_iterator::post_order_iterator

(

const iterator_base &

other

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::tree::post_order_iterator::post_order_iterator

(

const sibling_iterator &

other

)

[inline]

References tree< T, tree_node_allocator >::tree::iterator_base::node, tree< T, tree_node_allocator >::tree::sibling_iterator::parent_, tree< T, tree_node_allocator >::tree::sibling_iterator::range_last(), and tree< T, tree_node_allocator >::tree::iterator_base::skip_children().

---

Member Function Documentation

template<class T , class tree_node_allocator >

void tree< T, tree_node_allocator >::tree::post_order_iterator::descend_all

(

)

[inline]

Set iterator to the first child as deep as possible down the tree.

References tree_node_< T >::first_child, and tree< T, tree_node_allocator >::tree::iterator_base::node.

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::tree::post_order_iterator::operator!=

(

const post_order_iterator &

other

)

const [inline]

References tree< T, tree_node_allocator >::tree::iterator_base::node.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::tree::post_order_iterator::operator++

(

int

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::tree::post_order_iterator::operator++

(

)

[inline]

References tree_node_< T >::first_child, tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::tree::iterator_base::node, tree_node_< T >::parent, and tree< T, tree_node_allocator >::tree::iterator_base::skip_current_children_.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::tree::post_order_iterator::operator+=

(

unsigned int

num

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::tree::post_order_iterator::operator--

(

int

)

[inline]

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::tree::post_order_iterator::operator--

(

)

[inline]

References tree_node_< T >::last_child, tree< T, tree_node_allocator >::tree::iterator_base::node, tree_node_< T >::parent, tree_node_< T >::prev_sibling, and tree< T, tree_node_allocator >::tree::iterator_base::skip_current_children_.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::tree::post_order_iterator::operator-=

(

unsigned int

num

)

[inline]

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::tree::post_order_iterator::operator==

(

const post_order_iterator &

other

)

const [inline]

References tree< T, tree_node_allocator >::tree::iterator_base::node.

---

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

• C:/qtiplot/3rdparty/liborigin/tree.hh