tree< T, tree_node_allocator >::breadth_first_queued_iterator Class Reference

Breadth-first iterator, using a queue. More...

#include <tree.hh>

Inheritance diagram for tree< T, tree_node_allocator >::breadth_first_queued_iterator:

[legend]

List of all members.

Public Member Functions
	breadth_first_queued_iterator (tree_node *)
	breadth_first_queued_iterator ()
	breadth_first_queued_iterator (const iterator_base &)
	breadth_first_queued_iterator (tree_node *)
	breadth_first_queued_iterator ()
bool	operator!= (const breadth_first_queued_iterator &) const
bool	operator!= (const breadth_first_queued_iterator &) const
breadth_first_queued_iterator	operator++ (int)
breadth_first_queued_iterator &	operator++ ()
breadth_first_queued_iterator	operator++ (int)
breadth_first_queued_iterator &	operator++ ()
breadth_first_queued_iterator &	operator+= (unsigned int)
breadth_first_queued_iterator &	operator+= (unsigned int)
bool	operator== (const breadth_first_queued_iterator &) const
bool	operator== (const breadth_first_queued_iterator &) const
Private Attributes
std::queue< tree_node * >	traversal_queue

---

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::breadth_first_queued_iterator

Breadth-first iterator, using a queue.

Definition at line 167 of file tree.hh.

---

Constructor & Destructor Documentation

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator

(

)

[inline]

Definition at line 2391 of file tree.hh.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator

(

tree_node *

tn

)

[inline]

Definition at line 2397 of file tree.hh.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator

(

const iterator_base &

other

)

[inline]

Definition at line 2404 of file tree.hh.

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator

(

)

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator

(

tree_node *

)

---

Member Function Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!=

(

const breadth_first_queued_iterator &

)

const

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator!=

(

const breadth_first_queued_iterator &

other

)

const [inline]

Definition at line 2411 of file tree.hh.

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

breadth_first_queued_iterator tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++

(

int

)

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

breadth_first_queued_iterator& tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++

(

)

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++

(

int

)

[inline]

Definition at line 2444 of file tree.hh.

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++

(

)

[inline]

Definition at line 2425 of file tree.hh.

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

breadth_first_queued_iterator& tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+=

(

unsigned

int

)

template<class T , class tree_node_allocator >

tree< T, tree_node_allocator >::breadth_first_queued_iterator & tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator+=

(

unsigned int

num

)

[inline]

Definition at line 2452 of file tree.hh.

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator==

(

const breadth_first_queued_iterator &

)

const

template<class T , class tree_node_allocator >

bool tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator==

(

const breadth_first_queued_iterator &

other

)

const [inline]

Definition at line 2418 of file tree.hh.

---

Member Data Documentation

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>

std::queue< tree_node * > tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue [private]

Definition at line 180 of file tree.hh.

---

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