treeindexedD2iterinternal< T > Class Template Reference

Iterate over the internal nodes (not leaves). More...

#include <treeindexedD2iter.h>

Inheritance diagram for treeindexedD2iterinternal< T >:

Collaboration diagram for treeindexedD2iterinternal< T >:

List of all members.

Public Member Functions
	treeindexedD2iterinternal (treeindexedD2< T > &tree_, boolc setreset=true)
	Pass in the tree.
void	operator++ ()
	Move to the next internal node.
void	reset ()
	Reset the iterator.
	treeindexedD2iterinternal (treeindexedD2< T > &tree_, boolc setreset=true)
	Pass in the tree.
void	operator++ ()
	Move to the next internal node.
void	reset ()
	Reset the iterator.

---

Detailed Description

template<typename T>
class treeindexedD2iterinternal< T >

Iterate over the internal nodes (not leaves).

Definition at line 90 of file treeindexedD2iter.h.

---

Constructor & Destructor Documentation

template<typename T >

treeindexedD2iterinternal< T >::treeindexedD2iterinternal	(	treeindexedD2< T > &	tree_,
		boolc	setreset = true
	)			[inline]

Pass in the tree.

Definition at line 128 of file treeindexedD2iter.h.

  : treeindexedD2iter<T>(tree_,setreset) 
{
  if (setreset==false)
    return;

  // Warning, deliberate duplicate code - same as in reset().

  if (! treeindexedD2iter<T>::operator !())
    return;

  if (treeindexedD2iter<T>::operator()()->isleaf())
    treeindexedD2iterinternal<T>::operator++();
}

template<typename T >

treeindexedD2iterinternal< T >::treeindexedD2iterinternal	(	treeindexedD2< T > &	tree_,
		boolc	setreset = true
	)

Pass in the tree.

---

Member Function Documentation

template<typename T >

void treeindexedD2iterinternal< T >::operator++

(

)

Move to the next internal node.

Reimplemented from treeindexedD2iter< T >.

template<typename T >

void treeindexedD2iterinternal< T >::operator++

(

)

[inline]

Move to the next internal node.

Reimplemented from treeindexedD2iter< T >.

Definition at line 147 of file treeindexedD2iter.h.

Referenced by treeindexedD2iterinternal< T >::reset().

{
  treeindexedD2iter<T>::operator ++ ();

  while (treeindexedD2iter<T>::operator ! ()) 
  {
    if (! treeindexedD2iter<T>::operator ()()->isleaf())
      return;

    treeindexedD2iter<T>::operator ++ ();
  }
}

template<typename T >

void treeindexedD2iterinternal< T >::reset

(

)

Reset the iterator.

Reimplemented from treeindexedD2iter< T >.

template<typename T >

void treeindexedD2iterinternal< T >::reset

(

)

[inline]

Reset the iterator.

Reimplemented from treeindexedD2iter< T >.

Definition at line 113 of file treeindexedD2iter.h.

References treeindexedD2iterinternal< T >::operator++().

{
  treeindexedD2iter<T>::reset();

  // Warning, deliberate duplicate code - same as in constructor treeindexedD2iterinternal(...).

  if (! treeindexedD2iter<T>::operator !())
    return;

  if (treeindexedD2iter<T>::operator()()->isleaf())
    treeindexedD2iterinternal<T>::operator++();
}

---

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

• bsptrees/treeindexedD2iter.h
• bsptrees/treeindexediter.h