Breadth-first iterator, using a queue. More...
#include <tree.h>
Private Attributes | |
std::queue< tree_node * > | traversal_queue |
Additional Inherited Members | |
![]() | |
typedef ptrdiff_t | difference_type |
typedef ptrdiff_t | difference_type |
typedef std::bidirectional_iterator_tag | iterator_category |
typedef std::bidirectional_iterator_tag | iterator_category |
typedef T * | pointer |
typedef T * | pointer |
typedef T & | reference |
typedef T & | reference |
typedef size_t | size_type |
typedef size_t | size_type |
typedef T | value_type |
typedef T | value_type |
![]() | |
tree_node * | node |
![]() | |
bool | skip_current_children_ |
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 | ( | tree_node * | ) |
tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator | ( | const iterator_base & | ) |
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 | ( | tree_node * | ) |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!= | ( | const breadth_first_queued_iterator & | ) | const |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!= | ( | const breadth_first_queued_iterator & | ) | const |
breadth_first_queued_iterator& tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ | ( | ) |
breadth_first_queued_iterator tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++ | ( | int | ) |
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++ | ( | int | ) |
breadth_first_queued_iterator& tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+= | ( | unsigned | int | ) |
breadth_first_queued_iterator& tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+= | ( | unsigned | int | ) |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator== | ( | const breadth_first_queued_iterator & | ) | const |
bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator== | ( | const breadth_first_queued_iterator & | ) | const |