52 |
ayv[ip] = 0; |
ayv[ip] = 0; |
53 |
dedx_x[ip] = 0; |
dedx_x[ip] = 0; |
54 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
55 |
|
multmaxx[ip] = 0; |
56 |
|
multmaxy[ip] = 0; |
57 |
|
seedx[ip] = 0; |
58 |
|
seedy[ip] = 0; |
59 |
|
xpu[ip] = 0; |
60 |
|
ypu[ip] = 0; |
61 |
|
|
62 |
}; |
}; |
63 |
// clx = 0; |
|
64 |
// cly = 0; |
// TrkParams::SetTrackingMode(); |
65 |
// clx = new TRefArray(6,0); //forse causa memory leak??? |
// TrkParams::SetPrecisionFactor(); |
66 |
// cly = new TRefArray(6,0); //forse causa memory leak??? |
// TrkParams::SetStepMin(); |
67 |
// clx = TRefArray(6,0); |
TrkParams::SetMiniDefault(); |
|
// cly = TRefArray(6,0); |
|
|
|
|
|
TrkParams::SetTrackingMode(); |
|
|
TrkParams::SetPrecisionFactor(); |
|
|
TrkParams::SetStepMin(); |
|
68 |
TrkParams::SetPFA(); |
TrkParams::SetPFA(); |
69 |
|
|
70 |
|
int ngf = TrkParams::nGF; |
71 |
|
for(int i=0; i<ngf; i++){ |
72 |
|
xGF[i] = 0.; |
73 |
|
yGF[i] = 0.; |
74 |
|
} |
75 |
|
|
76 |
|
|
77 |
}; |
}; |
78 |
//-------------------------------------- |
//-------------------------------------- |
79 |
// |
// |
105 |
ayv[ip] = t.ayv[ip]; |
ayv[ip] = t.ayv[ip]; |
106 |
dedx_x[ip] = t.dedx_x[ip]; |
dedx_x[ip] = t.dedx_x[ip]; |
107 |
dedx_y[ip] = t.dedx_y[ip]; |
dedx_y[ip] = t.dedx_y[ip]; |
108 |
|
multmaxx[ip] = t.multmaxx[ip]; |
109 |
|
multmaxy[ip] = t.multmaxy[ip]; |
110 |
|
seedx[ip] = t.seedx[ip]; |
111 |
|
seedy[ip] = t.seedy[ip]; |
112 |
|
xpu[ip] = t.xpu[ip]; |
113 |
|
ypu[ip] = t.ypu[ip]; |
114 |
}; |
}; |
115 |
// clx = 0; |
|
116 |
// cly = 0; |
// TrkParams::SetTrackingMode(); |
117 |
// if(t.clx)clx = new TRefArray(*(t.clx)); |
// TrkParams::SetPrecisionFactor(); |
118 |
// if(t.cly)cly = new TRefArray(*(t.cly)); |
// TrkParams::SetStepMin(); |
119 |
// clx = TRefArray(t.clx); |
TrkParams::SetMiniDefault(); |
|
// cly = TRefArray(t.cly); |
|
|
|
|
|
TrkParams::SetTrackingMode(); |
|
|
TrkParams::SetPrecisionFactor(); |
|
|
TrkParams::SetStepMin(); |
|
120 |
TrkParams::SetPFA(); |
TrkParams::SetPFA(); |
121 |
|
|
122 |
|
int ngf = TrkParams::nGF; |
123 |
|
for(int i=0; i<ngf; i++){ |
124 |
|
xGF[i] = t.xGF[i]; |
125 |
|
yGF[i] = t.yGF[i]; |
126 |
|
} |
127 |
}; |
}; |
128 |
//-------------------------------------- |
//-------------------------------------- |
129 |
// |
// |
156 |
t.ayv[ip] = ayv[ip]; |
t.ayv[ip] = ayv[ip]; |
157 |
t.dedx_x[ip] = dedx_x[ip]; |
t.dedx_x[ip] = dedx_x[ip]; |
158 |
t.dedx_y[ip] = dedx_y[ip]; |
t.dedx_y[ip] = dedx_y[ip]; |
159 |
|
t.multmaxx[ip] = multmaxx[ip]; |
160 |
|
t.multmaxy[ip] = multmaxy[ip]; |
161 |
|
t.seedx[ip] = seedx[ip]; |
162 |
|
t.seedy[ip] = seedy[ip]; |
163 |
|
t.xpu[ip] = xpu[ip]; |
164 |
|
t.ypu[ip] = ypu[ip]; |
165 |
|
|
166 |
}; |
}; |
167 |
|
int ngf = TrkParams::nGF; |
168 |
|
for(int i=0; i<ngf; i++){ |
169 |
|
t.xGF[i] = xGF[i]; |
170 |
|
t.yGF[i] = yGF[i]; |
171 |
|
} |
172 |
|
|
|
// t.clx = TRefArray(clx); |
|
|
// t.cly = TRefArray(cly); |
|
173 |
|
|
174 |
}; |
}; |
175 |
//-------------------------------------- |
//-------------------------------------- |
182 |
* @param t pointer to an object of the class Trajectory, |
* @param t pointer to an object of the class Trajectory, |
183 |
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
* which z coordinates should be previously initialized by calling the proper constructor ( Trajectory::Trajectory(int n, float* zin) ). |
184 |
* @return error flag. |
* @return error flag. |
185 |
|
* |
186 |
|
* >>> OBSOLETE !!! use TrkTrack::DoTrack2(Trajectory* t) instead |
187 |
|
* |
188 |
*/ |
*/ |
189 |
int TrkTrack::DoTrack(Trajectory* t){ |
int TrkTrack::DoTrack(Trajectory* t){ |
190 |
|
|
191 |
|
cout << " int TrkTrack::DoTrack(Trajectory* t) --->> OBSOLETE !!! "<<endl; |
192 |
|
cout << " use int TrkTrack::DoTrack2(Trajectory* t)"<<endl; |
193 |
|
|
194 |
double *dxout = new double[t->npoint]; |
double *dxout = new double[t->npoint]; |
195 |
double *dyout = new double[t->npoint]; |
double *dyout = new double[t->npoint]; |
196 |
double *dzin = new double[t->npoint]; |
double *dzin = new double[t->npoint]; |
209 |
dotrack_(&(t->npoint),dzin,dxout,dyout,dal,&ifail); |
dotrack_(&(t->npoint),dzin,dxout,dyout,dal,&ifail); |
210 |
|
|
211 |
for (int i=0; i<t->npoint; i++){ |
for (int i=0; i<t->npoint; i++){ |
212 |
t->x[i] = (float)*dxout++; |
t->x[i] = (float)*(dxout+i); |
213 |
t->y[i] = (float)*dyout++; |
t->y[i] = (float)*(dyout+i); |
214 |
} |
} |
215 |
|
|
216 |
// delete [] dxout; |
delete [] dxout; |
217 |
// delete [] dyout; |
delete [] dyout; |
218 |
// delete [] dzin; |
delete [] dzin; |
219 |
|
|
220 |
return ifail; |
return ifail; |
221 |
}; |
}; |
253 |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(t->npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
254 |
|
|
255 |
for (int i=0; i<t->npoint; i++){ |
for (int i=0; i<t->npoint; i++){ |
256 |
t->x[i] = (float)*dxout++; |
t->x[i] = (float)*(dxout+i); |
257 |
t->y[i] = (float)*dyout++; |
t->y[i] = (float)*(dyout+i); |
258 |
t->thx[i] = (float)*dthxout++; |
t->thx[i] = (float)*(dthxout+i); |
259 |
t->thy[i] = (float)*dthyout++; |
t->thy[i] = (float)*(dthyout+i); |
260 |
t->tl[i] = (float)*dtlout++; |
t->tl[i] = (float)*(dtlout+i); |
261 |
} |
} |
262 |
|
|
263 |
// delete [] dxout; |
delete [] dxout; |
264 |
// delete [] dyout; |
delete [] dyout; |
265 |
// delete [] dzin; |
delete [] dzin; |
266 |
|
delete [] dthxout; |
267 |
|
delete [] dthyout; |
268 |
|
delete [] dtlout; |
269 |
|
|
270 |
return ifail; |
return ifail; |
271 |
}; |
}; |
325 |
return dedx; |
return dedx; |
326 |
}; |
}; |
327 |
/** |
/** |
328 |
* Returns 1 if the cluster on a tracker view includes bad strips. |
* Returns 1 if the cluster on a tracker view includes bad strips |
329 |
|
* (at least one bad strip among the four strip used by p.f.a.) |
330 |
* @param ip plane (0-5) |
* @param ip plane (0-5) |
331 |
* @param iv view (0=x 1=y) |
* @param iv view (0=x 1=y) |
332 |
*/ |
*/ |
455 |
return lnl; |
return lnl; |
456 |
|
|
457 |
} |
} |
458 |
|
/** |
459 |
|
* Returns the effective angle, relative to the sensor, on each plane. |
460 |
|
* @param ip plane (0-5) |
461 |
|
* @param iv view (0=x 1=y) |
462 |
|
*/ |
463 |
|
Float_t TrkTrack::GetEffectiveAngle(int ip, int iv){ |
464 |
|
|
465 |
|
if(ip<0 || ip>5){ |
466 |
|
cout << "Float_t TrkTrack::GetEffectiveAngle(int "<<ip<<", int "<<iv<<") ==> wrong input"<<endl; |
467 |
|
return 0.; |
468 |
|
} |
469 |
|
|
470 |
|
float v[3]={xv[ip],yv[ip],zv[ip]}; |
471 |
|
//----------------------------------------- |
472 |
|
// effective angle (relative to the sensor) |
473 |
|
//----------------------------------------- |
474 |
|
float axv_geo = axv[ip]; |
475 |
|
float muhall_h = 297.61; //cm**2/Vs |
476 |
|
float BY = TrkParams::GetBY(v); |
477 |
|
float axv_eff = 0; |
478 |
|
if(ip==5) axv_geo = -1*axv_geo; |
479 |
|
if(ip==5) BY = -1*BY; |
480 |
|
axv_eff = 180.*atan( tan(axv_geo*acos(-1.)/180.) + muhall_h * BY * 0.0001)/acos(-1.); |
481 |
|
//----------------------------------------- |
482 |
|
// effective angle (relative to the sensor) |
483 |
|
//----------------------------------------- |
484 |
|
float ayv_geo = ayv[ip]; |
485 |
|
float muhall_e = 1258.18; //cm**2/Vs |
486 |
|
float BX = TrkParams::GetBX(v); |
487 |
|
float ayv_eff = 0; |
488 |
|
ayv_eff = 180.*atan( tan(ayv_geo*acos(-1.)/180.) + muhall_e * BX * 0.0001)/acos(-1.); |
489 |
|
|
490 |
|
if (iv==0)return axv_eff; |
491 |
|
else if(iv==1)return ayv_eff; |
492 |
|
else{ |
493 |
|
cout << "Float_t TrkTrack::GetEffectiveAngle(int "<<ip<<", int "<<iv<<") ==> wrong input"<<endl; |
494 |
|
return 0.; |
495 |
|
} |
496 |
|
|
497 |
|
}; |
498 |
|
|
499 |
//-------------------------------------- |
//-------------------------------------- |
500 |
// |
// |
501 |
// |
// |
526 |
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]<<" "; |
527 |
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] << " "; |
528 |
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] << " "; |
529 |
|
cout << endl << "maxs x : "; for(int i=0; i<6; i++)cout << GetClusterX_MaxStrip(i) << " "; |
530 |
|
cout << endl << "maxs y : "; for(int i=0; i<6; i++)cout << GetClusterY_MaxStrip(i) << " "; |
531 |
|
cout << endl << "mult x : "; for(int i=0; i<6; i++)cout << GetClusterX_Multiplicity(i) << " "; |
532 |
|
cout << endl << "mult y : "; for(int i=0; i<6; i++)cout << GetClusterY_Multiplicity(i) << " "; |
533 |
|
cout << endl << "seed x : "; for(int i=0; i<6; i++)cout << GetClusterX_Seed(i) << " "; |
534 |
|
cout << endl << "seed y : "; for(int i=0; i<6; i++)cout << GetClusterY_Seed(i) << " "; |
535 |
|
cout << endl << "xpu : "; for(int i=0; i<6; i++)cout << xpu[i] << " "; |
536 |
|
cout << endl << "ypu : "; for(int i=0; i<6; i++)cout << ypu[i] << " "; |
537 |
|
|
538 |
cout << endl; |
cout << endl; |
539 |
} |
} |
540 |
/** |
/** |
650 |
// path_.error = 0; |
// path_.error = 0; |
651 |
// readb_(); |
// readb_(); |
652 |
|
|
653 |
TrkParams::SetTrackingMode(); |
// TrkParams::SetTrackingMode(); |
654 |
TrkParams::SetPrecisionFactor(); |
// TrkParams::SetPrecisionFactor(); |
655 |
TrkParams::SetStepMin(); |
// TrkParams::SetStepMin(); |
656 |
|
TrkParams::SetMiniDefault(); |
657 |
|
|
658 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
659 |
TrkParams::Load(1); |
TrkParams::Load(1); |
660 |
|
if( !TrkParams::IsLoaded(1) ){ |
661 |
|
cout << "void TrkTrack::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
662 |
|
} |
663 |
|
|
664 |
}; |
}; |
665 |
|
|
681 |
track.zm[i]=zm[i]; |
track.zm[i]=zm[i]; |
682 |
|
|
683 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
684 |
// andrebbe inserita la dimensione del sensore |
// float segment = 100.; |
685 |
float segment = 100.; |
// track.xm_a[i]=xm[i]; |
686 |
track.xm_a[i]=xm[i]; |
// track.xm_b[i]=xm[i]; |
687 |
track.xm_b[i]=xm[i]; |
// track.ym_a[i]=ym[i]; |
688 |
track.ym_a[i]=ym[i]; |
// track.ym_b[i]=ym[i]; |
689 |
track.ym_b[i]=ym[i]; |
// if( XGood(i) && !YGood(i) ){ |
690 |
if( XGood(i) && !YGood(i) ){ |
// track.ym_a[i] = track.ym_a[i]+segment; |
691 |
track.ym_a[i] = track.ym_a[i]+segment; |
// track.ym_b[i] = track.ym_b[i]-segment; |
692 |
track.ym_b[i] = track.ym_b[i]-segment; |
// }else if( !XGood(i) && YGood(i)){ |
693 |
}else if( !XGood(i) && YGood(i)){ |
// track.xm_a[i] = track.xm_a[i]+segment; |
694 |
track.xm_a[i] = track.xm_a[i]+segment; |
// track.xm_b[i] = track.xm_b[i]-segment; |
695 |
track.xm_b[i] = track.xm_b[i]-segment; |
// } |
|
} |
|
696 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
697 |
|
|
698 |
|
if( XGood(i) || YGood(i) ){ |
699 |
|
double segment = 2.;//cm |
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.; |
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]; |
721 |
|
gamma = alignparameters_.gamma[is][il][ip]; |
722 |
|
} |
723 |
|
|
724 |
|
if( XGood(i) && !YGood(i) ){ |
725 |
|
track.xm_a[i] = xm[i] - omega * segment; |
726 |
|
track.ym_a[i] = ym[i] + segment; |
727 |
|
track.zm_a[i] = zm[i] + beta * segment; |
728 |
|
track.xm_b[i] = xm[i] + omega * segment; |
729 |
|
track.ym_b[i] = ym[i] - segment; |
730 |
|
track.zm_b[i] = zm[i] - beta * segment; |
731 |
|
}else if( !XGood(i) && YGood(i) ){ |
732 |
|
track.xm_a[i] = xm[i] + segment; |
733 |
|
track.ym_a[i] = ym[i] + omega * segment; |
734 |
|
track.zm_a[i] = zm[i] - gamma * segment; |
735 |
|
track.xm_b[i] = xm[i] - segment; |
736 |
|
track.ym_b[i] = ym[i] - omega * segment; |
737 |
|
track.zm_b[i] = zm[i] + gamma * segment; |
738 |
|
} |
739 |
|
} |
740 |
|
|
741 |
track.resx[i]=resx[i]; |
track.resx[i]=resx[i]; |
742 |
track.resy[i]=resy[i]; |
track.resy[i]=resy[i]; |
743 |
track.tailx[i]=tailx[i]; |
track.tailx[i]=tailx[i]; |
744 |
track.taily[i]=taily[i]; |
track.taily[i]=taily[i]; |
799 |
*/ |
*/ |
800 |
Bool_t TrkTrack::EvaluateClusterPositions(){ |
Bool_t TrkTrack::EvaluateClusterPositions(){ |
801 |
|
|
802 |
// cout << "void TrkTrack::GetClusterPositions() "<<endl; |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
803 |
|
|
804 |
|
bool OK=true; |
805 |
|
TrkParams::Load(1); if( !TrkParams::IsLoaded(1) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- m.field not loaded "<<endl; |
806 |
|
TrkParams::Load(4); if( !TrkParams::IsLoaded(4) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- p.f.a. par. not loaded "<<endl; |
807 |
|
TrkParams::Load(5); if( !TrkParams::IsLoaded(5) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- alignment par. not loaded "<<endl; |
808 |
|
if(!OK)return false; |
809 |
|
|
|
TrkParams::Load( ); |
|
|
if( !TrkParams::IsLoaded() )return false; |
|
|
|
|
810 |
for(int ip=0; ip<6; ip++){ |
for(int ip=0; ip<6; ip++){ |
811 |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
812 |
int icx = GetClusterX_ID(ip)+1; |
int icx = GetClusterX_ID(ip)+1; |
850 |
* @see EvaluateClusterPositions() |
* @see EvaluateClusterPositions() |
851 |
* |
* |
852 |
* The fitting procedure can be varied by changing the tracking mode, |
* The fitting procedure can be varied by changing the tracking mode, |
853 |
* the fit-precision factor and the minimum number of step. |
* the fit-precision factor, the minimum number of step, etc. |
854 |
* @see SetTrackingMode(int) |
* @see SetTrackingMode(int) |
855 |
* @see SetPrecisionFactor(double) |
* @see SetPrecisionFactor(double) |
856 |
* @see SetStepMin(int) |
* @see SetStepMin(int) |
857 |
|
* @see SetDeltaB(int,double) |
858 |
*/ |
*/ |
859 |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
860 |
|
|
861 |
float al_ini[] = {0.,0.,0.,0.,0.}; |
bool OK=true; |
862 |
|
TrkParams::Load(1); if( !TrkParams::IsLoaded(1) )cout << "void TrkTrack::Fit(double,int&,int,int) ---ERROR--- m.field not loaded "<<endl; |
863 |
|
if(!OK)return; |
864 |
|
|
865 |
TrkParams::Load( ); |
float al_ini[] = {0.,0.,0.,0.,0.}; |
|
if( !TrkParams::IsLoaded() )return; |
|
866 |
|
|
867 |
extern cMini2track track_; |
extern cMini2track track_; |
868 |
fail = 0; |
fail = 0; |
898 |
|
|
899 |
// ------------------------------------------ |
// ------------------------------------------ |
900 |
// call mini routine |
// call mini routine |
901 |
// TrkParams::Load(1); |
// ------------------------------------------ |
|
// if( !TrkParams::IsLoaded(1) ){ |
|
|
// cout << "void TrkTrack::Fit(double pfixed, int& fail, int iprint) --- ERROR --- m.field not loaded"<<endl; |
|
|
// return; |
|
|
// } |
|
902 |
int istep=0; |
int istep=0; |
903 |
int ifail=0; |
int ifail=0; |
904 |
mini2_(&istep,&ifail, &iprint); |
mini2_(&istep,&ifail, &iprint); |
954 |
track_.istepmin = istepmin; |
track_.istepmin = istepmin; |
955 |
} |
} |
956 |
/** |
/** |
957 |
* Returns 1 if the track is inside the magnet cavity |
* Set deltaB parameters (id=0,1). By default they are set to zero. |
|
* Set the minimum number of steps for tracking precision |
|
958 |
*/ |
*/ |
959 |
Bool_t TrkTrack::IsInsideCavity(){ |
void TrkTrack::SetDeltaB(int id, double db){ |
960 |
float xmagntop, ymagntop, xmagnbottom, ymagnbottom; |
if(id!=0 && id!=1)cout << "void TrkTrack::SetDeltaB(int id,double db) -- wrong input parameters: "<<id<<" "<<db<<endl; |
961 |
xmagntop = xv[0] + (ZMAGNHIGH-zv[0])*tan(cos(-1.0)*axv[0]/180.); |
TrkParams::SetDeltaB(id,db); |
962 |
ymagntop = yv[0] + (ZMAGNHIGH-zv[0])*tan(cos(-1.0)*ayv[0]/180.); |
} |
963 |
xmagnbottom = xv[5] + (ZMAGNLOW-zv[5])*tan(cos(-1.0)*axv[5]/180.); |
|
964 |
ymagnbottom = yv[5] + (ZMAGNLOW-zv[5])*tan(cos(-1.0)*ayv[5]/180.); |
/** |
965 |
if( xmagntop>XMAGNLOW && xmagntop<XMAGNHIGH && |
* Returns true if the track is inside the magnet cavity. |
966 |
ymagntop>YMAGNLOW && ymagntop<YMAGNHIGH && |
* @param toll Tolerance around the nominal volume (toll>0 define an inner fiducial volume) |
967 |
xmagnbottom>XMAGNLOW && xmagnbottom<XMAGNHIGH && |
*/ |
968 |
ymagnbottom>YMAGNLOW && ymagnbottom<YMAGNHIGH ) return(true); |
Bool_t TrkTrack::IsInsideCavity(float toll){ |
969 |
else return(false); |
|
970 |
|
// float xmagntop, ymagntop, xmagnbottom, ymagnbottom; |
971 |
|
// xmagntop = xv[0] + (ZMAGNHIGH-zv[0])*tan(acos(-1.0)*axv[0]/180.); |
972 |
|
// ymagntop = yv[0] + (ZMAGNHIGH-zv[0])*tan(acos(-1.0)*ayv[0]/180.); |
973 |
|
// xmagnbottom = xv[5] + (ZMAGNLOW-zv[5])*tan(acos(-1.0)*axv[5]/180.); |
974 |
|
// ymagnbottom = yv[5] + (ZMAGNLOW-zv[5])*tan(acos(-1.0)*ayv[5]/180.); |
975 |
|
// if( xmagntop>XMAGNLOW && xmagntop<XMAGNHIGH && |
976 |
|
// ymagntop>YMAGNLOW && ymagntop<YMAGNHIGH && |
977 |
|
// xmagnbottom>XMAGNLOW && xmagnbottom<XMAGNHIGH && |
978 |
|
// ymagnbottom>YMAGNLOW && ymagnbottom<YMAGNHIGH ) return(true); |
979 |
|
// else return(false); |
980 |
|
|
981 |
|
int ngf = TrkParams::nGF; |
982 |
|
for(int i=0; i<ngf; i++){ |
983 |
|
// |
984 |
|
// cout << endl << TrkParams::GF_element[i]; |
985 |
|
if( |
986 |
|
TrkParams::GF_element[i].CompareTo("CUF") && |
987 |
|
TrkParams::GF_element[i].CompareTo("T2") && |
988 |
|
TrkParams::GF_element[i].CompareTo("T3") && |
989 |
|
TrkParams::GF_element[i].CompareTo("T4") && |
990 |
|
TrkParams::GF_element[i].CompareTo("T5") && |
991 |
|
TrkParams::GF_element[i].CompareTo("CLF") && |
992 |
|
true)continue; |
993 |
|
// apply condition only within the cavity |
994 |
|
// cout << " -- "<<xGF[i]<<" "<<yGF[i]; |
995 |
|
if( |
996 |
|
xGF[i] <= TrkParams::xGF_min[i] + toll || |
997 |
|
xGF[i] >= TrkParams::xGF_max[i] - toll || |
998 |
|
yGF[i] <= TrkParams::yGF_min[i] + toll || |
999 |
|
yGF[i] >= TrkParams::yGF_max[i] - toll || |
1000 |
|
false){ |
1001 |
|
|
1002 |
|
return false; |
1003 |
|
} |
1004 |
|
} |
1005 |
|
return true; |
1006 |
|
|
1007 |
|
|
1008 |
|
} |
1009 |
|
/** |
1010 |
|
* Returns true if the track is inside the nominal acceptance, which is defined |
1011 |
|
* by the intersection among magnet cavity, silicon-plane sensitive area and |
1012 |
|
* ToF sensitive area (nominal values from the official document used to |
1013 |
|
* calculate the geometrical factor) |
1014 |
|
*/ |
1015 |
|
Bool_t TrkTrack::IsInsideAcceptance(){ |
1016 |
|
|
1017 |
|
int ngf = TrkParams::nGF; |
1018 |
|
for(int i=0; i<ngf; i++){ |
1019 |
|
if( |
1020 |
|
xGF[i] <= TrkParams::xGF_min[i] || |
1021 |
|
xGF[i] >= TrkParams::xGF_max[i] || |
1022 |
|
yGF[i] <= TrkParams::yGF_min[i] || |
1023 |
|
yGF[i] >= TrkParams::yGF_max[i] || |
1024 |
|
false)return false; |
1025 |
|
} |
1026 |
|
return true; |
1027 |
|
|
1028 |
} |
} |
1029 |
/** |
/** |
1030 |
* 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. |
1042 |
Int_t TrkTrack::GetClusterY_ID(int ip){ |
Int_t TrkTrack::GetClusterY_ID(int ip){ |
1043 |
return ((Int_t)fabs(ygood[ip]))%10000000-1; |
return ((Int_t)fabs(ygood[ip]))%10000000-1; |
1044 |
}; |
}; |
1045 |
|
|
1046 |
/** |
/** |
1047 |
* 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. |
1048 |
* If no ladder is traversed (dead area) the metod retuns -1. |
* If no ladder is traversed (dead area) the metod retuns -1. |
1049 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1050 |
*/ |
*/ |
1067 |
/** |
/** |
1068 |
* \brief Method to include a x-cluster to the track. |
* \brief Method to include a x-cluster to the track. |
1069 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1070 |
* @param clid Cluster ID (0,1,...) |
* @param clid Cluster ID (0 = no-cluster, 1,2,... otherwise ) |
1071 |
* @param is Sensor (0-1, increasing y) |
* @param il Ladder (0-2, increasing x, -1 if no sensitive area is hit) |
1072 |
|
* @param is Sensor (0-1, increasing y, -1 if no sensitive area is hit) |
1073 |
|
* @param bad True if the cluster contains bad strips |
1074 |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
1075 |
*/ |
*/ |
1076 |
void TrkTrack::SetXGood(int ip, int clid, int is){ |
void TrkTrack::SetXGood(int ip, int clid, int il, int is, bool bad){ |
1077 |
int il=0; //ladder (temporary) |
// int il=0; //ladder (temporary) |
1078 |
bool bad=false; //ladder (temporary) |
// bool bad=false; //ladder (temporary) |
1079 |
xgood[ip]=il*100000000+is*10000000+clid; |
if(ip<0||ip>5||clid<0||il<-1||il>2||is<-1||is>1) |
1080 |
|
cout << " void TrkTrack::SetXGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1081 |
|
xgood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1082 |
if(bad)xgood[ip]=-xgood[ip]; |
if(bad)xgood[ip]=-xgood[ip]; |
1083 |
}; |
}; |
1084 |
/** |
/** |
1085 |
* \brief Method to include a y-cluster to the track. |
* \brief Method to include a y-cluster to the track. |
1086 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1087 |
* @param clid Cluster ID (0,1,...) |
* @param clid Cluster ID (0 = no-cluster, 1,2,... otherwise ) |
1088 |
* @param is Sensor (0-1) |
* @param il Ladder (0-2, increasing x, -1 if no sensitive area is hit) |
1089 |
|
* @param is Sensor (0-1, increasing y, -1 if no sensitive area is hit) |
1090 |
|
* @param bad True if the cluster contains bad strips |
1091 |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
1092 |
*/ |
*/ |
1093 |
void TrkTrack::SetYGood(int ip, int clid, int is){ |
void TrkTrack::SetYGood(int ip, int clid, int il, int is, bool bad){ |
1094 |
int il=0; //ladder (temporary) |
// int il=0; //ladder (temporary) |
1095 |
bool bad=false; //ladder (temporary) |
// bool bad=false; //ladder (temporary) |
1096 |
ygood[ip]=il*100000000+is*10000000+clid; |
if(ip<0||ip>5||clid<0||il<-1||il>2||is<-1||is>1) |
1097 |
|
cout << " void TrkTrack::SetYGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1098 |
|
ygood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1099 |
if(bad)ygood[ip]=-ygood[ip]; |
if(bad)ygood[ip]=-ygood[ip]; |
1100 |
}; |
}; |
1101 |
|
|
1102 |
|
/** |
1103 |
|
* \brief Average X |
1104 |
|
* Average value of <xv>, evaluated from the first to the last hit x view. |
1105 |
|
*/ |
1106 |
|
Float_t TrkTrack::GetXav(){ |
1107 |
|
|
1108 |
|
int first_plane = -1; |
1109 |
|
int last_plane = -1; |
1110 |
|
for(Int_t ip=0; ip<6; ip++){ |
1111 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1112 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1113 |
|
} |
1114 |
|
if( first_plane == -1 || last_plane == -1){ |
1115 |
|
return -100; |
1116 |
|
} |
1117 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1118 |
|
|
1119 |
|
Float_t av = 0; |
1120 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=xv[ip]; |
1121 |
|
|
1122 |
|
return (av/(last_plane-first_plane+1)); |
1123 |
|
} |
1124 |
|
/** |
1125 |
|
* \brief Average Y |
1126 |
|
* Average value of <yv>, evaluated from the first to the last hit x view. |
1127 |
|
*/ |
1128 |
|
Float_t TrkTrack::GetYav(){ |
1129 |
|
|
1130 |
|
int first_plane = -1; |
1131 |
|
int last_plane = -1; |
1132 |
|
for(Int_t ip=0; ip<6; ip++){ |
1133 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1134 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1135 |
|
} |
1136 |
|
if( first_plane == -1 || last_plane == -1){ |
1137 |
|
return -100; |
1138 |
|
} |
1139 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1140 |
|
|
1141 |
|
Float_t av = 0; |
1142 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=yv[ip]; |
1143 |
|
|
1144 |
|
return (av/(last_plane-first_plane+1)); |
1145 |
|
} |
1146 |
|
/** |
1147 |
|
* \brief Average Z |
1148 |
|
* Average value of <zv>, evaluated from the first to the last hit x view. |
1149 |
|
*/ |
1150 |
|
Float_t TrkTrack::GetZav(){ |
1151 |
|
|
1152 |
|
int first_plane = -1; |
1153 |
|
int last_plane = -1; |
1154 |
|
for(Int_t ip=0; ip<6; ip++){ |
1155 |
|
if( XGood(ip) && first_plane == -1 )first_plane = ip; |
1156 |
|
if( XGood(ip) && first_plane != -1 )last_plane = ip; |
1157 |
|
} |
1158 |
|
if( first_plane == -1 || last_plane == -1){ |
1159 |
|
return -100; |
1160 |
|
} |
1161 |
|
if( last_plane-first_plane+1 ==0 )return -100; |
1162 |
|
|
1163 |
|
Float_t av = 0; |
1164 |
|
for(int ip=first_plane; ip<=last_plane; ip++)av+=zv[ip]; |
1165 |
|
|
1166 |
|
return (av/(last_plane-first_plane+1)); |
1167 |
|
} |
1168 |
|
|
1169 |
|
/** |
1170 |
|
* \brief Number of column traversed |
1171 |
|
*/ |
1172 |
|
Int_t TrkTrack::GetNColumns(){ |
1173 |
|
int sensors[] = {0,0,0,0,0,0}; |
1174 |
|
for(int ip=0; ip<6; ip++){ |
1175 |
|
int sensorid = GetLadder(ip)+3*GetSensor(ip); |
1176 |
|
if(XGood(ip)||YGood(ip)) |
1177 |
|
if(sensorid>=0 && sensorid<6)sensors[sensorid]=1; |
1178 |
|
} |
1179 |
|
int nsensors=0; |
1180 |
|
for(int is=0; is<6; is++)nsensors += sensors[is]; |
1181 |
|
return nsensors; |
1182 |
|
}; |
1183 |
|
/** |
1184 |
|
* \brief Give the maximum energy release |
1185 |
|
*/ |
1186 |
|
Float_t TrkTrack::GetDEDX_max(int ip, int iv){ |
1187 |
|
Float_t max=0; |
1188 |
|
int pfrom = 0; |
1189 |
|
int pto = 6; |
1190 |
|
int vfrom = 0; |
1191 |
|
int vto = 2; |
1192 |
|
if(ip>=0&&ip<6){ |
1193 |
|
pfrom = ip; |
1194 |
|
pto = ip+1; |
1195 |
|
} |
1196 |
|
if(iv>=0&&iv<2){ |
1197 |
|
vfrom = iv; |
1198 |
|
vto = iv+1; |
1199 |
|
} |
1200 |
|
for(int i=pfrom; i<pto; i++) |
1201 |
|
for(int j=vfrom; j<vto; j++){ |
1202 |
|
if(j==0 && XGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1203 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1204 |
|
} |
1205 |
|
return max; |
1206 |
|
|
1207 |
|
}; |
1208 |
|
|
1209 |
|
/** |
1210 |
|
* \brief Give the minimum energy release |
1211 |
|
*/ |
1212 |
|
Float_t TrkTrack::GetDEDX_min(int ip, int iv){ |
1213 |
|
Float_t min=100000000; |
1214 |
|
int pfrom = 0; |
1215 |
|
int pto = 6; |
1216 |
|
int vfrom = 0; |
1217 |
|
int vto = 2; |
1218 |
|
if(ip>=0&&ip<6){ |
1219 |
|
pfrom = ip; |
1220 |
|
pto = ip+1; |
1221 |
|
} |
1222 |
|
if(iv>=0&&iv<2){ |
1223 |
|
vfrom = iv; |
1224 |
|
vto = iv+1; |
1225 |
|
} |
1226 |
|
for(int i=pfrom; i<pto; i++) |
1227 |
|
for(int j=vfrom; j<vto; j++){ |
1228 |
|
if(j==0 && XGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1229 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1230 |
|
} |
1231 |
|
return min; |
1232 |
|
|
1233 |
|
}; |
1234 |
|
|
1235 |
|
/** |
1236 |
|
* \brief Give the maximum spatial residual |
1237 |
|
*/ |
1238 |
|
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
1239 |
|
Float_t max=0; |
1240 |
|
int pfrom = 0; |
1241 |
|
int pto = 6; |
1242 |
|
int vfrom = 0; |
1243 |
|
int vto = 2; |
1244 |
|
if(ip>=0&&ip<6){ |
1245 |
|
pfrom = ip; |
1246 |
|
pto = ip+1; |
1247 |
|
} |
1248 |
|
if(iv>=0&&iv<2){ |
1249 |
|
vfrom = iv; |
1250 |
|
vto = iv+1; |
1251 |
|
} |
1252 |
|
for(int i=pfrom; i<pto; i++){ |
1253 |
|
for(int j=vfrom; j<vto; j++){ |
1254 |
|
if(j==0 && XGood(i) && fabs(xm[i]-xv[i])>fabs(max))max=xm[i]-xv[i]; |
1255 |
|
if(j==1 && YGood(i) && fabs(ym[i]-yv[i])>fabs(max))max=ym[i]-yv[i]; |
1256 |
|
} |
1257 |
|
} |
1258 |
|
return max; |
1259 |
|
|
1260 |
|
}; |
1261 |
|
/** |
1262 |
|
* \brief Give the average spatial residual |
1263 |
|
*/ |
1264 |
|
Float_t TrkTrack::GetResidual_av(int ip, int iv){ |
1265 |
|
// |
1266 |
|
//Sum$((xm>-50)*(xm-xv)/resx)/sqrt(TrkTrack.GetNX()*TrkTrack.GetChi2X())<0.3 |
1267 |
|
|
1268 |
|
Float_t av = 0.; |
1269 |
|
int nav = 0; |
1270 |
|
// |
1271 |
|
int pfrom = 0; |
1272 |
|
int pto = 6; |
1273 |
|
int vfrom = 0; |
1274 |
|
int vto = 2; |
1275 |
|
if(ip>=0&&ip<6){ |
1276 |
|
pfrom = ip; |
1277 |
|
pto = ip+1; |
1278 |
|
} |
1279 |
|
if(iv>=0&&iv<2){ |
1280 |
|
vfrom = iv; |
1281 |
|
vto = iv+1; |
1282 |
|
} |
1283 |
|
for(int i=pfrom; i<pto; i++){ |
1284 |
|
for(int j=vfrom; j<vto; j++){ |
1285 |
|
nav++; |
1286 |
|
if(j==0 && XGood(i)) av += (xm[i]-xv[i])/resx[i]; |
1287 |
|
if(j==1 && YGood(i)) av += (ym[i]-yv[i])/resy[i]; |
1288 |
|
} |
1289 |
|
} |
1290 |
|
if(nav==0)return -100.; |
1291 |
|
return av/nav; |
1292 |
|
|
1293 |
|
}; |
1294 |
|
|
1295 |
|
|
1296 |
|
/** |
1297 |
|
* \brief Give the maximum multiplicity on the x view |
1298 |
|
*/ |
1299 |
|
Int_t TrkTrack::GetClusterX_Multiplicity_max(){ |
1300 |
|
int max=0; |
1301 |
|
for(int ip=0; ip<6; ip++) |
1302 |
|
if(GetClusterX_Multiplicity(ip)>max)max=GetClusterX_Multiplicity(ip); |
1303 |
|
return max; |
1304 |
|
}; |
1305 |
|
/** |
1306 |
|
* \brief Give the minimum multiplicity on the x view |
1307 |
|
*/ |
1308 |
|
Int_t TrkTrack::GetClusterX_Multiplicity_min(){ |
1309 |
|
int min=50; |
1310 |
|
for(int ip=0; ip<6; ip++) |
1311 |
|
if(GetClusterX_Multiplicity(ip)<min)min=GetClusterX_Multiplicity(ip); |
1312 |
|
return min; |
1313 |
|
}; |
1314 |
|
/** |
1315 |
|
* \brief Give the maximum multiplicity on the x view |
1316 |
|
*/ |
1317 |
|
Int_t TrkTrack::GetClusterY_Multiplicity_max(){ |
1318 |
|
int max=0; |
1319 |
|
for(int ip=0; ip<6; ip++) |
1320 |
|
if(GetClusterY_Multiplicity(ip)>max)max=GetClusterY_Multiplicity(ip); |
1321 |
|
return max; |
1322 |
|
}; |
1323 |
|
/** |
1324 |
|
* \brief Give the minimum multiplicity on the x view |
1325 |
|
*/ |
1326 |
|
Int_t TrkTrack::GetClusterY_Multiplicity_min(){ |
1327 |
|
int min=50; |
1328 |
|
for(int ip=0; ip<6; ip++) |
1329 |
|
if(GetClusterY_Multiplicity(ip)<min)min=GetClusterY_Multiplicity(ip); |
1330 |
|
return min; |
1331 |
|
}; |
1332 |
|
|
1333 |
|
/** |
1334 |
|
* \brief Give the minimum seed on the x view |
1335 |
|
*/ |
1336 |
|
Float_t TrkTrack::GetClusterX_Seed_min(){ |
1337 |
|
Float_t min=100000; |
1338 |
|
for(int ip=0; ip<6; ip++) |
1339 |
|
if(XGood(ip) && GetClusterX_Seed(ip)<min)min=GetClusterX_Seed(ip); |
1340 |
|
return min; |
1341 |
|
}; |
1342 |
|
/** |
1343 |
|
* \brief Give the minimum seed on the x view |
1344 |
|
*/ |
1345 |
|
Float_t TrkTrack::GetClusterY_Seed_min(){ |
1346 |
|
Float_t min=100000; |
1347 |
|
for(int ip=0; ip<6; ip++) |
1348 |
|
if(YGood(ip) && GetClusterY_Seed(ip)<min)min=GetClusterY_Seed(ip); |
1349 |
|
return min; |
1350 |
|
}; |
1351 |
|
|
1352 |
|
|
1353 |
//-------------------------------------- |
//-------------------------------------- |
1354 |
// |
// |
1355 |
// |
// |
1383 |
dedx_y[ip] = 0; |
dedx_y[ip] = 0; |
1384 |
|
|
1385 |
}; |
}; |
1386 |
|
int ngf = TrkParams::nGF; |
1387 |
|
for(int i=0; i<ngf; i++){ |
1388 |
|
xGF[i] = 0.; |
1389 |
|
yGF[i] = 0.; |
1390 |
|
} |
1391 |
// if(clx)clx->Clear(); |
// if(clx)clx->Clear(); |
1392 |
// if(cly)cly->Clear(); |
// if(cly)cly->Clear(); |
1393 |
// clx.Clear(); |
// clx.Clear(); |
1414 |
//-------------------------------------- |
//-------------------------------------- |
1415 |
TrkSinglet::TrkSinglet(){ |
TrkSinglet::TrkSinglet(){ |
1416 |
// cout << "TrkSinglet::TrkSinglet() " << GetUniqueID()<<endl; |
// cout << "TrkSinglet::TrkSinglet() " << GetUniqueID()<<endl; |
1417 |
plane = 0; |
// plane = 0; |
1418 |
coord[0] = 0; |
// coord[0] = 0; |
1419 |
coord[1] = 0; |
// coord[1] = 0; |
1420 |
sgnl = 0; |
// sgnl = 0; |
1421 |
|
// multmax = 0; |
1422 |
// cls = 0; |
// cls = 0; |
1423 |
|
Clear(); |
1424 |
}; |
}; |
1425 |
//-------------------------------------- |
//-------------------------------------- |
1426 |
// |
// |
1432 |
coord[0] = s.coord[0]; |
coord[0] = s.coord[0]; |
1433 |
coord[1] = s.coord[1]; |
coord[1] = s.coord[1]; |
1434 |
sgnl = s.sgnl; |
sgnl = s.sgnl; |
1435 |
|
multmax = s.multmax; |
1436 |
// cls = 0;//<<<<pointer |
// cls = 0;//<<<<pointer |
1437 |
// cls = TRef(s.cls); |
// cls = TRef(s.cls); |
1438 |
}; |
}; |
1443 |
void TrkSinglet::Dump(){ |
void TrkSinglet::Dump(){ |
1444 |
int i=0; |
int i=0; |
1445 |
cout << endl << "========== Singlet " ; |
cout << endl << "========== Singlet " ; |
1446 |
cout << endl << "plane : " << plane; |
cout << endl << "plane : " << plane; |
1447 |
cout << endl << "coord[2] : "; while( i<2 && cout << coord[i] << " ") i++; |
cout << endl << "coord[2] : "; while( i<2 && cout << coord[i] << " ") i++; |
1448 |
cout << endl << "sgnl : " << sgnl; |
cout << endl << "sgnl : " << sgnl; |
1449 |
|
cout << endl << "max.strip : "; |
1450 |
|
cout << endl << "multiplicity : "; |
1451 |
} |
} |
1452 |
//-------------------------------------- |
//-------------------------------------- |
1453 |
// |
// |
1460 |
coord[0]=-999; |
coord[0]=-999; |
1461 |
coord[1]=-999; |
coord[1]=-999; |
1462 |
sgnl=0; |
sgnl=0; |
1463 |
|
multmax = 0; |
1464 |
|
|
1465 |
} |
} |
1466 |
//-------------------------------------- |
//-------------------------------------- |
1496 |
|
|
1497 |
// |
// |
1498 |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
cout << endl << endl << "=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-"; |
1499 |
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; |
1500 |
cout << endl << "ntrk() : " << this->ntrk() ; |
cout << endl << "ntrk() : " << ntrk() ; |
1501 |
cout << endl << "nclsx() : " << this->nclsx(); |
cout << endl << "nclsx() : " << nclsx(); |
1502 |
cout << endl << "nclsy() : " << this->nclsy(); |
cout << endl << "nclsy() : " << nclsy(); |
1503 |
if(Track){ |
if(Track){ |
1504 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1505 |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
for(int i=0; i<ntrk(); i++) ((TrkTrack *)t[i])->Dump(); |
1506 |
} |
} |
1507 |
if(SingletX){ |
// if(SingletX){ |
1508 |
TClonesArray &sx = *SingletX; |
// TClonesArray &sx = *SingletX; |
1509 |
for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
// for(int i=0; i<nclsx(); i++) ((TrkSinglet *)sx[i])->Dump(); |
1510 |
} |
// } |
1511 |
if(SingletY){ |
// if(SingletY){ |
1512 |
TClonesArray &sy = *SingletY; |
// TClonesArray &sy = *SingletY; |
1513 |
for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
// for(int i=0; i<nclsy(); i++) ((TrkSinglet *)sy[i])->Dump(); |
1514 |
} |
// } |
1515 |
|
cout << endl; |
1516 |
} |
} |
1517 |
/** |
/** |
1518 |
* \brief Dump processing status |
* \brief Dump processing status |
1571 |
* forced (see TrkLevel2::GetVKMask(int,int)) or |
* forced (see TrkLevel2::GetVKMask(int,int)) or |
1572 |
* for this event only (TrkLevel2::GetVKFlag(int,int)). |
* for this event only (TrkLevel2::GetVKFlag(int,int)). |
1573 |
* @param iv Tracker view (0-11) |
* @param iv Tracker view (0-11) |
1574 |
* @param ivk Viking-chip number (0-23) |
* @param ivk Viking-chip number (0-23) |
1575 |
*/ |
*/ |
1576 |
Bool_t TrkLevel2::IsMaskedVK(int iv, int ivk){ |
Bool_t TrkLevel2::IsMaskedVK(int iv, int ivk){ |
1577 |
return !(GetVKMask(iv,ivk)&&GetVKFlag(iv,ivk) ); |
return !(GetVKMask(iv,ivk)&&GetVKFlag(iv,ivk) ); |
1656 |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
t_track->ayv[ip] = l2->ayv_nt[i][ip]; |
1657 |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
t_track->dedx_x[ip] = l2->dedx_x[i][ip]; |
1658 |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
t_track->dedx_y[ip] = l2->dedx_y[i][ip]; |
1659 |
|
t_track->multmaxx[ip] = l2->multmaxx[i][ip]; |
1660 |
|
t_track->multmaxy[ip] = l2->multmaxy[i][ip]; |
1661 |
|
t_track->seedx[ip] = l2->seedx[i][ip]; |
1662 |
|
t_track->seedy[ip] = l2->seedy[i][ip]; |
1663 |
|
t_track->xpu[ip] = l2->xpu[i][ip]; |
1664 |
|
t_track->ypu[ip] = l2->ypu[i][ip]; |
1665 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1666 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1667 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1668 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1669 |
}; |
}; |
1670 |
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
1671 |
|
// evaluated coordinates (to define GF) |
1672 |
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |
1673 |
|
int ngf = TrkParams::nGF; |
1674 |
|
float *zgf = TrkParams::zGF; |
1675 |
|
Trajectory tgf = Trajectory(ngf,zgf); |
1676 |
|
tgf.DoTrack2(t_track->al);//<<<< integrate the trajectory |
1677 |
|
for(int ip=0; ip<ngf; ip++){ |
1678 |
|
t_track->xGF[ip] = tgf.x[ip]; |
1679 |
|
t_track->yGF[ip] = tgf.y[ip]; |
1680 |
|
} |
1681 |
|
|
1682 |
// if(t_track->IsSaturated())t_track->Dump(); |
// if(t_track->IsSaturated())t_track->Dump(); |
1683 |
new(t[i]) TrkTrack(*t_track); |
new(t[i]) TrkTrack(*t_track); |
1684 |
t_track->Clear(); |
t_track->Clear(); |
1685 |
}; |
};//end loop over track |
1686 |
|
|
1687 |
// ---------------- |
// ---------------- |
1688 |
// *** SINGLETS *** |
// *** SINGLETS *** |
1694 |
t_singlet->coord[0] = l2->xs[i][0]; |
t_singlet->coord[0] = l2->xs[i][0]; |
1695 |
t_singlet->coord[1] = l2->xs[i][1]; |
t_singlet->coord[1] = l2->xs[i][1]; |
1696 |
t_singlet->sgnl = l2->signlxs[i]; |
t_singlet->sgnl = l2->signlxs[i]; |
1697 |
|
t_singlet->multmax = l2->multmaxsx[i]; |
1698 |
|
if(l2->sxbad[i]>0) t_singlet->multmax = -1*t_singlet->multmax; |
1699 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1700 |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsx[i]-1); |
1701 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1709 |
t_singlet->coord[0] = l2->ys[i][0]; |
t_singlet->coord[0] = l2->ys[i][0]; |
1710 |
t_singlet->coord[1] = l2->ys[i][1]; |
t_singlet->coord[1] = l2->ys[i][1]; |
1711 |
t_singlet->sgnl = l2->signlys[i]; |
t_singlet->sgnl = l2->signlys[i]; |
1712 |
|
t_singlet->multmax = l2->multmaxsy[i]; |
1713 |
|
if(l2->sybad[i]>0) t_singlet->multmax = -1*t_singlet->multmax; |
1714 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1715 |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
// if(l1) t_singlet->cls = l1->GetCluster(l2->clsy[i]-1); |
1716 |
//----------------------------------------------------- |
//----------------------------------------------------- |
1717 |
new(sy[i]) TrkSinglet(*t_singlet); |
new(sy[i]) TrkSinglet(*t_singlet); |
1718 |
t_singlet->Clear(); |
t_singlet->Clear(); |
1719 |
}; |
}; |
1720 |
|
|
1721 |
|
|
1722 |
|
|
1723 |
delete t_track; |
delete t_track; |
1724 |
delete t_singlet; |
delete t_singlet; |
1894 |
TrkTrack *TrkLevel2::GetStoredTrack(int is){ |
TrkTrack *TrkLevel2::GetStoredTrack(int is){ |
1895 |
|
|
1896 |
if(is >= this->ntrk()){ |
if(is >= this->ntrk()){ |
1897 |
cout << "** TrkLevel2 ** Track "<< is << "doen not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetStoredTrack(int) >> Track "<< is << "doen not exits! " << endl; |
1898 |
cout << " Stored tracks ntrk() = "<< this->ntrk() << endl; |
cout << "Stored tracks ntrk() = "<< this->ntrk() << endl; |
1899 |
return 0; |
return 0; |
1900 |
} |
} |
1901 |
if(!Track){ |
if(!Track){ |
1916 |
TrkSinglet *TrkLevel2::GetSingletX(int is){ |
TrkSinglet *TrkLevel2::GetSingletX(int is){ |
1917 |
|
|
1918 |
if(is >= this->nclsx()){ |
if(is >= this->nclsx()){ |
1919 |
cout << "** TrkLevel2 ** Singlet "<< is << "doen not exits! " << endl; |
cout << "TrkSinglet *TrkLevel2::GetSingletX(int) >> Singlet "<< is << "doen not exits! " << endl; |
1920 |
cout << " Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
cout << "Stored x-singlets nclsx() = "<< this->nclsx() << endl; |
1921 |
return 0; |
return 0; |
1922 |
} |
} |
1923 |
if(!SingletX)return 0; |
if(!SingletX)return 0; |
1936 |
TrkSinglet *TrkLevel2::GetSingletY(int is){ |
TrkSinglet *TrkLevel2::GetSingletY(int is){ |
1937 |
|
|
1938 |
if(is >= this->nclsy()){ |
if(is >= this->nclsy()){ |
1939 |
cout << "** TrkLevel2 ** Singlet "<< is << "doen not exits! " << endl; |
cout << "TrkSinglet *TrkLevel2::GetSingletY(int) >> Singlet "<< is << "doen not exits! " << endl; |
1940 |
cout << " Stored y-singlets nclsy() = "<< this->nclsx() << endl; |
cout << "Stored y-singlets nclsx() = "<< this->nclsx() << endl; |
1941 |
return 0; |
return 0; |
1942 |
} |
} |
1943 |
if(!SingletY)return 0; |
if(!SingletY)return 0; |
1957 |
TrkTrack *TrkLevel2::GetTrack(int it){ |
TrkTrack *TrkLevel2::GetTrack(int it){ |
1958 |
|
|
1959 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
1960 |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrack(int) >> Track "<< it << "does not exits! " << endl; |
1961 |
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
cout << "Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
1962 |
return 0; |
return 0; |
1963 |
} |
} |
1964 |
|
|
1995 |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
TrkTrack *TrkLevel2::GetTrackImage(int it){ |
1996 |
|
|
1997 |
if(it >= this->GetNTracks()){ |
if(it >= this->GetNTracks()){ |
1998 |
cout << "** TrkLevel2 ** Track "<< it << "does not exits! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrackImage(int) >> Track "<< it << "does not exits! " << endl; |
1999 |
cout << " Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
cout << "Physical tracks GetNTracks() = "<< this->ntrk() << endl; |
2000 |
return 0; |
return 0; |
2001 |
} |
} |
2002 |
|
|
2005 |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
TrkTrack *track = (TrkTrack*)sorted->At(it); |
2006 |
|
|
2007 |
if(!track->HasImage()){ |
if(!track->HasImage()){ |
2008 |
cout << "** TrkLevel2 ** Track "<< it << "does not have image! " << endl; |
cout << "TrkTrack *TrkLevel2::GetTrackImage(int) >> Track "<< it << "does not have image! " << endl; |
2009 |
return 0; |
return 0; |
2010 |
} |
} |
2011 |
if(!Track)return 0; |
if(!Track)return 0; |
2032 |
// path_.error = 0; |
// path_.error = 0; |
2033 |
// readb_(); |
// readb_(); |
2034 |
|
|
2035 |
TrkParams::SetTrackingMode(); |
// TrkParams::SetTrackingMode(); |
2036 |
TrkParams::SetPrecisionFactor(); |
// TrkParams::SetPrecisionFactor(); |
2037 |
TrkParams::SetStepMin(); |
// TrkParams::SetStepMin(); |
2038 |
|
TrkParams::SetMiniDefault(); |
2039 |
|
|
2040 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
2041 |
TrkParams::Load(1); |
TrkParams::Load(1); |
2042 |
|
if( !TrkParams::IsLoaded(1) ){ |
2043 |
|
cout << "void TrkLevel2::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
2044 |
|
} |
2045 |
|
|
2046 |
// |
// |
2047 |
}; |
}; |
2236 |
*/ |
*/ |
2237 |
int Trajectory::DoTrack2(float* al){ |
int Trajectory::DoTrack2(float* al){ |
2238 |
|
|
2239 |
double *dxout = new double[npoint]; |
// double *dxout = new double[npoint]; |
2240 |
double *dyout = new double[npoint]; |
// double *dyout = new double[npoint]; |
2241 |
double *dthxout = new double[npoint]; |
// double *dthxout = new double[npoint]; |
2242 |
double *dthyout = new double[npoint]; |
// double *dthyout = new double[npoint]; |
2243 |
double *dtlout = new double[npoint]; |
// double *dtlout = new double[npoint]; |
2244 |
double *dzin = new double[npoint]; |
// double *dzin = new double[npoint]; |
2245 |
double dal[5]; |
|
2246 |
|
double *dxout; |
2247 |
|
double *dyout; |
2248 |
|
double *dthxout; |
2249 |
|
double *dthyout; |
2250 |
|
double *dtlout; |
2251 |
|
double *dzin; |
2252 |
|
|
2253 |
|
dxout = (double*) malloc(npoint*sizeof(double)); |
2254 |
|
dyout = (double*) malloc(npoint*sizeof(double)); |
2255 |
|
dthxout = (double*) malloc(npoint*sizeof(double)); |
2256 |
|
dthyout = (double*) malloc(npoint*sizeof(double)); |
2257 |
|
dtlout = (double*) malloc(npoint*sizeof(double)); |
2258 |
|
dzin = (double*) malloc(npoint*sizeof(double)); |
2259 |
|
|
2260 |
|
double dal[5]; |
2261 |
|
|
2262 |
int ifail = 0; |
int ifail = 0; |
2263 |
|
|
2272 |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
2273 |
|
|
2274 |
for (int i=0; i<npoint; i++){ |
for (int i=0; i<npoint; i++){ |
2275 |
x[i] = (float)*dxout++; |
x[i] = (float)*(dxout+i); |
2276 |
y[i] = (float)*dyout++; |
y[i] = (float)*(dyout+i); |
2277 |
thx[i] = (float)*dthxout++; |
thx[i] = (float)*(dthxout+i); |
2278 |
thy[i] = (float)*dthyout++; |
thy[i] = (float)*(dthyout+i); |
2279 |
tl[i] = (float)*dtlout++; |
tl[i] = (float)*(dtlout+i); |
2280 |
} |
} |
2281 |
|
|
2282 |
|
if(dxout) free( dxout ); |
2283 |
|
if(dyout) free( dyout ); |
2284 |
|
if(dthxout)free( dthxout ); |
2285 |
|
if(dthyout)free( dthyout ); |
2286 |
|
if(dtlout) free( dtlout ); |
2287 |
|
if(dzin) free( dzin ); |
2288 |
|
|
2289 |
|
// delete [] dxout; |
2290 |
|
// delete [] dyout; |
2291 |
|
// delete [] dthxout; |
2292 |
|
// delete [] dthyout; |
2293 |
|
// delete [] dtlout; |
2294 |
|
// delete [] dzin; |
2295 |
|
|
2296 |
|
|
2297 |
return ifail; |
return ifail; |
2298 |
}; |
}; |