library: libRooFit #include "RooLinkedList.h" |
RooLinkedList
class description - source file - inheritance tree (.pdf)
protected:
virtual void Add(TObject* arg, Int_t refCount)
RooLinkedListElem* findLink(const TObject* arg) const
void swapWithNext(RooLinkedListElem* elem)
public:
RooLinkedList(Int_t htsize = 0)
RooLinkedList(const RooLinkedList& other)
virtual ~RooLinkedList()
virtual void Add(TObject* arg)
TObject* At(Int_t index) const
static TClass* Class()
virtual void Clear(Option_t* o = "0")
virtual void Delete(Option_t* o = "0")
TObject* find(const char* name) const
virtual TObject* FindObject(const char* name) const
virtual TObject* FindObject(const TObject* obj) const
TObject* First() const
Int_t getHashTableSize() const
Int_t GetSize() const
Int_t IndexOf(const TObject* arg) const
virtual TClass* IsA() const
RooLinkedListIter iterator(Bool_t dir = kTRUE) const
TIterator* MakeIterator(Bool_t dir = kTRUE) const
RooLinkedList& operator=(const RooLinkedList& other)
virtual void Print(const char* opt) const
virtual Bool_t Remove(TObject* arg)
Bool_t Replace(const TObject* oldArg, const TObject* newArg)
void setHashTableSize(Int_t size)
virtual void ShowMembers(TMemberInspector& insp, char* parent)
void Sort(Bool_t ascend)
virtual void Streamer(TBuffer& b)
void StreamerNVirtual(TBuffer& b)
protected:
Int_t _hashThresh Size threshold for hashing
Int_t _size Current size of list
RooLinkedListElem* _first ! Link to first element of list
RooLinkedListElem* _last ! Link to last element of list
RooHashTable* _htableName ! Hash table by name
RooHashTable* _htableLink ! Hash table by link pointer
RooLinkedList(Int_t htsize) :
_hashThresh(htsize), _size(0), _first(0), _last(0), _htableName(0), _htableLink(0)
setHashTableSize(htsize) ;
RooLinkedList(const RooLinkedList& other) :
TObject(other), _hashThresh(other._hashThresh), _size(0), _first(0), _last(0), _htableName(0), _htableLink(0)
Copy constructor
void setHashTableSize(Int_t size)
~RooLinkedList()
Destructor
RooLinkedListElem* findLink(const TObject* arg) const
void Add(TObject* arg, Int_t refCount)
Bool_t Remove(TObject* arg)
Find link element
TObject* At(Int_t index) const
Check range
Bool_t Replace(const TObject* oldArg, const TObject* newArg)
Find existing element and replace arg
TObject* FindObject(const char* name) const
TObject* FindObject(const TObject* obj) const
void Clear(Option_t *)
void Delete(Option_t *)
TObject* find(const char* name) const
Int_t IndexOf(const TObject* arg) const
void Print(const char* opt) const
TIterator* MakeIterator(Bool_t dir) const
Return an iterator over this list
RooLinkedListIter iterator(Bool_t dir) const
void Sort(Bool_t ascend)
Sort elements of this list according to their
TObject::Compare() ranking via a simple
bubble sort algorithm
void swapWithNext(RooLinkedListElem* elemB)
Swap given to elements in the linked list. Auxiliary function for Sort()
void Streamer(TBuffer &b)
Inline Functions
RooLinkedList& operator=(const RooLinkedList& other)
Int_t getHashTableSize() const
Int_t GetSize() const
TObject* First() const
void Add(TObject* arg, Int_t refCount)
TClass* Class()
TClass* IsA() const
void ShowMembers(TMemberInspector& insp, char* parent)
void StreamerNVirtual(TBuffer& b)
Last update: Tue Jun 28 18:13:24 2005
Copyright (c) 2000-2005, Regents of the University of California *
ROOT page - Class index - Class Hierarchy - 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.