61 for (map<string,RooAbsDataStore*>::iterator iter=inputData.begin() ; iter!=inputData.end() ; ++iter) {
76 for (map<Int_t,RooAbsDataStore*>::const_iterator iter=other.
_dataMap.begin() ; iter!=other.
_dataMap.end() ; ++iter) {
96 for (map<Int_t,RooAbsDataStore*>::const_iterator iter=other.
_dataMap.begin() ; iter!=other.
_dataMap.end() ; ++iter) {
112 map<int,RooAbsDataStore*>::const_iterator iter ;
114 delete iter->second ;
138 map<int,RooAbsDataStore*>::const_iterator iter ;
140 iter->second->recalculateCache(proj,firstEvent,lastEvent,stepSize,skipZeroWeights) ;
150 map<int,RooAbsDataStore*>::const_iterator iter ;
152 ret |= iter->second->hasFilledCache() ;
162 map<int,RooAbsDataStore*>::const_iterator iter ;
164 iter->second->forceCacheUpdate() ;
177 return subset->
fill() ;
189 map<int,RooAbsDataStore*>::const_iterator iter ;
191 sum+= iter->second->sumEntries() ;
206 map<int,RooAbsDataStore*>::const_iterator iter ;
208 if (idx>=(offset+iter->second->numEntries())) {
209 offset += iter->second->numEntries() ;
277 map<int,RooAbsDataStore*>::const_iterator iter ;
279 if (iter->second->isWeighted())
return kTRUE ;
289 throw(std::string(
"RooCompositeDataSore::loadValues() NOT IMPLEMENTED")) ;
305 coutE(
InputArguments) <<
"RooCompositeDataStore::changeObservableName(" <<
GetName() <<
" no observable " << from <<
" in this dataset" << endl ;
314 map<int,RooAbsDataStore*>::const_iterator iter ;
316 ret |= iter->second->changeObservableName(from,to) ;
331 map<int,RooAbsDataStore*>::const_iterator iter ;
333 ret = iter->second->addColumn(newVar,adjustRange) ;
350 map<int,RooAbsDataStore*>::const_iterator iter ;
352 ret = iter->second->addColumns(varList) ;
367 throw string(
"RooCompositeDataStore::merge() is not implemented yet") ;
379 for (
int i=0 ; i<nevt ; i++) {
392 map<int,RooAbsDataStore*>::const_iterator iter ;
394 n += iter->second->numEntries() ;
406 map<int,RooAbsDataStore*>::const_iterator iter ;
408 iter->second->reset() ;
418 map<int,RooAbsDataStore*>::const_iterator iter ;
420 iter->second->cacheArgs(owner,newVarSet,nset,skipZeroWeights) ;
430 map<int,RooAbsDataStore*>::const_iterator iter ;
433 iter->second->setArgStatus(*subset,active) ;
447 map<int,RooAbsDataStore*>::const_iterator iter ;
449 iter->second->attachCache(newOwner,inCachedVars) ;
460 map<int,RooAbsDataStore*>::const_iterator iter ;
462 iter->second->resetCache() ;
473 map<int,RooAbsDataStore*>::const_iterator iter ;
475 iter->second->attachBuffers(extObs);
486 map<int,RooAbsDataStore*>::const_iterator iter ;
488 iter->second->resetBuffers();
498 cout <<
"RooCompositeDataStore::dump()" << endl ;
499 map<int,RooAbsDataStore*>::const_iterator iter ;
501 cout <<
"state number " << iter->first <<
" has store " << iter->second->IsA()->GetName() <<
" with variables " << *iter->second->get() ;
502 if (iter->second->isWeighted()) cout <<
" and is weighted " ;
static long int sum(long int i)
virtual Int_t getIndex() const
Return index number of current state.
RooAbsDataStore is the abstract base class for data collection that use a TTree as internal storage m...
virtual Bool_t isWeighted() const
virtual Int_t numEntries() const
virtual Bool_t setIndex(Int_t index, Bool_t printError=kTRUE)
Set value by specifying the index code of the desired state.
virtual ~RooCompositeDataStore()
Destructor.
virtual const RooArgSet * get() const
virtual void setArgStatus(const RooArgSet &set, Bool_t active)
virtual RooAbsDataStore * clone(const char *newname=0) const =0
virtual void attachBuffers(const RooArgSet &extObs)
std::map< Int_t, RooAbsDataStore * > _dataMap
virtual Int_t fill()
Forward fill request to appropriate subset.
Bool_t _ownComps
Index associated with current event.
if on multiple lines(like in C++).**The" * configuration fragment. * * The "import myobject continue
Parses the configuration file.
virtual Bool_t valid() const
Return true if currently loaded coordinate is considered valid within the current range definitions o...
virtual void forceCacheUpdate()
virtual void resetBuffers()
RooCompositeDataStore is the abstract base class for data collection that use a TTree as internal sto...
virtual Double_t weightError(RooAbsData::ErrorType etype=RooAbsData::Poisson) const
virtual void resetCache()
RooAbsArg * find(const char *name) const
Find object with given name in list.
virtual Bool_t hasFilledCache() const
virtual const RooArgSet * get(Int_t index) const =0
virtual Bool_t changeObservableName(const char *from, const char *to)
Change name of internal observable named 'from' into 'to'.
void SetName(const char *name)
Set the name of the TNamed.
virtual Double_t weightError(RooAbsData::ErrorType etype=RooAbsData::Poisson) const =0
virtual const char * GetName() const
Returns name of object.
void loadValues(const RooAbsDataStore *tds, const RooFormulaVar *select=0, const char *rangeName=0, Int_t nStart=0, Int_t nStop=2000000000)
virtual RooAbsArg * addColumn(RooAbsArg &var, Bool_t adjustRange=kTRUE)
WVE ownership issue here!! Caller (a RooAbsData) should take ownership of all arguments, but only does for the first one here...
virtual void cacheArgs(const RooAbsArg *owner, RooArgSet &varSet, const RooArgSet *nset=0, Bool_t skipZeroWeights=kFALSE)
RooCategory represents a fundamental (non-derived) discrete value object.
void attachCache(const RooAbsArg *newOwner, const RooArgSet &cachedVars)
Initialize cache of dataset: attach variables of cache ArgSet to the corresponding TTree branches...
virtual RooArgSet * addColumns(const RooArgList &varList)
WVE ownership issue here!! Caller (a RooAbsData) should take ownership of all arguments, but only does for the first one here...
RooAbsCollection & assignValueOnly(const RooAbsCollection &other, Bool_t oneSafe=kFALSE)
The assignment operator sets the value of any argument in our set that also appears in the other set...
virtual Double_t weight() const =0
Int_t _curIndex
Datastore associated with current event.
RooAbsDataStore * merge(const RooArgSet &allvars, std::list< RooAbsDataStore * > dstoreList)
float type_of_call hi(const int &, const int &)
RooAbsArg is the common abstract base class for objects that represent a value (of arbitrary type) an...
virtual Int_t numEntries() const =0
virtual Double_t sumEntries() const
Forward fill request to appropriate subset.
virtual Double_t weight() const
virtual void append(RooAbsDataStore &other)
RooAbsDataStore * _curStore
virtual Bool_t add(const RooAbsArg &var, Bool_t silent=kFALSE)
Add element to non-owning set.
virtual void recalculateCache(const RooArgSet *, Int_t, Int_t, Int_t, Bool_t)
Forward recalculate request to all subsets.
const RooCatType * lookupType(Int_t index, Bool_t printError=kFALSE) const
Find our type corresponding to the specified index, or return 0 for no match.