tree< T, tree_node_allocator >::iterator_base Class Reference
Base class for iterators, only pointers stored, no traversal logic.
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 >::iterator_base
Base class for iterators, only pointers stored, no traversal logic.
Definition at line 97 of file tree.hh.
Member Typedef Documentation
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 = std::allocator<tree_node_<T> >>
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 = std::allocator<tree_node_<T> >>
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 = std::allocator<tree_node_<T> >>
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 = std::allocator<tree_node_<T> >>
Constructor & Destructor Documentation
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::iterator_base::iterator_base |
( |
|
) |
[inline] |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::iterator_base::iterator_base |
( |
tree_node * |
tn |
) |
[inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::iterator_base::iterator_base |
( |
|
) |
|
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| tree< T, tree_node_allocator >::iterator_base::iterator_base |
( |
tree_node * |
|
) |
|
Member Function Documentation
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::sibling_iterator tree< T, tree_node_allocator >::iterator_base::begin |
( |
|
) |
const [inline] |
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::children_iterator tree< T, tree_node_allocator >::iterator_base::begin_children_iterator |
( |
|
) |
const [inline] |
template<class T , class tree_node_allocator >
template<class T , class tree_node_allocator >
| tree< T, tree_node_allocator >::children_iterator tree< T, tree_node_allocator >::iterator_base::end_children_iterator |
( |
|
) |
const [inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| unsigned int tree< T, tree_node_allocator >::iterator_base::number_of_children |
( |
|
) |
const |
Number of children of the node pointed to by the iterator.
template<class T , class tree_node_allocator >
| unsigned int tree< T, tree_node_allocator >::iterator_base::number_of_children |
( |
|
) |
const [inline] |
Number of children of the node pointed to by the iterator.
Definition at line 2148 of file tree.hh.
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| T& tree< T, tree_node_allocator >::iterator_base::operator* |
( |
|
) |
const |
template<class T , class tree_node_allocator >
| T & tree< T, tree_node_allocator >::iterator_base::operator* |
( |
|
) |
const [inline] |
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
| T* tree< T, tree_node_allocator >::iterator_base::operator-> |
( |
|
) |
const |
template<class T , class tree_node_allocator >
| T * tree< T, tree_node_allocator >::iterator_base::operator-> |
( |
|
) |
const [inline] |
template<class T , class tree_node_allocator >
| void tree< T, tree_node_allocator >::iterator_base::skip_children |
( |
bool |
skip |
) |
[inline] |
template<class T , class tree_node_allocator >
| void tree< T, tree_node_allocator >::iterator_base::skip_children |
( |
|
) |
[inline] |
When called, the next increment/decrement skips children of this node.
Definition at line 2136 of file tree.hh.
Member Data Documentation
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
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
