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 |
}; |
}; |
400 |
return (last_plane-first_plane+1); |
return (last_plane-first_plane+1); |
401 |
} |
} |
402 |
/** |
/** |
403 |
|
* Returns the track "lever-arm" on the x+y view, defined as the distance (in planes) between |
404 |
|
* the upper and lower x,y (couple) measurements (the maximum value of lever-arm is 6). |
405 |
|
*/ |
406 |
|
Int_t TrkTrack::GetLeverArmXY(){ |
407 |
|
int first_plane = -1; |
408 |
|
int last_plane = -1; |
409 |
|
for(Int_t ip=0; ip<6; ip++){ |
410 |
|
if( XGood(ip)*YGood(ip) && first_plane == -1 )first_plane = ip; |
411 |
|
if( XGood(ip)*YGood(ip) && first_plane != -1 )last_plane = ip; |
412 |
|
} |
413 |
|
if( first_plane == -1 || last_plane == -1){ |
414 |
|
cout<< "Int_t TrkTrack::GetLeverArmXY() -- XGood(ip)*YGood(ip) always false ??? "<<endl; |
415 |
|
return 0; |
416 |
|
} |
417 |
|
return (last_plane-first_plane+1); |
418 |
|
} |
419 |
|
/** |
420 |
* Returns the reduced chi-square of track x-projection |
* Returns the reduced chi-square of track x-projection |
421 |
*/ |
*/ |
422 |
Float_t TrkTrack::GetChi2X(){ |
Float_t TrkTrack::GetChi2X(){ |
627 |
4.52043, |
4.52043, |
628 |
4.29926}; |
4.29926}; |
629 |
int index; |
int index; |
630 |
float fact; |
float fact=0.; |
631 |
for(int i=0; i<6; i++) { |
for(int i=0; i<6; i++) { |
632 |
index = int((fabs(axv[i])+1.)/2.); |
index = int((fabs(axv[i])+1.)/2.); |
633 |
if(index>10) index=10; |
if(index>10) index=10; |
674 |
|
|
675 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
676 |
TrkParams::Load(1); |
TrkParams::Load(1); |
677 |
|
if( !TrkParams::IsLoaded(1) ){ |
678 |
|
cout << "void TrkTrack::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
679 |
|
} |
680 |
|
|
681 |
}; |
}; |
682 |
|
|
698 |
track.zm[i]=zm[i]; |
track.zm[i]=zm[i]; |
699 |
|
|
700 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
701 |
// andrebbe inserita la dimensione del sensore |
// float segment = 100.; |
702 |
float segment = 100.; |
// track.xm_a[i]=xm[i]; |
703 |
track.xm_a[i]=xm[i]; |
// track.xm_b[i]=xm[i]; |
704 |
track.xm_b[i]=xm[i]; |
// track.ym_a[i]=ym[i]; |
705 |
track.ym_a[i]=ym[i]; |
// track.ym_b[i]=ym[i]; |
706 |
track.ym_b[i]=ym[i]; |
// if( XGood(i) && !YGood(i) ){ |
707 |
if( XGood(i) && !YGood(i) ){ |
// track.ym_a[i] = track.ym_a[i]+segment; |
708 |
track.ym_a[i] = track.ym_a[i]+segment; |
// track.ym_b[i] = track.ym_b[i]-segment; |
709 |
track.ym_b[i] = track.ym_b[i]-segment; |
// }else if( !XGood(i) && YGood(i)){ |
710 |
}else if( !XGood(i) && YGood(i)){ |
// track.xm_a[i] = track.xm_a[i]+segment; |
711 |
track.xm_a[i] = track.xm_a[i]+segment; |
// track.xm_b[i] = track.xm_b[i]-segment; |
712 |
track.xm_b[i] = track.xm_b[i]-segment; |
// } |
|
} |
|
713 |
// --- temporaneo ---------------------------- |
// --- temporaneo ---------------------------- |
714 |
|
|
715 |
|
if( XGood(i) || YGood(i) ){ |
716 |
|
double segment = 2.;//cm |
717 |
|
// NB: i parametri di allineamento hanno una notazione particolare!!! |
718 |
|
// sensor = 0 (hybrid side), 1 |
719 |
|
// ladder = 0-2 (increasing x) |
720 |
|
// plane = 0-5 (from bottom to top!!!) |
721 |
|
int is = (int)GetSensor(i); if(i==5)is=1-is; |
722 |
|
int ip = 5-i; |
723 |
|
int il = (int)GetLadder(i); |
724 |
|
|
725 |
|
double omega = 0.; |
726 |
|
double beta = 0.; |
727 |
|
double gamma = 0.; |
728 |
|
if( |
729 |
|
(is < 0 || is > 1 || ip < 0 || ip > 5 || il < 0 || il > 2) && |
730 |
|
true){ |
731 |
|
// se il piano risulta colpito, ladder e sensore devono essere |
732 |
|
// assegnati correttamente |
733 |
|
cout << " void TrkTrack::FillMiniStruct(cMini2track&) --- WARNING --- sensor not defined, cannot read alignment parameters "<<endl; |
734 |
|
cout << " is ip il = "<<is<<" "<<ip<<" "<<il<<endl; |
735 |
|
}else{ |
736 |
|
omega = alignparameters_.omega[is][il][ip]; |
737 |
|
beta = alignparameters_.beta[is][il][ip]; |
738 |
|
gamma = alignparameters_.gamma[is][il][ip]; |
739 |
|
} |
740 |
|
|
741 |
|
if( XGood(i) && !YGood(i) ){ |
742 |
|
track.xm_a[i] = xm[i] - omega * segment; |
743 |
|
track.ym_a[i] = ym[i] + segment; |
744 |
|
// track.zm_a[i] = zm[i] + beta * segment;//not used yet |
745 |
|
track.xm_b[i] = xm[i] + omega * segment; |
746 |
|
track.ym_b[i] = ym[i] - segment; |
747 |
|
// track.zm_b[i] = zm[i] - beta * segment;//not used yet |
748 |
|
}else if( !XGood(i) && YGood(i) ){ |
749 |
|
track.xm_a[i] = xm[i] + segment; |
750 |
|
track.ym_a[i] = ym[i] + omega * segment; |
751 |
|
// track.zm_a[i] = zm[i] - gamma * segment;//not used yet |
752 |
|
track.xm_b[i] = xm[i] - segment; |
753 |
|
track.ym_b[i] = ym[i] - omega * segment; |
754 |
|
// track.zm_b[i] = zm[i] + gamma * segment;//not used yet |
755 |
|
} |
756 |
|
} |
757 |
|
|
758 |
track.resx[i]=resx[i]; |
track.resx[i]=resx[i]; |
759 |
track.resy[i]=resy[i]; |
track.resy[i]=resy[i]; |
760 |
track.tailx[i]=tailx[i]; |
track.tailx[i]=tailx[i]; |
761 |
track.taily[i]=taily[i]; |
track.taily[i]=taily[i]; |
818 |
|
|
819 |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
// cout << "void TrkTrack::GetClusterositions() "<<endl; |
820 |
|
|
821 |
TrkParams::Load( ); |
bool OK=true; |
822 |
if( !TrkParams::IsLoaded() )return false; |
TrkParams::Load(1); if( !TrkParams::IsLoaded(1) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- m.field not loaded "<<endl; |
823 |
|
TrkParams::Load(4); if( !TrkParams::IsLoaded(4) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- p.f.a. par. not loaded "<<endl; |
824 |
|
TrkParams::Load(5); if( !TrkParams::IsLoaded(5) )cout << "Bool_t TrkTrack::EvaluateClusterPositions() ---ERROR--- alignment par. not loaded "<<endl; |
825 |
|
if(!OK)return false; |
826 |
|
|
827 |
for(int ip=0; ip<6; ip++){ |
for(int ip=0; ip<6; ip++){ |
828 |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
// cout << ip<<" ** "<<xm[ip]<<" / "<<ym[ip]<<endl;; |
829 |
int icx = GetClusterX_ID(ip)+1; |
int icx = GetClusterX_ID(ip)+1; |
875 |
*/ |
*/ |
876 |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
void TrkTrack::Fit(double pfixed, int& fail, int iprint, int froml1){ |
877 |
|
|
878 |
float al_ini[] = {0.,0.,0.,0.,0.}; |
bool OK=true; |
879 |
|
TrkParams::Load(1); if( !TrkParams::IsLoaded(1) )cout << "void TrkTrack::Fit(double,int&,int,int) ---ERROR--- m.field not loaded "<<endl; |
880 |
|
if(!OK)return; |
881 |
|
|
882 |
TrkParams::Load( ); |
float al_ini[] = {0.,0.,0.,0.,0.}; |
|
if( !TrkParams::IsLoaded() )return; |
|
883 |
|
|
884 |
extern cMini2track track_; |
extern cMini2track track_; |
885 |
fail = 0; |
fail = 0; |
915 |
|
|
916 |
// ------------------------------------------ |
// ------------------------------------------ |
917 |
// call mini routine |
// call mini routine |
918 |
// TrkParams::Load(1); |
// ------------------------------------------ |
|
// if( !TrkParams::IsLoaded(1) ){ |
|
|
// cout << "void TrkTrack::Fit(double pfixed, int& fail, int iprint) --- ERROR --- m.field not loaded"<<endl; |
|
|
// return; |
|
|
// } |
|
919 |
int istep=0; |
int istep=0; |
920 |
int ifail=0; |
int ifail=0; |
921 |
mini2_(&istep,&ifail, &iprint); |
mini2_(&istep,&ifail, &iprint); |
1061 |
}; |
}; |
1062 |
|
|
1063 |
/** |
/** |
1064 |
* 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. |
1065 |
* If no ladder is traversed (dead area) the metod retuns -1. |
* If no ladder is traversed (dead area) the metod retuns -1. |
1066 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1067 |
*/ |
*/ |
1084 |
/** |
/** |
1085 |
* \brief Method to include a x-cluster to the track. |
* \brief Method to include a x-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, increasing y) |
* @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::SetXGood(int ip, int clid, int is){ |
void TrkTrack::SetXGood(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 |
xgood[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::SetXGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1098 |
|
xgood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1099 |
if(bad)xgood[ip]=-xgood[ip]; |
if(bad)xgood[ip]=-xgood[ip]; |
1100 |
}; |
}; |
1101 |
/** |
/** |
1102 |
* \brief Method to include a y-cluster to the track. |
* \brief Method to include a y-cluster to the track. |
1103 |
* @param ip Tracker plane (0-5) |
* @param ip Tracker plane (0-5) |
1104 |
* @param clid Cluster ID (0,1,...) |
* @param clid Cluster ID (0 = no-cluster, 1,2,... otherwise ) |
1105 |
* @param is Sensor (0-1) |
* @param il Ladder (0-2, increasing x, -1 if no sensitive area is hit) |
1106 |
|
* @param is Sensor (0-1, increasing y, -1 if no sensitive area is hit) |
1107 |
|
* @param bad True if the cluster contains bad strips |
1108 |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
* @see Fit(double pfixed, int& fail, int iprint, int froml1) |
1109 |
*/ |
*/ |
1110 |
void TrkTrack::SetYGood(int ip, int clid, int is){ |
void TrkTrack::SetYGood(int ip, int clid, int il, int is, bool bad){ |
1111 |
int il=0; //ladder (temporary) |
// int il=0; //ladder (temporary) |
1112 |
bool bad=false; //ladder (temporary) |
// bool bad=false; //ladder (temporary) |
1113 |
ygood[ip]=il*100000000+is*10000000+clid; |
if(ip<0||ip>5||clid<0||il<-1||il>2||is<-1||is>1) |
1114 |
|
cout << " void TrkTrack::SetYGood(int,int,int,int,bool) --> MA SEI DI COCCIO?!?!"<<endl; |
1115 |
|
ygood[ip]=(il+1)*100000000+(is+1)*10000000+clid; |
1116 |
if(bad)ygood[ip]=-ygood[ip]; |
if(bad)ygood[ip]=-ygood[ip]; |
1117 |
}; |
}; |
1118 |
|
|
1215 |
vto = iv+1; |
vto = iv+1; |
1216 |
} |
} |
1217 |
for(int i=pfrom; i<pto; i++) |
for(int i=pfrom; i<pto; i++) |
1218 |
for(int j=0; j<vto; j++) |
for(int j=vfrom; j<vto; j++){ |
1219 |
if(GetDEDX(i,j)>max)max=GetDEDX(i,j); |
if(j==0 && XGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1220 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)>max)max=GetDEDX(i,j); |
1221 |
|
} |
1222 |
return max; |
return max; |
1223 |
|
|
1224 |
}; |
}; |
1241 |
vto = iv+1; |
vto = iv+1; |
1242 |
} |
} |
1243 |
for(int i=pfrom; i<pto; i++) |
for(int i=pfrom; i<pto; i++) |
1244 |
for(int j=0; j<vto; j++) |
for(int j=vfrom; j<vto; j++){ |
1245 |
if(GetDEDX(i,j)<min)min=GetDEDX(i,j); |
if(j==0 && XGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1246 |
|
if(j==1 && YGood(i) && GetDEDX(i,j)<min)min=GetDEDX(i,j); |
1247 |
|
} |
1248 |
return min; |
return min; |
1249 |
|
|
1250 |
}; |
}; |
1251 |
|
|
1252 |
/** |
/** |
1253 |
* \brief Give the maximum spatial residual release |
* \brief Give the maximum spatial residual |
1254 |
*/ |
*/ |
1255 |
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
Float_t TrkTrack::GetResidual_max(int ip, int iv){ |
1256 |
Float_t max=0; |
Float_t max=0; |
1267 |
vto = iv+1; |
vto = iv+1; |
1268 |
} |
} |
1269 |
for(int i=pfrom; i<pto; i++){ |
for(int i=pfrom; i<pto; i++){ |
1270 |
for(int j=0; j<vto; j++){ |
for(int j=vfrom; j<vto; j++){ |
1271 |
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]; |
1272 |
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]; |
1273 |
} |
} |
1274 |
} |
} |
1275 |
return max; |
return max; |
1276 |
|
|
1277 |
}; |
}; |
1278 |
|
/** |
1279 |
|
* \brief Give the anerage spatial residual |
1280 |
|
*/ |
1281 |
|
Float_t TrkTrack::GetResidual_av(int ip, int iv){ |
1282 |
|
// |
1283 |
|
//Sum$((xm>-50)*(xm-xv)/resx)/sqrt(TrkTrack.GetNX()*TrkTrack.GetChi2X())<0.3 |
1284 |
|
|
1285 |
|
Float_t av = 0.; |
1286 |
|
int nav = 0; |
1287 |
|
// |
1288 |
|
int pfrom = 0; |
1289 |
|
int pto = 6; |
1290 |
|
int vfrom = 0; |
1291 |
|
int vto = 2; |
1292 |
|
if(ip>=0&&ip<6){ |
1293 |
|
pfrom = ip; |
1294 |
|
pto = ip+1; |
1295 |
|
} |
1296 |
|
if(iv>=0&&iv<2){ |
1297 |
|
vfrom = iv; |
1298 |
|
vto = iv+1; |
1299 |
|
} |
1300 |
|
for(int i=pfrom; i<pto; i++){ |
1301 |
|
for(int j=vfrom; j<vto; j++){ |
1302 |
|
nav++; |
1303 |
|
if(j==0 && XGood(i)) av += (xm[i]-xv[i])/resx[i]; |
1304 |
|
if(j==1 && YGood(i)) av += (ym[i]-yv[i])/resy[i]; |
1305 |
|
} |
1306 |
|
} |
1307 |
|
if(nav==0)return -100.; |
1308 |
|
return av/nav; |
1309 |
|
|
1310 |
|
}; |
1311 |
|
|
1312 |
|
|
1313 |
/** |
/** |
1848 |
|
|
1849 |
if(!Track)return 0; |
if(!Track)return 0; |
1850 |
|
|
1851 |
TRefArray *sorted = new TRefArray(); |
// TRefArray *sorted = new TRefArray(); |
1852 |
|
TRefArray *sorted = NULL; |
1853 |
|
|
1854 |
TClonesArray &t = *Track; |
TClonesArray &t = *Track; |
1855 |
// TClonesArray &ts = *PhysicalTrack; |
// TClonesArray &ts = *PhysicalTrack; |
1887 |
|
|
1888 |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
// cout << "i** "<< ((TrkTrack *)t[indi])->image << " " << nfiti <<" "<<chi2i<<endl; |
1889 |
}; |
}; |
1890 |
|
if(!sorted)sorted = new TRefArray( TProcessID::GetProcessWithUID(t[indi])); |
1891 |
sorted->Add( (TrkTrack*)t[indi] ); |
sorted->Add( (TrkTrack*)t[indi] ); |
1892 |
|
|
1893 |
m[indi] = 0; |
m[indi] = 0; |
2058 |
|
|
2059 |
TrkParams::Set(path,1); |
TrkParams::Set(path,1); |
2060 |
TrkParams::Load(1); |
TrkParams::Load(1); |
2061 |
|
if( !TrkParams::IsLoaded(1) ){ |
2062 |
|
cout << "void TrkLevel2::LoadField(TString path) --- ERROR --- m.field not loaded"<<endl; |
2063 |
|
} |
2064 |
|
|
2065 |
// |
// |
2066 |
}; |
}; |
2255 |
*/ |
*/ |
2256 |
int Trajectory::DoTrack2(float* al){ |
int Trajectory::DoTrack2(float* al){ |
2257 |
|
|
2258 |
double *dxout = new double[npoint]; |
// double *dxout = new double[npoint]; |
2259 |
double *dyout = new double[npoint]; |
// double *dyout = new double[npoint]; |
2260 |
double *dthxout = new double[npoint]; |
// double *dthxout = new double[npoint]; |
2261 |
double *dthyout = new double[npoint]; |
// double *dthyout = new double[npoint]; |
2262 |
double *dtlout = new double[npoint]; |
// double *dtlout = new double[npoint]; |
2263 |
double *dzin = new double[npoint]; |
// double *dzin = new double[npoint]; |
2264 |
double dal[5]; |
|
2265 |
|
double *dxout; |
2266 |
|
double *dyout; |
2267 |
|
double *dthxout; |
2268 |
|
double *dthyout; |
2269 |
|
double *dtlout; |
2270 |
|
double *dzin; |
2271 |
|
|
2272 |
|
dxout = (double*) malloc(npoint*sizeof(double)); |
2273 |
|
dyout = (double*) malloc(npoint*sizeof(double)); |
2274 |
|
dthxout = (double*) malloc(npoint*sizeof(double)); |
2275 |
|
dthyout = (double*) malloc(npoint*sizeof(double)); |
2276 |
|
dtlout = (double*) malloc(npoint*sizeof(double)); |
2277 |
|
dzin = (double*) malloc(npoint*sizeof(double)); |
2278 |
|
|
2279 |
|
double dal[5]; |
2280 |
|
|
2281 |
int ifail = 0; |
int ifail = 0; |
2282 |
|
|
2291 |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
dotrack2_(&(npoint),dzin,dxout,dyout,dthxout,dthyout,dtlout,dal,&ifail); |
2292 |
|
|
2293 |
for (int i=0; i<npoint; i++){ |
for (int i=0; i<npoint; i++){ |
2294 |
x[i] = (float)*dxout++; |
x[i] = (float)*(dxout+i); |
2295 |
y[i] = (float)*dyout++; |
y[i] = (float)*(dyout+i); |
2296 |
thx[i] = (float)*dthxout++; |
thx[i] = (float)*(dthxout+i); |
2297 |
thy[i] = (float)*dthyout++; |
thy[i] = (float)*(dthyout+i); |
2298 |
tl[i] = (float)*dtlout++; |
tl[i] = (float)*(dtlout+i); |
2299 |
} |
} |
2300 |
|
|
2301 |
|
if(dxout) free( dxout ); |
2302 |
|
if(dyout) free( dyout ); |
2303 |
|
if(dthxout)free( dthxout ); |
2304 |
|
if(dthyout)free( dthyout ); |
2305 |
|
if(dtlout) free( dtlout ); |
2306 |
|
if(dzin) free( dzin ); |
2307 |
|
|
2308 |
|
// delete [] dxout; |
2309 |
|
// delete [] dyout; |
2310 |
|
// delete [] dthxout; |
2311 |
|
// delete [] dthyout; |
2312 |
|
// delete [] dtlout; |
2313 |
|
// delete [] dzin; |
2314 |
|
|
2315 |
|
|
2316 |
return ifail; |
return ifail; |
2317 |
}; |
}; |