Logo ROOT  
Reference Guide
 
Loading...
Searching...
No Matches
RooTreeDataStore.cxx
Go to the documentation of this file.
1/*****************************************************************************
2 * Project: RooFit *
3 * Package: RooFitCore *
4 * @(#)root/roofitcore:$Id$
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
17/**
18\file RooTreeDataStore.cxx
19\class RooTreeDataStore
20\ingroup Roofitcore
21
22TTree-backed data storage. When a file is opened before
23creating the data storage, the storage will be file-backed. This reduces memory
24pressure because it allows storing the data in the file and reading it on demand.
25For a completely memory-backed storage, which is faster than the file-backed storage,
26RooVectorDataStore can be used.
27
28With tree-backed storage, the tree can be found in the file with the name
29`RooTreeDataStore_name_title` for a dataset created as
30`RooDataSet("name", "title", ...)`.
31
32\note A file needs to be opened **before** creating the data storage to enable file-backed
33storage.
34```
35TFile outputFile("filename.root", "RECREATE");
36RooAbsData::setDefaultStorageType(RooAbsData::Tree);
37RooDataSet mydata(...);
38```
39
40One can also change between TTree- and std::vector-backed storage using
41RooAbsData::convertToTreeStore() and
42RooAbsData::convertToVectorStore().
43**/
44
45#include "RooTreeDataStore.h"
46
47#include "RooMsgService.h"
48#include "RooFormulaVar.h"
49#include "RooRealVar.h"
50#include "RooHistError.h"
51
52#include "ROOT/StringUtils.hxx"
53
54#include "TTree.h"
55#include "TFile.h"
56#include "TChain.h"
57#include "TDirectory.h"
58#include "TBuffer.h"
59#include "TBranch.h"
60#include "TROOT.h"
61
62#include <iomanip>
63using std::endl, std::list, std::string;
64
66
67
69
70
71
72////////////////////////////////////////////////////////////////////////////////
73
75
76
77
78////////////////////////////////////////////////////////////////////////////////
79/// Constructor to facilitate reading of legacy RooDataSets
80
82 RooAbsDataStore("blah","blah",varsNoWeight(vars,wgtVarName)),
83 _tree(t),
84 _defCtor(true),
85 _varsww(vars),
86 _wgtVar(weightVar(vars,wgtVarName))
87{
88}
89
90
91
92
93////////////////////////////////////////////////////////////////////////////////
94
96 RooAbsDataStore(name,title,varsNoWeight(vars,wgtVarName)),
97 _varsww(vars),
98 _wgtVar(weightVar(vars,wgtVarName))
99{
100 initialize() ;
101}
102
103
104////////////////////////////////////////////////////////////////////////////////
105
107 RooAbsDataStore(name,title,varsNoWeight(vars,wgtVarName)),
108 _varsww(vars),
109 _wgtVar(weightVar(vars,wgtVarName))
110{
111 initialize() ;
112
113 if (selExpr && *selExpr) {
114 // Create a RooFormulaVar cut from given cut expression
115 RooFormulaVar select(selExpr, selExpr, _vars, /*checkVariables=*/false);
116 loadValues(&t,&select);
117 } else {
118 loadValues(&t);
119 }
120}
121
122
123////////////////////////////////////////////////////////////////////////////////
124
126 RooAbsDataStore(name,title,varsNoWeight(vars,wgtVarName)),
127 _varsww(vars),
128 _wgtVar(weightVar(vars,wgtVarName))
129{
130 initialize() ;
131
132 if (selExpr && *selExpr) {
133 // Create a RooFormulaVar cut from given cut expression
134 RooFormulaVar select(selExpr, selExpr, _vars, /*checkVariables=*/false);
136 } else {
137 loadValues(&ads);
138 }
139}
140
141
142
143
144////////////////////////////////////////////////////////////////////////////////
145
147 const RooFormulaVar *cutVar, const char *cutRange, Int_t nStart, Int_t nStop,
148 const char *wgtVarName)
149 : RooAbsDataStore(name, title, varsNoWeight(vars, wgtVarName)),
150 _varsww(vars),
151 _wgtVar(weightVar(vars, wgtVarName))
152{
153 // WVE NEED TO ADJUST THIS FOR WEIGHTS
154
155 // Protected constructor for internal use only
156
157 createTree(makeTreeName(), title);
158
159 // Deep clone cutVar and attach clone to this dataset
160 std::unique_ptr<RooFormulaVar> cloneVar;
161 if (cutVar) {
162 cloneVar.reset(static_cast<RooFormulaVar*>(cutVar->cloneTree()));
163 cloneVar->attachDataStore(tds) ;
164 }
165
166 // Constructor from existing data set with list of variables that preserves the cache
167 initialize();
168
169 attachCache(nullptr,(static_cast<RooTreeDataStore&>(tds))._cachedVars) ;
170
171 // WVE copy values of cached variables here!!!
173 _cacheOwner = nullptr ;
174
175 loadValues(&tds,cloneVar.get(),cutRange,nStart,nStop);
176}
177
178
179std::unique_ptr<RooAbsDataStore> RooTreeDataStore::reduce(RooStringView name, RooStringView title,
180 const RooArgSet& vars, const RooFormulaVar* cutVar, const char* cutRange,
181 std::size_t nStart, std::size_t nStop) {
182 RooArgSet tmp(vars) ;
183 if(_wgtVar && !tmp.contains(*_wgtVar)) {
184 tmp.add(*_wgtVar) ;
185 }
186 const char* wgtVarName = _wgtVar ? _wgtVar->GetName() : nullptr;
187 return std::make_unique<RooTreeDataStore>(name, title, *this, tmp, cutVar, cutRange, nStart, nStop, wgtVarName);
188}
189
190
191////////////////////////////////////////////////////////////////////////////////
192/// Utility function for constructors
193/// Return RooArgSet that is copy of allVars minus variable matching wgtName if specified
194
196{
197 RooArgSet ret(allVars) ;
198 if(wgtName) {
199 RooAbsArg* wgt = allVars.find(wgtName) ;
200 if (wgt) {
201 ret.remove(*wgt,true,true) ;
202 }
203 }
204 return ret ;
205}
206
207
208
209////////////////////////////////////////////////////////////////////////////////
210/// Utility function for constructors
211/// Return pointer to weight variable if it is defined
212
214{
215 if(wgtName) {
216 RooRealVar* wgt = dynamic_cast<RooRealVar*>(allVars.find(wgtName)) ;
217 return wgt ;
218 }
219 return nullptr ;
220}
221
222
223
224
225////////////////////////////////////////////////////////////////////////////////
226/// Initialize cache of dataset: attach variables of cache ArgSet
227/// to the corresponding TTree branches
228
230{
231 // iterate over the cache variables for this dataset
233 for (RooAbsArg * var : cachedVarsIn) {
234 var->attachToTree(*_cacheTree,_defTreeBufSize) ;
235 _cachedVars.add(*var) ;
236 }
238
239}
240
241
242
243
244
245
246////////////////////////////////////////////////////////////////////////////////
247
250 _varsww(other._varsww),
251 _wgtVar(other._wgtVar),
252 _extWgtArray(other._extWgtArray),
253 _extWgtErrLoArray(other._extWgtErrLoArray),
254 _extWgtErrHiArray(other._extWgtErrHiArray),
255 _extSumW2Array(other._extSumW2Array),
256 _curWgt(other._curWgt),
257 _curWgtErrLo(other._curWgtErrLo),
258 _curWgtErrHi(other._curWgtErrHi),
259 _curWgtErr(other._curWgtErr)
260{
261 initialize() ;
262 loadValues(&other) ;
263}
264
265
266////////////////////////////////////////////////////////////////////////////////
267
269 RooAbsDataStore(other,varsNoWeight(vars,other._wgtVar?other._wgtVar->GetName():nullptr),newname),
270 _varsww(vars),
271 _wgtVar(other._wgtVar?weightVar(vars,other._wgtVar->GetName()):nullptr),
272 _extWgtArray(other._extWgtArray),
273 _extWgtErrLoArray(other._extWgtErrLoArray),
274 _extWgtErrHiArray(other._extWgtErrHiArray),
275 _extSumW2Array(other._extSumW2Array),
276 _curWgt(other._curWgt),
277 _curWgtErrLo(other._curWgtErrLo),
278 _curWgtErrHi(other._curWgtErrHi),
279 _curWgtErr(other._curWgtErr)
280{
281 initialize() ;
282 loadValues(&other) ;
283}
284
285
286
287
288////////////////////////////////////////////////////////////////////////////////
289/// Destructor
290
292{
293 if (_tree) {
294 delete _tree ;
295 }
296 if (_cacheTree) {
297 delete _cacheTree ;
298 }
299}
300
301
302
303////////////////////////////////////////////////////////////////////////////////
304/// One-time initialization common to all constructor forms. Attach
305/// variables of internal ArgSet to the corresponding TTree branches
306
308{
309 // Recreate (empty) cache tree
311
312 // Attach each variable to the dataset
313 for (auto var : _varsww) {
314 var->attachToTree(*_tree,_defTreeBufSize) ;
315 }
316}
317
318
319
320
321
322////////////////////////////////////////////////////////////////////////////////
323/// Create TTree object that lives in memory, independent of current
324/// location of gDirectory
325
327{
328 if (!_tree) {
329 _tree = new TTree(name.c_str(),title.c_str());
332 _tree->SetDirectory(nullptr);
333 }
334
335 TString pwd(gDirectory->GetPath()) ;
336 TString memDir(gROOT->GetName()) ;
337 memDir.Append(":/") ;
338 bool notInMemNow= (pwd!=memDir) ;
339
340 // cout << "RooTreeData::createTree pwd=" << pwd << " memDir=" << memDir << " notInMemNow = " << (notInMemNow?"T":"F") << endl ;
341
342 if (notInMemNow) {
343 gDirectory->cd(memDir) ;
344 }
345
346 if (!_cacheTree) {
347 _cacheTree = new TTree(TString{name.c_str()} + "_cacheTree", TString{title.c_str()});
348 _cacheTree->SetDirectory(nullptr) ;
349 gDirectory->RecursiveRemove(_cacheTree) ;
350 }
351
352 if (notInMemNow) {
353 gDirectory->cd(pwd) ;
354 }
355
356}
357
358
359
360
361////////////////////////////////////////////////////////////////////////////////
362/// Load values from tree 't' into this data collection, optionally
363/// selecting events using the RooFormulaVar 'select'.
364///
365/// The source tree 't' is cloned to not disturb its branch
366/// structure when retrieving information from it.
367void RooTreeDataStore::loadValues(const TTree *t, const RooFormulaVar* select, const char* /*rangeName*/, Int_t /*nStart*/, Int_t /*nStop*/)
368{
369 // Make our local copy of the tree, so we can safely loop through it.
370 // We need a custom deleter, because if we don't deregister the Tree from the directory
371 // of the original, it tears it down at destruction time!
372 auto deleter = [](TTree* tree){tree->SetDirectory(nullptr); delete tree;};
373 std::unique_ptr<TTree, decltype(deleter)> tClone(static_cast<TTree*>(t->Clone()), deleter);
374 tClone->SetDirectory(t->GetDirectory());
375
376 // Clone list of variables
379
380 // Check that we have the branches:
381 bool missingBranches = false;
382 for (const auto var : sourceArgSet) {
383 if (!tClone->GetBranch(var->GetName())) {
384 missingBranches = true;
385 coutE(InputArguments) << "Didn't find a branch in Tree '" << tClone->GetName() << "' to read variable '"
386 << var->GetName() << "' from."
387 << "\n\tNote: Name the RooFit variable the same as the branch." << std::endl;
388 }
389 }
390 if (missingBranches) {
391 coutE(InputArguments) << "Cannot import data from TTree '" << tClone->GetName()
392 << "' because some branches are missing !" << std::endl;
393 return;
394 }
395
396 // Attach args in cloned list to cloned source tree
397 for (const auto sourceArg : sourceArgSet) {
398 sourceArg->attachToTree(*tClone,_defTreeBufSize) ;
399 }
400
401 // Redirect formula servers to sourceArgSet
402 std::unique_ptr<RooFormulaVar> selectClone;
403 if (select) {
404 selectClone.reset( static_cast<RooFormulaVar*>(select->cloneTree()) );
405 selectClone->recursiveRedirectServers(sourceArgSet) ;
406 selectClone->setOperMode(RooAbsArg::ADirty,true) ;
407 }
408
409 // Loop over events in source tree
410 Int_t numInvalid(0) ;
411 const Long64_t nevent = tClone->GetEntries();
412 for(Long64_t i=0; i < nevent; ++i) {
413 const auto entryNumber = tClone->GetEntryNumber(i);
414 if (entryNumber<0) break;
415 tClone->GetEntry(entryNumber,1);
416
417 // Copy from source to destination
418 bool allOK(true) ;
419 for (unsigned int j=0; j < sourceArgSet.size(); ++j) {
420 auto destArg = _varsww[j];
421 const auto sourceArg = sourceArgSet[j];
422
423 destArg->copyCache(sourceArg) ;
424 sourceArg->copyCache(destArg) ;
425 if (!destArg->isValid()) {
426 numInvalid++ ;
427 allOK=false ;
428 if (numInvalid < 5) {
429 auto& log = coutI(DataHandling);
430 log << "RooTreeDataStore::loadValues(" << GetName() << ") Skipping event #" << i << " because " << destArg->GetName()
431 << " cannot accommodate the value ";
432 if(sourceArg->isCategory()) {
434 } else {
436 }
437 log << std::endl;
438 } else if (numInvalid == 5) {
439 coutI(DataHandling) << "RooTreeDataStore::loadValues(" << GetName() << ") Skipping ..." << std::endl;
440 }
441 break ;
442 }
443 }
444
445 // Does this event pass the cuts?
446 if (!allOK || (selectClone && selectClone->getVal()==0)) {
447 continue ;
448 }
449
450 fill() ;
451 }
452
453 if (numInvalid>0) {
454 coutW(DataHandling) << "RooTreeDataStore::loadValues(" << GetName() << ") Ignored " << numInvalid << " out-of-range events" << endl ;
455 }
456
457 SetTitle(t->GetTitle());
458}
459
460
461
462
463
464
465////////////////////////////////////////////////////////////////////////////////
466/// Load values from dataset 't' into this data collection, optionally
467/// selecting events using 'select' RooFormulaVar
468///
469
471 const char* rangeName, std::size_t nStart, std::size_t nStop)
472{
473 // Redirect formula servers to source data row
474 std::unique_ptr<RooFormulaVar> selectClone;
475 if (select) {
476 selectClone.reset( static_cast<RooFormulaVar*>(select->cloneTree()) );
477 selectClone->recursiveRedirectServers(*ads->get()) ;
478 selectClone->setOperMode(RooAbsArg::ADirty,true) ;
479 }
480
481 // Force RDS internal initialization
482 ads->get(0) ;
483
484 // Loop over events in source tree
485 const auto numEntr = static_cast<std::size_t>(ads->numEntries());
486 std::size_t nevent = nStop < numEntr ? nStop : numEntr;
487
488 auto TDS = dynamic_cast<const RooTreeDataStore*>(ads) ;
489 if (TDS) {
490 const_cast<RooTreeDataStore*>(TDS)->resetBuffers();
491 }
492
493 std::vector<std::string> ranges;
494 if (rangeName) {
495 ranges = ROOT::Split(rangeName, ",");
496 }
497
498 for (auto i=nStart; i < nevent ; ++i) {
499 ads->get(i) ;
500
501 // Does this event pass the cuts?
502 if (selectClone && selectClone->getVal()==0) {
503 continue ;
504 }
505
506
507 if (TDS) {
508 _varsww.assignValueOnly(TDS->_varsww) ;
509 } else {
510 _varsww.assignValueOnly(*ads->get()) ;
511 }
512
513 // Check that all copied values are valid
514 bool allValid = true;
515 for (const auto arg : _varsww) {
516 allValid = arg->isValid() && (ranges.empty() || std::any_of(ranges.begin(), ranges.end(),
517 [arg](const std::string& range){return arg->inRange(range.c_str());}) );
518 if (!allValid)
519 break ;
520 }
521
522 if (!allValid) {
523 continue ;
524 }
525
526 _cachedVars.assign(static_cast<RooTreeDataStore const*>(ads)->_cachedVars) ;
527 fill() ;
528 }
529
530 if (TDS) {
531 const_cast<RooTreeDataStore*>(TDS)->restoreAlternateBuffers();
532 }
533
534 SetTitle(ads->GetTitle());
535}
536
537
538////////////////////////////////////////////////////////////////////////////////
539/// Interface function to TTree::Fill
540
542{
543 return _tree->Fill() ;
544}
545
546
547
548////////////////////////////////////////////////////////////////////////////////
549/// Load the n-th data point (n='index') in memory
550/// and return a pointer to the internal RooArgSet
551/// holding its coordinates.
552
554{
555 checkInit() ;
556
557 Int_t ret = const_cast<RooTreeDataStore*>(this)->GetEntry(index, 1);
558
559 if(!ret) return nullptr;
560
561 if (_doDirtyProp) {
562 // Raise all dirty flags
563 for (auto var : _vars) {
564 var->setValueDirty(); // This triggers recalculation of all clients
565 }
566
567 for (auto var : _cachedVars) {
568 var->setValueDirty(); // This triggers recalculation of all clients, but doesn't recalculate self
569 var->clearValueDirty();
570 }
571 }
572
573 // Update current weight cache
574 if (_extWgtArray) {
575
576 // If external array is specified use that
581
582 } else if (_wgtVar) {
583
584 // Otherwise look for weight variable
585 _curWgt = _wgtVar->getVal() ;
589
590 } else {
591
592 // Otherwise return 1
593 _curWgt=1.0 ;
594 _curWgtErrLo = 0 ;
595 _curWgtErrHi = 0 ;
596 _curWgtErr = 0 ;
597
598 }
599
600 return &_vars;
601}
602
603
604////////////////////////////////////////////////////////////////////////////////
605/// Return the weight of the n-th data point (n='index') in memory
606
608{
609 return _curWgt ;
610}
611
612
613////////////////////////////////////////////////////////////////////////////////
614
616{
617 if (_extWgtArray) {
618
619 // We have a weight array, use that info
620
621 // Return symmetric error on current bin calculated either from Poisson statistics or from SumOfWeights
622 double lo = 0;
623 double hi = 0;
624 weightError(lo,hi,etype) ;
625 return (lo+hi)/2 ;
626
627 } else if (_wgtVar) {
628
629 // We have a weight variable, use that info
630 if (_wgtVar->hasAsymError()) {
631 return ( _wgtVar->getAsymErrorHi() - _wgtVar->getAsymErrorLo() ) / 2 ;
632 } else {
633 return _wgtVar->getError() ;
634 }
635
636 }
637
638 // We have no weights
639 return 0.0;
640}
641
642
643
644////////////////////////////////////////////////////////////////////////////////
645
646void RooTreeDataStore::weightError(double& lo, double& hi, RooAbsData::ErrorType etype) const
647{
648 if (_extWgtArray) {
649
650 // We have a weight array, use that info
651 switch (etype) {
652
653 case RooAbsData::Auto:
654 throw string(Form("RooDataHist::weightError(%s) error type Auto not allowed here",GetName())) ;
655 break ;
656
658 throw string(Form("RooDataHist::weightError(%s) error type Expected not allowed here",GetName())) ;
659 break ;
660
662 // Weight may be preset or precalculated
663 if (_curWgtErrLo>=0) {
664 lo = _curWgtErrLo ;
665 hi = _curWgtErrHi ;
666 return ;
667 }
668
669 // Otherwise Calculate poisson errors
670 double ym;
671 double yp;
672 RooHistError::instance().getPoissonInterval(Int_t(weight()+0.5),ym,yp,1) ;
673 lo = weight()-ym ;
674 hi = yp-weight() ;
675 return ;
676
678 lo = _curWgtErr ;
679 hi = _curWgtErr ;
680 return ;
681
682 case RooAbsData::None:
683 lo = 0 ;
684 hi = 0 ;
685 return ;
686 }
687
688 } else if (_wgtVar) {
689
690 // We have a weight variable, use that info
691 if (_wgtVar->hasAsymError()) {
693 lo = _wgtVar->getAsymErrorLo() ;
694 } else {
695 hi = _wgtVar->getError() ;
696 lo = _wgtVar->getError() ;
697 }
698
699 } else {
700
701 // We are unweighted
702 lo=0 ;
703 hi=0 ;
704
705 }
706}
707
708
709////////////////////////////////////////////////////////////////////////////////
710/// Change name of internal observable named 'from' into 'to'
711
712bool RooTreeDataStore::changeObservableName(const char* from, const char* to)
713{
714 // Find observable to be changed
715 RooAbsArg* var = _vars.find(from) ;
716
717 // Check that we found it
718 if (!var) {
719 coutE(InputArguments) << "RooTreeDataStore::changeObservableName(" << GetName() << " no observable " << from << " in this dataset" << endl ;
720 return true ;
721 }
722
723 // Process name change
725 var->SetName(to) ;
726
727 // Change the branch name as well
728 if (_tree->GetBranch(oldBranchName.Data())) {
729
730 // Simple case varName = branchName
731 _tree->GetBranch(oldBranchName.Data())->SetName(var->cleanBranchName().Data()) ;
732
733 // Process any error branch if existing
734 if (_tree->GetBranch(Form("%s_err",oldBranchName.Data()))) {
735 _tree->GetBranch(Form("%s_err",oldBranchName.Data()))->SetName(Form("%s_err",var->cleanBranchName().Data())) ;
736 }
737 if (_tree->GetBranch(Form("%s_aerr_lo",oldBranchName.Data()))) {
738 _tree->GetBranch(Form("%s_aerr_lo",oldBranchName.Data()))->SetName(Form("%s_aerr_lo",var->cleanBranchName().Data())) ;
739 }
740 if (_tree->GetBranch(Form("%s_aerr_hi",oldBranchName.Data()))) {
741 _tree->GetBranch(Form("%s_aerr_hi",oldBranchName.Data()))->SetName(Form("%s_aerr_hi",var->cleanBranchName().Data())) ;
742 }
743
744 } else {
745
746 // Native category case branchNames = varName_idx and varName_lbl
747 if (_tree->GetBranch(Form("%s_idx",oldBranchName.Data()))) {
748 _tree->GetBranch(Form("%s_idx",oldBranchName.Data()))->SetName(Form("%s_idx",var->cleanBranchName().Data())) ;
749 }
750 if (_tree->GetBranch(Form("%s_lbl",oldBranchName.Data()))) {
751 _tree->GetBranch(Form("%s_lbl",oldBranchName.Data()))->SetName(Form("%s_lb",var->cleanBranchName().Data())) ;
752 }
753
754 }
755
756 return false ;
757}
758
759
760
761////////////////////////////////////////////////////////////////////////////////
762/// Add a new column to the data set which holds the pre-calculated values
763/// of 'newVar'. This operation is only meaningful if 'newVar' is a derived
764/// value.
765///
766/// The return value points to the added element holding 'newVar's value
767/// in the data collection. The element is always the corresponding fundamental
768/// type of 'newVar' (e.g. a RooRealVar if 'newVar' is a RooFormulaVar)
769///
770/// Note: This function is explicitly NOT intended as a speed optimization
771/// opportunity for the user. Components of complex PDFs that can be
772/// precalculated with the dataset are automatically identified as such
773/// and will be precalculated when fitting to a dataset
774///
775/// By forcibly precalculating functions with non-trivial Jacobians,
776/// or functions of multiple variables occurring in the data set,
777/// using addColumn(), you may alter the outcome of the fit.
778///
779/// Only in cases where such a modification of fit behaviour is intentional,
780/// this function should be used.
781
783{
784 checkInit() ;
785
786 // Create a fundamental object of the right type to hold newVar values
787 auto valHolder = std::unique_ptr<RooAbsArg>{newVar.createFundamental()}.release();
788 // Sanity check that the holder really is fundamental
789 if(!valHolder->isFundamental()) {
790 coutE(InputArguments) << GetName() << "::addColumn: holder argument is not fundamental: \""
791 << valHolder->GetName() << "\"" << endl;
792 return nullptr;
793 }
794
795 // WVE need to reset TTRee buffers to original datamembers here
796 resetBuffers() ;
797
798 // Clone variable and attach to cloned tree
799 std::unique_ptr<RooAbsArg> newVarClone{newVar.cloneTree()};
800 newVarClone->recursiveRedirectServers(_vars,false) ;
801
802 // Attach value place holder to this tree
803 ((RooAbsArg*)valHolder)->attachToTree(*_tree,_defTreeBufSize) ;
806
807
808 // Fill values of placeholder
809 for (int i=0 ; i<GetEntries() ; i++) {
810 get(i) ;
811
812 newVarClone->syncCache(&_vars) ;
813 valHolder->copyCache(newVarClone.get());
814 valHolder->fillTreeBranch(*_tree) ;
815 }
816
817 // WVE need to restore TTRee buffers to previous values here
819
820 if (adjustRange) {
821// // Set range of valHolder to (just) bracket all values stored in the dataset
822// double vlo,vhi ;
823// RooRealVar* rrvVal = dynamic_cast<RooRealVar*>(valHolder) ;
824// if (rrvVal) {
825// getRange(*rrvVal,vlo,vhi,0.05) ;
826// rrvVal->setRange(vlo,vhi) ;
827// }
828 }
829
830 return valHolder ;
831}
832
833
834////////////////////////////////////////////////////////////////////////////////
835/// Merge columns of supplied data set(s) with this data set. All
836/// data sets must have equal number of entries. In case of
837/// duplicate columns the column of the last dataset in the list
838/// prevails
839
841{
842 RooTreeDataStore* mergedStore = new RooTreeDataStore("merged","merged",allVars) ;
843
844 Int_t nevt = dstoreList.front()->numEntries() ;
845 for (int i=0 ; i<nevt ; i++) {
846
847 // Cope data from self
848 mergedStore->_vars.assign(*get(i)) ;
849
850 // Copy variables from merge sets
851 for (list<RooAbsDataStore*>::iterator iter = dstoreList.begin() ; iter!=dstoreList.end() ; ++iter) {
852 const RooArgSet* partSet = (*iter)->get(i) ;
853 mergedStore->_vars.assign(*partSet) ;
854 }
855
856 mergedStore->fill() ;
857 }
858 return mergedStore ;
859}
860
861
862
863
864
865////////////////////////////////////////////////////////////////////////////////
866
868{
869 Int_t nevt = other.numEntries() ;
870 for (int i=0 ; i<nevt ; i++) {
871 _vars.assign(*other.get(i)) ;
872 if (_wgtVar) {
873 _wgtVar->setVal(other.weight()) ;
874 }
875
876 fill() ;
877 }
878}
879
880
881////////////////////////////////////////////////////////////////////////////////
882
884{
885 if (_wgtVar) {
886
887 double sum(0);
888 double carry(0);
889 Int_t nevt = numEntries() ;
890 for (int i=0 ; i<nevt ; i++) {
891 get(i) ;
892 // Kahan's algorithm for summing to avoid loss of precision
893 double y = _wgtVar->getVal() - carry;
894 double t = sum + y;
895 carry = (t - sum) - y;
896 sum = t;
897 }
898 return sum ;
899
900 } else if (_extWgtArray) {
901
902 double sum(0);
903 double carry(0);
904 Int_t nevt = numEntries() ;
905 for (int i=0 ; i<nevt ; i++) {
906 // Kahan's algorithm for summing to avoid loss of precision
907 double y = _extWgtArray[i] - carry;
908 double t = sum + y;
909 carry = (t - sum) - y;
910 sum = t;
911 }
912 return sum ;
913
914 } else {
915
916 return numEntries() ;
917
918 }
919}
920
921
922
923
924////////////////////////////////////////////////////////////////////////////////
925
927{
928 return _tree->GetEntries() ;
929}
930
931
932
933////////////////////////////////////////////////////////////////////////////////
934
936{
937 Reset() ;
938}
939
940
941
942////////////////////////////////////////////////////////////////////////////////
943/// Cache given RooAbsArgs with this tree: The tree is
944/// given direct write access of the args internal cache
945/// the args values is pre-calculated for all data points
946/// in this data collection. Upon a get() call, the
947/// internal cache of 'newVar' will be loaded with the
948/// precalculated value and it's dirty flag will be cleared.
949
950void RooTreeDataStore::cacheArgs(const RooAbsArg* owner, RooArgSet& newVarSet, const RooArgSet* nset, bool /*skipZeroWeights*/)
951{
952 checkInit() ;
953
954 _cacheOwner = owner ;
955
956 std::unique_ptr<RooArgSet> constExprVarSet{newVarSet.selectByAttrib("ConstantExpression", true)};
957
958 bool doTreeFill = (_cachedVars.empty()) ;
959
960 for (RooAbsArg * arg : *constExprVarSet) {
961 // Attach original newVar to this tree
962 arg->attachToTree(*_cacheTree,_defTreeBufSize) ;
963 //arg->recursiveRedirectServers(_vars) ;
964 _cachedVars.add(*arg) ;
965 }
966
967 // WVE need to reset TTRee buffers to original datamembers here
968 //resetBuffers() ;
969
970 // Refill regular and cached variables of current tree from clone
971 for (int i=0 ; i<GetEntries() ; i++) {
972 get(i) ;
973
974 // Evaluate the cached variables and store the results
975 for (RooAbsArg * arg : *constExprVarSet) {
976 arg->setValueDirty() ;
977 arg->syncCache(nset) ;
978 if (!doTreeFill) {
979 arg->fillTreeBranch(*_cacheTree) ;
980 }
981 }
982
983 if (doTreeFill) {
984 _cacheTree->Fill() ;
985 }
986 }
987
988 // WVE need to restore TTRee buffers to previous values here
989 //restoreAlternateBuffers() ;
990}
991
992
993
994
995////////////////////////////////////////////////////////////////////////////////
996/// Activate or deactivate the branch status of the TTree branch associated
997/// with the given set of dataset observables
998
999void RooTreeDataStore::setArgStatus(const RooArgSet& set, bool active)
1000{
1001 for (RooAbsArg * arg : set) {
1002 RooAbsArg* depArg = _vars.find(arg->GetName()) ;
1003 if (!depArg) {
1004 coutE(InputArguments) << "RooTreeDataStore::setArgStatus(" << GetName()
1005 << ") dataset doesn't contain variable " << arg->GetName() << endl ;
1006 continue ;
1007 }
1008 depArg->setTreeBranchStatus(*_tree,active) ;
1009 }
1010}
1011
1012
1013
1014////////////////////////////////////////////////////////////////////////////////
1015/// Remove tree with values of cached observables
1016/// and clear list of cached observables
1017
1019{
1020 // Empty list of cached functions
1022
1023 // Delete & recreate cache tree
1024 delete _cacheTree ;
1025 _cacheTree = nullptr ;
1026 createTree(makeTreeName().c_str(), GetTitle());
1027
1028 return ;
1029}
1030
1031
1032
1033
1034////////////////////////////////////////////////////////////////////////////////
1035
1037{
1039 for (const auto arg : _varsww) {
1040 RooAbsArg* extArg = extObs.find(arg->GetName()) ;
1041 if (extArg) {
1042 if (arg->getAttribute("StoreError")) {
1043 extArg->setAttribute("StoreError") ;
1044 }
1045 if (arg->getAttribute("StoreAsymError")) {
1046 extArg->setAttribute("StoreAsymError") ;
1047 }
1048 extArg->attachToTree(*_tree) ;
1050 }
1051 }
1052}
1053
1054
1055
1056////////////////////////////////////////////////////////////////////////////////
1057
1059{
1060 for(RooAbsArg * arg : _varsww) {
1061 arg->attachToTree(*_tree) ;
1062 }
1063}
1064
1065
1066
1067////////////////////////////////////////////////////////////////////////////////
1068
1070{
1071 for(RooAbsArg * arg : _attachedBuffers) {
1072 arg->attachToTree(*_tree) ;
1073 }
1074}
1075
1076
1077
1078////////////////////////////////////////////////////////////////////////////////
1079
1081{
1082 if (_defCtor) {
1083 const_cast<RooTreeDataStore*>(this)->initialize() ;
1084 _defCtor = false ;
1085 }
1086}
1087
1088
1089
1090
1091
1092////////////////////////////////////////////////////////////////////////////////
1093/// Interface function to TTree::GetEntries
1094
1096{
1097 return _tree->GetEntries() ;
1098}
1099
1100
1101////////////////////////////////////////////////////////////////////////////////
1102/// Interface function to TTree::Reset
1103
1108
1109
1110////////////////////////////////////////////////////////////////////////////////
1111/// Interface function to TTree::Fill
1112
1114{
1115 return _tree->Fill() ;
1116}
1117
1118
1119////////////////////////////////////////////////////////////////////////////////
1120/// Interface function to TTree::GetEntry
1121
1123{
1125 if (!ret1) return 0 ;
1127 return ret1 ;
1128}
1129
1130
1131////////////////////////////////////////////////////////////////////////////////
1132
1137
1138////////////////////////////////////////////////////////////////////////////////
1139/// Stream an object of class RooTreeDataStore.
1140
1142{
1143 if (R__b.IsReading()) {
1144 UInt_t R__s;
1145 UInt_t R__c;
1146 const Version_t R__v = R__b.ReadVersion(&R__s, &R__c);
1147
1148 R__b.ReadClassBuffer(RooTreeDataStore::Class(), this, R__v, R__s, R__c);
1149
1150 if (!_tree) {
1151 // If the tree has not been deserialised automatically, it is time to load
1152 // it now.
1153 TFile* parent = dynamic_cast<TFile*>(R__b.GetParent());
1154 assert(parent);
1155 parent->GetObject(makeTreeName().c_str(), _tree);
1156 }
1157
1158 initialize();
1159
1160 } else {
1161
1162 TTree* tmpTree = _tree;
1163 auto parent = dynamic_cast<TDirectory*>(R__b.GetParent());
1164 if (_tree && parent) {
1165 // Large trees cannot be written because of the 1Gb I/O limitation.
1166 // Here, we take the tree away from our instance, write it, and continue
1167 // to write the rest of the class normally
1168 auto tmpDir = _tree->GetDirectory();
1169
1170 _tree->SetDirectory(parent);
1171 _tree->FlushBaskets(false);
1172 parent->WriteObject(_tree, makeTreeName().c_str());
1174 _tree = nullptr;
1175 }
1176
1177 R__b.WriteClassBuffer(RooTreeDataStore::Class(), this);
1178
1179 _tree = tmpTree;
1180 }
1181}
1182
1183////////////////////////////////////////////////////////////////////////////////
1184/// Generate a name for the storage tree from the name and title of this instance.
1186 std::string title = GetTitle();
1187 std::replace(title.begin(), title.end(), ' ', '_');
1188 std::replace(title.begin(), title.end(), '-', '_');
1189 return std::string("RooTreeDataStore_") + GetName() + "_" + title;
1190}
1191
1192
1193////////////////////////////////////////////////////////////////////////////////
1194/// Get the weights of the events in the range [first, first+len).
1195/// This implementation will fill a vector with every event retrieved one by one
1196/// (even if the weight is constant). Then, it returns a span.
1197std::span<const double> RooTreeDataStore::getWeightBatch(std::size_t first, std::size_t len) const {
1198
1199 if (_extWgtArray) {
1200 return {_extWgtArray + first, len};
1201 }
1202
1203 if (!_weightBuffer) {
1204 _weightBuffer = std::make_unique<std::vector<double>>();
1205 _weightBuffer->reserve(len);
1206
1207 for (std::size_t i = 0; i < GetEntries(); ++i) {
1208 _weightBuffer->push_back(weight(i));
1209 }
1210 }
1211
1212 return {_weightBuffer->data() + first, len};
1213}
#define coutI(a)
#define coutW(a)
#define coutE(a)
int Int_t
Definition RtypesCore.h:45
short Version_t
Definition RtypesCore.h:65
const char Option_t
Definition RtypesCore.h:66
#define ClassImp(name)
Definition Rtypes.h:382
ROOT::Detail::TRangeCast< T, true > TRangeDynCast
TRangeDynCast is an adapter class that allows the typed iteration through a TCollection.
#define gDirectory
Definition TDirectory.h:384
Option_t Option_t option
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t index
Option_t Option_t TPoint TPoint const char GetTextMagnitude GetFillStyle GetLineColor GetLineWidth GetMarkerStyle GetTextAlign GetTextColor GetTextSize void char Point_t Rectangle_t WindowAttributes_t Float_t Float_t Float_t Int_t Int_t UInt_t UInt_t Rectangle_t Int_t Int_t Window_t TString Int_t GCValues_t GetPrimarySelectionOwner GetDisplay GetScreen GetColormap GetNativeEvent const char const char dpyName wid window const char font_name cursor keysym reg const char only_if_exist regb h Point_t winding char text const char depth char const char Int_t count const char ColorStruct_t color const char Pixmap_t Pixmap_t PictureAttributes_t attr const char char ret_data h unsigned char height h Atom_t Int_t ULong_t ULong_t unsigned char prop_list Atom_t Atom_t Atom_t Time_t UChar_t len
char name[80]
Definition TGX11.cxx:110
#define hi
#define gROOT
Definition TROOT.h:406
char * Form(const char *fmt,...)
Formats a string in a circular formatting buffer.
Definition TString.cxx:2489
const_iterator begin() const
const_iterator end() const
Common abstract base class for objects that represent a value and a "shape" in RooFit.
Definition RooAbsArg.h:79
void SetName(const char *name) override
Set the name of the TNamed.
TString cleanBranchName() const
Construct a mangled name from the actual name that is free of any math symbols that might be interpre...
virtual void removeAll()
Remove all arguments from our set, deleting them if we own them.
RooAbsCollection & assignValueOnly(const RooAbsCollection &other, bool forceIfSizeOne=false)
Sets the value of any argument in our set that also appears in the other set.
virtual bool add(const RooAbsArg &var, bool silent=false)
Add the specified argument to list.
void assign(const RooAbsCollection &other) const
Sets the value, cache and constant attribute of any argument in our set that also appears in the othe...
RooAbsArg * find(const char *name) const
Find object with given name in list.
Abstract base class for a data collection.
bool _doDirtyProp
Switch do (de)activate dirty state propagation when loading a data point.
double getVal(const RooArgSet *normalisationSet=nullptr) const
Evaluate object.
Definition RooAbsReal.h:103
RooArgSet is a container object that can hold multiple RooAbsArg objects.
Definition RooArgSet.h:24
RooArgSet * snapshot(bool deepCopy=true) const
Use RooAbsCollection::snapshot(), but return as RooArgSet.
Definition RooArgSet.h:159
A RooFormulaVar is a generic implementation of a real-valued object, which takes a RooArgList of serv...
static const RooHistError & instance()
Return a reference to a singleton object that is created the first time this method is called.
Variable that can be changed from the outside.
Definition RooRealVar.h:37
void setVal(double value) override
Set value of variable to 'value'.
double getError() const
Definition RooRealVar.h:58
bool hasAsymError(bool allowZero=true) const
Definition RooRealVar.h:64
double getAsymErrorHi() const
Definition RooRealVar.h:63
double getAsymErrorLo() const
Definition RooRealVar.h:62
The RooStringView is a wrapper around a C-style string that can also be constructed from a std::strin...
const char * c_str() const
TTree-backed data storage.
void initialize()
One-time initialization common to all constructor forms.
double _curWgtErr
Weight of current event.
double weightError(RooAbsData::ErrorType etype=RooAbsData::Poisson) const override
void resetBuffers() override
double _curWgt
Buffer for weights in case a batch of values is requested.
void Draw(Option_t *option="") override
Default Draw method for all objects.
void attachCache(const RooAbsArg *newOwner, const RooArgSet &cachedVars) override
Initialize cache of dataset: attach variables of cache ArgSet to the corresponding TTree branches.
double _curWgtErrHi
Weight of current event.
static TClass * Class()
Int_t numEntries() const override
std::string makeTreeName() const
Generate a name for the storage tree from the name and title of this instance.
RooArgSet varsNoWeight(const RooArgSet &allVars, const char *wgtName=nullptr)
Utility function for constructors Return RooArgSet that is copy of allVars minus variable matching wg...
~RooTreeDataStore() override
Destructor.
void createTree(RooStringView name, RooStringView title)
Create TTree object that lives in memory, independent of current location of gDirectory.
const double * _extWgtErrHiArray
! External weight array - high error
Stat_t GetEntries() const
Interface function to TTree::GetEntries.
void attachBuffers(const RooArgSet &extObs) override
Int_t GetEntry(Int_t entry=0, Int_t getall=0)
Interface function to TTree::GetEntry.
void reset() override
RooAbsDataStore * merge(const RooArgSet &allvars, std::list< RooAbsDataStore * > dstoreList) override
Merge columns of supplied data set(s) with this data set.
static Int_t _defTreeBufSize
RooArgSet _attachedBuffers
! Currently attached buffers (if different from _varsww)
Int_t fill() override
Interface function to TTree::Fill.
double sumEntries() const override
std::unique_ptr< RooAbsDataStore > reduce(RooStringView name, RooStringView title, const RooArgSet &vars, const RooFormulaVar *cutVar, const char *cutRange, std::size_t nStart, std::size_t nStop) override
bool _defCtor
Object owning cache contents.
RooAbsArg * addColumn(RooAbsArg &var, bool adjustRange=true) override
Add a new column to the data set which holds the pre-calculated values of 'newVar'.
double weight() const override
Return the weight of the n-th data point (n='index') in memory.
void Reset(Option_t *option=nullptr)
Interface function to TTree::Reset.
void loadValues(const TTree *t, const RooFormulaVar *select=nullptr, const char *rangeName=nullptr, Int_t nStart=0, Int_t nStop=2000000000)
Load values from tree 't' into this data collection, optionally selecting events using the RooFormula...
void append(RooAbsDataStore &other) override
std::span< const double > getWeightBatch(std::size_t first, std::size_t len) const override
Get the weights of the events in the range [first, first+len).
const double * _extWgtErrLoArray
! External weight array - low error
void checkInit() const override
std::unique_ptr< std::vector< double > > _weightBuffer
Int_t Fill()
Interface function to TTree::Fill.
const double * _extSumW2Array
! External sum of weights array
void Streamer(TBuffer &) override
Stream an object of class RooTreeDataStore.
RooRealVar * weightVar(const RooArgSet &allVars, const char *wgtName=nullptr)
Utility function for constructors Return pointer to weight variable if it is defined.
const double * _extWgtArray
! External weight array
double _curWgtErrLo
Weight of current event.
bool changeObservableName(const char *from, const char *to) override
Change name of internal observable named 'from' into 'to'.
void resetCache() override
Remove tree with values of cached observables and clear list of cached observables.
void setArgStatus(const RooArgSet &set, bool active) override
Activate or deactivate the branch status of the TTree branch associated with the given set of dataset...
void cacheArgs(const RooAbsArg *owner, RooArgSet &varSet, const RooArgSet *nset=nullptr, bool skipZeroWeights=false) override
Cache given RooAbsArgs with this tree: The tree is given direct write access of the args internal cac...
virtual const RooArgSet * get() const
const RooAbsArg * _cacheOwner
TTree holding the cached function values.
RooArgSet _varsww
Was object constructed with default ctor?
Buffer base class used for serializing objects.
Definition TBuffer.h:43
Describe directory structure in memory.
Definition TDirectory.h:45
void GetObject(const char *namecycle, T *&ptr)
Get an object with proper type checking.
Definition TDirectory.h:212
A ROOT file is an on-disk file, usually with extension .root, that stores objects in a file-system-li...
Definition TFile.h:53
TObject * Clone(const char *newname="") const override
Make a clone of an object using the Streamer facility.
Definition TNamed.cxx:74
virtual void SetTitle(const char *title="")
Set the title of the TNamed.
Definition TNamed.cxx:164
const char * GetName() const override
Returns name of object.
Definition TNamed.h:47
const char * GetTitle() const override
Returns title of object.
Definition TNamed.h:48
void ResetBit(UInt_t f)
Definition TObject.h:198
@ kCanDelete
if object in a list can be deleted
Definition TObject.h:62
@ kMustCleanup
if object destructor must call RecursiveRemove()
Definition TObject.h:64
Basic string class.
Definition TString.h:139
const char * Data() const
Definition TString.h:376
A TTree represents a columnar dataset.
Definition TTree.h:79
virtual Int_t Fill()
Fill all branches.
Definition TTree.cxx:4603
virtual TBranch * GetBranch(const char *name)
Return pointer to the branch with the given name in this tree or its friends.
Definition TTree.cxx:5294
virtual Int_t FlushBaskets(bool create_cluster=true) const
Write to disk all the basket that have not yet been individually written and create an event cluster ...
Definition TTree.cxx:5129
virtual Int_t GetEntry(Long64_t entry, Int_t getall=0)
Read all branches of entry and return total number of bytes read.
Definition TTree.cxx:5638
void Draw(Option_t *opt) override
Default Draw method for all objects.
Definition TTree.h:431
TDirectory * GetDirectory() const
Definition TTree.h:462
virtual void SetDirectory(TDirectory *dir)
Change the tree's directory.
Definition TTree.cxx:8966
virtual Long64_t GetEntries() const
Definition TTree.h:463
virtual void Reset(Option_t *option="")
Reset baskets, buffers and entries count in all branches and leaves.
Definition TTree.cxx:8003
virtual Long64_t CopyEntries(TTree *tree, Long64_t nentries=-1, Option_t *option="", bool needCopyAddresses=false)
Copy nentries from given tree to this tree.
Definition TTree.cxx:3534
Double_t y[n]
Definition legend1.C:17
std::vector< std::string > Split(std::string_view str, std::string_view delims, bool skipEmpty=false)
Splits a string at each character in delims.
static uint64_t sum(uint64_t i)
Definition Factory.cxx:2345