liborigin2 13/09/2010
|
Iterator which traverses only the leaves. More...
#include <tree.hh>
Public Member Functions | |
leaf_iterator () | |
leaf_iterator (tree_node *) | |
leaf_iterator (const iterator_base &) | |
leaf_iterator (const sibling_iterator &) | |
bool | operator!= (const leaf_iterator &) const |
leaf_iterator | operator++ (int) |
leaf_iterator & | operator++ () |
leaf_iterator & | operator+= (unsigned int) |
leaf_iterator & | operator-- () |
leaf_iterator | operator-- (int) |
leaf_iterator & | operator-= (unsigned int) |
bool | operator== (const leaf_iterator &) const |
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 * | tn | ) |
tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const sibling_iterator & | other | ) |
tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const iterator_base & | other | ) |
bool tree< T, tree_node_allocator >::leaf_iterator::operator!= | ( | const leaf_iterator & | other | ) | const |
tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | 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+= | ( | unsigned int | num | ) |
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 | ) |
tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator-= | ( | unsigned int | num | ) |
bool tree< T, tree_node_allocator >::leaf_iterator::operator== | ( | const leaf_iterator & | other | ) | const |