////////////////////////////////////////////////////////// // This class has been automatically generated on // Fri Jun 9 15:13:40 2023 by ROOT version 6.24/06 // from TTree fTreeEvent/Event Tree // found on file: AnalysisResults_total.root ////////////////////////////////////////////////////////// #ifndef test_h #define test_h #include #include #include // Header file for the classes stored in the TTree if any. class test { public : TTree *fChain; //!pointer to the analyzed TTree or TChain Int_t fCurrent; //!current Tree number in a TChain // Fixed size dimensions of array or collections stored in the TTree if any. // Declaration of leaf types Float_t fTreeVariableCentrality; Float_t fNoKaonPlus_ptmax2; Float_t fNoKaonMinus_ptmax2; Float_t fNoPionPlus_ptmax2; Float_t fNoPionMinus_ptmax2; Float_t fNoProtonPlus_ptmax2; Float_t fNoProtonMinus_ptmax2; Float_t fNoKaonPlus_ptmax3; Float_t fNoKaonMinus_ptmax3; Float_t fNoPionPlus_ptmax3; Float_t fNoPionMinus_ptmax3; Float_t fNoProtonPlus_ptmax3; Float_t fNoProtonMinus_ptmax3; Float_t fCorrectedNoKaonPlus_ptmax2; Float_t fCorrectedNoKaonMinus_ptmax2; Float_t fCorrectedNoPionPlus_ptmax2; Float_t fCorrectedNoPionMinus_ptmax2; Float_t fCorrectedNoProtonPlus_ptmax2; Float_t fCorrectedNoProtonMinus_ptmax2; Float_t fCorrectedNoKaonPlus_ptmax3; Float_t fCorrectedNoKaonMinus_ptmax3; Float_t fCorrectedNoPionPlus_ptmax3; Float_t fCorrectedNoPionMinus_ptmax3; Float_t fCorrectedNoProtonPlus_ptmax3; Float_t fCorrectedNoProtonMinus_ptmax3; Float_t fEffSqrFactrKaonPlus_ptmax2; Float_t fEffSqrFactrKaonMinus_ptmax2; Float_t fEffSqrFactrPionPlus_ptmax2; Float_t fEffSqrFactrPionMinus_ptmax2; Float_t fEffSqrFactrProtonPlus_ptmax2; Float_t fEffSqrFactrProtonMinus_ptmax2; Float_t fEffSqrFactrKaonPlus_ptmax3; Float_t fEffSqrFactrKaonMinus_ptmax3; Float_t fEffSqrFactrPionPlus_ptmax3; Float_t fEffSqrFactrPionMinus_ptmax3; Float_t fEffSqrFactrProtonPlus_ptmax3; Float_t fEffSqrFactrProtonMinus_ptmax3; // List of branches TBranch *b_fTreeVariableCentrality; //! TBranch *b_fNoKaonPlus_ptmax2; //! TBranch *b_fNoKaonMinus_ptmax2; //! TBranch *b_fNoPionPlus_ptmax2; //! TBranch *b_fNoPionMinus_ptmax2; //! TBranch *b_fNoProtonPlus_ptmax2; //! TBranch *b_fNoProtonMinus_ptmax2; //! TBranch *b_fNoKaonPlus_ptmax3; //! TBranch *b_fNoKaonMinus_ptmax3; //! TBranch *b_fNoPionPlus_ptmax3; //! TBranch *b_fNoPionMinus_ptmax3; //! TBranch *b_fNoProtonPlus_ptmax3; //! TBranch *b_fNoProtonMinus_ptmax3; //! TBranch *b_fCorrectedNoKaonPlus_ptmax2; //! TBranch *b_fCorrectedNoKaonMinus_ptmax2; //! TBranch *b_fCorrectedNoPionPlus_ptmax2; //! TBranch *b_fCorrectedNoPionMinus_ptmax2; //! TBranch *b_fCorrectedNoProtonPlus_ptmax2; //! TBranch *b_fCorrectedNoProtonMinus_ptmax2; //! TBranch *b_fCorrectedNoKaonPlus_ptmax3; //! TBranch *b_fCorrectedNoKaonMinus_ptmax3; //! TBranch *b_fCorrectedNoPionPlus_ptmax3; //! TBranch *b_fCorrectedNoPionMinus_ptmax3; //! TBranch *b_fCorrectedNoProtonPlus_ptmax3; //! TBranch *b_fCorrectedNoProtonMinus_ptmax3; //! TBranch *b_fEffSqrFactrKaonPlus_ptmax2; //! TBranch *b_fEffSqrFactrKaonMinus_ptmax2; //! TBranch *b_fEffSqrFactrPionPlus_ptmax2; //! TBranch *b_fEffSqrFactrPionMinus_ptmax2; //! TBranch *b_fEffSqrFactrProtonPlus_ptmax2; //! TBranch *b_fEffSqrFactrProtonMinus_ptmax2; //! TBranch *b_fEffSqrFactrKaonPlus_ptmax3; //! TBranch *b_fEffSqrFactrKaonMinus_ptmax3; //! TBranch *b_fEffSqrFactrPionPlus_ptmax3; //! TBranch *b_fEffSqrFactrPionMinus_ptmax3; //! TBranch *b_fEffSqrFactrProtonPlus_ptmax3; //! TBranch *b_fEffSqrFactrProtonMinus_ptmax3; //! test(TTree *tree=0); virtual ~test(); virtual Int_t Cut(Long64_t entry); virtual Int_t GetEntry(Long64_t entry); virtual Long64_t LoadTree(Long64_t entry); virtual void Init(TTree *tree); virtual void Loop(); virtual Bool_t Notify(); virtual void Show(Long64_t entry = -1); }; #endif #ifdef test_cxx test::test(TTree *tree) : fChain(0) { // if parameter tree is not specified (or zero), connect the file // used to generate this class and read the Tree. if (tree == 0) { TFile *f = (TFile*)gROOT->GetListOfFiles()->FindObject("datafile/AnalysisResults1.root"); if (!f || !f->IsOpen()) { f = new TFile("datafile/AnalysisResults1.root"); } TDirectory * dir = (TDirectory*)f->Get("datafile/AnalysisResults1.root:/ResultsData"); TList *list = (TList*)dir->Get("AnalysisMain_tree_FB768"); tree = (TTree*)list->FindObject("fTreeEvent"); } Init(tree); } test::~test() { if (!fChain) return; delete fChain->GetCurrentFile(); } Int_t test::GetEntry(Long64_t entry) { // Read contents of entry. if (!fChain) return 0; return fChain->GetEntry(entry); } Long64_t test::LoadTree(Long64_t entry) { // Set the environment to read one entry if (!fChain) return -5; Long64_t centry = fChain->LoadTree(entry); if (centry < 0) return centry; if (fChain->GetTreeNumber() != fCurrent) { fCurrent = fChain->GetTreeNumber(); Notify(); } return centry; } void test::Init(TTree *tree) { // The Init() function is called when the selector needs to initialize // a new tree or chain. Typically here the branch addresses and branch // pointers of the tree will be set. // It is normally not necessary to make changes to the generated // code, but the routine can be extended by the user if needed. // Init() will be called many times when running on PROOF // (once per file to be processed). // Set branch addresses and branch pointers if (!tree) return; fChain = tree; fCurrent = -1; fChain->SetMakeClass(1); fChain->SetBranchAddress("fTreeVariableCentrality", &fTreeVariableCentrality, &b_fTreeVariableCentrality); fChain->SetBranchAddress("fNoKaonPlus_ptmax2", &fNoKaonPlus_ptmax2, &b_fNoKaonPlus_ptmax2); fChain->SetBranchAddress("fNoKaonMinus_ptmax2", &fNoKaonMinus_ptmax2, &b_fNoKaonMinus_ptmax2); fChain->SetBranchAddress("fNoPionPlus_ptmax2", &fNoPionPlus_ptmax2, &b_fNoPionPlus_ptmax2); fChain->SetBranchAddress("fNoPionMinus_ptmax2", &fNoPionMinus_ptmax2, &b_fNoPionMinus_ptmax2); fChain->SetBranchAddress("fNoProtonPlus_ptmax2", &fNoProtonPlus_ptmax2, &b_fNoProtonPlus_ptmax2); fChain->SetBranchAddress("fNoProtonMinus_ptmax2", &fNoProtonMinus_ptmax2, &b_fNoProtonMinus_ptmax2); fChain->SetBranchAddress("fNoKaonPlus_ptmax3", &fNoKaonPlus_ptmax3, &b_fNoKaonPlus_ptmax3); fChain->SetBranchAddress("fNoKaonMinus_ptmax3", &fNoKaonMinus_ptmax3, &b_fNoKaonMinus_ptmax3); fChain->SetBranchAddress("fNoPionPlus_ptmax3", &fNoPionPlus_ptmax3, &b_fNoPionPlus_ptmax3); fChain->SetBranchAddress("fNoPionMinus_ptmax3", &fNoPionMinus_ptmax3, &b_fNoPionMinus_ptmax3); fChain->SetBranchAddress("fNoProtonPlus_ptmax3", &fNoProtonPlus_ptmax3, &b_fNoProtonPlus_ptmax3); fChain->SetBranchAddress("fNoProtonMinus_ptmax3", &fNoProtonMinus_ptmax3, &b_fNoProtonMinus_ptmax3); fChain->SetBranchAddress("fCorrectedNoKaonPlus_ptmax2", &fCorrectedNoKaonPlus_ptmax2, &b_fCorrectedNoKaonPlus_ptmax2); fChain->SetBranchAddress("fCorrectedNoKaonMinus_ptmax2", &fCorrectedNoKaonMinus_ptmax2, &b_fCorrectedNoKaonMinus_ptmax2); fChain->SetBranchAddress("fCorrectedNoPionPlus_ptmax2", &fCorrectedNoPionPlus_ptmax2, &b_fCorrectedNoPionPlus_ptmax2); fChain->SetBranchAddress("fCorrectedNoPionMinus_ptmax2", &fCorrectedNoPionMinus_ptmax2, &b_fCorrectedNoPionMinus_ptmax2); fChain->SetBranchAddress("fCorrectedNoProtonPlus_ptmax2", &fCorrectedNoProtonPlus_ptmax2, &b_fCorrectedNoProtonPlus_ptmax2); fChain->SetBranchAddress("fCorrectedNoProtonMinus_ptmax2", &fCorrectedNoProtonMinus_ptmax2, &b_fCorrectedNoProtonMinus_ptmax2); fChain->SetBranchAddress("fCorrectedNoKaonPlus_ptmax3", &fCorrectedNoKaonPlus_ptmax3, &b_fCorrectedNoKaonPlus_ptmax3); fChain->SetBranchAddress("fCorrectedNoKaonMinus_ptmax3", &fCorrectedNoKaonMinus_ptmax3, &b_fCorrectedNoKaonMinus_ptmax3); fChain->SetBranchAddress("fCorrectedNoPionPlus_ptmax3", &fCorrectedNoPionPlus_ptmax3, &b_fCorrectedNoPionPlus_ptmax3); fChain->SetBranchAddress("fCorrectedNoPionMinus_ptmax3", &fCorrectedNoPionMinus_ptmax3, &b_fCorrectedNoPionMinus_ptmax3); fChain->SetBranchAddress("fCorrectedNoProtonPlus_ptmax3", &fCorrectedNoProtonPlus_ptmax3, &b_fCorrectedNoProtonPlus_ptmax3); fChain->SetBranchAddress("fCorrectedNoProtonMinus_ptmax3", &fCorrectedNoProtonMinus_ptmax3, &b_fCorrectedNoProtonMinus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrKaonPlus_ptmax2", &fEffSqrFactrKaonPlus_ptmax2, &b_fEffSqrFactrKaonPlus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrKaonMinus_ptmax2", &fEffSqrFactrKaonMinus_ptmax2, &b_fEffSqrFactrKaonMinus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrPionPlus_ptmax2", &fEffSqrFactrPionPlus_ptmax2, &b_fEffSqrFactrPionPlus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrPionMinus_ptmax2", &fEffSqrFactrPionMinus_ptmax2, &b_fEffSqrFactrPionMinus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrProtonPlus_ptmax2", &fEffSqrFactrProtonPlus_ptmax2, &b_fEffSqrFactrProtonPlus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrProtonMinus_ptmax2", &fEffSqrFactrProtonMinus_ptmax2, &b_fEffSqrFactrProtonMinus_ptmax2); fChain->SetBranchAddress("fEffSqrFactrKaonPlus_ptmax3", &fEffSqrFactrKaonPlus_ptmax3, &b_fEffSqrFactrKaonPlus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrKaonMinus_ptmax3", &fEffSqrFactrKaonMinus_ptmax3, &b_fEffSqrFactrKaonMinus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrPionPlus_ptmax3", &fEffSqrFactrPionPlus_ptmax3, &b_fEffSqrFactrPionPlus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrPionMinus_ptmax3", &fEffSqrFactrPionMinus_ptmax3, &b_fEffSqrFactrPionMinus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrProtonPlus_ptmax3", &fEffSqrFactrProtonPlus_ptmax3, &b_fEffSqrFactrProtonPlus_ptmax3); fChain->SetBranchAddress("fEffSqrFactrProtonMinus_ptmax3", &fEffSqrFactrProtonMinus_ptmax3, &b_fEffSqrFactrProtonMinus_ptmax3); Notify(); } Bool_t test::Notify() { // The Notify() function is called when a new file is opened. This // can be either for a new TTree in a TChain or when when a new TTree // is started when using PROOF. It is normally not necessary to make changes // to the generated code, but the routine can be extended by the // user if needed. The return value is currently not used. return kTRUE; } void test::Show(Long64_t entry) { // Print contents of entry. // If entry is not specified, print current entry if (!fChain) return; fChain->Show(entry); } Int_t test::Cut(Long64_t entry) { // This function may be called from Loop. // returns 1 if entry is accepted. // returns -1 otherwise. return 1; } #endif // #ifdef test_cxx