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*); |
|
// int readb_(const char*); |
|
|
int readb_(); |
|
15 |
void mini2_(int*,int*,int*); |
void mini2_(int*,int*,int*); |
16 |
void guess_(); |
void guess_(); |
17 |
|
void gufld_(float*, float*); |
18 |
|
float risxeta2_(float *); |
19 |
|
float risxeta3_(float *); |
20 |
|
float risxeta4_(float *); |
21 |
|
float risyeta2_(float *); |
22 |
} |
} |
23 |
|
|
24 |
//-------------------------------------- |
//-------------------------------------- |
25 |
// |
// |
26 |
// |
// |
43 |
zm[ip] = 0; |
zm[ip] = 0; |
44 |
resx[ip] = 0; |
resx[ip] = 0; |
45 |
resy[ip] = 0; |
resy[ip] = 0; |
46 |
|
tailx[ip] = 0; |
47 |
|
taily[ip] = 0; |
48 |
xv[ip] = 0; |
xv[ip] = 0; |
49 |
yv[ip] = 0; |
yv[ip] = 0; |
50 |
zv[ip] = 0; |
zv[ip] = 0; |
53 |
dedx_x[ip] = 0; |
dedx_x[ip] = 0; |
54 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
55 |
}; |
}; |
56 |
clx = 0; |
// clx = 0; |
57 |
cly = 0; |
// cly = 0; |
58 |
// clx = new TRefArray(6,0); |
// clx = new TRefArray(6,0); //forse causa memory leak??? |
59 |
// cly = new TRefArray(6,0); |
// cly = new TRefArray(6,0); //forse causa memory leak??? |
60 |
|
// clx = TRefArray(6,0); |
61 |
|
// cly = TRefArray(6,0); |
62 |
|
|
63 |
|
TrkParams::SetTrackingMode(); |
64 |
|
TrkParams::SetPrecisionFactor(); |
65 |
|
TrkParams::SetStepMin(); |
66 |
|
TrkParams::SetPFA(); |
67 |
|
|
68 |
}; |
}; |
69 |
//-------------------------------------- |
//-------------------------------------- |
70 |
// |
// |
87 |
zm[ip] = t.zm[ip]; |
zm[ip] = t.zm[ip]; |
88 |
resx[ip] = t.resx[ip]; |
resx[ip] = t.resx[ip]; |
89 |
resy[ip] = t.resy[ip]; |
resy[ip] = t.resy[ip]; |
90 |
|
tailx[ip] = t.tailx[ip]; |
91 |
|
taily[ip] = t.taily[ip]; |
92 |
xv[ip] = t.xv[ip]; |
xv[ip] = t.xv[ip]; |
93 |
yv[ip] = t.yv[ip]; |
yv[ip] = t.yv[ip]; |
94 |
zv[ip] = t.zv[ip]; |
zv[ip] = t.zv[ip]; |
97 |
dedx_x[ip] = t.dedx_x[ip]; |
dedx_x[ip] = t.dedx_x[ip]; |
98 |
dedx_y[ip] = t.dedx_y[ip]; |
dedx_y[ip] = t.dedx_y[ip]; |
99 |
}; |
}; |
100 |
clx = 0; |
// clx = 0; |
101 |
cly = 0; |
// cly = 0; |
102 |
if(t.clx)clx = new TRefArray(*(t.clx)); |
// if(t.clx)clx = new TRefArray(*(t.clx)); |
103 |
if(t.cly)cly = new TRefArray(*(t.cly)); |
// if(t.cly)cly = new TRefArray(*(t.cly)); |
104 |
|
// clx = TRefArray(t.clx); |
105 |
|
// cly = TRefArray(t.cly); |
106 |
|
|
107 |
|
TrkParams::SetTrackingMode(); |
108 |
|
TrkParams::SetPrecisionFactor(); |
109 |
|
TrkParams::SetStepMin(); |
110 |
|
TrkParams::SetPFA(); |
111 |
|
|
112 |
}; |
}; |
113 |
//-------------------------------------- |
//-------------------------------------- |
114 |
// |
// |
132 |
t.zm[ip] = zm[ip]; |
t.zm[ip] = zm[ip]; |
133 |
t.resx[ip] = resx[ip]; |
t.resx[ip] = resx[ip]; |
134 |
t.resy[ip] = resy[ip]; |
t.resy[ip] = resy[ip]; |
135 |
|
t.tailx[ip] = tailx[ip]; |
136 |
|
t.taily[ip] = taily[ip]; |
137 |
t.xv[ip] = xv[ip]; |
t.xv[ip] = xv[ip]; |
138 |
t.yv[ip] = yv[ip]; |
t.yv[ip] = yv[ip]; |
139 |
t.zv[ip] = zv[ip]; |
t.zv[ip] = zv[ip]; |
143 |
t.dedx_y[ip] = dedx_y[ip]; |
t.dedx_y[ip] = dedx_y[ip]; |
144 |
|
|
145 |
}; |
}; |
146 |
|
|
147 |
|
// t.clx = TRefArray(clx); |
148 |
|
// t.cly = TRefArray(cly); |
149 |
|
|
150 |
}; |
}; |
151 |
//-------------------------------------- |
//-------------------------------------- |
171 |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
172 |
for (int i=0; i<t->npoint; i++) dzin[i] = (double)t->z[i]; |
for (int i=0; i<t->npoint; i++) dzin[i] = (double)t->z[i]; |
173 |
|
|
174 |
|
TrkParams::Load(1); |
175 |
|
if( !TrkParams::IsLoaded(1) ){ |
176 |
|
cout << "int TrkTrack::DoTrack(Trajectory* t) --- ERROR --- m.field not loaded"<<endl; |
177 |
|
return 0; |
178 |
|
} |
179 |
dotrack_(&(t->npoint),dzin,dxout,dyout,dal,&ifail); |
dotrack_(&(t->npoint),dzin,dxout,dyout,dal,&ifail); |
180 |
|
|
181 |
for (int i=0; i<t->npoint; i++){ |
for (int i=0; i<t->npoint; i++){ |
215 |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
216 |
for (int i=0; i<t->npoint; i++) dzin[i] = (double)t->z[i]; |
for (int i=0; i<t->npoint; i++) dzin[i] = (double)t->z[i]; |
217 |
|
|
218 |
|
TrkParams::Load(1); |
219 |
|
if( !TrkParams::IsLoaded(1) ){ |
220 |
|
cout << "int TrkTrack::DoTrack2(Trajectory* t) --- ERROR --- m.field not loaded"<<endl; |
221 |
|
return 0; |
222 |
|
} |
223 |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
224 |
|
|
225 |
for (int i=0; i<t->npoint; i++){ |
for (int i=0; i<t->npoint; i++){ |
259 |
return def; |
return def; |
260 |
}; |
}; |
261 |
// |
// |
262 |
Float_t TrkTrack::GetDEDX(){ |
/** |
263 |
Float_t dedx=0; |
* Method to retrieve the dE/dx measured on a tracker view. |
264 |
for(Int_t i=0; i<6; i++)dedx+=dedx_x[i]*xgood[i]+dedx_y[i]*ygood[i]; |
* @param ip plane (0-5) |
265 |
dedx = dedx/(this->GetNX()+this->GetNY()); |
* @param iv view (0=x 1=y) |
266 |
return dedx; |
*/ |
267 |
|
Float_t TrkTrack::GetDEDX(int ip, int iv){ |
268 |
|
if(iv==0 && ip>=0 && ip<6)return fabs(dedx_x[ip]); |
269 |
|
else if(iv==1 && ip>=0 && ip<6)return fabs(dedx_y[ip]); |
270 |
|
else { |
271 |
|
cout << "TrkTrack::GetDEDX(int ip, int iv) -- wrong input parameters "<<ip<<iv<<endl; |
272 |
|
return 0.; |
273 |
|
} |
274 |
|
} |
275 |
|
/** |
276 |
|
* Method to evaluate the dE/dx measured on a tracker plane. |
277 |
|
* The two measurements on x- and y-view are averaged. |
278 |
|
* @param ip plane (0-5) |
279 |
|
*/ |
280 |
|
Float_t TrkTrack::GetDEDX(int ip){ |
281 |
|
if( (Int_t)XGood(ip)+(Int_t)YGood(ip) == 0 ) return 0; |
282 |
|
return (GetDEDX(ip,0)+GetDEDX(ip,1))/((Int_t)XGood(ip)+(Int_t)YGood(ip)); |
283 |
}; |
}; |
284 |
|
|
285 |
|
/** |
286 |
|
* Method to evaluate the dE/dx averaged over all planes. |
287 |
|
*/ |
288 |
|
Float_t TrkTrack::GetDEDX(){ |
289 |
|
Float_t dedx=0; |
290 |
|
for(Int_t ip=0; ip<6; ip++)dedx+=GetDEDX(ip,0)*XGood(ip)+GetDEDX(ip,1)*YGood(ip); |
291 |
|
dedx = dedx/(GetNX()+GetNY()); |
292 |
|
return dedx; |
293 |
|
}; |
294 |
|
/** |
295 |
|
* Returns 1 if the cluster on a tracker view includes bad strips. |
296 |
|
* @param ip plane (0-5) |
297 |
|
* @param iv view (0=x 1=y) |
298 |
|
*/ |
299 |
|
Bool_t TrkTrack::IsBad(int ip,int iv){ |
300 |
|
if(iv==0 && ip>=0 && ip<6)return (xgood[ip]<0) ; |
301 |
|
else if(iv==1 && ip>=0 && ip<6)return (ygood[ip]<0) ; |
302 |
|
else { |
303 |
|
cout << "TrkTrack::IsBad(int ip, int iv) -- wrong input parameters "<<ip<<iv<<endl; |
304 |
|
return 0.; |
305 |
|
} |
306 |
|
}; |
307 |
|
/** |
308 |
|
* Returns 1 if the signal on a tracker view is saturated. |
309 |
|
* @param ip plane (0-5) |
310 |
|
* @param iv view (0=x 1=y) |
311 |
|
*/ |
312 |
|
Bool_t TrkTrack::IsSaturated(int ip,int iv){ |
313 |
|
if(iv==0 && ip>=0 && ip<6)return (dedx_x[ip]<0) ; |
314 |
|
else if(iv==1 && ip>=0 && ip<6)return (dedx_y[ip]<0) ; |
315 |
|
else { |
316 |
|
cout << "TrkTrack::IsSaturated(int ip, int iv) -- wrong input parameters "<<ip<<iv<<endl; |
317 |
|
return 0.; |
318 |
|
} |
319 |
|
}; |
320 |
|
/** |
321 |
|
* Returns 1 if either the x or the y signal on a tracker plane is saturated. |
322 |
|
* @param ip plane (0-5) |
323 |
|
*/ |
324 |
|
Bool_t TrkTrack::IsSaturated(int ip){ |
325 |
|
return (IsSaturated(ip,0)||IsSaturated(ip,1)); |
326 |
|
}; |
327 |
|
/** |
328 |
|
* Returns 1 if there is at least a saturated signal along the track. |
329 |
|
*/ |
330 |
|
Bool_t TrkTrack::IsSaturated(){ |
331 |
|
for(int ip=0; ip<6; ip++)for(int iv=0; iv<2; iv++)if(IsSaturated(ip,iv))return true; |
332 |
|
return false; |
333 |
|
} |
334 |
|
/** |
335 |
|
* Returns the track "lever-arm" on the x view, defined as the distance (in planes) between |
336 |
|
* the upper and lower x measurements (the maximum value of lever-arm is 6). |
337 |
|
*/ |
338 |
|
Int_t TrkTrack::GetLeverArmX(){ |
339 |
|
int first_plane = -1; |
340 |
|
int last_plane = -1; |
341 |
|
for(Int_t ip=0; ip<6; ip++){ |
342 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
343 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
344 |
|
} |
345 |
|
if( first_plane == -1 || last_plane == -1){ |
346 |
|
cout<< "Int_t TrkTrack::GetLeverArmX() -- XGood(ip) always false ??? "<<endl; |
347 |
|
return 0; |
348 |
|
} |
349 |
|
return (last_plane-first_plane+1); |
350 |
|
} |
351 |
|
/** |
352 |
|
* Returns the track "lever-arm" on the y view, defined as the distance (in planes) between |
353 |
|
* the upper and lower y measurements (the maximum value of lever-arm is 6). |
354 |
|
*/ |
355 |
|
Int_t TrkTrack::GetLeverArmY(){ |
356 |
|
int first_plane = -1; |
357 |
|
int last_plane = -1; |
358 |
|
for(Int_t ip=0; ip<6; ip++){ |
359 |
|
if( YGood(ip) && first_plane == -1 )first_plane = ip; |
360 |
|
if( YGood(ip) && first_plane != -1 )last_plane = ip; |
361 |
|
} |
362 |
|
if( first_plane == -1 || last_plane == -1){ |
363 |
|
cout<< "Int_t TrkTrack::GetLeverArmY() -- YGood(ip) always false ??? "<<endl; |
364 |
|
return 0; |
365 |
|
} |
366 |
|
return (last_plane-first_plane+1); |
367 |
|
} |
368 |
|
/** |
369 |
|
* Returns the reduced chi-square of track x-projection |
370 |
|
*/ |
371 |
|
Float_t TrkTrack::GetChi2X(){ |
372 |
|
float chiq=0; |
373 |
|
for(int ip=0; ip<6; ip++)if(XGood(ip))chiq+= pow((xv[ip]-xm[ip])/resx[ip],2.); |
374 |
|
if(GetNX()>3)chiq=chiq/(GetNX()-3); |
375 |
|
else chiq=0; |
376 |
|
if(chiq==0)cout << " Float_t TrkTrack::GetChi2X() -- WARNING -- value not defined "<<chiq<<endl; |
377 |
|
return chiq; |
378 |
|
} |
379 |
|
/** |
380 |
|
* Returns the reduced chi-square of track y-projection |
381 |
|
*/ |
382 |
|
Float_t TrkTrack::GetChi2Y(){ |
383 |
|
float chiq=0; |
384 |
|
for(int ip=0; ip<6; ip++)if(YGood(ip))chiq+= pow((yv[ip]-ym[ip])/resy[ip],2.); |
385 |
|
if(GetNY()>2)chiq=chiq/(GetNY()-2); |
386 |
|
else chiq=0; |
387 |
|
if(chiq==0)cout << " Float_t TrkTrack::GetChi2Y() -- WARNING -- value not defined "<<chiq<<endl; |
388 |
|
return chiq; |
389 |
|
} |
390 |
|
/** |
391 |
|
* Returns the logarythm of the likeliwood-function of track x-projection |
392 |
|
*/ |
393 |
|
Float_t TrkTrack::GetLnLX(){ |
394 |
|
float lnl=0; |
395 |
|
for(int ip=0; ip<6; ip++) |
396 |
|
if( XGood(ip) && tailx[ip]!=0 ) |
397 |
|
lnl += (tailx[ip]+1.) * log( (tailx[ip]*pow(resx[ip],2.) + pow(xv[ip]-xm[ip],2.)) / (tailx[ip]*pow(resx[ip],2)) ); |
398 |
|
if(GetNX()>3)lnl=lnl/(GetNX()-3); |
399 |
|
else lnl=0; |
400 |
|
if(lnl==0){ |
401 |
|
cout << " Float_t TrkTrack::GetLnLX() -- WARNING -- value not defined "<<lnl<<endl; |
402 |
|
Dump(); |
403 |
|
} |
404 |
|
return lnl; |
405 |
|
|
406 |
|
} |
407 |
|
/** |
408 |
|
* Returns the logarythm of the likeliwood-function of track y-projection |
409 |
|
*/ |
410 |
|
Float_t TrkTrack::GetLnLY(){ |
411 |
|
float lnl=0; |
412 |
|
for(int ip=0; ip<6; ip++) |
413 |
|
if( YGood(ip) && taily[ip]!=0 ) |
414 |
|
lnl += (taily[ip]+1.) * log( (taily[ip]*pow(resy[ip],2.) + pow(yv[ip]-ym[ip],2.)) / (taily[ip]*pow(resy[ip],2)) ); |
415 |
|
if(GetNY()>2)lnl=lnl/(GetNY()-2); |
416 |
|
else lnl=0; |
417 |
|
if(lnl==0){ |
418 |
|
cout << " Float_t TrkTrack::GetLnLY() -- WARNING -- value not defined "<<lnl<<endl; |
419 |
|
Dump(); |
420 |
|
} |
421 |
|
return lnl; |
422 |
|
|
423 |
|
} |
424 |
//-------------------------------------- |
//-------------------------------------- |
425 |
// |
// |
426 |
// |
// |
432 |
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] << " "; |
433 |
cout << endl << "chi^2 : "<< chi2; |
cout << endl << "chi^2 : "<< chi2; |
434 |
cout << endl << "n.step : "<< nstep; |
cout << endl << "n.step : "<< nstep; |
435 |
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) ; |
436 |
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) ; |
437 |
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] << " "; |
438 |
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] << " "; |
439 |
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] << " "; |
442 |
cout << endl << "zv : "; for(int i=0; i<6; i++)cout << zv[i] << " "; |
cout << endl << "zv : "; for(int i=0; i<6; i++)cout << zv[i] << " "; |
443 |
cout << endl << "resx : "; for(int i=0; i<6; i++)cout << resx[i] << " "; |
cout << endl << "resx : "; for(int i=0; i<6; i++)cout << resx[i] << " "; |
444 |
cout << endl << "resy : "; for(int i=0; i<6; i++)cout << resy[i] << " "; |
cout << endl << "resy : "; for(int i=0; i<6; i++)cout << resy[i] << " "; |
445 |
|
cout << endl << "tailx : "; for(int i=0; i<6; i++)cout << tailx[i] << " "; |
446 |
|
cout << endl << "taily : "; for(int i=0; i<6; i++)cout << taily[i] << " "; |
447 |
cout << endl << "coval : "; for(int i=0; i<5; i++)cout << coval[0][i]<<" "; |
cout << endl << "coval : "; for(int i=0; i<5; i++)cout << coval[0][i]<<" "; |
448 |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[1][i]<<" "; |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[1][i]<<" "; |
449 |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[2][i]<<" "; |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[2][i]<<" "; |
469 |
for(int i=0; i<6; i++) resy[i]=*ry++; |
for(int i=0; i<6; i++) resy[i]=*ry++; |
470 |
} |
} |
471 |
/** |
/** |
472 |
|
* Set the TrkTrack tails position resolution |
473 |
|
*/ |
474 |
|
void TrkTrack::SetTail(double *tx, double *ty, double factor){ |
475 |
|
for(int i=0; i<6; i++) tailx[i]=factor*(*tx++); |
476 |
|
for(int i=0; i<6; i++) taily[i]=factor*(*ty++); |
477 |
|
} |
478 |
|
/** |
479 |
|
* Set the TrkTrack Student parameter (resx,resy,tailx,taily) |
480 |
|
* from previous gausian fit |
481 |
|
*@param flag =0 standard, =1 with noise correction |
482 |
|
*/ |
483 |
|
void TrkTrack::SetStudentParam(int flag){ |
484 |
|
float sx[11]={0.000128242, |
485 |
|
0.000136942, |
486 |
|
0.000162718, |
487 |
|
0.000202644, |
488 |
|
0.00025597, |
489 |
|
0.000317456, |
490 |
|
0.000349048, |
491 |
|
0.000384638, |
492 |
|
0.000457295, |
493 |
|
0.000512319, |
494 |
|
0.000538573}; |
495 |
|
float tx[11]={1.79402, |
496 |
|
2.04876, |
497 |
|
2.88376, |
498 |
|
3.3, |
499 |
|
3.14084, |
500 |
|
4.07686, |
501 |
|
4.44736, |
502 |
|
3.5179, |
503 |
|
3.38697, |
504 |
|
3.45739, |
505 |
|
3.18627}; |
506 |
|
float sy[11]={0.000483075, |
507 |
|
0.000466925, |
508 |
|
0.000431658, |
509 |
|
0.000428317, |
510 |
|
0.000433854, |
511 |
|
0.000444044, |
512 |
|
0.000482098, |
513 |
|
0.000537579, |
514 |
|
0.000636279, |
515 |
|
0.000741998, |
516 |
|
0.000864261}; |
517 |
|
float ty[11]={0.997032, |
518 |
|
1.11147, |
519 |
|
1.18526, |
520 |
|
1.61404, |
521 |
|
2.21908, |
522 |
|
3.08959, |
523 |
|
4.48833, |
524 |
|
4.42687, |
525 |
|
4.65253, |
526 |
|
4.52043, |
527 |
|
4.29926}; |
528 |
|
int index; |
529 |
|
float fact; |
530 |
|
for(int i=0; i<6; i++) { |
531 |
|
index = int((fabs(axv[i])+1.)/2.); |
532 |
|
if(index>10) index=10; |
533 |
|
tailx[i]=tx[index]; |
534 |
|
if(flag==1) { |
535 |
|
if(fabs(axv[i])<=10.) fact = resx[i]/risxeta2_(&(axv[i])); |
536 |
|
if(fabs(axv[i])>10.&&fabs(axv[i])<=15.) fact = resx[i]/risxeta3_(&(axv[i])); |
537 |
|
if(fabs(axv[i])>15.) fact = resx[i]/risxeta4_(&(axv[i])); |
538 |
|
} else fact = 1.; |
539 |
|
resx[i] = sx[index]*fact; |
540 |
|
} |
541 |
|
for(int i=0; i<6; i++) { |
542 |
|
index = int((fabs(ayv[i])+1.)/2.); |
543 |
|
if(index>10) index=10; |
544 |
|
taily[i]=ty[index]; |
545 |
|
if(flag==1) fact = resy[i]/risyeta2_(&(ayv[i])); |
546 |
|
else fact = 1.; |
547 |
|
resy[i] = sy[index]*fact; |
548 |
|
} |
549 |
|
} |
550 |
|
/** |
551 |
* Set the TrkTrack good measurement |
* Set the TrkTrack good measurement |
552 |
*/ |
*/ |
553 |
void TrkTrack::SetGood(int *xg, int *yg){ |
void TrkTrack::SetGood(int *xg, int *yg){ |
554 |
|
|
555 |
for(int i=0; i<6; i++) xgood[i]=*xg++; |
for(int i=0; i<6; i++) xgood[i]=*xg++; |
556 |
for(int i=0; i<6; i++) ygood[i]=*yg++; |
for(int i=0; i<6; i++) ygood[i]=*yg++; |
557 |
} |
} |
561 |
*/ |
*/ |
562 |
void TrkTrack::LoadField(TString path){ |
void TrkTrack::LoadField(TString path){ |
563 |
|
|
564 |
strcpy(path_.path,path.Data()); |
// strcpy(path_.path,path.Data()); |
565 |
path_.pathlen = path.Length(); |
// path_.pathlen = path.Length(); |
566 |
path_.error = 0; |
// path_.error = 0; |
567 |
readb_(); |
// readb_(); |
568 |
|
|
569 |
|
TrkParams::SetTrackingMode(); |
570 |
|
TrkParams::SetPrecisionFactor(); |
571 |
|
TrkParams::SetStepMin(); |
572 |
|
|
573 |
|
TrkParams::Set(path,1); |
574 |
|
TrkParams::Load(1); |
575 |
|
|
576 |
}; |
}; |
577 |
|
|
578 |
|
|
579 |
/** |
/** |
580 |
* Method to fill minimization-routine common |
* Method to fill minimization-routine common |
581 |
*/ |
*/ |
583 |
|
|
584 |
for(int i=0; i<6; i++){ |
for(int i=0; i<6; i++){ |
585 |
|
|
586 |
track.xgood[i]=xgood[i]; |
// cout << i<<" - "<<xgood[i]<<" "<<XGood(i)<<endl; |
587 |
track.ygood[i]=ygood[i]; |
// cout << i<<" - "<<ygood[i]<<" "<<YGood(i)<<endl; |
588 |
|
track.xgood[i]=XGood(i); |
589 |
|
track.ygood[i]=YGood(i); |
590 |
|
|
591 |
track.xm[i]=xm[i]; |
track.xm[i]=xm[i]; |
592 |
track.ym[i]=ym[i]; |
track.ym[i]=ym[i]; |
599 |
track.xm_b[i]=xm[i]; |
track.xm_b[i]=xm[i]; |
600 |
track.ym_a[i]=ym[i]; |
track.ym_a[i]=ym[i]; |
601 |
track.ym_b[i]=ym[i]; |
track.ym_b[i]=ym[i]; |
602 |
if( xgood[i] && !ygood[i] ){ |
if( XGood(i) && !YGood(i) ){ |
603 |
track.ym_a[i] = track.ym_a[i]+segment; |
track.ym_a[i] = track.ym_a[i]+segment; |
604 |
track.ym_b[i] = track.ym_b[i]-segment; |
track.ym_b[i] = track.ym_b[i]-segment; |
605 |
}else if( !xgood[i] && ygood[i]){ |
}else if( !XGood(i) && YGood(i)){ |
606 |
track.xm_a[i] = track.xm_a[i]+segment; |
track.xm_a[i] = track.xm_a[i]+segment; |
607 |
track.xm_b[i] = track.xm_b[i]-segment; |
track.xm_b[i] = track.xm_b[i]-segment; |
608 |
} |
} |
610 |
|
|
611 |
track.resx[i]=resx[i]; |
track.resx[i]=resx[i]; |
612 |
track.resy[i]=resy[i]; |
track.resy[i]=resy[i]; |
613 |
|
track.tailx[i]=tailx[i]; |
614 |
|
track.taily[i]=taily[i]; |
615 |
} |
} |
616 |
|
|
617 |
for(int i=0; i<5; i++) track.al[i]=al[i]; |
for(int i=0; i<5; i++) track.al[i]=al[i]; |
640 |
axv[i] = track->axv[i]; |
axv[i] = track->axv[i]; |
641 |
ayv[i] = track->ayv[i]; |
ayv[i] = track->ayv[i]; |
642 |
} |
} |
|
|
|
643 |
|
|
644 |
} |
} |
645 |
/** |
/** |
646 |
* Tracking method. It calls F77 mini routine. |
* \brief Method to re-evaluate coordinates of clusters associated with a track. |
647 |
|
* |
648 |
|
* The method can be applied only after recovering level1 information |
649 |
|
* (either by reprocessing single events from level0 or from |
650 |
|
* the TrkLevel1 branch, if present); it calls F77 subroutines that |
651 |
|
* read the level1 common and fill the minimization-routine common. |
652 |
|
* Some clusters can be excluded or added by means of the methods: |
653 |
|
* |
654 |
|
* TrkTrack::ResetXGood(int ip) |
655 |
|
* TrkTrack::ResetYGood(int ip) |
656 |
|
* TrkTrack::SetXGood(int ip, int cid, int is) |
657 |
|
* TrkTrack::SetYGood(int ip, int cid, int is) |
658 |
|
* |
659 |
|
* NB! The method TrkTrack::SetGood(int *xg, int *yg) set the plane-mask (0-1) |
660 |
|
* for the minimization-routine common. It deletes the cluster information |
661 |
|
* (at least for the moment...) thus cannot be applied before |
662 |
|
* TrkTrack::EvaluateClusterPositions(). |
663 |
|
* |
664 |
|
* Different p.f.a. can be applied by calling (once) the method: |
665 |
|
* |
666 |
|
* TrkParams::SetPFA(0); //Set ETA p.f.a. |
667 |
|
* |
668 |
|
* @see TrkParams::SetPFA(int) |
669 |
|
*/ |
670 |
|
Bool_t TrkTrack::EvaluateClusterPositions(){ |
671 |
|
|
672 |
|
// cout << "void TrkTrack::GetClusterPositions() "<<endl; |
673 |
|
|
674 |
|
TrkParams::Load( ); |
675 |
|
if( !TrkParams::IsLoaded() )return false; |
676 |
|
|
677 |
|
for(int ip=0; ip<6; ip++){ |
678 |
|
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
679 |
|
int icx = GetClusterX_ID(ip)+1; |
680 |
|
int icy = GetClusterY_ID(ip)+1; |
681 |
|
int sensor = GetSensor(ip)+1;//<< convenzione "Paolo" |
682 |
|
if(ip==5 && sensor!=0)sensor=3-sensor;//<< convenzione "Elena" |
683 |
|
int ladder = GetLadder(ip)+1; |
684 |
|
float ax = axv[ip]; |
685 |
|
float ay = ayv[ip]; |
686 |
|
float v[3]; |
687 |
|
v[0]=xv[ip]; |
688 |
|
v[1]=yv[ip]; |
689 |
|
v[2]=zv[ip]; |
690 |
|
float bfx = 10*TrkParams::GetBX(v);//Tesla |
691 |
|
float bfy = 10*TrkParams::GetBY(v);//Tesla |
692 |
|
int ipp=ip+1; |
693 |
|
xyzpam_(&ipp,&icx,&icy,&ladder,&sensor,&ax,&ay,&bfx,&bfy); |
694 |
|
if(icx<0 || icy<0)return false; |
695 |
|
} |
696 |
|
return true; |
697 |
|
} |
698 |
|
/** |
699 |
|
* \brief Tracking method. It calls F77 mini routine. |
700 |
|
* |
701 |
|
* @param pfixed Particle momentum. If pfixed=0 the momentum |
702 |
|
* is left as a free parameter, otherwise it is fixed to the input value. |
703 |
|
* @param fail Output flag (!=0 if the fit failed). |
704 |
|
* @param iprint Flag to set debug mode ( 0 = no output; 1 = verbose; 2 = debug). |
705 |
|
* @param froml1 Flag to re-evaluate positions (see TrkTrack::GetClusterPositions()). |
706 |
|
* |
707 |
|
* The option to re-evaluate positions can be used only after recovering |
708 |
|
* level1 information, eg. by reprocessing the single event. |
709 |
|
* |
710 |
|
* Example: |
711 |
|
* |
712 |
|
* if( !event->GetTrkLevel0() )return false; |
713 |
|
* event->GetTrkLevel0()->ProcessEvent(); // re-processing level0->level1 |
714 |
|
* int fail=0; |
715 |
|
* event->GetTrkLevel2()->GetTrack(0)->Fit(0.,fail,0,1); |
716 |
|
* |
717 |
|
* @see EvaluateClusterPositions() |
718 |
|
* |
719 |
|
* The fitting procedure can be varied by changing the tracking mode, |
720 |
|
* the fit-precision factor and the minimum number of step. |
721 |
|
* @see SetTrackingMode(int) |
722 |
|
* @see SetPrecisionFactor(double) |
723 |
|
* @see SetStepMin(int) |
724 |
*/ |
*/ |
725 |
void TrkTrack::Fit(double pfixed, int& fail, int iprint){ |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
726 |
|
|
727 |
float al_ini[] = {0.,0.,0.,0.,0.}; |
float al_ini[] = {0.,0.,0.,0.,0.}; |
728 |
|
|
729 |
|
TrkParams::Load( ); |
730 |
|
if( !TrkParams::IsLoaded() )return; |
731 |
|
|
732 |
extern cMini2track track_; |
extern cMini2track track_; |
733 |
fail = 0; |
fail = 0; |
|
FillMiniStruct(track_); |
|
734 |
|
|
735 |
|
FillMiniStruct(track_); |
736 |
|
|
737 |
|
if(froml1!=0){ |
738 |
|
if( !EvaluateClusterPositions() ){ |
739 |
|
cout << "void TrkTrack::Fit("<<pfixed<<","<<fail<<","<<iprint<<","<<froml1<<") --- ERROR evaluating cluster positions "<<endl; |
740 |
|
FillMiniStruct(track_) ; |
741 |
|
fail = 1; |
742 |
|
return; |
743 |
|
} |
744 |
|
}else{ |
745 |
|
FillMiniStruct(track_); |
746 |
|
} |
747 |
|
|
748 |
// if fit variables have been reset, evaluate the initial guess |
// if fit variables have been reset, evaluate the initial guess |
749 |
if(al[0]==-9999.&&al[1]==-9999.&&al[2]==-9999.&&al[3]==-9999.&&al[4]==-9999.)guess_(); |
if(al[0]==-9999.&&al[1]==-9999.&&al[2]==-9999.&&al[3]==-9999.&&al[4]==-9999.)guess_(); |
750 |
|
|
763 |
|
|
764 |
// ------------------------------------------ |
// ------------------------------------------ |
765 |
// call mini routine |
// call mini routine |
766 |
|
// TrkParams::Load(1); |
767 |
|
// if( !TrkParams::IsLoaded(1) ){ |
768 |
|
// cout << "void TrkTrack::Fit(double pfixed, int& fail, int iprint) --- ERROR --- m.field not loaded"<<endl; |
769 |
|
// return; |
770 |
|
// } |
771 |
int istep=0; |
int istep=0; |
772 |
int ifail=0; |
int ifail=0; |
773 |
mini2_(&istep,&ifail, &iprint); |
mini2_(&istep,&ifail, &iprint); |
778 |
// ------------------------------------------ |
// ------------------------------------------ |
779 |
|
|
780 |
SetFromMiniStruct(&track_); |
SetFromMiniStruct(&track_); |
|
// cout << endl << "eta ===> " << track_.al[4] << endl; |
|
|
|
|
|
// for(int i=0; i<5; i++) al[i]=track_.al[i]; |
|
|
// chi2=track_.chi2; |
|
|
// nstep=track_.nstep; |
|
|
// for(int i=0; i<6; i++) xv[i]=track_.xv[i]; |
|
|
// for(int i=0; i<6; i++) yv[i]=track_.yv[i]; |
|
|
// for(int i=0; i<6; i++) zv[i]=track_.zv[i]; |
|
|
// for(int i=0; i<6; i++) axv[i]=track_.axv[i]; |
|
|
// for(int i=0; i<6; i++) ayv[i]=track_.ayv[i]; |
|
|
// for(int i=0; i<5; i++) { |
|
|
// for(int j=0; j<5; j++) coval[i][j]=track_.cov[i][j]; |
|
|
// } |
|
781 |
|
|
782 |
if(fail){ |
if(fail){ |
783 |
if(iprint)cout << " >>>> fit failed >>>> drawing initial par"<<endl; |
if(iprint)cout << " >>>> fit failed "<<endl; |
784 |
for(int i=0; i<5; i++) al[i]=al_ini[i]; |
for(int i=0; i<5; i++) al[i]=al_ini[i]; |
785 |
} |
} |
786 |
|
|
787 |
}; |
}; |
788 |
/* |
/** |
789 |
* Reset the fit parameters |
* Reset the fit parameters |
790 |
*/ |
*/ |
791 |
void TrkTrack::FitReset(){ |
void TrkTrack::FitReset(){ |
792 |
for(int i=0; i<5; i++) al[i]=-9999.; |
for(int i=0; i<5; i++) al[i]=-9999.; |
793 |
chi2=0.; |
chi2=0.; |
794 |
nstep=0; |
nstep=0; |
795 |
for(int i=0; i<6; i++) xv[i]=0.; |
// for(int i=0; i<6; i++) xv[i]=0.; |
796 |
for(int i=0; i<6; i++) yv[i]=0.; |
// for(int i=0; i<6; i++) yv[i]=0.; |
797 |
for(int i=0; i<6; i++) zv[i]=0.; |
// for(int i=0; i<6; i++) zv[i]=0.; |
798 |
for(int i=0; i<6; i++) axv[i]=0.; |
// for(int i=0; i<6; i++) axv[i]=0.; |
799 |
for(int i=0; i<6; i++) ayv[i]=0.; |
// for(int i=0; i<6; i++) ayv[i]=0.; |
800 |
for(int i=0; i<5; i++) { |
for(int i=0; i<5; i++) { |
801 |
for(int j=0; j<5; j++) coval[i][j]=0.; |
for(int j=0; j<5; j++) coval[i][j]=0.; |
802 |
} |
} |
803 |
} |
} |
804 |
|
/** |
805 |
|
* Set the tracking mode |
806 |
|
*/ |
807 |
|
void TrkTrack::SetTrackingMode(int trackmode){ |
808 |
|
extern cMini2track track_; |
809 |
|
track_.trackmode = trackmode; |
810 |
|
} |
811 |
|
/** |
812 |
|
* Set the factor scale for tracking precision |
813 |
|
*/ |
814 |
|
void TrkTrack::SetPrecisionFactor(double fact){ |
815 |
|
extern cMini2track track_; |
816 |
|
track_.fact = fact; |
817 |
|
} |
818 |
|
/** |
819 |
|
* Set the minimum number of steps for tracking precision |
820 |
|
*/ |
821 |
|
void TrkTrack::SetStepMin(int istepmin){ |
822 |
|
extern cMini2track track_; |
823 |
|
track_.istepmin = istepmin; |
824 |
|
} |
825 |
|
/** |
826 |
|
* Returns 1 if the track is inside the magnet cavity |
827 |
|
* Set the minimum number of steps for tracking precision |
828 |
|
*/ |
829 |
|
Bool_t TrkTrack::IsInsideCavity(){ |
830 |
|
float xmagntop, ymagntop, xmagnbottom, ymagnbottom; |
831 |
|
xmagntop = xv[0] + (ZMAGNHIGH-zv[0])*tan(cos(-1.0)*axv[0]/180.); |
832 |
|
ymagntop = yv[0] + (ZMAGNHIGH-zv[0])*tan(cos(-1.0)*ayv[0]/180.); |
833 |
|
xmagnbottom = xv[5] + (ZMAGNLOW-zv[5])*tan(cos(-1.0)*axv[5]/180.); |
834 |
|
ymagnbottom = yv[5] + (ZMAGNLOW-zv[5])*tan(cos(-1.0)*ayv[5]/180.); |
835 |
|
if( xmagntop>XMAGNLOW && xmagntop<XMAGNHIGH && |
836 |
|
ymagntop>YMAGNLOW && ymagntop<YMAGNHIGH && |
837 |
|
xmagnbottom>XMAGNLOW && xmagnbottom<XMAGNHIGH && |
838 |
|
ymagnbottom>YMAGNLOW && ymagnbottom<YMAGNHIGH ) return(true); |
839 |
|
else return(false); |
840 |
|
} |
841 |
|
/** |
842 |
|
* Method to retrieve ID (0,1,...) of x-cluster (if any) associated to this track. |
843 |
|
* If no cluster is associated, ID=-1. |
844 |
|
* @param ip Tracker plane (0-5) |
845 |
|
*/ |
846 |
|
Int_t TrkTrack::GetClusterX_ID(int ip){ |
847 |
|
return ((Int_t)fabs(xgood[ip]))%10000000-1; |
848 |
|
}; |
849 |
|
/** |
850 |
|
* Method to retrieve ID (0-xxx) of y-cluster (if any) associated to this track. |
851 |
|
* If no cluster is associated, ID=-1. |
852 |
|
* @param ip Tracker plane (0-5) |
853 |
|
*/ |
854 |
|
Int_t TrkTrack::GetClusterY_ID(int ip){ |
855 |
|
return ((Int_t)fabs(ygood[ip]))%10000000-1; |
856 |
|
}; |
857 |
|
/** |
858 |
|
* Method to retrieve the ladder (0-4, increasing x) traversed by the track on this plane. |
859 |
|
* If no ladder is traversed (dead area) the metod retuns -1. |
860 |
|
* @param ip Tracker plane (0-5) |
861 |
|
*/ |
862 |
|
Int_t TrkTrack::GetLadder(int ip){ |
863 |
|
if(XGood(ip))return (Int_t)fabs(xgood[ip]/100000000)-1; |
864 |
|
if(YGood(ip))return (Int_t)fabs(ygood[ip]/100000000)-1; |
865 |
|
return -1; |
866 |
|
}; |
867 |
|
/** |
868 |
|
* Method to retrieve the sensor (0-1, increasing y) traversed by the track on this plane. |
869 |
|
* If no sensor is traversed (dead area) the metod retuns -1. |
870 |
|
* @param ip Tracker plane (0-5) |
871 |
|
*/ |
872 |
|
Int_t TrkTrack::GetSensor(int ip){ |
873 |
|
if(XGood(ip))return (Int_t)((Int_t)fabs(xgood[ip]/10000000)%10)-1; |
874 |
|
if(YGood(ip))return (Int_t)((Int_t)fabs(ygood[ip]/10000000)%10)-1; |
875 |
|
return -1; |
876 |
|
}; |
877 |
|
|
878 |
|
/** |
879 |
|
* \brief Method to include a x-cluster to the track. |
880 |
|
* @param ip Tracker plane (0-5) |
881 |
|
* @param clid Cluster ID (0,1,...) |
882 |
|
* @param is Sensor (0-1, increasing y) |
883 |
|
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
884 |
|
*/ |
885 |
|
void TrkTrack::SetXGood(int ip, int clid, int is){ |
886 |
|
int il=0; //ladder (temporary) |
887 |
|
bool bad=false; //ladder (temporary) |
888 |
|
xgood[ip]=il*100000000+is*10000000+clid; |
889 |
|
if(bad)xgood[ip]=-xgood[ip]; |
890 |
|
}; |
891 |
|
/** |
892 |
|
* \brief Method to include a y-cluster to the track. |
893 |
|
* @param ip Tracker plane (0-5) |
894 |
|
* @param clid Cluster ID (0,1,...) |
895 |
|
* @param is Sensor (0-1) |
896 |
|
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
897 |
|
*/ |
898 |
|
void TrkTrack::SetYGood(int ip, int clid, int is){ |
899 |
|
int il=0; //ladder (temporary) |
900 |
|
bool bad=false; //ladder (temporary) |
901 |
|
ygood[ip]=il*100000000+is*10000000+clid; |
902 |
|
if(bad)ygood[ip]=-ygood[ip]; |
903 |
|
}; |
904 |
|
|
905 |
//-------------------------------------- |
//-------------------------------------- |
906 |
// |
// |
924 |
zm[ip] = 0; |
zm[ip] = 0; |
925 |
resx[ip] = 0; |
resx[ip] = 0; |
926 |
resy[ip] = 0; |
resy[ip] = 0; |
927 |
|
tailx[ip] = 0; |
928 |
|
taily[ip] = 0; |
929 |
xv[ip] = 0; |
xv[ip] = 0; |
930 |
yv[ip] = 0; |
yv[ip] = 0; |
931 |
zv[ip] = 0; |
zv[ip] = 0; |
935 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
936 |
|
|
937 |
}; |
}; |
938 |
if(clx)clx->Clear(); |
// if(clx)clx->Clear(); |
939 |
if(cly)cly->Clear(); |
// if(cly)cly->Clear(); |
940 |
|
// clx.Clear(); |
941 |
|
// cly.Clear(); |
942 |
}; |
}; |
943 |
//-------------------------------------- |
//-------------------------------------- |
944 |
// |
// |
946 |
//-------------------------------------- |
//-------------------------------------- |
947 |
void TrkTrack::Delete(){ |
void TrkTrack::Delete(){ |
948 |
// cout << "TrkTrack::Delete()"<<endl; |
// cout << "TrkTrack::Delete()"<<endl; |
949 |
// Clear(); |
Clear(); |
950 |
if(clx)delete clx; |
// if(clx)delete clx; |
951 |
if(cly)delete cly; |
// if(cly)delete cly; |
952 |
}; |
}; |
953 |
//-------------------------------------- |
//-------------------------------------- |
954 |
// |
// |
978 |
coord[1] = s.coord[1]; |
coord[1] = s.coord[1]; |
979 |
sgnl = s.sgnl; |
sgnl = s.sgnl; |
980 |
// cls = 0;//<<<<pointer |
// cls = 0;//<<<<pointer |
981 |
cls = TRef(s.cls); |
// cls = TRef(s.cls); |
982 |
}; |
}; |
983 |
//-------------------------------------- |
//-------------------------------------- |
984 |
// |
// |
1011 |
TrkLevel2::TrkLevel2(){ |
TrkLevel2::TrkLevel2(){ |
1012 |
// cout <<"TrkLevel2::TrkLevel2()"<<endl; |
// cout <<"TrkLevel2::TrkLevel2()"<<endl; |
1013 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
1014 |
good[i] = -1; |
good[i] = -1; |
1015 |
}; |
VKmask[i] = 0; |
1016 |
// okkio!! memory-leak |
VKflag[i] = 0; |
1017 |
// Track = new TClonesArray("TrkTrack"); |
}; |
|
// SingletX = new TClonesArray("TrkSinglet"); |
|
|
// SingletY = new TClonesArray("TrkSinglet"); |
|
1018 |
Track = 0; |
Track = 0; |
1019 |
SingletX = 0; |
SingletX = 0; |
1020 |
SingletY = 0; |
SingletY = 0; |
1041 |
cout << endl << "ntrk() : " << this->ntrk() ; |
cout << endl << "ntrk() : " << this->ntrk() ; |
1042 |
cout << endl << "nclsx() : " << this->nclsx(); |
cout << endl << "nclsx() : " << this->nclsx(); |
1043 |
cout << endl << "nclsy() : " << this->nclsy(); |
cout << endl << "nclsy() : " << this->nclsy(); |
|
// TClonesArray &t = *Track; |
|
|
// TClonesArray &sx = *SingletX; |
|
|
// TClonesArray &sy = *SingletY; |
|
|
// for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
|
|
// for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
|
|
// for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
|
1044 |
if(Track){ |
if(Track){ |
1045 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1046 |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
1054 |
for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
1055 |
} |
} |
1056 |
} |
} |
1057 |
|
/** |
1058 |
|
* \brief Dump processing status |
1059 |
|
*/ |
1060 |
|
void TrkLevel2::StatusDump(int view){ |
1061 |
|
cout << "DSP n. "<<view+1<<" status: "<<hex<<good[view]<<endl; |
1062 |
|
}; |
1063 |
|
/** |
1064 |
|
* \brief Check event status |
1065 |
|
* |
1066 |
|
* Check the event status, according to a flag-mask given as input. |
1067 |
|
* Return true if the view passes the check. |
1068 |
|
* |
1069 |
|
* @param view View number (0-11) |
1070 |
|
* @param flagmask Mask of flags to check (eg. flagmask=0x111 no missing packet, |
1071 |
|
* no crc error, no software alarm) |
1072 |
|
* |
1073 |
|
* @see TrkLevel2 class definition to know how the status flag is defined |
1074 |
|
* |
1075 |
|
*/ |
1076 |
|
Bool_t TrkLevel2::StatusCheck(int view, int flagmask){ |
1077 |
|
|
1078 |
|
if( view<0 || view >= 12)return false; |
1079 |
|
return !(good[view]&flagmask); |
1080 |
|
|
1081 |
|
}; |
1082 |
|
|
1083 |
|
|
1084 |
//-------------------------------------- |
//-------------------------------------- |
1085 |
// |
// |
1086 |
// |
// |
1087 |
//-------------------------------------- |
//-------------------------------------- |
1088 |
/** |
/** |
1089 |
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
* The method returns false if the viking-chip was masked |
1090 |
|
* either apriori ,on the basis of the mask read from the DB, |
1091 |
|
* or run-by-run, on the basis of the calibration parameters) |
1092 |
|
* @param iv Tracker view (0-11) |
1093 |
|
* @param ivk Viking-chip number (0-23) |
1094 |
|
*/ |
1095 |
|
Bool_t TrkLevel2::GetVKMask(int iv, int ivk){ |
1096 |
|
Int_t whichbit = (Int_t)pow(2,ivk); |
1097 |
|
return (whichbit&VKmask[iv])!=0; |
1098 |
|
} |
1099 |
|
/** |
1100 |
|
* The method returns false if the viking-chip was masked |
1101 |
|
* for this event due to common-noise computation failure. |
1102 |
|
* @param iv Tracker view (0-11) |
1103 |
|
* @param ivk Viking-chip number (0-23) |
1104 |
|
*/ |
1105 |
|
Bool_t TrkLevel2::GetVKFlag(int iv, int ivk){ |
1106 |
|
Int_t whichbit = (Int_t)pow(2,ivk); |
1107 |
|
return (whichbit&VKflag[iv])!=0; |
1108 |
|
} |
1109 |
|
/** |
1110 |
|
* The method returns true if the viking-chip was masked, either |
1111 |
|
* forced (see TrkLevel2::GetVKMask(int,int)) or |
1112 |
|
* for this event only (TrkLevel2::GetVKFlag(int,int)). |
1113 |
|
* @param iv Tracker view (0-11) |
1114 |
|
* @param ivk Viking-chip number (0-23) |
1115 |
*/ |
*/ |
1116 |
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2){ |
Bool_t TrkLevel2::IsMaskedVK(int iv, int ivk){ |
1117 |
|
return !(GetVKMask(iv,ivk)&&GetVKFlag(iv,ivk) ); |
1118 |
|
}; |
1119 |
|
|
1120 |
// temporary objects: |
//-------------------------------------- |
1121 |
|
// |
1122 |
|
// |
1123 |
|
//-------------------------------------- |
1124 |
|
/** |
1125 |
|
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
1126 |
|
* Ref to Level1 data (clusters) is also set. If l1==NULL no references are set. |
1127 |
|
* (NB It make sense to set references only if events are stored in a tree that contains also the Level1 branch) |
1128 |
|
*/ |
1129 |
|
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2, TrkLevel1 *l1){ |
1130 |
|
|
1131 |
|
// cout << "void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2, TrkLevel1 *l1)"<<endl; |
1132 |
|
Clear(); |
1133 |
|
|
1134 |
|
// temporary objects: |
1135 |
TrkSinglet* t_singlet = new TrkSinglet(); |
TrkSinglet* t_singlet = new TrkSinglet(); |
1136 |
TrkTrack* t_track = new TrkTrack(); |
TrkTrack* t_track = new TrkTrack(); |
1137 |
|
|
1138 |
// **** general variables **** |
// ----------------- |
1139 |
// good2 = l2->good2; |
// general variables |
1140 |
|
// ----------------- |
1141 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
1142 |
// crc[i] = l2->crc[i]; |
good[i] = l2->good[i]; |
1143 |
good[i] = l2->good[i]; |
VKmask[i]=0; |
1144 |
|
VKflag[i]=0; |
1145 |
|
for(Int_t ii=0; ii<24 ; ii++){ |
1146 |
|
Int_t setbit = (Int_t)pow(2,ii); |
1147 |
|
if( l2->vkflag[ii][i]!=-1 )VKmask[i]=VKmask[i]|setbit; |
1148 |
|
if( l2->vkflag[ii][i]!=0 )VKflag[i]=VKflag[i]|setbit; |
1149 |
}; |
}; |
1150 |
// *** TRACKS *** |
}; |
1151 |
|
// -------------- |
1152 |
|
// *** TRACKS *** |
1153 |
|
// -------------- |
1154 |
if(!Track) Track = new TClonesArray("TrkTrack"); |
if(!Track) Track = new TClonesArray("TrkTrack"); |
1155 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1156 |
|
|
1157 |
for(int i=0; i<l2->ntrk; i++){ |
for(int i=0; i<l2->ntrk; i++){ |
1158 |
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
1159 |
t_track->image = l2->image[i]-1; |
t_track->image = l2->image[i]-1; |
|
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
|
1160 |
t_track->chi2 = l2->chi2_nt[i]; |
t_track->chi2 = l2->chi2_nt[i]; |
1161 |
t_track->nstep = l2->nstep_nt[i]; |
t_track->nstep = l2->nstep_nt[i]; |
1162 |
for(int it1=0;it1<5;it1++){ |
for(int it1=0;it1<5;it1++){ |
1165 |
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
1166 |
}; |
}; |
1167 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
1168 |
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
// --------------------------------- |
1169 |
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
// new implementation of xgood/ygood |
1170 |
|
// --------------------------------- |
1171 |
|
t_track->xgood[ip] = l2->cltrx[i][ip]; //cluster ID |
1172 |
|
t_track->ygood[ip] = l2->cltry[i][ip]; //cluster ID |
1173 |
|
t_track->xgood[ip] += 10000000*l2->ls[i][ip]; // ladder+sensor |
1174 |
|
t_track->ygood[ip] += 10000000*l2->ls[i][ip]; // ladder+sensor |
1175 |
|
if(l2->xbad[i][ip]>0)t_track->xgood[ip]=-t_track->xgood[ip]; |
1176 |
|
if(l2->ybad[i][ip]>0)t_track->ygood[ip]=-t_track->ygood[ip]; |
1177 |
|
// if(l2->xbad[i][ip]>0 || l2->ybad[i][ip]>0){ |
1178 |
|
// if(l2->dedx_x[i][ip]<0 || l2->dedx_y[i][ip]<0){ |
1179 |
|
// cout << ip << " - "<< l2->cltrx[i][ip] << " "<<l2->cltry[i][ip]<<" "<<l2->ls[i][ip]<<endl; |
1180 |
|
// cout << ip << " - "<<t_track->xgood[ip]<<" "<<t_track->ygood[ip]<<endl; |
1181 |
|
// cout << ip << " - "<<t_track->GetClusterX_ID(ip)<<" "<<t_track->GetClusterY_ID(ip)<<" "<<t_track->GetLadder(ip)<<" "<<t_track->GetSensor(ip)<<endl; |
1182 |
|
// cout << ip << " - "<<t_track->BadClusterX(ip)<<" "<<t_track->BadClusterY(ip)<<endl; |
1183 |
|
// cout << ip << " - "<<t_track->SaturatedClusterX(ip)<<" "<<t_track->SaturatedClusterY(ip)<<endl; |
1184 |
|
// } |
1185 |
t_track->xm[ip] = l2->xm_nt[i][ip]; |
t_track->xm[ip] = l2->xm_nt[i][ip]; |
1186 |
t_track->ym[ip] = l2->ym_nt[i][ip]; |
t_track->ym[ip] = l2->ym_nt[i][ip]; |
1187 |
t_track->zm[ip] = l2->zm_nt[i][ip]; |
t_track->zm[ip] = l2->zm_nt[i][ip]; |
1188 |
t_track->resx[ip] = l2->resx_nt[i][ip]; |
t_track->resx[ip] = l2->resx_nt[i][ip]; |
1189 |
t_track->resy[ip] = l2->resy_nt[i][ip]; |
t_track->resy[ip] = l2->resy_nt[i][ip]; |
1190 |
|
t_track->tailx[ip] = l2->tailx[i][ip]; |
1191 |
|
t_track->taily[ip] = l2->taily[i][ip]; |
1192 |
t_track->xv[ip] = l2->xv_nt[i][ip]; |
t_track->xv[ip] = l2->xv_nt[i][ip]; |
1193 |
t_track->yv[ip] = l2->yv_nt[i][ip]; |
t_track->yv[ip] = l2->yv_nt[i][ip]; |
1194 |
t_track->zv[ip] = l2->zv_nt[i][ip]; |
t_track->zv[ip] = l2->zv_nt[i][ip]; |
1196 |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
1197 |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
1198 |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
1199 |
// t_track->clx[ip] = 0; |
//----------------------------------------------------- |
1200 |
// t_track->cly[ip] = 0; |
//----------------------------------------------------- |
1201 |
|
//----------------------------------------------------- |
1202 |
|
//----------------------------------------------------- |
1203 |
}; |
}; |
1204 |
|
// if(t_track->IsSaturated())t_track->Dump(); |
1205 |
new(t[i]) TrkTrack(*t_track); |
new(t[i]) TrkTrack(*t_track); |
1206 |
t_track->Clear(); |
t_track->Clear(); |
1207 |
}; |
}; |
1208 |
|
|
1209 |
|
// ---------------- |
1210 |
// *** SINGLETS *** |
// *** SINGLETS *** |
1211 |
|
// ---------------- |
1212 |
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
1213 |
TClonesArray &sx = *SingletX; |
TClonesArray &sx = *SingletX; |
1214 |
for(int i=0; i<l2->nclsx; i++){ |
for(int i=0; i<l2->nclsx; i++){ |
1216 |
t_singlet->coord[0] = l2->xs[i][0]; |
t_singlet->coord[0] = l2->xs[i][0]; |
1217 |
t_singlet->coord[1] = l2->xs[i][1]; |
t_singlet->coord[1] = l2->xs[i][1]; |
1218 |
t_singlet->sgnl = l2->signlxs[i]; |
t_singlet->sgnl = l2->signlxs[i]; |
1219 |
// t_singlet->cls = 0; |
//----------------------------------------------------- |
1220 |
|
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
1221 |
|
//----------------------------------------------------- |
1222 |
new(sx[i]) TrkSinglet(*t_singlet); |
new(sx[i]) TrkSinglet(*t_singlet); |
1223 |
t_singlet->Clear(); |
t_singlet->Clear(); |
1224 |
} |
} |
1229 |
t_singlet->coord[0] = l2->ys[i][0]; |
t_singlet->coord[0] = l2->ys[i][0]; |
1230 |
t_singlet->coord[1] = l2->ys[i][1]; |
t_singlet->coord[1] = l2->ys[i][1]; |
1231 |
t_singlet->sgnl = l2->signlys[i]; |
t_singlet->sgnl = l2->signlys[i]; |
1232 |
// t_singlet->cls = 0; |
//----------------------------------------------------- |
1233 |
|
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
1234 |
|
//----------------------------------------------------- |
1235 |
new(sy[i]) TrkSinglet(*t_singlet); |
new(sy[i]) TrkSinglet(*t_singlet); |
1236 |
t_singlet->Clear(); |
t_singlet->Clear(); |
1237 |
}; |
}; |
1239 |
delete t_track; |
delete t_track; |
1240 |
delete t_singlet; |
delete t_singlet; |
1241 |
} |
} |
|
//-------------------------------------- |
|
|
// |
|
|
// |
|
|
//-------------------------------------- |
|
|
/** |
|
|
* Fills a TrkLevel2 object with values from a struct cTrkLevel2 (to get data from F77 common). |
|
|
* Ref to Level1 data (clusters) is also set. |
|
|
*/ |
|
|
void TrkLevel2::SetFromLevel2Struct(cTrkLevel2 *l2, TrkLevel1 *l1){ |
|
|
|
|
|
// temporary objects: |
|
|
TrkSinglet* t_singlet = new TrkSinglet(); |
|
|
TrkTrack* t_track = new TrkTrack(); |
|
|
// general variables |
|
|
// good2 = l2->good2; |
|
|
for(Int_t i=0; i<12 ; i++){ |
|
|
// crc[i] = l2->crc[i]; |
|
|
good[i] = l2->good[i]; |
|
|
}; |
|
|
// *** TRACKS *** |
|
|
if(!Track) Track = new TClonesArray("TrkTrack"); |
|
|
TClonesArray &t = *Track; |
|
|
if(!t_track->clx)t_track->clx = new TRefArray(6,0); |
|
|
if(!t_track->cly)t_track->cly = new TRefArray(6,0); |
|
|
for(int i=0; i<l2->ntrk; i++){ |
|
|
t_track->seqno = i;// NBNBNBNB deve sempre essere = i |
|
|
t_track->image = l2->image[i]-1; |
|
|
// cout << "track "<<i<<t_track->seqno << t_track->image<<endl; |
|
|
t_track->chi2 = l2->chi2_nt[i]; |
|
|
t_track->nstep = l2->nstep_nt[i]; |
|
|
for(int it1=0;it1<5;it1++){ |
|
|
t_track->al[it1] = l2->al_nt[i][it1]; |
|
|
for(int it2=0;it2<5;it2++) |
|
|
t_track->coval[it1][it2] = l2->coval[i][it2][it1]; |
|
|
}; |
|
|
for(int ip=0;ip<6;ip++){ |
|
|
t_track->xgood[ip] = l2->xgood_nt[i][ip]; |
|
|
t_track->ygood[ip] = l2->ygood_nt[i][ip]; |
|
|
t_track->xm[ip] = l2->xm_nt[i][ip]; |
|
|
t_track->ym[ip] = l2->ym_nt[i][ip]; |
|
|
t_track->zm[ip] = l2->zm_nt[i][ip]; |
|
|
t_track->resx[ip] = l2->resx_nt[i][ip]; |
|
|
t_track->resy[ip] = l2->resy_nt[i][ip]; |
|
|
t_track->xv[ip] = l2->xv_nt[i][ip]; |
|
|
t_track->yv[ip] = l2->yv_nt[i][ip]; |
|
|
t_track->zv[ip] = l2->zv_nt[i][ip]; |
|
|
t_track->axv[ip] = l2->axv_nt[i][ip]; |
|
|
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
|
|
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
|
|
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
|
|
// cout << "traccia "<<i<<" -- "<< ip << " "<< l2->cltrx[i][ip] <<" "<< l2->cltry[i][ip] <<" "<< t_track->xgood[ip] << t_track->ygood[ip]<<endl; |
|
|
//----------------------------------------------------- |
|
|
//----------------------------------------------------- |
|
|
if(t_track->xgood[ip])t_track->clx->AddAt(l1->GetCluster(l2->cltrx[i][ip]-1),ip); |
|
|
if(t_track->ygood[ip])t_track->cly->AddAt(l1->GetCluster(l2->cltry[i][ip]-1),ip); |
|
|
// 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; |
|
|
// 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; |
|
|
//----------------------------------------------------- |
|
|
//----------------------------------------------------- |
|
|
}; |
|
|
new(t[i]) TrkTrack(*t_track); |
|
|
t_track->Clear(); |
|
|
}; |
|
|
// *** SINGLETS *** |
|
|
if(!SingletX)SingletX = new TClonesArray("TrkSinglet"); |
|
|
TClonesArray &sx = *SingletX; |
|
|
for(int i=0; i<l2->nclsx; i++){ |
|
|
t_singlet->plane = l2->planex[i]; |
|
|
t_singlet->coord[0] = l2->xs[i][0]; |
|
|
t_singlet->coord[1] = l2->xs[i][1]; |
|
|
t_singlet->sgnl = l2->signlxs[i]; |
|
|
//----------------------------------------------------- |
|
|
// cout << "singolo x "<<i<<" -- "<< l2->clsx[i] <<endl; |
|
|
t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
|
|
// cout<<" i "<<i<<" l2->clsx[i] "<<l2->clsx[i]<< " l1->GetCluster(l2->clsx[i]-1) "<<l1->GetCluster(l2->clsx[i]-1)<<endl; |
|
|
//----------------------------------------------------- |
|
|
new(sx[i]) TrkSinglet(*t_singlet); |
|
|
t_singlet->Clear(); |
|
|
} |
|
|
if(!SingletY)SingletY = new TClonesArray("TrkSinglet"); |
|
|
TClonesArray &sy = *SingletY; |
|
|
for(int i=0; i<l2->nclsy; i++){ |
|
|
t_singlet->plane = l2->planey[i]; |
|
|
t_singlet->coord[0] = l2->ys[i][0]; |
|
|
t_singlet->coord[1] = l2->ys[i][1]; |
|
|
t_singlet->sgnl = l2->signlys[i]; |
|
|
//----------------------------------------------------- |
|
|
// cout << "singolo y "<<i<<" -- "<< l2->clsy[i] <<endl; |
|
|
t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
|
|
// cout<<" i "<<i<<" l2->clsy[i] "<<l2->clsy[i]<< " l1->GetCluster(l2->clsy[i]-1) "<<l1->GetCluster(l2->clsy[i]-1)<<endl; |
|
|
//----------------------------------------------------- |
|
|
new(sy[i]) TrkSinglet(*t_singlet); |
|
|
t_singlet->Clear(); |
|
|
}; |
|
|
|
|
|
delete t_track; |
|
|
delete t_singlet; |
|
|
} |
|
1242 |
/** |
/** |
1243 |
* Fills a struct cTrkLevel2 with values from a TrkLevel2 object (to put data into a F77 common). |
* Fills a struct cTrkLevel2 with values from a TrkLevel2 object (to put data into a F77 common). |
1244 |
*/ |
*/ |
1265 |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
l2->coval[i][it2][it1] = ((TrkTrack *)Track->At(i))->coval[it1][it2]; |
1266 |
}; |
}; |
1267 |
for(int ip=0;ip<6;ip++){ |
for(int ip=0;ip<6;ip++){ |
1268 |
l2->xgood_nt[i][ip] = ((TrkTrack *)Track->At(i))->xgood[ip]; |
l2->xgood_nt[i][ip] = ((TrkTrack *)Track->At(i))->XGood(ip); |
1269 |
l2->ygood_nt[i][ip] = ((TrkTrack *)Track->At(i))->ygood[ip]; |
l2->ygood_nt[i][ip] = ((TrkTrack *)Track->At(i))->YGood(ip); |
1270 |
l2->xm_nt[i][ip] = ((TrkTrack *)Track->At(i))->xm[ip]; |
l2->xm_nt[i][ip] = ((TrkTrack *)Track->At(i))->xm[ip]; |
1271 |
l2->ym_nt[i][ip] = ((TrkTrack *)Track->At(i))->ym[ip]; |
l2->ym_nt[i][ip] = ((TrkTrack *)Track->At(i))->ym[ip]; |
1272 |
l2->zm_nt[i][ip] = ((TrkTrack *)Track->At(i))->zm[ip]; |
l2->zm_nt[i][ip] = ((TrkTrack *)Track->At(i))->zm[ip]; |
1273 |
l2->resx_nt[i][ip] = ((TrkTrack *)Track->At(i))->resx[ip]; |
l2->resx_nt[i][ip] = ((TrkTrack *)Track->At(i))->resx[ip]; |
1274 |
l2->resy_nt[i][ip] = ((TrkTrack *)Track->At(i))->resy[ip]; |
l2->resy_nt[i][ip] = ((TrkTrack *)Track->At(i))->resy[ip]; |
1275 |
|
l2->tailx[i][ip] = ((TrkTrack *)Track->At(i))->tailx[ip]; |
1276 |
|
l2->taily[i][ip] = ((TrkTrack *)Track->At(i))->taily[ip]; |
1277 |
l2->xv_nt[i][ip] = ((TrkTrack *)Track->At(i))->xv[ip]; |
l2->xv_nt[i][ip] = ((TrkTrack *)Track->At(i))->xv[ip]; |
1278 |
l2->yv_nt[i][ip] = ((TrkTrack *)Track->At(i))->yv[ip]; |
l2->yv_nt[i][ip] = ((TrkTrack *)Track->At(i))->yv[ip]; |
1279 |
l2->zv_nt[i][ip] = ((TrkTrack *)Track->At(i))->zv[ip]; |
l2->zv_nt[i][ip] = ((TrkTrack *)Track->At(i))->zv[ip]; |
1312 |
void TrkLevel2::Clear(){ |
void TrkLevel2::Clear(){ |
1313 |
for(Int_t i=0; i<12 ; i++){ |
for(Int_t i=0; i<12 ; i++){ |
1314 |
good[i] = -1; |
good[i] = -1; |
1315 |
|
VKflag[i] = 0; |
1316 |
|
VKmask[i] = 0; |
1317 |
}; |
}; |
1318 |
// if(Track)Track->Clear("C"); |
// if(Track)Track->Clear("C"); |
1319 |
// if(SingletX)SingletX->Clear("C"); |
// if(SingletX)SingletX->Clear("C"); |
1357 |
|
|
1358 |
int indo=0; |
int indo=0; |
1359 |
int indi=0; |
int indi=0; |
1360 |
while(N != 0){ |
while(N > 0){ |
1361 |
|
// while(N != 0){ |
1362 |
int nfit =0; |
int nfit =0; |
1363 |
float chi2ref = numeric_limits<float>::max(); |
float chi2ref = numeric_limits<float>::max(); |
1364 |
|
|
1369 |
} |
} |
1370 |
} |
} |
1371 |
//second loop to search minimum chi2 among selected |
//second loop to search minimum chi2 among selected |
1372 |
for(int i=0; i<this->ntrk(); i++){ |
for(int i=0; i<ntrk(); i++){ |
1373 |
Float_t chi2 = ((TrkTrack *)t[i])->chi2; |
Float_t chi2 = ((TrkTrack *)t[i])->chi2; |
1374 |
if(chi2 < 0) chi2 = chi2*1000; |
if(chi2 < 0) chi2 = -chi2*1000; |
1375 |
if( chi2 < chi2ref |
if( chi2 < chi2ref |
1376 |
&& ((TrkTrack *)t[i])->GetNtot() == nfit |
&& ((TrkTrack *)t[i])->GetNtot() == nfit |
1377 |
&& m[i]==1){ |
&& m[i]==1){ |
1383 |
m[((TrkTrack *)t[indi])->image] = 0; |
m[((TrkTrack *)t[indi])->image] = 0; |
1384 |
N--; |
N--; |
1385 |
|
|
1386 |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
1387 |
}; |
}; |
1388 |
sorted->Add( (TrkTrack*)t[indi] ); |
sorted->Add( (TrkTrack*)t[indi] ); |
1389 |
|
|
1390 |
m[indi] = 0; |
m[indi] = 0; |
1391 |
// cout << "SORTED "<< indo << " "<< indi << " "<< N << endl; |
// cout << "SORTED "<< indo << " "<< indi << " "<< N << " "<<((TrkTrack *)t[indi])->image<<" "<<chi2ref<<endl; |
1392 |
N--; |
N--; |
1393 |
indo++; |
indo++; |
1394 |
} |
} |
1395 |
m.clear(); |
m.clear(); |
1396 |
// cout << "GetTracks_NFitSorted(it): Done"<< endl; |
// cout << "GetTracks_NFitSorted(it): Done"<< endl; |
1397 |
|
|
1398 |
return sorted; |
return sorted; |
1399 |
// return PhysicalTrack; |
// return PhysicalTrack; |
1543 |
*/ |
*/ |
1544 |
void TrkLevel2::LoadField(TString path){ |
void TrkLevel2::LoadField(TString path){ |
1545 |
// |
// |
1546 |
strcpy(path_.path,path.Data()); |
// strcpy(path_.path,path.Data()); |
1547 |
path_.pathlen = path.Length(); |
// path_.pathlen = path.Length(); |
1548 |
path_.error = 0; |
// path_.error = 0; |
1549 |
readb_(); |
// readb_(); |
1550 |
|
|
1551 |
|
TrkParams::SetTrackingMode(); |
1552 |
|
TrkParams::SetPrecisionFactor(); |
1553 |
|
TrkParams::SetStepMin(); |
1554 |
|
|
1555 |
|
TrkParams::Set(path,1); |
1556 |
|
TrkParams::Load(1); |
1557 |
|
|
1558 |
// |
// |
1559 |
}; |
}; |
1560 |
|
// /** |
1561 |
|
// * Get BY (kGauss) |
1562 |
|
// * @param v (x,y,z) coordinates in cm |
1563 |
|
// */ |
1564 |
|
// float TrkLevel2::GetBX(float* v){ |
1565 |
|
// float b[3]; |
1566 |
|
// gufld_(v,b); |
1567 |
|
// return b[0]/10.; |
1568 |
|
// } |
1569 |
|
// /** |
1570 |
|
// * Get BY (kGauss) |
1571 |
|
// * @param v (x,y,z) coordinates in cm |
1572 |
|
// */ |
1573 |
|
// float TrkLevel2::GetBY(float* v){ |
1574 |
|
// float b[3]; |
1575 |
|
// gufld_(v,b); |
1576 |
|
// return b[1]/10.; |
1577 |
|
// } |
1578 |
|
// /** |
1579 |
|
// * Get BY (kGauss) |
1580 |
|
// * @param v (x,y,z) coordinates in cm |
1581 |
|
// */ |
1582 |
|
// float TrkLevel2::GetBZ(float* v){ |
1583 |
|
// float b[3]; |
1584 |
|
// gufld_(v,b); |
1585 |
|
// return b[2]/10.; |
1586 |
|
// } |
1587 |
//-------------------------------------- |
//-------------------------------------- |
1588 |
// |
// |
1589 |
// |
// |
1761 |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
1762 |
for (int i=0; i<npoint; i++) dzin[i] = (double)z[i]; |
for (int i=0; i<npoint; i++) dzin[i] = (double)z[i]; |
1763 |
|
|
1764 |
|
TrkParams::Load(1); |
1765 |
|
if( !TrkParams::IsLoaded(1) ){ |
1766 |
|
cout << "int Trajectory::DoTrack2(float* al) --- ERROR --- m.field not loaded"<<endl; |
1767 |
|
return 0; |
1768 |
|
} |
1769 |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
1770 |
|
|
1771 |
for (int i=0; i<npoint; i++){ |
for (int i=0; i<npoint; i++){ |