/usr/include/root/THashList.h is in libroot-core-dev 5.34.30-0ubuntu8.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | // @(#)root/cont:$Id$
// Author: Fons Rademakers 10/08/95
/*************************************************************************
* Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *
* All rights reserved. *
* *
* For the licensing terms see $ROOTSYS/LICENSE. *
* For the list of contributors see $ROOTSYS/README/CREDITS. *
*************************************************************************/
#ifndef ROOT_THashList
#define ROOT_THashList
//////////////////////////////////////////////////////////////////////////
// //
// THashList //
// //
// THashList implements a hybrid collection class consisting of a //
// hash table and a list to store TObject's. The hash table is used for //
// quick access and lookup of objects while the list allows the objects //
// to be ordered. 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. //
// //
//////////////////////////////////////////////////////////////////////////
#ifndef ROOT_TList
#include "TList.h"
#endif
class THashTable;
class THashList : public TList {
protected:
THashTable *fTable; //Hashtable used for quick lookup of objects
private:
THashList(const THashList&); // not implemented
THashList& operator=(const THashList&); // not implemented
public:
THashList(Int_t capacity=TCollection::kInitHashTableCapacity, Int_t rehash=0);
THashList(TObject *parent, Int_t capacity=TCollection::kInitHashTableCapacity, Int_t rehash=0);
virtual ~THashList();
Float_t AverageCollisions() const;
void Clear(Option_t *option="");
void Delete(Option_t *option="");
TObject *FindObject(const char *name) const;
TObject *FindObject(const TObject *obj) const;
TList *GetListForObject(const char *name) const;
TList *GetListForObject(const TObject *obj) const;
void AddFirst(TObject *obj);
void AddFirst(TObject *obj, Option_t *opt);
void AddLast(TObject *obj);
void AddLast(TObject *obj, Option_t *opt);
void AddAt(TObject *obj, Int_t idx);
void AddAfter(const TObject *after, TObject *obj);
void AddAfter(TObjLink *after, TObject *obj);
void AddBefore(const TObject *before, TObject *obj);
void AddBefore(TObjLink *before, TObject *obj);
void RecursiveRemove(TObject *obj);
void Rehash(Int_t newCapacity);
TObject *Remove(TObject *obj);
TObject *Remove(TObjLink *lnk);
ClassDef(THashList,0) //Doubly linked list with hashtable for lookup
};
#endif
|