| 5 |
#include <TrkLevel1.h> |
#include <TrkLevel1.h> |
| 6 |
#include <iostream> |
#include <iostream> |
| 7 |
using namespace std; |
using namespace std; |
| 8 |
|
//...................................... |
| 9 |
|
// F77 routines |
| 10 |
|
//...................................... |
| 11 |
|
extern "C" { |
| 12 |
|
|
| 13 |
|
// int readetaparam_(); |
| 14 |
|
float cog_(int*,int*); |
| 15 |
|
float pfaeta_(int*,float*); |
| 16 |
|
float pfaeta2_(int*,float*); |
| 17 |
|
float pfaeta3_(int*,float*); |
| 18 |
|
float pfaeta4_(int*,float*); |
| 19 |
|
float pfaetal_(int*,float*); |
| 20 |
|
int npfastrips_(int*,float*); |
| 21 |
|
|
| 22 |
|
} |
| 23 |
//-------------------------------------- |
//-------------------------------------- |
| 24 |
// |
// |
| 25 |
// |
// |
| 26 |
//-------------------------------------- |
//-------------------------------------- |
| 27 |
TrkCluster::TrkCluster(){ |
TrkCluster::TrkCluster(){ |
| 28 |
|
|
| 29 |
view = 0; |
// cout << "TrkCluster::TrkCluster()"<<endl; |
| 30 |
ladder = 0; |
view = -1; |
| 31 |
maxs = 0; |
maxs = -1; |
| 32 |
mult = 0; |
indmax = -1; |
| 33 |
sgnl = 0; |
|
| 34 |
whichtrk = -1; |
CLlength = 0; |
| 35 |
CLlength = 0; |
clsignal = 0; |
| 36 |
clsignal = 0; |
clsigma = 0; |
| 37 |
clsigma = 0; |
cladc = 0; |
| 38 |
cladc = 0; |
clbad = 0; |
|
clbad = 0; |
|
| 39 |
|
|
| 40 |
}; |
}; |
| 41 |
//-------------------------------------- |
//-------------------------------------- |
| 42 |
// |
// |
| 43 |
// |
// |
| 44 |
//-------------------------------------- |
//-------------------------------------- |
| 45 |
TrkCluster::~TrkCluster(){ |
TrkCluster::TrkCluster(const TrkCluster& t){ |
| 46 |
|
|
| 47 |
|
view = t.view; |
| 48 |
|
maxs = t.maxs; |
| 49 |
|
indmax = t.indmax; |
| 50 |
|
|
| 51 |
|
CLlength = t.CLlength; |
| 52 |
|
if(CLlength){ |
| 53 |
|
clsignal = new Float_t[CLlength]; |
| 54 |
|
clsigma = new Float_t[CLlength]; |
| 55 |
|
cladc = new Int_t[CLlength]; |
| 56 |
|
clbad = new Bool_t[CLlength]; |
| 57 |
|
for(Int_t i=0; i<CLlength;i++){ |
| 58 |
|
clsignal[i] = t.clsignal[i]; |
| 59 |
|
clsigma[i] = t.clsigma[i]; |
| 60 |
|
cladc[i] = t.cladc[i]; |
| 61 |
|
clbad[i] = t.clbad[i]; |
| 62 |
|
}; |
| 63 |
|
}; |
| 64 |
|
}; |
| 65 |
|
//-------------------------------------- |
| 66 |
|
// |
| 67 |
|
// |
| 68 |
|
//-------------------------------------- |
| 69 |
|
void TrkCluster::Clear(){ |
| 70 |
|
|
| 71 |
|
// cout << "void TrkCluster::Clear()"<<endl; |
| 72 |
|
if(CLlength){ |
| 73 |
delete [] clsignal; |
delete [] clsignal; |
| 74 |
delete [] clsigma; |
delete [] clsigma; |
| 75 |
delete [] cladc; |
delete [] cladc; |
| 76 |
delete [] clbad; |
delete [] clbad; |
| 77 |
|
} |
| 78 |
|
|
| 79 |
|
view = 0; |
| 80 |
|
maxs = 0; |
| 81 |
|
indmax = 0; |
| 82 |
|
|
| 83 |
|
CLlength = 0; |
| 84 |
|
clsignal = 0; |
| 85 |
|
clsigma = 0; |
| 86 |
|
cladc = 0; |
| 87 |
|
clbad = 0; |
| 88 |
|
|
| 89 |
}; |
}; |
| 90 |
//-------------------------------------- |
//-------------------------------------- |
| 91 |
// |
// |
| 92 |
// |
// |
| 93 |
//-------------------------------------- |
//-------------------------------------- |
| 94 |
TrkCluster::TrkCluster(const TrkCluster& t){ |
/** |
| 95 |
|
* Evaluate the cluster signal including a maximum number of adjacent |
| 96 |
view = t.view; |
* strips, around maxs, having a significant signal. |
| 97 |
ladder = t.ladder; |
* @param nstrip Maximum number of strips. |
| 98 |
maxs = t.maxs; |
* @param cut Inclusion cut ( s > cut*sigma ). |
| 99 |
mult = t.mult; |
* @param force Falg to force the PFA strip-inclusion pattern (nstrip>0) |
| 100 |
sgnl = t.sgnl; |
* If nstrip<=0 only the inclusion cut is used to determine the cluster size. |
| 101 |
whichtrk = t.whichtrk; |
*/ |
| 102 |
|
Float_t TrkCluster::GetSignal(Int_t nstrip, Float_t cut, Bool_t force){ |
| 103 |
|
|
| 104 |
|
if(CLlength<=0)return 0; |
| 105 |
|
|
| 106 |
|
Float_t s = 0; |
| 107 |
|
|
| 108 |
|
//----------------------------------- |
| 109 |
|
// inlcude strips with s > cut*sigma |
| 110 |
|
//----------------------------------- |
| 111 |
|
|
| 112 |
|
if( nstrip<=0 ){ |
| 113 |
|
// for(Int_t is = 0; is < CLlength; is++){ |
| 114 |
|
// Float_t scut = cut*clsigma[is]; |
| 115 |
|
// if(clsignal[is] > scut) s += clsignal[is]; |
| 116 |
|
// }; |
| 117 |
|
for(Int_t is = indmax+1; is < CLlength; is++){ |
| 118 |
|
Float_t scut = cut*clsigma[is]; |
| 119 |
|
if(clsignal[is] > scut) s += clsignal[is]; |
| 120 |
|
else break; |
| 121 |
|
}; |
| 122 |
|
for(Int_t is = indmax; is >=0; is--){ |
| 123 |
|
Float_t scut = cut*clsigma[is]; |
| 124 |
|
if(clsignal[is] > scut) s += clsignal[is]; |
| 125 |
|
else break; |
| 126 |
|
}; |
| 127 |
|
return s; |
| 128 |
|
}; |
| 129 |
|
|
| 130 |
|
//--------------------------------------------------- |
| 131 |
|
// inlcude strips with s > cut*sigma, up to nstrip. |
| 132 |
|
// strips are included in order of decreasing signal |
| 133 |
|
//--------------------------------------------------- |
| 134 |
|
if( !force ){ |
| 135 |
|
|
| 136 |
|
Int_t il = indmax; |
| 137 |
|
Int_t ir = indmax; |
| 138 |
|
Int_t inc = 0; |
| 139 |
|
|
| 140 |
|
if( clsignal[indmax] < cut*clsigma[indmax] ) return 0; |
| 141 |
|
|
| 142 |
|
while ( inc < nstrip ){ |
| 143 |
|
Float_t sl = -100000; |
| 144 |
|
Float_t sr = -100000; |
| 145 |
|
if( il >= 0 ) sl = clsignal[il]; |
| 146 |
|
if( ir < CLlength ) sr = clsignal[ir]; |
| 147 |
|
if( sl == sr && inc == 0 ){ |
| 148 |
|
s += clsignal[il]; //cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl; |
| 149 |
|
il--; |
| 150 |
|
ir++; |
| 151 |
|
}else if ( sl >= sr && sl > cut*clsigma[il] && inc !=0 ){ |
| 152 |
|
s += sl;//cout << inc<<" - "<< clsignal[il]<<" "<<s<<endl; |
| 153 |
|
il--; |
| 154 |
|
}else if ( sl < sr && sr > cut*clsigma[ir] ){ |
| 155 |
|
s += sr;//cout << inc<<" - " << clsignal[ir]<<" "<<s<<endl; |
| 156 |
|
ir++; |
| 157 |
|
}else break; |
| 158 |
|
|
| 159 |
|
inc++; |
| 160 |
|
} |
| 161 |
|
return s; |
| 162 |
|
|
| 163 |
|
}else{ |
| 164 |
|
//--------------------------------------------------- |
| 165 |
|
// evaluate signal using a fixed number of strips, |
| 166 |
|
// following the PFA inclusion patters |
| 167 |
|
//--------------------------------------------------- |
| 168 |
|
// --> signal of the central strip |
| 169 |
|
Float_t sc = clsignal[indmax]; |
| 170 |
|
// signal of adjacent strips |
| 171 |
|
Float_t sl1 = -9999.; |
| 172 |
|
Float_t sl2 = -9999.; |
| 173 |
|
Float_t sr1 = -9999.; |
| 174 |
|
Float_t sr2 = -9999.; |
| 175 |
|
if(indmax-1>=0) sl1 = clsignal[indmax-1]; |
| 176 |
|
if(indmax-2>=0) sl2 = clsignal[indmax-2]; |
| 177 |
|
if(indmax+1<CLlength) sr1 = clsignal[indmax+1]; |
| 178 |
|
if(indmax+2<CLlength) sr2 = clsignal[indmax+2]; |
| 179 |
|
|
| 180 |
|
if(nstrip==1){ |
| 181 |
|
s = sc; |
| 182 |
|
}else if(nstrip==2){ |
| 183 |
|
if( sl1>sr1 && sl1+sc!=0 )s = (sl1+sc); |
| 184 |
|
if( sl1<sr1 && sr1+sc!=0 )s = (sc+sr1); |
| 185 |
|
if( sl1==sr1 && sl1 != -9999.){ |
| 186 |
|
if( clsigma[indmax-1] < clsigma[indmax+1] && sl1+sc!=0 )s = (sl1+sc); |
| 187 |
|
if( clsigma[indmax-1] > clsigma[indmax+1] && sc+sr1!=0 )s = (sc+sr1); |
| 188 |
|
} |
| 189 |
|
}else if(nstrip==3){ |
| 190 |
|
s = (sl1+sc+sr1); |
| 191 |
|
}else if(nstrip==4){ |
| 192 |
|
if( sl2>sr2 && sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1); |
| 193 |
|
if( sl2<sr2 && sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2); |
| 194 |
|
if( sl2==sr2 && sl2 != -9999.){ |
| 195 |
|
if( clsigma[indmax-2] < clsigma[indmax+2] && sl2+sl1+sc+sr1!=0 )s = (sl2+sl1+sc+sr1); |
| 196 |
|
if( clsigma[indmax-2] > clsigma[indmax+2] && sl1+sc+sr1+sr2!=0 )s = (sl1+sc+sr1+sr2); |
| 197 |
|
} |
| 198 |
|
}else if(nstrip==5){ |
| 199 |
|
s = (sl1+sc+sr1); |
| 200 |
|
if(sl2 != -9999.)s += sl2; |
| 201 |
|
if(sr2 != -9999.)s += sr2; |
| 202 |
|
}else{ |
| 203 |
|
cout << "Float_t TrkCluster::GetSignal("<<nstrip<<","<<cut<<","<<force<<")- not implemented"<<endl; |
| 204 |
|
} |
| 205 |
|
|
| 206 |
|
} |
| 207 |
|
|
| 208 |
|
return 0.; |
| 209 |
|
|
| 210 |
|
}; |
| 211 |
|
|
| 212 |
|
|
| 213 |
|
/** |
| 214 |
|
* Evaluate the cluster signal-to-noise, as defined by Turchetta, including a |
| 215 |
|
* maximum number of adjacent strips, around maxs, having a significant signal. |
| 216 |
|
* @param nstrip Maximum number of strips. |
| 217 |
|
* @param cut Inclusion cut ( s > cut*sigma ). |
| 218 |
|
* If nstrip<=0 only the inclusion cut is used to determine the cluster size. |
| 219 |
|
*/ |
| 220 |
|
Float_t TrkCluster::GetSignalToNoise(Int_t nstrip, Float_t cut){ |
| 221 |
|
|
| 222 |
CLlength = t.CLlength; |
if(CLlength<=0)return 0; |
| 223 |
clsignal = new Float_t[CLlength]; |
|
| 224 |
clsigma = new Float_t[CLlength]; |
Float_t sn = 0; |
| 225 |
cladc = new Int_t[CLlength]; |
|
| 226 |
clbad = new Bool_t[CLlength]; |
if( nstrip<=0 ){ |
| 227 |
for(Int_t i=0; i<CLlength;i++){ |
for(Int_t is = indmax+1; is < CLlength; is++){ |
| 228 |
clsignal[i] = t.clsignal[i]; |
Float_t scut = cut*clsigma[is]; |
| 229 |
clsigma[i] = t.clsigma[i]; |
if(clsignal[is] > scut) sn += clsignal[is]/clsigma[is]; |
| 230 |
cladc[i] = t.cladc[i]; |
else break; |
| 231 |
clbad[i] = t.clbad[i]; |
}; |
| 232 |
|
for(Int_t is = indmax; is >=0; is--){ |
| 233 |
|
Float_t scut = cut*clsigma[is]; |
| 234 |
|
if(clsignal[is] > scut) sn += clsignal[is]/clsigma[is]; |
| 235 |
|
else break; |
| 236 |
}; |
}; |
| 237 |
|
return sn; |
| 238 |
|
}; |
| 239 |
|
|
| 240 |
|
|
| 241 |
|
Int_t il = indmax; |
| 242 |
|
Int_t ir = indmax; |
| 243 |
|
Int_t inc = 0; |
| 244 |
|
|
| 245 |
|
if( clsignal[indmax] < cut*clsigma[indmax] ) return 0; |
| 246 |
|
|
| 247 |
|
while ( inc < nstrip ){ |
| 248 |
|
Float_t sl = -100000; |
| 249 |
|
Float_t sr = -100000; |
| 250 |
|
if( il >= 0 ) sl = clsignal[il]; |
| 251 |
|
if( ir < CLlength ) sr = clsignal[ir]; |
| 252 |
|
if( sl == sr && inc == 0 ){ |
| 253 |
|
sn += clsignal[il]/clsigma[il]; |
| 254 |
|
il--; |
| 255 |
|
ir++; |
| 256 |
|
}else if ( sl >= sr && sl > cut*clsigma[il] && inc !=0 ){ |
| 257 |
|
sn += sl/clsigma[il]; |
| 258 |
|
il--; |
| 259 |
|
}else if ( sl < sr && sr > cut*clsigma[ir] ){ |
| 260 |
|
sn += sr/clsigma[ir]; |
| 261 |
|
ir++; |
| 262 |
|
}else break; |
| 263 |
|
|
| 264 |
|
inc++; |
| 265 |
|
} |
| 266 |
|
return sn; |
| 267 |
|
}; |
| 268 |
|
/** |
| 269 |
|
* Evaluate the cluster multiplicity. |
| 270 |
|
* @param cut Inclusion cut. |
| 271 |
|
*/ |
| 272 |
|
Int_t TrkCluster::GetMultiplicity(Float_t cut){ |
| 273 |
|
|
| 274 |
|
if(CLlength<=0)return 0; |
| 275 |
|
|
| 276 |
|
Int_t m = 0; |
| 277 |
|
|
| 278 |
|
for(Int_t is = indmax+1; is < CLlength; is++){ |
| 279 |
|
Float_t scut = cut*clsigma[is]; |
| 280 |
|
if(clsignal[is] > scut) m++; |
| 281 |
|
else break; |
| 282 |
|
}; |
| 283 |
|
for(Int_t is = indmax; is >=0; is--){ |
| 284 |
|
Float_t scut = cut*clsigma[is]; |
| 285 |
|
if(clsignal[is] > scut) m++; |
| 286 |
|
else break; |
| 287 |
|
}; |
| 288 |
|
return m; |
| 289 |
|
}; |
| 290 |
|
/** |
| 291 |
|
* True if the cluster contains bad strips. |
| 292 |
|
* @param nbad Number of strips around the maximum. |
| 293 |
|
*/ |
| 294 |
|
Bool_t TrkCluster::IsBad(Int_t nbad){ |
| 295 |
|
|
| 296 |
|
if(CLlength<=0)return 0; |
| 297 |
|
|
| 298 |
|
Int_t il,ir; |
| 299 |
|
il = indmax; |
| 300 |
|
ir = indmax; |
| 301 |
|
for(Int_t i=1; i<nbad; i++){ |
| 302 |
|
if (ir == CLlength-1 && il == 0)break; |
| 303 |
|
else if (ir == CLlength-1 && il != 0)il--; |
| 304 |
|
else if (ir != CLlength-1 && il == 0)ir++; |
| 305 |
|
else{ |
| 306 |
|
if(clsignal[il-1] > clsignal[ir+1])il--; |
| 307 |
|
else ir++; |
| 308 |
|
} |
| 309 |
|
} |
| 310 |
|
Int_t isbad = 0; |
| 311 |
|
for(Int_t i=il; i<=ir; i++)isbad += clbad[i]; |
| 312 |
|
|
| 313 |
|
return ( isbad != nbad ); |
| 314 |
}; |
}; |
| 315 |
|
/** |
| 316 |
|
* True if the cluster contains saturated strips. |
| 317 |
|
* @param nbad Number of strips around the maximum. |
| 318 |
|
*/ |
| 319 |
|
Bool_t TrkCluster::IsSaturated(Int_t nbad){ |
| 320 |
|
|
| 321 |
|
if(CLlength<=0)return 0; |
| 322 |
|
|
| 323 |
|
Int_t il,ir; |
| 324 |
|
il = indmax; |
| 325 |
|
ir = indmax; |
| 326 |
|
for(Int_t i=1; i<nbad; i++){ |
| 327 |
|
if (ir == CLlength-1 && il == 0)break; |
| 328 |
|
else if (ir == CLlength-1 && il != 0)il--; |
| 329 |
|
else if (ir != CLlength-1 && il == 0)ir++; |
| 330 |
|
else{ |
| 331 |
|
if(clsignal[il-1] > clsignal[ir+1])il--; |
| 332 |
|
else ir++; |
| 333 |
|
} |
| 334 |
|
} |
| 335 |
|
Int_t isbad = 0; |
| 336 |
|
for(Int_t i=il; i<=ir; i++){ |
| 337 |
|
if( IsX() && cladc[i] > 2980 )isbad++; |
| 338 |
|
if( IsY() && cladc[i] < 80 )isbad++; |
| 339 |
|
} |
| 340 |
|
return ( isbad != 0 ); |
| 341 |
|
|
| 342 |
|
} |
| 343 |
//-------------------------------------- |
//-------------------------------------- |
| 344 |
// |
// |
| 345 |
// |
// |
| 346 |
//-------------------------------------- |
//-------------------------------------- |
| 347 |
void TrkCluster::Dump(){ |
void TrkCluster::Dump(){ |
| 348 |
|
|
| 349 |
cout << "----- Cluster" << endl; |
cout << "----- Cluster" << endl; |
| 350 |
cout << "View "<<view << " - Ladder "<<ladder<<endl; |
cout << "View "<<view << " - Ladder "<<GetLadder()<<endl; |
| 351 |
cout << "(Track ID "<<whichtrk<<")"<<endl; |
cout << "Position of maximun "<< maxs <<endl; |
| 352 |
cout << "Position of maximun "<<maxs<<endl; |
cout << "Multiplicity "<< GetMultiplicity() <<endl; |
| 353 |
cout << "Multiplicity "<<mult<<endl; |
cout << "Tot signal "<< GetSignal() << " (ADC channels)"<<endl ; |
| 354 |
cout << "Tot signal "<<sgnl<< " (ADC channels)"; |
cout << "Signal/Noise "<< GetSignalToNoise()<<endl; |
| 355 |
cout <<endl<< "Strip signals "; |
cout << "COG "<< GetCOG(0)<<endl;; |
| 356 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i]; |
cout << "Strip signals "; |
| 357 |
cout <<endl<< "Strip sigmas "; |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsignal[i]; |
| 358 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i]; |
cout <<endl<< "Strip sigmas "; |
| 359 |
cout <<endl<< "Strip ADC "; |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clsigma[i]; |
| 360 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<cladc[i]; |
cout <<endl<< "Strip ADC "; |
| 361 |
cout <<endl<< "Strip BAD "; |
for(Int_t i =0; i<CLlength; i++)cout << " " <<cladc[i]; |
| 362 |
for(Int_t i =0; i<CLlength; i++)cout << " " <<clbad[i]; |
cout <<endl<< "Strip BAD "; |
| 363 |
cout << endl; |
for(Int_t i =0; i<CLlength; i++){ |
| 364 |
|
if(i==indmax)cout << " *" <<clbad[i]<<"*"; |
| 365 |
|
else cout << " " <<clbad[i]; |
| 366 |
|
} |
| 367 |
|
cout << endl; |
| 368 |
|
|
| 369 |
} |
} |
| 370 |
//-------------------------------------- |
//-------------------------------------- |
| 371 |
// |
// |
| 372 |
// |
// |
| 373 |
//-------------------------------------- |
//-------------------------------------- |
| 374 |
TrkLevel1::TrkLevel1(){ |
/** |
| 375 |
|
* Method to fill a level1 struct with only one cluster (done to use F77 p.f.a. routines on a cluster basis). |
| 376 |
|
*/ |
| 377 |
|
void TrkCluster::GetLevel1Struct(cTrkLevel1* l1){ |
| 378 |
|
|
| 379 |
|
// cTrkLevel1* l1 = new cTrkLevel1; |
| 380 |
|
|
| 381 |
|
// cTrkLevel1* l1 = &level1event_ ; |
| 382 |
|
|
| 383 |
|
l1->nclstr1 = 1; |
| 384 |
|
l1->view[0] = view; |
| 385 |
|
l1->ladder[0] = GetLadder(); |
| 386 |
|
l1->maxs[0] = maxs; |
| 387 |
|
l1->mult[0] = GetMultiplicity(); |
| 388 |
|
l1->dedx[0] = GetSignal(); |
| 389 |
|
l1->indstart[0] = 1; |
| 390 |
|
l1->indmax[0] = indmax+1; |
| 391 |
|
l1->totCLlength = CLlength; |
| 392 |
|
for(Int_t i=0; i<CLlength; i++){ |
| 393 |
|
l1->clsignal[i] = clsignal[i]; |
| 394 |
|
l1->clsigma[i] = clsigma[i]; |
| 395 |
|
l1->cladc[i] = cladc[i]; |
| 396 |
|
l1->clbad[i] = clbad[i]; |
| 397 |
|
}; |
| 398 |
|
|
| 399 |
good1 = -1; |
// return l1; |
| 400 |
|
}; |
| 401 |
|
//-------------------------------------- |
| 402 |
|
// |
| 403 |
|
// |
| 404 |
|
//-------------------------------------- |
| 405 |
|
/** |
| 406 |
|
* Evaluates the Center-Of-Gravity (COG) of the cluster, in strips, relative to the strip with the maximum signal (TrkCluster::maxs). |
| 407 |
|
* @param ncog Number of strips to evaluate COG. |
| 408 |
|
* If ncog=0, the COG of the cluster is evaluated according to the cluster multiplicity (defined by the inclusion cut). |
| 409 |
|
* If ncog>0, the COG is evaluated using ncog strips, even if they have a negative signal (according to G.Landi) |
| 410 |
|
*/ |
| 411 |
|
Float_t TrkCluster::GetCOG(Int_t ncog){ |
| 412 |
|
|
| 413 |
Cluster = new TClonesArray("TrkCluster"); |
int ic = 1; |
| 414 |
|
GetLevel1Struct(); |
| 415 |
|
return cog_(&ncog,&ic); |
| 416 |
|
|
| 417 |
for(Int_t i=0; i<12 ; i++){ |
}; |
| 418 |
// crc[i] = -1; |
/** |
| 419 |
for(Int_t j=0; j<24 ; j++){ |
* Evaluates the Center-Of-Gravity (COG) of the cluster, in strips, relative to the strip with the maximum signal (TrkCluster::maxs), |
| 420 |
cnev[j][i]=0; |
* choosing the number of strips according to the angle, as implemented for the eta-algorythm . |
| 421 |
cnnev[j][i]=0; |
* @param angle Projected angle in degree. |
| 422 |
}; |
*/ |
| 423 |
fshower[i]=0; |
Float_t TrkCluster::GetCOG(Float_t angle){ |
| 424 |
|
|
| 425 |
|
Int_t neta = 0; |
| 426 |
|
|
| 427 |
|
// Float_t eta = GetETA(0,angle); |
| 428 |
|
// for(neta=2; neta<10; neta++) if( eta == GetETA(neta,angle) ) break; |
| 429 |
|
// if(eta != GetETA(neta,angle) )cout << "Attenzione!! pasticcio "<<endl; |
| 430 |
|
|
| 431 |
|
if( view%2 ){ //Y |
| 432 |
|
neta=2; |
| 433 |
|
}else{ //X |
| 434 |
|
if( fabs(angle) <= 10. ){ |
| 435 |
|
neta = 2; |
| 436 |
|
}else if( fabs(angle) > 10. && fabs(angle) <= 15. ){ |
| 437 |
|
neta = 3; |
| 438 |
|
}else{ |
| 439 |
|
neta = 4; |
| 440 |
}; |
}; |
| 441 |
} |
}; |
| 442 |
|
|
| 443 |
|
return GetCOG(neta); |
| 444 |
|
|
| 445 |
|
}; |
| 446 |
//-------------------------------------- |
//-------------------------------------- |
| 447 |
// |
// |
| 448 |
// |
// |
| 449 |
//-------------------------------------- |
//-------------------------------------- |
| 450 |
void TrkLevel1::Dump(){ |
/** |
| 451 |
|
* Evaluates the cluster position, in pitch units, relative to the strip |
| 452 |
|
* with the maximum signal (TrkCluster::maxs), by applying the non-linear |
| 453 |
|
* ETA-algorythm. |
| 454 |
|
* @param neta Number of strips to evaluate ETA. |
| 455 |
|
* @param angle Projected (effective) angle between particle track and detector plane. |
| 456 |
|
* @landi flag to apply Landi correction |
| 457 |
|
* Implemented values of neta are 2,3,4. If neta=0, ETA2, ETA3 and ETA4 are applied according to the angle. |
| 458 |
|
*/ |
| 459 |
|
Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi){ |
| 460 |
|
|
| 461 |
|
// cout << "GetETA(neta,angle) "<< neta << " "<< angle; |
| 462 |
|
// LoadPfaParam(); |
| 463 |
|
|
| 464 |
|
TrkParams::Load(4); |
| 465 |
|
if( !TrkParams::IsLoaded(4) ){ |
| 466 |
|
cout << "Float_t TrkCluster::GetETA(Int_t neta, float angle, bool landi) --- ERROR --- p.f.a. parameters not loaded"<<endl; |
| 467 |
|
return 0; |
| 468 |
|
} |
| 469 |
|
|
| 470 |
|
float ax = angle; |
| 471 |
|
int ic = 1; |
| 472 |
|
GetLevel1Struct(); |
| 473 |
|
if( neta == 0 && !landi) return pfaeta_(&ic,&ax); |
| 474 |
|
else if(neta == 0 && landi ) return pfaetal_(&ic,&ax); |
| 475 |
|
else if(neta == 2 ) return pfaeta2_(&ic,&ax); |
| 476 |
|
else if(neta == 3 ) return pfaeta3_(&ic,&ax); |
| 477 |
|
else if(neta == 4 ) return pfaeta4_(&ic,&ax); |
| 478 |
|
else cout << "TrkCluster::GetETA("<<neta<<","<<angle<<","<<landi<<") not implemented\n"; |
| 479 |
|
return 0; |
| 480 |
|
|
| 481 |
TClonesArray &t = *Cluster; |
}; |
| 482 |
|
|
| 483 |
|
/** |
| 484 |
|
* Evaluates the cluster position, in pitch unit, relative to the strip with |
| 485 |
|
* the maximum signal (TrkCluster::maxs), by applying the PFA set as default (see TrkParams). |
| 486 |
|
* @param angle Projected (effective) angle between particle track and detector plane. |
| 487 |
|
*/ |
| 488 |
|
Float_t TrkCluster::GetPositionPU(float angle){ |
| 489 |
|
|
| 490 |
|
if ( TrkParams::GetPFA() == 0 )return GetETA(0,angle,false); |
| 491 |
|
else if( TrkParams::GetPFA() == 2 )return GetETA(2,angle,false); |
| 492 |
|
else if( TrkParams::GetPFA() == 3 )return GetETA(3,angle,false); |
| 493 |
|
else if( TrkParams::GetPFA() == 4 )return GetETA(4,angle,false); |
| 494 |
|
else if( TrkParams::GetPFA() == 5 )return GetETA(0,angle,true); |
| 495 |
|
else if( TrkParams::GetPFA() == 10 )return GetCOG(0); |
| 496 |
|
else if( TrkParams::GetPFA() == 11 )return GetCOG(1); |
| 497 |
|
else if( TrkParams::GetPFA() == 12 )return GetCOG(2); |
| 498 |
|
else if( TrkParams::GetPFA() == 13 )return GetCOG(3); |
| 499 |
|
else if( TrkParams::GetPFA() == 14 )return GetCOG(4); |
| 500 |
|
else cout << " TrkCluster::GetPositionPU(float "<<angle<<") -- WARNING -- PFA="<<TrkParams::GetPFA()<<" not implemented"<<endl; |
| 501 |
|
|
| 502 |
|
return 0.; |
| 503 |
|
|
| 504 |
for(int i=0; i<this->nclstr(); i++) ((TrkCluster *)t[i])->Dump(); |
} |
| 505 |
|
|
| 506 |
|
/** |
| 507 |
|
* Give the number of strip used to evaluate the cluster coordinate |
| 508 |
|
* according to the p.f.a. |
| 509 |
|
* It returns 0 when the COG is used (in this case the number of strip used |
| 510 |
|
* equals the multiplicity). |
| 511 |
|
*/ |
| 512 |
|
Int_t TrkCluster::GetPFAstrips(float angle){ |
| 513 |
|
|
| 514 |
|
float ax = angle; |
| 515 |
|
int ic = 1; |
| 516 |
|
GetLevel1Struct(); |
| 517 |
|
return npfastrips_(&ic,&ax); |
| 518 |
|
|
| 519 |
|
} |
| 520 |
|
|
| 521 |
|
//-------------------------------------- |
| 522 |
|
// |
| 523 |
|
// |
| 524 |
|
//-------------------------------------- |
| 525 |
|
TrkLevel1::TrkLevel1(){ |
| 526 |
|
|
| 527 |
|
// cout << "TrkLevel1::TrkLevel1()"<<endl; |
| 528 |
|
// Cluster = new TClonesArray("TrkCluster"); |
| 529 |
|
Cluster = 0; |
| 530 |
|
for(Int_t i=0; i<12 ; i++){ |
| 531 |
|
good[i] = -1; |
| 532 |
|
for(Int_t j=0; j<24 ; j++){ |
| 533 |
|
cn[j][i]=0; |
| 534 |
|
cnn[j][i]=0; |
| 535 |
|
}; |
| 536 |
|
}; |
| 537 |
|
// TrkParams::SetTrackingMode(); |
| 538 |
|
// TrkParams::SetPrecisionFactor(); |
| 539 |
|
// TrkParams::SetStepMin(); |
| 540 |
|
TrkParams::SetMiniDefault(); |
| 541 |
|
TrkParams::SetPFA(); |
| 542 |
} |
} |
| 543 |
//-------------------------------------- |
//-------------------------------------- |
| 544 |
// |
// |
| 545 |
// |
// |
| 546 |
//-------------------------------------- |
//-------------------------------------- |
| 547 |
|
void TrkLevel1::Set(){ |
| 548 |
|
if(!Cluster)Cluster = new TClonesArray("TrkCluster"); |
| 549 |
|
} |
| 550 |
|
//-------------------------------------- |
| 551 |
|
// |
| 552 |
|
// |
| 553 |
|
//-------------------------------------- |
| 554 |
|
void TrkLevel1::Dump(){ |
| 555 |
|
|
| 556 |
|
cout<<"DSP status: "; |
| 557 |
|
for(Int_t i=0; i<12 ; i++)cout<<good[i]<<" "; |
| 558 |
|
cout<<endl; |
| 559 |
|
cout<<"VA1 mask : "<<endl; |
| 560 |
|
for(Int_t i=0; i<12 ; i++){ |
| 561 |
|
for(Int_t ii=0; ii<24 ; ii++){ |
| 562 |
|
Int_t mask = cnn[ii][i]; |
| 563 |
|
if(mask>0)mask=1; |
| 564 |
|
cout<<mask<<" "; |
| 565 |
|
} |
| 566 |
|
cout <<endl; |
| 567 |
|
} |
| 568 |
|
|
| 569 |
|
if(!Cluster)return; |
| 570 |
|
TClonesArray &t = *Cluster; |
| 571 |
|
for(int i=0; i<this->nclstr(); i++) ((TrkCluster *)t[i])->Dump(); |
| 572 |
|
|
| 573 |
|
} |
| 574 |
/** |
/** |
| 575 |
* Fills a TrkLevel1 object with values from a struct cTrkLevel1 (to get data from F77 common). |
* \brief Dump processing status |
| 576 |
*/ |
*/ |
| 577 |
void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1){ |
void TrkLevel1::StatusDump(int view){ |
| 578 |
|
cout << "DSP n. "<<view+1<<" (level1-)status: "<<hex<<showbase<<good[view]<<dec<<endl; |
| 579 |
|
}; |
| 580 |
|
/** |
| 581 |
|
* \brief Check event status |
| 582 |
|
* |
| 583 |
|
* Check the event status, according to a flag-mask given as input. |
| 584 |
|
* Return true if the view passes the check. |
| 585 |
|
* |
| 586 |
|
* @param view View number (0-11) |
| 587 |
|
* @param flagmask Mask of flags to check (eg. flagmask=0x111 no missing packet, |
| 588 |
|
* no crc error, no software alarm) |
| 589 |
|
* |
| 590 |
|
* @see TrkLevel2 class definition to know how the status flag is defined |
| 591 |
|
* |
| 592 |
|
*/ |
| 593 |
|
Bool_t TrkLevel1::StatusCheck(int view, int flagmask){ |
| 594 |
|
|
| 595 |
// *** CLUSTER *** |
if( view<0 || view >= 12)return false; |
| 596 |
TrkCluster* t_cl = new TrkCluster(); |
return !(good[view]&flagmask); |
| 597 |
TClonesArray &t = *Cluster; |
|
| 598 |
for(int i=0; i<l1->nclstr1; i++){ |
}; |
|
|
|
|
t_cl->view = l1->view[i]; |
|
|
t_cl->ladder = l1->ladder[i]; |
|
|
t_cl->maxs = l1->maxs[i]; |
|
|
t_cl->mult = l1->mult[i]; |
|
|
t_cl->sgnl = l1->dedx[i]; |
|
|
t_cl->whichtrk = l1->whichtrack[i]-1; |
|
|
|
|
|
Int_t from = l1->indstart[i] -1; |
|
|
Int_t to = l1->totCLlength ; |
|
|
if(i != l1->nclstr1-1)to = l1->indstart[i+1] -1 ; |
|
|
t_cl->CLlength = to - from ; |
|
|
|
|
|
t_cl->clsignal = new Float_t[t_cl->CLlength]; |
|
|
t_cl->clsigma = new Float_t[t_cl->CLlength]; |
|
|
t_cl->cladc = new Int_t[t_cl->CLlength]; |
|
|
t_cl->clbad = new Bool_t[t_cl->CLlength]; |
|
|
Int_t index = 0; |
|
|
for(Int_t is = from; is < to; is++ ){ |
|
|
t_cl->clsignal[index] = (Float_t) l1->clsignal[is]; |
|
|
t_cl->clsigma[index] = (Float_t) l1->clsigma[is]; |
|
|
t_cl->cladc[index] = (Int_t) l1->cladc[is]; |
|
|
t_cl->clbad[index] = (Bool_t) l1->clbad[is]; |
|
|
index++; |
|
|
}; |
|
|
|
|
|
new(t[i]) TrkCluster(*t_cl); |
|
|
}; |
|
|
|
|
|
delete t_cl; |
|
| 599 |
|
|
|
// general variables |
|
| 600 |
|
|
| 601 |
good1 = l1->good1; |
//-------------------------------------- |
| 602 |
for(Int_t i=0; i<12 ; i++){ |
// |
| 603 |
// crc[i] = l1->crc[i]; |
// |
| 604 |
for(Int_t j=0; j<24 ; j++){ |
//-------------------------------------- |
| 605 |
cnev[j][i] = l1->cnev[j][i]; |
/** |
| 606 |
cnnev[j][i] = l1->cnnev[j][i]; |
* Fills a TrkLevel1 object with values from a struct cTrkLevel1 (to get data from F77 common). |
| 607 |
}; |
*/ |
| 608 |
fshower[i] = l1->fshower[i]; |
void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1, Bool_t full){ |
| 609 |
|
|
| 610 |
|
// cout << "void TrkLevel1::SetFromLevel1Struct(cTrkLevel1 *l1, Bool_t full)"<<endl; |
| 611 |
|
|
| 612 |
|
Clear(); |
| 613 |
|
// --------------- |
| 614 |
|
// *** CLUSTER *** |
| 615 |
|
// --------------- |
| 616 |
|
TrkCluster* t_cl = new TrkCluster(); |
| 617 |
|
if(!Cluster)Cluster = new TClonesArray("TrkCluster"); |
| 618 |
|
TClonesArray &t = *Cluster; |
| 619 |
|
for(int i=0; i<l1->nclstr1; i++){ |
| 620 |
|
|
| 621 |
|
t_cl->Clear(); |
| 622 |
|
// if( full || (!full && l1->whichtrack[i]) ){ |
| 623 |
|
|
| 624 |
|
t_cl->view = l1->view[i]; |
| 625 |
|
t_cl->maxs = l1->maxs[i]; |
| 626 |
|
|
| 627 |
|
if( full || (!full && l1->whichtrack[i]) ){ |
| 628 |
|
t_cl->indmax = l1->indmax[i] - l1->indstart[i]; |
| 629 |
|
Int_t from = l1->indstart[i] -1; |
| 630 |
|
Int_t to = l1->totCLlength ; |
| 631 |
|
if(i != l1->nclstr1-1)to = l1->indstart[i+1] -1 ; |
| 632 |
|
t_cl->CLlength = to - from ; |
| 633 |
|
|
| 634 |
|
t_cl->clsignal = new Float_t[t_cl->CLlength]; |
| 635 |
|
t_cl->clsigma = new Float_t[t_cl->CLlength]; |
| 636 |
|
t_cl->cladc = new Int_t[t_cl->CLlength]; |
| 637 |
|
t_cl->clbad = new Bool_t[t_cl->CLlength]; |
| 638 |
|
|
| 639 |
|
Int_t index = 0; |
| 640 |
|
for(Int_t is = from; is < to; is++ ){ |
| 641 |
|
t_cl->clsignal[index] = (Float_t) l1->clsignal[is]; |
| 642 |
|
t_cl->clsigma[index] = (Float_t) l1->clsigma[is]; |
| 643 |
|
t_cl->cladc[index] = (Int_t) l1->cladc[is]; |
| 644 |
|
t_cl->clbad[index] = (Bool_t) l1->clbad[is]; |
| 645 |
|
index++; |
| 646 |
|
}; |
| 647 |
|
} |
| 648 |
|
new(t[i]) TrkCluster(*t_cl); // <<< store cluster |
| 649 |
|
}; |
| 650 |
|
|
| 651 |
|
delete t_cl; |
| 652 |
|
|
| 653 |
|
// ------------------------- |
| 654 |
|
// ****general variables**** |
| 655 |
|
// ------------------------- |
| 656 |
|
for(Int_t i=0; i<12 ; i++){ |
| 657 |
|
good[i] = l1->good[i]; |
| 658 |
|
for(Int_t j=0; j<24 ; j++){ |
| 659 |
|
cn[j][i] = l1->cnev[j][i]; |
| 660 |
|
// cnrms[j][i] = l1->cnrmsev[j][i]; |
| 661 |
|
cnn[j][i] = l1->cnnev[j][i]; |
| 662 |
}; |
}; |
| 663 |
|
}; |
| 664 |
|
|
| 665 |
} |
} |
| 666 |
/** |
/** |
| 667 |
* Fills a struct cTrkLevel1 with values from a TrkLevel1 object (to put data into a F77 common). |
* Fills a struct cTrkLevel1 with values from a TrkLevel1 object (to put data into a F77 common). |
| 668 |
*/ |
*/ |
| 669 |
|
|
| 670 |
void TrkLevel1::GetLevel1Struct(cTrkLevel1 *l1) const { |
void TrkLevel1::GetLevel1Struct(cTrkLevel1* l1) { |
| 671 |
|
|
| 672 |
// ********* completare ********* // |
// cTrkLevel1* l1 = &level1event_ ; |
| 673 |
// ********* completare ********* // |
|
| 674 |
// ********* completare ********* // |
for(Int_t i=0; i<12 ; i++){ |
| 675 |
// ********* completare ********* // |
l1->good[i] = good[i]; |
| 676 |
// ********* completare ********* // |
for(Int_t j=0; j<24 ; j++){ |
| 677 |
// ********* completare ********* // |
l1->cnev[j][i] = cn[j][i] ; |
| 678 |
// general variables |
l1->cnnev[j][i] = cnn[j][i] ; |
| 679 |
l1->good1 = good1; |
l1->cnrmsev[j][i] = 0. ; |
|
for(Int_t i=0; i<12 ; i++){ |
|
|
// l1->crc[i] = crc[i]; |
|
|
for(Int_t j=0; j<24 ; j++){ |
|
|
l1->cnev[j][i] = cnev[j][i]; |
|
|
l1->cnnev[j][i] = cnnev[j][i]; |
|
|
}; |
|
|
l1->fshower[i] = fshower[i]; |
|
| 680 |
}; |
}; |
| 681 |
|
l1->fshower[i] = 0; |
| 682 |
// *** CLUSTERS *** |
}; |
| 683 |
l1->nclstr1 = Cluster->GetEntries(); |
|
| 684 |
for(Int_t i=0;i<l1->nclstr1;i++){ |
l1->nclstr1=0; |
| 685 |
|
l1->totCLlength=0; |
| 686 |
l1->view[i] = ((TrkCluster *)Cluster->At(i))->view; |
Int_t index=0; |
| 687 |
l1->ladder[i] = ((TrkCluster *)Cluster->At(i))->ladder; |
if(Cluster){ |
| 688 |
l1->maxs[i] = ((TrkCluster *)Cluster->At(i))->maxs; |
Int_t i=0; |
| 689 |
l1->mult[i] = ((TrkCluster *)Cluster->At(i))->mult; |
for(Int_t ii=0;ii<Cluster->GetEntries();ii++){ |
| 690 |
l1->dedx[i] = ((TrkCluster *)Cluster->At(i))->sgnl; |
TrkCluster *clu = GetCluster(ii); |
| 691 |
|
// ---------------------------------------- |
| 692 |
|
// attenzione!! |
| 693 |
|
// se il cluster non e` salvato (view = 0) |
| 694 |
|
// DEVE essere escluso dal common F77 |
| 695 |
|
// ---------------------------------------- |
| 696 |
|
if(clu->view != 0 ){ |
| 697 |
|
l1->view[i] = clu->view; |
| 698 |
|
l1->ladder[i] = clu->GetLadder(); |
| 699 |
|
l1->maxs[i] = clu->maxs; |
| 700 |
|
l1->mult[i] = clu->GetMultiplicity(); |
| 701 |
|
l1->dedx[i] = clu->GetSignal(); |
| 702 |
|
l1->indstart[i] = index+1; |
| 703 |
|
l1->indmax[i] = l1->indstart[i] + clu->indmax; |
| 704 |
|
l1->totCLlength += clu->CLlength; |
| 705 |
|
for(Int_t iw=0; iw < clu->CLlength; iw++){ |
| 706 |
|
l1->clsignal[index] = clu->clsignal[iw]; |
| 707 |
|
l1->clsigma[index] = clu->clsigma[iw]; |
| 708 |
|
l1->cladc[index] = clu->cladc[iw]; |
| 709 |
|
l1->clbad[index] = clu->clbad[iw]; |
| 710 |
|
index++; |
| 711 |
|
} |
| 712 |
|
i++; |
| 713 |
|
} |
| 714 |
} |
} |
| 715 |
|
l1->nclstr1 = i; |
| 716 |
// ********* completare ********* // |
} |
| 717 |
|
|
| 718 |
|
// return l1; |
| 719 |
} |
} |
| 720 |
//-------------------------------------- |
//-------------------------------------- |
| 721 |
// |
// |
| 722 |
// |
// |
| 723 |
//-------------------------------------- |
//-------------------------------------- |
| 724 |
void TrkLevel1::Clear(){ |
void TrkLevel1::Clear(){ |
| 725 |
|
|
| 726 |
good1 = -1; |
for(Int_t i=0; i<12 ; i++){ |
| 727 |
for(Int_t i=0; i<12 ; i++){ |
good[i] = -1; |
| 728 |
// crc[i] = -1; |
for(Int_t j=0; j<24 ; j++){ |
| 729 |
for(Int_t j=0; j<24 ; j++){ |
cn[j][i] = 0; |
| 730 |
cnev[j][i] = 0; |
cnn[j][i] = 0; |
|
cnnev[j][i] = 0; |
|
|
}; |
|
|
fshower[i] = 0; |
|
| 731 |
}; |
}; |
| 732 |
// totCLlength = 0; |
}; |
| 733 |
Cluster->Clear(); |
// if(Cluster)Cluster->Clear("C"); |
| 734 |
|
if(Cluster)Cluster->Delete(); |
| 735 |
|
|
| 736 |
|
} |
| 737 |
|
//-------------------------------------- |
| 738 |
|
// |
| 739 |
|
// |
| 740 |
|
//-------------------------------------- |
| 741 |
|
void TrkLevel1::Delete(){ |
| 742 |
|
|
| 743 |
|
// Clear(); |
| 744 |
|
if(Cluster)Cluster->Delete(); |
| 745 |
|
if(Cluster)delete Cluster; |
| 746 |
|
|
| 747 |
} |
} |
| 748 |
//-------------------------------------- |
//-------------------------------------- |
| 749 |
// |
// |
| 751 |
//-------------------------------------- |
//-------------------------------------- |
| 752 |
TrkCluster *TrkLevel1::GetCluster(int is){ |
TrkCluster *TrkLevel1::GetCluster(int is){ |
| 753 |
|
|
| 754 |
if(is >= this->nclstr()){ |
if(!Cluster)return 0; |
| 755 |
cout << "** TrkLevel1::GetCluster(int) ** Cluster "<< is << " does not exits! " << endl; |
if(is >= nclstr()){ |
| 756 |
cout << "( Stored clusters nclstr() = "<< this->nclstr()<<" )" << endl; |
cout << "** TrkLevel1::GetCluster(int) ** Cluster "<< is << " does not exits! " << endl; |
| 757 |
return 0; |
cout << "( Stored clusters nclstr() = "<< this->nclstr()<<" )" << endl; |
| 758 |
} |
return 0; |
| 759 |
TClonesArray &t = *(Cluster); |
} |
| 760 |
TrkCluster *cluster = (TrkCluster*)t[is]; |
|
| 761 |
return cluster; |
TClonesArray &t = *(Cluster); |
| 762 |
|
TrkCluster *cluster = (TrkCluster*)t[is]; |
| 763 |
|
return cluster; |
| 764 |
} |
} |
| 765 |
|
|
| 766 |
// //-------------------------------------- |
|
| 767 |
// // |
// int TrkLevel1::GetPfaNbinsAngle(){ |
| 768 |
// // |
// TrkParams::Load(4); |
| 769 |
// //-------------------------------------- |
// if( !TrkParams::IsLoaded(4) ){ |
| 770 |
// TrkTrackRef::TrkTrackRef(){ |
// cout << "int TrkLevel1::GetPfaNbinsAngle() --- ERROR --- p.f.a. parameters not loaded"<<endl; |
| 771 |
// for(int ip=0;ip<6;ip++){ |
// return 0; |
| 772 |
// clx[ip] = 0; |
// } |
| 773 |
// cly[ip] = 0; |
// return pfa_.nangbin; |
|
// }; |
|
| 774 |
// }; |
// }; |
| 775 |
// //-------------------------------------- |
|
| 776 |
// // |
// int TrkLevel1::GetPfaNbinsETA(){ |
| 777 |
// // |
// TrkParams::Load(4); |
| 778 |
// //-------------------------------------- |
// if( !TrkParams::IsLoaded(4) ){ |
| 779 |
// TrkTrackRef::TrkTrackRef(const TrkTrackRef& t){ |
// cout << "int TrkLevel1::GetPfaNbinsETA() --- ERROR --- p.f.a. parameters not loaded"<<endl; |
| 780 |
// for(int ip=0;ip<6;ip++){ |
// return 0; |
| 781 |
// clx[ip] = t.clx[ip]; |
// } |
| 782 |
// cly[ip] = t.cly[ip]; |
// return pfa_.netaval; |
|
// }; |
|
| 783 |
// }; |
// }; |
| 784 |
// //-------------------------------------- |
|
| 785 |
// // |
// /** |
| 786 |
// // |
// * |
| 787 |
// //-------------------------------------- |
// * |
| 788 |
// void TrkTrackRef::Clear(){ |
// */ |
| 789 |
// for(int ip=0;ip<6;ip++){ |
// float* TrkLevel1::GetPfaCoord(TString pfa, int nview, int nladder, int nang){ |
| 790 |
// clx[ip] = 0; |
|
| 791 |
// cly[ip] = 0; |
// TrkParams::Load(4); |
| 792 |
// }; |
// if( !TrkParams::IsLoaded(4) ){ |
| 793 |
|
// cout << "float* TrkLevel1::GetPfaCoord(TString pfa, int nview, int nladder, int nang) --- ERROR --- p.f.a. parameters not loaded"<<endl; |
| 794 |
|
// return 0; |
| 795 |
|
// } |
| 796 |
|
|
| 797 |
|
// int nbins = GetPfaNbinsETA(); |
| 798 |
|
// if(!nbins)return 0; |
| 799 |
|
|
| 800 |
|
// float *fcorr = new float [nbins]; |
| 801 |
|
|
| 802 |
|
// if(!pfa.CompareTo("ETA2",TString::kIgnoreCase)){ |
| 803 |
|
// for(int ib=0; ib<nbins; ib++){ |
| 804 |
|
// fcorr[ib] = pfa_.feta2[nang][nladder][nview][ib]; |
| 805 |
|
// cout << pfa_.eta2[nang][ib] << " - " << pfa_.feta2[nang][nladder][nview][ib]<<endl;; |
| 806 |
|
// } |
| 807 |
|
// }else if (!pfa.CompareTo("ETA3",TString::kIgnoreCase)){ |
| 808 |
|
// for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.feta3[nang][nladder][nview][ib]; |
| 809 |
|
// }else if (!pfa.CompareTo("ETA4",TString::kIgnoreCase)){ |
| 810 |
|
// for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.feta4[nang][nladder][nview][ib]; |
| 811 |
|
// }else{ |
| 812 |
|
// cout << pfa<<" pfa parameters not implemented "<<endl; |
| 813 |
|
// return 0; |
| 814 |
|
// } |
| 815 |
|
|
| 816 |
|
// return fcorr; |
| 817 |
|
|
| 818 |
// }; |
// }; |
| 819 |
// //-------------------------------------- |
|
| 820 |
// // |
// float* TrkLevel1::GetPfaAbs(TString pfa, int nang){ |
| 821 |
// // |
|
| 822 |
// //-------------------------------------- |
// TrkParams::Load(4); |
| 823 |
// TrkLevel2Ref::TrkLevel2Ref(){ |
// if( !TrkParams::IsLoaded(4) ){ |
| 824 |
// Track = new TClonesArray("TrkTrackRef"); |
// cout << "float* TrkLevel1::GetPfaAbs(TString pfa, int nang) --- ERROR --- p.f.a. parameters not loaded"<<endl; |
| 825 |
// SingletX = new TClonesArray("TRef"); |
// return 0; |
| 826 |
// SingletY = new TClonesArray("TRef"); |
// } |
| 827 |
|
|
| 828 |
|
// int nbins = GetPfaNbinsETA(); |
| 829 |
|
// if(!nbins)return 0; |
| 830 |
|
|
| 831 |
|
// float *fcorr = new float [nbins]; |
| 832 |
|
|
| 833 |
|
// if(!pfa.CompareTo("ETA2",TString::kIgnoreCase)){ |
| 834 |
|
// for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta2[nang][ib]; |
| 835 |
|
// }else if (!pfa.CompareTo("ETA3",TString::kIgnoreCase)){ |
| 836 |
|
// for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta3[nang][ib]; |
| 837 |
|
// }else if (!pfa.CompareTo("ETA4",TString::kIgnoreCase)){ |
| 838 |
|
// for(int ib=0; ib<nbins; ib++)fcorr[ib] = pfa_.eta4[nang][ib]; |
| 839 |
|
// }else{ |
| 840 |
|
// cout << pfa<<" pfa parameters not implemented "<<endl; |
| 841 |
|
// return 0; |
| 842 |
|
// } |
| 843 |
|
|
| 844 |
|
// return fcorr; |
| 845 |
|
|
| 846 |
// }; |
// }; |
| 847 |
// //-------------------------------------- |
|
| 848 |
// // |
/** |
| 849 |
// // |
* Method to call the F77 routine that performs level1->level2 processing. |
| 850 |
// //-------------------------------------- |
* The level2 output is stored in a common block, which can be retrieved |
| 851 |
// void TrkLevel2Ref::SetFromLevel2Struct(cTrkLevel2 *l2){ |
* by mean of the method TrkLevel2::SetFromLevel2Struct(). |
| 852 |
// |
* NB If the TrkLevel1 object is readout from a tree, and the |
| 853 |
// TrkTrackRef* t_track = new TrkTrackRef(); |
* TrkLevel1::ProcessEvent(int pfa) is used to reprocess the event, attention |
| 854 |
// TRef t_singlet = 0; |
* should be payed to the fact that single clusters (clusters not associated |
| 855 |
// |
* with any track) might not be stored. Full reprocessing should be done starting |
| 856 |
// TClonesArray &t = *Track; |
* from level0 data. |
| 857 |
// for(int i=0; i<l2->ntrk; i++){ |
*/ |
| 858 |
// for(int ip=0;ip<6;ip++){ |
//int TrkLevel1::ProcessEvent(int pfa){ |
| 859 |
// t_track->clx[ip] = 0;//<<<puntatore al cluster |
int TrkLevel1::ProcessEvent(){ |
| 860 |
// t_track->cly[ip] = 0;//<<<puntatore al cluster |
|
| 861 |
// }; |
// cout << "int TrkLevel1::ProcessEvent()" << endl; |
| 862 |
// new(t[i]) TrkTrackRef(*t_track); |
TrkParams::Load( ); |
| 863 |
// t_track->Clear(); |
if( !TrkParams::IsLoaded() )return 0; |
| 864 |
// }; |
|
| 865 |
// // *** SINGLETS *** |
GetLevel1Struct(); |
| 866 |
// TClonesArray &sx = *SingletX; |
|
| 867 |
// for(int i=0; i<l2->nclsx; i++){ |
// analysisflight_(&pfa); |
| 868 |
// t_singlet = 0;//<<<puntatore al cluster |
// TrkParams::SetPFA(pfa); |
| 869 |
// new(sx[i]) TRef(t_singlet); |
analysisflight_(); |
| 870 |
// } |
|
| 871 |
// TClonesArray &sy = *SingletY; |
return 1; |
| 872 |
// for(int i=0; i<l2->nclsy; i++){ |
|
| 873 |
// t_singlet = 0;//<<<puntatore al cluster |
} |
| 874 |
// new(sy[i]) TRef(t_singlet); |
|
|
// }; |
|
|
// |
|
|
// delete t_track; |
|
|
// } |
|
|
// //-------------------------------------- |
|
|
// // |
|
|
// // |
|
|
// //-------------------------------------- |
|
|
// void TrkLevel2Ref::Clear(){ |
|
|
// Track->Clear(); |
|
|
// SingletX->Clear(); |
|
|
// SingletY->Clear(); |
|
|
// } |
|
| 875 |
|
|
| 876 |
ClassImp(TrkLevel1); |
ClassImp(TrkLevel1); |
| 877 |
ClassImp(TrkCluster); |
ClassImp(TrkCluster); |
|
// ClassImp(TrkTrackRef); |
|
|
// ClassImp(TrkLevel2Ref); |
|
Parent Directory
| 
Revision Log
| 
Patch