4 |
*/ |
*/ |
5 |
#include <TrkLevel2.h> |
#include <TrkLevel2.h> |
6 |
#include <iostream> |
#include <iostream> |
7 |
|
#include <math.h> |
8 |
using namespace std; |
using namespace std; |
9 |
//...................................... |
//...................................... |
10 |
// F77 routines |
// F77 routines |
12 |
extern "C" { |
extern "C" { |
13 |
void dotrack_(int*, double*, double*, double*, double*, int*); |
void dotrack_(int*, double*, double*, double*, double*, int*); |
14 |
void dotrack2_(int*, double*, double*, double*, double*,double*, double*, double*,int*); |
void dotrack2_(int*, double*, double*, double*, double*,double*, double*, double*,int*); |
15 |
int readb_(const char*); |
// int readb_(const char*); |
16 |
|
int readb_(); |
17 |
|
void mini2_(int*,int*,int*); |
18 |
|
void guess_(); |
19 |
} |
} |
20 |
//-------------------------------------- |
//-------------------------------------- |
21 |
// |
// |
22 |
// |
// |
23 |
//-------------------------------------- |
//-------------------------------------- |
24 |
TrkTrack::TrkTrack(){ |
TrkTrack::TrkTrack(){ |
25 |
|
// cout << "TrkTrack::TrkTrack()" << endl; |
26 |
seqno = -1; |
seqno = -1; |
27 |
image = -1; |
image = -1; |
28 |
chi2 = 0; |
chi2 = 0; |
29 |
|
nstep = 0; |
30 |
for(int it1=0;it1<5;it1++){ |
for(int it1=0;it1<5;it1++){ |
31 |
al[it1] = 0; |
al[it1] = 0; |
32 |
for(int it2=0;it2<5;it2++) |
for(int it2=0;it2<5;it2++)coval[it1][it2] = 0; |
|
coval[it1][it2] = 0; |
|
33 |
}; |
}; |
34 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
35 |
xgood[ip] = 0; |
xgood[ip] = 0; |
46 |
ayv[ip] = 0; |
ayv[ip] = 0; |
47 |
dedx_x[ip] = 0; |
dedx_x[ip] = 0; |
48 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
49 |
}; |
}; |
50 |
|
clx = 0; |
51 |
|
cly = 0; |
52 |
|
// clx = new TRefArray(6,0); |
53 |
|
// cly = new TRefArray(6,0); |
54 |
}; |
}; |
55 |
//-------------------------------------- |
//-------------------------------------- |
56 |
// |
// |
60 |
seqno = t.seqno; |
seqno = t.seqno; |
61 |
image = t.image; |
image = t.image; |
62 |
chi2 = t.chi2; |
chi2 = t.chi2; |
63 |
|
nstep = t.nstep; |
64 |
for(int it1=0;it1<5;it1++){ |
for(int it1=0;it1<5;it1++){ |
65 |
al[it1] = t.al[it1]; |
al[it1] = t.al[it1]; |
66 |
for(int it2=0;it2<5;it2++) |
for(int it2=0;it2<5;it2++)coval[it1][it2] = t.coval[it1][it2]; |
|
coval[it1][it2] = t.coval[it1][it2]; |
|
67 |
}; |
}; |
68 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
69 |
xgood[ip] = t.xgood[ip]; |
xgood[ip] = t.xgood[ip]; |
80 |
ayv[ip] = t.ayv[ip]; |
ayv[ip] = t.ayv[ip]; |
81 |
dedx_x[ip] = t.dedx_x[ip]; |
dedx_x[ip] = t.dedx_x[ip]; |
82 |
dedx_y[ip] = t.dedx_y[ip]; |
dedx_y[ip] = t.dedx_y[ip]; |
83 |
}; |
}; |
84 |
|
clx = 0; |
85 |
|
cly = 0; |
86 |
|
if(t.clx)clx = new TRefArray(*(t.clx)); |
87 |
|
if(t.cly)cly = new TRefArray(*(t.cly)); |
88 |
|
|
89 |
|
}; |
90 |
|
//-------------------------------------- |
91 |
|
// |
92 |
|
// |
93 |
|
//-------------------------------------- |
94 |
|
void TrkTrack::Copy(TrkTrack& t){ |
95 |
|
|
96 |
|
t.seqno = seqno; |
97 |
|
t.image = image; |
98 |
|
t.chi2 = chi2; |
99 |
|
t.nstep = nstep; |
100 |
|
for(int it1=0;it1<5;it1++){ |
101 |
|
t.al[it1] = al[it1]; |
102 |
|
for(int it2=0;it2<5;it2++)t.coval[it1][it2] = coval[it1][it2]; |
103 |
|
}; |
104 |
|
for(int ip=0;ip<6;ip++){ |
105 |
|
t.xgood[ip] = xgood[ip]; |
106 |
|
t.ygood[ip] = ygood[ip]; |
107 |
|
t.xm[ip] = xm[ip]; |
108 |
|
t.ym[ip] = ym[ip]; |
109 |
|
t.zm[ip] = zm[ip]; |
110 |
|
t.resx[ip] = resx[ip]; |
111 |
|
t.resy[ip] = resy[ip]; |
112 |
|
t.xv[ip] = xv[ip]; |
113 |
|
t.yv[ip] = yv[ip]; |
114 |
|
t.zv[ip] = zv[ip]; |
115 |
|
t.axv[ip] = axv[ip]; |
116 |
|
t.ayv[ip] = ayv[ip]; |
117 |
|
t.dedx_x[ip] = dedx_x[ip]; |
118 |
|
t.dedx_y[ip] = dedx_y[ip]; |
119 |
|
|
120 |
|
}; |
121 |
|
|
122 |
}; |
}; |
123 |
//-------------------------------------- |
//-------------------------------------- |
124 |
// |
// |
234 |
//-------------------------------------- |
//-------------------------------------- |
235 |
void TrkTrack::Dump(){ |
void TrkTrack::Dump(){ |
236 |
cout << endl << "========== Track " ; |
cout << endl << "========== Track " ; |
237 |
|
cout << endl << "seq. n. : "<< seqno; |
238 |
|
cout << endl << "image n. : "<< image; |
239 |
cout << endl << "al : "; for(int i=0; i<5; i++)cout << al[i] << " "; |
cout << endl << "al : "; for(int i=0; i<5; i++)cout << al[i] << " "; |
240 |
cout << endl << "chi^2 : "<< chi2; |
cout << endl << "chi^2 : "<< chi2; |
241 |
|
cout << endl << "n.step : "<< nstep; |
242 |
cout << endl << "xgood : "; for(int i=0; i<6; i++)cout << xgood[i] ; |
cout << endl << "xgood : "; for(int i=0; i<6; i++)cout << xgood[i] ; |
243 |
cout << endl << "ygood : "; for(int i=0; i<6; i++)cout << ygood[i] ; |
cout << endl << "ygood : "; for(int i=0; i<6; i++)cout << ygood[i] ; |
244 |
cout << endl << "xm : "; for(int i=0; i<6; i++)cout << xm[i] << " "; |
cout << endl << "xm : "; for(int i=0; i<6; i++)cout << xm[i] << " "; |
245 |
cout << endl << "ym : "; for(int i=0; i<6; i++)cout << ym[i] << " "; |
cout << endl << "ym : "; for(int i=0; i<6; i++)cout << ym[i] << " "; |
246 |
cout << endl << "zm : "; for(int i=0; i<6; i++)cout << zm[i] << " "; |
cout << endl << "zm : "; for(int i=0; i<6; i++)cout << zm[i] << " "; |
247 |
|
cout << endl << "xv : "; for(int i=0; i<6; i++)cout << xv[i] << " "; |
248 |
|
cout << endl << "yv : "; for(int i=0; i<6; i++)cout << yv[i] << " "; |
249 |
|
cout << endl << "zv : "; for(int i=0; i<6; i++)cout << zv[i] << " "; |
250 |
|
cout << endl << "resx : "; for(int i=0; i<6; i++)cout << resx[i] << " "; |
251 |
|
cout << endl << "resy : "; for(int i=0; i<6; i++)cout << resy[i] << " "; |
252 |
|
cout << endl << "coval : "; for(int i=0; i<5; i++)cout << coval[0][i]<<" "; |
253 |
|
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[1][i]<<" "; |
254 |
|
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[2][i]<<" "; |
255 |
|
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[3][i]<<" "; |
256 |
|
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[4][i]<<" "; |
257 |
cout << endl << "dedx_x : "; for(int i=0; i<6; i++)cout << dedx_x[i] << " "; |
cout << endl << "dedx_x : "; for(int i=0; i<6; i++)cout << dedx_x[i] << " "; |
258 |
cout << endl << "dedx_y : "; for(int i=0; i<6; i++)cout << dedx_y[i] << " "; |
cout << endl << "dedx_y : "; for(int i=0; i<6; i++)cout << dedx_y[i] << " "; |
259 |
|
cout << endl; |
260 |
|
} |
261 |
|
/** |
262 |
|
* Set the TrkTrack position measurements |
263 |
|
*/ |
264 |
|
void TrkTrack::SetMeasure(double *xmeas, double *ymeas, double *zmeas){ |
265 |
|
for(int i=0; i<6; i++) xm[i]=*xmeas++; |
266 |
|
for(int i=0; i<6; i++) ym[i]=*ymeas++; |
267 |
|
for(int i=0; i<6; i++) zm[i]=*zmeas++; |
268 |
} |
} |
269 |
|
/** |
270 |
|
* Set the TrkTrack position resolution |
271 |
|
*/ |
272 |
|
void TrkTrack::SetResolution(double *rx, double *ry){ |
273 |
|
for(int i=0; i<6; i++) resx[i]=*rx++; |
274 |
|
for(int i=0; i<6; i++) resy[i]=*ry++; |
275 |
|
} |
276 |
|
/** |
277 |
|
* Set the TrkTrack good measurement |
278 |
|
*/ |
279 |
|
void TrkTrack::SetGood(int *xg, int *yg){ |
280 |
|
for(int i=0; i<6; i++) xgood[i]=*xg++; |
281 |
|
for(int i=0; i<6; i++) ygood[i]=*yg++; |
282 |
|
} |
283 |
|
|
284 |
|
/** |
285 |
|
* Load the magnetic field |
286 |
|
*/ |
287 |
|
void TrkTrack::LoadField(TString path){ |
288 |
|
|
289 |
|
strcpy(path_.path,path.Data()); |
290 |
|
path_.pathlen = path.Length(); |
291 |
|
path_.error = 0; |
292 |
|
readb_(); |
293 |
|
|
294 |
|
}; |
295 |
|
|
296 |
|
/** |
297 |
|
* Method to fill minimization-routine common |
298 |
|
*/ |
299 |
|
void TrkTrack::FillMiniStruct(cMini2track& track){ |
300 |
|
|
301 |
|
for(int i=0; i<6; i++){ |
302 |
|
|
303 |
|
track.xgood[i]=xgood[i]; |
304 |
|
track.ygood[i]=ygood[i]; |
305 |
|
|
306 |
|
track.xm[i]=xm[i]; |
307 |
|
track.ym[i]=ym[i]; |
308 |
|
track.zm[i]=zm[i]; |
309 |
|
|
310 |
|
// --- temporaneo ---------------------------- |
311 |
|
// andrebbe inserita la dimensione del sensore |
312 |
|
float segment = 100.; |
313 |
|
track.xm_a[i]=xm[i]; |
314 |
|
track.xm_b[i]=xm[i]; |
315 |
|
track.ym_a[i]=ym[i]; |
316 |
|
track.ym_b[i]=ym[i]; |
317 |
|
if( xgood[i] && !ygood[i] ){ |
318 |
|
track.ym_a[i] = track.ym_a[i]+segment; |
319 |
|
track.ym_b[i] = track.ym_b[i]-segment; |
320 |
|
}else if( !xgood[i] && ygood[i]){ |
321 |
|
track.xm_a[i] = track.xm_a[i]+segment; |
322 |
|
track.xm_b[i] = track.xm_b[i]-segment; |
323 |
|
} |
324 |
|
// --- temporaneo ---------------------------- |
325 |
|
|
326 |
|
track.resx[i]=resx[i]; |
327 |
|
track.resy[i]=resy[i]; |
328 |
|
} |
329 |
|
|
330 |
|
for(int i=0; i<5; i++) track.al[i]=al[i]; |
331 |
|
track.zini = 23.5; |
332 |
|
// ZINI = 23.5 !!! it should be the same parameter in all codes |
333 |
|
|
334 |
|
} |
335 |
|
/** |
336 |
|
* Method to set values from minimization-routine common |
337 |
|
*/ |
338 |
|
void TrkTrack::SetFromMiniStruct(cMini2track *track){ |
339 |
|
|
340 |
|
for(int i=0; i<5; i++) { |
341 |
|
al[i]=track->al[i]; |
342 |
|
for(int j=0; j<5; j++) coval[i][j]=track->cov[i][j]; |
343 |
|
} |
344 |
|
chi2 = track->chi2; |
345 |
|
nstep = track->nstep; |
346 |
|
for(int i=0; i<6; i++){ |
347 |
|
xv[i] = track->xv[i]; |
348 |
|
yv[i] = track->yv[i]; |
349 |
|
zv[i] = track->zv[i]; |
350 |
|
xm[i] = track->xm[i]; |
351 |
|
ym[i] = track->ym[i]; |
352 |
|
zm[i] = track->zm[i]; |
353 |
|
axv[i] = track->axv[i]; |
354 |
|
ayv[i] = track->ayv[i]; |
355 |
|
} |
356 |
|
|
357 |
|
|
358 |
|
} |
359 |
|
/** |
360 |
|
* Tracking method. It calls F77 mini routine. |
361 |
|
*/ |
362 |
|
void TrkTrack::Fit(double pfixed, int& fail, int iprint){ |
363 |
|
|
364 |
|
float al_ini[] = {0.,0.,0.,0.,0.}; |
365 |
|
|
366 |
|
extern cMini2track track_; |
367 |
|
fail = 0; |
368 |
|
FillMiniStruct(track_); |
369 |
|
|
370 |
|
// if fit variables have been reset, evaluate the initial guess |
371 |
|
if(al[0]==-9999.&&al[1]==-9999.&&al[2]==-9999.&&al[3]==-9999.&&al[4]==-9999.)guess_(); |
372 |
|
|
373 |
|
// --------------------- free momentum |
374 |
|
if(pfixed==0.) { |
375 |
|
track_.pfixed=0.; |
376 |
|
} |
377 |
|
// --------------------- fixed momentum |
378 |
|
if(pfixed!=0.) { |
379 |
|
al[4]=1./pfixed; |
380 |
|
track_.pfixed=pfixed; |
381 |
|
} |
382 |
|
|
383 |
|
// store temporarily the initial guess |
384 |
|
for(int i=0; i<5; i++) al_ini[i]=track_.al[i]; |
385 |
|
|
386 |
|
// ------------------------------------------ |
387 |
|
// call mini routine |
388 |
|
int istep=0; |
389 |
|
int ifail=0; |
390 |
|
mini2_(&istep,&ifail, &iprint); |
391 |
|
if(ifail!=0) { |
392 |
|
if(iprint)cout << "ERROR: ifail= " << ifail << endl; |
393 |
|
fail = 1; |
394 |
|
} |
395 |
|
// ------------------------------------------ |
396 |
|
|
397 |
|
SetFromMiniStruct(&track_); |
398 |
|
// cout << endl << "eta ===> " << track_.al[4] << endl; |
399 |
|
|
400 |
|
// for(int i=0; i<5; i++) al[i]=track_.al[i]; |
401 |
|
// chi2=track_.chi2; |
402 |
|
// nstep=track_.nstep; |
403 |
|
// for(int i=0; i<6; i++) xv[i]=track_.xv[i]; |
404 |
|
// for(int i=0; i<6; i++) yv[i]=track_.yv[i]; |
405 |
|
// for(int i=0; i<6; i++) zv[i]=track_.zv[i]; |
406 |
|
// for(int i=0; i<6; i++) axv[i]=track_.axv[i]; |
407 |
|
// for(int i=0; i<6; i++) ayv[i]=track_.ayv[i]; |
408 |
|
// for(int i=0; i<5; i++) { |
409 |
|
// for(int j=0; j<5; j++) coval[i][j]=track_.cov[i][j]; |
410 |
|
// } |
411 |
|
|
412 |
|
if(fail){ |
413 |
|
if(iprint)cout << " >>>> fit failed >>>> drawing initial par"<<endl; |
414 |
|
for(int i=0; i<5; i++) al[i]=al_ini[i]; |
415 |
|
} |
416 |
|
|
417 |
|
}; |
418 |
|
/* |
419 |
|
* Reset the fit parameters |
420 |
|
*/ |
421 |
|
void TrkTrack::FitReset(){ |
422 |
|
for(int i=0; i<5; i++) al[i]=-9999.; |
423 |
|
chi2=0.; |
424 |
|
nstep=0; |
425 |
|
for(int i=0; i<6; i++) xv[i]=0.; |
426 |
|
for(int i=0; i<6; i++) yv[i]=0.; |
427 |
|
for(int i=0; i<6; i++) zv[i]=0.; |
428 |
|
for(int i=0; i<6; i++) axv[i]=0.; |
429 |
|
for(int i=0; i<6; i++) ayv[i]=0.; |
430 |
|
for(int i=0; i<5; i++) { |
431 |
|
for(int j=0; j<5; j++) coval[i][j]=0.; |
432 |
|
} |
433 |
|
} |
434 |
|
|
435 |
|
//-------------------------------------- |
436 |
|
// |
437 |
|
// |
438 |
|
//-------------------------------------- |
439 |
|
void TrkTrack::Clear(){ |
440 |
|
// cout << "TrkTrack::Clear()"<<endl; |
441 |
|
seqno = -1; |
442 |
|
image = -1; |
443 |
|
chi2 = 0; |
444 |
|
nstep = 0; |
445 |
|
for(int it1=0;it1<5;it1++){ |
446 |
|
al[it1] = 0; |
447 |
|
for(int it2=0;it2<5;it2++)coval[it1][it2] = 0; |
448 |
|
}; |
449 |
|
for(int ip=0;ip<6;ip++){ |
450 |
|
xgood[ip] = 0; |
451 |
|
ygood[ip] = 0; |
452 |
|
xm[ip] = 0; |
453 |
|
ym[ip] = 0; |
454 |
|
zm[ip] = 0; |
455 |
|
resx[ip] = 0; |
456 |
|
resy[ip] = 0; |
457 |
|
xv[ip] = 0; |
458 |
|
yv[ip] = 0; |
459 |
|
zv[ip] = 0; |
460 |
|
axv[ip] = 0; |
461 |
|
ayv[ip] = 0; |
462 |
|
dedx_x[ip] = 0; |
463 |
|
dedx_y[ip] = 0; |
464 |
|
|
465 |
|
}; |
466 |
|
if(clx)clx->Clear(); |
467 |
|
if(cly)cly->Clear(); |
468 |
|
}; |
469 |
|
//-------------------------------------- |
470 |
|
// |
471 |
|
// |
472 |
|
//-------------------------------------- |
473 |
|
void TrkTrack::Delete(){ |
474 |
|
// cout << "TrkTrack::Delete()"<<endl; |
475 |
|
// Clear(); |
476 |
|
if(clx)delete clx; |
477 |
|
if(cly)delete cly; |
478 |
|
}; |
479 |
|
//-------------------------------------- |
480 |
|
// |
481 |
|
// |
482 |
|
//-------------------------------------- |
483 |
|
|
484 |
//-------------------------------------- |
//-------------------------------------- |
485 |
// |
// |
486 |
// |
// |
487 |
//-------------------------------------- |
//-------------------------------------- |
488 |
TrkSinglet::TrkSinglet(){ |
TrkSinglet::TrkSinglet(){ |
489 |
|
// cout << "TrkSinglet::TrkSinglet() " << GetUniqueID()<<endl; |
490 |
plane = 0; |
plane = 0; |
491 |
coord[0] = 0; |
coord[0] = 0; |
492 |
coord[1] = 0; |
coord[1] = 0; |
493 |
sgnl = 0; |
sgnl = 0; |
494 |
|
// cls = 0; |
495 |
}; |
}; |
496 |
//-------------------------------------- |
//-------------------------------------- |
497 |
// |
// |
498 |
// |
// |
499 |
//-------------------------------------- |
//-------------------------------------- |
500 |
TrkSinglet::TrkSinglet(const TrkSinglet& s){ |
TrkSinglet::TrkSinglet(const TrkSinglet& s){ |
501 |
|
// cout << "TrkSinglet::TrkSinglet(const TrkSinglet& s) " << GetUniqueID()<<endl; |
502 |
plane = s.plane; |
plane = s.plane; |
503 |
coord[0] = s.coord[0]; |
coord[0] = s.coord[0]; |
504 |
coord[1] = s.coord[1]; |
coord[1] = s.coord[1]; |
505 |
sgnl = s.sgnl; |
sgnl = s.sgnl; |
506 |
|
// cls = 0;//<<<<pointer |
507 |
|
cls = TRef(s.cls); |
508 |
}; |
}; |
509 |
//-------------------------------------- |
//-------------------------------------- |
510 |
// |
// |
521 |
// |
// |
522 |
// |
// |
523 |
//-------------------------------------- |
//-------------------------------------- |
524 |
|
void TrkSinglet::Clear(){ |
525 |
|
// cout << "TrkSinglet::Clear() " << GetUniqueID()<<endl; |
526 |
|
// cls=0; |
527 |
|
plane=-1; |
528 |
|
coord[0]=-999; |
529 |
|
coord[1]=-999; |
530 |
|
sgnl=0; |
531 |
|
|
532 |
|
} |
533 |
|
//-------------------------------------- |
534 |
|
// |
535 |
|
// |
536 |
|
//-------------------------------------- |
537 |
TrkLevel2::TrkLevel2(){ |
TrkLevel2::TrkLevel2(){ |
538 |
good2 = -1; |
cout <<"TrkLevel2::TrkLevel2()"<<endl; |
539 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
540 |
crc[i] = -1; |
good[i] = -1; |
541 |
}; |
}; |
542 |
Track = new TClonesArray("TrkTrack"); |
// okkio!! memory-leak |
543 |
SingletX = new TClonesArray("TrkSinglet"); |
// Track = new TClonesArray("TrkTrack"); |
544 |
SingletY = new TClonesArray("TrkSinglet"); |
// SingletX = new TClonesArray("TrkSinglet"); |
545 |
|
// SingletY = new TClonesArray("TrkSinglet"); |
546 |
|
Track = 0; |
547 |
|
SingletX = 0; |
548 |
|
SingletY = 0; |
549 |
|
|
550 |
// PhysicalTrack = new TClonesArray("TrkTrack"); |
} |
551 |
//sostituire con TRefArray... appena ho capito come si usa |
//-------------------------------------- |
552 |
|
// |
553 |
|
// |
554 |
|
//-------------------------------------- |
555 |
|
void TrkLevel2::Set(){ |
556 |
|
if(!Track)Track = new TClonesArray("TrkTrack"); |
557 |
|
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
558 |
|
if(!SingletY)SingletY = new TClonesArray("TrkSinglet"); |
559 |
} |
} |
560 |
//-------------------------------------- |
//-------------------------------------- |
561 |
// |
// |
562 |
// |
// |
563 |
//-------------------------------------- |
//-------------------------------------- |
564 |
void TrkLevel2::Dump(){ |
void TrkLevel2::Dump(){ |
565 |
TClonesArray &t = *Track; |
|
566 |
TClonesArray &sx = *SingletX; |
// |
|
TClonesArray &sy = *SingletY; |
|
|
|
|
567 |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
568 |
cout << endl << "good2 : " << good2; |
cout << endl << "good : "; for(int i=0; i<12; i++) cout << good[i]<<" "; |
|
cout << endl << "crc : "; for(int i=0; i<12; i++) cout << crc[i]; |
|
569 |
cout << endl << "ntrk() : " << this->ntrk() ; |
cout << endl << "ntrk() : " << this->ntrk() ; |
570 |
cout << endl << "nclsx() : " << this->nclsx(); |
cout << endl << "nclsx() : " << this->nclsx(); |
571 |
cout << endl << "nclsy() : " << this->nclsy(); |
cout << endl << "nclsy() : " << this->nclsy(); |
572 |
for(int i=0; i<this->ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
// TClonesArray &t = *Track; |
573 |
for(int i=0; i<this->nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
// TClonesArray &sx = *SingletX; |
574 |
for(int i=0; i<this->nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
// TClonesArray &sy = *SingletY; |
575 |
|
// for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
576 |
|
// for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
577 |
|
// for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
578 |
|
if(Track){ |
579 |
|
TClonesArray &t = *Track; |
580 |
|
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
581 |
|
} |
582 |
|
if(SingletX){ |
583 |
|
TClonesArray &sx = *SingletX; |
584 |
|
for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
585 |
|
} |
586 |
|
if(SingletY){ |
587 |
|
TClonesArray &sy = *SingletY; |
588 |
|
for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
589 |
|
} |
590 |
} |
} |
591 |
//-------------------------------------- |
//-------------------------------------- |
592 |
// |
// |
596 |
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
597 |
*/ |
*/ |
598 |
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2){ |
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2){ |
599 |
// |
|
600 |
// Track = new TClonesArray("TrkTrack"); |
// temporary objects: |
|
// SingletX = new TClonesArray("TrkSinglet"); |
|
|
// SingletY = new TClonesArray("TrkSinglet"); |
|
|
// temporary objects: |
|
601 |
TrkSinglet* t_singlet = new TrkSinglet(); |
TrkSinglet* t_singlet = new TrkSinglet(); |
602 |
TrkTrack* t_track = new TrkTrack(); |
TrkTrack* t_track = new TrkTrack(); |
603 |
// general variables |
|
604 |
good2 = l2->good2; |
// **** general variables **** |
605 |
|
// good2 = l2->good2; |
606 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
607 |
crc[i] = l2->crc[i]; |
// crc[i] = l2->crc[i]; |
608 |
}; |
good[i] = l2->good[i]; |
609 |
// *** TRACKS *** |
}; |
610 |
|
// *** TRACKS *** |
611 |
|
if(!Track) Track = new TClonesArray("TrkTrack"); |
612 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
613 |
for(int i=0; i<l2->ntrk; i++){ |
for(int i=0; i<l2->ntrk; i++){ |
614 |
t_track->seqno = i; |
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
615 |
t_track->image = l2->image[i]-1; |
t_track->image = l2->image[i]-1; |
616 |
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
617 |
t_track->chi2 = l2->chi2_nt[i]; |
t_track->chi2 = l2->chi2_nt[i]; |
618 |
|
t_track->nstep = l2->nstep_nt[i]; |
619 |
for(int it1=0;it1<5;it1++){ |
for(int it1=0;it1<5;it1++){ |
620 |
t_track->al[it1] = l2->al_nt[i][it1]; |
t_track->al[it1] = l2->al_nt[i][it1]; |
621 |
for(int it2=0;it2<5;it2++) |
for(int it2=0;it2<5;it2++) |
636 |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
637 |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
638 |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
639 |
|
// t_track->clx[ip] = 0; |
640 |
|
// t_track->cly[ip] = 0; |
641 |
}; |
}; |
642 |
new(t[i]) TrkTrack(*t_track); |
new(t[i]) TrkTrack(*t_track); |
643 |
t_track->Clear(); |
t_track->Clear(); |
644 |
}; |
}; |
645 |
// *** SINGLETS *** |
// *** SINGLETS *** |
646 |
|
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
647 |
TClonesArray &sx = *SingletX; |
TClonesArray &sx = *SingletX; |
648 |
for(int i=0; i<l2->nclsx; i++){ |
for(int i=0; i<l2->nclsx; i++){ |
649 |
t_singlet->plane = l2->planex[i]; |
t_singlet->plane = l2->planex[i]; |
650 |
t_singlet->coord[0] = l2->xs[i][0]; |
t_singlet->coord[0] = l2->xs[i][0]; |
651 |
t_singlet->coord[1] = l2->xs[i][1]; |
t_singlet->coord[1] = l2->xs[i][1]; |
652 |
t_singlet->sgnl = l2->signlxs[i]; |
t_singlet->sgnl = l2->signlxs[i]; |
653 |
|
// t_singlet->cls = 0; |
654 |
new(sx[i]) TrkSinglet(*t_singlet); |
new(sx[i]) TrkSinglet(*t_singlet); |
655 |
t_singlet->Clear(); |
t_singlet->Clear(); |
656 |
} |
} |
657 |
|
if(!SingletY)SingletY = new TClonesArray("TrkSinglet"); |
658 |
TClonesArray &sy = *SingletY; |
TClonesArray &sy = *SingletY; |
659 |
for(int i=0; i<l2->nclsy; i++){ |
for(int i=0; i<l2->nclsy; i++){ |
660 |
t_singlet->plane = l2->planey[i]; |
t_singlet->plane = l2->planey[i]; |
661 |
t_singlet->coord[0] = l2->ys[i][0]; |
t_singlet->coord[0] = l2->ys[i][0]; |
662 |
t_singlet->coord[1] = l2->ys[i][1]; |
t_singlet->coord[1] = l2->ys[i][1]; |
663 |
t_singlet->sgnl = l2->signlys[i]; |
t_singlet->sgnl = l2->signlys[i]; |
664 |
|
// t_singlet->cls = 0; |
665 |
new(sy[i]) TrkSinglet(*t_singlet); |
new(sy[i]) TrkSinglet(*t_singlet); |
666 |
t_singlet->Clear(); |
t_singlet->Clear(); |
667 |
|
}; |
668 |
|
|
669 |
|
delete t_track; |
670 |
|
delete t_singlet; |
671 |
|
} |
672 |
|
//-------------------------------------- |
673 |
|
// |
674 |
|
// |
675 |
|
//-------------------------------------- |
676 |
|
/** |
677 |
|
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
678 |
|
* Ref to Level1 data (clusters) is also set. |
679 |
|
*/ |
680 |
|
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2, TrkLevel1 *l1){ |
681 |
|
|
682 |
|
// temporary objects: |
683 |
|
TrkSinglet* t_singlet = new TrkSinglet(); |
684 |
|
TrkTrack* t_track = new TrkTrack(); |
685 |
|
// general variables |
686 |
|
// good2 = l2->good2; |
687 |
|
for(Int_t i=0; i<12 ; i++){ |
688 |
|
// crc[i] = l2->crc[i]; |
689 |
|
good[i] = l2->good[i]; |
690 |
|
}; |
691 |
|
// *** TRACKS *** |
692 |
|
if(!Track) Track = new TClonesArray("TrkTrack"); |
693 |
|
TClonesArray &t = *Track; |
694 |
|
if(!t_track->clx)t_track->clx = new TRefArray(6,0); |
695 |
|
if(!t_track->cly)t_track->cly = new TRefArray(6,0); |
696 |
|
for(int i=0; i<l2->ntrk; i++){ |
697 |
|
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
698 |
|
t_track->image = l2->image[i]-1; |
699 |
|
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
700 |
|
t_track->chi2 = l2->chi2_nt[i]; |
701 |
|
t_track->nstep = l2->nstep_nt[i]; |
702 |
|
for(int it1=0;it1<5;it1++){ |
703 |
|
t_track->al[it1] = l2->al_nt[i][it1]; |
704 |
|
for(int it2=0;it2<5;it2++) |
705 |
|
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
706 |
|
}; |
707 |
|
for(int ip=0;ip<6;ip++){ |
708 |
|
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
709 |
|
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
710 |
|
t_track->xm[ip] = l2->xm_nt[i][ip]; |
711 |
|
t_track->ym[ip] = l2->ym_nt[i][ip]; |
712 |
|
t_track->zm[ip] = l2->zm_nt[i][ip]; |
713 |
|
t_track->resx[ip] = l2->resx_nt[i][ip]; |
714 |
|
t_track->resy[ip] = l2->resy_nt[i][ip]; |
715 |
|
t_track->xv[ip] = l2->xv_nt[i][ip]; |
716 |
|
t_track->yv[ip] = l2->yv_nt[i][ip]; |
717 |
|
t_track->zv[ip] = l2->zv_nt[i][ip]; |
718 |
|
t_track->axv[ip] = l2->axv_nt[i][ip]; |
719 |
|
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
720 |
|
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
721 |
|
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
722 |
|
// cout << "traccia "<<i<<" -- "<< ip << " "<< l2->cltrx[i][ip] <<" "<< l2->cltry[i][ip] <<" "<< t_track->xgood[ip] << t_track->ygood[ip]<<endl; |
723 |
|
//----------------------------------------------------- |
724 |
|
//----------------------------------------------------- |
725 |
|
if(t_track->xgood[ip])t_track->clx->AddAt(l1->GetCluster(l2->cltrx[i][ip]-1),ip); |
726 |
|
if(t_track->ygood[ip])t_track->cly->AddAt(l1->GetCluster(l2->cltry[i][ip]-1),ip); |
727 |
|
// if(t_track->ygood[ip])cout<<" i "<<i<<" ip "<<ip<<" l2->cltry[i][ip] "<<l2->cltry[i][ip]<< " l1->GetCluster(l2->cltry[i][ip]-1) "<<l1->GetCluster(l2->cltry[i][ip]-1)<<endl; |
728 |
|
// if(t_track->xgood[ip])cout<<" i "<<i<<" ip "<<ip<<" l2->cltrx[i][ip] "<<l2->cltrx[i][ip]<< " l1->GetCluster(l2->cltrx[i][ip]-1) "<<l1->GetCluster(l2->cltrx[i][ip]-1)<<endl; |
729 |
|
//----------------------------------------------------- |
730 |
|
//----------------------------------------------------- |
731 |
|
}; |
732 |
|
new(t[i]) TrkTrack(*t_track); |
733 |
|
t_track->Clear(); |
734 |
|
}; |
735 |
|
// *** SINGLETS *** |
736 |
|
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
737 |
|
TClonesArray &sx = *SingletX; |
738 |
|
for(int i=0; i<l2->nclsx; i++){ |
739 |
|
t_singlet->plane = l2->planex[i]; |
740 |
|
t_singlet->coord[0] = l2->xs[i][0]; |
741 |
|
t_singlet->coord[1] = l2->xs[i][1]; |
742 |
|
t_singlet->sgnl = l2->signlxs[i]; |
743 |
|
//----------------------------------------------------- |
744 |
|
// cout << "singolo x "<<i<<" -- "<< l2->clsx[i] <<endl; |
745 |
|
t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
746 |
|
// cout<<" i "<<i<<" l2->clsx[i] "<<l2->clsx[i]<< " l1->GetCluster(l2->clsx[i]-1) "<<l1->GetCluster(l2->clsx[i]-1)<<endl; |
747 |
|
//----------------------------------------------------- |
748 |
|
new(sx[i]) TrkSinglet(*t_singlet); |
749 |
|
t_singlet->Clear(); |
750 |
|
} |
751 |
|
if(!SingletY)SingletY = new TClonesArray("TrkSinglet"); |
752 |
|
TClonesArray &sy = *SingletY; |
753 |
|
for(int i=0; i<l2->nclsy; i++){ |
754 |
|
t_singlet->plane = l2->planey[i]; |
755 |
|
t_singlet->coord[0] = l2->ys[i][0]; |
756 |
|
t_singlet->coord[1] = l2->ys[i][1]; |
757 |
|
t_singlet->sgnl = l2->signlys[i]; |
758 |
|
//----------------------------------------------------- |
759 |
|
// cout << "singolo y "<<i<<" -- "<< l2->clsy[i] <<endl; |
760 |
|
t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
761 |
|
// cout<<" i "<<i<<" l2->clsy[i] "<<l2->clsy[i]<< " l1->GetCluster(l2->clsy[i]-1) "<<l1->GetCluster(l2->clsy[i]-1)<<endl; |
762 |
|
//----------------------------------------------------- |
763 |
|
new(sy[i]) TrkSinglet(*t_singlet); |
764 |
|
t_singlet->Clear(); |
765 |
}; |
}; |
766 |
|
|
767 |
delete t_track; |
delete t_track; |
774 |
void TrkLevel2::GetLevel2Struct(cTrkLevel2 *l2) const { |
void TrkLevel2::GetLevel2Struct(cTrkLevel2 *l2) const { |
775 |
|
|
776 |
// general variables |
// general variables |
777 |
l2->good2 = good2 ; |
// l2->good2 = good2 ; |
778 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
779 |
l2->crc[i] = crc[i]; |
// l2->crc[i] = crc[i]; |
780 |
|
l2->good[i] = good[i]; |
781 |
}; |
}; |
782 |
// *** TRACKS *** |
// *** TRACKS *** |
783 |
|
|
784 |
l2->ntrk = Track->GetEntries(); |
if(Track){ |
785 |
for(Int_t i=0;i<l2->ntrk;i++){ |
l2->ntrk = Track->GetEntries(); |
786 |
l2->image[i] = 1 + ((TrkTrack *)Track->At(i))->image; |
for(Int_t i=0;i<l2->ntrk;i++){ |
787 |
l2->chi2_nt[i] = ((TrkTrack *)Track->At(i))->chi2; |
l2->image[i] = 1 + ((TrkTrack *)Track->At(i))->image; |
788 |
for(int it1=0;it1<5;it1++){ |
l2->chi2_nt[i] = ((TrkTrack *)Track->At(i))->chi2; |
789 |
l2->al_nt[i][it1] = ((TrkTrack *)Track->At(i))->al[it1]; |
l2->nstep_nt[i] = ((TrkTrack *)Track->At(i))->nstep; |
790 |
for(int it2=0;it2<5;it2++) |
for(int it1=0;it1<5;it1++){ |
791 |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
l2->al_nt[i][it1] = ((TrkTrack *)Track->At(i))->al[it1]; |
792 |
}; |
for(int it2=0;it2<5;it2++) |
793 |
for(int ip=0;ip<6;ip++){ |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
794 |
l2->xgood_nt[i][ip] = ((TrkTrack *)Track->At(i))->xgood[ip]; |
}; |
795 |
l2->ygood_nt[i][ip] = ((TrkTrack *)Track->At(i))->ygood[ip]; |
for(int ip=0;ip<6;ip++){ |
796 |
l2->xm_nt[i][ip] = ((TrkTrack *)Track->At(i))->xm[ip]; |
l2->xgood_nt[i][ip] = ((TrkTrack *)Track->At(i))->xgood[ip]; |
797 |
l2->ym_nt[i][ip] = ((TrkTrack *)Track->At(i))->ym[ip]; |
l2->ygood_nt[i][ip] = ((TrkTrack *)Track->At(i))->ygood[ip]; |
798 |
l2->zm_nt[i][ip] = ((TrkTrack *)Track->At(i))->zm[ip]; |
l2->xm_nt[i][ip] = ((TrkTrack *)Track->At(i))->xm[ip]; |
799 |
l2->resx_nt[i][ip] = ((TrkTrack *)Track->At(i))->resx[ip]; |
l2->ym_nt[i][ip] = ((TrkTrack *)Track->At(i))->ym[ip]; |
800 |
l2->resy_nt[i][ip] = ((TrkTrack *)Track->At(i))->resy[ip]; |
l2->zm_nt[i][ip] = ((TrkTrack *)Track->At(i))->zm[ip]; |
801 |
l2->xv_nt[i][ip] = ((TrkTrack *)Track->At(i))->xv[ip]; |
l2->resx_nt[i][ip] = ((TrkTrack *)Track->At(i))->resx[ip]; |
802 |
l2->yv_nt[i][ip] = ((TrkTrack *)Track->At(i))->yv[ip]; |
l2->resy_nt[i][ip] = ((TrkTrack *)Track->At(i))->resy[ip]; |
803 |
l2->zv_nt[i][ip] = ((TrkTrack *)Track->At(i))->zv[ip]; |
l2->xv_nt[i][ip] = ((TrkTrack *)Track->At(i))->xv[ip]; |
804 |
l2->axv_nt[i][ip] = ((TrkTrack *)Track->At(i))->axv[ip]; |
l2->yv_nt[i][ip] = ((TrkTrack *)Track->At(i))->yv[ip]; |
805 |
l2->ayv_nt[i][ip] = ((TrkTrack *)Track->At(i))->ayv[ip]; |
l2->zv_nt[i][ip] = ((TrkTrack *)Track->At(i))->zv[ip]; |
806 |
l2->dedx_x[i][ip] = ((TrkTrack *)Track->At(i))->dedx_x[ip]; |
l2->axv_nt[i][ip] = ((TrkTrack *)Track->At(i))->axv[ip]; |
807 |
l2->dedx_y[i][ip] = ((TrkTrack *)Track->At(i))->dedx_y[ip]; |
l2->ayv_nt[i][ip] = ((TrkTrack *)Track->At(i))->ayv[ip]; |
808 |
}; |
l2->dedx_x[i][ip] = ((TrkTrack *)Track->At(i))->dedx_x[ip]; |
809 |
|
l2->dedx_y[i][ip] = ((TrkTrack *)Track->At(i))->dedx_y[ip]; |
810 |
|
}; |
811 |
|
} |
812 |
} |
} |
|
|
|
813 |
// *** SINGLETS *** |
// *** SINGLETS *** |
814 |
l2->nclsx = SingletX->GetEntries(); |
if(SingletX){ |
815 |
for(Int_t i=0;i<l2->nclsx;i++){ |
l2->nclsx = SingletX->GetEntries(); |
816 |
l2->planex[i] = ((TrkSinglet *)SingletX->At(i))->plane; |
for(Int_t i=0;i<l2->nclsx;i++){ |
817 |
l2->xs[i][0] = ((TrkSinglet *)SingletX->At(i))->coord[0]; |
l2->planex[i] = ((TrkSinglet *)SingletX->At(i))->plane; |
818 |
l2->xs[i][1] = ((TrkSinglet *)SingletX->At(i))->coord[1]; |
l2->xs[i][0] = ((TrkSinglet *)SingletX->At(i))->coord[0]; |
819 |
l2->signlxs[i] = ((TrkSinglet *)SingletX->At(i))->sgnl; |
l2->xs[i][1] = ((TrkSinglet *)SingletX->At(i))->coord[1]; |
820 |
} |
l2->signlxs[i] = ((TrkSinglet *)SingletX->At(i))->sgnl; |
821 |
l2->nclsy = SingletY->GetEntries(); |
} |
822 |
for(Int_t i=0;i<l2->nclsy;i++){ |
} |
823 |
l2->planey[i] = ((TrkSinglet *)SingletY->At(i))->plane; |
|
824 |
l2->ys[i][0] = ((TrkSinglet *)SingletY->At(i))->coord[0]; |
if(SingletY){ |
825 |
l2->ys[i][1] = ((TrkSinglet *)SingletY->At(i))->coord[1]; |
l2->nclsy = SingletY->GetEntries(); |
826 |
l2->signlys[i] = ((TrkSinglet *)SingletY->At(i))->sgnl; |
for(Int_t i=0;i<l2->nclsy;i++){ |
827 |
|
l2->planey[i] = ((TrkSinglet *)SingletY->At(i))->plane; |
828 |
|
l2->ys[i][0] = ((TrkSinglet *)SingletY->At(i))->coord[0]; |
829 |
|
l2->ys[i][1] = ((TrkSinglet *)SingletY->At(i))->coord[1]; |
830 |
|
l2->signlys[i] = ((TrkSinglet *)SingletY->At(i))->sgnl; |
831 |
|
} |
832 |
} |
} |
833 |
} |
} |
834 |
//-------------------------------------- |
//-------------------------------------- |
836 |
// |
// |
837 |
//-------------------------------------- |
//-------------------------------------- |
838 |
void TrkLevel2::Clear(){ |
void TrkLevel2::Clear(){ |
|
good2 = -1; |
|
839 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
840 |
crc[i] = -1; |
good[i] = -1; |
841 |
}; |
}; |
842 |
/* Track->RemoveAll(); |
// if(Track)Track->Clear("C"); |
843 |
SingletX->RemoveAll(); |
// if(SingletX)SingletX->Clear("C"); |
844 |
SingletY->RemoveAll();*/ |
// if(SingletY)SingletY->Clear("C"); |
845 |
// modify to avoid memory leakage |
if(Track)Track->Delete(); |
846 |
Track->Clear(); |
if(SingletX)SingletX->Delete(); |
847 |
SingletX->Clear(); |
if(SingletY)SingletY->Delete(); |
848 |
SingletY->Clear(); |
} |
849 |
|
// //-------------------------------------- |
850 |
|
// // |
851 |
|
// // |
852 |
|
// //-------------------------------------- |
853 |
|
void TrkLevel2::Delete(){ |
854 |
|
|
855 |
|
// cout << "void TrkLevel2::Delete()"<<endl; |
856 |
|
Clear(); |
857 |
|
if(Track)delete Track; |
858 |
|
if(SingletX)delete SingletX; |
859 |
|
if(SingletY)delete SingletY; |
860 |
|
|
861 |
} |
} |
862 |
//-------------------------------------- |
//-------------------------------------- |
863 |
// |
// |
867 |
* Sort physical tracks and stores them in a TObjectArray, ordering by increasing chi**2 value (in case of track image, it selects the one with lower chi**2). The total number of physical tracks is given by GetNTracks() and the it-th physical track can be retrieved by means of the method GetTrack(int it). |
* Sort physical tracks and stores them in a TObjectArray, ordering by increasing chi**2 value (in case of track image, it selects the one with lower chi**2). The total number of physical tracks is given by GetNTracks() and the it-th physical track can be retrieved by means of the method GetTrack(int it). |
868 |
* This method is overridden by PamLevel2::GetTracks(), where calorimeter and TOF information is used. |
* This method is overridden by PamLevel2::GetTracks(), where calorimeter and TOF information is used. |
869 |
*/ |
*/ |
870 |
// TClonesArray *TrkLevel2::GetTracks(){ |
TRefArray *TrkLevel2::GetTracks_NFitSorted(){ |
|
// TClonesArray *sorted = GetTracks_NFitSorted(); |
|
|
// return sorted; |
|
|
// }; |
|
871 |
|
|
872 |
/*TClonesArray *TrkLevel2::GetTracks_Chi2Sorted(){ |
if(!Track)return 0; |
873 |
|
|
874 |
TClonesArray *sorted = new TClonesArray("TrkTrack"); |
TRefArray *sorted = new TRefArray(); |
875 |
TClonesArray &t = *Track; |
|
876 |
TClonesArray &ts = *sorted; |
TClonesArray &t = *Track; |
877 |
int N=this->ntrk(); |
// TClonesArray &ts = *PhysicalTrack; |
878 |
|
int N = ntrk(); |
879 |
vector<int> m(N); for(int i=0; i<N; i++)m[i]=1; |
vector<int> m(N); for(int i=0; i<N; i++)m[i]=1; |
880 |
|
// int m[50]; for(int i=0; i<N; i++)m[i]=1; |
881 |
|
|
882 |
int indo=0; |
int indo=0; |
883 |
int indi=0; |
int indi=0; |
884 |
while(N != 0){ |
while(N != 0){ |
885 |
float chi2ref=1000000; |
int nfit =0; |
886 |
|
float chi2ref = numeric_limits<float>::max(); |
887 |
|
|
888 |
|
// first loop to search maximum num. of fit points |
889 |
|
for(int i=0; i < ntrk(); i++){ |
890 |
|
if( ((TrkTrack *)t[i])->GetNtot() >= nfit && m[i]==1){ |
891 |
|
nfit = ((TrkTrack *)t[i])->GetNtot(); |
892 |
|
} |
893 |
|
} |
894 |
|
//second loop to search minimum chi2 among selected |
895 |
for(int i=0; i<this->ntrk(); i++){ |
for(int i=0; i<this->ntrk(); i++){ |
896 |
if(((TrkTrack *)t[i])->chi2 < chi2ref && m[i]==1){ |
Float_t chi2 = ((TrkTrack *)t[i])->chi2; |
897 |
|
if(chi2 < 0) chi2 = chi2*1000; |
898 |
|
if( chi2 < chi2ref |
899 |
|
&& ((TrkTrack *)t[i])->GetNtot() == nfit |
900 |
|
&& m[i]==1){ |
901 |
chi2ref = ((TrkTrack *)t[i])->chi2; |
chi2ref = ((TrkTrack *)t[i])->chi2; |
902 |
indi = i; |
indi = i; |
903 |
} |
}; |
904 |
} |
}; |
905 |
if( ((TrkTrack *)t[indi])->image != -1 ){ |
if( ((TrkTrack *)t[indi])->HasImage() ){ |
906 |
m[((TrkTrack *)t[indi])->image] = 0; |
m[((TrkTrack *)t[indi])->image] = 0; |
907 |
N--; |
N--; |
908 |
} |
|
909 |
new(ts[indo]) TrkTrack(*(TrkTrack*)t[indi]); |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
910 |
|
}; |
911 |
|
sorted->Add( (TrkTrack*)t[indi] ); |
912 |
|
|
913 |
m[indi] = 0; |
m[indi] = 0; |
914 |
|
// cout << "SORTED "<< indo << " "<< indi << " "<< N << endl; |
915 |
N--; |
N--; |
916 |
indo++; |
indo++; |
917 |
} |
} |
918 |
return sorted; |
m.clear(); |
|
}*/ |
|
|
/*TClonesArray *TrkLevel2::GetTracks_NFitSorted(){ |
|
|
|
|
|
TClonesArray *sorted = new TClonesArray("TrkTrack"); |
|
|
TClonesArray &t = *Track; |
|
|
TClonesArray &ts = *sorted; |
|
|
// TClonesArray &ts = *PhysicalTrack; |
|
|
int N = ntrk(); |
|
|
vector<int> m(N); for(int i=0; i<N; i++)m[i]=1; |
|
|
// int m[50]; for(int i=0; i<N; i++)m[i]=1; |
|
|
|
|
|
int indo=0; |
|
|
int indi=0; |
|
|
while(N != 0){ |
|
|
int nfit =0; |
|
|
float chi2ref = numeric_limits<float>::max(); |
|
|
// first loop to search maximum num. of fit points |
|
|
for(int i=0; i < ntrk(); i++){ |
|
|
// if(N==ntrk())cout << "** "<<i<< " " << ((TrkTrack *)t[i])->GetImageSeqNo()<< " " <<((TrkTrack *)t[i])->GetNtot() << " " <<((TrkTrack *)t[i])->chi2 << endl; |
|
|
if( ((TrkTrack *)t[i])->GetNtot() >= nfit && m[i]==1){ |
|
|
nfit = ((TrkTrack *)t[i])->GetNtot(); |
|
|
} |
|
|
} |
|
|
//second loop to search minimum chi2 among selected |
|
|
for(int i=0; i<this->ntrk(); i++){ |
|
|
if( ((TrkTrack *)t[i])->chi2 < chi2ref |
|
|
&& ((TrkTrack *)t[i])->GetNtot()== nfit |
|
|
&& m[i]==1){ |
|
|
chi2ref = ((TrkTrack *)t[i])->chi2; |
|
|
indi = i; |
|
|
// cout << "2** "<<i<< " " << nfit <<" "<<chi2ref<<endl; |
|
|
} |
|
|
} |
|
|
if( ((TrkTrack *)t[indi])->HasImage() ){ |
|
|
m[((TrkTrack *)t[indi])->image] = 0; |
|
|
N--; |
|
|
|
|
|
// Int_t nfiti=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->GetNtot(); |
|
|
// Float_t chi2i=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->chi2; |
|
|
|
|
|
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
|
|
} |
|
|
new(ts[indo]) TrkTrack(*(TrkTrack*)t[indi]); |
|
|
m[indi] = 0; |
|
|
// cout << "SORTED "<< indo << " "<< indi << " "<< N << endl; |
|
|
N--; |
|
|
indo++; |
|
|
} |
|
|
m.clear(); |
|
|
return sorted; |
|
|
// return PhysicalTrack; |
|
|
}*/ |
|
|
//TClonesArray *TrkLevel2::GetTracks_NFitSorted(){ |
|
|
TRefArray *TrkLevel2::GetTracks_NFitSorted(){ |
|
|
|
|
|
// cout << "GetTracks_NFitSorted(it): new TRefArray()"<< endl; |
|
|
// TClonesArray *sorted = new TClonesArray("TrkTrack"); |
|
|
// TClonesArray &ts = *sorted; |
|
|
TRefArray *sorted = new TRefArray(); |
|
|
|
|
|
TClonesArray &t = *Track; |
|
|
// TClonesArray &ts = *PhysicalTrack; |
|
|
int N = ntrk(); |
|
|
vector<int> m(N); for(int i=0; i<N; i++)m[i]=1; |
|
|
// int m[50]; for(int i=0; i<N; i++)m[i]=1; |
|
|
|
|
|
int indo=0; |
|
|
int indi=0; |
|
|
while(N != 0){ |
|
|
int nfit =0; |
|
|
float chi2ref = numeric_limits<float>::max(); |
|
|
// first loop to search maximum num. of fit points |
|
|
for(int i=0; i < ntrk(); i++){ |
|
|
// if(N==ntrk())cout << "** "<<i<< " " << ((TrkTrack *)t[i])->GetImageSeqNo()<< " " <<((TrkTrack *)t[i])->GetNtot() << " " <<((TrkTrack *)t[i])->chi2 << endl; |
|
|
if( ((TrkTrack *)t[i])->GetNtot() >= nfit && m[i]==1){ |
|
|
nfit = ((TrkTrack *)t[i])->GetNtot(); |
|
|
} |
|
|
} |
|
|
//second loop to search minimum chi2 among selected |
|
|
for(int i=0; i<this->ntrk(); i++){ |
|
|
if( ((TrkTrack *)t[i])->chi2 < chi2ref |
|
|
&& ((TrkTrack *)t[i])->GetNtot()== nfit |
|
|
&& m[i]==1){ |
|
|
chi2ref = ((TrkTrack *)t[i])->chi2; |
|
|
indi = i; |
|
|
// cout << "2** "<<i<< " " << nfit <<" "<<chi2ref<<endl; |
|
|
} |
|
|
} |
|
|
if( ((TrkTrack *)t[indi])->HasImage() ){ |
|
|
m[((TrkTrack *)t[indi])->image] = 0; |
|
|
N--; |
|
|
|
|
|
// Int_t nfiti=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->GetNtot(); |
|
|
// Float_t chi2i=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->chi2; |
|
|
|
|
|
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
|
|
} |
|
|
// new(ts[indo]) TrkTrack(*(TrkTrack*)t[indi]); |
|
|
// cout << "GetTracks_NFitSorted(it): Add("<<indo<<")"<< endl; |
|
|
sorted->Add( (TrkTrack*)t[indi] ); |
|
|
|
|
|
m[indi] = 0; |
|
|
// cout << "SORTED "<< indo << " "<< indi << " "<< N << endl; |
|
|
N--; |
|
|
indo++; |
|
|
} |
|
|
m.clear(); |
|
919 |
// cout << "GetTracks_NFitSorted(it): Done"<< endl; |
// cout << "GetTracks_NFitSorted(it): Done"<< endl; |
920 |
|
|
921 |
return sorted; |
return sorted; |
922 |
// return PhysicalTrack; |
// return PhysicalTrack; |
923 |
} |
} |
924 |
//-------------------------------------- |
//-------------------------------------- |
937 |
cout << " Stored tracks ntrk() = "<< this->ntrk() << endl; |
cout << " Stored tracks ntrk() = "<< this->ntrk() << endl; |
938 |
return 0; |
return 0; |
939 |
} |
} |
940 |
|
if(!Track){ |
941 |
|
cout << "TrkTrack *TrkLevel2::GetStoredTrack(int is) >> (TClonesArray*) Track ==0 "<<endl; |
942 |
|
}; |
943 |
TClonesArray &t = *(Track); |
TClonesArray &t = *(Track); |
944 |
TrkTrack *track = (TrkTrack*)t[is]; |
TrkTrack *track = (TrkTrack*)t[is]; |
945 |
return track; |
return track; |
959 |
cout << " Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
cout << " Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
960 |
return 0; |
return 0; |
961 |
} |
} |
962 |
|
if(!SingletX)return 0; |
963 |
TClonesArray &t = *(SingletX); |
TClonesArray &t = *(SingletX); |
964 |
TrkSinglet *singlet = (TrkSinglet*)t[is]; |
TrkSinglet *singlet = (TrkSinglet*)t[is]; |
965 |
return singlet; |
return singlet; |
979 |
cout << " Stored y-singlets nclsy() = "<< this->nclsx() << endl; |
cout << " Stored y-singlets nclsy() = "<< this->nclsx() << endl; |
980 |
return 0; |
return 0; |
981 |
} |
} |
982 |
|
if(!SingletY)return 0; |
983 |
TClonesArray &t = *(SingletY); |
TClonesArray &t = *(SingletY); |
984 |
TrkSinglet *singlet = (TrkSinglet*)t[is]; |
TrkSinglet *singlet = (TrkSinglet*)t[is]; |
985 |
return singlet; |
return singlet; |
992 |
* Retrieves the it-th "physical" track, sorted by the method GetNTracks(). |
* Retrieves the it-th "physical" track, sorted by the method GetNTracks(). |
993 |
* @param it Track number, ranging from 0 to GetNTracks(). |
* @param it Track number, ranging from 0 to GetNTracks(). |
994 |
*/ |
*/ |
995 |
/*TrkTrack *TrkLevel2::GetTrack(int it){ |
|
|
|
|
|
if(it >= this->GetNTracks()){ |
|
|
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
|
|
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
|
|
return 0; |
|
|
} |
|
|
TClonesArray* sorted = GetTracks(); |
|
|
TClonesArray &ts = *sorted; |
|
|
|
|
|
// TrkTrack *track = (TrkTrack*)ts[it]; |
|
|
TrkTrack *track = new TrkTrack( *(TrkTrack*)ts[it] ); //copia |
|
|
sorted->Delete("all");////TEMPORANEO |
|
|
return track; |
|
|
}*/ |
|
996 |
TrkTrack *TrkLevel2::GetTrack(int it){ |
TrkTrack *TrkLevel2::GetTrack(int it){ |
997 |
|
|
998 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
1002 |
} |
} |
1003 |
|
|
1004 |
TRefArray *sorted = GetTracks(); //TEMPORANEO |
TRefArray *sorted = GetTracks(); //TEMPORANEO |
1005 |
|
if(!sorted)return 0; |
1006 |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
1007 |
sorted->Delete(); |
sorted->Clear(); |
1008 |
|
delete sorted; |
1009 |
return track; |
return track; |
1010 |
} |
} |
1011 |
/** |
/** |
1014 |
Int_t TrkLevel2::GetNTracks(){ |
Int_t TrkLevel2::GetNTracks(){ |
1015 |
|
|
1016 |
Float_t ntot=0; |
Float_t ntot=0; |
1017 |
|
if(!Track)return 0; |
1018 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1019 |
for(int i=0; i<ntrk(); i++) { |
for(int i=0; i<ntrk(); i++) { |
1020 |
if( ((TrkTrack *)t[i])->GetImageSeqNo() == -1 ) ntot+=1.; |
if( ((TrkTrack *)t[i])->GetImageSeqNo() == -1 ) ntot+=1.; |
1021 |
else ntot+=0.5; |
else ntot+=0.5; |
1022 |
} |
} |
1031 |
* Retrieves (if present) the image of the it-th "physical" track, sorted by the method GetNTracks(). |
* Retrieves (if present) the image of the it-th "physical" track, sorted by the method GetNTracks(). |
1032 |
* @param it Track number, ranging from 0 to GetNTracks(). |
* @param it Track number, ranging from 0 to GetNTracks(). |
1033 |
*/ |
*/ |
1034 |
/*TrkTrack *TrkLevel2::GetTrackImage(int it){ |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
1035 |
|
|
1036 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
1037 |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
1039 |
return 0; |
return 0; |
1040 |
} |
} |
1041 |
|
|
1042 |
TClonesArray* sorted = GetTracks(); |
TRefArray* sorted = GetTracks(); //TEMPORANEO |
1043 |
TClonesArray &ts = *sorted; |
if(!sorted)return 0; |
1044 |
TrkTrack *track = (TrkTrack*)ts[it]; |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
1045 |
// TrkTrack *track = (TrkTrack*)(*(this->GetTracks()))[it]; |
|
1046 |
|
if(!track->HasImage()){ |
|
if(!track->HasImage()){ |
|
1047 |
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
1048 |
return 0; |
return 0; |
1049 |
} |
} |
1050 |
|
if(!Track)return 0; |
1051 |
TrkTrack *image = (TrkTrack*)(*Track)[track->image]; |
TrkTrack *image = (TrkTrack*)(*Track)[track->image]; |
1052 |
|
|
1053 |
// GetTracks()->Delete(); ////TEMPORANEO |
sorted->Delete(); |
1054 |
sorted->Delete(); ////TEMPORANEO |
delete sorted; |
|
|
|
|
return image; |
|
|
|
|
|
}*/ |
|
|
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
|
|
|
|
|
if(it >= this->GetNTracks()){ |
|
|
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
|
|
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
|
|
return 0; |
|
|
} |
|
|
|
|
|
TRefArray* sorted = GetTracks(); //TEMPORANEO |
|
|
TrkTrack *track = (TrkTrack*)sorted->At(it); |
|
|
|
|
|
if(!track->HasImage()){ |
|
|
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
|
|
return 0; |
|
|
} |
|
|
TrkTrack *image = (TrkTrack*)(*Track)[track->image]; |
|
1055 |
|
|
1056 |
sorted->Delete(); |
return image; |
|
|
|
|
return image; |
|
1057 |
|
|
1058 |
} |
} |
1059 |
//-------------------------------------- |
//-------------------------------------- |
1064 |
* Loads the magnetic field. |
* Loads the magnetic field. |
1065 |
* @param s Path of the magnetic-field files. |
* @param s Path of the magnetic-field files. |
1066 |
*/ |
*/ |
1067 |
void TrkLevel2::LoadField(TString s){ |
void TrkLevel2::LoadField(TString path){ |
1068 |
readb_(s.Data()); |
// |
1069 |
|
strcpy(path_.path,path.Data()); |
1070 |
|
path_.pathlen = path.Length(); |
1071 |
|
path_.error = 0; |
1072 |
|
readb_(); |
1073 |
|
// |
1074 |
}; |
}; |
1075 |
//-------------------------------------- |
//-------------------------------------- |
1076 |
// |
// |
1179 |
npoint=i; |
npoint=i; |
1180 |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points"<<endl; |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points"<<endl; |
1181 |
} |
} |
1182 |
|
void Trajectory::Delete(){ |
1183 |
|
|
1184 |
|
if(x) delete [] x; |
1185 |
|
if(y) delete [] y; |
1186 |
|
if(z) delete [] z; |
1187 |
|
if(thx) delete [] thx; |
1188 |
|
if(thy) delete [] thy; |
1189 |
|
if(tl) delete [] tl; |
1190 |
|
|
1191 |
|
} |
1192 |
//-------------------------------------- |
//-------------------------------------- |
1193 |
// |
// |
1194 |
// |
// |
1227 |
|
|
1228 |
} |
} |
1229 |
|
|
1230 |
|
/** |
1231 |
|
* Evaluates the trajectory in the apparatus associated to the track. |
1232 |
|
* It integrates the equations of motion in the magnetic field. The magnetic field should be previously loaded ( by calling TrkLevel2::LoadField() ), otherwise an error message is returned. |
1233 |
|
* @param t pointer to an object of the class Trajectory, |
1234 |
|
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
1235 |
|
* @return error flag. |
1236 |
|
*/ |
1237 |
|
int Trajectory::DoTrack2(float* al){ |
1238 |
|
|
1239 |
|
double *dxout = new double[npoint]; |
1240 |
|
double *dyout = new double[npoint]; |
1241 |
|
double *dthxout = new double[npoint]; |
1242 |
|
double *dthyout = new double[npoint]; |
1243 |
|
double *dtlout = new double[npoint]; |
1244 |
|
double *dzin = new double[npoint]; |
1245 |
|
double dal[5]; |
1246 |
|
|
1247 |
|
int ifail = 0; |
1248 |
|
|
1249 |
|
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
1250 |
|
for (int i=0; i<npoint; i++) dzin[i] = (double)z[i]; |
1251 |
|
|
1252 |
|
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
1253 |
|
|
1254 |
|
for (int i=0; i<npoint; i++){ |
1255 |
|
x[i] = (float)*dxout++; |
1256 |
|
y[i] = (float)*dyout++; |
1257 |
|
thx[i] = (float)*dthxout++; |
1258 |
|
thy[i] = (float)*dthyout++; |
1259 |
|
tl[i] = (float)*dtlout++; |
1260 |
|
} |
1261 |
|
|
1262 |
|
return ifail; |
1263 |
|
}; |
1264 |
|
|
1265 |
ClassImp(TrkLevel2); |
ClassImp(TrkLevel2); |
1266 |
ClassImp(TrkSinglet); |
ClassImp(TrkSinglet); |
1267 |
ClassImp(TrkTrack); |
ClassImp(TrkTrack); |