liborigin2 13/09/2010
|
Breadth-first iterator, using a queue. More...
#include <tree.hh>
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_iterator & | operator++ () |
breadth_first_queued_iterator | operator++ (int) |
breadth_first_queued_iterator & | operator+= (unsigned int) |
bool | operator== (const breadth_first_queued_iterator &) const |
Private Attributes | |
std::queue< tree_node * > | traversal_queue |
Breadth-first iterator, using a queue.
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator | ( | ) |
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator | ( | const iterator_base & | other | ) |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!= | ( | const breadth_first_queued_iterator & | other | ) | const |
tree< T, tree_node_allocator >::breadth_first_queued_iterator tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ | ( | int | n | ) |
tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ | ( | ) |
tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+= | ( | unsigned int | num | ) |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator== | ( | const breadth_first_queued_iterator & | other | ) | const |
std::queue<tree_node *> tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue [private] |