Go to the documentation of this file.
8 #include "FairLogger.h"
9 #include "FairRootManager.h"
25 , fDeltaDist(nullptr) {
28 Double_t mean = 1.e9 / rate;
29 fDeltaDist =
new TF1(
"DeltaDist",
"exp(-x/[0])/[0]", 0., 10. * mean);
40 for (
auto const& entry :
fInputs)
41 if (entry.second)
delete entry.second;
50 for (
auto const& mapEntry :
fInputs) {
53 input->
GetChain()->SetBranchStatus(branchName, 1);
54 input->
GetChain()->SetBranchAddress(branchName,
object);
69 LOG(fatal) <<
"MCInputSet: invalid chain for input ID " << inputId <<
"!";
75 LOG(fatal) <<
"MCInputSet: input ID " << inputId <<
" is already defined!";
90 LOG(fatal) <<
"MCInputSet: Incompatible branch list!";
106 Bool_t success = kTRUE;
110 LOG(debug) <<
"MCInputSet: Required branch " << entry
111 <<
" not present in input!";
118 std::stringstream ss;
119 ss <<
"MCInputSet: Reference branch list is ";
122 LOG(info) << ss.str();
123 std::stringstream ss1;
124 ss1 <<
"MCInputSet: Input branch list is ";
127 LOG(info) << ss1.str();
148 for (
auto const& entry :
fInputs) {
149 Int_t test = entry.second->GetMaxNofEvents();
150 LOG(info) <<
"MCInputSet: Max. number of events for input " << entry.first
152 if (test >= 0 && (minimum == -1 || test < minimum)) minimum = test;
156 LOG(info) <<
"MCInputSet: Maximal number of events is " << minimum;
167 Bool_t allInputsUsed = kFALSE;
177 allInputsUsed = kTRUE;
181 return std::make_tuple(allInputsUsed, inputId, entry);
188 for (
auto const& mapEntry :
fInputs) {
189 FairRootManager::Instance()->SetInChain(mapEntry.second->GetChain(),
ECbmTreeAccess
Mode to read entries from a ROOT TTree.
ClassImp(CbmConverterManager) InitStatus CbmConverterManager