Iterator which traverses only the nodes which are siblings of each other. More...
#include <tree.hh>
Public Member Functions | |
| bool | operator!= (const sibling_iterator &) const |
| sibling_iterator | operator++ (int) |
| sibling_iterator & | operator++ () |
| sibling_iterator & | operator+= (unsigned int) |
| sibling_iterator & | operator-- () |
| sibling_iterator | operator-- (int) |
| sibling_iterator & | operator-= (unsigned int) |
| bool | operator== (const sibling_iterator &) const |
| tree_node * | range_first () const |
| tree_node * | range_last () const |
| sibling_iterator (tree_node *) | |
| sibling_iterator (const sibling_iterator &) | |
| sibling_iterator () | |
| sibling_iterator (const iterator_base &) | |
Public Attributes | |
| tree_node * | parent_ |
Private Member Functions | |
| void | set_parent_ () |
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
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | ) |
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | const sibling_iterator & | other | ) |
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | const iterator_base & | other | ) |
Member Function Documentation
| bool tree< T, tree_node_allocator >::sibling_iterator::operator!= | ( | const sibling_iterator & | other | ) | const |
| tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator++ | ( | int | ) |
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator++ | ( | ) |
References tree< T, tree_node_allocator >::next_sibling().
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator+= | ( | unsigned int | num | ) |
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator-- | ( | ) |
| tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator-- | ( | int | ) |
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator-= | ( | unsigned int | num | ) |
| bool tree< T, tree_node_allocator >::sibling_iterator::operator== | ( | const sibling_iterator & | other | ) | const |
| tree< T, tree_node_allocator >::tree_node * tree< T, tree_node_allocator >::sibling_iterator::range_first | ( | ) | const |
References tree_node_< T >::first_child.
| void tree< T, tree_node_allocator >::sibling_iterator::set_parent_ | ( | ) | [private] |
References tree< T, tree_node_allocator >::parent().
Referenced by tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator().
Member Data Documentation
| tree_node* tree< T, tree_node_allocator >::sibling_iterator::parent_ |
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 >::post_order_iterator::post_order_iterator(), and tree< T, tree_node_allocator >::pre_order_iterator::pre_order_iterator().
The documentation for this class was generated from the following file:
- /builddir/build/BUILD/liborigin2/tree.hh
