Depth-first iterator, first accessing the children, then the node itself. More...
#include <tree.h>
Inheritance diagram for tree< T, tree_node_allocator >::post_order_iterator:
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 |
| Public Attributes inherited from tree< T, tree_node_allocator >::iterator_base | |
| tree_node * | node |
| 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 >::post_order_iterator
Depth-first iterator, first accessing the children, then the node itself.
Constructor & Destructor Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | tree_node * | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | const iterator_base & | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | const sibling_iterator & | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator | ( | tree_node * | ) |
Member Function Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| void tree< T, tree_node_allocator >::post_order_iterator::descend_all | ( | ) |
Set iterator to the first child as deep as possible down the tree.
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| void tree< T, tree_node_allocator >::post_order_iterator::descend_all | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::post_order_iterator::operator!= | ( | const post_order_iterator & | ) | const |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::post_order_iterator::operator!= | ( | const post_order_iterator & | ) | const |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator++ | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator+= | ( | unsigned | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator+= | ( | unsigned | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::post_order_iterator tree< T, tree_node_allocator >::post_order_iterator::operator-- | ( | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator-= | ( | unsigned | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| post_order_iterator& tree< T, tree_node_allocator >::post_order_iterator::operator-= | ( | unsigned | int | ) |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::post_order_iterator::operator== | ( | const post_order_iterator & | ) | const |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| bool tree< T, tree_node_allocator >::post_order_iterator::operator== | ( | const post_order_iterator & | ) | const |
The documentation for this class was generated from the following files: