tree< T, tree_node_allocator >::breadth_first_queued_iterator Class Reference

#include <tree.h>

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

[legend]

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

[legend]

---

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 200 of file tree.h.

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

---

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 2147 of file tree.h.

   : iterator_base()
   {
   }

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 2153 of file tree.h.

References tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue.

   : iterator_base(tn)
   {
   traversal_queue.push(tn);
   }

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 2160 of file tree.h.

References tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue.

   : iterator_base(other.node)
   {
   traversal_queue.push(other.node);
   }

---

Member Function Documentation

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 2174 of file tree.h.

References tree< T, tree_node_allocator >::iterator_base::node.

   {
   if(other.node==this->node) return true;
   else return false;
   }

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 2167 of file tree.h.

References tree< T, tree_node_allocator >::iterator_base::node.

   {
   if(other.node!=this->node) return true;
   else return false;
   }

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 2181 of file tree.h.

References tree< T, tree_node_allocator >::iterator_base::begin(), tree< T, tree_node_allocator >::iterator_base::end(), tree< T, tree_node_allocator >::iterator_base::node, and tree< T, tree_node_allocator >::breadth_first_queued_iterator::traversal_queue.

   {
   assert(this->node!=0);

   // Add child nodes and pop current node
   sibling_iterator sib=this->begin();
   while(sib!=this->end()) {
      traversal_queue.push(sib.node);
      ++sib;
      }
   traversal_queue.pop();
   if(traversal_queue.size()>0)
      this->node=traversal_queue.front();
   else 
      this->node=0;
   return (*this);
   }

Here is the call graph for this function:

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

n

)

[inline]

Definition at line 2200 of file tree.h.

   {
   breadth_first_queued_iterator copy = *this;
   ++(*this);
   return copy;
   }

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 2208 of file tree.h.

   {
   while(num>0) {
      ++(*this);
      --num;
      }
   return (*this);
   }

---

Field 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 213 of file tree.h.

Referenced by tree< T, tree_node_allocator >::breadth_first_queued_iterator::breadth_first_queued_iterator(), and tree< T, tree_node_allocator >::breadth_first_queued_iterator::operator++().

---

The documentation for this class was generated from the following file:

• php-oracle/tree.h

---