| 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 |
}; |
}; |
| 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]; |
| 801 |
|
|
| 802 |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
| 803 |
|
|
| 804 |
TrkParams::Load( ); |
bool OK=true; |
| 805 |
if( !TrkParams::IsLoaded() )return false; |
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 |
|
|
| 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; |
| 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); |
| 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 |
|
|
| 1198 |
vto = iv+1; |
vto = iv+1; |
| 1199 |
} |
} |
| 1200 |
for(int i=pfrom; i<pto; i++) |
for(int i=pfrom; i<pto; i++) |
| 1201 |
for(int j=0; j<vto; j++) |
for(int j=vfrom; j<vto; j++){ |
| 1202 |
if(GetDEDX(i,j)>max)max=GetDEDX(i,j); |
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; |
return max; |
| 1206 |
|
|
| 1207 |
}; |
}; |
| 1224 |
vto = iv+1; |
vto = iv+1; |
| 1225 |
} |
} |
| 1226 |
for(int i=pfrom; i<pto; i++) |
for(int i=pfrom; i<pto; i++) |
| 1227 |
for(int j=0; j<vto; j++) |
for(int j=vfrom; j<vto; j++){ |
| 1228 |
if(GetDEDX(i,j)<min)min=GetDEDX(i,j); |
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; |
return min; |
| 1232 |
|
|
| 1233 |
}; |
}; |
| 1234 |
|
|
| 1235 |
/** |
/** |
| 1236 |
* \brief Give the maximum spatial residual release |
* \brief Give the maximum spatial residual |
| 1237 |
*/ |
*/ |
| 1238 |
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
| 1239 |
Float_t max=0; |
Float_t max=0; |
| 1250 |
vto = iv+1; |
vto = iv+1; |
| 1251 |
} |
} |
| 1252 |
for(int i=pfrom; i<pto; i++){ |
for(int i=pfrom; i<pto; i++){ |
| 1253 |
for(int j=0; j<vto; j++){ |
for(int j=vfrom; j<vto; j++){ |
| 1254 |
if(j==0 && XGood(i) && fabs(xm[i]-xv[i])>fabs(max))max=xv[i]-xm[i]; |
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=yv[i]-ym[i]; |
if(j==1 && YGood(i) && fabs(ym[i]-yv[i])>fabs(max))max=ym[i]-yv[i]; |
| 1256 |
} |
} |
| 1257 |
} |
} |
| 1258 |
return max; |
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 |
/** |
/** |
| 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 |
}; |
}; |