Iterator which traverses only the leaves. More...
#include <tree.hh>
Inheritance diagram for tree< T, tree_node_allocator >::leaf_iterator:
Public Member Functions | |
| leaf_iterator () | |
| leaf_iterator (tree_node *, tree_node *top=0) | |
| 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 |
Private Attributes | |
| tree_node * | top_node |
Detailed Description
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::leaf_iterator
Iterator which traverses only the leaves.
Constructor & Destructor Documentation
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | tree_node * | tn, |
| tree_node * | top = 0 |
||
| ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const sibling_iterator & | other | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator | ( | const iterator_base & | other | ) |
Member Function Documentation
template<class T , class tree_node_allocator >
| bool tree< T, tree_node_allocator >::leaf_iterator::operator!= | ( | const leaf_iterator & | other | ) | const |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | int | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator++ | ( | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator+= | ( | unsigned int | num | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator-- | ( | int | ) |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator-= | ( | unsigned int | num | ) |
template<class T , class tree_node_allocator >
| bool tree< T, tree_node_allocator >::leaf_iterator::operator== | ( | const leaf_iterator & | other | ) | const |
Member Data Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
tree_node* tree< T, tree_node_allocator >::leaf_iterator::top_node [private] |
Referenced by tree< T, tree_node_allocator >::leaf_iterator::operator==().
The documentation for this class was generated from the following file:
- /builddir/build/BUILD/liborigin2/tree.hh
