Iterator which traverses only the nodes which are siblings of each other. More...
#include <tree.h>
Inheritance diagram for tree< T, tree_node_allocator >::sibling_iterator:
Public Attributes | |
| tree_node * | parent_ |
 Public Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
| tree_node * | node |
Private Member Functions | |
| void | set_parent_ () |
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 |
| Protected Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
| bool | skip_current_children_ |
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 = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | tree_node * | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | const sibling_iterator & | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator::sibling_iterator | ( | const iterator_base & | ) |
Member Function Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::sibling_iterator::operator!= | ( | const sibling_iterator & | other | ) | const |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator++ | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator++ | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| 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 = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator & tree< T, tree_node_allocator >::sibling_iterator::operator-- | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::sibling_iterator::operator-- | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| 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 = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::sibling_iterator::operator== | ( | const sibling_iterator & | other | ) | const |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
|
private |
Member Data Documentation
The documentation for this class was generated from the following file: