4 #include "MemoryUsage.hxx" 5 #include "CoreDataClasses.hxx" 6 #include "AnalysisAlgorithm.hxx" 32 void Loop(
int nmax=0,
int imin=0);
38 void SetEvent(
AnaEventC* event){_event= event;}
129 void PrintUsage(
const std::string& programName);
198 Float_t* _weightCorr;
203 Double_t _toy_weight;
void DefineCorrections()
Define the corrections to be applied.
MemoryUsage _memory
Tools for tracking memory usage.
void Loop(int nmax=0, int imin=0)
AnalysisLoop(AnalysisAlgorithm *ana, int argc, char *argv[])
Constructor which parses and sanity checks the command line options.
void FillHeaderTree()
Fill the "header" tree, which includes POT information etc.
bool Process(SelectionBase &selec)
void FinalizeSelection(const SelectionBase &sel)
void DefineMicroTrees()
Define the variables that should be stored in the output micro-trees.
std::string _inputFileType
void InitializeConfiguration()
bool _versionCheck
Check version compatibility between nd280AnalysisTools compilation and oaAnalysis file...
void FillToyVarsInMicroTrees()
Fill the standard configurations only toy-dependent variables.
std::string _inputFileName
Path to the input file, as defined by the user.
void PrintUsage(const std::string &programName)
void DefineTruthTree()
Define the "truth" tree. See FillTruthTree().
std::string _inputSkimFileName
Path to the file with the list of events to skim, as defined by the user.
void DefineConfigurations()
Define the configurations (micro-trees) and which systematics should be applied in each "configuratio...
std::string _outputFileName
What to call the output file, as defined by the user.
void FillConfigTree()
Fill the "config" tree, which includes details of the analysis cuts etc.
bool _fillTrees
Whether to fill the trees and create an output file or not.
void FillMicroTrees()
Fill the standard configurations trees:
bool FinalizeConfiguration()
bool _enableTruthTree
Whether the "truth" tree should be filled. See FillTruthTree().
Long64_t _entry
Fill the "truth" tree.
bool FinalizeToy()
Called after each toy experiment is complete.