//*CMZ : 2.22/07 05/07/99 18.55.09 by Fons Rademakers
//*CMZ : 2.00/12 01/10/98 12.43.39 by Rene Brun
//*CMZ : 2.00/06 11/06/98 18.38.10 by Fons Rademakers
//*CMZ : 1.03/09 03/12/97 02.15.24 by Fons Rademakers
//*-- Author : Fons Rademakers 12/11/95
//*KEEP,CopyRight,T=C.
/*************************************************************************
* Copyright(c) 1995-1999, The ROOT System, All rights reserved. *
* Authors: Rene Brun, Fons Rademakers. *
* For list of contributors see $ROOTSYS/AA_CREDITS. *
* *
* Permission to use, copy, modify and distribute this software and its *
* documentation for non-commercial purposes is hereby granted without *
* fee, provided that the above copyright notice appears in all copies *
* and that both the copyright notice and this permission notice appear *
* in the supporting documentation. The authors make no claims about the *
* suitability of this software for any purpose. It is provided "as is" *
* without express or implied warranty. *
*************************************************************************/
//*KEND.
//////////////////////////////////////////////////////////////////////////
// //
// 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. //
//
/*
*/
//
// //
//////////////////////////////////////////////////////////////////////////
//*KEEP,TMap.
#include "TMap.h"
//*KEEP,THashTable.
#include "THashTable.h"
//*KEEP,TROOT.
#include "TROOT.h"
//*KEEP,TClass.
#include "TClass.h"
//*KEEP,TBrowser.
#include "TBrowser.h"
//*KEND.
ClassImp(TMap)
//______________________________________________________________________________
TMap::TMap(Int_t capacity, Int_t rehashlevel)
{
// TMap ctor. See THashTable for a description of the arguments.
fSize = 0;
fTable = new THashTable(capacity, rehashlevel);
}
//______________________________________________________________________________
TMap::~TMap()
{
// TMap dtor.
Clear();
delete fTable;
}
//______________________________________________________________________________
void TMap::Add(TObject *)
{
// 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.
MayNotUse("Add(TObject *obj)");
}
//______________________________________________________________________________
void TMap::Add(TObject *key, TObject *value)
{
// Add a (key,value) pair to the map.
if (IsArgNull("Add", key)) return;
fTable->Add(new TAssoc(key, value));
fSize++;
}
//______________________________________________________________________________
Float_t TMap::AverageCollisions() const
{
// Return the ratio of entries vs occupied slots.
return fTable->AverageCollisions();
}
//______________________________________________________________________________
Int_t TMap::Capacity() const
{
// Return number of slots in the hashtable. Use GetSize() to get the
// number of objects stored in the TMap.
return fTable->Capacity();
}
//______________________________________________________________________________
void TMap::Clear(Option_t *option)
{
// Remove all (key,value) pairs from the map but DO NOT delete the keys
// and/or values.
fTable->Delete(option); // delete the TAssoc's
fSize = 0;
}
//______________________________________________________________________________
Int_t TMap::Collisions(const char *keyname) const
{
// 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).
return fTable->Collisions(keyname);
}
//______________________________________________________________________________
Int_t TMap::Collisions(TObject *key) const
{
// 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).
return fTable->Collisions(key);
}
//______________________________________________________________________________
void TMap::Delete(Option_t *option)
{
// Remove all (key,value) pairs from the map AND delete the keys
// when they are allocated on the heap.
TIter next(fTable);
TAssoc *a;
while ((a = (TAssoc *)next()))
if (a->Key() && a->Key()->IsOnHeap())
TCollection::GarbageCollect(a->Key());
fTable->Delete(option); // delete the TAssoc's
fSize = 0;
}
//______________________________________________________________________________
void TMap::DeleteAll()
{
// Remove all (key,value) pairs from the map AND delete the keys AND
// values when they are allocated on the heap.
TIter next(fTable);
TAssoc *a;
while ((a = (TAssoc *)next())) {
if (a->Key() && a->Key()->IsOnHeap())
TCollection::GarbageCollect(a->Key());
if (a->Value() && a->Value()->IsOnHeap())
TCollection::GarbageCollect(a->Value());
}
fTable->Delete(); // delete the TAssoc's
fSize = 0;
}
//______________________________________________________________________________
TObject *TMap::FindObject(const Text_t *keyname) const
{
// 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.
return fTable->FindObject(keyname);
}
//______________________________________________________________________________
TObject *TMap::FindObject(TObject *key) const
{
// 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.
if (IsArgNull("FindObject", key)) return 0;
return fTable->FindObject(key);
}
//______________________________________________________________________________
TObject *TMap::GetValue(TObject *key) const
{
// Returns a pointer to the value associated with key.
if (IsArgNull("GetValue", key)) return 0;
TAssoc *a = (TAssoc *)fTable->FindObject(key);
if (a) return a->Value();
return 0;
}
//______________________________________________________________________________
TIterator *TMap::MakeIterator(Bool_t dir) const
{
// Create an iterator for TMap.
return new TMapIter(this, dir);
}
//______________________________________________________________________________
void TMap::Rehash(Int_t newCapacity, Bool_t checkObjValidity)
{
// Rehash the underlaying THashTable (see THashTable::Rehash()).
fTable->Rehash(newCapacity, checkObjValidity);
}
//______________________________________________________________________________
TObject *TMap::Remove(TObject *key)
{
// Remove the (key,value) pair with key from the map.
if (!key) return 0;
TAssoc *a;
if ((a = (TAssoc *)fTable->FindObject(key))) {
if (fTable->Remove(key)) {
delete a;
fSize--;
return key;
}
}
return 0;
}
//______________________________________________________________________________
void TMap::Streamer(TBuffer &b)
{
// Stream all key/value pairs in the map to or from the I/O buffer.
TObject *obj;
if (b.IsReading()) {
Int_t nobjects;
TObject *value;
b.ReadVersion(); // Version_t v = b.ReadVersion();
b >> nobjects;
for (Int_t i = 0; i < nobjects; i++) {
b >> obj;
b >> value;
if (obj) Add(obj, value);
}
} else {
b.WriteVersion(TMap::IsA());
b << GetSize();
TIter next(this);
while ((obj = next())) {
b << obj;
b << GetValue(obj);
}
}
}
//////////////////////////////////////////////////////////////////////////
// //
// TAssoc //
// //
//////////////////////////////////////////////////////////////////////////
void TAssoc::Browse(TBrowser *b)
{
if (b) {
if (fKey) b->Add(fKey);
if (fValue) b->Add(fValue);
} else {
if (fKey) fKey->Browse(b);
if (fValue) fValue->Browse(b);
}
}
//////////////////////////////////////////////////////////////////////////
// //
// TMapIter //
// //
// Iterator of map. //
// //
//////////////////////////////////////////////////////////////////////////
ClassImp(TMapIter)
//______________________________________________________________________________
TMapIter::TMapIter(const TMap *m, Bool_t dir)
{
// Create a map iterator. Use dir to specify the desired iteration direction.
fMap = m;
fDirection = dir;
fCursor = 0;
}
//______________________________________________________________________________
TMapIter::TMapIter(const TMapIter &iter)
{
// Copy ctor.
fMap = iter.fMap;
fDirection = iter.fDirection;
if (fCursor) {
fCursor = (THashTableIter *)iter.fCursor->GetCollection()->MakeIterator();
fCursor->operator=(*iter.fCursor);
}
}
//______________________________________________________________________________
TIterator &TMapIter::operator=(const TIterator &rhs)
{
// Overridden assignment operator.
if (this != &rhs && rhs.IsA() == TMapIter::Class()) {
const TMapIter &rhs1 = (const TMapIter &)rhs;
fMap = rhs1.fMap;
fDirection = rhs1.fDirection;
if (rhs1.fCursor) {
fCursor = (THashTableIter *)rhs1.fCursor->GetCollection()->MakeIterator();
fCursor->operator=(*rhs1.fCursor);
}
}
return *this;
}
//______________________________________________________________________________
TMapIter &TMapIter::operator=(const TMapIter &rhs)
{
// Overloaded assignment operator.
if (this != &rhs) {
fMap = rhs.fMap;
fDirection = rhs.fDirection;
if (rhs.fCursor) {
fCursor = (THashTableIter *)rhs.fCursor->GetCollection()->MakeIterator();
fCursor->operator=(*rhs.fCursor);
}
}
return *this;
}
//______________________________________________________________________________
TMapIter::~TMapIter()
{
// Map iterator dtor.
Reset();
}
//______________________________________________________________________________
TObject *TMapIter::Next()
{
// Returns the next key from a map. Use TMap::GetValue() to get the value
// associated with the key. Returns 0 when no more items in map.
if (!fCursor)
fCursor = new THashTableIter(fMap->fTable, fDirection);
TAssoc *a = (TAssoc *)fCursor->Next();
if (a) return a->Key();
return 0;
}
//______________________________________________________________________________
void TMapIter::Reset()
{
// Reset the map iterator.
SafeDelete(fCursor);
}
ROOT page - Class index - Top of the page
This page has been automatically generated. If you have any comments or suggestions about the page layout send a mail to ROOT support, or contact the developers with any questions or problems regarding ROOT.