1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
| // -*- C++ -*-
#include "Rivet/Analysis.hh"
#include "Rivet/Projections/FinalState.hh"
#include "Rivet/Projections/UnstableParticles.hh"
namespace Rivet {
/// @brief Add a short analysis description here
class BABAR_2007_I758568 : public Analysis {
public:
/// Constructor
RIVET_DEFAULT_ANALYSIS_CTOR(BABAR_2007_I758568);
/// @name Analysis methods
//@{
/// Book histograms and initialise projections before the run
void init() {
// Initialise and register projections
declare(FinalState(), "FS");
declare(UnstableParticles(), "UFS");
// Book histograms
for(unsigned int ix=1;ix<12;++ix) {
stringstream ss;
ss << "TMP/n" << ix;
book(_nMeson[ix], ss.str());
}
}
void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
for(const Particle &child : p.children()) {
if(child.children().empty()) {
nRes[child.pid()]-=1;
--ncount;
}
else
findChildren(child,nRes,ncount);
}
}
/// Perform the per-event analysis
void analyze(const Event& event) {
const FinalState& fs = apply<FinalState>(event, "FS");
map<long,int> nCount;
int ntotal(0);
for (const Particle& p : fs.particles()) {
nCount[p.pid()] += 1;
++ntotal;
}
const FinalState& ufs = apply<FinalState>(event, "UFS");
for (const Particle& p : ufs.particles()) {
if(p.children().empty()) continue;
if(p.pid()!=223 && p.pid()!=221&&p.pid()!=331&& p.pid()!=20223)
continue;
map<long,int> nRes = nCount;
int ncount = ntotal;
findChildren(p,nRes,ncount);
// omega
if(p.pid()==223) {
if(ncount==2) {
bool matched = true;
for(auto const & val : nRes) {
if(abs(val.first)==211) {
if(val.second!=1) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) _nMeson[3]->fill();
matched = true;
for(auto const & val : nRes) {
if(abs(val.first)==321) {
if(val.second!=1) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) _nMeson[10]->fill();
}
for (const Particle& p2 : ufs.particles()) {
if(p2.pid()!=9010221) continue;
if(p2.parents()[0].isSame(p)) continue;
map<long,int> nResB = nRes;
int ncountB = ncount;
findChildren(p2,nResB,ncountB);
if(ncountB!=0) continue;
bool matched2 = true;
for(auto const & val : nResB) {
if(val.second!=0) {
matched2 = false;
break;
}
}
if(matched2) _nMeson[4]->fill();
}
}
else if(p.pid()==221) {
if(ncount==2) {
bool matched = true;
for(auto const & val : nRes) {
if(abs(val.first)==211) {
if(val.second!=1) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) _nMeson[2]->fill();
}
else if(ncount==4) {
bool matched = true;
for(auto const & val : nRes) {
if(abs(val.first)==211) {
if(val.second!=2) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) _nMeson[5]->fill();
matched=true;
for(auto const & val : nRes) {
if(abs(val.first)==211 || abs(val.first)==321) {
if(val.second!=1) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) _nMeson[11]->fill();
}
for(const Particle& p2 : ufs.particles()) {
if(p2.pid()!=333) continue;
map<long,int> nResB = nRes;
int ncountB = ncount;
findChildren(p2,nResB,ncountB);
if(ncountB!=0) continue;
bool matched2 = true;
for(auto const & val : nResB) {
if(val.second!=0) {
matched2 = false;
break;
}
}
if(matched2) _nMeson[9]->fill();
}
}
else if(p.pid()==331 || p.pid()==20223) {
if(ncount!=2) continue;
bool matched = true;
for(auto const & val : nRes) {
if(abs(val.first)==211) {
if(val.second!=1) {
matched = false;
break;
}
}
else if(val.second!=0) {
matched = false;
break;
}
}
if(matched) {
if(p.pid()==331)
_nMeson[6]->fill();
else
_nMeson[7]->fill();
}
}
}
if(ntotal==5) {
if(nCount[211]==2&&nCount[-211]==2&&nCount[111]==1)
_nMeson[1]->fill();
else if(nCount[321]==1&&nCount[-321]==1&&
nCount[211]==1&&nCount[-211]==1&&nCount[111]==1)
_nMeson[8]->fill();
}
}
/// Normalise histograms etc., after the run
void finalize() {
for(unsigned int ix=1;ix<12;++ix) {
double sigma = _nMeson[ix]->val();
double error = _nMeson[ix]->err();
sigma *= crossSection()/ sumOfWeights() /nanobarn;
error *= crossSection()/ sumOfWeights() /nanobarn;
Scatter2D temphisto(refData(ix, 1, 1));
Scatter2DPtr mult;
book(mult, ix, 1, 1);
for (size_t b = 0; b < temphisto.numPoints(); b++) {
const double x = temphisto.point(b).x();
pair<double,double> ex = temphisto.point(b).xErrs();
pair<double,double> ex2 = ex;
if(ex2.first ==0.) ex2. first=0.0001;
if(ex2.second==0.) ex2.second=0.0001;
if (inRange(sqrtS()/GeV, x-ex2.first, x+ex2.second)) {
mult->addPoint(x, sigma, ex, make_pair(error,error));
}
else {
mult->addPoint(x, 0., ex, make_pair(0.,.0));
}
}
}
}
//@}
/// @name Histograms
//@{
CounterPtr _nMeson[12];
//@}
};
// The hook for the plugin system
RIVET_DECLARE_PLUGIN(BABAR_2007_I758568);
}
|