Iterator which traverses only the leaves. More...
#include <tree.h>

Private Attributes | |
| tree_node * | top_node |
Additional Inherited Members | |
Public Types inherited from tree< T, tree_node_allocator >::iterator_base | |
| 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 |
Public Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
| tree_node * | node |
Protected Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
| bool | skip_current_children_ |
Iterator which traverses only the leaves.
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | ) |
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | tree_node * | , |
| tree_node * | top = 0 |
||
| ) |
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const sibling_iterator & | ) |
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const iterator_base & | ) |
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | ) |
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | tree_node * | , |
| tree_node * | top = 0 |
||
| ) |
| bool tree< T, tree_node_allocator >::leaf_iterator::operator!= | ( | const leaf_iterator & | ) | const |
| bool tree< T, tree_node_allocator >::leaf_iterator::operator!= | ( | const leaf_iterator & | ) | const |
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | ) |
| tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | ) |
| leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator+= | ( | unsigned | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator+= | ( | unsigned | int | ) |
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | ) |
| tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | ) |
| leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator-= | ( | unsigned | int | ) |
| leaf_iterator& tree< T, tree_node_allocator >::leaf_iterator::operator-= | ( | unsigned | int | ) |
| bool tree< T, tree_node_allocator >::leaf_iterator::operator== | ( | const leaf_iterator & | ) | const |
| bool tree< T, tree_node_allocator >::leaf_iterator::operator== | ( | const leaf_iterator & | ) | const |