THashTable THashTable implements a hash table to store TObject's. The hash value is calculated using the value returned by the TObject's Hash() function. Each class inheriting from TObject can override Hash() as it sees fit. THashTable does not preserve the insertion order of the objects. If the insertion order is important AND fast retrieval is needed use THashList instead./* */
THashTableIter(const THashTableIter& iter) | |
THashTableIter(const THashTable* ht, Bool_t dir = kIterForward) | |
~THashTableIter() | |
static TClass* | Class() |
virtual const TCollection* | GetCollection() const |
virtual Option_t* | TIterator::GetOption() const |
virtual TClass* | IsA() const |
virtual TObject* | Next() |
TObject* | TIterator::operator()() |
virtual TIterator& | operator=(const TIterator& rhs) |
THashTableIter& | operator=(const THashTableIter& rhs) |
virtual void | Reset() |
virtual void | ShowMembers(TMemberInspector& insp, char* parent) |
virtual void | Streamer(TBuffer& b) |
void | StreamerNVirtual(TBuffer& b) |
THashTableIter() | |
Int_t | NextSlot() |
Int_t | fCursor | current position in table |
Bool_t | fDirection | iteration direction |
TListIter* | fListCursor | current position in collision list |
const THashTable* | fTable | hash table being iterated |
Create a hashtable iterator. By default the iteration direction is kIterForward. To go backward use kIterBackward.
Reset the hashtable iterator. Either to beginning or end, depending on the initial iteration direction.