Rivet analyses referenceBESII_2008_I801208Cross-sections for light hadrons at 3.773 and 3.650 GeVExperiment: BESII (BEPC II) Inspire ID: 801208 Status: VALIDATED Authors:
Beam energies: ANY Run details:
Cross section for $e^+e^-\to K^-\pi^+$, $K^-\pi^+\pi^0$, $K^-\pi^+\pi^+\pi^-$, $K^-\pi^+\pi^+\pi^-\pi^0$ and $K^-\pi^+\pi^0\pi^0$ together with a $K_S^0$ meson at 3.773 and 3.650 GeV. Source code: BESII_2008_I801208.cc 1// -*- C++ -*-
2#include "Rivet/Analysis.hh"
3#include "Rivet/Projections/FinalState.hh"
4
5namespace Rivet {
6
7
8 /// @brief Cross-sections for light hadrons at 3.773 and 3.650 GeV
9 class BESII_2008_I801208 : public Analysis {
10 public:
11
12 /// Constructor
13 RIVET_DEFAULT_ANALYSIS_CTOR(BESII_2008_I801208);
14
15
16 /// @name Analysis methods
17 /// @{
18
19 /// Book histograms and initialise projections before the run
20 void init() {
21
22 // Initialise and register projections
23 declare(FinalState(), "FS");
24
25 // Book histograms
26 for(unsigned int ix=1;ix<7;++ix) {
27 stringstream ss;
28 ss << "TMP/n" << ix;
29 book(_nMeson[ix], ss.str());
30 }
31 }
32
33
34 /// Perform the per-event analysis
35 void analyze(const Event& event) {
36 const FinalState& fs = apply<FinalState>(event, "FS");
37
38 map<long,int> nCount;
39 int ntotal(0);
40 for (const Particle& p : fs.particles()) {
41 nCount[p.pid()] += 1;
42 ++ntotal;
43 }
44 if(nCount[310]!=1) vetoEvent;
45
46 if(ntotal==3) {
47 if((nCount[ 211]==1 && nCount[-321]==1) ||
48 (nCount[-211]==1 && nCount[ 321]==1) )
49 _nMeson[1]->fill();
50 }
51 else if(ntotal==4&&nCount[111]==1) {
52 if((nCount[ 211]==1 && nCount[-321]==1) ||
53 (nCount[-211]==1 && nCount[ 321]==1) )
54 _nMeson[2]->fill();
55 }
56 else if(ntotal==5) {
57 if((nCount[ 211]==2 && nCount[-211]==1 && nCount[-321]==1) ||
58 (nCount[-211]==2 && nCount[ 211]==1 && nCount[ 321]==1) )
59 _nMeson[3]->fill();
60 if(((nCount[ 211]==1 && nCount[-321]==1) ||
61 (nCount[-211]==1 && nCount[ 321]==1) ) && nCount[111]==2)
62 _nMeson[6]->fill();
63 }
64 else if(ntotal==6&&nCount[111]==1) {
65 if((nCount[ 211]==2 && nCount[-211]==1 && nCount[-321]==1) ||
66 (nCount[-211]==2 && nCount[ 211]==1 && nCount[ 321]==1) )
67 _nMeson[4]->fill();
68 }
69 else if(ntotal==7) {
70 if((nCount[ 211]==3 && nCount[-211]==2 && nCount[-321]==1) ||
71 (nCount[-211]==3 && nCount[ 211]==2 && nCount[ 321]==1) )
72 _nMeson[5]->fill();
73 }
74 }
75
76 /// Normalise histograms etc., after the run
77 void finalize() {
78 for(unsigned int ix=1;ix<7;++ix) {
79 double sigma = _nMeson[ix]->val();
80 double error = _nMeson[ix]->err();
81 sigma *= crossSection()/ sumOfWeights() /picobarn;
82 error *= crossSection()/ sumOfWeights() /picobarn;
83 Estimate1DPtr mult;
84 book(mult, 1, 1, ix);
85 for (auto& b : mult->bins()) {
86 if (inRange(sqrtS()/GeV, b.xMin(), b.xMax())) {
87 b.set(sigma, error);
88 }
89 }
90 }
91 }
92
93 /// @}
94
95
96 /// @name Histograms
97 /// @{
98 CounterPtr _nMeson[7];
99 /// @}
100
101
102 };
103
104
105 RIVET_DECLARE_PLUGIN(BESII_2008_I801208);
106
107
108}
|