Iterator which traverses only the nodes which are siblings of each other.
More...
#include <tree.hh>
List of all members.
Detailed Description
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::sibling_iterator
Iterator which traverses only the nodes which are siblings of each other.
Constructor & Destructor Documentation
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator |
( |
|
) |
|
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator |
( |
tree_node * |
tn |
) |
|
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator |
( |
const sibling_iterator & |
other |
) |
|
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator |
( |
const iterator_base & |
other |
) |
|
Member Function Documentation
template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::sibling_iterator::operator!= |
( |
const sibling_iterator & |
other |
) |
const |
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator+= |
( |
unsigned int |
num |
) |
|
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator-= |
( |
unsigned int |
num |
) |
|
template<class T , class tree_node_allocator >
bool tree< T, tree_node_allocator >::sibling_iterator::operator== |
( |
const sibling_iterator & |
other |
) |
const |
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree_node * tree< T, tree_node_allocator >::sibling_iterator::range_first |
( |
|
) |
const |
template<class T , class tree_node_allocator >
tree< T, tree_node_allocator >::tree_node * tree< T, tree_node_allocator >::sibling_iterator::range_last |
( |
|
) |
const |
template<class T , class tree_node_allocator >
void tree< T, tree_node_allocator >::sibling_iterator::set_parent_ |
( |
|
) |
[private] |
Member Data Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
Referenced by tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::insert(), tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator(), tree< T, tree_node_allocator >::move_before(), tree< T, tree_node_allocator >::sibling_iterator::operator--(), tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator(), tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator(), tree< T, tree_node_allocator >::sibling_iterator::range_first(), tree< T, tree_node_allocator >::sibling_iterator::range_last(), and tree< T, tree_node_allocator >::sibling_iterator::set_parent_().
The documentation for this class was generated from the following file:
- /builddir/build/BUILD/liborigin2-20100422/tree.hh