|
| 1 | +int Hybrid() { |
| 2 | + std::string path{"o2sim_Kine.root"}; |
| 3 | + |
| 4 | + const int pdgPi0 = 111; |
| 5 | + const int pdgEta = 221; |
| 6 | + const double yMin = -1.5; |
| 7 | + const double yMax = 1.5; |
| 8 | + const int minNb = 1; |
| 9 | + |
| 10 | + TFile file(path.c_str(), "READ"); |
| 11 | + if (file.IsZombie()) { |
| 12 | + std::cerr << "Cannot open ROOT file " << path << "\n"; |
| 13 | + return 1; |
| 14 | + } |
| 15 | + |
| 16 | + auto tree = (TTree*)file.Get("o2sim"); |
| 17 | + if (!tree) { |
| 18 | + std::cerr << "Cannot find tree o2sim\n"; |
| 19 | + return 1; |
| 20 | + } |
| 21 | + |
| 22 | + std::vector<o2::MCTrack>* tracks{}; |
| 23 | + tree->SetBranchAddress("MCTrack", &tracks); |
| 24 | + |
| 25 | + int nEvents = tree->GetEntries(); |
| 26 | + int nAccepted = 0; |
| 27 | + int totalPi0 = 0, totalEta = 0; |
| 28 | + |
| 29 | + for (int i = 0; i < nEvents; ++i) { |
| 30 | + tree->GetEntry(i); |
| 31 | + |
| 32 | + int count = 0; |
| 33 | + for (auto& track : *tracks) { |
| 34 | + int pdg = std::abs(track.GetPdgCode()); |
| 35 | + double y = track.GetRapidity(); |
| 36 | + |
| 37 | + if ((pdg == pdgPi0 || pdg == pdgEta) && y >= yMin && y <= yMax) { |
| 38 | + count++; |
| 39 | + if (pdg == pdgPi0) totalPi0++; |
| 40 | + if (pdg == pdgEta) totalEta++; |
| 41 | + } |
| 42 | + } |
| 43 | + |
| 44 | + if (count < minNb) { |
| 45 | + std::cerr << " Trigger violation in event " << i |
| 46 | + << " (found " << count << " π0/η in rapidity window)\n"; |
| 47 | + return 1; |
| 48 | + } |
| 49 | + |
| 50 | + nAccepted++; |
| 51 | + } |
| 52 | + |
| 53 | + std::cout << "--------------------------------------\n"; |
| 54 | + std::cout << "Trigger test: π0/η within rapidity window\n"; |
| 55 | + std::cout << "Events tested: " << nEvents << "\n"; |
| 56 | + std::cout << "Events accepted: " << nAccepted << "\n"; |
| 57 | + std::cout << "# π0: " << totalPi0 << ", # η: " << totalEta << "\n"; |
| 58 | + std::cout << "Trigger test PASSED\n"; |
| 59 | + |
| 60 | + return 0; |
| 61 | +} |
0 commit comments