Rivet analyses referenceBELLE_2009_I823878Cross section for $\phi\eta$, $\phi\eta^\prime$, $\rho^0\eta$, $\rho^0\eta^\prime$ at 10.58 GeVExperiment: BELLE (KEKB) Inspire ID: 823878 Status: VALIDATED Authors:
Beam energies: ANY Run details:
Measurement of the cross section for $\phi\eta$, $\phi\eta^\prime$, $\rho^0\eta$, $\rho^0\eta^\prime$ at 10.58 GeV Source code: BELLE_2009_I823878.cc 1// -*- C++ -*-
2#include "Rivet/Analysis.hh"
3#include "Rivet/Projections/FinalState.hh"
4#include "Rivet/Projections/UnstableParticles.hh"
5
6namespace Rivet {
7
8
9 /// @brief Add a short analysis description here
10 class BELLE_2009_I823878 : public Analysis {
11 public:
12
13 /// Constructor
14 RIVET_DEFAULT_ANALYSIS_CTOR(BELLE_2009_I823878);
15
16
17 /// @name Analysis methods
18 /// @{
19
20 /// Book histograms and initialise projections before the run
21 void init() {
22
23 // Initialise and register projections
24 declare(FinalState(), "FS");
25 declare(UnstableParticles(), "UFS");
26
27 book(_nMeson[1], 1, 1, 1);
28 book(_nMeson[2], 1, 1, 2);
29 book(_nMeson[3], 1, 1, 3);
30 book(_nMeson[4], 1, 1, 4);
31 }
32
33 void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
34 for (const Particle &child : p.children()) {
35 if (child.children().empty()) {
36 nRes[child.pid()]-=1;
37 --ncount;
38 }
39 else {
40 findChildren(child,nRes,ncount);
41 }
42 }
43 }
44
45 /// Perform the per-event analysis
46 void analyze(const Event& event) {
47 const FinalState& fs = apply<FinalState>(event, "FS");
48
49 map<long,int> nCount;
50 int ntotal(0);
51 for (const Particle& p : fs.particles()) {
52 nCount[p.pid()] += 1;
53 ++ntotal;
54 }
55 const FinalState& ufs = apply<FinalState>(event, "UFS");
56 for (const Particle& p : ufs.particles()) {
57 if (p.children().empty()) continue;
58 if (p.pid()!=333 && p.pid()!=113) continue;
59 map<long,int> nRes=nCount;
60 int ncount = ntotal;
61 findChildren(p,nRes,ncount);
62 for (const Particle& p2 : ufs.particles()) {
63 if (p2.pid()!=221 && p2.pid()!=331 ) continue;
64 if (p2.parents()[0].isSame(p)) continue;
65 map<long,int> nResB = nRes;
66 int ncountB = ncount;
67 findChildren(p2,nResB,ncountB);
68 if (ncountB!=0) continue;
69 bool matched2 = true;
70 for (const auto& val : nResB) {
71 if (val.second!=0) {
72 matched2 = false;
73 break;
74 }
75 }
76 if (matched2) {
77 unsigned int iloc=1;
78 if(p.pid()==113 ) iloc+=2;
79 if(p2.pid()==331) iloc+=1;
80 _nMeson[iloc]->fill(Ecm);
81 }
82 }
83 }
84 }
85
86 /// Normalise histograms etc., after the run
87 void finalize() {
88 const double sf = crossSection()/ sumOfWeights() /femtobarn;
89 scale(_nMeson, sf);
90 }
91
92 /// @}
93
94
95 /// @name Histograms
96 /// @{
97 BinnedHistoPtr<string> _nMeson[5];
98 const string Ecm = "10.58";
99 /// @}
100
101
102 };
103
104
105 RIVET_DECLARE_PLUGIN(BELLE_2009_I823878);
106
107
108}
|
