]>
Commit | Line | Data |
---|---|---|
1 | // ************************************************************************** | |
2 | // * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
3 | // * * | |
4 | // * Author: The ALICE Off-line Project. * | |
5 | // * Contributors are mentioned in the code where appropriate. * | |
6 | // * * | |
7 | // * Permission to use, copy, modify and distribute this software and its * | |
8 | // * documentation strictly for non-commercial purposes is hereby granted * | |
9 | // * without fee, provided that the above copyright notice appears in all * | |
10 | // * copies and that both the copyright notice and this permission notice * | |
11 | // * appear in the supporting documentation. The authors make no claims * | |
12 | // * about the suitability of this software for any purpose. It is * | |
13 | // * provided "as is" without express or implied warranty. * | |
14 | // ************************************************************************** | |
15 | ||
16 | #include "AliHMPIDCluster.h" //class header | |
17 | #include <TVirtualFitter.h> //Solve() | |
18 | #include <TMinuit.h> //Solve() | |
19 | #include <TClonesArray.h> //Solve() | |
20 | #include <TMarker.h> //Draw() | |
21 | ||
22 | #include "AliLog.h" //FindCusterSize() | |
23 | ||
24 | Bool_t AliHMPIDCluster::fgDoCorrSin=kTRUE; | |
25 | ||
26 | ClassImp(AliHMPIDCluster) | |
27 | ||
28 | ||
29 | void AliHMPIDCluster::SetClusterParams(Double_t xL,Double_t yL,Int_t iCh ) | |
30 | { | |
31 | //------------------------------------------------------------------------ | |
32 | //Set the cluster properties for the AliCluster3D part | |
33 | //------------------------------------------------------------------------ | |
34 | ||
35 | fParam = AliHMPIDParam::Instance(); | |
36 | ||
37 | if(!fParam->GetInstType()) //if there is no geometry we cannot retrieve the volId (only for monitoring) | |
38 | { | |
39 | new(this) AliCluster3D(); return; | |
40 | } | |
41 | ||
42 | //Get the volume ID from the previously set PNEntry | |
43 | UShort_t volId=AliGeomManager::LayerToVolUID(AliGeomManager::kHMPID,iCh); | |
44 | ||
45 | ||
46 | //get L->T cs matrix for a given chamber | |
47 | const TGeoHMatrix *t2l= AliGeomManager::GetTracking2LocalMatrix(volId); | |
48 | ||
49 | fParam = AliHMPIDParam::Instance(); | |
50 | ||
51 | //transformation from the pad cs to local | |
52 | xL -= 0.5*fParam->SizeAllX(); //size of all pads with dead zones included | |
53 | yL -= 0.5*fParam->SizeAllY(); | |
54 | ||
55 | // Get the position in the tracking cs | |
56 | Double_t posL[3]={xL, yL, 0.}; //this is the LORS of HMPID | |
57 | Double_t posT[3]; | |
58 | t2l->MasterToLocal(posL,posT); | |
59 | ||
60 | //Get the cluster covariance matrix in the tracking cs | |
61 | Double_t covL[9] = { | |
62 | 0.8*0.8/12., 0., 0.0, //pad size X | |
63 | 0., 0.84*0.84/12., 0.0, //pad size Y | |
64 | 0., 0., 0.1, //just 1 , no Z dimension ??? | |
65 | }; | |
66 | ||
67 | TGeoHMatrix m; | |
68 | m.SetRotation(covL); | |
69 | m.Multiply(t2l); | |
70 | m.MultiplyLeft(&t2l->Inverse()); | |
71 | Double_t *covT = m.GetRotationMatrix(); | |
72 | ||
73 | new(this) AliCluster3D(volId, // Can be done safer | |
74 | posT[0],posT[1],posT[2], | |
75 | covT[0],covT[1],covT[2], | |
76 | covT[4],covT[5], | |
77 | covT[8], | |
78 | 0x0); // No MC labels ? | |
79 | } | |
80 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
81 | AliHMPIDCluster::~AliHMPIDCluster() | |
82 | { | |
83 | if(fDigs) delete fDigs; fDigs=0; | |
84 | //PH if(fParam) delete fParam; fParam=0; | |
85 | } | |
86 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
87 | void AliHMPIDCluster::CoG() | |
88 | { | |
89 | // Calculates naive cluster position as a center of gravity of its digits. | |
90 | // Arguments: none | |
91 | // Returns: none | |
92 | Int_t minPadX=999,minPadY=999,maxPadX=-1,maxPadY=-1; //for box finding | |
93 | if(fDigs==0) return; //no digits in this cluster | |
94 | fXX=fYY=fQRaw=0; //init summable parameters | |
95 | fCh = -1; //init chamber | |
96 | Int_t maxQpad=-1,maxQ=-1; //to calculate the pad with the highest charge | |
97 | AliHMPIDDigit *pDig=0x0; | |
98 | for(Int_t iDig=0;iDig<fDigs->GetEntriesFast();iDig++){ //digits loop | |
99 | pDig=(AliHMPIDDigit*)fDigs->At(iDig); //get pointer to next digit | |
100 | if(!pDig) continue; //protection | |
101 | if(pDig->PadPcX() > maxPadX) maxPadX = pDig->PadPcX(); // find the minimum box that contain the cluster MaxX | |
102 | if(pDig->PadPcY() > maxPadY) maxPadY = pDig->PadPcY(); // MaxY | |
103 | if(pDig->PadPcX() < minPadX) minPadX = pDig->PadPcX(); // MinX | |
104 | if(pDig->PadPcY() < minPadY) minPadY = pDig->PadPcY(); // MinY | |
105 | ||
106 | Float_t q=pDig->Q(); //get QDC | |
107 | fXX += pDig->LorsX()*q;fYY +=pDig->LorsY()*q; //add digit center weighted by QDC | |
108 | fQRaw+=q; //increment total charge | |
109 | if(q>maxQ) {maxQpad = pDig->Pad();maxQ=(Int_t)q;} // to find pad with highest charge | |
110 | fCh=pDig->Ch(); //initialize chamber number | |
111 | }//digits loop | |
112 | ||
113 | fBox=(maxPadX-minPadX+1)*100+maxPadY-minPadY+1; // dimension of the box: format Xdim*100+Ydim | |
114 | ||
115 | if ( fQRaw != 0 ) {fXX/=fQRaw;fYY/=fQRaw;} //final center of gravity | |
116 | ||
117 | if(fDigs->GetEntriesFast()>1&&fgDoCorrSin)CorrSin(); //correct it by sinoid | |
118 | ||
119 | fQ = fQRaw; // Before starting fit procedure, Q and QRaw must be equal | |
120 | fMaxQpad = maxQpad; fMaxQ=maxQ; //store max charge pad to the field | |
121 | fChi2=0; // no Chi2 to find | |
122 | fNlocMax=0; // proper status from this method | |
123 | fSt=kCoG; | |
124 | ||
125 | SetClusterParams(fXX,fYY,fCh); //need to fill the AliCluster3D part | |
126 | ||
127 | }//CoG() | |
128 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
129 | void AliHMPIDCluster::CorrSin() | |
130 | { | |
131 | // Correction of cluster x position due to sinoid, see HMPID TDR page 30 | |
132 | // Arguments: none | |
133 | // Returns: none | |
134 | Int_t pc,px,py; | |
135 | fParam->Lors2Pad(fXX,fYY,pc,px,py); //tmp digit to get it center | |
136 | Float_t x=fXX-fParam->LorsX(pc,px); //diff between cluster x and center of the pad contaning this cluster | |
137 | fXX+=3.31267e-2*TMath::Sin(2*TMath::Pi()/0.8*x)-2.66575e-3*TMath::Sin(4*TMath::Pi()/0.8*x)+2.80553e-3*TMath::Sin(6*TMath::Pi()/0.8*x)+0.0070; | |
138 | } | |
139 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
140 | void AliHMPIDCluster::Draw(Option_t*) | |
141 | { | |
142 | TMarker *pMark=new TMarker(X(),Y(),5); pMark->SetUniqueID(fSt);pMark->SetMarkerColor(kBlue); pMark->Draw(); | |
143 | } | |
144 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
145 | void AliHMPIDCluster::FitFunc(Int_t &iNpars, Double_t* deriv, Double_t &chi2, Double_t *par, Int_t iflag) | |
146 | { | |
147 | // Cluster fit function | |
148 | // par[0]=x par[1]=y par[2]=q for the first Mathieson shape | |
149 | // par[3]=x par[4]=y par[5]=q for the second Mathieson shape and so on up to iNpars/3 Mathieson shapes | |
150 | // For each pad of the cluster calculates the difference between actual pad charge and the charge induced to this pad by all Mathieson distributions | |
151 | // Then the chi2 is calculated as the sum of this value squared for all pad in the cluster. | |
152 | // Arguments: iNpars - number of parameters which is number of local maxima of cluster * 3 | |
153 | // chi2 - function result to be minimised | |
154 | // par - parameters array of size iNpars | |
155 | // Returns: none | |
156 | ||
157 | AliHMPIDCluster *pClu=(AliHMPIDCluster*)TVirtualFitter::GetFitter()->GetObjectFit(); | |
158 | ||
159 | Int_t nPads = pClu->Size(); | |
160 | ||
161 | chi2 = 0; | |
162 | ||
163 | Int_t iNshape = iNpars/3; | |
164 | ||
165 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster | |
166 | Double_t dQpadMath = 0; | |
167 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
168 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
169 | dQpadMath+=par[3*j+2]*fracMathi; // par[3*j+2] is charge par[3*j] is x par[3*j+1] is y of current Mathieson | |
170 | } | |
171 | if(dQpadMath>0 && pClu->Dig(i)->Q()>0) { | |
172 | chi2 +=TMath::Power((pClu->Dig(i)->Q()-dQpadMath),2)/pClu->Dig(i)->Q(); //chi2 function to be minimized | |
173 | } | |
174 | } | |
175 | //---calculate gradients... | |
176 | if(iflag==2) { | |
177 | Double_t **derivPart; | |
178 | ||
179 | derivPart = new Double_t*[iNpars]; | |
180 | ||
181 | for(Int_t j=0;j<iNpars;j++){ | |
182 | deriv[j] = 0; | |
183 | derivPart[j] = new Double_t[nPads]; | |
184 | for(Int_t i=0;i<nPads;i++){ | |
185 | derivPart[j][i] = 0; | |
186 | } | |
187 | } | |
188 | ||
189 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster | |
190 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
191 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
192 | derivPart[3*j ][i] += par[3*j+2]*(pClu->Dig(i)->MathiesonX(par[3*j]-pClu->Dig(i)->LorsX()-0.5*AliHMPIDParam::SizePadX())- | |
193 | pClu->Dig(i)->MathiesonX(par[3*j]-pClu->Dig(i)->LorsX()+0.5*AliHMPIDParam::SizePadX()))* | |
194 | pClu->Dig(i)->IntPartMathiY(par[3*j+1]); | |
195 | derivPart[3*j+1][i] += par[3*j+2]*(pClu->Dig(i)->MathiesonY(par[3*j+1]-pClu->Dig(i)->LorsY()-0.5*AliHMPIDParam::SizePadY())- | |
196 | pClu->Dig(i)->MathiesonY(par[3*j+1]-pClu->Dig(i)->LorsY()+0.5*AliHMPIDParam::SizePadY()))* | |
197 | pClu->Dig(i)->IntPartMathiX(par[3*j]); | |
198 | derivPart[3*j+2][i] += fracMathi; | |
199 | } | |
200 | } | |
201 | //loop on all pads of the cluster | |
202 | for(Int_t i=0;i<nPads;i++){ //loop on all pads of the cluster | |
203 | Double_t dQpadMath = 0; //pad charge collector | |
204 | for(Int_t j=0;j<iNshape;j++){ //Mathiesons loop as all of them may contribute to this pad | |
205 | Double_t fracMathi = pClu->Dig(i)->IntMathieson(par[3*j],par[3*j+1]); | |
206 | dQpadMath+=par[3*j+2]*fracMathi; | |
207 | if(dQpadMath>0 && pClu->Dig(i)->Q()>0) { | |
208 | deriv[3*j] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j ][i]; | |
209 | deriv[3*j+1] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j+1][i]; | |
210 | deriv[3*j+2] += 2/pClu->Dig(i)->Q()*(pClu->Dig(i)->Q()-dQpadMath)*derivPart[3*j+2][i]; | |
211 | } | |
212 | } | |
213 | } | |
214 | //delete array... | |
215 | for(Int_t i=0;i<iNpars;i++) delete [] derivPart[i]; delete [] derivPart; | |
216 | } | |
217 | //---gradient calculations ended | |
218 | ||
219 | // fit ended. Final calculations | |
220 | ||
221 | ||
222 | }//FitFunction() | |
223 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
224 | void AliHMPIDCluster::Print(Option_t* opt)const | |
225 | { | |
226 | //Print current cluster | |
227 | const char *status=0; | |
228 | switch(fSt){ | |
229 | case kFrm : status="formed " ;break; | |
230 | case kUnf : status="unfolded (fit)" ;break; | |
231 | case kCoG : status="coged " ;break; | |
232 | case kLo1 : status="locmax 1 (fit)" ;break; | |
233 | case kMax : status="exceeded (cog)" ;break; | |
234 | case kNot : status="not done (cog)" ;break; | |
235 | case kEmp : status="empty " ;break; | |
236 | case kEdg : status="edge (fit)" ;break; | |
237 | case kSi1 : status="size 1 (cog)" ;break; | |
238 | case kNoLoc: status="no LocMax(fit)" ;break; | |
239 | case kAbn : status="Abnormal fit " ;break; | |
240 | case kBig : status="Big Clu(>100) " ;break; | |
241 | ||
242 | default: status="??????" ;break; | |
243 | } | |
244 | Double_t ratio=0; | |
245 | if(Q()>0&&QRaw()>0) ratio = Q()/QRaw()*100; | |
246 | Printf("%sCLU: ch=%i (%7.3f,%7.3f) Q=%8.3f Qraw=%8.3f(%3.0f%%) Size=%2i DimBox=%i LocMax=%i Chi2=%7.3f %s", | |
247 | opt,Ch(),X(),Y(),Q(),QRaw(),ratio,Size(),fBox,fNlocMax,fChi2,status); | |
248 | if(fDigs) fDigs->Print(); | |
249 | }//Print() | |
250 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
251 | Int_t AliHMPIDCluster::Solve(TClonesArray *pCluLst,Int_t *pSigmaCut, Bool_t isTryUnfold) | |
252 | { | |
253 | //This methode is invoked when the cluster is formed to solve it. Solve the cluster means to try to unfold the cluster | |
254 | //into the local maxima number of clusters. This methode is invoked by AliHMPIDRconstructor::Dig2Clu() on cluster by cluster basis. | |
255 | //At this point, cluster contains a list of digits, cluster charge and size is precalculated in AddDigit(), position is preset to (-1,-1) in ctor, | |
256 | //status is preset to kFormed in AddDigit(), chamber-sector info is preseted to actual values in AddDigit() | |
257 | //Method first finds number of local maxima and if it's more then one tries to unfold this cluster into local maxima number of clusters | |
258 | //Arguments: pCluLst - cluster list pointer where to add new cluster(s) | |
259 | // isTryUnfold - flag to switch on/off unfolding | |
260 | // Returns: number of local maxima of original cluster | |
261 | const Int_t kMaxLocMax=6; //max allowed number of loc max for fitting | |
262 | // | |
263 | CoG(); //First calculate CoG for the given cluster | |
264 | ||
265 | Int_t iCluCnt=pCluLst->GetEntriesFast(); //get current number of clusters already stored in the list by previous operations | |
266 | ||
267 | Int_t rawSize = Size(); //get current raw cluster size | |
268 | ||
269 | if(rawSize>100) { | |
270 | fSt = kBig; | |
271 | } else if(isTryUnfold==kFALSE) { | |
272 | fSt = kNot; | |
273 | } else if(rawSize==1) { | |
274 | fSt = kSi1; | |
275 | } | |
276 | ||
277 | if(rawSize>100 || isTryUnfold==kFALSE || rawSize==1) { //No deconv if: 1 - big cluster (also avoid no zero suppression!) | |
278 | // 2 - flag is set to FALSE | |
279 | SetClusterParams(fXX,fYY,fCh); // 3 - size = 1 | |
280 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add this raw cluster | |
281 | return 1; | |
282 | ||
283 | } | |
284 | ||
285 | //Phase 0. Initialise Fitter | |
286 | Double_t arglist[10]; | |
287 | Int_t ierflg = 0; | |
288 | TVirtualFitter* fitter = TVirtualFitter::Fitter(this,3*6); //initialize Fitter | |
289 | // | |
290 | arglist[0] = -1; | |
291 | ierflg = fitter->ExecuteCommand("SET PRI", arglist, 1); // no printout | |
292 | ierflg = fitter->ExecuteCommand("SET NOW", arglist, 0); //no warning messages | |
293 | arglist[0] = 1; | |
294 | ierflg = fitter->ExecuteCommand("SET GRA", arglist, 1); //force Fitter to use my gradient | |
295 | ||
296 | fitter->SetFCN(AliHMPIDCluster::FitFunc); | |
297 | ||
298 | // arglist[0] = 1; | |
299 | // ierflg = fitter->ExecuteCommand("SET ERR", arglist ,1); | |
300 | ||
301 | // Set starting values and step sizes for parameters | |
302 | ||
303 | //Phase 1. Find number of local maxima. Strategy is to check if the current pad has QDC more then all neigbours. Also find the box contaning the cluster | |
304 | fNlocMax=0; | |
305 | ||
306 | for(Int_t iDig1=0;iDig1<rawSize;iDig1++) { //first digits loop | |
307 | ||
308 | AliHMPIDDigit *pDig1 = Dig(iDig1); //take next digit | |
309 | Int_t iCnt = 0; //counts how many neighbouring pads has QDC more then current one | |
310 | ||
311 | for(Int_t iDig2=0;iDig2<rawSize;iDig2++) { //loop on all digits again | |
312 | ||
313 | if(iDig1==iDig2) continue; //the same digit, no need to compare | |
314 | AliHMPIDDigit *pDig2 = Dig(iDig2); //take second digit to compare with the first one | |
315 | Int_t dist = TMath::Sign(Int_t(pDig1->PadChX()-pDig2->PadChX()),1)+TMath::Sign(Int_t(pDig1->PadChY()-pDig2->PadChY()),1);//distance between pads | |
316 | if(dist==1) //means dig2 is a neighbour of dig1 | |
317 | if(pDig2->Q()>=pDig1->Q()) iCnt++; //count number of pads with Q more then Q of current pad | |
318 | ||
319 | }//second digits loop | |
320 | ||
321 | if(iCnt==0&&fNlocMax<kMaxLocMax){ //this pad has Q more then any neighbour so it's local maximum | |
322 | ||
323 | Double_t xStart=pDig1->LorsX();Double_t yStart=pDig1->LorsY(); | |
324 | Double_t xMin=xStart-fParam->SizePadX(); | |
325 | Double_t xMax=xStart+fParam->SizePadX(); | |
326 | Double_t yMin=yStart-fParam->SizePadY(); | |
327 | Double_t yMax=yStart+fParam->SizePadY(); | |
328 | ||
329 | ierflg = fitter->SetParameter(3*fNlocMax ,Form("x%i",fNlocMax),xStart,0.1,xMin,xMax); // X,Y,Q initial values of the loc max pad | |
330 | ierflg = fitter->SetParameter(3*fNlocMax+1,Form("y%i",fNlocMax),yStart,0.1,yMin,yMax); // X, Y constrained to be near the loc max | |
331 | ierflg = fitter->SetParameter(3*fNlocMax+2,Form("q%i",fNlocMax),pDig1->Q(),0.1,0,10000); // Q constrained to be positive | |
332 | ||
333 | fNlocMax++; | |
334 | ||
335 | }//if this pad is local maximum | |
336 | }//first digits loop | |
337 | ||
338 | //Phase 2. Fit loc max number of Mathiesons or add this current cluster to the list | |
339 | // case 1 -> no loc max found | |
340 | if ( fNlocMax == 0) { // case of no local maxima found: pads with same charge... | |
341 | fNlocMax = 1; | |
342 | fSt=kNoLoc; | |
343 | SetClusterParams(fXX,fYY,fCh); //need to fill the AliCluster3D part | |
344 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add new unfolded cluster | |
345 | return fNlocMax; | |
346 | } | |
347 | ||
348 | // case 2 -> loc max found. Check # of loc maxima | |
349 | if ( fNlocMax >= kMaxLocMax) { | |
350 | SetClusterParams(fXX,fYY,fCh); // if # of local maxima exceeds kMaxLocMax... | |
351 | fSt = kMax; new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //...add this raw cluster | |
352 | } else { //or resonable number of local maxima to fit and user requested it | |
353 | // Now ready for minimization step | |
354 | arglist[0] = 500; //number of steps and sigma on pads charges | |
355 | arglist[1] = 1.; // | |
356 | ||
357 | ierflg = fitter->ExecuteCommand("SIMPLEX",arglist,2); //start fitting with Simplex | |
358 | if (!ierflg) | |
359 | fitter->ExecuteCommand("MIGRAD" ,arglist,2); //fitting improved by Migrad | |
360 | if(ierflg) { | |
361 | Double_t strategy=2; | |
362 | ierflg = fitter->ExecuteCommand("SET STR",&strategy,1); //change level of strategy | |
363 | if(!ierflg) { | |
364 | ierflg = fitter->ExecuteCommand("SIMPLEX",arglist,2); //start fitting with Simplex | |
365 | if (!ierflg) | |
366 | fitter->ExecuteCommand("MIGRAD" ,arglist,2); //fitting improved by Migrad | |
367 | } | |
368 | } | |
369 | if(ierflg) fSt=kAbn; //no convergence of the fit... | |
370 | Double_t dummy; char sName[80]; //vars to get results from Minuit | |
371 | Double_t edm, errdef; | |
372 | Int_t nvpar, nparx; | |
373 | ||
374 | for(Int_t i=0;i<fNlocMax;i++){ //store the local maxima parameters | |
375 | fitter->GetParameter(3*i ,sName, fXX, fErrX , dummy, dummy); // X | |
376 | fitter->GetParameter(3*i+1 ,sName, fYY, fErrY , dummy, dummy); // Y | |
377 | fitter->GetParameter(3*i+2 ,sName, fQ, fErrQ , dummy, dummy); // Q | |
378 | fitter->GetStats(fChi2, edm, errdef, nvpar, nparx); //get fit infos | |
379 | ||
380 | if(fNlocMax>1)FindClusterSize(i,pSigmaCut); //find clustersize for deconvoluted clusters | |
381 | //after this call, fSi temporarly is the calculated size. Later is set again | |
382 | //to its original value | |
383 | if(fSt!=kAbn) { | |
384 | if(fNlocMax!=1)fSt=kUnf; // if unfolded | |
385 | if(fNlocMax==1&&fSt!=kNoLoc) fSt=kLo1; // if only 1 loc max | |
386 | if ( !IsInPc()) fSt = kEdg; // if Out of Pc | |
387 | if(fSt==kNoLoc) fNlocMax=0; // if with no loc max (pads with same charge..) | |
388 | } | |
389 | SetClusterParams(fXX,fYY,fCh); //need to fill the AliCluster3D part | |
390 | new ((*pCluLst)[iCluCnt++]) AliHMPIDCluster(*this); //add new unfolded cluster | |
391 | if(fNlocMax>1)SetSize(rawSize); //Original raw size is set again to its proper value | |
392 | } | |
393 | } | |
394 | ||
395 | return fNlocMax; | |
396 | ||
397 | }//Solve() | |
398 | //++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ | |
399 | void AliHMPIDCluster::FindClusterSize(Int_t i,Int_t *pSigmaCut) | |
400 | { | |
401 | ||
402 | //Estimate of the clustersize for a deconvoluted cluster | |
403 | Int_t size = 0; | |
404 | for(Int_t iDig=0;iDig<Size();iDig++) { //digits loop | |
405 | AliHMPIDDigit *pDig = Dig(iDig); //take digit | |
406 | Int_t iCh = pDig->Ch(); | |
407 | Double_t qPad = Q()*pDig->IntMathieson(X(),Y()); //pad charge | |
408 | AliDebug(1,Form("Chamber %i X %i Y %i SigmaCut %i pad %i qpadMath %8.2f qPadRaw %8.2f Qtotal %8.2f cluster n.%i",iCh,pDig->PadChX(),pDig->PadChY(), | |
409 | pSigmaCut[iCh],iDig,qPad,pDig->Q(),QRaw(),i)); | |
410 | if(qPad>pSigmaCut[iCh]) size++; | |
411 | } | |
412 | AliDebug(1,Form(" Calculated size %i",size)); | |
413 | if(size>0) SetSize(size); //in case of size == 0, original raw clustersize used | |
414 | } |