tree< T, tree_node_allocator >::post_order_iterator Class Reference
Depth-first iterator, first accessing the children, then the node itself.
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 >::post_order_iterator
Depth-first iterator, first accessing the children, then the node itself.
Definition at line 146 of file tree.hh.
Constructor & Destructor Documentation
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator |
( |
|
) |
[inline] |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator |
( |
tree_node * |
tn |
) |
[inline] |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator |
( |
const iterator_base & |
other |
) |
[inline] |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator::post_order_iterator |
( |
const sibling_iterator & |
other |
) |
[inline] |
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 >
| void tree< T, tree_node_allocator >::post_order_iterator::descend_all |
( |
|
) |
[inline] |
Set iterator to the first child as deep as possible down the tree.
Definition at line 2380 of file tree.hh.
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
| bool tree< T, tree_node_allocator >::post_order_iterator::operator!= |
( |
const post_order_iterator & |
other |
) |
const [inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator+= |
( |
unsigned int |
num |
) |
[inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::post_order_iterator & tree< T, tree_node_allocator >::post_order_iterator::operator-= |
( |
unsigned int |
num |
) |
[inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T , class tree_node_allocator >
| bool tree< T, tree_node_allocator >::post_order_iterator::operator== |
( |
const post_order_iterator & |
other |
) |
const [inline] |
The documentation for this class was generated from the following files:
- /home/laradmin/lar/perception/planarobstacles/mtt/include/mtt/tree.hh
- /home/laradmin/lar/perception/planarobstacles/mtt/include/mtt/tree_new.hh
