|
liborigin 2.0.0
|
Iterator which traverses only the nodes at a given depth from the root. More...
#include <tree.hh>
Public Member Functions | |
| fixed_depth_iterator () | |
| fixed_depth_iterator (tree_node *) | |
| fixed_depth_iterator (const sibling_iterator &) | |
| fixed_depth_iterator (const fixed_depth_iterator &) | |
| fixed_depth_iterator (const iterator_base &) | |
| bool | operator!= (const fixed_depth_iterator &) const |
| fixed_depth_iterator & | operator++ () |
| fixed_depth_iterator | operator++ (int) |
| fixed_depth_iterator & | operator+= (unsigned int) |
| fixed_depth_iterator | operator-- (int) |
| fixed_depth_iterator & | operator-- () |
| fixed_depth_iterator & | operator-= (unsigned int) |
| bool | operator== (const fixed_depth_iterator &) const |
Public Attributes | |
| tree_node * | first_parent_ |
Private Member Functions | |
| void | find_leftmost_parent_ () |
| void | set_first_parent_ () |
Iterator which traverses only the nodes at a given depth from the root.
| tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator | ( | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator | ( | const iterator_base & | other | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator | ( | const sibling_iterator & | other | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator | ( | const fixed_depth_iterator & | other | ) |
| void tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_ | ( | ) | [private] |
References tree_node_< T >::first_child, and tree_node_< T >::prev_sibling.
Referenced by tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator().
| bool tree< T, tree_node_allocator >::fixed_depth_iterator::operator!= | ( | const fixed_depth_iterator & | other | ) | const |
| tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::fixed_depth_iterator::operator++ | ( | int | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator & tree< T, tree_node_allocator >::fixed_depth_iterator::operator++ | ( | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator & tree< T, tree_node_allocator >::fixed_depth_iterator::operator+= | ( | unsigned int | num | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator & tree< T, tree_node_allocator >::fixed_depth_iterator::operator-- | ( | ) |
References tree_node_< T >::last_child, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.
| tree< T, tree_node_allocator >::fixed_depth_iterator tree< T, tree_node_allocator >::fixed_depth_iterator::operator-- | ( | int | ) |
| tree< T, tree_node_allocator >::fixed_depth_iterator & tree< T, tree_node_allocator >::fixed_depth_iterator::operator-= | ( | unsigned int | num | ) |
| bool tree< T, tree_node_allocator >::fixed_depth_iterator::operator== | ( | const fixed_depth_iterator & | other | ) | const |
| void tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_ | ( | ) | [private] |
| tree_node* tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_ |
1.7.3