21 |
seqno = -1; |
seqno = -1; |
22 |
image = -1; |
image = -1; |
23 |
chi2 = 0; |
chi2 = 0; |
24 |
for(int it1=0;it1<5;it1++){ |
nstep = 0; |
25 |
al[it1] = 0; |
for(int it1=0;it1<5;it1++){ |
26 |
for(int it2=0;it2<5;it2++) |
al[it1] = 0; |
27 |
coval[it1][it2] = 0; |
for(int it2=0;it2<5;it2++)coval[it1][it2] = 0; |
28 |
}; |
}; |
29 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
30 |
xgood[ip] = 0; |
xgood[ip] = 0; |
31 |
ygood[ip] = 0; |
ygood[ip] = 0; |
32 |
xm[ip] = 0; |
xm[ip] = 0; |
33 |
ym[ip] = 0; |
ym[ip] = 0; |
34 |
zm[ip] = 0; |
zm[ip] = 0; |
35 |
resx[ip] = 0; |
resx[ip] = 0; |
36 |
resy[ip] = 0; |
resy[ip] = 0; |
37 |
xv[ip] = 0; |
xv[ip] = 0; |
38 |
yv[ip] = 0; |
yv[ip] = 0; |
39 |
zv[ip] = 0; |
zv[ip] = 0; |
40 |
axv[ip] = 0; |
axv[ip] = 0; |
41 |
ayv[ip] = 0; |
ayv[ip] = 0; |
42 |
dedx_x[ip] = 0; |
dedx_x[ip] = 0; |
43 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
44 |
}; |
// clx[ip] = 0; |
45 |
|
// cly[ip] = 0; |
46 |
|
}; |
47 |
|
clx = new TRefArray(6,0); |
48 |
|
cly = new TRefArray(6,0); |
49 |
}; |
}; |
50 |
//-------------------------------------- |
//-------------------------------------- |
51 |
// |
// |
55 |
seqno = t.seqno; |
seqno = t.seqno; |
56 |
image = t.image; |
image = t.image; |
57 |
chi2 = t.chi2; |
chi2 = t.chi2; |
58 |
for(int it1=0;it1<5;it1++){ |
nstep = t.nstep; |
59 |
al[it1] = t.al[it1]; |
for(int it1=0;it1<5;it1++){ |
60 |
for(int it2=0;it2<5;it2++) |
al[it1] = t.al[it1]; |
61 |
coval[it1][it2] = t.coval[it1][it2]; |
for(int it2=0;it2<5;it2++)coval[it1][it2] = t.coval[it1][it2]; |
62 |
}; |
}; |
63 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
64 |
xgood[ip] = t.xgood[ip]; |
xgood[ip] = t.xgood[ip]; |
65 |
ygood[ip] = t.ygood[ip]; |
ygood[ip] = t.ygood[ip]; |
66 |
xm[ip] = t.xm[ip]; |
xm[ip] = t.xm[ip]; |
67 |
ym[ip] = t.ym[ip]; |
ym[ip] = t.ym[ip]; |
68 |
zm[ip] = t.zm[ip]; |
zm[ip] = t.zm[ip]; |
69 |
resx[ip] = t.resx[ip]; |
resx[ip] = t.resx[ip]; |
70 |
resy[ip] = t.resy[ip]; |
resy[ip] = t.resy[ip]; |
71 |
xv[ip] = t.xv[ip]; |
xv[ip] = t.xv[ip]; |
72 |
yv[ip] = t.yv[ip]; |
yv[ip] = t.yv[ip]; |
73 |
zv[ip] = t.zv[ip]; |
zv[ip] = t.zv[ip]; |
74 |
axv[ip] = t.axv[ip]; |
axv[ip] = t.axv[ip]; |
75 |
ayv[ip] = t.ayv[ip]; |
ayv[ip] = t.ayv[ip]; |
76 |
dedx_x[ip] = t.dedx_x[ip]; |
dedx_x[ip] = t.dedx_x[ip]; |
77 |
dedx_y[ip] = t.dedx_y[ip]; |
dedx_y[ip] = t.dedx_y[ip]; |
78 |
}; |
// clx[ip] = 0;//<<<<pointer |
79 |
|
// cly[ip] = 0;//<<<<pointer |
80 |
|
}; |
81 |
|
clx = new TRefArray(*(t.clx)); |
82 |
|
cly = new TRefArray(*(t.cly)); |
83 |
|
|
84 |
}; |
}; |
85 |
//-------------------------------------- |
//-------------------------------------- |
86 |
// |
// |
196 |
//-------------------------------------- |
//-------------------------------------- |
197 |
void TrkTrack::Dump(){ |
void TrkTrack::Dump(){ |
198 |
cout << endl << "========== Track " ; |
cout << endl << "========== Track " ; |
199 |
cout << endl << "al : "; for(int i=0; i<5; i++)cout << al[i] << " "; |
cout << endl << "seq. n. : "<< seqno; |
200 |
|
cout << endl << "image n. : "<< image; |
201 |
|
cout << endl << "al : "; for(int i=0; i<5; i++)cout << al[i] << " "; |
202 |
cout << endl << "chi^2 : "<< chi2; |
cout << endl << "chi^2 : "<< chi2; |
203 |
cout << endl << "xgood : "; for(int i=0; i<6; i++)cout << xgood[i] ; |
cout << endl << "n.step : "<< nstep; |
204 |
|
cout << endl << "xgood : "; for(int i=0; i<6; i++)cout << xgood[i] ; |
205 |
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] ; |
206 |
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] << " "; |
207 |
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] << " "; |
213 |
// |
// |
214 |
// |
// |
215 |
//-------------------------------------- |
//-------------------------------------- |
216 |
|
void TrkTrack::Clear(){ |
217 |
|
seqno = -1; |
218 |
|
image = -1; |
219 |
|
chi2 = 0; |
220 |
|
nstep = 0; |
221 |
|
for(int it1=0;it1<5;it1++){ |
222 |
|
al[it1] = 0; |
223 |
|
for(int it2=0;it2<5;it2++)coval[it1][it2] = 0; |
224 |
|
}; |
225 |
|
for(int ip=0;ip<6;ip++){ |
226 |
|
xgood[ip] = 0; |
227 |
|
ygood[ip] = 0; |
228 |
|
xm[ip] = 0; |
229 |
|
ym[ip] = 0; |
230 |
|
zm[ip] = 0; |
231 |
|
resx[ip] = 0; |
232 |
|
resy[ip] = 0; |
233 |
|
xv[ip] = 0; |
234 |
|
yv[ip] = 0; |
235 |
|
zv[ip] = 0; |
236 |
|
axv[ip] = 0; |
237 |
|
ayv[ip] = 0; |
238 |
|
dedx_x[ip] = 0; |
239 |
|
dedx_y[ip] = 0; |
240 |
|
// clx[ip] = 0; |
241 |
|
// cly[ip] = 0; |
242 |
|
}; |
243 |
|
clx->Clear(); |
244 |
|
cly->Clear(); |
245 |
|
}; |
246 |
|
//-------------------------------------- |
247 |
|
// |
248 |
|
// |
249 |
|
//-------------------------------------- |
250 |
|
|
251 |
|
//-------------------------------------- |
252 |
|
// |
253 |
|
// |
254 |
|
//-------------------------------------- |
255 |
TrkSinglet::TrkSinglet(){ |
TrkSinglet::TrkSinglet(){ |
256 |
plane = 0; |
plane = 0; |
257 |
coord[0] = 0; |
coord[0] = 0; |
258 |
coord[1] = 0; |
coord[1] = 0; |
259 |
sgnl = 0; |
sgnl = 0; |
260 |
|
cls = 0; |
261 |
}; |
}; |
262 |
//-------------------------------------- |
//-------------------------------------- |
263 |
// |
// |
268 |
coord[0] = s.coord[0]; |
coord[0] = s.coord[0]; |
269 |
coord[1] = s.coord[1]; |
coord[1] = s.coord[1]; |
270 |
sgnl = s.sgnl; |
sgnl = s.sgnl; |
271 |
|
// cls = 0;//<<<<pointer |
272 |
|
cls = TRef(s.cls); |
273 |
}; |
}; |
274 |
//-------------------------------------- |
//-------------------------------------- |
275 |
// |
// |
287 |
// |
// |
288 |
//-------------------------------------- |
//-------------------------------------- |
289 |
TrkLevel2::TrkLevel2(){ |
TrkLevel2::TrkLevel2(){ |
290 |
good2 = -1; |
// good2 = -1; |
291 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
292 |
crc[i] = -1; |
// crc[i] = -1; |
293 |
}; |
good[i] = -1; |
294 |
|
}; |
295 |
Track = new TClonesArray("TrkTrack"); |
Track = new TClonesArray("TrkTrack"); |
296 |
SingletX = new TClonesArray("TrkSinglet"); |
SingletX = new TClonesArray("TrkSinglet"); |
297 |
SingletY = new TClonesArray("TrkSinglet"); |
SingletY = new TClonesArray("TrkSinglet"); |
304 |
// |
// |
305 |
//-------------------------------------- |
//-------------------------------------- |
306 |
void TrkLevel2::Dump(){ |
void TrkLevel2::Dump(){ |
307 |
|
|
308 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
309 |
TClonesArray &sx = *SingletX; |
TClonesArray &sx = *SingletX; |
310 |
TClonesArray &sy = *SingletY; |
TClonesArray &sy = *SingletY; |
311 |
|
// |
312 |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
313 |
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]; |
|
314 |
cout << endl << "ntrk() : " << this->ntrk() ; |
cout << endl << "ntrk() : " << this->ntrk() ; |
315 |
cout << endl << "nclsx() : " << this->nclsx(); |
cout << endl << "nclsx() : " << this->nclsx(); |
316 |
cout << endl << "nclsy() : " << this->nclsy(); |
cout << endl << "nclsy() : " << this->nclsy(); |
326 |
* 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). |
327 |
*/ |
*/ |
328 |
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2){ |
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2){ |
329 |
// |
|
330 |
// Track = new TClonesArray("TrkTrack"); |
// temporary objects: |
|
// SingletX = new TClonesArray("TrkSinglet"); |
|
|
// SingletY = new TClonesArray("TrkSinglet"); |
|
|
// temporary objects: |
|
331 |
TrkSinglet* t_singlet = new TrkSinglet(); |
TrkSinglet* t_singlet = new TrkSinglet(); |
332 |
TrkTrack* t_track = new TrkTrack(); |
TrkTrack* t_track = new TrkTrack(); |
333 |
// general variables |
|
334 |
good2 = l2->good2; |
// **** general variables **** |
335 |
|
// good2 = l2->good2; |
336 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
337 |
crc[i] = l2->crc[i]; |
// crc[i] = l2->crc[i]; |
338 |
}; |
good[i] = l2->good[i]; |
339 |
// *** TRACKS *** |
}; |
340 |
|
// *** TRACKS *** |
341 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
342 |
for(int i=0; i<l2->ntrk; i++){ |
for(int i=0; i<l2->ntrk; i++){ |
343 |
t_track->seqno = i; |
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
344 |
t_track->image = l2->image[i]-1; |
t_track->image = l2->image[i]-1; |
345 |
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
346 |
t_track->chi2 = l2->chi2_nt[i]; |
t_track->chi2 = l2->chi2_nt[i]; |
347 |
for(int it1=0;it1<5;it1++){ |
t_track->nstep = l2->nstep_nt[i]; |
348 |
t_track->al[it1] = l2->al_nt[i][it1]; |
for(int it1=0;it1<5;it1++){ |
349 |
for(int it2=0;it2<5;it2++) |
t_track->al[it1] = l2->al_nt[i][it1]; |
350 |
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
for(int it2=0;it2<5;it2++) |
351 |
}; |
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
352 |
for(int ip=0;ip<6;ip++){ |
}; |
353 |
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
for(int ip=0;ip<6;ip++){ |
354 |
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
355 |
t_track->xm[ip] = l2->xm_nt[i][ip]; |
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
356 |
t_track->ym[ip] = l2->ym_nt[i][ip]; |
t_track->xm[ip] = l2->xm_nt[i][ip]; |
357 |
t_track->zm[ip] = l2->zm_nt[i][ip]; |
t_track->ym[ip] = l2->ym_nt[i][ip]; |
358 |
t_track->resx[ip] = l2->resx_nt[i][ip]; |
t_track->zm[ip] = l2->zm_nt[i][ip]; |
359 |
t_track->resy[ip] = l2->resy_nt[i][ip]; |
t_track->resx[ip] = l2->resx_nt[i][ip]; |
360 |
t_track->xv[ip] = l2->xv_nt[i][ip]; |
t_track->resy[ip] = l2->resy_nt[i][ip]; |
361 |
t_track->yv[ip] = l2->yv_nt[i][ip]; |
t_track->xv[ip] = l2->xv_nt[i][ip]; |
362 |
t_track->zv[ip] = l2->zv_nt[i][ip]; |
t_track->yv[ip] = l2->yv_nt[i][ip]; |
363 |
t_track->axv[ip] = l2->axv_nt[i][ip]; |
t_track->zv[ip] = l2->zv_nt[i][ip]; |
364 |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
t_track->axv[ip] = l2->axv_nt[i][ip]; |
365 |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
366 |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
367 |
}; |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
368 |
new(t[i]) TrkTrack(*t_track); |
// t_track->clx[ip] = 0; |
369 |
t_track->Clear(); |
// t_track->cly[ip] = 0; |
370 |
|
}; |
371 |
|
new(t[i]) TrkTrack(*t_track); |
372 |
|
t_track->Clear(); |
373 |
}; |
}; |
374 |
// *** SINGLETS *** |
// *** SINGLETS *** |
375 |
TClonesArray &sx = *SingletX; |
TClonesArray &sx = *SingletX; |
376 |
for(int i=0; i<l2->nclsx; i++){ |
for(int i=0; i<l2->nclsx; i++){ |
377 |
t_singlet->plane = l2->planex[i]; |
t_singlet->plane = l2->planex[i]; |
378 |
t_singlet->coord[0] = l2->xs[i][0]; |
t_singlet->coord[0] = l2->xs[i][0]; |
379 |
t_singlet->coord[1] = l2->xs[i][1]; |
t_singlet->coord[1] = l2->xs[i][1]; |
380 |
t_singlet->sgnl = l2->signlxs[i]; |
t_singlet->sgnl = l2->signlxs[i]; |
381 |
new(sx[i]) TrkSinglet(*t_singlet); |
// t_singlet->cls = 0; |
382 |
t_singlet->Clear(); |
new(sx[i]) TrkSinglet(*t_singlet); |
383 |
|
t_singlet->Clear(); |
384 |
} |
} |
385 |
TClonesArray &sy = *SingletY; |
TClonesArray &sy = *SingletY; |
386 |
for(int i=0; i<l2->nclsy; i++){ |
for(int i=0; i<l2->nclsy; i++){ |
387 |
t_singlet->plane = l2->planey[i]; |
t_singlet->plane = l2->planey[i]; |
388 |
t_singlet->coord[0] = l2->ys[i][0]; |
t_singlet->coord[0] = l2->ys[i][0]; |
389 |
t_singlet->coord[1] = l2->ys[i][1]; |
t_singlet->coord[1] = l2->ys[i][1]; |
390 |
t_singlet->sgnl = l2->signlys[i]; |
t_singlet->sgnl = l2->signlys[i]; |
391 |
new(sy[i]) TrkSinglet(*t_singlet); |
// t_singlet->cls = 0; |
392 |
t_singlet->Clear(); |
new(sy[i]) TrkSinglet(*t_singlet); |
393 |
|
t_singlet->Clear(); |
394 |
|
}; |
395 |
|
|
396 |
|
delete t_track; |
397 |
|
delete t_singlet; |
398 |
|
} |
399 |
|
//-------------------------------------- |
400 |
|
// |
401 |
|
// |
402 |
|
//-------------------------------------- |
403 |
|
/** |
404 |
|
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
405 |
|
* Ref to Level1 data (clusters) is also set. |
406 |
|
*/ |
407 |
|
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2, TrkLevel1 *l1){ |
408 |
|
|
409 |
|
// temporary objects: |
410 |
|
TrkSinglet* t_singlet = new TrkSinglet(); |
411 |
|
TrkTrack* t_track = new TrkTrack(); |
412 |
|
// general variables |
413 |
|
// good2 = l2->good2; |
414 |
|
for(Int_t i=0; i<12 ; i++){ |
415 |
|
// crc[i] = l2->crc[i]; |
416 |
|
good[i] = l2->good[i]; |
417 |
|
}; |
418 |
|
// *** TRACKS *** |
419 |
|
TClonesArray &t = *Track; |
420 |
|
for(int i=0; i<l2->ntrk; i++){ |
421 |
|
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
422 |
|
t_track->image = l2->image[i]-1; |
423 |
|
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
424 |
|
t_track->chi2 = l2->chi2_nt[i]; |
425 |
|
t_track->nstep = l2->nstep_nt[i]; |
426 |
|
for(int it1=0;it1<5;it1++){ |
427 |
|
t_track->al[it1] = l2->al_nt[i][it1]; |
428 |
|
for(int it2=0;it2<5;it2++) |
429 |
|
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
430 |
|
}; |
431 |
|
for(int ip=0;ip<6;ip++){ |
432 |
|
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
433 |
|
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
434 |
|
t_track->xm[ip] = l2->xm_nt[i][ip]; |
435 |
|
t_track->ym[ip] = l2->ym_nt[i][ip]; |
436 |
|
t_track->zm[ip] = l2->zm_nt[i][ip]; |
437 |
|
t_track->resx[ip] = l2->resx_nt[i][ip]; |
438 |
|
t_track->resy[ip] = l2->resy_nt[i][ip]; |
439 |
|
t_track->xv[ip] = l2->xv_nt[i][ip]; |
440 |
|
t_track->yv[ip] = l2->yv_nt[i][ip]; |
441 |
|
t_track->zv[ip] = l2->zv_nt[i][ip]; |
442 |
|
t_track->axv[ip] = l2->axv_nt[i][ip]; |
443 |
|
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
444 |
|
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
445 |
|
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
446 |
|
// cout << "traccia "<<i<<" -- "<< ip << " "<< l2->cltrx[i][ip] <<" "<< l2->cltry[i][ip] <<" "<< t_track->xgood[ip] << t_track->ygood[ip]<<endl; |
447 |
|
//----------------------------------------------------- |
448 |
|
// t_track->clx[ip] = l1->GetCluster(l2->cltrx[i][ip]-1); |
449 |
|
// t_track->cly[ip] = l1->GetCluster(l2->cltry[i][ip]-1); |
450 |
|
if(t_track->xgood[ip])t_track->clx->AddAt(l1->GetCluster(l2->cltrx[i][ip]-1),ip); |
451 |
|
if(t_track->ygood[ip])t_track->cly->AddAt(l1->GetCluster(l2->cltry[i][ip]-1),ip); |
452 |
|
// 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; |
453 |
|
// 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; |
454 |
|
//----------------------------------------------------- |
455 |
|
}; |
456 |
|
new(t[i]) TrkTrack(*t_track); |
457 |
|
t_track->Clear(); |
458 |
|
}; |
459 |
|
// *** SINGLETS *** |
460 |
|
TClonesArray &sx = *SingletX; |
461 |
|
for(int i=0; i<l2->nclsx; i++){ |
462 |
|
t_singlet->plane = l2->planex[i]; |
463 |
|
t_singlet->coord[0] = l2->xs[i][0]; |
464 |
|
t_singlet->coord[1] = l2->xs[i][1]; |
465 |
|
t_singlet->sgnl = l2->signlxs[i]; |
466 |
|
//----------------------------------------------------- |
467 |
|
// cout << "singolo x "<<i<<" -- "<< l2->clsx[i] <<endl; |
468 |
|
t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
469 |
|
// cout<<" i "<<i<<" l2->clsx[i] "<<l2->clsx[i]<< " l1->GetCluster(l2->clsx[i]-1) "<<l1->GetCluster(l2->clsx[i]-1)<<endl; |
470 |
|
//----------------------------------------------------- |
471 |
|
new(sx[i]) TrkSinglet(*t_singlet); |
472 |
|
t_singlet->Clear(); |
473 |
|
} |
474 |
|
TClonesArray &sy = *SingletY; |
475 |
|
for(int i=0; i<l2->nclsy; i++){ |
476 |
|
t_singlet->plane = l2->planey[i]; |
477 |
|
t_singlet->coord[0] = l2->ys[i][0]; |
478 |
|
t_singlet->coord[1] = l2->ys[i][1]; |
479 |
|
t_singlet->sgnl = l2->signlys[i]; |
480 |
|
//----------------------------------------------------- |
481 |
|
// cout << "singolo y "<<i<<" -- "<< l2->clsy[i] <<endl; |
482 |
|
t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
483 |
|
// cout<<" i "<<i<<" l2->clsy[i] "<<l2->clsy[i]<< " l1->GetCluster(l2->clsy[i]-1) "<<l1->GetCluster(l2->clsy[i]-1)<<endl; |
484 |
|
//----------------------------------------------------- |
485 |
|
new(sy[i]) TrkSinglet(*t_singlet); |
486 |
|
t_singlet->Clear(); |
487 |
}; |
}; |
488 |
|
|
489 |
delete t_track; |
delete t_track; |
496 |
void TrkLevel2::GetLevel2Struct(cTrkLevel2 *l2) const { |
void TrkLevel2::GetLevel2Struct(cTrkLevel2 *l2) const { |
497 |
|
|
498 |
// general variables |
// general variables |
499 |
l2->good2 = good2 ; |
// l2->good2 = good2 ; |
500 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
501 |
l2->crc[i] = crc[i]; |
// l2->crc[i] = crc[i]; |
502 |
|
l2->good[i] = good[i]; |
503 |
}; |
}; |
504 |
// *** TRACKS *** |
// *** TRACKS *** |
505 |
|
|
507 |
for(Int_t i=0;i<l2->ntrk;i++){ |
for(Int_t i=0;i<l2->ntrk;i++){ |
508 |
l2->image[i] = 1 + ((TrkTrack *)Track->At(i))->image; |
l2->image[i] = 1 + ((TrkTrack *)Track->At(i))->image; |
509 |
l2->chi2_nt[i] = ((TrkTrack *)Track->At(i))->chi2; |
l2->chi2_nt[i] = ((TrkTrack *)Track->At(i))->chi2; |
510 |
for(int it1=0;it1<5;it1++){ |
l2->nstep_nt[i] = ((TrkTrack *)Track->At(i))->nstep; |
511 |
|
for(int it1=0;it1<5;it1++){ |
512 |
l2->al_nt[i][it1] = ((TrkTrack *)Track->At(i))->al[it1]; |
l2->al_nt[i][it1] = ((TrkTrack *)Track->At(i))->al[it1]; |
513 |
for(int it2=0;it2<5;it2++) |
for(int it2=0;it2<5;it2++) |
514 |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
552 |
// |
// |
553 |
//-------------------------------------- |
//-------------------------------------- |
554 |
void TrkLevel2::Clear(){ |
void TrkLevel2::Clear(){ |
555 |
good2 = -1; |
// good2 = -1; |
556 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
557 |
crc[i] = -1; |
// crc[i] = -1; |
558 |
}; |
good[i] = -1; |
559 |
|
}; |
560 |
/* Track->RemoveAll(); |
/* Track->RemoveAll(); |
561 |
SingletX->RemoveAll(); |
SingletX->RemoveAll(); |
562 |
SingletY->RemoveAll();*/ |
SingletY->RemoveAll();*/ |
573 |
* 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). |
574 |
* 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. |
575 |
*/ |
*/ |
|
// TClonesArray *TrkLevel2::GetTracks(){ |
|
|
// TClonesArray *sorted = GetTracks_NFitSorted(); |
|
|
// return sorted; |
|
|
// }; |
|
|
|
|
|
/*TClonesArray *TrkLevel2::GetTracks_Chi2Sorted(){ |
|
|
|
|
|
TClonesArray *sorted = new TClonesArray("TrkTrack"); |
|
|
TClonesArray &t = *Track; |
|
|
TClonesArray &ts = *sorted; |
|
|
int N=this->ntrk(); |
|
|
vector<int> m(N); for(int i=0; i<N; i++)m[i]=1; |
|
|
|
|
|
int indo=0; |
|
|
int indi=0; |
|
|
while(N != 0){ |
|
|
float chi2ref=1000000; |
|
|
for(int i=0; i<this->ntrk(); i++){ |
|
|
if(((TrkTrack *)t[i])->chi2 < chi2ref && m[i]==1){ |
|
|
chi2ref = ((TrkTrack *)t[i])->chi2; |
|
|
indi = i; |
|
|
} |
|
|
} |
|
|
if( ((TrkTrack *)t[indi])->image != -1 ){ |
|
|
m[((TrkTrack *)t[indi])->image] = 0; |
|
|
N--; |
|
|
} |
|
|
new(ts[indo]) TrkTrack(*(TrkTrack*)t[indi]); |
|
|
m[indi] = 0; |
|
|
N--; |
|
|
indo++; |
|
|
} |
|
|
return sorted; |
|
|
}*/ |
|
|
/*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(){ |
|
576 |
TRefArray *TrkLevel2::GetTracks_NFitSorted(){ |
TRefArray *TrkLevel2::GetTracks_NFitSorted(){ |
577 |
|
|
|
// cout << "GetTracks_NFitSorted(it): new TRefArray()"<< endl; |
|
|
// TClonesArray *sorted = new TClonesArray("TrkTrack"); |
|
|
// TClonesArray &ts = *sorted; |
|
578 |
TRefArray *sorted = new TRefArray(); |
TRefArray *sorted = new TRefArray(); |
579 |
|
|
580 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
588 |
while(N != 0){ |
while(N != 0){ |
589 |
int nfit =0; |
int nfit =0; |
590 |
float chi2ref = numeric_limits<float>::max(); |
float chi2ref = numeric_limits<float>::max(); |
591 |
|
|
592 |
// first loop to search maximum num. of fit points |
// first loop to search maximum num. of fit points |
593 |
for(int i=0; i < ntrk(); i++){ |
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; |
|
594 |
if( ((TrkTrack *)t[i])->GetNtot() >= nfit && m[i]==1){ |
if( ((TrkTrack *)t[i])->GetNtot() >= nfit && m[i]==1){ |
595 |
nfit = ((TrkTrack *)t[i])->GetNtot(); |
nfit = ((TrkTrack *)t[i])->GetNtot(); |
596 |
} |
} |
597 |
} |
} |
598 |
//second loop to search minimum chi2 among selected |
//second loop to search minimum chi2 among selected |
599 |
for(int i=0; i<this->ntrk(); i++){ |
for(int i=0; i<this->ntrk(); i++){ |
600 |
if( ((TrkTrack *)t[i])->chi2 < chi2ref |
Float_t chi2 = ((TrkTrack *)t[i])->chi2; |
601 |
&& ((TrkTrack *)t[i])->GetNtot()== nfit |
if(chi2 < 0) chi2 = chi2*1000; |
602 |
&& m[i]==1){ |
if( chi2 < chi2ref |
603 |
|
&& ((TrkTrack *)t[i])->GetNtot() == nfit |
604 |
|
&& m[i]==1){ |
605 |
chi2ref = ((TrkTrack *)t[i])->chi2; |
chi2ref = ((TrkTrack *)t[i])->chi2; |
606 |
indi = i; |
indi = i; |
607 |
// cout << "2** "<<i<< " " << nfit <<" "<<chi2ref<<endl; |
}; |
608 |
} |
}; |
|
} |
|
609 |
if( ((TrkTrack *)t[indi])->HasImage() ){ |
if( ((TrkTrack *)t[indi])->HasImage() ){ |
610 |
m[((TrkTrack *)t[indi])->image] = 0; |
m[((TrkTrack *)t[indi])->image] = 0; |
611 |
N--; |
N--; |
612 |
|
|
|
// Int_t nfiti=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->GetNtot(); |
|
|
// Float_t chi2i=((TrkTrack *)t[((TrkTrack *)t[indi])->image ])->chi2; |
|
|
|
|
613 |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
614 |
} |
}; |
|
// new(ts[indo]) TrkTrack(*(TrkTrack*)t[indi]); |
|
|
// cout << "GetTracks_NFitSorted(it): Add("<<indo<<")"<< endl; |
|
615 |
sorted->Add( (TrkTrack*)t[indi] ); |
sorted->Add( (TrkTrack*)t[indi] ); |
616 |
|
|
617 |
m[indi] = 0; |
m[indi] = 0; |
691 |
* Retrieves the it-th "physical" track, sorted by the method GetNTracks(). |
* Retrieves the it-th "physical" track, sorted by the method GetNTracks(). |
692 |
* @param it Track number, ranging from 0 to GetNTracks(). |
* @param it Track number, ranging from 0 to GetNTracks(). |
693 |
*/ |
*/ |
694 |
/*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; |
|
|
}*/ |
|
695 |
TrkTrack *TrkLevel2::GetTrack(int it){ |
TrkTrack *TrkLevel2::GetTrack(int it){ |
696 |
|
|
697 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
727 |
* 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(). |
728 |
* @param it Track number, ranging from 0 to GetNTracks(). |
* @param it Track number, ranging from 0 to GetNTracks(). |
729 |
*/ |
*/ |
|
/*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; |
|
|
} |
|
|
|
|
|
TClonesArray* sorted = GetTracks(); |
|
|
TClonesArray &ts = *sorted; |
|
|
TrkTrack *track = (TrkTrack*)ts[it]; |
|
|
// TrkTrack *track = (TrkTrack*)(*(this->GetTracks()))[it]; |
|
|
|
|
|
if(!track->HasImage()){ |
|
|
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
|
|
return 0; |
|
|
} |
|
|
TrkTrack *image = (TrkTrack*)(*Track)[track->image]; |
|
|
|
|
|
// GetTracks()->Delete(); ////TEMPORANEO |
|
|
sorted->Delete(); ////TEMPORANEO |
|
|
|
|
|
return image; |
|
|
|
|
|
}*/ |
|
730 |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
731 |
|
|
732 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
856 |
tl = new float[npoint]; |
tl = new float[npoint]; |
857 |
int i=0; |
int i=0; |
858 |
do{ |
do{ |
859 |
x[i] = 0; |
x[i] = 0; |
860 |
y[i] = 0; |
y[i] = 0; |
861 |
z[i] = zin[i]; |
z[i] = zin[i]; |
862 |
thx[i] = 0; |
thx[i] = 0; |
863 |
thy[i] = 0; |
thy[i] = 0; |
864 |
tl[i] = 0; |
tl[i] = 0; |
865 |
i++; |
i++; |
866 |
}while(zin[i-1] > zin[i] && i < npoint); |
}while(zin[i-1] > zin[i] && i < npoint); |
867 |
npoint=i; |
npoint=i; |
868 |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points"<<endl; |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points"<<endl; |
905 |
|
|
906 |
} |
} |
907 |
|
|
908 |
|
|
909 |
ClassImp(TrkLevel2); |
ClassImp(TrkLevel2); |
910 |
ClassImp(TrkSinglet); |
ClassImp(TrkSinglet); |
911 |
ClassImp(TrkTrack); |
ClassImp(TrkTrack); |