#include <hash.h>
Public Methods | |
| HashIterator (HashTable< Key, T > *table) | |
| initialize an iterator. More... | |
| ~HashIterator () | |
| bool | IsDone () |
| T | Item () |
| void | Next () |
| update iterator to point to next. More... | |
Private Attributes | |
| HashTable<Key,T>* | table |
| the hash table we're stepping through. More... | |
| int | bucket |
| current bucket we are in. More... | |
| ListIterator<T>* | bucketIter |
| where we are in the bucket. More... | |
Definition at line 100 of file hash.h.
|
||||
|
initialize an iterator. HashIterator<Key,T>::HashIterator Initialize a data structure to allow us to step through every entry in a has table. |
|
||||
|
|
|
||||
|
Definition at line 106 of file hash.h. Referenced by Item(), and HashTable::SelfTest().
|
|
||||
|
|
|
||||
|
update iterator to point to next. HashIterator<Key,T>::Next Update iterator to point to the next item in the table. Definition at line 349 of file hash.cc. Referenced by HashTable::SelfTest().
|
|
|||
|
current bucket we are in.
|
|
|||
|
where we are in the bucket.
|
|
|||
|
the hash table we're stepping through.
|
1.2.8.1 written by Dimitri van Heesch,
© 1997-2001