library: libRooFit
#include "RooLinkedList.h"

RooLinkedList


class description - header file - source file - inheritance tree (.pdf)

class RooLinkedList : public TObject

Inheritance Chart:
TObject
<-
RooLinkedList
<-
RooRefCountList

    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)

Data Members


    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

Class Description

RooLinkedList(Int_t htsize)
setHashTableSize(htsize) ;
RooLinkedList(const RooLinkedList& other)
 Copy constructor
RooLinkedList& operator=(const RooLinkedList& other)
 Assignment operator
void setHashTableSize(Int_t size)
~RooLinkedList()
 Destructor
RooLinkedListElem* findLink(const TObject* arg)
void Add(TObject* arg, Int_t refCount)
Bool_t Remove(TObject* arg)
 Find link element
TObject* At(Int_t index)
 Check range
Bool_t Replace(const TObject* oldArg, const TObject* newArg)
 Find existing element and replace arg
TObject* FindObject(const char* name)
TObject* FindObject(const TObject* obj)
void Clear(Option_t *)
void Delete(Option_t *)
TObject* find(const char* name)
Int_t IndexOf(const TObject* arg)
void Print(const char* opt)
TIterator* MakeIterator(Bool_t dir)
 Return an iterator over this list
RooLinkedListIter iterator(Bool_t dir)
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)
Int_t getHashTableSize()
Int_t GetSize()
void Add(TObject* arg)
TObject* First()

Last update: Tue Jul 11 11:45:51 2006
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.