ROOT logo

class RooHashTable: public TObject

RooHashTable implements a hash table for TObjects. The hashing can be done on the object addresses, object names, or using the objects internal hash method. This is a utility class for RooLinkedList that uses RooHashTable to speed up direct access to large collections.

Function Members (Methods)

RooHashTable(const RooHashTable& other)
RooHashTable(Int_t initSize = 17, RooHashTable::HashMethod hashMethod = Name)
voidTObject::AbstractMethod(const char* method) const
voidadd(TObject* arg, TObject* hashArg = 0)
virtual voidTObject::AppendPad(Option_t* option = "")
Double_tavgCollisions() const
virtual voidTObject::Browse(TBrowser* b)
static TClass*Class()
virtual const char*TObject::ClassName() const
virtual voidTObject::Clear(Option_t* = "")
virtual TObject*TObject::Clone(const char* newname = "") const
virtual Int_tTObject::Compare(const TObject* obj) const
virtual voidTObject::Copy(TObject& object) const
virtual voidTObject::Delete(Option_t* option = "")MENU
virtual Int_tTObject::DistancetoPrimitive(Int_t px, Int_t py)
virtual voidTObject::Draw(Option_t* option = "")
virtual voidTObject::DrawClass() constMENU
virtual TObject*TObject::DrawClone(Option_t* option = "") constMENU
virtual voidTObject::Dump() constMENU
virtual voidTObject::Error(const char* method, const char* msgfmt) const
virtual voidTObject::Execute(const char* method, const char* params, Int_t* error = 0)
virtual voidTObject::Execute(TMethod* method, TObjArray* params, Int_t* error = 0)
virtual voidTObject::ExecuteEvent(Int_t event, Int_t px, Int_t py)
virtual voidTObject::Fatal(const char* method, const char* msgfmt) const
TObject*find(const char* name) const
TObject*find(const TObject* arg) const
RooLinkedListElem*findLinkTo(const TObject* arg) const
virtual TObject*TObject::FindObject(const char* name) const
virtual TObject*TObject::FindObject(const TObject* obj) const
RooSetPair*findSetPair(const RooArgSet* set1, const RooArgSet* set2) const
virtual Option_t*TObject::GetDrawOption() const
static Long_tTObject::GetDtorOnly()
virtual const char*TObject::GetIconName() const
virtual const char*TObject::GetName() const
virtual char*TObject::GetObjectInfo(Int_t px, Int_t py) const
static Bool_tTObject::GetObjectStat()
virtual Option_t*TObject::GetOption() const
virtual const char*TObject::GetTitle() const
virtual UInt_tTObject::GetUniqueID() const
virtual Bool_tTObject::HandleTimer(TTimer* timer)
virtual ULong_tTObject::Hash() const
virtual voidTObject::Info(const char* method, const char* msgfmt) const
virtual Bool_tTObject::InheritsFrom(const char* classname) const
virtual Bool_tTObject::InheritsFrom(const TClass* cl) const
virtual voidTObject::Inspect() constMENU
voidTObject::InvertBit(UInt_t f)
virtual TClass*IsA() const
virtual Bool_tTObject::IsEqual(const TObject* obj) const
virtual Bool_tTObject::IsFolder() const
Bool_tTObject::IsOnHeap() const
virtual Bool_tTObject::IsSortable() const
Bool_tTObject::IsZombie() const
virtual voidTObject::ls(Option_t* option = "") const
voidTObject::MayNotUse(const char* method) const
virtual Bool_tTObject::Notify()
static voidTObject::operator delete(void* ptr)
static voidTObject::operator delete(void* ptr, void* vp)
static voidTObject::operator delete[](void* ptr)
static voidTObject::operator delete[](void* ptr, void* vp)
void*TObject::operator new(size_t sz)
void*TObject::operator new(size_t sz, void* vp)
void*TObject::operator new[](size_t sz)
void*TObject::operator new[](size_t sz, void* vp)
RooHashTable&operator=(const RooHashTable&)
virtual voidTObject::Paint(Option_t* option = "")
virtual voidTObject::Pop()
virtual voidTObject::Print(Option_t* option = "") const
virtual Int_tTObject::Read(const char* name)
virtual voidTObject::RecursiveRemove(TObject* obj)
Bool_tremove(TObject* arg, TObject* hashArg = 0)
Bool_treplace(const TObject* oldArg, const TObject* newArg, const TObject* oldHashArg = 0)
voidTObject::ResetBit(UInt_t f)
virtual voidTObject::SaveAs(const char* filename = "", Option_t* option = "") constMENU
virtual voidTObject::SavePrimitive(basic_ostream<char,char_traits<char> >& out, Option_t* option = "")
voidTObject::SetBit(UInt_t f)
voidTObject::SetBit(UInt_t f, Bool_t set)
virtual voidTObject::SetDrawOption(Option_t* option = "")MENU
static voidTObject::SetDtorOnly(void* obj)
static voidTObject::SetObjectStat(Bool_t stat)
virtual voidTObject::SetUniqueID(UInt_t uid)
virtual voidShowMembers(TMemberInspector& insp, char* parent)
Int_tsize() const
virtual voidStreamer(TBuffer& b)
voidStreamerNVirtual(TBuffer& b)
virtual voidTObject::SysError(const char* method, const char* msgfmt) const
Bool_tTObject::TestBit(UInt_t f) const
Int_tTObject::TestBits(UInt_t f) const
virtual voidTObject::UseCurrentStyle()
virtual voidTObject::Warning(const char* method, const char* msgfmt) const
virtual Int_tTObject::Write(const char* name = 0, Int_t option = 0, Int_t bufsize = 0)
virtual Int_tTObject::Write(const char* name = 0, Int_t option = 0, Int_t bufsize = 0) const
virtual voidTObject::DoError(int level, const char* location, const char* fmt, va_list va) const
ULong_thash(const TObject* arg) const

