tree< T, tree_node_allocator >::leaf_iterator Class Reference

#include <tree.h>

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

[legend]

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

[legend]

---

Detailed Description

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

Iterator which traverses only the leaves.

Definition at line 269 of file tree.h.

Public Member Functions
	leaf_iterator ()
	leaf_iterator (tree_node *)
	leaf_iterator (const sibling_iterator &)
	leaf_iterator (const iterator_base &)
bool	operator== (const leaf_iterator &) const
bool	operator!= (const leaf_iterator &) const
leaf_iterator &	operator++ ()
leaf_iterator &	operator-- ()
leaf_iterator	operator++ (int)
leaf_iterator	operator-- (int)
leaf_iterator &	operator+= (unsigned int)
leaf_iterator &	operator-= (unsigned int)

---

Constructor & Destructor Documentation

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator

(

)

[inline]

Definition at line 2521 of file tree.h.

   : iterator_base(0)
   {
   }

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator

(

tree_node *

tn

)

[inline]

Definition at line 2527 of file tree.h.

   : iterator_base(tn)
   {
   }

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator

(

const sibling_iterator &

other

)

[inline]

Definition at line 2539 of file tree.h.

References tree< T, tree_node_allocator >::iterator_base::node, tree< T, tree_node_allocator >::sibling_iterator::parent_, and tree< T, tree_node_allocator >::sibling_iterator::range_last().

   : iterator_base(other.node)
   {
   if(this->node==0) {
      if(other.range_last()!=0)
         this->node=other.range_last();
      else 
         this->node=other.parent_;
      ++(*this);
      }
   }

Here is the call graph for this function:

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator::leaf_iterator

(

const iterator_base &

other

)

[inline]

Definition at line 2533 of file tree.h.

   : iterator_base(other.node)
   {
   }

---

Member Function Documentation

template<class T, class tree_node_allocator>

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

(

const leaf_iterator &

other

)

const [inline]

Definition at line 1872 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 >::leaf_iterator::operator!=

(

const leaf_iterator &

other

)

const [inline]

Definition at line 1865 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 >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator++

(

)

[inline]

Definition at line 2552 of file tree.h.

References tree_node_< T >::first_child, tree_node_< T >::next_sibling, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::parent.

   {
   assert(this->node!=0);
   while(this->node->next_sibling==0) {
      if (this->node->parent==0) return *this;
      this->node=this->node->parent;
      }
   this->node=this->node->next_sibling;
   while(this->node->first_child)
      this->node=this->node->first_child;
   return *this;
   }

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator--

(

)

[inline]

Definition at line 2566 of file tree.h.

References tree_node_< T >::last_child, tree< T, tree_node_allocator >::iterator_base::node, tree_node_< T >::parent, and tree_node_< T >::prev_sibling.

   {
   assert(this->node!=0);
   while (this->node->prev_sibling==0) {
      if (this->node->parent==0) return *this;
      this->node=this->node->parent;
      }
   this->node=this->node->prev_sibling;
   while(this->node->last_child)
      this->node=this->node->last_child;
   return *this;
   }

template<class T, class tree_node_allocator>

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

(

int

)

[inline]

Definition at line 2580 of file tree.h.

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

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator tree< T, tree_node_allocator >::leaf_iterator::operator--

(

int

)

[inline]

Definition at line 2588 of file tree.h.

   {
   leaf_iterator copy = *this;
   --(*this);
   return copy;
   }

template<class T, class tree_node_allocator>

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

(

unsigned int

num

)

[inline]

Definition at line 2597 of file tree.h.

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

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::leaf_iterator & tree< T, tree_node_allocator >::leaf_iterator::operator-=

(

unsigned int

num

)

[inline]

Definition at line 2607 of file tree.h.

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

---

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

• php-oracle/tree.h

---