KKB::Iterator< Entry, CompareNodes, KeyType > Class Template Reference

#include <RBTree.h>

Public Types
typedef Entry *	EntryPtr
typedef RBnode< Entry > *	NodePtr
typedef RBTree< Entry, CompareNodes, KeyType > *	TreePtr

Public Member Functions
	Iterator (TreePtr _tree)
	~Iterator ()
EntryPtr	GetEqual (const KeyType &key)
EntryPtr	GetFirst ()
EntryPtr	GetGreater (const KeyType &key)
EntryPtr	GetGreaterOrEqual (const KeyType &key)
EntryPtr	GetLast ()
EntryPtr	GetNext ()
EntryPtr	GetPrev ()

Friends
class	RBTree< Entry, CompareNodes, KeyType >

Detailed Description

template<class Entry, class CompareNodes, typename KeyType>
class KKB::Iterator< Entry, CompareNodes, KeyType >

Definition at line 72 of file RBTree.h.

Member Typedef Documentation

template<class Entry , class CompareNodes , typename KeyType >

typedef Entry* KKB::Iterator< Entry, CompareNodes, KeyType >::EntryPtr

Definition at line 77 of file RBTree.h.

template<class Entry , class CompareNodes , typename KeyType >

typedef RBnode<Entry>* KKB::Iterator< Entry, CompareNodes, KeyType >::NodePtr

Definition at line 79 of file RBTree.h.

template<class Entry , class CompareNodes , typename KeyType >

typedef RBTree<Entry,CompareNodes,KeyType>* KKB::Iterator< Entry, CompareNodes, KeyType >::TreePtr

Definition at line 75 of file RBTree.h.

Constructor & Destructor Documentation

template<class Entry , class CompareNodes , typename KeyType >

KKB::Iterator< Entry, CompareNodes, KeyType >::Iterator

(

TreePtr

_tree

)

Definition at line 1641 of file RBTree.h.

{
  tree = _tree;

  prevNode = tree->nil;
  curNode  = tree->nil;
  nextNode = tree->Minimum ();

  tree->IteratorAdd (this);
}

template<class Entry , class CompareNodes , typename KeyType >

KKB::Iterator< Entry, CompareNodes, KeyType >::~Iterator

(

)

Definition at line 1655 of file RBTree.h.

{
  if  (tree)
    tree->IteratorDelete (this);
}

Member Function Documentation

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetEqual

(

const KeyType &

key

)

Definition at line 1684 of file RBTree.h.

{
  IsTreeStillThere ();

  curNode = tree->GetEqual (tree->root, key);

  if  (curNode == tree.nil)
  {
    nextNode = tree->GetGreater (tree->root, key);
    if  (nextNode == tree.nil)
      prevNode = tree->GetLess (tree->root, key);

    else
      prevNode = tree->Predecessor (nextNode);
  
    return NULL;
  }


  prevNode = tree->Predecessor (curNode);
  nextNode = tree->Successor (curNode);

  return  curNode->Data ();
}

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetFirst

(

)

Definition at line 1765 of file RBTree.h.

{
  IsTreeStillThere ();

  prevNode = tree->nil;
  curNode  = tree->Minimum ();
  nextNode = tree->Successor (curNode);

  return  curNode->Data ();
}

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetGreater

(

const KeyType &

key

)

Definition at line 1713 of file RBTree.h.

{
  IsTreeStillThere ();

  curNode = tree->GetGreater (tree->root, key);

  if  (curNode == tree->nil)
  {
    nextNode = tree->nil;
    prevNode = tree->Maximum (tree->root);
  }

  else
  {
    nextNode = tree->Successor (curNode);
    prevNode = tree->Predecessor (curNode);
  }

  return  curNode->Data ();
}  /* Iterator::GetGreater */

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetGreaterOrEqual

(

const KeyType &

key

)

Definition at line 1738 of file RBTree.h.

{
  IsTreeStillThere ();

  curNode = tree->GetGreaterOrEqual (tree->root, key);

  if  (curNode == tree->nil)
  {
    nextNode = tree->nil;
    prevNode = tree->Maximum (tree->root);
  }

  else
  {
    nextNode = tree->Successor (tree.curMode);
    prevNode = tree->Predecessor (tree.curNode);
  }

  return  curNode->Data ();
}  /* Iterator::GetGreaterOrEqual */

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetLast

(

)

Definition at line 1780 of file RBTree.h.

{
  IsTreeStillThere ();
  
  curNode  = tree->Maximum ();
  prevNode = tree->Predecessor (curNode);
  nextNode = tree->nil;

  return  curNode->Data ();
}

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetNext

(

)

Definition at line 1795 of file RBTree.h.

{
  IsTreeStillThere ();


  if  (nextNode == tree->nil)
  {
    return NULL;
  }

  prevNode = curNode;
  curNode = nextNode;

  if  (prevNode == tree->nil)
  {
    prevNode = tree->Predecessor (curNode);
  }

  nextNode = tree->Successor (curNode);
  
  return  curNode->Data ();  
}

template<class Entry , class CompareNodes , typename KeyType >

Entry * KKB::Iterator< Entry, CompareNodes, KeyType >::GetPrev

(

)

Definition at line 1822 of file RBTree.h.

{
  IsTreeStillThere ();

  if  (prevNode == tree->nil)
  {
    return NULL;
  }

  nextNode = curNode;
  curNode = prevNode;

  if  (nextNode == tree->nil)
  {
    prevNode = tree->Successor (curNode);
  }

  prevNode = tree->Predecessor (curNode);
  
  return  curNode->Data ();  
}

Friends And Related Function Documentation

template<class Entry , class CompareNodes , typename KeyType >

friend class RBTree< Entry, CompareNodes, KeyType >

friend

Definition at line 81 of file RBTree.h.

---

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

• C:/Users/Kurt/GitHub/KSquareLibraries/KKBase/RBTree.h