tree< T, tree_node_allocator >::fixed_depth_iterator Class Reference

#include <tree.h>

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

[legend]

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

[legend]

---

Detailed Description

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

Iterator which traverses only the nodes at a given depth from the root.

Definition at line 221 of file tree.h.

Public Member Functions
	fixed_depth_iterator ()
	fixed_depth_iterator (tree_node *)
	fixed_depth_iterator (const iterator_base &)
	fixed_depth_iterator (const sibling_iterator &)
	fixed_depth_iterator (const fixed_depth_iterator &)
bool	operator== (const fixed_depth_iterator &) const
bool	operator!= (const fixed_depth_iterator &) const
fixed_depth_iterator &	operator++ ()
fixed_depth_iterator &	operator-- ()
fixed_depth_iterator	operator++ (int)
fixed_depth_iterator	operator-- (int)
fixed_depth_iterator &	operator+= (unsigned int)
fixed_depth_iterator &	operator-= (unsigned int)
Data Fields
tree_node *	first_parent_
Private Member Functions
void	set_first_parent_ ()
void	find_leftmost_parent_ ()

---

Constructor & Destructor Documentation

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator

(

)

[inline]

Definition at line 2222 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_().

   : iterator_base()
   {
   set_first_parent_();
   }

Here is the call graph for this function:

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator

(

tree_node *

tn

)

[inline]

Definition at line 2229 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_().

   : iterator_base(tn)
   {
   set_first_parent_();
   }

Here is the call graph for this function:

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator

(

const iterator_base &

other

)

[inline]

Definition at line 2236 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_().

   : iterator_base(other.node)
   {
   set_first_parent_();
   }

Here is the call graph for this function:

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator

(

const sibling_iterator &

other

)

[inline]

Definition at line 2243 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_().

   : iterator_base(other.node), first_parent_(other.parent_)
   {
   find_leftmost_parent_();
   }

Here is the call graph for this function:

template<class T, class tree_node_allocator>

tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator

(

const fixed_depth_iterator &

other

)

[inline]

Definition at line 2250 of file tree.h.

   : iterator_base(other.node), first_parent_(other.first_parent_)
   {
   }

---

Member Function Documentation

template<class T, class tree_node_allocator>

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

(

const fixed_depth_iterator &

other

)

const [inline]

Definition at line 2256 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_, and tree< T, tree_node_allocator >::iterator_base::node.

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

template<class T, class tree_node_allocator>

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

(

const fixed_depth_iterator &

other

)

const [inline]

Definition at line 2263 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_, and tree< T, tree_node_allocator >::iterator_base::node.

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

template<class T, class tree_node_allocator>

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

(

)

[inline]

Definition at line 2295 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);

   if(this->node->next_sibling) {
      this->node=this->node->next_sibling;
      }
   else { 
      int relative_depth=0;
      upper:
      do {
         this->node=this->node->parent;
         if(this->node==0) return *this;
         --relative_depth;
         } while(this->node->next_sibling==0);
      lower:
      this->node=this->node->next_sibling;
      while(this->node->first_child==0) {
         if(this->node->next_sibling==0)
            goto upper;
         this->node=this->node->next_sibling;
         if(this->node==0) return *this;
         }
      while(relative_depth<0 && this->node->first_child!=0) {
         this->node=this->node->first_child;
         ++relative_depth;
         }
      if(relative_depth<0) {
         if(this->node->next_sibling==0) goto upper;
         else                          goto lower;
         }
      }
   return *this;

// if(this->node->next_sibling!=0) {
//    this->node=this->node->next_sibling;
//    assert(this->node!=0);
//    if(this->node->parent==0 && this->node->next_sibling==0) // feet element
//       this->node=0;
//    }
// else {
//    tree_node *par=this->node->parent;
//    do {
//       par=par->next_sibling;
//       if(par==0) { // FIXME: need to keep track of this!
//          this->node=0;
//          return *this;
//          }
//       } while(par->first_child==0);
//    this->node=par->first_child;
//    }
   return *this;
   }

template<class T, class tree_node_allocator>

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

(

)

[inline]

Definition at line 2350 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);
   if(this->node->prev_sibling!=0) {
      this->node=this->node->prev_sibling;
      assert(this->node!=0);
      if(this->node->parent==0 && this->node->prev_sibling==0) // head element
         this->node=0;
      }
   else {
      tree_node *par=this->node->parent;
      do {
         par=par->prev_sibling;
         if(par==0) { // FIXME: need to keep track of this!
            this->node=0;
            return *this;
            }
         } while(par->last_child==0);
      this->node=par->last_child;
      }
   return *this;
}

template<class T, class tree_node_allocator>

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

(

int

)

[inline]

Definition at line 2374 of file tree.h.

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

template<class T, class tree_node_allocator>

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

(

int

)

[inline]

Definition at line 2382 of file tree.h.

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

template<class T, class tree_node_allocator>

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

(

unsigned int

num

)

[inline]

Definition at line 2400 of file tree.h.

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

template<class T, class tree_node_allocator>

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

(

unsigned int

num

)

[inline]

Definition at line 2390 of file tree.h.

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

template<class T, class tree_node_allocator>

void tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_

(

)

[inline, private]

Definition at line 2270 of file tree.h.

References tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_(), tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_, tree< T, tree_node_allocator >::iterator_base::node, and tree_node_< T >::parent.

Referenced by tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator().

   {
   return; // FIXME: we do not use first_parent_ yet, and it actually needs some serious reworking if
           // it is ever to work at the 'head' level.
   first_parent_=0;
   if(this->node==0) return;
   if(this->node->parent!=0)
      first_parent_=this->node->parent;
   if(first_parent_)
      find_leftmost_parent_();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class T, class tree_node_allocator>

void tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_

(

)

[inline, private]

Definition at line 2283 of file tree.h.

References tree_node_< T >::first_child, tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_, and tree_node_< T >::prev_sibling.

Referenced by tree< T, tree_node_allocator >::fixed_depth_iterator::fixed_depth_iterator(), and tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_().

   {
   return; // FIXME: see 'set_first_parent()'
   tree_node *tmppar=first_parent_;
   while(tmppar->prev_sibling) {
      tmppar=tmppar->prev_sibling;
      if(tmppar->first_child)
         first_parent_=tmppar;
      }
   }

Here is the caller graph for this function:

---

Field Documentation

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

tree_node* tree< T, tree_node_allocator >::fixed_depth_iterator::first_parent_

Definition at line 238 of file tree.h.

Referenced by tree< T, tree_node_allocator >::fixed_depth_iterator::find_leftmost_parent_(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator!=(), tree< T, tree_node_allocator >::fixed_depth_iterator::operator==(), and tree< T, tree_node_allocator >::fixed_depth_iterator::set_first_parent_().

---

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

• php-oracle/tree.h

---