class THashTable: public TCollection

 Create a THashTable object. Capacity is the initial hashtable capacity
 (i.e. number of slots), by default kInitHashTableCapacity = 17, and
 rehashlevel is the value at which a rehash will be triggered. I.e. when
 the average size of the linked lists at a slot becomes longer than
 rehashlevel then the hashtable will be resized and refilled to reduce
 the collision rate to about 1. The higher the collision rate, i.e. the
 longer the linked lists, the longer lookup will take. If rehashlevel=0
 the table will NOT automatically be rehashed. Use Rehash() for manual
 rehashing.

 Delete a hashtable. Objects are not deleted unless the THashTable is the
 owner (set via SetOwner()).

 Add object to the hash table. Its position in the table will be
 determined by the value returned by its Hash() function.

 Add object to the hash table. Its position in the table will be
 determined by the value returned by its Hash() function.
 If and only if 'before' is in the same bucket as obj, obj is added
 in front of 'before' within the bucket's list.

 Add all objects from collection col to this collection.
 Implemented for more efficient rehashing.

 Remove all objects from the table. Does not delete the objects
 unless the THashTable is the owner (set via SetOwner()).

 Returns the number of collisions for an object with a certain name
 (i.e. number of objects in same slot in the hash table, i.e. length
 of linked list).

 Returns the number of collisions for an object (i.e. number of objects
 in same slot in the hash table, i.e. length of linked list).

 Remove all objects from the table AND delete all heap based objects.

 Find object using its name. Uses the hash value returned by the
 TString::Hash() after converting name to a TString.

 Find object using its hash value (returned by its Hash() member).

 Return the TList corresponding to object's name based hash value.
 One can iterate this list "manually" to find, e.g. objects with
 the same name.

 Return the TList corresponding to object's hash value.
 One can iterate this list "manually" to find, e.g. identical
 objects.

 Return address of pointer to obj

 Returns a hash table iterator.

 Rehash the hashtable. If the collision rate becomes too high (i.e.
 the average size of the linked lists become too long) then lookup
 efficiency decreases since relatively long lists have to be searched
 every time. To improve performance rehash the hashtable. This resizes
 the table to newCapacity slots and refills the table. Use
 AverageCollisions() to check if you need to rehash. Set checkObjValidity
 to kFALSE if you know that all objects in the table are still valid
 (i.e. have not been deleted from the system in the meanwhile).

 Remove object from the hashtable.

 Remove object from the hashtable without using the hash value.