liborigin2 13/09/2010
Public Member Functions | Private Attributes
tree< T, tree_node_allocator >::breadth_first_queued_iterator Class Reference

Breadth-first iterator, using a queue. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::breadth_first_queued_iterator:
tree< T, tree_node_allocator >::iterator_base

List of all members.

Public Member Functions

 breadth_first_queued_iterator ()
 breadth_first_queued_iterator (tree_node *)
 breadth_first_queued_iterator (const iterator_base &)
bool operator!= (const breadth_first_queued_iterator &) const
breadth_first_queued_iteratoroperator++ ()
breadth_first_queued_iterator operator++ (int)
breadth_first_queued_iteratoroperator+= (unsigned int)
bool operator== (const breadth_first_queued_iterator &) const

Private Attributes

std::queue< tree_node * > traversal_queue

Detailed Description

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

Breadth-first iterator, using a queue.


Constructor & Destructor Documentation

template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator ( )
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator ( tree_node tn)
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator ( const iterator_base other)

Member Function Documentation

template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!= ( const breadth_first_queued_iterator other) const
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ ( int  n)
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ ( )
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+= ( unsigned int  num)
template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator== ( const breadth_first_queued_iterator other) const

Member Data Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
std::queue<tree_node *> tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue [private]

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