Data Members

enum HashMethod { Pointer
enum TObject::EStatusBits { kCanDelete
enum TObject::[unnamed] { kIsOnHeap
RooLinkedList**_arr! Array of linked lists storing elements in each slot
Int_t_entriesNumber of entries stored
RooHashTable::HashMethod_hashMethodHashing method
Int_t_sizeTotal number of slots
Int_t_usedSlotsNumber of used slots

Class Charts

Inheritance Inherited Members Includes Libraries
Class Charts

Function documentation

RooHashTable(Int_t initSize = 17, RooHashTable::HashMethod hashMethod = Name)
 Construct a hash table with given capacity and hash method
RooHashTable(const RooHashTable& other)
 Copy constructor
void add(TObject* arg, TObject* hashArg = 0)
 Add given object to table. If hashArg is given, hash will be calculation
 on that rather than on 'arg'
Bool_t remove(TObject* arg, TObject* hashArg = 0)
 Remove given object from table. If hashArg is given, hash will be calculation
 on that rather than on 'arg'
Double_t avgCollisions() const
 Calculate the average number of collisions (table slots with >1 filled entry)
Bool_t replace(const TObject* oldArg, const TObject* newArg, const TObject* oldHashArg = 0)
 Replace oldArg with newArg in the table. If oldHashArg is given, use that to calculate
 the hash associated with oldArg
TObject* find(const char* name)
 Return the object with given name from the table.
TObject* find(const TObject* hashArg)
 Return object with the given pointer from the table
RooLinkedListElem* findLinkTo(const TObject* arg) const
 Return RooLinkedList element link to object 'hashArg'
RooSetPair* findSetPair(const RooArgSet* set1, const RooArgSet* set2) const
 Return RooSetPair with given pointers in table
Int_t size() const
{ return _size ; }
ULong_t hash(const TObject* arg) const
 Return hash value calculated by method chosen in constructor