Inheritance diagram for Hashtable< T >:

Assumes, that stored objects can be nullable (so, null object is returned, when no match is found).
Public Member Functions | |
| Hashtable (int capacity, double loadFactor=DEFAULT_LOAD_FACTOR) | |
| T | get (const String *key) const |
| T | enumerate () const |
| Starts internal hashtable enumeration procedure. | |
| T | next () const |
| Returns the next value object with current enumeration procedure. | |
|
|||||||||
|
Starts internal hashtable enumeration procedure. Returns first element value in a sequence, or null, if hashtable is empty. |
|
|||||||||
|
Returns the next value object with current enumeration procedure. If hashtable state is changed, and next() call occurs, exception is thrown. If end of hash is reached, exception is thrown. |