Logo ROOT  
Reference Guide
 
Loading...
Searching...
No Matches
RooLinkedList.h
Go to the documentation of this file.
1/*****************************************************************************
2 * Project: RooFit *
3 * Package: RooFitCore *
4 * File: $Id: RooLinkedList.h,v 1.15 2007/05/11 09:11:30 verkerke Exp $
5 * Authors: *
6 * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *
7 * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *
8 * *
9 * Copyright (c) 2000-2005, Regents of the University of California *
10 * and Stanford University. All rights reserved. *
11 * *
12 * Redistribution and use in source and binary forms, *
13 * with or without modification, are permitted according to the terms *
14 * listed in LICENSE (http://roofit.sourceforge.net/license.txt) *
15 *****************************************************************************/
16#ifndef ROO_LINKED_LIST
17#define ROO_LINKED_LIST
18
19#include <vector>
20
21#include "TObject.h"
22#include "RooLinkedListElem.h"
23#include "RooHashTable.h"
24
26class RooFIter;
27class TIterator ;
28class RooAbsArg ;
29
31 class Chunk;
32 class Pool;
33}
34
35class RooLinkedList : public TObject {
36public:
37 // Constructor
38 RooLinkedList(Int_t htsize=0) ;
39
40 // Copy constructor
41 RooLinkedList(const RooLinkedList& other) ;
42
43 virtual TObject* Clone(const char* =0) const {
44 return new RooLinkedList(*this) ;
45 }
46
47 // Assignment operator
49
51 // Return size of hash table
52 return _htableName ? _htableName->size() : 0 ;
53 }
54
55 void setHashTableSize(Int_t size) ;
56
57 // Destructor
58 virtual ~RooLinkedList() ;
59
60 Int_t GetSize() const { return _size ; }
61
62 virtual void Add(TObject* arg) { Add(arg,1) ; }
63 virtual Bool_t Remove(TObject* arg) ;
64 TObject* At(Int_t index) const ;
65 Bool_t Replace(const TObject* oldArg, const TObject* newArg) ;
66 TIterator* MakeIterator(Bool_t forward = kTRUE) const ;
67 RooLinkedListIter iterator(Bool_t forward = kTRUE) const ;
68 RooFIter fwdIterator() const ;
69
70 void Clear(Option_t *o=0) ;
71 void Delete(Option_t *o=0) ;
72 TObject* find(const char* name) const ;
73 RooAbsArg* findArg(const RooAbsArg*) const ;
74 TObject* FindObject(const char* name) const ;
75 TObject* FindObject(const TObject* obj) const ;
76 Int_t IndexOf(const char* name) const ;
77 Int_t IndexOf(const TObject* arg) const ;
78 TObject* First() const {
79 return _first?_first->_arg:0 ;
80 }
81
82 virtual void RecursiveRemove(TObject *obj);
83
84 void Print(const char* opt) const ;
85 void Sort(Bool_t ascend=kTRUE) ;
86
87 // const char* GetName() const { return "" ; /*_name.Data() ; */ }
88 // void SetName(const char* /*name*/) { /*_name = name ; */ }
89 const char* GetName() const { return _name.Data() ; }
90 void SetName(const char* name) { _name = name ; }
91
92 void useNptr(Bool_t flag) { _useNptr = flag ; }
93 // needed for using it in THashList/THashTable
94
95 ULong_t Hash() const { return _name.Hash(); }
96 //ULong_t Hash() const { return TString().Hash(); }
97
98protected:
99
102
103
106
107 virtual void Add(TObject* arg, Int_t refCount) ;
108
109 RooLinkedListElem* findLink(const TObject* arg) const ;
110
111 Int_t _hashThresh ; // Size threshold for hashing
112 Int_t _size ; // Current size of list
113 RooLinkedListElem* _first ; //! Link to first element of list
114 RooLinkedListElem* _last ; //! Link to last element of list
115 RooHashTable* _htableName ; //! Hash table by name
116 RooHashTable* _htableLink ; //! Hash table by link pointer
117
120
121private:
122 template <bool ascending>
124 const unsigned sz, RooLinkedListElem** tail = 0);
125 /// memory pool for quick allocation of RooLinkedListElems
126 typedef RooLinkedListImplDetails::Pool Pool;
127 /// shared memory pool for allocation of RooLinkedListElems
128 static Pool* _pool; //!
129
130 std::vector<RooLinkedListElem *> _at; //! index list for quick index through ::At
131
132 ClassDef(RooLinkedList,3) // Doubly linked list for storage of RooAbsArg objects
133};
134
135
136
137
138#endif
int Int_t
Definition RtypesCore.h:45
unsigned long ULong_t
Definition RtypesCore.h:55
bool Bool_t
Definition RtypesCore.h:63
const Bool_t kTRUE
Definition RtypesCore.h:91
const char Option_t
Definition RtypesCore.h:66
#define ClassDef(name, id)
Definition Rtypes.h:325
char name[80]
Definition TGX11.cxx:110
RooAbsArg is the common abstract base class for objects that represent a value and a "shape" in RooFi...
Definition RooAbsArg.h:72
Implementation of the GenericRooFIter interface for the RooLinkedList.
A one-time forward iterator working on RooLinkedList or RooAbsCollection.
RooHashTable implements a hash table for TObjects.
Int_t size() const
RooLinkedListElem is an link element for the RooLinkedList class.
Implementation of the actual iterator on RooLinkedLists.
A wrapper around TIterator derivatives.
RooLinkedList is an collection class for internal use, storing a collection of RooAbsArg pointers in ...
Int_t GetSize() const
void SetName(const char *name)
TObject * FindObject(const char *name) const
Return pointer to obejct with given name.
static Pool * _pool
shared memory pool for allocation of RooLinkedListElems
TString _name
Hash table by link pointer.
RooLinkedListImplDetails::Pool Pool
memory pool for quick allocation of RooLinkedListElems
std::vector< RooLinkedListElem * > _at
const char * GetName() const
Returns name of object.
RooHashTable * _htableName
Link to last element of list.
RooLinkedListElem * createElement(TObject *obj, RooLinkedListElem *elem=0)
cout << "RooLinkedList::createElem(" << this << ") obj = " << obj << " elem = " << elem << endl ;
RooHashTable * _htableLink
Hash table by name.
void Sort(Bool_t ascend=kTRUE)
Int_t getHashTableSize() const
RooFIter fwdIterator() const
Create a one-time-use forward iterator for this list.
void deleteElement(RooLinkedListElem *)
RooLinkedListElem * findLink(const TObject *arg) const
Find the element link containing the given object.
void Print(const char *opt) const
Print contents of list, defers to Print() function of contained objects.
TIterator * MakeIterator(Bool_t forward=kTRUE) const
Create a TIterator for this list.
virtual TObject * Clone(const char *=0) const
Make a clone of an object using the Streamer facility.
ULong_t Hash() const
Return hash value for this object.
static RooLinkedListElem * mergesort_impl(RooLinkedListElem *l1, const unsigned sz, RooLinkedListElem **tail=0)
length 0, 1 lists are sorted
TObject * At(Int_t index) const
Return object stored in sequential position given by index.
RooAbsArg * findArg(const RooAbsArg *) const
Return pointer to object with given name in collection.
void Delete(Option_t *o=0)
Remove all elements in collection and delete all elements NB: Collection does not own elements,...
TObject * find(const char *name) const
Return pointer to object with given name in collection.
RooLinkedList & operator=(const RooLinkedList &other)
Assignment operator, copy contents from 'other'.
virtual void RecursiveRemove(TObject *obj)
If one of the TObject we have a referenced to is deleted, remove the reference.
virtual void Add(TObject *arg)
void useNptr(Bool_t flag)
RooLinkedListElem * _last
Link to first element of list.
void setHashTableSize(Int_t size)
Change the threshold for hash-table use to given size.
void Clear(Option_t *o=0)
Remove all elements from collection.
Bool_t Replace(const TObject *oldArg, const TObject *newArg)
Replace object 'oldArg' in collection with new object 'newArg'.
RooLinkedListElem * _first
virtual Bool_t Remove(TObject *arg)
Remove object from collection.
Int_t IndexOf(const char *name) const
Return position of given object in list.
virtual ~RooLinkedList()
Destructor.
TObject * First() const
Iterator abstract base class.
Definition TIterator.h:30
Mother of all ROOT objects.
Definition TObject.h:37
Basic string class.
Definition TString.h:136
const char * Data() const
Definition TString.h:369
UInt_t Hash(ECaseCompare cmp=kExact) const
Return hash value.
Definition TString.cxx:658