131 #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) >= 40600 132 #pragma GCC diagnostic push 133 #pragma GCC diagnostic ignored "-Weffc++" 145 public std::iterator<std::bidirectional_iterator_tag,
146 TObject*, std::ptrdiff_t,
147 const TObject**, const TObject*&> {
173 #if (__GNUC__ * 10000 + __GNUC_MINOR__ * 100 + __GNUC_PATCHLEVEL__) >= 40600 174 #pragma GCC diagnostic pop Int_t Capacity() const
Return number of slots in the hashtable.
TPair(TObject *key, TObject *value)
const char * GetName() const
Returns name of object.
virtual ULong_t Hash() const
Return hash value for this object.
TPair * RemoveEntry(TObject *key)
Remove (key,value) pair with key from the map.
TObject ** GetObjectRef(const TObject *obj) const
TObject ** GetObjectRef(const TObject *obj) const
Return address of pointer to obj.
Bool_t IsEqual(const TObject *obj) const
Default equal comparison (objects are equal if they have the same address in memory).
Bool_t TestBit(UInt_t f) const
void Add(TObject *obj)
This function may not be used (but we need to provide it since it is a pure virtual in TCollection)...
virtual Int_t Write(const char *name=0, Int_t option=0, Int_t bufsize=0)
Write all objects in this map.
virtual ~TMap()
TMap dtor.
Iterator abstract base class.
THashTable implements a hash table to store TObject's.
#define ClassDef(name, id)
Bool_t IsOwnerValue() const
void DeleteAll()
Remove all (key,value) pairs from the map AND delete the keys AND values when they are allocated on t...
Float_t AverageCollisions() const
Return the ratio of entries vs occupied slots.
const Bool_t kIterForward
const THashTable * GetTable() const
const TCollection * GetCollection() const
Bool_t operator!=(const TDatime &d1, const TDatime &d2)
virtual Bool_t IsEqual(const TObject *obj) const
Default equal comparison (objects are equal if they have the same address in memory).
TIterator * MakeIterator(Bool_t dir=kIterForward) const
Create an iterator for TMap.
void SetValue(TObject *val)
virtual void SetOwnerValue(Bool_t enable=kTRUE)
Set whether this map is the owner (enable==true) of its values.
Using a TBrowser one can browse all ROOT objects.
virtual void SetOwnerKeyValue(Bool_t ownkeys=kTRUE, Bool_t ownvals=kTRUE)
Set ownership for keys and values.
void Delete(Option_t *option="")
Remove all (key,value) pairs from the map AND delete the keys when they are allocated on the heap...
TObject * Remove(TObject *key)
Remove the (key,value) pair with key from the map.
TTime operator*(const TTime &t1, const TTime &t2)
Bool_t DeleteEntry(TObject *key)
Remove (key,value) pair with key from the map.
Collection abstract base class.
TObject * operator()(const TObject *key) const
void Reset(Detail::TBranchProxy *x)
void DeleteValues()
Remove all (key,value) pairs from the map AND delete the values when they are allocated on the heap...
void Rehash(Int_t newCapacity, Bool_t checkObjValidity=kTRUE)
Rehash the underlaying THashTable (see THashTable::Rehash()).
Class used by TMap to store (key,value) pairs.
TMap implements an associative array of (key,value) pairs using a THashTable for efficient retrieval ...
ULong_t Hash() const
Return hash value for this object.
void Browse(TBrowser *b)
Browse this collection (called by TBrowser).
Int_t Collisions(const char *keyname) const
Returns the number of collisions for a key with a certain name (i.e.
Mother of all ROOT objects.
virtual const char * GetTitle() const
Returns title of object.
TObject * FindObject(const char *keyname) const
Check if a (key,value) pair exists with keyname as name of the key.
you should not use this method at all Int_t Int_t Double_t Double_t Double_t Int_t Double_t Double_t Double_t Double_t b
TObject * operator()(const char *keyname) const
const char * GetTitle() const
Returns title of object.
TObject * GetValue(const char *keyname) const
Returns a pointer to the value associated with keyname as name of the key.
Bool_t IsFolder() const
Returns kTRUE in case object contains browsable objects (like containers or lists of other objects)...
virtual const char * GetName() const
Returns name of object.
virtual void PrintCollectionEntry(TObject *entry, Option_t *option, Int_t recurse) const
Print the collection entry.
void Clear(Option_t *option="")
Remove all (key,value) pairs from the map.
TMap & operator=(const TMap &map)