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 |
|
void dotrack3_(int*, double*, double*, double*, double*,double*, double*, double*,double*,int*); |
16 |
void mini2_(int*,int*,int*); |
void mini2_(int*,int*,int*); |
17 |
void guess_(); |
void guess_(); |
18 |
void gufld_(float*, float*); |
void gufld_(float*, float*); |
53 |
ayv[ip] = 0; |
ayv[ip] = 0; |
54 |
dedx_x[ip] = 0; |
dedx_x[ip] = 0; |
55 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
56 |
|
multmaxx[ip] = 0; |
57 |
|
multmaxy[ip] = 0; |
58 |
|
seedx[ip] = 0; |
59 |
|
seedy[ip] = 0; |
60 |
|
xpu[ip] = 0; |
61 |
|
ypu[ip] = 0; |
62 |
|
|
63 |
}; |
}; |
64 |
// clx = 0; |
|
65 |
// cly = 0; |
// TrkParams::SetTrackingMode(); |
66 |
// clx = new TRefArray(6,0); //forse causa memory leak??? |
// TrkParams::SetPrecisionFactor(); |
67 |
// cly = new TRefArray(6,0); //forse causa memory leak??? |
// TrkParams::SetStepMin(); |
68 |
// clx = TRefArray(6,0); |
TrkParams::SetMiniDefault(); |
|
// cly = TRefArray(6,0); |
|
|
|
|
|
TrkParams::SetTrackingMode(); |
|
|
TrkParams::SetPrecisionFactor(); |
|
|
TrkParams::SetStepMin(); |
|
69 |
TrkParams::SetPFA(); |
TrkParams::SetPFA(); |
70 |
|
|
71 |
|
int ngf = TrkParams::nGF; |
72 |
|
for(int i=0; i<ngf; i++){ |
73 |
|
xGF[i] = 0.; |
74 |
|
yGF[i] = 0.; |
75 |
|
} |
76 |
|
|
77 |
|
|
78 |
}; |
}; |
79 |
//-------------------------------------- |
//-------------------------------------- |
80 |
// |
// |
106 |
ayv[ip] = t.ayv[ip]; |
ayv[ip] = t.ayv[ip]; |
107 |
dedx_x[ip] = t.dedx_x[ip]; |
dedx_x[ip] = t.dedx_x[ip]; |
108 |
dedx_y[ip] = t.dedx_y[ip]; |
dedx_y[ip] = t.dedx_y[ip]; |
109 |
|
multmaxx[ip] = t.multmaxx[ip]; |
110 |
|
multmaxy[ip] = t.multmaxy[ip]; |
111 |
|
seedx[ip] = t.seedx[ip]; |
112 |
|
seedy[ip] = t.seedy[ip]; |
113 |
|
xpu[ip] = t.xpu[ip]; |
114 |
|
ypu[ip] = t.ypu[ip]; |
115 |
}; |
}; |
116 |
// clx = 0; |
|
117 |
// cly = 0; |
// TrkParams::SetTrackingMode(); |
118 |
// if(t.clx)clx = new TRefArray(*(t.clx)); |
// TrkParams::SetPrecisionFactor(); |
119 |
// if(t.cly)cly = new TRefArray(*(t.cly)); |
// TrkParams::SetStepMin(); |
120 |
// clx = TRefArray(t.clx); |
TrkParams::SetMiniDefault(); |
|
// cly = TRefArray(t.cly); |
|
|
|
|
|
TrkParams::SetTrackingMode(); |
|
|
TrkParams::SetPrecisionFactor(); |
|
|
TrkParams::SetStepMin(); |
|
121 |
TrkParams::SetPFA(); |
TrkParams::SetPFA(); |
122 |
|
|
123 |
|
int ngf = TrkParams::nGF; |
124 |
|
for(int i=0; i<ngf; i++){ |
125 |
|
xGF[i] = t.xGF[i]; |
126 |
|
yGF[i] = t.yGF[i]; |
127 |
|
} |
128 |
}; |
}; |
129 |
//-------------------------------------- |
//-------------------------------------- |
130 |
// |
// |
157 |
t.ayv[ip] = ayv[ip]; |
t.ayv[ip] = ayv[ip]; |
158 |
t.dedx_x[ip] = dedx_x[ip]; |
t.dedx_x[ip] = dedx_x[ip]; |
159 |
t.dedx_y[ip] = dedx_y[ip]; |
t.dedx_y[ip] = dedx_y[ip]; |
160 |
|
t.multmaxx[ip] = multmaxx[ip]; |
161 |
|
t.multmaxy[ip] = multmaxy[ip]; |
162 |
|
t.seedx[ip] = seedx[ip]; |
163 |
|
t.seedy[ip] = seedy[ip]; |
164 |
|
t.xpu[ip] = xpu[ip]; |
165 |
|
t.ypu[ip] = ypu[ip]; |
166 |
|
|
167 |
}; |
}; |
168 |
|
int ngf = TrkParams::nGF; |
169 |
|
for(int i=0; i<ngf; i++){ |
170 |
|
t.xGF[i] = xGF[i]; |
171 |
|
t.yGF[i] = yGF[i]; |
172 |
|
} |
173 |
|
|
|
// t.clx = TRefArray(clx); |
|
|
// t.cly = TRefArray(cly); |
|
174 |
|
|
175 |
}; |
}; |
176 |
//-------------------------------------- |
//-------------------------------------- |
178 |
// |
// |
179 |
//-------------------------------------- |
//-------------------------------------- |
180 |
/** |
/** |
181 |
* Evaluates the trajectory in the apparatus associated to the track. |
* |
182 |
* 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. |
* >>> OBSOLETE !!! use TrkTrack::DoTrack(Trajectory* t) instead |
183 |
* @param t pointer to an object of the class Trajectory, |
* |
|
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
|
|
* @return error flag. |
|
184 |
*/ |
*/ |
185 |
int TrkTrack::DoTrack(Trajectory* t){ |
int TrkTrack::DoTrack2(Trajectory* t){ |
|
|
|
|
double *dxout = new double[t->npoint]; |
|
|
double *dyout = new double[t->npoint]; |
|
|
double *dzin = new double[t->npoint]; |
|
|
double dal[5]; |
|
|
|
|
|
int ifail = 0; |
|
|
|
|
|
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
|
|
for (int i=0; i<t->npoint; i++) dzin[i] = (double)t->z[i]; |
|
186 |
|
|
187 |
TrkParams::Load(1); |
cout << endl; |
188 |
if( !TrkParams::IsLoaded(1) ){ |
cout << " int TrkTrack::DoTrack2(Trajectory* t) --->> NB NB !! this method is going to be eliminated !!! "<<endl; |
189 |
cout << "int TrkTrack::DoTrack(Trajectory* t) --- ERROR --- m.field not loaded"<<endl; |
cout << " >>>> replace it with TrkTrack::DoTrack(Trajectory* t) <<<<"<<endl; |
190 |
return 0; |
cout << " (Sorry Wolfgang!! Don't be totally confused!! By Elena)"<<endl; |
191 |
} |
cout << endl; |
|
dotrack_(&(t->npoint),dzin,dxout,dyout,dal,&ifail); |
|
|
|
|
|
for (int i=0; i<t->npoint; i++){ |
|
|
t->x[i] = (float)*dxout++; |
|
|
t->y[i] = (float)*dyout++; |
|
|
} |
|
192 |
|
|
193 |
// delete [] dxout; |
return DoTrack(t); |
|
// delete [] dyout; |
|
|
// delete [] dzin; |
|
194 |
|
|
|
return ifail; |
|
195 |
}; |
}; |
196 |
//-------------------------------------- |
//-------------------------------------- |
197 |
// |
// |
198 |
// |
// |
199 |
//-------------------------------------- |
//-------------------------------------- |
200 |
/** |
/** |
201 |
* Evaluates the trajectory in the apparatus associated to the track. |
* Evaluates the trajectory in the apparatus associated to the track state-vector. |
202 |
* 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. |
* It integrates the equations of motion in the magnetic field. |
203 |
* @param t pointer to an object of the class Trajectory, |
* @param t pointer to an object of the class Trajectory, |
204 |
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
* which z coordinates should be previously assigned. |
205 |
* @return error flag. |
* @return error flag. |
206 |
*/ |
*/ |
207 |
int TrkTrack::DoTrack2(Trajectory* t){ |
int TrkTrack::DoTrack(Trajectory* t){ |
208 |
|
|
209 |
double *dxout = new double[t->npoint]; |
double *dxout = new double[t->npoint]; |
210 |
double *dyout = new double[t->npoint]; |
double *dyout = new double[t->npoint]; |
221 |
|
|
222 |
TrkParams::Load(1); |
TrkParams::Load(1); |
223 |
if( !TrkParams::IsLoaded(1) ){ |
if( !TrkParams::IsLoaded(1) ){ |
224 |
cout << "int TrkTrack::DoTrack2(Trajectory* t) --- ERROR --- m.field not loaded"<<endl; |
cout << "int TrkTrack::DoTrack(Trajectory* t) --- ERROR --- m.field not loaded"<<endl; |
225 |
return 0; |
return 0; |
226 |
} |
} |
227 |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
228 |
|
|
229 |
for (int i=0; i<t->npoint; i++){ |
for (int i=0; i<t->npoint; i++){ |
230 |
t->x[i] = (float)*dxout++; |
t->x[i] = (float)*(dxout+i); |
231 |
t->y[i] = (float)*dyout++; |
t->y[i] = (float)*(dyout+i); |
232 |
t->thx[i] = (float)*dthxout++; |
t->thx[i] = (float)*(dthxout+i); |
233 |
t->thy[i] = (float)*dthyout++; |
t->thy[i] = (float)*(dthyout+i); |
234 |
t->tl[i] = (float)*dtlout++; |
t->tl[i] = (float)*(dtlout+i); |
235 |
} |
} |
236 |
|
|
237 |
// delete [] dxout; |
delete [] dxout; |
238 |
// delete [] dyout; |
delete [] dyout; |
239 |
// delete [] dzin; |
delete [] dzin; |
240 |
|
delete [] dthxout; |
241 |
|
delete [] dthyout; |
242 |
|
delete [] dtlout; |
243 |
|
|
244 |
return ifail; |
return ifail; |
245 |
}; |
}; |
299 |
return dedx; |
return dedx; |
300 |
}; |
}; |
301 |
/** |
/** |
302 |
* Returns 1 if the cluster on a tracker view includes bad strips. |
* Returns 1 if the cluster on a tracker view includes bad strips |
303 |
|
* (at least one bad strip among the four strip used by p.f.a.) |
304 |
* @param ip plane (0-5) |
* @param ip plane (0-5) |
305 |
* @param iv view (0=x 1=y) |
* @param iv view (0=x 1=y) |
306 |
*/ |
*/ |
373 |
} |
} |
374 |
return (last_plane-first_plane+1); |
return (last_plane-first_plane+1); |
375 |
} |
} |
376 |
|
/** |
377 |
|
* Returns the track "lever-arm" on the x+y view, defined as the distance (in planes) between |
378 |
|
* the upper and lower x,y (couple) measurements (the maximum value of lever-arm is 6). |
379 |
|
*/ |
380 |
|
Int_t TrkTrack::GetLeverArmXY(){ |
381 |
|
int first_plane = -1; |
382 |
|
int last_plane = -1; |
383 |
|
for(Int_t ip=0; ip<6; ip++){ |
384 |
|
if( XGood(ip) && YGood(ip) && first_plane == -1 )first_plane = ip; |
385 |
|
if( XGood(ip) && YGood(ip) && first_plane != -1 )last_plane = ip; |
386 |
|
} |
387 |
|
if( first_plane == -1 || last_plane == -1){ |
388 |
|
cout<< "Int_t TrkTrack::GetLeverArmXY() -- XGood(ip)*YGood(ip) always false ??? "<<endl; |
389 |
|
return 0; |
390 |
|
} |
391 |
|
return (last_plane-first_plane+1); |
392 |
|
} |
393 |
|
/** |
394 |
|
* Returns the number of hit planes |
395 |
|
*/ |
396 |
|
Int_t TrkTrack::GetNhit() { |
397 |
|
int np=0; |
398 |
|
for(Int_t ip=0; ip<6; ip++) np += (XGood(ip)||YGood(ip)) ; |
399 |
|
return np; |
400 |
|
}; |
401 |
|
/** |
402 |
|
* Returns the reduced chi-square of track x-projection |
403 |
|
*/ |
404 |
|
Float_t TrkTrack::GetChi2X(){ |
405 |
|
float chiq=0; |
406 |
|
for(int ip=0; ip<6; ip++)if(XGood(ip))chiq+= pow((xv[ip]-xm[ip])/resx[ip],2.); |
407 |
|
if(GetNX()>3)chiq=chiq/(GetNX()-3); |
408 |
|
else chiq=0; |
409 |
|
// if(chiq==0)cout << " Float_t TrkTrack::GetChi2X() -- WARNING -- value not defined "<<chiq<<endl; |
410 |
|
return chiq; |
411 |
|
} |
412 |
|
/** |
413 |
|
* Returns the reduced chi-square of track y-projection |
414 |
|
*/ |
415 |
|
Float_t TrkTrack::GetChi2Y(){ |
416 |
|
float chiq=0; |
417 |
|
for(int ip=0; ip<6; ip++)if(YGood(ip))chiq+= pow((yv[ip]-ym[ip])/resy[ip],2.); |
418 |
|
if(GetNY()>2)chiq=chiq/(GetNY()-2); |
419 |
|
else chiq=0; |
420 |
|
// if(chiq==0)cout << " Float_t TrkTrack::GetChi2Y() -- WARNING -- value not defined "<<chiq<<endl; |
421 |
|
return chiq; |
422 |
|
} |
423 |
|
/** |
424 |
|
* Returns the logarythm of the likeliwood-function of track x-projection |
425 |
|
*/ |
426 |
|
Float_t TrkTrack::GetLnLX(){ |
427 |
|
float lnl=0; |
428 |
|
for(int ip=0; ip<6; ip++) |
429 |
|
if( XGood(ip) && tailx[ip]!=0 ) |
430 |
|
lnl += (tailx[ip]+1.) * log( (tailx[ip]*pow(resx[ip],2.) + pow(xv[ip]-xm[ip],2.)) / (tailx[ip]*pow(resx[ip],2)) ); |
431 |
|
if(GetNX()>3)lnl=lnl/(GetNX()-3); |
432 |
|
else lnl=0; |
433 |
|
if(lnl==0){ |
434 |
|
cout << " Float_t TrkTrack::GetLnLX() -- WARNING -- value not defined "<<lnl<<endl; |
435 |
|
Dump(); |
436 |
|
} |
437 |
|
return lnl; |
438 |
|
|
439 |
|
} |
440 |
|
/** |
441 |
|
* Returns the logarythm of the likeliwood-function of track y-projection |
442 |
|
*/ |
443 |
|
Float_t TrkTrack::GetLnLY(){ |
444 |
|
float lnl=0; |
445 |
|
for(int ip=0; ip<6; ip++) |
446 |
|
if( YGood(ip) && taily[ip]!=0 ) |
447 |
|
lnl += (taily[ip]+1.) * log( (taily[ip]*pow(resy[ip],2.) + pow(yv[ip]-ym[ip],2.)) / (taily[ip]*pow(resy[ip],2)) ); |
448 |
|
if(GetNY()>2)lnl=lnl/(GetNY()-2); |
449 |
|
else lnl=0; |
450 |
|
if(lnl==0){ |
451 |
|
cout << " Float_t TrkTrack::GetLnLY() -- WARNING -- value not defined "<<lnl<<endl; |
452 |
|
Dump(); |
453 |
|
} |
454 |
|
return lnl; |
455 |
|
|
456 |
|
} |
457 |
|
/** |
458 |
|
* Returns the effective angle, relative to the sensor, on each plane. |
459 |
|
* @param ip plane (0-5) |
460 |
|
* @param iv view (0=x 1=y) |
461 |
|
*/ |
462 |
|
Float_t TrkTrack::GetEffectiveAngle(int ip, int iv){ |
463 |
|
|
464 |
|
if(ip<0 || ip>5){ |
465 |
|
cout << "Float_t TrkTrack::GetEffectiveAngle(int "<<ip<<", int "<<iv<<") ==> wrong input"<<endl; |
466 |
|
return 0.; |
467 |
|
} |
468 |
|
|
469 |
|
float v[3]={xv[ip],yv[ip],zv[ip]}; |
470 |
|
//----------------------------------------- |
471 |
|
// effective angle (relative to the sensor) |
472 |
|
//----------------------------------------- |
473 |
|
float axv_geo = axv[ip]; |
474 |
|
float muhall_h = 297.61; //cm**2/Vs |
475 |
|
float BY = TrkParams::GetBY(v); |
476 |
|
float axv_eff = 0; |
477 |
|
if(ip==5) axv_geo = -1*axv_geo; |
478 |
|
if(ip==5) BY = -1*BY; |
479 |
|
axv_eff = 180.*atan( tan(axv_geo*acos(-1.)/180.) + muhall_h * BY * 0.0001)/acos(-1.); |
480 |
|
//----------------------------------------- |
481 |
|
// effective angle (relative to the sensor) |
482 |
|
//----------------------------------------- |
483 |
|
float ayv_geo = ayv[ip]; |
484 |
|
float muhall_e = 1258.18; //cm**2/Vs |
485 |
|
float BX = TrkParams::GetBX(v); |
486 |
|
float ayv_eff = 0; |
487 |
|
ayv_eff = 180.*atan( tan(ayv_geo*acos(-1.)/180.) + muhall_e * BX * 0.0001)/acos(-1.); |
488 |
|
|
489 |
|
if (iv==0)return axv_eff; |
490 |
|
else if(iv==1)return ayv_eff; |
491 |
|
else{ |
492 |
|
cout << "Float_t TrkTrack::GetEffectiveAngle(int "<<ip<<", int "<<iv<<") ==> wrong input"<<endl; |
493 |
|
return 0.; |
494 |
|
} |
495 |
|
|
496 |
|
}; |
497 |
|
|
498 |
//-------------------------------------- |
//-------------------------------------- |
499 |
// |
// |
500 |
// |
// |
525 |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[4][i]<<" "; |
cout << endl << " "; for(int i=0; i<5; i++)cout << coval[4][i]<<" "; |
526 |
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] << " "; |
527 |
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] << " "; |
528 |
|
cout << endl << "maxs x : "; for(int i=0; i<6; i++)cout << GetClusterX_MaxStrip(i) << " "; |
529 |
|
cout << endl << "maxs y : "; for(int i=0; i<6; i++)cout << GetClusterY_MaxStrip(i) << " "; |
530 |
|
cout << endl << "mult x : "; for(int i=0; i<6; i++)cout << GetClusterX_Multiplicity(i) << " "; |
531 |
|
cout << endl << "mult y : "; for(int i=0; i<6; i++)cout << GetClusterY_Multiplicity(i) << " "; |
532 |
|
cout << endl << "seed x : "; for(int i=0; i<6; i++)cout << GetClusterX_Seed(i) << " "; |
533 |
|
cout << endl << "seed y : "; for(int i=0; i<6; i++)cout << GetClusterY_Seed(i) << " "; |
534 |
|
cout << endl << "xpu : "; for(int i=0; i<6; i++)cout << xpu[i] << " "; |
535 |
|
cout << endl << "ypu : "; for(int i=0; i<6; i++)cout << ypu[i] << " "; |
536 |
|
|
537 |
cout << endl; |
cout << endl; |
538 |
} |
} |
539 |
/** |
/** |
609 |
4.52043, |
4.52043, |
610 |
4.29926}; |
4.29926}; |
611 |
int index; |
int index; |
612 |
float fact; |
float fact=0.; |
613 |
for(int i=0; i<6; i++) { |
for(int i=0; i<6; i++) { |
614 |
index = int((fabs(axv[i])+1.)/2.); |
index = int((fabs(axv[i])+1.)/2.); |
615 |
if(index>10) index=10; |
if(index>10) index=10; |
649 |
// path_.error = 0; |
// path_.error = 0; |
650 |
// readb_(); |
// readb_(); |
651 |
|
|
652 |
TrkParams::SetTrackingMode(); |
// TrkParams::SetTrackingMode(); |
653 |
TrkParams::SetPrecisionFactor(); |
// TrkParams::SetPrecisionFactor(); |
654 |
TrkParams::SetStepMin(); |
// TrkParams::SetStepMin(); |
655 |
|
TrkParams::SetMiniDefault(); |
656 |
|
|
657 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
658 |
TrkParams::Load(1); |
TrkParams::Load(1); |
659 |
|
if( !TrkParams::IsLoaded(1) ){ |
660 |
|
cout << "void TrkTrack::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
661 |
|
} |
662 |
|
|
663 |
}; |
}; |
664 |
|
|
672 |
|
|
673 |
// cout << i<<" - "<<xgood[i]<<" "<<XGood(i)<<endl; |
// cout << i<<" - "<<xgood[i]<<" "<<XGood(i)<<endl; |
674 |
// cout << i<<" - "<<ygood[i]<<" "<<YGood(i)<<endl; |
// cout << i<<" - "<<ygood[i]<<" "<<YGood(i)<<endl; |
675 |
track.xgood[i]=XGood(i); |
track.xgood[i] = (double) XGood(i); |
676 |
track.ygood[i]=YGood(i); |
track.ygood[i] = (double) YGood(i); |
677 |
|
|
678 |
track.xm[i]=xm[i]; |
track.xm[i]= (double) xm[i]; |
679 |
track.ym[i]=ym[i]; |
track.ym[i]= (double) ym[i]; |
680 |
track.zm[i]=zm[i]; |
track.zm[i]= (double) zm[i]; |
681 |
|
|
682 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
683 |
// andrebbe inserita la dimensione del sensore |
// float segment = 100.; |
684 |
float segment = 100.; |
// track.xm_a[i]=xm[i]; |
685 |
track.xm_a[i]=xm[i]; |
// track.xm_b[i]=xm[i]; |
686 |
track.xm_b[i]=xm[i]; |
// track.ym_a[i]=ym[i]; |
687 |
track.ym_a[i]=ym[i]; |
// track.ym_b[i]=ym[i]; |
688 |
track.ym_b[i]=ym[i]; |
// if( XGood(i) && !YGood(i) ){ |
689 |
if( XGood(i) && !YGood(i) ){ |
// track.ym_a[i] = track.ym_a[i]+segment; |
690 |
track.ym_a[i] = track.ym_a[i]+segment; |
// track.ym_b[i] = track.ym_b[i]-segment; |
691 |
track.ym_b[i] = track.ym_b[i]-segment; |
// }else if( !XGood(i) && YGood(i)){ |
692 |
}else if( !XGood(i) && YGood(i)){ |
// track.xm_a[i] = track.xm_a[i]+segment; |
693 |
track.xm_a[i] = track.xm_a[i]+segment; |
// track.xm_b[i] = track.xm_b[i]-segment; |
694 |
track.xm_b[i] = track.xm_b[i]-segment; |
// } |
|
} |
|
695 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
696 |
|
|
697 |
|
if( XGood(i) || YGood(i) ){ |
698 |
|
//NB!! the length of the sensor is not exactely taken into account |
699 |
|
double segment = 7.;// 2.;//cm //Elena 10th |
700 |
|
// NB: i parametri di allineamento hanno una notazione particolare!!! |
701 |
|
// sensor = 0 (hybrid side), 1 |
702 |
|
// ladder = 0-2 (increasing x) |
703 |
|
// plane = 0-5 (from bottom to top!!!) |
704 |
|
int is = (int)GetSensor(i); if(i==5)is=1-is; |
705 |
|
int ip = 5-i; |
706 |
|
int il = (int)GetLadder(i); |
707 |
|
|
708 |
|
double omega = 0.; |
709 |
|
// double beta = 0.;// EM GCC 4.7 |
710 |
|
// double gamma = 0.; |
711 |
|
if( |
712 |
|
(is < 0 || is > 1 || ip < 0 || ip > 5 || il < 0 || il > 2) && |
713 |
|
true){ |
714 |
|
// se il piano risulta colpito, ladder e sensore devono essere |
715 |
|
// assegnati correttamente |
716 |
|
cout << " void TrkTrack::FillMiniStruct(cMini2track&) --- WARNING --- sensor not defined, cannot read alignment parameters "<<endl; |
717 |
|
cout << " is ip il = "<<is<<" "<<ip<<" "<<il<<endl; |
718 |
|
}else{ |
719 |
|
omega = alignparameters_.omega[is][il][ip]; |
720 |
|
// beta = alignparameters_.beta[is][il][ip];// EM GCC 4.7 unused |
721 |
|
// gamma = alignparameters_.gamma[is][il][ip];// EM GCC 4.7 unused |
722 |
|
} |
723 |
|
|
724 |
|
if( XGood(i) && !YGood(i) ){ |
725 |
|
track.xm_a[i] = (double) xm[i] - omega * segment; |
726 |
|
track.ym_a[i] = (double) ym[i] + segment; |
727 |
|
// track.zm_a[i] = zm[i] + beta * segment;//not used yet |
728 |
|
track.xm_b[i] = (double) xm[i] + omega * segment; |
729 |
|
track.ym_b[i] = (double) ym[i] - segment; |
730 |
|
// track.zm_b[i] = zm[i] - beta * segment;//not used yet |
731 |
|
}else if( !XGood(i) && YGood(i) ){ |
732 |
|
track.xm_a[i] = (double) xm[i] + segment; |
733 |
|
track.ym_a[i] = (double) ym[i] + omega * segment; |
734 |
|
// track.zm_a[i] = zm[i] - gamma * segment;//not used yet |
735 |
|
track.xm_b[i] = (double) xm[i] - segment; |
736 |
|
track.ym_b[i] = (double) ym[i] - omega * segment; |
737 |
|
// track.zm_b[i] = zm[i] + gamma * segment;//not used yet |
738 |
|
} |
739 |
|
} |
740 |
|
|
741 |
track.resx[i]=resx[i]; |
track.resx[i]= (double) resx[i]; |
742 |
track.resy[i]=resy[i]; |
track.resy[i]= (double) resy[i]; |
743 |
track.tailx[i]=tailx[i]; |
track.tailx[i]= (double) tailx[i]; |
744 |
track.taily[i]=taily[i]; |
track.taily[i]= (double) taily[i]; |
745 |
} |
} |
746 |
|
|
747 |
for(int i=0; i<5; i++) track.al[i]=al[i]; |
for(int i=0; i<5; i++) track.al[i]= (double) al[i]; |
748 |
track.zini = 23.5; |
track.zini = 23.5; |
749 |
// ZINI = 23.5 !!! it should be the same parameter in all codes |
// ZINI = 23.5 !!! it should be the same parameter in all codes |
750 |
|
|
755 |
void TrkTrack::SetFromMiniStruct(cMini2track *track){ |
void TrkTrack::SetFromMiniStruct(cMini2track *track){ |
756 |
|
|
757 |
for(int i=0; i<5; i++) { |
for(int i=0; i<5; i++) { |
758 |
al[i]=track->al[i]; |
al[i]= (float) (track->al[i]); |
759 |
for(int j=0; j<5; j++) coval[i][j]=track->cov[i][j]; |
for(int j=0; j<5; j++) coval[i][j]= (float) (track->cov[i][j]); |
760 |
} |
} |
761 |
chi2 = track->chi2; |
chi2 = (float) (track->chi2); |
762 |
nstep = track->nstep; |
nstep = (float) (track->nstep); |
763 |
for(int i=0; i<6; i++){ |
for(int i=0; i<6; i++){ |
764 |
xv[i] = track->xv[i]; |
xv[i] = (float) (track->xv[i]); |
765 |
yv[i] = track->yv[i]; |
yv[i] = (float) (track->yv[i]); |
766 |
zv[i] = track->zv[i]; |
zv[i] = (float) (track->zv[i]); |
767 |
xm[i] = track->xm[i]; |
xm[i] = (float) (track->xm[i]); |
768 |
ym[i] = track->ym[i]; |
ym[i] = (float) (track->ym[i]); |
769 |
zm[i] = track->zm[i]; |
zm[i] = (float) (track->zm[i]); |
770 |
axv[i] = track->axv[i]; |
axv[i] = (float) (track->axv[i]); |
771 |
ayv[i] = track->ayv[i]; |
ayv[i] = (float) (track->ayv[i]); |
772 |
|
resx[i] = (float) (track->resx[i]); //Elena 10th |
773 |
|
resy[i] = (float) (track->resy[i]); |
774 |
} |
} |
775 |
|
|
776 |
} |
} |
799 |
* |
* |
800 |
* @see TrkParams::SetPFA(int) |
* @see TrkParams::SetPFA(int) |
801 |
*/ |
*/ |
802 |
void TrkTrack::EvaluateClusterPositions(){ |
Bool_t TrkTrack::EvaluateClusterPositions(){ |
803 |
|
|
804 |
// cout << "void TrkTrack::GetClusterPositions() "<<endl; |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
805 |
|
|
806 |
|
TrkParams::Load(1); |
807 |
|
if( !TrkParams::IsLoaded(1) ){ |
808 |
|
cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- m.field not loaded "<<endl; |
809 |
|
return false; |
810 |
|
} |
811 |
|
TrkParams::Load(4); |
812 |
|
if( !TrkParams::IsLoaded(4) ){ |
813 |
|
cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- p.f.a. par. not loaded "<<endl; |
814 |
|
return false; |
815 |
|
} |
816 |
|
TrkParams::Load(5); |
817 |
|
if( !TrkParams::IsLoaded(5) ){ |
818 |
|
cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- alignment par. not loaded "<<endl; |
819 |
|
return false; |
820 |
|
} |
821 |
|
|
|
TrkParams::Load( ); |
|
|
if( !TrkParams::IsLoaded() )return; |
|
|
|
|
822 |
for(int ip=0; ip<6; ip++){ |
for(int ip=0; ip<6; ip++){ |
823 |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
824 |
int icx = GetClusterX_ID(ip)+1; |
int icx = GetClusterX_ID(ip)+1;//0=no-cluster,1-N |
825 |
int icy = GetClusterY_ID(ip)+1; |
int icy = GetClusterY_ID(ip)+1;//0=no-cluster,1-N |
826 |
int sensor = GetSensor(ip)+1;//<< convenzione "Paolo" |
int sensor = GetSensor(ip)+1;//<< convenzione "Paolo" |
827 |
if(ip==5 && sensor!=0)sensor=3-sensor;//<< convenzione "Elena" |
if(ip==5 && sensor!=0)sensor=3-sensor;//<< convenzione "Elena" |
828 |
int ladder = GetLadder(ip)+1; |
int ladder = GetLadder(ip)+1; |
836 |
float bfy = 10*TrkParams::GetBY(v);//Tesla |
float bfy = 10*TrkParams::GetBY(v);//Tesla |
837 |
int ipp=ip+1; |
int ipp=ip+1; |
838 |
xyzpam_(&ipp,&icx,&icy,&ladder,&sensor,&ax,&ay,&bfx,&bfy); |
xyzpam_(&ipp,&icx,&icy,&ladder,&sensor,&ax,&ay,&bfx,&bfy); |
839 |
|
// if(icx<0 || icy<0)return false; |
840 |
} |
} |
841 |
|
return true; |
842 |
} |
} |
843 |
/** |
/** |
844 |
* \brief Tracking method. It calls F77 mini routine. |
* \brief Tracking method. It calls F77 mini routine. |
862 |
* @see EvaluateClusterPositions() |
* @see EvaluateClusterPositions() |
863 |
* |
* |
864 |
* The fitting procedure can be varied by changing the tracking mode, |
* The fitting procedure can be varied by changing the tracking mode, |
865 |
* the fit-precision factor and the minimum number of step. |
* the fit-precision factor, the minimum number of step, etc. |
866 |
* @see SetTrackingMode(int) |
* @see SetTrackingMode(int) |
867 |
* @see SetPrecisionFactor(double) |
* @see SetPrecisionFactor(double) |
868 |
* @see SetStepMin(int) |
* @see SetStepMin(int) |
869 |
|
* @see SetDeltaB(int,double) |
870 |
*/ |
*/ |
871 |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
872 |
|
|
873 |
float al_ini[] = {0.,0.,0.,0.,0.}; |
TrkParams::Load(1); |
874 |
|
if( !TrkParams::IsLoaded(1) ){ |
875 |
|
cout << "void TrkTrack::Fit(double,int&,int,int) ---ERROR--- m.field not loaded "<<endl; |
876 |
|
return; |
877 |
|
} |
878 |
|
TrkParams::Load(5); |
879 |
|
if( !TrkParams::IsLoaded(5) ){ |
880 |
|
cout << "void TrkTrack::Fit(double,int&,int,int) ---ERROR--- align.param. not loaded "<<endl; |
881 |
|
return; |
882 |
|
} |
883 |
|
|
884 |
TrkParams::Load( ); |
float al_ini[] = {0.,0.,0.,0.,0.}; |
|
if( !TrkParams::IsLoaded() )return; |
|
885 |
|
|
886 |
extern cMini2track track_; |
extern cMini2track track_; |
887 |
fail = 0; |
fail = 0; |
888 |
FillMiniStruct(track_); |
|
889 |
|
// FillMiniStruct(track_); |
890 |
if(froml1!=0)EvaluateClusterPositions(); |
|
891 |
|
if(froml1!=0){ |
892 |
|
if( !EvaluateClusterPositions() ){ |
893 |
|
cout << "void TrkTrack::Fit("<<pfixed<<","<<fail<<","<<iprint<<","<<froml1<<") --- ERROR evaluating cluster positions "<<endl; |
894 |
|
FillMiniStruct(track_) ; |
895 |
|
fail = 1; |
896 |
|
return; |
897 |
|
} |
898 |
|
}else{ |
899 |
|
FillMiniStruct(track_); |
900 |
|
} |
901 |
|
|
902 |
// if fit variables have been reset, evaluate the initial guess |
// if fit variables have been reset, evaluate the initial guess |
903 |
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_(); |
917 |
|
|
918 |
// ------------------------------------------ |
// ------------------------------------------ |
919 |
// call mini routine |
// call mini routine |
920 |
// TrkParams::Load(1); |
// ------------------------------------------ |
|
// if( !TrkParams::IsLoaded(1) ){ |
|
|
// cout << "void TrkTrack::Fit(double pfixed, int& fail, int iprint) --- ERROR --- m.field not loaded"<<endl; |
|
|
// return; |
|
|
// } |
|
921 |
int istep=0; |
int istep=0; |
922 |
int ifail=0; |
int ifail=0; |
923 |
mini2_(&istep,&ifail, &iprint); |
mini2_(&istep,&ifail, &iprint); |
925 |
if(iprint)cout << "ERROR: ifail= " << ifail << endl; |
if(iprint)cout << "ERROR: ifail= " << ifail << endl; |
926 |
fail = 1; |
fail = 1; |
927 |
} |
} |
928 |
|
if(chi2!=chi2){ |
929 |
|
if(iprint)cout << "ERROR: chi2= " << chi2 << endl; |
930 |
|
FitReset(); |
931 |
|
fail = 1; |
932 |
|
} |
933 |
// ------------------------------------------ |
// ------------------------------------------ |
934 |
|
|
935 |
SetFromMiniStruct(&track_); |
SetFromMiniStruct(&track_); |
977 |
extern cMini2track track_; |
extern cMini2track track_; |
978 |
track_.istepmin = istepmin; |
track_.istepmin = istepmin; |
979 |
} |
} |
980 |
|
/** |
981 |
|
* Set deltaB parameters (id=0,1). By default they are set to zero. |
982 |
|
*/ |
983 |
|
void TrkTrack::SetDeltaB(int id, double db){ |
984 |
|
if(id!=0 && id!=1)cout << "void TrkTrack::SetDeltaB(int id,double db) -- wrong input parameters: "<<id<<" "<<db<<endl; |
985 |
|
TrkParams::SetDeltaB(id,db); |
986 |
|
} |
987 |
|
|
988 |
|
/** |
989 |
|
* Returns true if the track is inside the magnet cavity. |
990 |
|
* @param toll Tolerance around the nominal volume (toll>0 define an inner fiducial volume) |
991 |
|
*/ |
992 |
|
Bool_t TrkTrack::IsInsideCavity(float toll){ |
993 |
|
|
994 |
|
// float xmagntop, ymagntop, xmagnbottom, ymagnbottom; |
995 |
|
// xmagntop = xv[0] + (ZMAGNHIGH-zv[0])*tan(acos(-1.0)*axv[0]/180.); |
996 |
|
// ymagntop = yv[0] + (ZMAGNHIGH-zv[0])*tan(acos(-1.0)*ayv[0]/180.); |
997 |
|
// xmagnbottom = xv[5] + (ZMAGNLOW-zv[5])*tan(acos(-1.0)*axv[5]/180.); |
998 |
|
// ymagnbottom = yv[5] + (ZMAGNLOW-zv[5])*tan(acos(-1.0)*ayv[5]/180.); |
999 |
|
// if( xmagntop>XMAGNLOW && xmagntop<XMAGNHIGH && |
1000 |
|
// ymagntop>YMAGNLOW && ymagntop<YMAGNHIGH && |
1001 |
|
// xmagnbottom>XMAGNLOW && xmagnbottom<XMAGNHIGH && |
1002 |
|
// ymagnbottom>YMAGNLOW && ymagnbottom<YMAGNHIGH ) return(true); |
1003 |
|
// else return(false); |
1004 |
|
|
1005 |
|
int ngf = TrkParams::nGF; |
1006 |
|
for(int i=0; i<ngf; i++){ |
1007 |
|
// |
1008 |
|
// cout << endl << TrkParams::GF_element[i]; |
1009 |
|
if( |
1010 |
|
TrkParams::GF_element[i].CompareTo("CUF") && |
1011 |
|
TrkParams::GF_element[i].CompareTo("T2") && |
1012 |
|
TrkParams::GF_element[i].CompareTo("T3") && |
1013 |
|
TrkParams::GF_element[i].CompareTo("T4") && |
1014 |
|
TrkParams::GF_element[i].CompareTo("T5") && |
1015 |
|
TrkParams::GF_element[i].CompareTo("CLF") && |
1016 |
|
true)continue; |
1017 |
|
// apply condition only within the cavity |
1018 |
|
// cout << " -- "<<xGF[i]<<" "<<yGF[i]; |
1019 |
|
if( |
1020 |
|
xGF[i] <= TrkParams::xGF_min[i] + toll || |
1021 |
|
xGF[i] >= TrkParams::xGF_max[i] - toll || |
1022 |
|
yGF[i] <= TrkParams::yGF_min[i] + toll || |
1023 |
|
yGF[i] >= TrkParams::yGF_max[i] - toll || |
1024 |
|
false){ |
1025 |
|
|
1026 |
|
return false; |
1027 |
|
} |
1028 |
|
} |
1029 |
|
return true; |
1030 |
|
|
1031 |
|
|
1032 |
|
} |
1033 |
|
/** |
1034 |
|
* Returns true if the track is inside the nominal acceptance, which is defined |
1035 |
|
* by the intersection among magnet cavity, silicon-plane sensitive area and |
1036 |
|
* ToF sensitive area (nominal values from the official document used to |
1037 |
|
* calculate the geometrical factor) |
1038 |
|
* @param toll Tolerance around the nominal volume (toll>0 define an inner fiducial volume) |
1039 |
|
*/ |
1040 |
|
// Bool_t TrkTrack::IsInsideAcceptance(){ |
1041 |
|
|
1042 |
|
// int ngf = TrkParams::nGF; |
1043 |
|
// for(int i=0; i<ngf; i++){ |
1044 |
|
// if( |
1045 |
|
// xGF[i] <= TrkParams::xGF_min[i] || |
1046 |
|
// xGF[i] >= TrkParams::xGF_max[i] || |
1047 |
|
// yGF[i] <= TrkParams::yGF_min[i] || |
1048 |
|
// yGF[i] >= TrkParams::yGF_max[i] || |
1049 |
|
// false)return false; |
1050 |
|
// } |
1051 |
|
// return true; |
1052 |
|
|
1053 |
|
// } |
1054 |
|
Bool_t TrkTrack::IsInsideAcceptance(float toll){ |
1055 |
|
|
1056 |
|
|
1057 |
|
int ngf = TrkParams::nGF; |
1058 |
|
for(int i=0; i<ngf; i++){ |
1059 |
|
// |
1060 |
|
// cout << endl << TrkParams::GF_element[i]; |
1061 |
|
if( |
1062 |
|
TrkParams::GF_element[i].CompareTo("S11") && |
1063 |
|
TrkParams::GF_element[i].CompareTo("S12") && |
1064 |
|
TrkParams::GF_element[i].CompareTo("S21") && |
1065 |
|
TrkParams::GF_element[i].CompareTo("S22") && |
1066 |
|
TrkParams::GF_element[i].CompareTo("T1") && |
1067 |
|
TrkParams::GF_element[i].CompareTo("CUF") && |
1068 |
|
TrkParams::GF_element[i].CompareTo("T2") && |
1069 |
|
TrkParams::GF_element[i].CompareTo("T3") && |
1070 |
|
TrkParams::GF_element[i].CompareTo("T4") && |
1071 |
|
TrkParams::GF_element[i].CompareTo("T5") && |
1072 |
|
TrkParams::GF_element[i].CompareTo("CLF") && |
1073 |
|
TrkParams::GF_element[i].CompareTo("T6") && |
1074 |
|
TrkParams::GF_element[i].CompareTo("S31") && |
1075 |
|
TrkParams::GF_element[i].CompareTo("S32") && |
1076 |
|
true)continue; |
1077 |
|
// apply condition only within the cavity |
1078 |
|
// cout << " -- "<<xGF[i]<<" "<<yGF[i]; |
1079 |
|
if( |
1080 |
|
xGF[i] <= TrkParams::xGF_min[i] + toll || |
1081 |
|
xGF[i] >= TrkParams::xGF_max[i] - toll || |
1082 |
|
yGF[i] <= TrkParams::yGF_min[i] + toll || |
1083 |
|
yGF[i] >= TrkParams::yGF_max[i] - toll || |
1084 |
|
false){ |
1085 |
|
|
1086 |
|
return false; |
1087 |
|
} |
1088 |
|
} |
1089 |
|
return true; |
1090 |
|
} |
1091 |
|
|
1092 |
|
/** |
1093 |
|
* Returns true if the track is inside one of the surfaces which define the |
1094 |
|
* geometrical acceptance. |
1095 |
|
* @param surf tag of the surface (possible values are: S11 S12 S21 S22 T1 |
1096 |
|
* CUF T2 T3 T4 T5 CLF T6 S31 S32). |
1097 |
|
* @param toll Tolerance around the nominal surface (toll>0 define an inner |
1098 |
|
* fiducial surface) |
1099 |
|
*/ |
1100 |
|
Bool_t TrkTrack::IsInsideGFSurface(const char* surf, float toll){ |
1101 |
|
|
1102 |
|
|
1103 |
|
int ngf = TrkParams::nGF; |
1104 |
|
bool SURFOK = false; |
1105 |
|
for(int i=0; i<ngf; i++){ |
1106 |
|
if( !TrkParams::GF_element[i].CompareTo(surf) ){ |
1107 |
|
SURFOK=true; |
1108 |
|
if( |
1109 |
|
xGF[i] > TrkParams::xGF_min[i] + toll && |
1110 |
|
xGF[i] < TrkParams::xGF_max[i] - toll && |
1111 |
|
yGF[i] > TrkParams::yGF_min[i] + toll && |
1112 |
|
yGF[i] < TrkParams::yGF_max[i] - toll && |
1113 |
|
true)return true; |
1114 |
|
} |
1115 |
|
} |
1116 |
|
if( !SURFOK )cout << " Bool_t TrkTrack::IsInsideGFSurface(char* surf, float toll) --> suface "<<surf<<" not defined "<<endl; |
1117 |
|
return false; |
1118 |
|
|
1119 |
|
} |
1120 |
|
|
1121 |
/** |
/** |
1122 |
* Method to retrieve ID (0,1,...) of x-cluster (if any) associated to this track. |
* Method to retrieve ID (0,1,...) of x-cluster (if any) associated to this track. |
1123 |
* If no cluster is associated, ID=-1. |
* If no cluster is associated, ID=-1. |
1134 |
Int_t TrkTrack::GetClusterY_ID(int ip){ |
Int_t TrkTrack::GetClusterY_ID(int ip){ |
1135 |
return ((Int_t)fabs(ygood[ip]))%10000000-1; |
return ((Int_t)fabs(ygood[ip]))%10000000-1; |
1136 |
}; |
}; |
1137 |
|
|
1138 |
/** |
/** |
1139 |
* Method to retrieve the ladder (0-4, increasing x) traversed by the track on this plane. |
* Method to retrieve the ladder (0-2, increasing x) traversed by the track on this plane. |
1140 |
* If no ladder is traversed (dead area) the metod retuns -1. |
* If no ladder is traversed (dead area) the metod retuns -1. |
1141 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1142 |
*/ |
*/ |
1159 |
/** |
/** |
1160 |
* \brief Method to include a x-cluster to the track. |
* \brief Method to include a x-cluster to the track. |
1161 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1162 |
* @param clid Cluster ID (0,1,...) |
* @param clid Cluster ID (0 = no-cluster, 1,2,... otherwise ) |
1163 |
* @param is Sensor (0-1, increasing y) |
* @param il Ladder (0-2, increasing x, -1 if no sensitive area is hit) |
1164 |
|
* @param is Sensor (0-1, increasing y, -1 if no sensitive area is hit) |
1165 |
|
* @param bad True if the cluster contains bad strips |
1166 |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
1167 |
*/ |
*/ |
1168 |
void TrkTrack::SetXGood(int ip, int clid, int is){ |
void TrkTrack::SetXGood(int ip, int clid, int il, int is, bool bad){ |
1169 |
int il=0; //ladder (temporary) |
// int il=0; //ladder (temporary) |
1170 |
bool bad=false; //ladder (temporary) |
// bool bad=false; //ladder (temporary) |
1171 |
xgood[ip]=il*100000000+is*10000000+clid; |
if(ip<0||ip>5||clid<1||il<-1||il>2||is<-1||is>1) |
1172 |
|
cout << " void TrkTrack::SetXGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1173 |
|
xgood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1174 |
if(bad)xgood[ip]=-xgood[ip]; |
if(bad)xgood[ip]=-xgood[ip]; |
1175 |
}; |
}; |
1176 |
/** |
/** |
1177 |
* \brief Method to include a y-cluster to the track. |
* \brief Method to include a y-cluster to the track. |
1178 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1179 |
* @param clid Cluster ID (0,1,...) |
* @param clid Cluster ID (0 = no-cluster, 1,2,... otherwise ) |
1180 |
* @param is Sensor (0-1) |
* @param il Ladder (0-2, increasing x, -1 if no sensitive area is hit) |
1181 |
|
* @param is Sensor (0-1, increasing y, -1 if no sensitive area is hit) |
1182 |
|
* @param bad True if the cluster contains bad strips |
1183 |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
1184 |
*/ |
*/ |
1185 |
void TrkTrack::SetYGood(int ip, int clid, int is){ |
void TrkTrack::SetYGood(int ip, int clid, int il, int is, bool bad){ |
1186 |
int il=0; //ladder (temporary) |
// int il=0; //ladder (temporary) |
1187 |
bool bad=false; //ladder (temporary) |
// bool bad=false; //ladder (temporary) |
1188 |
ygood[ip]=il*100000000+is*10000000+clid; |
if(ip<0||ip>5||clid<1||il<-1||il>2||is<-1||is>1) |
1189 |
|
cout << " void TrkTrack::SetYGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1190 |
|
ygood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1191 |
if(bad)ygood[ip]=-ygood[ip]; |
if(bad)ygood[ip]=-ygood[ip]; |
1192 |
}; |
}; |
1193 |
|
|
1194 |
|
/** |
1195 |
|
* \brief Average X |
1196 |
|
* Average value of <xv>, evaluated from the first to the last hit x view. |
1197 |
|
*/ |
1198 |
|
Float_t TrkTrack::GetXav(){ |
1199 |
|
|
1200 |
|
int first_plane = -1; |
1201 |
|
int last_plane = -1; |
1202 |
|
for(Int_t ip=0; ip<6; ip++){ |
1203 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1204 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1205 |
|
} |
1206 |
|
if( first_plane == -1 || last_plane == -1){ |
1207 |
|
return -100; |
1208 |
|
} |
1209 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1210 |
|
|
1211 |
|
Float_t av = 0; |
1212 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=xv[ip]; |
1213 |
|
|
1214 |
|
return (av/(last_plane-first_plane+1)); |
1215 |
|
} |
1216 |
|
/** |
1217 |
|
* \brief Average Y |
1218 |
|
* Average value of <yv>, evaluated from the first to the last hit x view. |
1219 |
|
*/ |
1220 |
|
Float_t TrkTrack::GetYav(){ |
1221 |
|
|
1222 |
|
int first_plane = -1; |
1223 |
|
int last_plane = -1; |
1224 |
|
for(Int_t ip=0; ip<6; ip++){ |
1225 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1226 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1227 |
|
} |
1228 |
|
if( first_plane == -1 || last_plane == -1){ |
1229 |
|
return -100; |
1230 |
|
} |
1231 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1232 |
|
|
1233 |
|
Float_t av = 0; |
1234 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=yv[ip]; |
1235 |
|
|
1236 |
|
return (av/(last_plane-first_plane+1)); |
1237 |
|
} |
1238 |
|
/** |
1239 |
|
* \brief Average Z |
1240 |
|
* Average value of <zv>, evaluated from the first to the last hit x view. |
1241 |
|
*/ |
1242 |
|
Float_t TrkTrack::GetZav(){ |
1243 |
|
|
1244 |
|
int first_plane = -1; |
1245 |
|
int last_plane = -1; |
1246 |
|
for(Int_t ip=0; ip<6; ip++){ |
1247 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1248 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1249 |
|
} |
1250 |
|
if( first_plane == -1 || last_plane == -1){ |
1251 |
|
return -100; |
1252 |
|
} |
1253 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1254 |
|
|
1255 |
|
Float_t av = 0; |
1256 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=zv[ip]; |
1257 |
|
|
1258 |
|
return (av/(last_plane-first_plane+1)); |
1259 |
|
} |
1260 |
|
|
1261 |
|
/** |
1262 |
|
* \brief Number of column traversed |
1263 |
|
*/ |
1264 |
|
Int_t TrkTrack::GetNColumns(){ |
1265 |
|
int sensors[] = {0,0,0,0,0,0}; |
1266 |
|
for(int ip=0; ip<6; ip++){ |
1267 |
|
int sensorid = GetLadder(ip)+3*GetSensor(ip); |
1268 |
|
if(XGood(ip)||YGood(ip)) |
1269 |
|
if(sensorid>=0 && sensorid<6)sensors[sensorid]=1; |
1270 |
|
} |
1271 |
|
int nsensors=0; |
1272 |
|
for(int is=0; is<6; is++)nsensors += sensors[is]; |
1273 |
|
return nsensors; |
1274 |
|
}; |
1275 |
|
/** |
1276 |
|
* \brief Give the maximum energy release |
1277 |
|
*/ |
1278 |
|
Float_t TrkTrack::GetDEDX_max(int ip, int iv){ |
1279 |
|
Float_t max=0; |
1280 |
|
int pfrom = 0; |
1281 |
|
int pto = 6; |
1282 |
|
int vfrom = 0; |
1283 |
|
int vto = 2; |
1284 |
|
if(ip>=0&&ip<6){ |
1285 |
|
pfrom = ip; |
1286 |
|
pto = ip+1; |
1287 |
|
} |
1288 |
|
if(iv>=0&&iv<2){ |
1289 |
|
vfrom = iv; |
1290 |
|
vto = iv+1; |
1291 |
|
} |
1292 |
|
for(int i=pfrom; i<pto; i++) |
1293 |
|
for(int j=vfrom; j<vto; j++){ |
1294 |
|
if(j==0 && XGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1295 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1296 |
|
} |
1297 |
|
return max; |
1298 |
|
|
1299 |
|
}; |
1300 |
|
|
1301 |
|
/** |
1302 |
|
* \brief Give the minimum energy release |
1303 |
|
*/ |
1304 |
|
Float_t TrkTrack::GetDEDX_min(int ip, int iv){ |
1305 |
|
Float_t min=100000000; |
1306 |
|
int pfrom = 0; |
1307 |
|
int pto = 6; |
1308 |
|
int vfrom = 0; |
1309 |
|
int vto = 2; |
1310 |
|
if(ip>=0&&ip<6){ |
1311 |
|
pfrom = ip; |
1312 |
|
pto = ip+1; |
1313 |
|
} |
1314 |
|
if(iv>=0&&iv<2){ |
1315 |
|
vfrom = iv; |
1316 |
|
vto = iv+1; |
1317 |
|
} |
1318 |
|
for(int i=pfrom; i<pto; i++) |
1319 |
|
for(int j=vfrom; j<vto; j++){ |
1320 |
|
if(j==0 && XGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1321 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1322 |
|
} |
1323 |
|
return min; |
1324 |
|
|
1325 |
|
}; |
1326 |
|
|
1327 |
|
/** |
1328 |
|
* \brief Give the maximum spatial residual |
1329 |
|
*/ |
1330 |
|
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
1331 |
|
Float_t max=0; |
1332 |
|
int pfrom = 0; |
1333 |
|
int pto = 6; |
1334 |
|
int vfrom = 0; |
1335 |
|
int vto = 2; |
1336 |
|
if(ip>=0&&ip<6){ |
1337 |
|
pfrom = ip; |
1338 |
|
pto = ip+1; |
1339 |
|
} |
1340 |
|
if(iv>=0&&iv<2){ |
1341 |
|
vfrom = iv; |
1342 |
|
vto = iv+1; |
1343 |
|
} |
1344 |
|
for(int i=pfrom; i<pto; i++){ |
1345 |
|
for(int j=vfrom; j<vto; j++){ |
1346 |
|
if(j==0 && XGood(i) && fabs(xm[i]-xv[i])>fabs(max))max=xm[i]-xv[i]; |
1347 |
|
if(j==1 && YGood(i) && fabs(ym[i]-yv[i])>fabs(max))max=ym[i]-yv[i]; |
1348 |
|
} |
1349 |
|
} |
1350 |
|
return max; |
1351 |
|
|
1352 |
|
}; |
1353 |
|
/** |
1354 |
|
* \brief Give the anerage spatial residual |
1355 |
|
*/ |
1356 |
|
Float_t TrkTrack::GetResidual_av(int ip, int iv){ |
1357 |
|
// |
1358 |
|
//Sum$((xm>-50)*(xm-xv)/resx)/sqrt(TrkTrack.GetNX()*TrkTrack.GetChi2X())<0.3 |
1359 |
|
|
1360 |
|
Float_t av = 0.; |
1361 |
|
int nav = 0; |
1362 |
|
// |
1363 |
|
int pfrom = 0; |
1364 |
|
int pto = 6; |
1365 |
|
int vfrom = 0; |
1366 |
|
int vto = 2; |
1367 |
|
if(ip>=0&&ip<6){ |
1368 |
|
pfrom = ip; |
1369 |
|
pto = ip+1; |
1370 |
|
} |
1371 |
|
if(iv>=0&&iv<2){ |
1372 |
|
vfrom = iv; |
1373 |
|
vto = iv+1; |
1374 |
|
} |
1375 |
|
for(int i=pfrom; i<pto; i++){ |
1376 |
|
for(int j=vfrom; j<vto; j++){ |
1377 |
|
nav++; |
1378 |
|
if(j==0 && XGood(i)) av += (xm[i]-xv[i])/resx[i]; |
1379 |
|
if(j==1 && YGood(i)) av += (ym[i]-yv[i])/resy[i]; |
1380 |
|
} |
1381 |
|
} |
1382 |
|
if(nav==0)return -100.; |
1383 |
|
return av/nav; |
1384 |
|
|
1385 |
|
}; |
1386 |
|
|
1387 |
|
|
1388 |
|
/** |
1389 |
|
* \brief Give the maximum multiplicity on the x view |
1390 |
|
*/ |
1391 |
|
Int_t TrkTrack::GetClusterX_Multiplicity_max(){ |
1392 |
|
int max=0; |
1393 |
|
for(int ip=0; ip<6; ip++) |
1394 |
|
if(GetClusterX_Multiplicity(ip)>max)max=GetClusterX_Multiplicity(ip); |
1395 |
|
return max; |
1396 |
|
}; |
1397 |
|
/** |
1398 |
|
* \brief Give the minimum multiplicity on the x view |
1399 |
|
*/ |
1400 |
|
Int_t TrkTrack::GetClusterX_Multiplicity_min(){ |
1401 |
|
int min=50; |
1402 |
|
for(int ip=0; ip<6; ip++) |
1403 |
|
if(GetClusterX_Multiplicity(ip)<min)min=GetClusterX_Multiplicity(ip); |
1404 |
|
return min; |
1405 |
|
}; |
1406 |
|
/** |
1407 |
|
* \brief Give the maximum multiplicity on the x view |
1408 |
|
*/ |
1409 |
|
Int_t TrkTrack::GetClusterY_Multiplicity_max(){ |
1410 |
|
int max=0; |
1411 |
|
for(int ip=0; ip<6; ip++) |
1412 |
|
if(GetClusterY_Multiplicity(ip)>max)max=GetClusterY_Multiplicity(ip); |
1413 |
|
return max; |
1414 |
|
}; |
1415 |
|
/** |
1416 |
|
* \brief Give the minimum multiplicity on the x view |
1417 |
|
*/ |
1418 |
|
Int_t TrkTrack::GetClusterY_Multiplicity_min(){ |
1419 |
|
int min=50; |
1420 |
|
for(int ip=0; ip<6; ip++) |
1421 |
|
if(GetClusterY_Multiplicity(ip)<min)min=GetClusterY_Multiplicity(ip); |
1422 |
|
return min; |
1423 |
|
}; |
1424 |
|
|
1425 |
|
/** |
1426 |
|
* \brief Give the minimum seed on the x view |
1427 |
|
*/ |
1428 |
|
Float_t TrkTrack::GetClusterX_Seed_min(){ |
1429 |
|
Float_t min=100000; |
1430 |
|
for(int ip=0; ip<6; ip++) |
1431 |
|
if(XGood(ip) && GetClusterX_Seed(ip)<min)min=GetClusterX_Seed(ip); |
1432 |
|
return min; |
1433 |
|
}; |
1434 |
|
/** |
1435 |
|
* \brief Give the minimum seed on the x view |
1436 |
|
*/ |
1437 |
|
Float_t TrkTrack::GetClusterY_Seed_min(){ |
1438 |
|
Float_t min=100000; |
1439 |
|
for(int ip=0; ip<6; ip++) |
1440 |
|
if(YGood(ip) && GetClusterY_Seed(ip)<min)min=GetClusterY_Seed(ip); |
1441 |
|
return min; |
1442 |
|
}; |
1443 |
|
|
1444 |
|
|
1445 |
//-------------------------------------- |
//-------------------------------------- |
1446 |
// |
// |
1447 |
// |
// |
1475 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
1476 |
|
|
1477 |
}; |
}; |
1478 |
|
int ngf = TrkParams::nGF; |
1479 |
|
for(int i=0; i<ngf; i++){ |
1480 |
|
xGF[i] = 0.; |
1481 |
|
yGF[i] = 0.; |
1482 |
|
} |
1483 |
// if(clx)clx->Clear(); |
// if(clx)clx->Clear(); |
1484 |
// if(cly)cly->Clear(); |
// if(cly)cly->Clear(); |
1485 |
// clx.Clear(); |
// clx.Clear(); |
1506 |
//-------------------------------------- |
//-------------------------------------- |
1507 |
TrkSinglet::TrkSinglet(){ |
TrkSinglet::TrkSinglet(){ |
1508 |
// cout << "TrkSinglet::TrkSinglet() " << GetUniqueID()<<endl; |
// cout << "TrkSinglet::TrkSinglet() " << GetUniqueID()<<endl; |
1509 |
plane = 0; |
// plane = 0; |
1510 |
coord[0] = 0; |
// coord[0] = 0; |
1511 |
coord[1] = 0; |
// coord[1] = 0; |
1512 |
sgnl = 0; |
// sgnl = 0; |
1513 |
|
// multmax = 0; |
1514 |
// cls = 0; |
// cls = 0; |
1515 |
|
Clear(); |
1516 |
}; |
}; |
1517 |
//-------------------------------------- |
//-------------------------------------- |
1518 |
// |
// |
1524 |
coord[0] = s.coord[0]; |
coord[0] = s.coord[0]; |
1525 |
coord[1] = s.coord[1]; |
coord[1] = s.coord[1]; |
1526 |
sgnl = s.sgnl; |
sgnl = s.sgnl; |
1527 |
|
multmax = s.multmax; |
1528 |
// cls = 0;//<<<<pointer |
// cls = 0;//<<<<pointer |
1529 |
// cls = TRef(s.cls); |
// cls = TRef(s.cls); |
1530 |
}; |
}; |
1535 |
void TrkSinglet::Dump(){ |
void TrkSinglet::Dump(){ |
1536 |
int i=0; |
int i=0; |
1537 |
cout << endl << "========== Singlet " ; |
cout << endl << "========== Singlet " ; |
1538 |
cout << endl << "plane : " << plane; |
cout << endl << "plane : " << plane; |
1539 |
cout << endl << "coord[2] : "; while( i<2 && cout << coord[i] << " ") i++; |
cout << endl << "coord[2] : "; while( i<2 && cout << coord[i] << " ") i++; |
1540 |
cout << endl << "sgnl : " << sgnl; |
cout << endl << "sgnl : " << sgnl; |
1541 |
|
cout << endl << "max.strip : "; |
1542 |
|
cout << endl << "multiplicity : "; |
1543 |
} |
} |
1544 |
//-------------------------------------- |
//-------------------------------------- |
1545 |
// |
// |
1552 |
coord[0]=-999; |
coord[0]=-999; |
1553 |
coord[1]=-999; |
coord[1]=-999; |
1554 |
sgnl=0; |
sgnl=0; |
1555 |
|
multmax = 0; |
1556 |
|
|
1557 |
} |
} |
1558 |
//-------------------------------------- |
//-------------------------------------- |
1584 |
// |
// |
1585 |
// |
// |
1586 |
//-------------------------------------- |
//-------------------------------------- |
1587 |
|
void TrkLevel2::SetTrackArray(TClonesArray *track){ |
1588 |
|
if(track && strcmp(track->GetClass()->GetName(),"TrkTrack")==0){ |
1589 |
|
if(Track)Track->Clear("C"); |
1590 |
|
Track = track; |
1591 |
|
} |
1592 |
|
} |
1593 |
|
//-------------------------------------- |
1594 |
|
// |
1595 |
|
// |
1596 |
|
//-------------------------------------- |
1597 |
void TrkLevel2::Dump(){ |
void TrkLevel2::Dump(){ |
1598 |
|
|
1599 |
// |
// |
1600 |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
1601 |
cout << endl << "good : "; for(int i=0; i<12; i++) cout << good[i]<<" "; |
cout << endl << "good : "; for(int i=0; i<12; i++) cout << hex <<" 0x"<< good[i]<<dec; |
1602 |
cout << endl << "ntrk() : " << this->ntrk() ; |
cout << endl << "ntrk() : " << ntrk() ; |
1603 |
cout << endl << "nclsx() : " << this->nclsx(); |
cout << endl << "nclsx() : " << nclsx(); |
1604 |
cout << endl << "nclsy() : " << this->nclsy(); |
cout << endl << "nclsy() : " << nclsy(); |
1605 |
if(Track){ |
if(Track){ |
1606 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1607 |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
1608 |
} |
} |
1609 |
if(SingletX){ |
// if(SingletX){ |
1610 |
TClonesArray &sx = *SingletX; |
// TClonesArray &sx = *SingletX; |
1611 |
for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
// for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
1612 |
} |
// } |
1613 |
if(SingletY){ |
// if(SingletY){ |
1614 |
TClonesArray &sy = *SingletY; |
// TClonesArray &sy = *SingletY; |
1615 |
for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
// for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
1616 |
} |
// } |
1617 |
|
cout << endl; |
1618 |
} |
} |
1619 |
|
/** |
1620 |
|
* \brief Dump processing status |
1621 |
|
*/ |
1622 |
|
void TrkLevel2::StatusDump(int view){ |
1623 |
|
cout << "DSP n. "<<view+1<<" status: "<<hex<<good[view]<<endl; |
1624 |
|
}; |
1625 |
|
/** |
1626 |
|
* \brief Check event status |
1627 |
|
* |
1628 |
|
* Check the event status, according to a flag-mask given as input. |
1629 |
|
* Return true if the view passes the check. |
1630 |
|
* |
1631 |
|
* @param view View number (0-11) |
1632 |
|
* @param flagmask Mask of flags to check (eg. flagmask=0x111 no missing packet, |
1633 |
|
* no crc error, no software alarm) |
1634 |
|
* |
1635 |
|
* @see TrkLevel2 class definition to know how the status flag is defined |
1636 |
|
* |
1637 |
|
*/ |
1638 |
|
Bool_t TrkLevel2::StatusCheck(int view, int flagmask){ |
1639 |
|
|
1640 |
|
if( view<0 || view >= 12)return false; |
1641 |
|
return !(good[view]&flagmask); |
1642 |
|
|
1643 |
|
}; |
1644 |
|
|
1645 |
|
|
1646 |
//-------------------------------------- |
//-------------------------------------- |
1647 |
// |
// |
1648 |
// |
// |
1673 |
* forced (see TrkLevel2::GetVKMask(int,int)) or |
* forced (see TrkLevel2::GetVKMask(int,int)) or |
1674 |
* for this event only (TrkLevel2::GetVKFlag(int,int)). |
* for this event only (TrkLevel2::GetVKFlag(int,int)). |
1675 |
* @param iv Tracker view (0-11) |
* @param iv Tracker view (0-11) |
1676 |
* @param ivk Viking-chip number (0-23) |
* @param ivk Viking-chip number (0-23) |
1677 |
*/ |
*/ |
1678 |
Bool_t TrkLevel2::IsMaskedVK(int iv, int ivk){ |
Bool_t TrkLevel2::IsMaskedVK(int iv, int ivk){ |
1679 |
return !(GetVKMask(iv,ivk)&&GetVKFlag(iv,ivk) ); |
return !(GetVKMask(iv,ivk)&&GetVKFlag(iv,ivk) ); |
1758 |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
1759 |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
1760 |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
1761 |
|
t_track->multmaxx[ip] = l2->multmaxx[i][ip]; |
1762 |
|
t_track->multmaxy[ip] = l2->multmaxy[i][ip]; |
1763 |
|
t_track->seedx[ip] = l2->seedx[i][ip]; |
1764 |
|
t_track->seedy[ip] = l2->seedy[i][ip]; |
1765 |
|
t_track->xpu[ip] = l2->xpu[i][ip]; |
1766 |
|
t_track->ypu[ip] = l2->ypu[i][ip]; |
1767 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1768 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1769 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1770 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1771 |
}; |
}; |
1772 |
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
1773 |
|
// evaluated coordinates (to define GF) |
1774 |
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
1775 |
|
int ngf = TrkParams::nGF; |
1776 |
|
float *zgf = TrkParams::zGF; |
1777 |
|
Trajectory tgf = Trajectory(ngf,zgf); |
1778 |
|
tgf.DoTrack(t_track->al);//<<<< integrate the trajectory |
1779 |
|
for(int ip=0; ip<ngf; ip++){ |
1780 |
|
t_track->xGF[ip] = tgf.x[ip]; |
1781 |
|
t_track->yGF[ip] = tgf.y[ip]; |
1782 |
|
} |
1783 |
|
|
1784 |
// if(t_track->IsSaturated())t_track->Dump(); |
// if(t_track->IsSaturated())t_track->Dump(); |
1785 |
new(t[i]) TrkTrack(*t_track); |
new(t[i]) TrkTrack(*t_track); |
1786 |
t_track->Clear(); |
t_track->Clear(); |
1787 |
}; |
};//end loop over track |
1788 |
|
|
1789 |
// ---------------- |
// ---------------- |
1790 |
// *** SINGLETS *** |
// *** SINGLETS *** |
1796 |
t_singlet->coord[0] = l2->xs[i][0]; |
t_singlet->coord[0] = l2->xs[i][0]; |
1797 |
t_singlet->coord[1] = l2->xs[i][1]; |
t_singlet->coord[1] = l2->xs[i][1]; |
1798 |
t_singlet->sgnl = l2->signlxs[i]; |
t_singlet->sgnl = l2->signlxs[i]; |
1799 |
|
t_singlet->multmax = l2->multmaxsx[i]; |
1800 |
|
if(l2->sxbad[i]>0) t_singlet->multmax = -1*t_singlet->multmax; |
1801 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1802 |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
1803 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1811 |
t_singlet->coord[0] = l2->ys[i][0]; |
t_singlet->coord[0] = l2->ys[i][0]; |
1812 |
t_singlet->coord[1] = l2->ys[i][1]; |
t_singlet->coord[1] = l2->ys[i][1]; |
1813 |
t_singlet->sgnl = l2->signlys[i]; |
t_singlet->sgnl = l2->signlys[i]; |
1814 |
|
t_singlet->multmax = l2->multmaxsy[i]; |
1815 |
|
if(l2->sybad[i]>0) t_singlet->multmax = -1*t_singlet->multmax; |
1816 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1817 |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
1818 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1819 |
new(sy[i]) TrkSinglet(*t_singlet); |
new(sy[i]) TrkSinglet(*t_singlet); |
1820 |
t_singlet->Clear(); |
t_singlet->Clear(); |
1821 |
}; |
}; |
1822 |
|
|
1823 |
|
|
1824 |
|
|
1825 |
delete t_track; |
delete t_track; |
1826 |
delete t_singlet; |
delete t_singlet; |
1933 |
|
|
1934 |
if(!Track)return 0; |
if(!Track)return 0; |
1935 |
|
|
1936 |
TRefArray *sorted = new TRefArray(); |
// TRefArray *sorted = new TRefArray(); |
1937 |
|
TRefArray *sorted = NULL; |
1938 |
|
|
1939 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1940 |
// TClonesArray &ts = *PhysicalTrack; |
// TClonesArray &ts = *PhysicalTrack; |
1972 |
|
|
1973 |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
1974 |
}; |
}; |
1975 |
|
if(!sorted)sorted = new TRefArray( TProcessID::GetProcessWithUID(t[indi])); |
1976 |
sorted->Add( (TrkTrack*)t[indi] ); |
sorted->Add( (TrkTrack*)t[indi] ); |
1977 |
|
|
1978 |
m[indi] = 0; |
m[indi] = 0; |
1998 |
TrkTrack *TrkLevel2::GetStoredTrack(int is){ |
TrkTrack *TrkLevel2::GetStoredTrack(int is){ |
1999 |
|
|
2000 |
if(is >= this->ntrk()){ |
if(is >= this->ntrk()){ |
2001 |
cout << "** TrkLevel2 ** Track "<< is << "doen not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetStoredTrack(int) >> Track "<< is << "doen not exits! " << endl; |
2002 |
cout << " Stored tracks ntrk() = "<< this->ntrk() << endl; |
cout << "Stored tracks ntrk() = "<< this->ntrk() << endl; |
2003 |
return 0; |
return 0; |
2004 |
} |
} |
2005 |
if(!Track){ |
if(!Track){ |
2020 |
TrkSinglet *TrkLevel2::GetSingletX(int is){ |
TrkSinglet *TrkLevel2::GetSingletX(int is){ |
2021 |
|
|
2022 |
if(is >= this->nclsx()){ |
if(is >= this->nclsx()){ |
2023 |
cout << "** TrkLevel2 ** Singlet "<< is << "doen not exits! " << endl; |
cout << "TrkSinglet *TrkLevel2::GetSingletX(int) >> Singlet "<< is << "doen not exits! " << endl; |
2024 |
cout << " Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
cout << "Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
2025 |
return 0; |
return 0; |
2026 |
} |
} |
2027 |
if(!SingletX)return 0; |
if(!SingletX)return 0; |
2040 |
TrkSinglet *TrkLevel2::GetSingletY(int is){ |
TrkSinglet *TrkLevel2::GetSingletY(int is){ |
2041 |
|
|
2042 |
if(is >= this->nclsy()){ |
if(is >= this->nclsy()){ |
2043 |
cout << "** TrkLevel2 ** Singlet "<< is << "doen not exits! " << endl; |
cout << "TrkSinglet *TrkLevel2::GetSingletY(int) >> Singlet "<< is << "doen not exits! " << endl; |
2044 |
cout << " Stored y-singlets nclsy() = "<< this->nclsx() << endl; |
cout << "Stored y-singlets nclsx() = "<< this->nclsx() << endl; |
2045 |
return 0; |
return 0; |
2046 |
} |
} |
2047 |
if(!SingletY)return 0; |
if(!SingletY)return 0; |
2061 |
TrkTrack *TrkLevel2::GetTrack(int it){ |
TrkTrack *TrkLevel2::GetTrack(int it){ |
2062 |
|
|
2063 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
2064 |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrack(int) >> Track "<< it << "does not exits! " << endl; |
2065 |
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
cout << "Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
2066 |
return 0; |
return 0; |
2067 |
} |
} |
2068 |
|
|
2099 |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
2100 |
|
|
2101 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
2102 |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrackImage(int) >> Track "<< it << "does not exits! " << endl; |
2103 |
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
cout << "Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
2104 |
return 0; |
return 0; |
2105 |
} |
} |
2106 |
|
|
2109 |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
2110 |
|
|
2111 |
if(!track->HasImage()){ |
if(!track->HasImage()){ |
2112 |
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrackImage(int) >> Track "<< it << "does not have image! " << endl; |
2113 |
return 0; |
return 0; |
2114 |
} |
} |
2115 |
if(!Track)return 0; |
if(!Track)return 0; |
2136 |
// path_.error = 0; |
// path_.error = 0; |
2137 |
// readb_(); |
// readb_(); |
2138 |
|
|
2139 |
TrkParams::SetTrackingMode(); |
// TrkParams::SetTrackingMode(); |
2140 |
TrkParams::SetPrecisionFactor(); |
// TrkParams::SetPrecisionFactor(); |
2141 |
TrkParams::SetStepMin(); |
// TrkParams::SetStepMin(); |
2142 |
|
TrkParams::SetMiniDefault(); |
2143 |
|
|
2144 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
2145 |
TrkParams::Load(1); |
TrkParams::Load(1); |
2146 |
|
if( !TrkParams::IsLoaded(1) ){ |
2147 |
|
cout << "void TrkLevel2::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
2148 |
|
} |
2149 |
|
|
2150 |
// |
// |
2151 |
}; |
}; |
2204 |
* (By default is created with z-coordinates inside the tracking volume) |
* (By default is created with z-coordinates inside the tracking volume) |
2205 |
*/ |
*/ |
2206 |
Trajectory::Trajectory(){ |
Trajectory::Trajectory(){ |
2207 |
npoint = 10; |
npoint = 6; |
2208 |
x = new float[npoint]; |
x = new float[npoint]; |
2209 |
y = new float[npoint]; |
y = new float[npoint]; |
2210 |
z = new float[npoint]; |
z = new float[npoint]; |
2271 |
thy = new float[npoint]; |
thy = new float[npoint]; |
2272 |
tl = new float[npoint]; |
tl = new float[npoint]; |
2273 |
int i=0; |
int i=0; |
2274 |
do{ |
do{ |
2275 |
x[i] = 0; |
x[i] = 0.; |
2276 |
y[i] = 0; |
y[i] = 0.; |
2277 |
z[i] = zin[i]; |
z[i] = zin[i]; |
2278 |
thx[i] = 0; |
thx[i] = 0.; |
2279 |
thy[i] = 0; |
thy[i] = 0.; |
2280 |
tl[i] = 0; |
tl[i] = 0.; |
2281 |
i++; |
i++; |
2282 |
}while(zin[i-1] > zin[i] && i < npoint); |
}while(zin[i-1] > zin[i] && i < npoint); |
2283 |
npoint=i; |
npoint=i; |
2284 |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points"<<endl; |
if(npoint != n)cout << "NB! Trajectory created with "<<npoint<<" points instean of "<<n<<endl; |
2285 |
|
// Dump(); |
2286 |
} |
} |
2287 |
void Trajectory::Delete(){ |
void Trajectory::Delete(){ |
2288 |
|
|
2334 |
|
|
2335 |
/** |
/** |
2336 |
* Evaluates the trajectory in the apparatus associated to the track. |
* Evaluates the trajectory in the apparatus associated to the track. |
2337 |
* 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. |
* It integrates the equations of motion in the magnetic field. |
2338 |
* @param t pointer to an object of the class Trajectory, |
* @param al Track state-vector (X0,Y0,sin(theta),phi,deflection). |
2339 |
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
* @param zini z-coordinate of the reference plane (Z0). |
2340 |
* @return error flag. |
* @return error flag. |
2341 |
*/ |
* |
2342 |
int Trajectory::DoTrack2(float* al){ |
* This method is needed when you want to integrate the particle trajectory |
2343 |
|
* starting from a track state-vector relative to an arbitrary reference plane. |
2344 |
double *dxout = new double[npoint]; |
* The default reference plane, used by the tracker routines, is at zini=23.5. |
2345 |
double *dyout = new double[npoint]; |
* If you give as input the track state-vector from a TrkTrack object, |
2346 |
double *dthxout = new double[npoint]; |
* you can use Trajectory::DoTrack(float* al) instead. |
2347 |
double *dthyout = new double[npoint]; |
*/ |
2348 |
double *dtlout = new double[npoint]; |
int Trajectory::DoTrack(float* al, float zini){ |
2349 |
double *dzin = new double[npoint]; |
|
2350 |
|
// double *dxout = new double[npoint]; |
2351 |
|
// double *dyout = new double[npoint]; |
2352 |
|
// double *dthxout = new double[npoint]; |
2353 |
|
// double *dthyout = new double[npoint]; |
2354 |
|
// double *dtlout = new double[npoint]; |
2355 |
|
// double *dzin = new double[npoint]; |
2356 |
|
|
2357 |
|
double *dxout; |
2358 |
|
double *dyout; |
2359 |
|
double *dthxout; |
2360 |
|
double *dthyout; |
2361 |
|
double *dtlout; |
2362 |
|
double *dzin; |
2363 |
|
|
2364 |
|
dxout = (double*) malloc(npoint*sizeof(double)); |
2365 |
|
dyout = (double*) malloc(npoint*sizeof(double)); |
2366 |
|
dthxout = (double*) malloc(npoint*sizeof(double)); |
2367 |
|
dthyout = (double*) malloc(npoint*sizeof(double)); |
2368 |
|
dtlout = (double*) malloc(npoint*sizeof(double)); |
2369 |
|
dzin = (double*) malloc(npoint*sizeof(double)); |
2370 |
|
|
2371 |
double dal[5]; |
double dal[5]; |
2372 |
|
|
2373 |
int ifail = 0; |
double dzini = (double)zini; |
2374 |
|
|
2375 |
|
int ifail = 0; |
2376 |
|
|
2377 |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
for (int i=0; i<5; i++) dal[i] = (double)al[i]; |
2378 |
for (int i=0; i<npoint; i++) dzin[i] = (double)z[i]; |
for (int i=0; i<npoint; i++) dzin[i] = (double)z[i]; |
2379 |
|
|
2380 |
TrkParams::Load(1); |
TrkParams::Load(1); |
2381 |
if( !TrkParams::IsLoaded(1) ){ |
if( !TrkParams::IsLoaded(1) ){ |
2382 |
cout << "int Trajectory::DoTrack2(float* al) --- ERROR --- m.field not loaded"<<endl; |
cout << "int Trajectory::DoTrack(float* al) --- ERROR --- m.field not loaded"<<endl; |
2383 |
return 0; |
return 0; |
2384 |
} |
} |
2385 |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
// dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
2386 |
|
dotrack3_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&dzini,&ifail); |
2387 |
|
|
2388 |
for (int i=0; i<npoint; i++){ |
for (int i=0; i<npoint; i++){ |
2389 |
x[i] = (float)*dxout++; |
x[i] = (float)*(dxout+i); |
2390 |
y[i] = (float)*dyout++; |
y[i] = (float)*(dyout+i); |
2391 |
thx[i] = (float)*dthxout++; |
thx[i] = (float)*(dthxout+i); |
2392 |
thy[i] = (float)*dthyout++; |
thy[i] = (float)*(dthyout+i); |
2393 |
tl[i] = (float)*dtlout++; |
tl[i] = (float)*(dtlout+i); |
2394 |
} |
} |
2395 |
|
|
2396 |
|
if(dxout) free( dxout ); |
2397 |
|
if(dyout) free( dyout ); |
2398 |
|
if(dthxout)free( dthxout ); |
2399 |
|
if(dthyout)free( dthyout ); |
2400 |
|
if(dtlout) free( dtlout ); |
2401 |
|
if(dzin) free( dzin ); |
2402 |
|
|
2403 |
|
// delete [] dxout; |
2404 |
|
// delete [] dyout; |
2405 |
|
// delete [] dthxout; |
2406 |
|
// delete [] dthyout; |
2407 |
|
// delete [] dtlout; |
2408 |
|
// delete [] dzin; |
2409 |
|
|
2410 |
|
|
2411 |
return ifail; |
return ifail; |
2412 |
}; |
}; |
2413 |
|
|
2414 |
|
/** |
2415 |
|
* |
2416 |
|
* >>> OBSOLETE !!! use Trajectory::DoTrack(float* al, float zini) instead |
2417 |
|
* |
2418 |
|
*/ |
2419 |
|
int Trajectory::DoTrack2(float* al, float zini){ |
2420 |
|
|
2421 |
|
cout << endl; |
2422 |
|
cout << " int Trajectory::DoTrack2(float* al, float zini) --->> NB NB !! this method is going to be eliminated !!! "<<endl; |
2423 |
|
cout << " >>>> replace it with TrkTrack::DoTrack(Trajectory* t) <<<<"<<endl; |
2424 |
|
cout << " (Sorry Wolfgang!! Don't be totally confused!! By Elena)"<<endl; |
2425 |
|
cout << endl; |
2426 |
|
|
2427 |
|
return DoTrack(al,zini); |
2428 |
|
|
2429 |
|
}; |
2430 |
|
|
2431 |
|
|
2432 |
|
|
2433 |
ClassImp(TrkLevel2); |
ClassImp(TrkLevel2); |
2434 |
ClassImp(TrkSinglet); |
ClassImp(TrkSinglet); |
2435 |
ClassImp(TrkTrack); |
ClassImp(TrkTrack); |