clang -cc1 -cc1 -triple x86_64-unknown-linux-gnu -analyze -disable-free -main-file-name DFDCPseudo_factory.cc -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model pic -pic-level 2 -fhalf-no-semantic-interposition -mframe-pointer=none -fmath-errno -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -fno-split-dwarf-inlining -debugger-tuning=gdb -resource-dir /w/halld-scifs17exp/home/sdobbs/clang/llvm-project/install/lib/clang/12.0.0 -D HAVE_CCDB -D HAVE_RCDB -D HAVE_EVIO -D HAVE_TMVA=1 -D RCDB_MYSQL=1 -D RCDB_SQLITE=1 -D SQLITE_USE_LEGACY_STRUCT=ON -I .Linux_CentOS7.7-x86_64-gcc4.8.5/libraries/FDC -I libraries/FDC -I . -I libraries -I libraries/include -I /w/halld-scifs17exp/home/sdobbs/clang/halld_recon/Linux_CentOS7.7-x86_64-gcc4.8.5/include -I external/xstream/include -I /usr/include/tirpc -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/root/root-6.08.06/include -I /w/halld-scifs17exp/halld2/home/sdobbs/Software/jana/jana_0.8.2/Linux_CentOS7.7-x86_64-gcc4.8.5/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/ccdb/ccdb_1.06.06/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/rcdb/rcdb_0.06.00/cpp/include -I /usr/include/mysql -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/sqlitecpp/SQLiteCpp-2.2.0^bs130/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/sqlite/sqlite-3.13.0^bs130/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/hdds/hdds-4.9.0/Linux_CentOS7.7-x86_64-gcc4.8.5/src -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/xerces-c/xerces-c-3.1.4/include -I /group/halld/Software/builds/Linux_CentOS7.7-x86_64-gcc4.8.5/evio/evio-4.4.6/Linux-x86_64/include -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5 -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5/x86_64-redhat-linux -internal-isystem /usr/lib/gcc/x86_64-redhat-linux/4.8.5/../../../../include/c++/4.8.5/backward -internal-isystem /usr/local/include -internal-isystem /w/halld-scifs17exp/home/sdobbs/clang/llvm-project/install/lib/clang/12.0.0/include -internal-externc-isystem /include -internal-externc-isystem /usr/include -O2 -std=c++11 -fdeprecated-macro -fdebug-compilation-dir /home/sdobbs/work/clang/halld_recon/src -ferror-limit 19 -fgnuc-version=4.2.1 -fcxx-exceptions -fexceptions -vectorize-loops -vectorize-slp -analyzer-output=html -faddrsig -o /tmp/scan-build-2021-01-21-110224-160369-1 -x c++ libraries/FDC/DFDCPseudo_factory.cc
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | #include "DFDCPseudo_factory.h" |
10 | #include "HDGEOMETRY/DGeometry.h" |
11 | #include "DFDCGeometry.h" |
12 | #include <TRACKING/DTrackHitSelectorTHROWN.h> |
13 | #include <TROOT.h> |
14 | #include <FDC/DFDCCathodeDigiHit.h> |
15 | |
16 | #define HALF_CELL 0.5 |
17 | #define MAX_DEFLECTION 0.15 |
18 | #define X0 0 |
19 | #define QA 1 |
20 | #define K2 2 |
21 | #define ITER_MAX 100 |
22 | #define TOLX 1e-4 |
23 | #define TOLF 1e-4 |
24 | #define A_OVER_H 0.4 |
25 | #define ONE_OVER_H 2.0 |
26 | #define ALPHA 1e-4 // rate parameter for Newton step backtracking algorithm |
27 | #define W_EFF 30.2e-9 // GeV |
28 | #define GAS_GAIN 8e4 |
29 | #define ELECTRON_CHARGE 1.6022e-4 // fC |
30 | |
31 | |
32 | |
33 | |
34 | |
35 | |
36 | |
37 | bool DFDCAnode_gLayer_cmp(const DFDCHit* a, const DFDCHit* b) { |
38 | return a->gLayer < b->gLayer; |
39 | } |
40 | |
41 | bool static fdcxhit_cmp(const DFDCHit *a, const DFDCHit *b){ |
42 | if (a->element != b->element) return (a->element < b->element); |
43 | return (a->t < b->t); |
44 | } |
45 | |
46 | |
47 | bool DFDCPseudo_cmp(const DFDCPseudo* a, const DFDCPseudo *b){ |
48 | if (a->wire->wire == b->wire->wire && a->wire->layer==b->wire->layer){ |
49 | return a->time<b->time; |
50 | } |
51 | if (a->wire->layer!=b->wire->layer) return a->wire->layer<b->wire->layer; |
52 | |
53 | return a->wire->wire<b->wire->wire; |
54 | } |
55 | |
56 | |
57 | |
58 | |
59 | |
60 | |
61 | |
62 | |
63 | DFDCPseudo_factory::DFDCPseudo_factory() { |
64 | |
65 | |
66 | } |
67 | |
68 | |
69 | |
70 | |
71 | |
72 | DFDCPseudo_factory::~DFDCPseudo_factory() { |
73 | if (fdcwires.size()){ |
74 | for (unsigned int i=0;i<fdcwires.size();i++){ |
75 | for (unsigned int j=0;j<fdcwires[i].size();j++){ |
76 | delete fdcwires[i][j]; |
77 | } |
78 | } |
79 | } |
80 | if (fdccathodes.size()){ |
81 | for (unsigned int i=0;i<fdccathodes.size();i++){ |
82 | for (unsigned int j=0;j<fdccathodes[i].size();j++){ |
83 | delete fdccathodes[i][j]; |
84 | } |
85 | } |
86 | } |
87 | |
88 | } |
89 | |
90 | |
91 | |
92 | |
93 | jerror_t DFDCPseudo_factory::init(void) |
94 | { |
95 | RIN_FIDUCIAL = 1.5; |
96 | ROUT_FIDUCIAL=48.0; |
97 | MAX_ALLOWED_FDC_HITS=20000; |
98 | STRIP_ANODE_TIME_CUT=25.; |
99 | MIDDLE_STRIP_THRESHOLD=0.; |
100 | CHARGE_THRESHOLD=0.3; |
101 | DELTA_X_CUT=0.5; |
102 | |
103 | r2_out=ROUT_FIDUCIAL*ROUT_FIDUCIAL; |
104 | r2_in=RIN_FIDUCIAL*RIN_FIDUCIAL; |
105 | |
106 | gPARMS->SetDefaultParameter("FDC:ROUT_FIDUCIAL",ROUT_FIDUCIAL, "Outer fiducial radius of FDC in cm"); |
107 | gPARMS->SetDefaultParameter("FDC:RIN_FIDUCIAL",RIN_FIDUCIAL, "Inner fiducial radius of FDC in cm"); |
108 | gPARMS->SetDefaultParameter("FDC:MAX_ALLOWED_FDC_HITS",MAX_ALLOWED_FDC_HITS, "Max. number of FDC hits (includes both cathode strips and wires hits) to allow before considering event too busy to attempt FDC tracking"); |
109 | gPARMS->SetDefaultParameter("FDC:STRIP_ANODE_TIME_CUT",STRIP_ANODE_TIME_CUT, "maximum time difference between strips and wires (in ns)"); |
110 | gPARMS->SetDefaultParameter("FDC:CHARGE_THRESHOLD",CHARGE_THRESHOLD,"Minimum average charge on both cathode planes (in pC)"); |
111 | gPARMS->SetDefaultParameter("FDC:DELTA_X_CUT",DELTA_X_CUT,"Maximum distance between reconstructed wire position and wire position"); |
112 | |
113 | DEBUG_HISTS = false; |
114 | gPARMS->SetDefaultParameter("FDC:DEBUG_HISTS",DEBUG_HISTS); |
115 | |
116 | |
117 | return NOERROR; |
118 | } |
119 | |
120 | |
121 | |
122 | |
123 | |
124 | jerror_t DFDCPseudo_factory::brun(JEventLoop *loop, int32_t runnumber) |
125 | { |
126 | |
127 | DApplication* dapp=dynamic_cast<DApplication*>(eventLoop->GetJApplication()); |
128 | const DGeometry *dgeom = dapp->GetDGeometry(runnumber); |
129 | |
130 | USE_FDC=true; |
131 | if (!dgeom->GetFDCWires(fdcwires)){ |
132 | _DBG_<< "FDC geometry not available!" <<endl; |
133 | USE_FDC=false; |
134 | } |
135 | if (!dgeom->GetFDCCathodes(fdccathodes)){ |
136 | _DBG_<< "FDC geometry not available!" <<endl; |
137 | USE_FDC=false; |
138 | } |
139 | if (USE_FDC){ |
140 | |
141 | vector<double>offsets; |
142 | dgeom->Get("//posXYZ[@volume='forwardDC_package_1']/@X_Y_Z",offsets); |
143 | dX[0]=offsets[0]; |
144 | dY[0]=offsets[1]; |
145 | dgeom->Get("//posXYZ[@volume='forwardDC_package_2']/@X_Y_Z",offsets); |
146 | dX[1]=offsets[0]; |
147 | dY[1]=offsets[1]; |
148 | dgeom->Get("//posXYZ[@volume='forwardDC_package_3']/@X_Y_Z",offsets); |
149 | dX[2]=offsets[0]; |
150 | dY[2]=offsets[1]; |
151 | dgeom->Get("//posXYZ[@volume='forwardDC_package_4']/@X_Y_Z",offsets); |
152 | dX[3]=offsets[0]; |
153 | dY[3]=offsets[1]; |
154 | } |
155 | |
156 | |
157 | JCalibration * jcalib = dapp->GetJCalibration(runnumber); |
158 | vector<map<string,double> >vals; |
159 | if (jcalib->Get("FDC/cell_offsets",vals)==false){ |
160 | for(unsigned int i=0; i<vals.size(); i++){ |
161 | map<string,double> &row = vals[i]; |
162 | |
163 | |
164 | xshifts.push_back(row["xshift"]); |
165 | yshifts.push_back(row["yshift"]); |
166 | } |
167 | } |
168 | |
169 | map<string, double> fdcparms; |
170 | FDC_RES_PAR1=0.; |
171 | FDC_RES_PAR2=0.; |
172 | jcalib->Get("FDC/fdc_resolution_parms",fdcparms); |
173 | FDC_RES_PAR1=fdcparms["res_par1"]; |
174 | FDC_RES_PAR2=fdcparms["res_par2"]; |
175 | |
176 | if(DEBUG_HISTS){ |
177 | dapp->Lock(); |
178 | |
179 | |
180 | |
181 | v_vs_u=(TH2F*)gROOT->FindObject("v_vs_u"); |
182 | if (!v_vs_u) v_vs_u=new TH2F("v_vs_u","v vs u",192,0.5,192.5,192,0.5,192.5); |
183 | |
184 | qv_vs_qu= (TH2F*) gROOT->FindObject("qv_vs_qu"); |
185 | if (!qv_vs_qu) qv_vs_qu=new TH2F("qv_vs_qu","Anode charge from each cathode",100,0,20000,100,0,20000); |
186 | |
187 | tv_vs_tu= (TH2F*) gROOT->FindObject("tv_vs_tu"); |
188 | if (!tv_vs_tu) tv_vs_tu=new TH2F("tv_vs_tu","t(v) vs t(u)",100,-100,250,100,-100,250); |
189 | |
190 | dtv_vs_dtu= (TH2F*) gROOT->FindObject("dtv_vs_dtu"); |
191 | if (!dtv_vs_dtu) dtv_vs_dtu=new TH2F("dtv_vs_dtu","t(wire)-t(v) vs t(wire)-t(u)",200,-100,100,200,-100,100); |
192 | |
193 | u_wire_dt_vs_wire=(TH2F *) gROOT->FindObject("u_wire_dt_vs_wire"); |
194 | if (!u_wire_dt_vs_wire) u_wire_dt_vs_wire=new TH2F("u_wire_dt_vs_wire","wire/u cathode time difference vs wire number", |
195 | 96,0.5,96.5,100,-500,500); |
196 | v_wire_dt_vs_wire=(TH2F *) gROOT->FindObject("v_wire_dt_vs_wire"); |
197 | if (!v_wire_dt_vs_wire) v_wire_dt_vs_wire=new TH2F("v_wire_dt_vs_wire","wire/v cathode time difference vs wire number", |
198 | 96,0.5,96.5,100,-500,500); |
199 | uv_dt_vs_u=(TH2F *) gROOT->FindObject("uv_dt_vs_u"); |
200 | if (!uv_dt_vs_u) uv_dt_vs_u=new TH2F("uv_dt_vs_u","uv time difference vs u", |
201 | 192,0.5,192.5,100,-50,50); |
202 | uv_dt_vs_v=(TH2F *) gROOT->FindObject("uv_dt_vs_v"); |
203 | if (!uv_dt_vs_v) uv_dt_vs_v=new TH2F("uv_dt_vs_v","uv time difference vs v", |
204 | 192,0.5,192.5,100,-50,50); |
205 | |
206 | ut_vs_u=(TH2F *) gROOT->FindObject("ut_vs_u"); |
207 | if (!ut_vs_u) ut_vs_u=new TH2F("ut_vs_u","u time vs u", |
208 | 192,0.5,192.5,100,0,1000); |
209 | vt_vs_v=(TH2F *) gROOT->FindObject("vt_vs_v"); |
210 | if (!vt_vs_v) vt_vs_v=new TH2F("vt_vs_v","v time vs v", |
211 | 192,0.5,192.5,100,0,1000); |
212 | |
213 | dx_vs_dE=(TH2F*)gROOT->FindObject("dx_vs_dE"); |
214 | if (!dx_vs_dE) dx_vs_dE=new TH2F("dx_vs_dE","dx vs dE",100,0,25.0, |
215 | 100,-0.2,0.2); |
216 | |
217 | u_cl_size=(TH1F*)gROOT->FindObject("u_cl_size"); |
218 | if (!u_cl_size) u_cl_size=new TH1F("u_cl_size","u_cl_size",20,.5,20.5); |
219 | v_cl_size=(TH1F*)gROOT->FindObject("v_cl_size"); |
220 | if (!v_cl_size) v_cl_size=new TH1F("v_cl_size","v_cl_size",20,.5,20.5); |
221 | |
222 | u_cl_n=(TH1F*)gROOT->FindObject("u_cl_n"); |
223 | if (!u_cl_n) u_cl_n=new TH1F("u_cl_n","u_cl_n",20,.5,20.5); |
224 | v_cl_n=(TH1F*)gROOT->FindObject("v_cl_n"); |
225 | if (!v_cl_n) v_cl_n=new TH1F("v_cl_n","v_cl_n",20,.5,20.5); |
226 | |
227 | x_dist_2=(TH1F*)gROOT->FindObject("x_dist_2"); |
228 | if (!x_dist_2) x_dist_2=new TH1F("x_dist_2","x_dist_2",400,-2,2); |
229 | |
230 | x_dist_3=(TH1F*)gROOT->FindObject("x_dist_3"); |
231 | if (!x_dist_3) x_dist_3=new TH1F("x_dist_3","x_dist_3",400,-2,2); |
232 | |
233 | x_dist_23=(TH1F*)gROOT->FindObject("x_dist_23"); |
234 | if (!x_dist_23) x_dist_23=new TH1F("x_dist_23","x_dist_23",400,-2,2); |
235 | |
236 | x_dist_33=(TH1F*)gROOT->FindObject("x_dist_33"); |
237 | if (!x_dist_33) x_dist_33=new TH1F("x_dist_33","x_dist_33",400,-2,2); |
238 | |
239 | d_uv=(TH1F*)gROOT->FindObject("d_uv"); |
240 | if (!d_uv) d_uv=new TH1F("d_uv","d_uv",100,0,50); |
241 | |
242 | |
243 | for (unsigned int i=0;i<24;i++){ |
244 | char hname[80]; |
245 | sprintf(hname,"Hxy%d",i); |
246 | Hxy[i]=(TH2F *) gROOT->FindObject(hname); |
247 | if (!Hxy[i]){ |
248 | Hxy[i]=new TH2F(hname,hname,4000,-50,50,200,-50,50); |
249 | } |
250 | } |
251 | |
252 | dapp->Unlock(); |
253 | } |
254 | |
255 | return NOERROR; |
256 | } |
257 | |
258 | jerror_t DFDCPseudo_factory::erun(void){ |
259 | if (fdcwires.size()){ |
260 | for (unsigned int i=0;i<fdcwires.size();i++){ |
261 | for (unsigned int j=0;j<fdcwires[i].size();j++){ |
262 | delete fdcwires[i][j]; |
263 | } |
264 | } |
265 | } |
266 | fdcwires.clear(); |
267 | if (fdccathodes.size()){ |
268 | for (unsigned int i=0;i<fdccathodes.size();i++){ |
269 | for (unsigned int j=0;j<fdccathodes[i].size();j++){ |
270 | delete fdccathodes[i][j]; |
271 | } |
272 | } |
273 | } |
274 | fdccathodes.clear(); |
275 | |
276 | |
277 | return NOERROR; |
278 | } |
279 | |
280 | |
281 | |
282 | |
283 | jerror_t DFDCPseudo_factory::evnt(JEventLoop* eventLoop, uint64_t eventNo) { |
284 | if (!USE_FDC) return NOERROR; |
| 1 | Assuming field 'USE_FDC' is true | |
|
| |
285 | |
286 | |
287 | vector<const DFDCHit*> fdcHits; |
288 | eventLoop->Get(fdcHits); |
| 3 | | Calling 'JEventLoop::Get' | |
|
289 | if (fdcHits.size()==0) return NOERROR; |
290 | |
291 | |
292 | |
293 | |
294 | if(fdcHits.size()>MAX_ALLOWED_FDC_HITS){ |
295 | _DBG_<<"Too many hits in FDC ("<<fdcHits.size()<<", max="<<MAX_ALLOWED_FDC_HITS<<")! Pseudopoint reconstruction in FDC bypassed for event "<<eventLoop->GetJEvent().GetEventNumber()<<endl; |
296 | return NOERROR; |
297 | } |
298 | |
299 | |
300 | vector<const DFDCCathodeCluster*> cathClus; |
301 | eventLoop->Get(cathClus); |
302 | if (cathClus.size()==0) return NOERROR; |
303 | |
304 | |
305 | vector<const DFDCHit*> xHits; |
306 | for (unsigned int i=0; i < fdcHits.size(); i++) |
307 | if (fdcHits[i]->type == 0) |
308 | xHits.push_back(fdcHits[i]); |
309 | |
310 | std::sort(xHits.begin(), xHits.end(), DFDCAnode_gLayer_cmp); |
311 | |
312 | |
313 | vector<const DFDCCathodeCluster*> uClus; |
314 | vector<const DFDCCathodeCluster*> vClus; |
315 | for (unsigned int i=0; i < cathClus.size(); i++) { |
316 | if (cathClus[i]->plane == 1) |
317 | vClus.push_back(cathClus[i]); |
318 | else |
319 | uClus.push_back(cathClus[i]); |
320 | } |
321 | |
322 | |
323 | |
324 | |
325 | |
326 | |
327 | vector<const DMCTrackHit*> mctrackhits; |
328 | eventLoop->Get(mctrackhits); |
329 | |
330 | vector<const DFDCCathodeCluster*>::iterator uIt = uClus.begin(); |
331 | vector<const DFDCCathodeCluster*>::iterator vIt = vClus.begin(); |
332 | vector<const DFDCHit*>::iterator xIt = xHits.begin(); |
333 | |
334 | |
335 | |
336 | vector<const DFDCCathodeCluster*> oneLayerU; |
337 | vector<const DFDCCathodeCluster*> oneLayerV; |
338 | vector<const DFDCHit*> oneLayerX; |
339 | for (int iLayer=1; iLayer <= 24; iLayer++) { |
340 | for (; ((uIt != uClus.end() && (*uIt)->gLayer == iLayer)); uIt++) |
341 | oneLayerU.push_back(*uIt); |
342 | for (; ((vIt != vClus.end() && (*vIt)->gLayer == iLayer)); vIt++) |
343 | oneLayerV.push_back(*vIt); |
344 | for (; ((xIt != xHits.end() && (*xIt)->gLayer == iLayer)); xIt++) |
345 | oneLayerX.push_back(*xIt); |
346 | if (oneLayerU.size()>0 && oneLayerV.size()>0 && oneLayerX.size()>0) |
347 | makePseudo(oneLayerX, oneLayerU, oneLayerV,iLayer, mctrackhits); |
348 | oneLayerU.clear(); |
349 | oneLayerV.clear(); |
350 | oneLayerX.clear(); |
351 | } |
352 | |
353 | std::sort(_data.begin(),_data.end(),DFDCPseudo_cmp); |
354 | |
355 | return NOERROR; |
356 | } |
357 | |
358 | |
359 | |
360 | |
361 | |
362 | void DFDCPseudo_factory::makePseudo(vector<const DFDCHit*>& x, |
363 | vector<const DFDCCathodeCluster*>& u, |
364 | vector<const DFDCCathodeCluster*>& v, |
365 | int layer, |
366 | vector<const DMCTrackHit*> &mctrackhits) |
367 | { |
368 | vector<const DFDCHit*>::iterator xIt; |
369 | vector<centroid_t>upeaks; |
370 | vector<centroid_t>vpeaks; |
371 | |
372 | sort(x.begin(), x.end(), fdcxhit_cmp); |
373 | |
374 | |
375 | |
376 | for (unsigned int i=0;i<u.size();i++){ |
377 | |
378 | if (DEBUG_HISTS) u_cl_size->Fill(u[i]->members.size()); |
379 | if (u[i]->members.size()>2){ |
380 | for (vector<const DFDCHit*>::const_iterator strip=u[i]->members.begin()+1;strip+1!=u[i]->members.end();strip++){ |
381 | |
382 | if (FindCentroid(u[i]->members,strip,upeaks)==NOERROR){ |
383 | |
384 | unsigned int index=2*((*strip)->gLayer-1)+(1-(*strip)->plane/2); |
385 | DMatrix3x1 XTemp,NTemp,NTempRaw,indexTemp; |
386 | XTemp(0) = fdccathodes[index][(*(strip-1))->element-1]->u; |
387 | XTemp(1) = fdccathodes[index][(*(strip))->element-1]->u; |
388 | XTemp(2) = fdccathodes[index][(*(strip+1))->element-1]->u; |
389 | NTemp(0) = double ((*(strip-1))->pulse_height); |
390 | NTemp(1) = double ((*(strip))->pulse_height); |
391 | NTemp(2) = double ((*(strip+1))->pulse_height); |
392 | NTempRaw(0) = double ((*(strip-1))->pulse_height_raw); |
393 | NTempRaw(1) = double ((*(strip))->pulse_height_raw); |
394 | NTempRaw(2) = double ((*(strip+1))->pulse_height_raw); |
395 | indexTemp(0) = (*(strip-1))->element; |
396 | indexTemp(1) = (*(strip))->element; |
397 | indexTemp(2) = (*(strip+1))->element; |
398 | upeaks[upeaks.size()-1].cluster=i; |
399 | upeaks[upeaks.size()-1].X = XTemp; |
400 | upeaks[upeaks.size()-1].N = NTemp; |
401 | upeaks[upeaks.size()-1].NRaw = NTempRaw; |
402 | upeaks[upeaks.size()-1].index = indexTemp; |
403 | } |
404 | else if (u[i]->members.size()==3){ |
405 | if (ThreeStripCluster(u[i]->members,strip,upeaks)==NOERROR){ |
406 | upeaks[upeaks.size()-1].cluster=i; |
407 | } |
408 | } |
409 | } |
410 | } |
411 | else if (u[i]->members.size()==2){ |
412 | for (vector<const DFDCHit*>::const_iterator strip=u[i]->members.begin();strip+1!=u[i]->members.end();strip++){ |
413 | if (TwoStripCluster(u[i]->members,strip,upeaks)==NOERROR){ |
414 | upeaks[upeaks.size()-1].cluster=i; |
415 | } |
416 | } |
417 | } |
418 | } |
419 | |
420 | for (unsigned int i=0;i<v.size();i++){ |
421 | |
422 | if (DEBUG_HISTS) v_cl_size->Fill(v[i]->members.size()); |
423 | if (v[i]->members.size()>2){ |
424 | for (vector<const DFDCHit*>::const_iterator strip=v[i]->members.begin()+1;strip+1!=v[i]->members.end();strip++){ |
425 | |
426 | if (FindCentroid(v[i]->members,strip,vpeaks)==NOERROR){ |
427 | |
428 | unsigned int index=2*((*strip)->gLayer-1)+(1-(*strip)->plane/2); |
429 | DMatrix3x1 XTemp,NTemp,NTempRaw,indexTemp; |
430 | XTemp(0) = fdccathodes[index][(*(strip-1))->element-1]->u; |
431 | XTemp(1) = fdccathodes[index][(*(strip))->element-1]->u; |
432 | XTemp(2) = fdccathodes[index][(*(strip+1))->element-1]->u; |
433 | NTemp(0) = double ((*(strip-1))->pulse_height); |
434 | NTemp(1) = double ((*(strip))->pulse_height); |
435 | NTemp(2) = double ((*(strip+1))->pulse_height); |
436 | NTempRaw(0) = double ((*(strip-1))->pulse_height_raw); |
437 | NTempRaw(1) = double ((*(strip))->pulse_height_raw); |
438 | NTempRaw(2) = double ((*(strip+1))->pulse_height_raw); |
439 | indexTemp(0) = (*(strip-1))->element; |
440 | indexTemp(1) = (*(strip))->element; |
441 | indexTemp(2) = (*(strip+1))->element; |
442 | vpeaks[vpeaks.size()-1].cluster=i; |
443 | vpeaks[vpeaks.size()-1].X = XTemp; |
444 | vpeaks[vpeaks.size()-1].N = NTemp; |
445 | vpeaks[vpeaks.size()-1].NRaw = NTempRaw; |
446 | vpeaks[vpeaks.size()-1].index = indexTemp; |
447 | } |
448 | else if (v[i]->members.size()==3){ |
449 | if (ThreeStripCluster(v[i]->members,strip,vpeaks)==NOERROR){ |
450 | vpeaks[vpeaks.size()-1].cluster=i; |
451 | } |
452 | } |
453 | } |
454 | } |
455 | else if (v[i]->members.size()==2){ |
456 | for (vector<const DFDCHit*>::const_iterator strip=v[i]->members.begin();strip+1!=v[i]->members.end();strip++){ |
457 | if (TwoStripCluster(v[i]->members,strip,vpeaks)==NOERROR){ |
458 | vpeaks[vpeaks.size()-1].cluster=i; |
459 | } |
460 | } |
461 | } |
462 | } |
463 | if (upeaks.size()*vpeaks.size()>0){ |
464 | |
465 | unsigned int ilay=layer-1; |
466 | unsigned int ind=2*ilay; |
467 | float phi_u=fdccathodes[ind][0]->angle; |
468 | float phi_v=fdccathodes[ind+1][0]->angle; |
469 | |
470 | |
471 | for (unsigned int i=0;i<upeaks.size();i++){ |
472 | for (unsigned int j=0;j<vpeaks.size();j++){ |
473 | |
474 | |
475 | double x_from_strips=DFDCGeometry::getXLocalStrips(upeaks[i].pos,phi_u, |
476 | vpeaks[j].pos,phi_v); |
477 | double y_from_strips=DFDCGeometry::getYLocalStrips(upeaks[i].pos,phi_u, |
478 | vpeaks[j].pos,phi_v); |
479 | int old_wire_num=-1; |
480 | for(xIt=x.begin();xIt!=x.end();xIt++){ |
481 | if ((*xIt)->element<=WIRES_PER_PLANE && (*xIt)->element>0){ |
482 | const DFDCWire *wire=fdcwires[layer-1][(*xIt)->element-1]; |
483 | double x_from_wire=wire->u; |
484 | |
485 | |
486 | |
487 | |
488 | |
489 | double r2test=x_from_wire*x_from_wire+y_from_strips*y_from_strips; |
490 | double delta_x=x_from_wire-x_from_strips; |
491 | |
492 | if (DEBUG_HISTS){ |
493 | if (upeaks[i].numstrips == 3 && vpeaks[j].numstrips == 3) x_dist_3->Fill(delta_x); |
494 | if (upeaks[i].numstrips == 2 && vpeaks[j].numstrips == 2) x_dist_2->Fill(delta_x); |
495 | if (upeaks[i].numstrips == 2 && vpeaks[j].numstrips == 3) x_dist_23->Fill(delta_x); |
496 | else if (upeaks[i].numstrips == 3 && vpeaks[j].numstrips == 2) x_dist_23->Fill(delta_x); |
497 | |
498 | if (upeaks[i].numstrips == 3 && vpeaks[j].numstrips == 10) x_dist_33->Fill(delta_x); |
499 | else if (upeaks[i].numstrips == 10 && vpeaks[j].numstrips == 3) x_dist_33->Fill(delta_x); |
500 | } |
501 | |
502 | |
503 | if (old_wire_num==(*xIt)->element) continue; |
504 | |
505 | if (fabs(delta_x)<DELTA_X_CUT && r2test<r2_out |
506 | && r2test>r2_in){ |
507 | double dt1 = (*xIt)->t - upeaks[i].t; |
508 | double dt2 = (*xIt)->t - vpeaks[j].t; |
509 | |
510 | |
511 | |
512 | if (DEBUG_HISTS){ |
513 | |
514 | dtv_vs_dtu->Fill(dt1,dt2); |
515 | tv_vs_tu->Fill(upeaks[i].t, vpeaks[j].t); |
516 | u_wire_dt_vs_wire->Fill((*xIt)->element,(*xIt)->t-upeaks[i].t); |
517 | v_wire_dt_vs_wire->Fill((*xIt)->element,(*xIt)->t-vpeaks[j].t); |
518 | |
519 | |
520 | |
521 | int uid=u[upeaks[i].cluster]->members[1]->element; |
522 | int vid=v[vpeaks[j].cluster]->members[1]->element; |
523 | |
524 | const DFDCCathodeDigiHit *vdigihit; |
525 | v[vpeaks[j].cluster]->members[1]->GetSingle(vdigihit); |
526 | const DFDCCathodeDigiHit *udigihit; |
527 | u[upeaks[i].cluster]->members[1]->GetSingle(udigihit); |
528 | if (vdigihit!=NULL && udigihit!=NULL){ |
529 | int dt=int(udigihit->pulse_time)-int(vdigihit->pulse_time); |
530 | |
531 | uv_dt_vs_u->Fill(uid,dt); |
532 | uv_dt_vs_v->Fill(vid,dt); |
533 | v_vs_u->Fill(uid,vid); |
534 | ut_vs_u->Fill(uid,udigihit->pulse_time); |
535 | vt_vs_v->Fill(vid,udigihit->pulse_time); |
536 | } |
537 | |
538 | |
539 | } |
540 | |
541 | if (DEBUG_HISTS){ |
542 | d_uv->Fill(sqrt(dt1*dt1+dt2*dt2)); |
543 | } |
544 | |
545 | if (sqrt(dt1*dt1+dt2*dt2)>STRIP_ANODE_TIME_CUT) continue; |
546 | |
547 | |
548 | |
549 | |
550 | if (DEBUG_HISTS){ |
551 | |
552 | u_cl_n->Fill(upeaks[i].numstrips); |
553 | v_cl_n->Fill(vpeaks[j].numstrips); |
554 | } |
555 | |
556 | |
557 | double q_cathodes=0.5*(upeaks[i].q+vpeaks[j].q); |
558 | double charge_to_energy=W_EFF/(GAS_GAIN*ELECTRON_CHARGE); |
559 | double dE=charge_to_energy*q_cathodes; |
560 | double q_from_pulse_height=5.0e-4*(upeaks[i].q_from_pulse_height |
561 | +vpeaks[j].q_from_pulse_height); |
562 | if (q_from_pulse_height<CHARGE_THRESHOLD) continue; |
563 | double dE_amp=charge_to_energy*q_from_pulse_height; |
564 | |
565 | if (DEBUG_HISTS){ |
566 | qv_vs_qu->Fill(upeaks[i].q,vpeaks[j].q); |
567 | } |
568 | |
569 | |
570 | old_wire_num=(*xIt)->element; |
571 | |
572 | int status=upeaks[i].numstrips+vpeaks[j].numstrips; |
573 | |
574 | |
575 | DFDCPseudo* newPseu = new DFDCPseudo; |
576 | newPseu->phi_u=phi_u; |
577 | newPseu->phi_v=phi_v; |
578 | newPseu->u = upeaks[i].pos; |
579 | newPseu->v = vpeaks[j].pos; |
580 | newPseu->t_u = upeaks[i].t; |
581 | newPseu->t_v = vpeaks[j].t; |
582 | newPseu->cluster_u = upeaks[i]; |
583 | newPseu->cluster_v = vpeaks[j]; |
584 | newPseu->w = x_from_wire+xshifts[ilay]; |
585 | newPseu->dw = 0.; |
586 | newPseu->w_c = x_from_strips+xshifts[ilay]; |
587 | newPseu->s = y_from_strips+yshifts[ilay]; |
588 | newPseu->ds = FDC_RES_PAR1/q_from_pulse_height+FDC_RES_PAR2; |
589 | |
590 | newPseu->wire = wire; |
591 | newPseu->time = (*xIt)->t; |
592 | |
593 | newPseu->status = status; |
594 | newPseu->itrack = (*xIt)->itrack; |
595 | |
596 | newPseu->AddAssociatedObject(v[vpeaks[j].cluster]); |
597 | newPseu->AddAssociatedObject(u[upeaks[i].cluster]); |
598 | |
599 | newPseu->dE = dE; |
600 | newPseu->dE_amp = dE_amp; |
601 | newPseu->q = q_from_pulse_height; |
602 | |
603 | |
604 | |
605 | |
606 | |
607 | if(newPseu->wire==NULL){ |
608 | _DBG_<<"newPseu->wire=NULL! This shouldn't happen. Complain to staylor@jlab.org"<<endl; |
609 | delete newPseu; |
610 | continue; |
611 | } |
612 | double sinangle=newPseu->wire->udir(0); |
613 | double cosangle=newPseu->wire->udir(1); |
614 | unsigned int pack_id=(layer-1)/6; |
615 | newPseu->s+=dY[pack_id]*cosangle+dX[pack_id]*sinangle; |
616 | |
617 | newPseu->xy.Set((newPseu->w)*cosangle+(newPseu->s)*sinangle, |
618 | -(newPseu->w)*sinangle+(newPseu->s)*cosangle); |
619 | |
620 | double sigx2=HALF_CELL*HALF_CELL/3.; |
621 | double sigy2=MAX_DEFLECTION*MAX_DEFLECTION/3.; |
622 | newPseu->covxx=sigx2*cosangle*cosangle+sigy2*sinangle*sinangle; |
623 | newPseu->covyy=sigx2*sinangle*sinangle+sigy2*cosangle*cosangle; |
624 | newPseu->covxy=(sigy2-sigx2)*sinangle*cosangle; |
625 | |
626 | |
627 | const DMCTrackHit *mctrackhit = DTrackHitSelectorTHROWN::GetMCTrackHit(newPseu->wire, DRIFT_SPEED*newPseu->time, mctrackhits); |
628 | if(mctrackhit)newPseu->AddAssociatedObject(mctrackhit); |
629 | |
630 | _data.push_back(newPseu); |
631 | |
632 | if (DEBUG_HISTS){ |
633 | Hxy[ilay]->Fill(newPseu->w_c,newPseu->s); |
634 | if (ilay==6) dx_vs_dE->Fill(q_from_pulse_height,0.2588*delta_x); |
635 | } |
636 | |
637 | } |
638 | } else _DBG_ << "Bad wire " << (*xIt)->element <<endl; |
639 | } |
640 | } |
641 | } |
642 | } |
643 | |
644 | } |
645 | |
646 | |
647 | |
648 | |
649 | |
650 | |
651 | |
652 | void DFDCPseudo_factory::CalcMeanTime(const vector<const DFDCHit*>& H, double &t, double &t_rms) |
653 | { |
654 | |
655 | t=0.0; |
656 | for(unsigned int i=0; i<H.size(); i++)t+=H[i]->t; |
657 | if(H.size()>0)t/=(double)H.size(); |
658 | |
659 | |
660 | t_rms=0.0; |
661 | for(unsigned int i=0; i<H.size(); i++)t_rms+=pow((double)(H[i]->t-t),2.0); |
662 | if(H.size()>0)t_rms = sqrt(t_rms/(double)H.size()); |
663 | } |
664 | |
665 | |
666 | |
667 | void DFDCPseudo_factory::CalcMeanTime(vector<const DFDCHit *>::const_iterator peak, double &t, double &t_rms) |
668 | { |
669 | |
670 | t=0.0; |
671 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
672 | t+=(*j)->t; |
673 | } |
674 | t/=3.; |
675 | |
676 | |
677 | t_rms=0.0; |
678 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
679 | t_rms+=((*j)->t-t)*((*j)->t-t); |
680 | } |
681 | t_rms=sqrt(t_rms/3.); |
682 | } |
683 | |
684 | |
685 | |
686 | |
687 | |
688 | |
689 | |
690 | |
691 | |
692 | |
693 | jerror_t DFDCPseudo_factory::FindCentroid(const vector<const DFDCHit*>& H, |
694 | vector<const DFDCHit *>::const_iterator peak, |
695 | vector<centroid_t>¢roids){ |
696 | centroid_t temp; |
697 | double err_diff1=0.,err_diff2=0.; |
698 | |
699 | |
700 | |
701 | |
702 | |
703 | |
704 | |
705 | |
706 | |
707 | |
708 | |
709 | if ((*peak)->pulse_height<MIDDLE_STRIP_THRESHOLD) { |
710 | return VALUE_OUT_OF_RANGE; |
711 | } |
712 | |
713 | |
714 | if ((*peak)->pulse_height-(*(peak-1))->pulse_height > err_diff1 |
715 | && (*peak)->pulse_height-(*(peak+1))->pulse_height > err_diff2){ |
716 | |
717 | DMatrix3x3 J; |
718 | DMatrix3x1 F,N,X,par,newpar,f; |
719 | int i=0; |
720 | double sum=0.; |
721 | |
722 | |
723 | unsigned int index=2*((*peak)->gLayer-1)+(1-(*peak)->plane/2); |
724 | par(K2)=1.; |
725 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
726 | X(i)=fdccathodes[index][(*j)->element-1]->u; |
727 | N(i)=double((*j)->pulse_height); |
728 | sum+=N(i); |
729 | i++; |
730 | } |
731 | par(X0)=X(1); |
732 | par(QA)=2.*sum; |
733 | newpar=par; |
734 | |
735 | |
736 | double errf=0.,errx=0; |
737 | for (int iter=1;iter<=ITER_MAX;iter++){ |
738 | errf=0.; |
739 | errx=0.; |
740 | |
741 | |
742 | for (i=0;i<3;i++){ |
743 | double dx=(par(X0)-X(i))*ONE_OVER_H; |
744 | double argp=par(K2)*(dx+A_OVER_H); |
745 | double argm=par(K2)*(dx-A_OVER_H); |
746 | double tanh_p=tanh(argp); |
747 | double tanh_m=tanh(argm); |
748 | double tanh2_p=tanh_p*tanh_p; |
749 | double tanh2_m=tanh_m*tanh_m; |
750 | double q_over_4=0.25*par(QA); |
751 | |
752 | f(i)=tanh_p-tanh_m; |
753 | J(i,QA)=-0.25*f(i); |
754 | J(i,K2)=-q_over_4*(argp/par(K2)*(1.-tanh2_p) |
755 | -argm/par(K2)*(1.-tanh2_m)); |
756 | J(i,X0)=-q_over_4*par(K2)*(tanh2_m-tanh2_p); |
757 | F(i)=N(i)-q_over_4*f(i); |
758 | double new_errf=fabs(F(i)); |
759 | if (new_errf>errf) errf=new_errf; |
760 | } |
761 | |
762 | if (errf<TOLF){ |
763 | temp.pos=par(X0); |
764 | temp.q_from_pulse_height=par(QA); |
765 | temp.numstrips=3; |
766 | temp.t=(*peak)->t; |
767 | temp.t_rms=0.; |
768 | |
769 | |
770 | sum=0; |
771 | double sum_f=f(0)+f(1)+f(2); |
772 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
773 | sum+=double((*j)->q); |
774 | } |
775 | temp.q=4.*sum/sum_f; |
776 | |
777 | |
778 | centroids.push_back(temp); |
779 | |
780 | return NOERROR; |
781 | } |
782 | |
783 | |
784 | FindNewParmVec(N,X,F,J,par,newpar); |
785 | |
786 | |
787 | for (i=0;i<3;i++){ |
788 | double new_err=fabs(par(i)-newpar(i)); |
789 | if (new_err>errx) errx=new_err; |
790 | } |
791 | if (errx<TOLX){ |
792 | temp.pos=par(X0); |
793 | temp.numstrips=3; |
794 | temp.q_from_pulse_height=par(QA); |
795 | temp.t=(*peak)->t; |
796 | temp.t_rms=0.; |
797 | |
798 | |
799 | sum=0; |
800 | double sum_f=f(0)+f(1)+f(2); |
801 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
802 | sum+=double((*j)->q); |
803 | } |
804 | temp.q=4.*sum/sum_f; |
805 | |
806 | |
807 | centroids.push_back(temp); |
808 | |
809 | return NOERROR; |
810 | } |
811 | par=newpar; |
812 | } |
813 | } |
814 | return INFINITE_RECURSION; |
815 | } |
816 | |
817 | |
818 | |
819 | |
820 | |
821 | |
822 | |
823 | |
824 | |
825 | |
826 | |
827 | jerror_t DFDCPseudo_factory::FindNewParmVec(const DMatrix3x1 &N, |
828 | const DMatrix3x1 &X, |
829 | const DMatrix3x1 &F, |
830 | const DMatrix3x3 &J, |
831 | const DMatrix3x1 &par, |
832 | DMatrix3x1 &newpar){ |
833 | |
834 | DMatrix3x3 InvJ=J.Invert(); |
835 | |
836 | |
837 | DMatrix3x1 fullstep=(-1.)*(InvJ*F); |
838 | |
839 | |
840 | double slope=(-1.0)*F.Mag2(); |
841 | |
842 | |
843 | if (slope>=0){ |
844 | return VALUE_OUT_OF_RANGE; |
845 | } |
846 | |
847 | double lambda=1.0; |
848 | double lambda_temp,lambda2=lambda; |
849 | DMatrix3x1 newF; |
850 | double f2=0.,newf; |
851 | |
852 | |
853 | double f=-0.5*slope; |
854 | |
855 | for (;;){ |
856 | newpar=par+lambda*fullstep; |
857 | |
858 | |
859 | for (int i=0;i<3;i++){ |
860 | double dx=(newpar(X0)-X(i))*ONE_OVER_H; |
861 | double argp=newpar(K2)*(dx+A_OVER_H); |
862 | double argm=newpar(K2)*(dx-A_OVER_H); |
863 | newF(i)=N(i)-0.25*newpar(QA)*(tanh(argp)-tanh(argm)); |
864 | } |
865 | newf=0.5*newF.Mag2(); |
866 | |
867 | if (lambda<0.1) { |
868 | newpar=par; |
869 | return NOERROR; |
870 | } |
871 | else if (newf<=f+ALPHA*lambda*slope){ |
872 | return NOERROR; |
873 | } |
874 | else{ |
875 | |
876 | if (lambda==1.0){ |
877 | lambda_temp=-0.5*slope/(newf-f-slope); |
878 | } |
879 | else{ |
880 | double temp1=newf-f-lambda*slope; |
881 | double temp2=f2-f-lambda2*slope; |
882 | double one_over_lambda2_sq=1./(lambda2*lambda2); |
883 | double one_over_lambda_sq=1./(lambda*lambda); |
884 | double one_over_lambda_diff=1./(lambda-lambda2); |
885 | double a=(temp1*one_over_lambda_sq-temp2*one_over_lambda2_sq)*one_over_lambda_diff; |
886 | double b=(-lambda2*temp1*one_over_lambda_sq+lambda*temp2*one_over_lambda2_sq) |
887 | *one_over_lambda_diff; |
888 | if (a==0.0) lambda_temp=-0.5*slope/b; |
889 | else{ |
890 | double disc=b*b-3.0*a*slope; |
891 | if (disc<0.0) lambda_temp=0.5*lambda; |
892 | else if (b<=0.0) lambda_temp=(-b+sqrt(disc))/(3.*a); |
893 | else lambda_temp=-slope/(b+sqrt(disc)); |
894 | } |
895 | |
896 | if (lambda_temp>0.5*lambda) lambda_temp=0.5*lambda; |
897 | } |
898 | } |
899 | lambda2=lambda; |
900 | f2=newf; |
901 | |
902 | lambda=(lambda_temp>0.1*lambda ? lambda_temp : 0.1*lambda); |
903 | } |
904 | } |
905 | |
906 | |
907 | |
908 | |
909 | |
910 | |
911 | |
912 | |
913 | |
914 | jerror_t DFDCPseudo_factory::TwoStripCluster(const vector<const DFDCHit*>& H, |
915 | vector<const DFDCHit *>::const_iterator peak, |
916 | vector<centroid_t>¢roids){ |
917 | centroid_t temp; |
918 | |
919 | if ((*peak)->pulse_height<MIDDLE_STRIP_THRESHOLD && (*(peak+1))->pulse_height<MIDDLE_STRIP_THRESHOLD) { |
920 | return VALUE_OUT_OF_RANGE; |
921 | } |
922 | |
923 | unsigned int index1=2*((*peak)->gLayer-1)+(1-(*peak)->plane/2); |
924 | unsigned int index2=2*((*(peak+1))->gLayer-1)+(1-(*(peak+1))->plane/2); |
925 | |
926 | |
927 | if (index1 != index2) return VALUE_OUT_OF_RANGE; |
928 | |
929 | double pos1=fdccathodes[index1][(*peak)->element-1]->u; |
930 | double pos2=fdccathodes[index2][(*(peak+1))->element-1]->u; |
931 | |
932 | double amp1=double((*peak)->pulse_height); |
933 | double amp2=double((*(peak+1))->pulse_height); |
934 | double sum=amp1+amp2; |
935 | |
936 | double t1=double((*peak)->t); |
937 | double t2=double((*(peak+1))->t); |
938 | |
939 | |
940 | temp.pos=(pos1*amp1+pos2*amp2)/sum; |
941 | |
942 | |
943 | |
944 | |
945 | double pos_corr = 0.05; |
946 | (amp2 > amp1) ? temp.pos+=pos_corr : temp.pos-=pos_corr; |
947 | |
948 | (amp2 > amp1) ? temp.q_from_pulse_height=amp2 : temp.q_from_pulse_height=amp1; |
949 | temp.q=sum; |
950 | temp.numstrips=2; |
951 | |
952 | |
953 | (amp2 > amp1) ? temp.t=t2 : temp.t=t1; |
954 | temp.t_rms=0.; |
955 | |
956 | |
957 | centroids.push_back(temp); |
958 | |
959 | return NOERROR; |
960 | } |
961 | |
962 | |
963 | |
964 | |
965 | |
966 | |
967 | |
968 | jerror_t DFDCPseudo_factory::ThreeStripCluster(const vector<const DFDCHit*>& H, |
969 | vector<const DFDCHit *>::const_iterator peak, |
970 | vector<centroid_t>¢roids){ |
971 | centroid_t temp; |
972 | |
973 | if ((*(peak-1))->pulse_height<MIDDLE_STRIP_THRESHOLD && |
974 | (*peak)->pulse_height<MIDDLE_STRIP_THRESHOLD && |
975 | (*(peak+1))->pulse_height<MIDDLE_STRIP_THRESHOLD) { |
976 | return VALUE_OUT_OF_RANGE; |
977 | } |
978 | |
979 | double sum=0; |
980 | double wsum=0; |
981 | double t=0; |
982 | double o_amp=0; |
983 | int i_corr=-2; |
984 | double q_from_pulse_height = 0; |
985 | for (vector<const DFDCHit*>::const_iterator j=peak-1;j<=peak+1;j++){ |
986 | unsigned int index=2*((*j)->gLayer-1)+(1-(*j)->plane/2); |
987 | |
988 | double pos=fdccathodes[index][(*j)->element-1]->u; |
989 | double amp=double((*j)->pulse_height); |
990 | |
991 | sum+=amp; |
992 | wsum+=amp*pos; |
993 | |
994 | |
995 | if (amp > o_amp){ |
996 | t=double((*j)->t); |
997 | o_amp = amp; |
998 | q_from_pulse_height=amp; |
999 | i_corr++; |
1000 | } |
1001 | } |
1002 | |
1003 | |
1004 | |
1005 | |
1006 | |
1007 | double pos_corr = 0.1; |
1008 | |
1009 | |
1010 | temp.pos=wsum/sum + i_corr*pos_corr; |
1011 | |
1012 | temp.q=sum; |
1013 | temp.q_from_pulse_height = q_from_pulse_height; |
1014 | temp.numstrips=10; |
1015 | temp.t=t; |
1016 | temp.t_rms=0.; |
1017 | |
1018 | |
1019 | centroids.push_back(temp); |
1020 | |
1021 | return NOERROR; |
1022 | } |
1023 | |
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | #ifndef _JEventLoop_ |
9 | #define _JEventLoop_ |
10 | |
11 | #include <sys/time.h> |
12 | |
13 | #include <vector> |
14 | #include <list> |
15 | #include <string> |
16 | #include <utility> |
17 | #include <typeinfo> |
18 | #include <string.h> |
19 | #include <map> |
20 | #include <utility> |
21 | using std::vector; |
22 | using std::list; |
23 | using std::string; |
24 | using std::type_info; |
25 | |
26 | #include <JANA/jerror.h> |
27 | #include <JANA/JObject.h> |
28 | #include <JANA/JException.h> |
29 | #include <JANA/JEvent.h> |
30 | #include <JANA/JThread.h> |
31 | #include <JANA/JFactory_base.h> |
32 | #include <JANA/JCalibration.h> |
33 | #include <JANA/JGeometry.h> |
34 | #include <JANA/JResourceManager.h> |
35 | #include <JANA/JStreamLog.h> |
36 | |
37 | |
38 | #include "cint.h" |
39 | |
40 | |
41 | |
42 | namespace jana{ |
43 | |
44 | |
45 | template<class T> class JFactory; |
46 | class JApplication; |
47 | class JEventProcessor; |
48 | |
49 | |
50 | class JEventLoop{ |
51 | public: |
52 | |
53 | friend class JApplication; |
54 | |
55 | enum data_source_t{ |
56 | DATA_NOT_AVAILABLE = 1, |
57 | DATA_FROM_CACHE, |
58 | DATA_FROM_SOURCE, |
59 | DATA_FROM_FACTORY |
60 | }; |
61 | |
62 | typedef struct{ |
63 | string caller_name; |
64 | string caller_tag; |
65 | string callee_name; |
66 | string callee_tag; |
67 | double start_time; |
68 | double end_time; |
69 | data_source_t data_source; |
70 | }call_stack_t; |
71 | |
72 | typedef struct{ |
73 | const char* factory_name; |
74 | string tag; |
75 | const char* filename; |
76 | int line; |
77 | }error_call_stack_t; |
78 | |
79 | JEventLoop(JApplication *app); |
80 | virtual ~JEventLoop(); |
81 | virtual const char* className(void){return static_className();} |
82 | static const char* static_className(void){return "JEventLoop";} |
83 | |
84 | JApplication* GetJApplication(void) const {return app;} |
85 | void RefreshProcessorListFromJApplication(void); |
86 | virtual jerror_t AddFactory(JFactory_base* factory); |
87 | jerror_t RemoveFactory(JFactory_base* factory); |
88 | JFactory_base* GetFactory(const string data_name, const char *tag="", bool allow_deftag=true); |
89 | vector<JFactory_base*> GetFactories(void) const {return factories;} |
90 | void GetFactoryNames(vector<string> &factorynames); |
91 | void GetFactoryNames(map<string,string> &factorynames); |
92 | map<string,string> GetDefaultTags(void) const {return default_tags;} |
93 | jerror_t ClearFactories(void); |
94 | jerror_t PrintFactories(int sparsify=0); |
95 | jerror_t Print(const string data_name, const char *tag=""); |
96 | |
97 | JCalibration* GetJCalibration(); |
98 | template<class T> bool GetCalib(string namepath, map<string,T> &vals); |
99 | template<class T> bool GetCalib(string namepath, vector<T> &vals); |
100 | template<class T> bool GetCalib(string namepath, T &val); |
101 | |
102 | JGeometry* GetJGeometry(); |
103 | template<class T> bool GetGeom(string namepath, map<string,T> &vals); |
104 | template<class T> bool GetGeom(string namepath, T &val); |
105 | |
106 | JResourceManager* GetJResourceManager(void); |
107 | string GetResource(string namepath); |
108 | template<class T> bool GetResource(string namepath, T vals, int event_number=0); |
109 | |
110 | void Initialize(void); |
111 | jerror_t Loop(void); |
112 | jerror_t OneEvent(uint64_t event_number); |
113 | jerror_t OneEvent(void); |
114 | inline void Pause(void){pause = 1;} |
115 | inline void Resume(void){pause = 0;} |
116 | inline void Quit(void){quit = 1;} |
117 | inline bool GetQuit(void) const {return quit;} |
118 | void QuitProgram(void); |
119 | |
120 | |
121 | bool HasRandomAccess(void); |
122 | void AddToEventQueue(uint64_t event_number){ next_events_to_process.push_back(event_number); } |
123 | void AddToEventQueue(list<uint64_t> &event_numbers) { next_events_to_process.insert(next_events_to_process.end(), event_numbers.begin(), event_numbers.end()); } |
124 | list<uint64_t> GetEventQueue(void){ return next_events_to_process; } |
125 | void ClearEventQueue(void){ next_events_to_process.clear(); } |
126 | |
127 | template<class T> JFactory<T>* GetSingle(const T* &t, const char *tag="", bool exception_if_not_one=true); |
128 | template<class T> JFactory<T>* Get(vector<const T*> &t, const char *tag="", bool allow_deftag=true); |
129 | template<class T> JFactory<T>* GetFromFactory(vector<const T*> &t, const char *tag="", data_source_t &data_source=null_data_source, bool allow_deftag=true); |
130 | template<class T> jerror_t GetFromSource(vector<const T*> &t, JFactory_base *factory=NULL); |
131 | inline JEvent& GetJEvent(void){return event;} |
132 | inline void SetJEvent(JEvent *event){this->event = *event;} |
133 | inline void SetAutoFree(int auto_free){this->auto_free = auto_free;} |
134 | inline pthread_t GetPThreadID(void) const {return pthread_id;} |
135 | double GetInstantaneousRate(void) const {return rate_instantaneous;} |
136 | double GetIntegratedRate(void) const {return rate_integrated;} |
137 | double GetLastEventProcessingTime(void) const {return delta_time_single;} |
138 | unsigned int GetNevents(void) const {return Nevents;} |
139 | |
140 | inline bool CheckEventBoundary(uint64_t event_numberA, uint64_t event_numberB); |
141 | |
142 | inline bool GetCallStackRecordingStatus(void){ return record_call_stack; } |
143 | inline void DisableCallStackRecording(void){ record_call_stack = false; } |
144 | inline void EnableCallStackRecording(void){ record_call_stack = true; } |
145 | inline void CallStackStart(JEventLoop::call_stack_t &cs, const string &caller_name, const string &caller_tag, const string callee_name, const string callee_tag); |
146 | inline void CallStackEnd(JEventLoop::call_stack_t &cs); |
147 | inline vector<call_stack_t> GetCallStack(void){return call_stack;} |
148 | inline void AddToCallStack(call_stack_t &cs){if(record_call_stack) call_stack.push_back(cs);} |
149 | inline void AddToErrorCallStack(error_call_stack_t &cs){error_call_stack.push_back(cs);} |
150 | inline vector<error_call_stack_t> GetErrorCallStack(void){return error_call_stack;} |
151 | void PrintErrorCallStack(void); |
152 | |
153 | const JObject* FindByID(JObject::oid_t id); |
154 | template<class T> const T* FindByID(JObject::oid_t id); |
155 | JFactory_base* FindOwner(const JObject *t); |
156 | JFactory_base* FindOwner(JObject::oid_t id); |
157 | |
158 | |
159 | template<class T> void SetRef(T *t); |
160 | template<class T> T* GetRef(void); |
161 | template<class T> vector<T*> GetRefsT(void); |
162 | vector<pair<const char*, void*> > GetRefs(void){ return user_refs; } |
163 | template<class T> void RemoveRef(T *t); |
164 | |
165 | |
166 | uint64_t GetStatus(void){return event.GetStatus();} |
167 | bool GetStatusBit(uint32_t bit){return event.GetStatusBit(bit);} |
168 | bool SetStatusBit(uint32_t bit, bool val=true){return event.SetStatusBit(bit, val);} |
169 | bool ClearStatusBit(uint32_t bit){return event.ClearStatusBit(bit);} |
170 | void ClearStatus(void){event.ClearStatus();} |
171 | void SetStatusBitDescription(uint32_t bit, string description){event.SetStatusBitDescription(bit, description);} |
172 | string GetStatusBitDescription(uint32_t bit){return event.GetStatusBitDescription(bit);} |
173 | void GetStatusBitDescriptions(map<uint32_t, string> &status_bit_descriptions){return event.GetStatusBitDescriptions(status_bit_descriptions);} |
174 | string StatusWordToString(void); |
175 | |
176 | private: |
177 | JEvent event; |
178 | vector<JFactory_base*> factories; |
179 | vector<JEventProcessor*> processors; |
180 | vector<error_call_stack_t> error_call_stack; |
181 | vector<call_stack_t> call_stack; |
182 | JApplication *app; |
183 | JThread *jthread; |
184 | bool initialized; |
185 | bool print_parameters_called; |
186 | int pause; |
187 | int quit; |
188 | int auto_free; |
189 | pthread_t pthread_id; |
190 | map<string, string> default_tags; |
191 | vector<pair<string,string> > auto_activated_factories; |
192 | bool record_call_stack; |
193 | string caller_name; |
194 | string caller_tag; |
195 | vector<uint64_t> event_boundaries; |
196 | int32_t event_boundaries_run; |
197 | list<uint64_t> next_events_to_process; |
198 | |
199 | uint64_t Nevents; |
200 | uint64_t Nevents_rate; |
201 | double delta_time_single; |
202 | double delta_time_rate; |
203 | double delta_time; |
204 | double rate_instantaneous; |
205 | double rate_integrated; |
206 | |
207 | static data_source_t null_data_source; |
208 | |
209 | vector<pair<const char*, void*> > user_refs; |
210 | }; |
211 | |
212 | |
213 | |
214 | #ifdef G__DICTIONARY |
215 | typedef JEventLoop::call_stack_t call_stack_t; |
216 | typedef JEventLoop::error_call_stack_t error_call_stack_t; |
217 | #endif |
218 | |
219 | #if !defined(__CINT__) && !defined(__CLING__) |
220 | |
221 | |
222 | |
223 | |
224 | template<class T> |
225 | JFactory<T>* JEventLoop::GetSingle(const T* &t, const char *tag, bool exception_if_not_one) |
226 | { |
227 | |
228 | |
229 | |
230 | |
231 | |
232 | |
233 | |
234 | |
235 | |
236 | |
237 | |
238 | vector<const T*> v; |
239 | JFactory<T> *fac = Get(v, tag); |
240 | |
241 | if(v.size()!=1){ |
242 | t = NULL; |
243 | if(exception_if_not_one) throw v.size(); |
244 | } |
245 | |
246 | t = v[0]; |
247 | |
248 | return fac; |
249 | } |
250 | |
251 | |
252 | |
253 | |
254 | template<class T> |
255 | JFactory<T>* JEventLoop::Get(vector<const T*> &t, const char *tag, bool allow_deftag) |
256 | { |
257 | |
258 | |
259 | |
260 | |
261 | |
262 | |
263 | |
264 | |
265 | |
266 | |
267 | |
268 | |
269 | |
270 | |
271 | |
272 | |
273 | |
274 | |
275 | |
276 | |
277 | |
278 | |
279 | |
280 | |
281 | |
282 | |
283 | |
284 | |
285 | |
286 | |
287 | |
288 | |
289 | |
290 | const char *mytag = tag==NULL ? "":tag; |
| |
291 | if(strlen(mytag)==0 && allow_deftag){ |
| |
292 | map<string, string>::const_iterator iter = default_tags.find(T::static_className()); |
293 | if(iter!=default_tags.end())tag = iter->second.c_str(); |
| 6 | | Assuming the condition is true | |
|
| |
| |
294 | } |
295 | |
296 | |
297 | |
298 | |
299 | |
300 | |
301 | call_stack_t cs; |
302 | |
303 | |
304 | if(record_call_stack) CallStackStart(cs, caller_name, caller_tag, T::static_className(), tag); |
| 9 | | Assuming field 'record_call_stack' is false | |
|
| |
305 | |
306 | |
307 | JFactory<T>* factory=NULL; |
308 | try{ |
309 | factory = GetFromFactory(t, tag, cs.data_source, allow_deftag); |
| 11 | | Passing value via 2nd parameter 'tag' | |
|
| 12 | | Calling 'JEventLoop::GetFromFactory' | |
|
310 | if(!factory){ |
311 | |
312 | |
313 | |
314 | |
315 | |
316 | |
317 | |
318 | string p; |
319 | try{ |
320 | gPARMS->GetParameter("JANA:AUTOFACTORYCREATE", p); |
321 | }catch(...){} |
322 | if(p.size()==0){ |
323 | jout<<std::endl; |
324 | _DBG__; |
325 | jout<<"No factory of type \""<<T::static_className()<<"\" with tag \""<<tag<<"\" exists."<<std::endl; |
326 | jout<<"If you are reading objects from a file, I can auto-create a factory"<<std::endl; |
327 | jout<<"of the appropriate type to hold the objects, but this feature is turned"<<std::endl; |
328 | jout<<"off by default. To turn it on, set the \"JANA:AUTOFACTORYCREATE\""<<std::endl; |
329 | jout<<"configuration parameter. This can usually be done by passing the"<<std::endl; |
330 | jout<<"following argument to the program from the command line:"<<std::endl; |
331 | jout<<std::endl; |
332 | jout<<" -PJANA:AUTOFACTORYCREATE=1"<<std::endl; |
333 | jout<<std::endl; |
334 | jout<<"Note that since the most commonly expected occurance of this situation."<<std::endl; |
335 | jout<<"is an error, the program will now throw an exception so that the factory."<<std::endl; |
336 | jout<<"call stack can be printed."<<std::endl; |
337 | jout<<std::endl; |
338 | throw exception(); |
339 | }else{ |
340 | AddFactory(new JFactory<T>(tag)); |
341 | jout<<__FILE__<<":"<<__LINE__<<" Auto-created "<<T::static_className()<<":"<<tag<<" factory"<<std::endl; |
342 | |
343 | |
344 | |
345 | factory = GetFromFactory(t, tag, cs.data_source, allow_deftag); |
346 | } |
347 | } |
348 | }catch(exception &e){ |
349 | |
350 | |
351 | error_call_stack_t ecs; |
352 | ecs.factory_name = T::static_className(); |
353 | ecs.tag = tag; |
354 | ecs.filename = NULL; |
355 | error_call_stack.push_back(ecs); |
356 | throw e; |
357 | } |
358 | |
359 | |
360 | if(record_call_stack) CallStackEnd(cs); |
361 | |
362 | return factory; |
363 | } |
364 | |
365 | |
366 | |
367 | |
368 | template<class T> |
369 | JFactory<T>* JEventLoop::GetFromFactory(vector<const T*> &t, const char *tag, data_source_t &data_source, bool allow_deftag) |
370 | { |
371 | |
372 | |
373 | vector<JFactory_base*>::iterator iter=factories.begin(); |
374 | JFactory<T> *factory = NULL; |
375 | string className(T::static_className()); |
376 | |
377 | |
378 | |
379 | const char *mytag = tag==NULL ? "":tag; |
| 13 | | Assuming 'tag' is equal to NULL | |
|
| |
380 | if(strlen(mytag)==0 && allow_deftag){ |
| |
381 | map<string, string>::const_iterator iter = default_tags.find(className); |
382 | if(iter!=default_tags.end())tag = iter->second.c_str(); |
| 16 | | Assuming the condition is false | |
|
| |
383 | } |
384 | |
385 | for(; iter!=factories.end(); iter++){ |
| 18 | | Calling 'operator!=<jana::JFactory_base **, std::vector<jana::JFactory_base *>>' | |
|
| 21 | | Returning from 'operator!=<jana::JFactory_base **, std::vector<jana::JFactory_base *>>' | |
|
| 22 | | Loop condition is true. Entering loop body | |
|
386 | |
387 | |
388 | |
389 | |
390 | |
391 | |
392 | |
393 | |
394 | |
395 | if(className == (*iter)->GetDataClassName())factory = (JFactory<T>*)(*iter); |
| |
396 | if(factory == NULL)continue; |
| 24 | | Assuming 'factory' is not equal to NULL | |
|
| |
397 | const char *factag = factory->Tag()==NULL ? "":factory->Tag(); |
| 26 | | Assuming the condition is true | |
|
| |
398 | if(!strcmp(factag, tag)){ |
| 28 | | Null pointer passed to 2nd parameter expecting 'nonnull' |
|
399 | break; |
400 | }else{ |
401 | factory=NULL; |
402 | } |
403 | } |
404 | |
405 | |
406 | if(!factory){ |
407 | data_source = DATA_NOT_AVAILABLE; |
408 | return NULL; |
409 | } |
410 | |
411 | |
412 | |
413 | |
414 | if(factory->evnt_was_called()){ |
415 | factory->CopyFrom(t); |
416 | data_source = DATA_FROM_CACHE; |
417 | return factory; |
418 | } |
419 | |
420 | |
421 | if(factory->GetCheckSourceFirst()){ |
422 | |
423 | |
424 | |
425 | |
426 | |
427 | jerror_t err = GetFromSource(t, factory); |
428 | if(err == NOERROR){ |
429 | |
430 | |
431 | |
432 | |
433 | |
434 | |
435 | |
436 | |
437 | |
438 | |
439 | |
440 | |
441 | |
442 | |
443 | factory->SetFactoryPointers(); |
444 | data_source = DATA_FROM_SOURCE; |
445 | |
446 | return factory; |
447 | } |
448 | } |
449 | |
450 | |
451 | |
452 | factory->Get(t); |
453 | factory->SetFactoryPointers(); |
454 | data_source = DATA_FROM_FACTORY; |
455 | |
456 | return factory; |
457 | } |
458 | |
459 | |
460 | |
461 | |
462 | template<class T> |
463 | jerror_t JEventLoop::GetFromSource(vector<const T*> &t, JFactory_base *factory) |
464 | { |
465 | |
466 | |
467 | |
468 | |
469 | |
470 | |
471 | |
472 | |
473 | |
474 | |
475 | if(!factory)throw OBJECT_NOT_AVAILABLE; |
476 | |
477 | return event.GetObjects(t, factory); |
478 | } |
479 | |
480 | |
481 | |
482 | |
483 | inline void JEventLoop::CallStackStart(JEventLoop::call_stack_t &cs, const string &caller_name, const string &caller_tag, const string callee_name, const string callee_tag) |
484 | { |
485 | |
486 | |
487 | |
488 | |
489 | |
490 | |
491 | struct itimerval tmr; |
492 | getitimer(ITIMER_PROF, &tmr); |
493 | |
494 | cs.caller_name = this->caller_name; |
495 | cs.caller_tag = this->caller_tag; |
496 | this->caller_name = cs.callee_name = callee_name; |
497 | this->caller_tag = cs.callee_tag = callee_tag; |
498 | cs.start_time = tmr.it_value.tv_sec + tmr.it_value.tv_usec/1.0E6; |
499 | } |
500 | |
501 | |
502 | |
503 | |
504 | inline void JEventLoop::CallStackEnd(JEventLoop::call_stack_t &cs) |
505 | { |
506 | |
507 | |
508 | |
509 | |
510 | struct itimerval tmr; |
511 | getitimer(ITIMER_PROF, &tmr); |
512 | cs.end_time = tmr.it_value.tv_sec + tmr.it_value.tv_usec/1.0E6; |
513 | caller_name = cs.caller_name; |
514 | caller_tag = cs.caller_tag; |
515 | call_stack.push_back(cs); |
516 | } |
517 | |
518 | |
519 | |
520 | |
521 | inline bool JEventLoop::CheckEventBoundary(uint64_t event_numberA, uint64_t event_numberB) |
522 | { |
523 | |
524 | |
525 | |
526 | |
527 | |
528 | |
529 | |
530 | |
531 | |
532 | |
533 | |
534 | if(event.GetRunNumber()!=event_boundaries_run){ |
535 | event_boundaries.clear(); |
536 | JCalibration *jcalib = GetJCalibration(); |
537 | if(jcalib)jcalib->GetEventBoundaries(event_boundaries); |
538 | event_boundaries_run = event.GetRunNumber(); |
539 | } |
540 | |
541 | |
542 | for(unsigned int i=0; i<event_boundaries.size(); i++){ |
543 | uint64_t eb = event_boundaries[i]; |
544 | if((eb - event_numberA)*(eb - event_numberB) < 0.0 || eb==event_numberA){ |
545 | |
546 | return true; |
547 | } |
548 | } |
549 | |
550 | return false; |
551 | } |
552 | |
553 | |
554 | |
555 | |
556 | template<class T> |
557 | const T* JEventLoop::FindByID(JObject::oid_t id) |
558 | { |
559 | |
560 | |
561 | |
562 | |
563 | |
564 | |
565 | |
566 | |
567 | |
568 | |
569 | |
570 | |
571 | |
572 | |
573 | |
574 | for(unsigned int i=0; i<factories.size(); i++){ |
575 | if(factories[i]->GetDataClassName() != T::static_className())continue; |
576 | |
577 | |
578 | |
579 | const JObject *my_obj = factories[i]->GetByID(id); |
580 | if(my_obj)return dynamic_cast<const T*>(my_obj); |
581 | } |
582 | |
583 | return NULL; |
584 | } |
585 | |
586 | |
587 | |
588 | |
589 | template<class T> |
590 | bool JEventLoop::GetCalib(string namepath, map<string,T> &vals) |
591 | { |
592 | |
593 | |
594 | |
595 | |
596 | |
597 | |
598 | |
599 | vals.clear(); |
600 | |
601 | JCalibration *calib = GetJCalibration(); |
602 | if(!calib){ |
603 | _DBG_<<"Unable to get JCalibration object for run "<<event.GetRunNumber()<<std::endl; |
604 | return true; |
605 | } |
606 | |
607 | return calib->Get(namepath, vals, event.GetEventNumber()); |
608 | } |
609 | |
610 | |
611 | |
612 | |
613 | template<class T> bool JEventLoop::GetCalib(string namepath, vector<T> &vals) |
614 | { |
615 | |
616 | |
617 | |
618 | vals.clear(); |
619 | |
620 | JCalibration *calib = GetJCalibration(); |
621 | if(!calib){ |
622 | _DBG_<<"Unable to get JCalibration object for run "<<event.GetRunNumber()<<std::endl; |
623 | return true; |
624 | } |
625 | |
626 | return calib->Get(namepath, vals, event.GetEventNumber()); |
627 | } |
628 | |
629 | |
630 | |
631 | |
632 | template<class T> bool JEventLoop::GetCalib(string namepath, T &val) |
633 | { |
634 | |
635 | |
636 | |
637 | |
638 | |
639 | |
640 | vector<T> vals; |
641 | bool ret = GetCalib(namepath, vals); |
642 | if(vals.empty()) return true; |
643 | val = vals[0]; |
644 | |
645 | return ret; |
646 | } |
647 | |
648 | |
649 | |
650 | |
651 | template<class T> |
652 | bool JEventLoop::GetGeom(string namepath, map<string,T> &vals) |
653 | { |
654 | |
655 | |
656 | |
657 | |
658 | |
659 | |
660 | |
661 | vals.clear(); |
662 | |
663 | JGeometry *geom = GetJGeometry(); |
664 | if(!geom){ |
665 | _DBG_<<"Unable to get JGeometry object for run "<<event.GetRunNumber()<<std::endl; |
666 | return true; |
667 | } |
668 | |
669 | return geom->Get(namepath, vals); |
670 | } |
671 | |
672 | |
673 | |
674 | |
675 | template<class T> bool JEventLoop::GetGeom(string namepath, T &val) |
676 | { |
677 | |
678 | |
679 | |
680 | JGeometry *geom = GetJGeometry(); |
681 | if(!geom){ |
682 | _DBG_<<"Unable to get JGeometry object for run "<<event.GetRunNumber()<<std::endl; |
683 | return true; |
684 | } |
685 | |
686 | return geom->Get(namepath, val); |
687 | } |
688 | |
689 | |
690 | |
691 | |
692 | template<class T> |
693 | void JEventLoop::SetRef(T *t) |
694 | { |
695 | pair<const char*, void*> p(typeid(T).name(), (void*)t); |
696 | user_refs.push_back(p); |
697 | } |
698 | |
699 | |
700 | |
701 | |
702 | template<class T> bool JEventLoop::GetResource(string namepath, T vals, int event_number) |
703 | { |
704 | JResourceManager *resource_manager = GetJResourceManager(); |
705 | if(!resource_manager){ |
706 | string mess = string("Unable to get the JResourceManager object (namepath=\"")+namepath+"\")"; |
707 | throw JException(mess); |
708 | } |
709 | |
710 | return resource_manager->Get(namepath, vals, event_number); |
711 | } |
712 | |
713 | |
714 | |
715 | |
716 | template<class T> |
717 | T* JEventLoop::GetRef(void) |
718 | { |
719 | |
720 | for(unsigned int i=0; i<user_refs.size(); i++){ |
721 | if(user_refs[i].first == typeid(T).name()) return (T*)user_refs[i].second; |
722 | } |
723 | |
724 | return NULL; |
725 | } |
726 | |
727 | |
728 | |
729 | |
730 | template<class T> |
731 | vector<T*> JEventLoop::GetRefsT(void) |
732 | { |
733 | vector<T*> refs; |
734 | for(unsigned int i=0; i<user_refs.size(); i++){ |
735 | if(user_refs[i].first == typeid(T).name()){ |
736 | refs.push_back((T*)user_refs[i].second); |
737 | } |
738 | } |
739 | |
740 | return refs; |
741 | } |
742 | |
743 | |
744 | |
745 | |
746 | template<class T> |
747 | void JEventLoop::RemoveRef(T *t) |
748 | { |
749 | vector<pair<const char*, void*> >::iterator iter; |
750 | for(iter=user_refs.begin(); iter!= user_refs.end(); iter++){ |
751 | if(iter->second == (void*)t){ |
752 | user_refs.erase(iter); |
753 | return; |
754 | } |
755 | } |
756 | _DBG_<<" Attempt to remove user reference not in event loop!" << std::endl; |
757 | } |
758 | |
759 | |
760 | #endif //__CINT__ __CLING__ |
761 | |
762 | } |
763 | |
764 | |
765 | |
766 | #endif // _JEventLoop_ |
767 | |
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 | #ifndef _STL_ITERATOR_H |
61 | #define _STL_ITERATOR_H 1 |
62 | |
63 | #include <bits/cpp_type_traits.h> |
64 | #include <ext/type_traits.h> |
65 | #include <bits/move.h> |
66 | |
67 | namespace std _GLIBCXX_VISIBILITY(default) |
68 | { |
69 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
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 | template<typename _Iterator> |
96 | class reverse_iterator |
97 | : public iterator<typename iterator_traits<_Iterator>::iterator_category, |
98 | typename iterator_traits<_Iterator>::value_type, |
99 | typename iterator_traits<_Iterator>::difference_type, |
100 | typename iterator_traits<_Iterator>::pointer, |
101 | typename iterator_traits<_Iterator>::reference> |
102 | { |
103 | protected: |
104 | _Iterator current; |
105 | |
106 | typedef iterator_traits<_Iterator> __traits_type; |
107 | |
108 | public: |
109 | typedef _Iterator iterator_type; |
110 | typedef typename __traits_type::difference_type difference_type; |
111 | typedef typename __traits_type::pointer pointer; |
112 | typedef typename __traits_type::reference reference; |
113 | |
114 | |
115 | |
116 | |
117 | |
118 | |
119 | |
120 | reverse_iterator() : current() { } |
121 | |
122 | |
123 | |
124 | |
125 | explicit |
126 | reverse_iterator(iterator_type __x) : current(__x) { } |
127 | |
128 | |
129 | |
130 | |
131 | reverse_iterator(const reverse_iterator& __x) |
132 | : current(__x.current) { } |
133 | |
134 | |
135 | |
136 | |
137 | |
138 | template<typename _Iter> |
139 | reverse_iterator(const reverse_iterator<_Iter>& __x) |
140 | : current(__x.base()) { } |
141 | |
142 | |
143 | |
144 | |
145 | iterator_type |
146 | base() const |
147 | { return current; } |
148 | |
149 | |
150 | |
151 | |
152 | |
153 | |
154 | |
155 | |
156 | |
157 | |
158 | |
159 | reference |
160 | operator*() const |
161 | { |
162 | _Iterator __tmp = current; |
163 | return *--__tmp; |
164 | } |
165 | |
166 | |
167 | |
168 | |
169 | |
170 | |
171 | pointer |
172 | operator->() const |
173 | { return &(operator*()); } |
174 | |
175 | |
176 | |
177 | |
178 | |
179 | |
180 | reverse_iterator& |
181 | operator++() |
182 | { |
183 | --current; |
184 | return *this; |
185 | } |
186 | |
187 | |
188 | |
189 | |
190 | |
191 | |
192 | reverse_iterator |
193 | operator++(int) |
194 | { |
195 | reverse_iterator __tmp = *this; |
196 | --current; |
197 | return __tmp; |
198 | } |
199 | |
200 | |
201 | |
202 | |
203 | |
204 | |
205 | reverse_iterator& |
206 | operator--() |
207 | { |
208 | ++current; |
209 | return *this; |
210 | } |
211 | |
212 | |
213 | |
214 | |
215 | |
216 | |
217 | reverse_iterator |
218 | operator--(int) |
219 | { |
220 | reverse_iterator __tmp = *this; |
221 | ++current; |
222 | return __tmp; |
223 | } |
224 | |
225 | |
226 | |
227 | |
228 | |
229 | |
230 | reverse_iterator |
231 | operator+(difference_type __n) const |
232 | { return reverse_iterator(current - __n); } |
233 | |
234 | |
235 | |
236 | |
237 | |
238 | |
239 | |
240 | reverse_iterator& |
241 | operator+=(difference_type __n) |
242 | { |
243 | current -= __n; |
244 | return *this; |
245 | } |
246 | |
247 | |
248 | |
249 | |
250 | |
251 | |
252 | reverse_iterator |
253 | operator-(difference_type __n) const |
254 | { return reverse_iterator(current + __n); } |
255 | |
256 | |
257 | |
258 | |
259 | |
260 | |
261 | |
262 | reverse_iterator& |
263 | operator-=(difference_type __n) |
264 | { |
265 | current += __n; |
266 | return *this; |
267 | } |
268 | |
269 | |
270 | |
271 | |
272 | |
273 | |
274 | reference |
275 | operator[](difference_type __n) const |
276 | { return *(*this + __n); } |
277 | }; |
278 | |
279 | |
280 | |
281 | |
282 | |
283 | |
284 | |
285 | |
286 | |
287 | |
288 | |
289 | template<typename _Iterator> |
290 | inline bool |
291 | operator==(const reverse_iterator<_Iterator>& __x, |
292 | const reverse_iterator<_Iterator>& __y) |
293 | { return __x.base() == __y.base(); } |
294 | |
295 | template<typename _Iterator> |
296 | inline bool |
297 | operator<(const reverse_iterator<_Iterator>& __x, |
298 | const reverse_iterator<_Iterator>& __y) |
299 | { return __y.base() < __x.base(); } |
300 | |
301 | template<typename _Iterator> |
302 | inline bool |
303 | operator!=(const reverse_iterator<_Iterator>& __x, |
304 | const reverse_iterator<_Iterator>& __y) |
305 | { return !(__x == __y); } |
306 | |
307 | template<typename _Iterator> |
308 | inline bool |
309 | operator>(const reverse_iterator<_Iterator>& __x, |
310 | const reverse_iterator<_Iterator>& __y) |
311 | { return __y < __x; } |
312 | |
313 | template<typename _Iterator> |
314 | inline bool |
315 | operator<=(const reverse_iterator<_Iterator>& __x, |
316 | const reverse_iterator<_Iterator>& __y) |
317 | { return !(__y < __x); } |
318 | |
319 | template<typename _Iterator> |
320 | inline bool |
321 | operator>=(const reverse_iterator<_Iterator>& __x, |
322 | const reverse_iterator<_Iterator>& __y) |
323 | { return !(__x < __y); } |
324 | |
325 | template<typename _Iterator> |
326 | inline typename reverse_iterator<_Iterator>::difference_type |
327 | operator-(const reverse_iterator<_Iterator>& __x, |
328 | const reverse_iterator<_Iterator>& __y) |
329 | { return __y.base() - __x.base(); } |
330 | |
331 | template<typename _Iterator> |
332 | inline reverse_iterator<_Iterator> |
333 | operator+(typename reverse_iterator<_Iterator>::difference_type __n, |
334 | const reverse_iterator<_Iterator>& __x) |
335 | { return reverse_iterator<_Iterator>(__x.base() - __n); } |
336 | |
337 | |
338 | |
339 | template<typename _IteratorL, typename _IteratorR> |
340 | inline bool |
341 | operator==(const reverse_iterator<_IteratorL>& __x, |
342 | const reverse_iterator<_IteratorR>& __y) |
343 | { return __x.base() == __y.base(); } |
344 | |
345 | template<typename _IteratorL, typename _IteratorR> |
346 | inline bool |
347 | operator<(const reverse_iterator<_IteratorL>& __x, |
348 | const reverse_iterator<_IteratorR>& __y) |
349 | { return __y.base() < __x.base(); } |
350 | |
351 | template<typename _IteratorL, typename _IteratorR> |
352 | inline bool |
353 | operator!=(const reverse_iterator<_IteratorL>& __x, |
354 | const reverse_iterator<_IteratorR>& __y) |
355 | { return !(__x == __y); } |
356 | |
357 | template<typename _IteratorL, typename _IteratorR> |
358 | inline bool |
359 | operator>(const reverse_iterator<_IteratorL>& __x, |
360 | const reverse_iterator<_IteratorR>& __y) |
361 | { return __y < __x; } |
362 | |
363 | template<typename _IteratorL, typename _IteratorR> |
364 | inline bool |
365 | operator<=(const reverse_iterator<_IteratorL>& __x, |
366 | const reverse_iterator<_IteratorR>& __y) |
367 | { return !(__y < __x); } |
368 | |
369 | template<typename _IteratorL, typename _IteratorR> |
370 | inline bool |
371 | operator>=(const reverse_iterator<_IteratorL>& __x, |
372 | const reverse_iterator<_IteratorR>& __y) |
373 | { return !(__x < __y); } |
374 | |
375 | template<typename _IteratorL, typename _IteratorR> |
376 | #if __cplusplus >= 201103L |
377 | |
378 | inline auto |
379 | operator-(const reverse_iterator<_IteratorL>& __x, |
380 | const reverse_iterator<_IteratorR>& __y) |
381 | -> decltype(__y.base() - __x.base()) |
382 | #else |
383 | inline typename reverse_iterator<_IteratorL>::difference_type |
384 | operator-(const reverse_iterator<_IteratorL>& __x, |
385 | const reverse_iterator<_IteratorR>& __y) |
386 | #endif |
387 | { return __y.base() - __x.base(); } |
388 | |
389 | |
390 | |
391 | |
392 | |
393 | |
394 | |
395 | |
396 | |
397 | |
398 | |
399 | |
400 | |
401 | template<typename _Container> |
402 | class back_insert_iterator |
403 | : public iterator<output_iterator_tag, void, void, void, void> |
404 | { |
405 | protected: |
406 | _Container* container; |
407 | |
408 | public: |
409 | |
410 | typedef _Container container_type; |
411 | |
412 | |
413 | explicit |
414 | back_insert_iterator(_Container& __x) : container(&__x) { } |
415 | |
416 | |
417 | |
418 | |
419 | |
420 | |
421 | |
422 | |
423 | |
424 | |
425 | |
426 | |
427 | #if __cplusplus < 201103L |
428 | back_insert_iterator& |
429 | operator=(typename _Container::const_reference __value) |
430 | { |
431 | container->push_back(__value); |
432 | return *this; |
433 | } |
434 | #else |
435 | back_insert_iterator& |
436 | operator=(const typename _Container::value_type& __value) |
437 | { |
438 | container->push_back(__value); |
439 | return *this; |
440 | } |
441 | |
442 | back_insert_iterator& |
443 | operator=(typename _Container::value_type&& __value) |
444 | { |
445 | container->push_back(std::move(__value)); |
446 | return *this; |
447 | } |
448 | #endif |
449 | |
450 | |
451 | back_insert_iterator& |
452 | operator*() |
453 | { return *this; } |
454 | |
455 | |
456 | back_insert_iterator& |
457 | operator++() |
458 | { return *this; } |
459 | |
460 | |
461 | back_insert_iterator |
462 | operator++(int) |
463 | { return *this; } |
464 | }; |
465 | |
466 | |
467 | |
468 | |
469 | |
470 | |
471 | |
472 | |
473 | |
474 | |
475 | |
476 | |
477 | template<typename _Container> |
478 | inline back_insert_iterator<_Container> |
479 | back_inserter(_Container& __x) |
480 | { return back_insert_iterator<_Container>(__x); } |
481 | |
482 | |
483 | |
484 | |
485 | |
486 | |
487 | |
488 | |
489 | |
490 | |
491 | |
492 | template<typename _Container> |
493 | class front_insert_iterator |
494 | : public iterator<output_iterator_tag, void, void, void, void> |
495 | { |
496 | protected: |
497 | _Container* container; |
498 | |
499 | public: |
500 | |
501 | typedef _Container container_type; |
502 | |
503 | |
504 | explicit front_insert_iterator(_Container& __x) : container(&__x) { } |
505 | |
506 | |
507 | |
508 | |
509 | |
510 | |
511 | |
512 | |
513 | |
514 | |
515 | |
516 | |
517 | #if __cplusplus < 201103L |
518 | front_insert_iterator& |
519 | operator=(typename _Container::const_reference __value) |
520 | { |
521 | container->push_front(__value); |
522 | return *this; |
523 | } |
524 | #else |
525 | front_insert_iterator& |
526 | operator=(const typename _Container::value_type& __value) |
527 | { |
528 | container->push_front(__value); |
529 | return *this; |
530 | } |
531 | |
532 | front_insert_iterator& |
533 | operator=(typename _Container::value_type&& __value) |
534 | { |
535 | container->push_front(std::move(__value)); |
536 | return *this; |
537 | } |
538 | #endif |
539 | |
540 | |
541 | front_insert_iterator& |
542 | operator*() |
543 | { return *this; } |
544 | |
545 | |
546 | front_insert_iterator& |
547 | operator++() |
548 | { return *this; } |
549 | |
550 | |
551 | front_insert_iterator |
552 | operator++(int) |
553 | { return *this; } |
554 | }; |
555 | |
556 | |
557 | |
558 | |
559 | |
560 | |
561 | |
562 | |
563 | |
564 | |
565 | |
566 | |
567 | template<typename _Container> |
568 | inline front_insert_iterator<_Container> |
569 | front_inserter(_Container& __x) |
570 | { return front_insert_iterator<_Container>(__x); } |
571 | |
572 | |
573 | |
574 | |
575 | |
576 | |
577 | |
578 | |
579 | |
580 | |
581 | |
582 | |
583 | |
584 | |
585 | |
586 | template<typename _Container> |
587 | class insert_iterator |
588 | : public iterator<output_iterator_tag, void, void, void, void> |
589 | { |
590 | protected: |
591 | _Container* container; |
592 | typename _Container::iterator iter; |
593 | |
594 | public: |
595 | |
596 | typedef _Container container_type; |
597 | |
598 | |
599 | |
600 | |
601 | |
602 | insert_iterator(_Container& __x, typename _Container::iterator __i) |
603 | : container(&__x), iter(__i) {} |
604 | |
605 | |
606 | |
607 | |
608 | |
609 | |
610 | |
611 | |
612 | |
613 | |
614 | |
615 | |
616 | |
617 | |
618 | |
619 | |
620 | |
621 | |
622 | |
623 | |
624 | |
625 | |
626 | |
627 | |
628 | #if __cplusplus < 201103L |
629 | insert_iterator& |
630 | operator=(typename _Container::const_reference __value) |
631 | { |
632 | iter = container->insert(iter, __value); |
633 | ++iter; |
634 | return *this; |
635 | } |
636 | #else |
637 | insert_iterator& |
638 | operator=(const typename _Container::value_type& __value) |
639 | { |
640 | iter = container->insert(iter, __value); |
641 | ++iter; |
642 | return *this; |
643 | } |
644 | |
645 | insert_iterator& |
646 | operator=(typename _Container::value_type&& __value) |
647 | { |
648 | iter = container->insert(iter, std::move(__value)); |
649 | ++iter; |
650 | return *this; |
651 | } |
652 | #endif |
653 | |
654 | |
655 | insert_iterator& |
656 | operator*() |
657 | { return *this; } |
658 | |
659 | |
660 | insert_iterator& |
661 | operator++() |
662 | { return *this; } |
663 | |
664 | |
665 | insert_iterator& |
666 | operator++(int) |
667 | { return *this; } |
668 | }; |
669 | |
670 | |
671 | |
672 | |
673 | |
674 | |
675 | |
676 | |
677 | |
678 | |
679 | |
680 | |
681 | template<typename _Container, typename _Iterator> |
682 | inline insert_iterator<_Container> |
683 | inserter(_Container& __x, _Iterator __i) |
684 | { |
685 | return insert_iterator<_Container>(__x, |
686 | typename _Container::iterator(__i)); |
687 | } |
688 | |
689 | |
690 | |
691 | _GLIBCXX_END_NAMESPACE_VERSION |
692 | } |
693 | |
694 | namespace __gnu_cxx _GLIBCXX_VISIBILITY(default) |
695 | { |
696 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
697 | |
698 | |
699 | |
700 | |
701 | |
702 | |
703 | |
704 | |
705 | using std::iterator_traits; |
706 | using std::iterator; |
707 | template<typename _Iterator, typename _Container> |
708 | class __normal_iterator |
709 | { |
710 | protected: |
711 | _Iterator _M_current; |
712 | |
713 | typedef iterator_traits<_Iterator> __traits_type; |
714 | |
715 | public: |
716 | typedef _Iterator iterator_type; |
717 | typedef typename __traits_type::iterator_category iterator_category; |
718 | typedef typename __traits_type::value_type value_type; |
719 | typedef typename __traits_type::difference_type difference_type; |
720 | typedef typename __traits_type::reference reference; |
721 | typedef typename __traits_type::pointer pointer; |
722 | |
723 | _GLIBCXX_CONSTEXPR __normal_iterator() : _M_current(_Iterator()) { } |
724 | |
725 | explicit |
726 | __normal_iterator(const _Iterator& __i) : _M_current(__i) { } |
727 | |
728 | |
729 | template<typename _Iter> |
730 | __normal_iterator(const __normal_iterator<_Iter, |
731 | typename __enable_if< |
732 | (std::__are_same<_Iter, typename _Container::pointer>::__value), |
733 | _Container>::__type>& __i) |
734 | : _M_current(__i.base()) { } |
735 | |
736 | |
737 | reference |
738 | operator*() const |
739 | { return *_M_current; } |
740 | |
741 | pointer |
742 | operator->() const |
743 | { return _M_current; } |
744 | |
745 | __normal_iterator& |
746 | operator++() |
747 | { |
748 | ++_M_current; |
749 | return *this; |
750 | } |
751 | |
752 | __normal_iterator |
753 | operator++(int) |
754 | { return __normal_iterator(_M_current++); } |
755 | |
756 | |
757 | __normal_iterator& |
758 | operator--() |
759 | { |
760 | --_M_current; |
761 | return *this; |
762 | } |
763 | |
764 | __normal_iterator |
765 | operator--(int) |
766 | { return __normal_iterator(_M_current--); } |
767 | |
768 | |
769 | reference |
770 | operator[](const difference_type& __n) const |
771 | { return _M_current[__n]; } |
772 | |
773 | __normal_iterator& |
774 | operator+=(const difference_type& __n) |
775 | { _M_current += __n; return *this; } |
776 | |
777 | __normal_iterator |
778 | operator+(const difference_type& __n) const |
779 | { return __normal_iterator(_M_current + __n); } |
780 | |
781 | __normal_iterator& |
782 | operator-=(const difference_type& __n) |
783 | { _M_current -= __n; return *this; } |
784 | |
785 | __normal_iterator |
786 | operator-(const difference_type& __n) const |
787 | { return __normal_iterator(_M_current - __n); } |
788 | |
789 | const _Iterator& |
790 | base() const |
791 | { return _M_current; } |
792 | }; |
793 | |
794 | |
795 | |
796 | |
797 | |
798 | |
799 | |
800 | |
801 | |
802 | |
803 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
804 | inline bool |
805 | operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, |
806 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
807 | { return __lhs.base() == __rhs.base(); } |
808 | |
809 | template<typename _Iterator, typename _Container> |
810 | inline bool |
811 | operator==(const __normal_iterator<_Iterator, _Container>& __lhs, |
812 | const __normal_iterator<_Iterator, _Container>& __rhs) |
813 | { return __lhs.base() == __rhs.base(); } |
814 | |
815 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
816 | inline bool |
817 | operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, |
818 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
819 | { return __lhs.base() != __rhs.base(); } |
820 | |
821 | template<typename _Iterator, typename _Container> |
822 | inline bool |
823 | operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, |
824 | const __normal_iterator<_Iterator, _Container>& __rhs) |
825 | { return __lhs.base() != __rhs.base(); } |
| 19 | | Assuming the condition is true | |
|
| 20 | | Returning the value 1, which participates in a condition later | |
|
826 | |
827 | |
828 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
829 | inline bool |
830 | operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, |
831 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
832 | { return __lhs.base() < __rhs.base(); } |
833 | |
834 | template<typename _Iterator, typename _Container> |
835 | inline bool |
836 | operator<(const __normal_iterator<_Iterator, _Container>& __lhs, |
837 | const __normal_iterator<_Iterator, _Container>& __rhs) |
838 | { return __lhs.base() < __rhs.base(); } |
839 | |
840 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
841 | inline bool |
842 | operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, |
843 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
844 | { return __lhs.base() > __rhs.base(); } |
845 | |
846 | template<typename _Iterator, typename _Container> |
847 | inline bool |
848 | operator>(const __normal_iterator<_Iterator, _Container>& __lhs, |
849 | const __normal_iterator<_Iterator, _Container>& __rhs) |
850 | { return __lhs.base() > __rhs.base(); } |
851 | |
852 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
853 | inline bool |
854 | operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, |
855 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
856 | { return __lhs.base() <= __rhs.base(); } |
857 | |
858 | template<typename _Iterator, typename _Container> |
859 | inline bool |
860 | operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, |
861 | const __normal_iterator<_Iterator, _Container>& __rhs) |
862 | { return __lhs.base() <= __rhs.base(); } |
863 | |
864 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
865 | inline bool |
866 | operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, |
867 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
868 | { return __lhs.base() >= __rhs.base(); } |
869 | |
870 | template<typename _Iterator, typename _Container> |
871 | inline bool |
872 | operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, |
873 | const __normal_iterator<_Iterator, _Container>& __rhs) |
874 | { return __lhs.base() >= __rhs.base(); } |
875 | |
876 | |
877 | |
878 | |
879 | |
880 | template<typename _IteratorL, typename _IteratorR, typename _Container> |
881 | #if __cplusplus >= 201103L |
882 | |
883 | inline auto |
884 | operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, |
885 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
886 | -> decltype(__lhs.base() - __rhs.base()) |
887 | #else |
888 | inline typename __normal_iterator<_IteratorL, _Container>::difference_type |
889 | operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, |
890 | const __normal_iterator<_IteratorR, _Container>& __rhs) |
891 | #endif |
892 | { return __lhs.base() - __rhs.base(); } |
893 | |
894 | template<typename _Iterator, typename _Container> |
895 | inline typename __normal_iterator<_Iterator, _Container>::difference_type |
896 | operator-(const __normal_iterator<_Iterator, _Container>& __lhs, |
897 | const __normal_iterator<_Iterator, _Container>& __rhs) |
898 | { return __lhs.base() - __rhs.base(); } |
899 | |
900 | template<typename _Iterator, typename _Container> |
901 | inline __normal_iterator<_Iterator, _Container> |
902 | operator+(typename __normal_iterator<_Iterator, _Container>::difference_type |
903 | __n, const __normal_iterator<_Iterator, _Container>& __i) |
904 | { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } |
905 | |
906 | _GLIBCXX_END_NAMESPACE_VERSION |
907 | } |
908 | |
909 | #if __cplusplus >= 201103L |
910 | |
911 | namespace std _GLIBCXX_VISIBILITY(default) |
912 | { |
913 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
914 | |
915 | |
916 | |
917 | |
918 | |
919 | |
920 | |
921 | |
922 | |
923 | |
924 | |
925 | |
926 | |
927 | |
928 | |
929 | template<typename _Iterator> |
930 | class move_iterator |
931 | { |
932 | protected: |
933 | _Iterator _M_current; |
934 | |
935 | typedef iterator_traits<_Iterator> __traits_type; |
936 | |
937 | public: |
938 | typedef _Iterator iterator_type; |
939 | typedef typename __traits_type::iterator_category iterator_category; |
940 | typedef typename __traits_type::value_type value_type; |
941 | typedef typename __traits_type::difference_type difference_type; |
942 | |
943 | typedef _Iterator pointer; |
944 | typedef value_type&& reference; |
945 | |
946 | move_iterator() |
947 | : _M_current() { } |
948 | |
949 | explicit |
950 | move_iterator(iterator_type __i) |
951 | : _M_current(__i) { } |
952 | |
953 | template<typename _Iter> |
954 | move_iterator(const move_iterator<_Iter>& __i) |
955 | : _M_current(__i.base()) { } |
956 | |
957 | iterator_type |
958 | base() const |
959 | { return _M_current; } |
960 | |
961 | reference |
962 | operator*() const |
963 | { return std::move(*_M_current); } |
964 | |
965 | pointer |
966 | operator->() const |
967 | { return _M_current; } |
968 | |
969 | move_iterator& |
970 | operator++() |
971 | { |
972 | ++_M_current; |
973 | return *this; |
974 | } |
975 | |
976 | move_iterator |
977 | operator++(int) |
978 | { |
979 | move_iterator __tmp = *this; |
980 | ++_M_current; |
981 | return __tmp; |
982 | } |
983 | |
984 | move_iterator& |
985 | operator--() |
986 | { |
987 | --_M_current; |
988 | return *this; |
989 | } |
990 | |
991 | move_iterator |
992 | operator--(int) |
993 | { |
994 | move_iterator __tmp = *this; |
995 | --_M_current; |
996 | return __tmp; |
997 | } |
998 | |
999 | move_iterator |
1000 | operator+(difference_type __n) const |
1001 | { return move_iterator(_M_current + __n); } |
1002 | |
1003 | move_iterator& |
1004 | operator+=(difference_type __n) |
1005 | { |
1006 | _M_current += __n; |
1007 | return *this; |
1008 | } |
1009 | |
1010 | move_iterator |
1011 | operator-(difference_type __n) const |
1012 | { return move_iterator(_M_current - __n); } |
1013 | |
1014 | move_iterator& |
1015 | operator-=(difference_type __n) |
1016 | { |
1017 | _M_current -= __n; |
1018 | return *this; |
1019 | } |
1020 | |
1021 | reference |
1022 | operator[](difference_type __n) const |
1023 | { return std::move(_M_current[__n]); } |
1024 | }; |
1025 | |
1026 | |
1027 | |
1028 | |
1029 | template<typename _IteratorL, typename _IteratorR> |
1030 | inline bool |
1031 | operator==(const move_iterator<_IteratorL>& __x, |
1032 | const move_iterator<_IteratorR>& __y) |
1033 | { return __x.base() == __y.base(); } |
1034 | |
1035 | template<typename _Iterator> |
1036 | inline bool |
1037 | operator==(const move_iterator<_Iterator>& __x, |
1038 | const move_iterator<_Iterator>& __y) |
1039 | { return __x.base() == __y.base(); } |
1040 | |
1041 | template<typename _IteratorL, typename _IteratorR> |
1042 | inline bool |
1043 | operator!=(const move_iterator<_IteratorL>& __x, |
1044 | const move_iterator<_IteratorR>& __y) |
1045 | { return !(__x == __y); } |
1046 | |
1047 | template<typename _Iterator> |
1048 | inline bool |
1049 | operator!=(const move_iterator<_Iterator>& __x, |
1050 | const move_iterator<_Iterator>& __y) |
1051 | { return !(__x == __y); } |
1052 | |
1053 | template<typename _IteratorL, typename _IteratorR> |
1054 | inline bool |
1055 | operator<(const move_iterator<_IteratorL>& __x, |
1056 | const move_iterator<_IteratorR>& __y) |
1057 | { return __x.base() < __y.base(); } |
1058 | |
1059 | template<typename _Iterator> |
1060 | inline bool |
1061 | operator<(const move_iterator<_Iterator>& __x, |
1062 | const move_iterator<_Iterator>& __y) |
1063 | { return __x.base() < __y.base(); } |
1064 | |
1065 | template<typename _IteratorL, typename _IteratorR> |
1066 | inline bool |
1067 | operator<=(const move_iterator<_IteratorL>& __x, |
1068 | const move_iterator<_IteratorR>& __y) |
1069 | { return !(__y < __x); } |
1070 | |
1071 | template<typename _Iterator> |
1072 | inline bool |
1073 | operator<=(const move_iterator<_Iterator>& __x, |
1074 | const move_iterator<_Iterator>& __y) |
1075 | { return !(__y < __x); } |
1076 | |
1077 | template<typename _IteratorL, typename _IteratorR> |
1078 | inline bool |
1079 | operator>(const move_iterator<_IteratorL>& __x, |
1080 | const move_iterator<_IteratorR>& __y) |
1081 | { return __y < __x; } |
1082 | |
1083 | template<typename _Iterator> |
1084 | inline bool |
1085 | operator>(const move_iterator<_Iterator>& __x, |
1086 | const move_iterator<_Iterator>& __y) |
1087 | { return __y < __x; } |
1088 | |
1089 | template<typename _IteratorL, typename _IteratorR> |
1090 | inline bool |
1091 | operator>=(const move_iterator<_IteratorL>& __x, |
1092 | const move_iterator<_IteratorR>& __y) |
1093 | { return !(__x < __y); } |
1094 | |
1095 | template<typename _Iterator> |
1096 | inline bool |
1097 | operator>=(const move_iterator<_Iterator>& __x, |
1098 | const move_iterator<_Iterator>& __y) |
1099 | { return !(__x < __y); } |
1100 | |
1101 | |
1102 | template<typename _IteratorL, typename _IteratorR> |
1103 | inline auto |
1104 | operator-(const move_iterator<_IteratorL>& __x, |
1105 | const move_iterator<_IteratorR>& __y) |
1106 | -> decltype(__x.base() - __y.base()) |
1107 | { return __x.base() - __y.base(); } |
1108 | |
1109 | template<typename _Iterator> |
1110 | inline auto |
1111 | operator-(const move_iterator<_Iterator>& __x, |
1112 | const move_iterator<_Iterator>& __y) |
1113 | -> decltype(__x.base() - __y.base()) |
1114 | { return __x.base() - __y.base(); } |
1115 | |
1116 | template<typename _Iterator> |
1117 | inline move_iterator<_Iterator> |
1118 | operator+(typename move_iterator<_Iterator>::difference_type __n, |
1119 | const move_iterator<_Iterator>& __x) |
1120 | { return __x + __n; } |
1121 | |
1122 | template<typename _Iterator> |
1123 | inline move_iterator<_Iterator> |
1124 | make_move_iterator(_Iterator __i) |
1125 | { return move_iterator<_Iterator>(__i); } |
1126 | |
1127 | template<typename _Iterator, typename _ReturnType |
1128 | = typename conditional<__move_if_noexcept_cond |
1129 | <typename iterator_traits<_Iterator>::value_type>::value, |
1130 | _Iterator, move_iterator<_Iterator>>::type> |
1131 | inline _ReturnType |
1132 | __make_move_if_noexcept_iterator(_Iterator __i) |
1133 | { return _ReturnType(__i); } |
1134 | |
1135 | |
1136 | |
1137 | _GLIBCXX_END_NAMESPACE_VERSION |
1138 | } |
1139 | |
1140 | #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) std::make_move_iterator(_Iter) |
1141 | #define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter) \ |
1142 | std::__make_move_if_noexcept_iterator(_Iter) |
1143 | #else |
1144 | #define _GLIBCXX_MAKE_MOVE_ITERATOR(_Iter) (_Iter) |
1145 | #define _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(_Iter) (_Iter) |
1146 | #endif // C++11 |
1147 | |
1148 | #endif |