TMap

class TMap : public TCollection

    public:

                    TMap TMap(Int_t capacity = TCollection::kInitHashTableCapacity, Int_t rehash = 0)
            virtual void ~TMap()
                    void Add(TObject* key, TObject* value)
            virtual void Add(TObject* obj)
                 Float_t AverageCollisions() const
                   Int_t Capacity() const
                 TClass* Class()
            virtual void Clear(Option_t* option)
                   Int_t Collisions(TObject* key) const
                   Int_t Collisions(const char* keyname) const
            virtual void Delete(Option_t* option)
                    void DeleteAll()
        virtual TObject* FindObject(TObject* key) const
        virtual TObject* FindObject(const Text_t* keyname) const
                TObject* GetValue(TObject* key) const
         virtual TClass* IsA() const
      virtual TIterator* MakeIterator(Bool_t dir = kIterForward) const
                    void Rehash(Int_t newCapacity, Bool_t checkObjValidity = kTRUE)
        virtual TObject* Remove(TObject* key)
            virtual void ShowMembers(TMemberInspector& insp, char* parent)
            virtual void Streamer(TBuffer& b)

  Data Members
    private:

      THashTable* fTable  Hash table used to store TAssociation's

Class Description

                                                                      
 TMap                                                                 
                                                                      
 TMap implements an associative array of (key,value) pairs using a    
 THashTable for efficient retrieval (therefore TMap does not conserve 
 the order of the entries). The hash value is calculated              
 using the value returned by the keys Hash() function. Both key and   
 value need to inherit from TObject.                                  

/*

*/

                                                                      

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

 TMap dtor.

 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 but DO NOT delete the keys
 and/or 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 keys AND
 values when they are allocated on the heap.

 Check if a (key,value) pair exists with keyname as name of the key.
 Returns a TAssoc* (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 TAssoc* (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 key.

 Create an iterator for TMap.

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

 Remove the (key,value) pair with key from the map.

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

Inline Functions

            TClass* Class()
            TClass* IsA() const
               void ShowMembers(TMemberInspector& insp, char* parent)