HashTable::Iterator Class Reference

#include <HashTable.hh>

Inheritance diagram for HashTable::Iterator:

[legend]

Public Member Functions
virtual	~Iterator ()
virtual void *	next (char const *&key)=0
Static Public Member Functions
static Iterator *	create (HashTable &hashTable)
Protected Member Functions
	Iterator ()

---

Detailed Description

Definition at line 44 of file HashTable.hh.

---

Constructor & Destructor Documentation

HashTable::Iterator::~Iterator

(

)

[virtual]

Definition at line 31 of file HashTable.cpp.

{}

HashTable::Iterator::Iterator

(

)

[protected]

Definition at line 28 of file HashTable.cpp.

                            {
}

---

Member Function Documentation

HashTable::Iterator * HashTable::Iterator::create

(

HashTable &

hashTable

)

[static]

Definition at line 122 of file BasicHashTable.cpp.

References BasicHashTable::Iterator.

Referenced by RTCPMemberDatabase::reapOldMembers(), and HashTable::RemoveNext().

                                                                 {
  // "hashTable" is assumed to be a BasicHashTable
  return new BasicHashTable::Iterator((BasicHashTable&)hashTable);
}

void * BasicHashTable::Iterator::next

(

char const *&

key

)

[pure virtual]

Implemented in BasicHashTable::Iterator.

Definition at line 102 of file BasicHashTable.cpp.

References BasicHashTable::TableEntry::fNext, BasicHashTable::TableEntry::key, NULL, and BasicHashTable::TableEntry::value.

                                                   {
  while (fNextEntry == NULL) {
    if (fNextIndex >= fTable.fNumBuckets) return NULL;

    fNextEntry = fTable.fBuckets[fNextIndex++];
  }

  BasicHashTable::TableEntry* entry = fNextEntry;
  fNextEntry = entry->fNext;
  
  key = entry->key;
  return entry->value;
}

---

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

• UsageEnvironment/include/HashTable.hh
• UsageEnvironment/HashTable.cpp
• BasicUsageEnvironment/BasicHashTable.cpp

---