class TMap: public TCollection

 TMap ctor. See THashTable for a description of the arguments.

 TMap dtor. Objects are not deleted unless the TMap is the
 owner (set via SetOwner()).

 This function may not be used (but we need to provide it since it is
 a pure virtual in TCollection). Use Add(key,value) instead.

 Add a (key,value) pair to the map.

 Return the ratio of entries vs occupied slots.

 Return number of slots in the hashtable. Use GetSize() to get the
 number of objects stored in the TMap.

 Remove all (key,value) pairs from the map. The keys/values are
 deleted depending on the state of key-ownership (SetOwner()) and
 value-ownership (SetOwnerValue()).

 To delete these objects regardless of the ownership state use:
  - Delete()       to delete only keys;
  - DeleteValues() to delete only values;
  - DeleteAll()    to delete both keys and values.

 Returns the number of collisions for a key 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 a key (i.e. number of objects
 in same slot in the hash table, i.e. length of linked list).

 Remove all (key,value) pairs from the map AND delete the keys
 when they are allocated on the heap.

 Remove all (key,value) pairs from the map AND delete the values
 when they are allocated on the heap.

 Remove all (key,value) pairs from the map AND delete the keys AND
 values when they are allocated on the heap.

 Remove (key,value) pair with key from the map. Returns true
 if the key was found and removed, false otherwise.
 The key and value objects are deleted if map is the owner
 of keys and values respectively.

 Check if a (key,value) pair exists with keyname as name of the key.
 Returns a TPair* (need to downcast from TObject). Use Key() and
 Value() to get the pointers to the key and value, respectively.
 Returns 0 if not found.

 Check if a (key,value) pair exists with key as key.
 Returns a TPair* (need to downcast from TObject). Use Key() and
 Value() to get the pointers to the key and value, respectively.
 Returns 0 if not found.

 Returns a pointer to the value associated with keyname as name of the key.

 Returns a pointer to the value associated with key.

 Create an iterator for TMap.

 Print the collection entry.

 Rehash the underlaying THashTable (see THashTable::Rehash()).

 Remove the (key,value) pair with key from the map. Returns the
 key object or 0 in case key was not found. If map is the owner
 of values, the value is deleted.

 Remove (key,value) pair with key from the map. Returns the
 pair object or 0 in case the key was not found.
 It is caller's responsibility to delete the pair and, eventually,
 the key and value objects.

 Set whether this map is the owner (enable==true)
 of its values.  If it is the owner of its contents,
 these objects will be deleted whenever the collection itself
 is deleted. The objects might also be deleted or destructed when Clear
 is called (depending on the collection).

 Set ownership for keys and values.

 Stream all key/value pairs in the map to or from the I/O buffer.

 Write all objects in this map. By default all objects in
 the collection are written individually (each object gets its
 own key). Note, this is recursive, i.e. objects in collections
 in the collection are also written individually. To write all
 objects using a single key specify a name and set option to
 TObject::kSingleKey (i.e. 1).

 Write all objects in this map. By default all objects in
 the collection are written individually (each object gets its
 own key). Note, this is recursive, i.e. objects in collections
 in the collection are also written individually. To write all
 objects using a single key specify a name and set option to
 TObject::kSingleKey (i.e. 1).