1 /**************************************************************************
2 * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * Author: The ALICE Off-line Project. *
5 * Contributors are mentioned in the code where appropriate. *
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 **************************************************************************/
21 #include "AliMUONClusterFinderVS.h"
22 #include "AliMUONDigit.h"
23 #include "AliMUONRawCluster.h"
24 #include "AliSegmentation.h"
25 #include "AliMUONResponse.h"
26 #include "AliMUONClusterInput.h"
27 #include "AliMUONHitMapA1.h"
30 //_____________________________________________________________________
31 // This function is minimized in the double-Mathieson fit
32 void fcnS2(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
33 void fcnS1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
34 void fcnCombiS1(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
35 void fcnCombiS2(Int_t &npar, Double_t *gin, Double_t &f, Double_t *par, Int_t iflag);
37 ClassImp(AliMUONClusterFinderVS)
39 AliMUONClusterFinderVS::AliMUONClusterFinderVS()
42 // Default constructor
43 fInput=AliMUONClusterInput::Instance();
46 fTrack[0]=fTrack[1]=-1;
47 fDebugLevel = 0; // make silent default
48 fGhostChi2Cut = 1e6; // nothing done by default
51 for(Int_t i=0; i<100; i++) {
52 for (Int_t j=0; j<2; j++) {
56 fRawClusters = new TClonesArray("AliMUONRawCluster",1000);
59 //____________________________________________________________________________
60 AliMUONClusterFinderVS::~AliMUONClusterFinderVS()
62 // Reset tracks information
65 fRawClusters->Delete();
70 AliMUONClusterFinderVS::AliMUONClusterFinderVS(const AliMUONClusterFinderVS & clusterFinder):TObject(clusterFinder)
72 // Protected copy constructor
74 AliFatal("Not implemented.");
76 //____________________________________________________________________________
77 void AliMUONClusterFinderVS::ResetRawClusters()
79 // Reset tracks information
81 if (fRawClusters) fRawClusters->Clear();
83 //____________________________________________________________________________
84 void AliMUONClusterFinderVS::Decluster(AliMUONRawCluster *cluster)
86 // Decluster by local maxima
87 SplitByLocalMaxima(cluster);
89 //____________________________________________________________________________
90 void AliMUONClusterFinderVS::SplitByLocalMaxima(AliMUONRawCluster *c)
92 // Split complex cluster by local maxima
95 fInput->SetCluster(c);
97 fMul[0]=c->GetMultiplicity(0);
98 fMul[1]=c->GetMultiplicity(1);
101 // dump digit information into arrays
106 for (cath=0; cath<2; cath++) {
108 for (i=0; i<fMul[cath]; i++)
111 fDig[i][cath]=fInput->Digit(cath, c->GetIndex(i, cath));
113 fIx[i][cath]= fDig[i][cath]->PadX();
114 fIy[i][cath]= fDig[i][cath]->PadY();
116 fQ[i][cath] = fDig[i][cath]->Signal();
117 // pad centre coordinates
119 GetPadC(fIx[i][cath], fIy[i][cath], fX[i][cath], fY[i][cath], fZ[i][cath]);
120 } // loop over cluster digits
121 } // loop over cathodes
127 // Initialise and perform mathieson fits
128 Float_t chi2, oldchi2;
129 // ++++++++++++++++++*************+++++++++++++++++++++
130 // (1) No more than one local maximum per cathode plane
131 // +++++++++++++++++++++++++++++++*************++++++++
132 if ((fNLocal[0]==1 && (fNLocal[1]==0 || fNLocal[1]==1)) ||
133 (fNLocal[0]==0 && fNLocal[1]==1)) {
134 // Perform combined single Mathieson fit
135 // Initial values for coordinates (x,y)
137 // One local maximum on cathodes 1 and 2 (X->cathode 2, Y->cathode 1)
138 if (fNLocal[0]==1 && fNLocal[1]==1) {
139 fXInit[0]=c->GetX(1);
140 fYInit[0]=c->GetY(0);
141 // One local maximum on cathode 1 (X,Y->cathode 1)
142 } else if (fNLocal[0]==1) {
143 fXInit[0]=c->GetX(0);
144 fYInit[0]=c->GetY(0);
145 // One local maximum on cathode 2 (X,Y->cathode 2)
147 fXInit[0]=c->GetX(1);
148 fYInit[0]=c->GetY(1);
150 AliDebug(1,"cas (1) CombiSingleMathiesonFit(c)");
151 chi2=CombiSingleMathiesonFit(c);
152 // Int_t ndf = fgNbins[0]+fgNbins[1]-2;
153 // Float_t prob = TMath::Prob(Double_t(chi2),ndf);
154 // prob1->Fill(prob);
155 // chi2_1->Fill(chi2);
157 AliDebug(1,Form(" chi2 %f ",chi2));
159 c->SetX(0, fXFit[0]);
160 c->SetY(0, fYFit[0]);
167 c->SetX(0, fSeg[0]->GetAnod(c->GetX(0)));
168 c->SetX(1, fSeg[1]->GetAnod(c->GetX(1)));
170 // If reasonable chi^2 add result to the list of rawclusters
173 // If not try combined double Mathieson Fit
176 fprintf(stderr," MAUVAIS CHI2 !!!\n");
177 if (fNLocal[0]==1 && fNLocal[1]==1) {
178 fXInit[0]=fX[fIndLocal[0][1]][1];
179 fYInit[0]=fY[fIndLocal[0][0]][0];
180 fXInit[1]=fX[fIndLocal[0][1]][1];
181 fYInit[1]=fY[fIndLocal[0][0]][0];
182 } else if (fNLocal[0]==1) {
183 fXInit[0]=fX[fIndLocal[0][0]][0];
184 fYInit[0]=fY[fIndLocal[0][0]][0];
185 fXInit[1]=fX[fIndLocal[0][0]][0];
186 fYInit[1]=fY[fIndLocal[0][0]][0];
188 fXInit[0]=fX[fIndLocal[0][1]][1];
189 fYInit[0]=fY[fIndLocal[0][1]][1];
190 fXInit[1]=fX[fIndLocal[0][1]][1];
191 fYInit[1]=fY[fIndLocal[0][1]][1];
194 // Initial value for charge ratios
198 fprintf(stderr,"\n cas (1) CombiDoubleMathiesonFit(c)\n");
199 chi2=CombiDoubleMathiesonFit(c);
200 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
201 // Float_t prob = TMath::Prob(chi2,ndf);
202 // prob2->Fill(prob);
203 // chi2_2->Fill(chi2);
205 // Was this any better ??
206 AliDebug(1,Form(" Old and new chi2 %f %f ", oldchi2, chi2));
207 if (fFitStat!=0 && chi2>0 && (2.*chi2 < oldchi2)) {
209 // Split cluster into two according to fit result
212 AliDebug(1,"Do not Split");
218 // +++++++++++++++++++++++++++++++++++++++
219 // (2) Two local maxima per cathode plane
220 // +++++++++++++++++++++++++++++++++++++++
221 } else if (fNLocal[0]==2 && fNLocal[1]==2) {
223 // Let's look for ghosts first
225 Float_t xm[4][2], ym[4][2];
226 Float_t dpx, dpy, dx, dy;
227 Int_t ixm[4][2], iym[4][2];
228 Int_t isec, im1, im2, ico;
230 // Form the 2x2 combinations
231 // 0-0, 0-1, 1-0, 1-1
233 for (im1=0; im1<2; im1++) {
234 for (im2=0; im2<2; im2++) {
235 xm[ico][0]=fX[fIndLocal[im1][0]][0];
236 ym[ico][0]=fY[fIndLocal[im1][0]][0];
237 xm[ico][1]=fX[fIndLocal[im2][1]][1];
238 ym[ico][1]=fY[fIndLocal[im2][1]][1];
240 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
241 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
242 ixm[ico][1]=fIx[fIndLocal[im2][1]][1];
243 iym[ico][1]=fIy[fIndLocal[im2][1]][1];
247 // ico = 0 : first local maximum on cathodes 1 and 2
248 // ico = 1 : fisrt local maximum on cathode 1 and second on cathode 2
249 // ico = 2 : second local maximum on cathode 1 and first on cathode 1
250 // ico = 3 : second local maximum on cathodes 1 and 2
252 // Analyse the combinations and keep those that are possible !
253 // For each combination check consistency in x and y
256 Float_t dr[4] = {1.e4, 1.e4, 1.e4, 1.e4};
259 // In case of staggering maxima are displaced by exactly half the pad-size in y.
260 // We have to take into account the numerical precision in the consistency check;
263 for (ico=0; ico<4; ico++) {
264 accepted[ico]=kFALSE;
265 // cathode one: x-coordinate
266 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
267 dpx=fSeg[0]->Dpx(isec)/2.;
268 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
269 // cathode two: y-coordinate
270 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
271 dpy=fSeg[1]->Dpy(isec)/2.;
272 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
274 printf("\n %i %f %f %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy, dx, dpx );
275 if ((dx <= dpx) && (dy <= dpy+eps)) {
278 dr[ico] = TMath::Sqrt(dx*dx+dy*dy);
282 accepted[ico]=kFALSE;
286 printf("\n iacc= %d:\n", iacc);
288 if (accepted[0] && accepted[1]) {
289 if (dr[0] >= dr[1]) {
296 if (accepted[2] && accepted[3]) {
297 if (dr[2] >= dr[3]) {
304 // eliminate one candidate
308 for (ico=0; ico<4; ico++) {
309 if (accepted[ico] && dr[ico] > drmax) {
315 accepted[icobad] = kFALSE;
322 printf("\n iacc= %d:\n", iacc);
324 fprintf(stderr,"\n iacc=2: No problem ! \n");
325 } else if (iacc==4) {
326 fprintf(stderr,"\n iacc=4: Ok, but ghost problem !!! \n");
327 } else if (iacc==0) {
328 fprintf(stderr,"\n iacc=0: I don't know what to do with this !!!!!!!!! \n");
332 // Initial value for charge ratios
333 fQrInit[0]=Float_t(fQ[fIndLocal[0][0]][0])/
334 Float_t(fQ[fIndLocal[0][0]][0]+fQ[fIndLocal[1][0]][0]);
335 fQrInit[1]=Float_t(fQ[fIndLocal[0][1]][1])/
336 Float_t(fQ[fIndLocal[0][1]][1]+fQ[fIndLocal[1][1]][1]);
338 // ******* iacc = 0 *******
339 // No combinations found between the 2 cathodes
340 // We keep the center of gravity of the cluster
345 // ******* iacc = 1 *******
346 // Only one combination found between the 2 cathodes
348 // Initial values for the 2 maxima (x,y)
350 // 1 maximum is initialised with the maximum of the combination found (X->cathode 2, Y->cathode 1)
351 // 1 maximum is initialised with the other maximum of the first cathode
358 } else if (accepted[1]){
364 } else if (accepted[2]){
370 } else if (accepted[3]){
377 AliDebug(1,"cas (2) CombiDoubleMathiesonFit(c)");
378 chi2=CombiDoubleMathiesonFit(c);
379 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
380 // Float_t prob = TMath::Prob(chi2,ndf);
381 // prob2->Fill(prob);
382 // chi2_2->Fill(chi2);
383 AliDebug(1,Form(" chi2 %f\n",chi2));
385 // If reasonable chi^2 add result to the list of rawclusters
390 // 1 maximum is initialised with the maximum of the combination found (X->cathode 2, Y->cathode 1)
391 // 1 maximum is initialised with the other maximum of the second cathode
398 } else if (accepted[1]){
404 } else if (accepted[2]){
410 } else if (accepted[3]){
417 AliDebug(1,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
418 chi2=CombiDoubleMathiesonFit(c);
419 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
420 // Float_t prob = TMath::Prob(chi2,ndf);
421 // prob2->Fill(prob);
422 // chi2_2->Fill(chi2);
424 fprintf(stderr," chi2 %f\n",chi2);
426 // If reasonable chi^2 add result to the list of rawclusters
430 //We keep only the combination found (X->cathode 2, Y->cathode 1)
431 for (Int_t ico=0; ico<2; ico++) {
433 AliMUONRawCluster cnew;
435 for (cath=0; cath<2; cath++) {
436 cnew.SetX(cath, Float_t(xm[ico][1]));
437 cnew.SetY(cath, Float_t(ym[ico][0]));
438 cnew.SetZ(cath, fZPlane);
440 cnew.SetMultiplicity(cath,c->GetMultiplicity(cath));
441 for (i=0; i<fMul[cath]; i++) {
442 cnew.SetIndex(i, cath, c->GetIndex(i,cath));
443 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
446 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
447 fprintf(stderr,"mult_av %d\n",c->GetMultiplicity(cath));
449 FillCluster(&cnew,cath);
451 cnew.SetClusterType(cnew.PhysicsContribution());
460 // ******* iacc = 2 *******
461 // Two combinations found between the 2 cathodes
463 // Was the same maximum taken twice
464 if ((accepted[0]&&accepted[1]) || (accepted[2]&&accepted[3])) {
465 if (fDebugLevel) fprintf(stderr,"\n Maximum taken twice !!!\n");
467 // Have a try !! with that
468 if (accepted[0]&&accepted[3]) {
480 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
481 chi2=CombiDoubleMathiesonFit(c);
482 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
483 // Float_t prob = TMath::Prob(chi2,ndf);
484 // prob2->Fill(prob);
485 // chi2_2->Fill(chi2);
489 // No ghosts ! No Problems ! - Perform one fit only !
490 if (accepted[0]&&accepted[3]) {
502 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
503 chi2=CombiDoubleMathiesonFit(c);
504 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
505 // Float_t prob = TMath::Prob(chi2,ndf);
506 // prob2->Fill(prob);
507 // chi2_2->Fill(chi2);
509 fprintf(stderr," chi2 %f\n",chi2);
513 // ******* iacc = 4 *******
514 // Four combinations found between the 2 cathodes
516 } else if (iacc==4) {
517 // Perform fits for the two possibilities !!
518 // Accept if charges are compatible on both cathodes
519 // If none are compatible, keep everything
525 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
526 chi2=CombiDoubleMathiesonFit(c);
527 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
528 // Float_t prob = TMath::Prob(chi2,ndf);
529 // prob2->Fill(prob);
530 // chi2_2->Fill(chi2);
532 fprintf(stderr," chi2 %f\n",chi2);
533 // store results of fit and postpone decision
534 Double_t sXFit[2],sYFit[2],sQrFit[2];
536 for (Int_t i=0;i<2;i++) {
547 fprintf(stderr,"\n cas (2) CombiDoubleMathiesonFit(c)\n");
548 chi2=CombiDoubleMathiesonFit(c);
549 // ndf = fgNbins[0]+fgNbins[1]-6;
550 // prob = TMath::Prob(chi2,ndf);
551 // prob2->Fill(prob);
552 // chi2_2->Fill(chi2);
554 fprintf(stderr," chi2 %f\n",chi2);
555 // We have all informations to perform the decision
556 // Compute the chi2 for the 2 possibilities
557 Float_t chi2fi,chi2si,chi2f,chi2s;
559 chi2f = (TMath::Log(fInput->TotalCharge(0)*fQrFit[0]
560 / (fInput->TotalCharge(1)*fQrFit[1]) )
561 / fInput->Response()->ChargeCorrel() );
563 chi2fi = (TMath::Log(fInput->TotalCharge(0)*(1-fQrFit[0])
564 / (fInput->TotalCharge(1)*(1-fQrFit[1])) )
565 / fInput->Response()->ChargeCorrel() );
566 chi2f += chi2fi*chi2fi;
568 chi2s = (TMath::Log(fInput->TotalCharge(0)*sQrFit[0]
569 / (fInput->TotalCharge(1)*sQrFit[1]) )
570 / fInput->Response()->ChargeCorrel() );
572 chi2si = (TMath::Log(fInput->TotalCharge(0)*(1-sQrFit[0])
573 / (fInput->TotalCharge(1)*(1-sQrFit[1])) )
574 / fInput->Response()->ChargeCorrel() );
575 chi2s += chi2si*chi2si;
577 // usefull to store the charge matching chi2 in the cluster
578 // fChi2[0]=sChi2[1]=chi2f;
579 // fChi2[1]=sChi2[0]=chi2s;
581 if (chi2f<=fGhostChi2Cut && chi2s<=fGhostChi2Cut)
583 if (chi2f>fGhostChi2Cut && chi2s>fGhostChi2Cut) {
589 if (chi2f<=fGhostChi2Cut)
591 if (chi2s<=fGhostChi2Cut) {
592 // retreive saved values
593 for (Int_t i=0;i<2;i++) {
604 } else if (fNLocal[0]==2 && fNLocal[1]==1) {
605 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
606 // (3) Two local maxima on cathode 1 and one maximum on cathode 2
607 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
609 Float_t xm[4][2], ym[4][2];
610 Float_t dpx, dpy, dx, dy;
611 Int_t ixm[4][2], iym[4][2];
612 Int_t isec, im1, ico;
614 // Form the 2x2 combinations
615 // 0-0, 0-1, 1-0, 1-1
617 for (im1=0; im1<2; im1++) {
618 xm[ico][0]=fX[fIndLocal[im1][0]][0];
619 ym[ico][0]=fY[fIndLocal[im1][0]][0];
620 xm[ico][1]=fX[fIndLocal[0][1]][1];
621 ym[ico][1]=fY[fIndLocal[0][1]][1];
623 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
624 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
625 ixm[ico][1]=fIx[fIndLocal[0][1]][1];
626 iym[ico][1]=fIy[fIndLocal[0][1]][1];
629 // ico = 0 : first local maximum on cathodes 1 and 2
630 // ico = 1 : second local maximum on cathode 1 and first on cathode 2
632 // Analyse the combinations and keep those that are possible !
633 // For each combination check consistency in x and y
637 // In case of staggering maxima are displaced by exactly half the pad-size in y.
638 // We have to take into account the numerical precision in the consistency check;
642 for (ico=0; ico<2; ico++) {
643 accepted[ico]=kFALSE;
644 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
645 dpx=fSeg[0]->Dpx(isec)/2.;
646 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
647 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
648 dpy=fSeg[1]->Dpy(isec)/2.;
649 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
651 printf("\n %i %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy );
652 if ((dx <= dpx) && (dy <= dpy+eps)) {
658 accepted[ico]=kFALSE;
666 // Initial value for charge ratios
667 fQrInit[0]=Float_t(fQ[fIndLocal[0][0]][0])/
668 Float_t(fQ[fIndLocal[0][0]][0]+fQ[fIndLocal[1][0]][0]);
669 fQrInit[1]=fQrInit[0];
671 if (accepted[0] && accepted[1]) {
673 fXInit[0]=0.5*(xm[0][1]+xm[0][0]);
675 fXInit[1]=0.5*(xm[0][1]+xm[1][0]);
679 chi23=CombiDoubleMathiesonFit(c);
688 } else if (accepted[0]) {
693 chi21=CombiDoubleMathiesonFit(c);
694 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
695 // Float_t prob = TMath::Prob(chi2,ndf);
696 // prob2->Fill(prob);
697 // chi2_2->Fill(chi21);
699 fprintf(stderr," chi2 %f\n",chi21);
700 if (chi21<10) Split(c);
701 } else if (accepted[1]) {
706 chi22=CombiDoubleMathiesonFit(c);
707 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
708 // Float_t prob = TMath::Prob(chi2,ndf);
709 // prob2->Fill(prob);
710 // chi2_2->Fill(chi22);
712 fprintf(stderr," chi2 %f\n",chi22);
713 if (chi22<10) Split(c);
716 if (chi21 > 10 && chi22 > 10 && chi23 > 10) {
717 // We keep only the combination found (X->cathode 2, Y->cathode 1)
718 for (Int_t ico=0; ico<2; ico++) {
720 AliMUONRawCluster cnew;
722 for (cath=0; cath<2; cath++) {
723 cnew.SetX(cath, Float_t(xm[ico][1]));
724 cnew.SetY(cath, Float_t(ym[ico][0]));
725 cnew.SetZ(cath, fZPlane);
726 cnew.SetMultiplicity(cath, c->GetMultiplicity(cath));
727 for (i=0; i<fMul[cath]; i++) {
728 cnew.SetIndex(i, cath, c->GetIndex(i, cath));
729 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
732 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
733 fprintf(stderr,"mult_av %d\n",c->GetMultiplicity(cath));
735 FillCluster(&cnew,cath);
737 cnew.SetClusterType(cnew.PhysicsContribution());
744 // +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
745 // (3') One local maximum on cathode 1 and two maxima on cathode 2
746 // +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
747 } else if (fNLocal[0]==1 && fNLocal[1]==2) {
748 Float_t xm[4][2], ym[4][2];
749 Float_t dpx, dpy, dx, dy;
750 Int_t ixm[4][2], iym[4][2];
751 Int_t isec, im1, ico;
753 // Form the 2x2 combinations
754 // 0-0, 0-1, 1-0, 1-1
756 for (im1=0; im1<2; im1++) {
757 xm[ico][0]=fX[fIndLocal[0][0]][0];
758 ym[ico][0]=fY[fIndLocal[0][0]][0];
759 xm[ico][1]=fX[fIndLocal[im1][1]][1];
760 ym[ico][1]=fY[fIndLocal[im1][1]][1];
762 ixm[ico][0]=fIx[fIndLocal[0][0]][0];
763 iym[ico][0]=fIy[fIndLocal[0][0]][0];
764 ixm[ico][1]=fIx[fIndLocal[im1][1]][1];
765 iym[ico][1]=fIy[fIndLocal[im1][1]][1];
768 // ico = 0 : first local maximum on cathodes 1 and 2
769 // ico = 1 : first local maximum on cathode 1 and second on cathode 2
771 // Analyse the combinations and keep those that are possible !
772 // For each combination check consistency in x and y
776 // In case of staggering maxima are displaced by exactly half the pad-size in y.
777 // We have to take into account the numerical precision in the consistency check;
781 for (ico=0; ico<2; ico++) {
782 accepted[ico]=kFALSE;
783 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
784 dpx=fSeg[0]->Dpx(isec)/2.;
785 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
786 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
787 dpy=fSeg[1]->Dpy(isec)/2.;
788 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
790 printf("\n %i %f %f %f %f \n", ico, ym[ico][0], ym[ico][1], dy, dpy );
791 if ((dx <= dpx) && (dy <= dpy+eps)) {
794 if (fDebugLevel) fprintf(stderr,"ico %d\n",ico);
798 accepted[ico]=kFALSE;
806 fQrInit[1]=Float_t(fQ[fIndLocal[0][1]][1])/
807 Float_t(fQ[fIndLocal[0][1]][1]+fQ[fIndLocal[1][1]][1]);
809 fQrInit[0]=fQrInit[1];
812 if (accepted[0] && accepted[1]) {
814 fYInit[0]=0.5*(ym[0][0]+ym[0][1]);
816 fYInit[1]=0.5*(ym[0][0]+ym[1][1]);
819 chi23=CombiDoubleMathiesonFit(c);
828 } else if (accepted[0]) {
833 chi21=CombiDoubleMathiesonFit(c);
834 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
835 // Float_t prob = TMath::Prob(chi2,ndf);
836 // prob2->Fill(prob);
837 // chi2_2->Fill(chi21);
839 fprintf(stderr," chi2 %f\n",chi21);
840 if (chi21<10) Split(c);
841 } else if (accepted[1]) {
846 chi22=CombiDoubleMathiesonFit(c);
847 // Int_t ndf = fgNbins[0]+fgNbins[1]-6;
848 // Float_t prob = TMath::Prob(chi2,ndf);
849 // prob2->Fill(prob);
850 // chi2_2->Fill(chi22);
852 fprintf(stderr," chi2 %f\n",chi22);
853 if (chi22<10) Split(c);
856 if (chi21 > 10 && chi22 > 10 && chi23 > 10) {
857 //We keep only the combination found (X->cathode 2, Y->cathode 1)
858 for (Int_t ico=0; ico<2; ico++) {
860 AliMUONRawCluster cnew;
862 for (cath=0; cath<2; cath++) {
863 cnew.SetX(cath, Float_t(xm[ico][1]));
864 cnew.SetY(cath, Float_t(ym[ico][0]));
865 cnew.SetZ(cath, fZPlane);
866 cnew.SetMultiplicity(cath, c->GetMultiplicity(cath));
867 for (i=0; i<fMul[cath]; i++) {
868 cnew.SetIndex(i, cath, c->GetIndex(i, cath));
869 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
872 fprintf(stderr,"\nRawCluster %d cath %d\n",ico,cath);
873 fprintf(stderr,"mult_av %d\n",c->GetMultiplicity(cath));
875 FillCluster(&cnew,cath);
877 cnew.SetClusterType(cnew.PhysicsContribution());
884 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
885 // (4) At least three local maxima on cathode 1 or on cathode 2
886 // ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
887 } else if (fNLocal[0]>2 || fNLocal[1]>2) {
888 Int_t param = fNLocal[0]*fNLocal[1];
891 Float_t ** xm = new Float_t * [param];
892 for (ii=0; ii<param; ii++) xm[ii]=new Float_t [2];
893 Float_t ** ym = new Float_t * [param];
894 for (ii=0; ii<param; ii++) ym[ii]=new Float_t [2];
895 Int_t ** ixm = new Int_t * [param];
896 for (ii=0; ii<param; ii++) ixm[ii]=new Int_t [2];
897 Int_t ** iym = new Int_t * [param];
898 for (ii=0; ii<param; ii++) iym[ii]=new Int_t [2];
901 Float_t dpx, dpy, dx, dy;
904 for (Int_t im1=0; im1<fNLocal[0]; im1++) {
905 for (Int_t im2=0; im2<fNLocal[1]; im2++) {
906 xm[ico][0]=fX[fIndLocal[im1][0]][0];
907 ym[ico][0]=fY[fIndLocal[im1][0]][0];
908 xm[ico][1]=fX[fIndLocal[im2][1]][1];
909 ym[ico][1]=fY[fIndLocal[im2][1]][1];
911 ixm[ico][0]=fIx[fIndLocal[im1][0]][0];
912 iym[ico][0]=fIy[fIndLocal[im1][0]][0];
913 ixm[ico][1]=fIx[fIndLocal[im2][1]][1];
914 iym[ico][1]=fIy[fIndLocal[im2][1]][1];
921 fprintf(stderr,"nIco %d\n",nIco);
922 for (ico=0; ico<nIco; ico++) {
924 fprintf(stderr,"ico = %d\n",ico);
925 isec=fSeg[0]->Sector(ixm[ico][0], iym[ico][0]);
926 dpx=fSeg[0]->Dpx(isec)/2.;
927 dx=TMath::Abs(xm[ico][0]-xm[ico][1]);
928 isec=fSeg[1]->Sector(ixm[ico][1], iym[ico][1]);
929 dpy=fSeg[1]->Dpy(isec)/2.;
930 dy=TMath::Abs(ym[ico][0]-ym[ico][1]);
932 fprintf(stderr,"dx %f dpx %f dy %f dpy %f\n",dx,dpx,dy,dpy);
933 fprintf(stderr," X %f Y %f\n",xm[ico][1],ym[ico][0]);
935 if ((dx <= dpx) && (dy <= dpy)) {
937 fprintf(stderr,"ok\n");
939 AliMUONRawCluster cnew;
940 for (cath=0; cath<2; cath++) {
941 cnew.SetX(cath, Float_t(xm[ico][1]));
942 cnew.SetY(cath, Float_t(ym[ico][0]));
943 cnew.SetZ(cath, fZPlane);
944 cnew.SetMultiplicity(cath, c->GetMultiplicity(cath));
945 for (i=0; i<fMul[cath]; i++) {
946 cnew.SetIndex(i, cath, c->GetIndex(i, cath));
947 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
949 FillCluster(&cnew,cath);
951 cnew.SetClusterType(cnew.PhysicsContribution());
963 void AliMUONClusterFinderVS::FindLocalMaxima(AliMUONRawCluster* /*c*/)
965 // Find all local maxima of a cluster
967 printf("\n Find Local maxima !");
971 Int_t cath, cath1; // loops over cathodes
972 Int_t i; // loops over digits
973 Int_t j; // loops over cathodes
977 // counters for number of local maxima
978 fNLocal[0]=fNLocal[1]=0;
979 // flags digits as local maximum
980 Bool_t isLocal[100][2];
981 for (i=0; i<100;i++) {
982 isLocal[i][0]=isLocal[i][1]=kFALSE;
984 // number of next neighbours and arrays to store them
987 // loop over cathodes
988 for (cath=0; cath<2; cath++) {
989 // loop over cluster digits
990 for (i=0; i<fMul[cath]; i++) {
991 // get neighbours for that digit and assume that it is local maximum
992 fSeg[cath]->Neighbours(fIx[i][cath], fIy[i][cath], &nn, x, y);
993 isLocal[i][cath]=kTRUE;
994 Int_t isec= fSeg[cath]->Sector(fIx[i][cath], fIy[i][cath]);
995 Float_t a0 = fSeg[cath]->Dpx(isec)*fSeg[cath]->Dpy(isec);
996 // loop over next neighbours, if at least one neighbour has higher charger assumption
997 // digit is not local maximum
998 for (j=0; j<nn; j++) {
999 if (fHitMap[cath]->TestHit(x[j], y[j])==kEmpty) continue;
1000 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(x[j], y[j]);
1001 isec=fSeg[cath]->Sector(x[j], y[j]);
1002 Float_t a1 = fSeg[cath]->Dpx(isec)*fSeg[cath]->Dpy(isec);
1003 if (digt->Signal()/a1 > fQ[i][cath]/a0) {
1004 isLocal[i][cath]=kFALSE;
1007 // handle special case of neighbouring pads with equal signal
1008 } else if (digt->Signal() == fQ[i][cath]) {
1009 if (fNLocal[cath]>0) {
1010 for (Int_t k=0; k<fNLocal[cath]; k++) {
1011 if (x[j]==fIx[fIndLocal[k][cath]][cath]
1012 && y[j]==fIy[fIndLocal[k][cath]][cath])
1014 isLocal[i][cath]=kFALSE;
1016 } // loop over local maxima
1017 } // are there already local maxima
1019 } // loop over next neighbours
1020 if (isLocal[i][cath]) {
1021 fIndLocal[fNLocal[cath]][cath]=i;
1024 } // loop over all digits
1025 } // loop over cathodes
1028 printf("\n Found %d %d %d %d local Maxima\n",
1029 fNLocal[0], fNLocal[1], fMul[0], fMul[1]);
1030 fprintf(stderr,"\n Cathode 1 local Maxima %d Multiplicite %d\n",fNLocal[0], fMul[0]);
1031 fprintf(stderr," Cathode 2 local Maxima %d Multiplicite %d\n",fNLocal[1], fMul[1]);
1037 if (fNLocal[1]==2 && (fNLocal[0]==1 || fNLocal[0]==0)) {
1038 Int_t iback=fNLocal[0];
1040 // Two local maxima on cathode 2 and one maximum on cathode 1
1041 // Look for local maxima considering up and down neighbours on the 1st cathode only
1043 // Loop over cluster digits
1047 for (i=0; i<fMul[cath]; i++) {
1048 isec=fSeg[cath]->Sector(fIx[i][cath],fIy[i][cath]);
1049 dpy=fSeg[cath]->Dpy(isec);
1050 dpx=fSeg[cath]->Dpx(isec);
1051 if (isLocal[i][cath]) continue;
1052 // Pad position should be consistent with position of local maxima on the opposite cathode
1053 if ((TMath::Abs(fX[i][cath]-fX[fIndLocal[0][cath1]][cath1]) > dpx/2.) &&
1054 (TMath::Abs(fX[i][cath]-fX[fIndLocal[1][cath1]][cath1]) > dpx/2.))
1057 // get neighbours for that digit and assume that it is local maximum
1058 isLocal[i][cath]=kTRUE;
1059 // compare signal to that on the two neighbours on the left and on the right
1060 // iNN counts the number of neighbours with signal, it should be 1 or 2
1064 ->FirstPad(fX[i][cath], fY[i][cath], fZPlane, 0., dpy);
1070 ix = fSeg[cath]->Ix();
1071 iy = fSeg[cath]->Iy();
1072 // skip the current pad
1073 if (iy == fIy[i][cath]) continue;
1075 if (fHitMap[cath]->TestHit(ix, iy)!=kEmpty) {
1077 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(ix,iy);
1078 if (digt->Signal() > fQ[i][cath]) isLocal[i][cath]=kFALSE;
1080 } // Loop over pad neighbours in y
1081 if (isLocal[i][cath] && iNN>0) {
1082 fIndLocal[fNLocal[cath]][cath]=i;
1085 } // loop over all digits
1086 // if one additional maximum has been found we are happy
1087 // if more maxima have been found restore the previous situation
1090 "\n New search gives %d local maxima for cathode 1 \n",
1093 " %d local maxima for cathode 2 \n",
1096 if (fNLocal[cath]>2) {
1097 fNLocal[cath]=iback;
1100 } // 1,2 local maxima
1102 if (fNLocal[0]==2 && (fNLocal[1]==1 || fNLocal[1]==0)) {
1103 Int_t iback=fNLocal[1];
1105 // Two local maxima on cathode 1 and one maximum on cathode 2
1106 // Look for local maxima considering left and right neighbours on the 2nd cathode only
1109 Float_t eps = 1.e-5;
1112 // Loop over cluster digits
1113 for (i=0; i<fMul[cath]; i++) {
1114 isec=fSeg[cath]->Sector(fIx[i][cath],fIy[i][cath]);
1115 dpx=fSeg[cath]->Dpx(isec);
1116 dpy=fSeg[cath]->Dpy(isec);
1117 if (isLocal[i][cath]) continue;
1118 // Pad position should be consistent with position of local maxima on the opposite cathode
1119 if ((TMath::Abs(fY[i][cath]-fY[fIndLocal[0][cath1]][cath1]) > dpy/2.+eps) &&
1120 (TMath::Abs(fY[i][cath]-fY[fIndLocal[1][cath1]][cath1]) > dpy/2.+eps))
1124 // get neighbours for that digit and assume that it is local maximum
1125 isLocal[i][cath]=kTRUE;
1126 // compare signal to that on the two neighbours on the left and on the right
1128 // iNN counts the number of neighbours with signal, it should be 1 or 2
1131 ->FirstPad(fX[i][cath], fY[i][cath], fZPlane, dpx, 0.);
1138 ix = fSeg[cath]->Ix();
1139 iy = fSeg[cath]->Iy();
1141 // skip the current pad
1142 if (ix == fIx[i][cath]) continue;
1144 if (fHitMap[cath]->TestHit(ix, iy)!=kEmpty) {
1146 digt=(AliMUONDigit*) fHitMap[cath]->GetHit(ix,iy);
1147 if (digt->Signal() > fQ[i][cath]) isLocal[i][cath]=kFALSE;
1149 } // Loop over pad neighbours in x
1150 if (isLocal[i][cath] && iNN>0) {
1151 fIndLocal[fNLocal[cath]][cath]=i;
1154 } // loop over all digits
1155 // if one additional maximum has been found we are happy
1156 // if more maxima have been found restore the previous situation
1158 fprintf(stderr,"\n New search gives %d local maxima for cathode 1 \n",fNLocal[0]);
1159 fprintf(stderr,"\n %d local maxima for cathode 2 \n",fNLocal[1]);
1160 printf("\n New search gives %d %d \n",fNLocal[0],fNLocal[1]);
1162 if (fNLocal[cath]>2) {
1163 fNLocal[cath]=iback;
1165 } // 2,1 local maxima
1169 void AliMUONClusterFinderVS::FillCluster(AliMUONRawCluster* c, Int_t flag, Int_t cath)
1172 // Completes cluster information starting from list of digits
1179 c->SetPeakSignal(cath,c->GetPeakSignal(0));
1181 c->SetPeakSignal(cath,0);
1188 c->SetCharge(cath,0);
1192 fprintf(stderr,"\n fPeakSignal %d\n",c->GetPeakSignal(cath));
1193 for (Int_t i=0; i<c->GetMultiplicity(cath); i++)
1195 dig= fInput->Digit(cath,c->GetIndex(i,cath));
1196 ix=dig->PadX()+c->GetOffset(i,cath);
1198 Int_t q=dig->Signal();
1199 if (!flag) q=Int_t(q*c->GetContrib(i,cath));
1200 // fprintf(stderr,"q %d c->fPeakSignal[ %d ] %d\n",q,cath,c->fPeakSignal[cath]);
1201 if (dig->Physics() >= dig->Signal()) {
1203 } else if (dig->Physics() == 0) {
1205 } else c->SetPhysics(i,1);
1209 fprintf(stderr,"q %d c->fPeakSignal[cath] %d\n",q,c->GetPeakSignal(cath));
1210 // peak signal and track list
1211 if (q>c->GetPeakSignal(cath)) {
1212 c->SetPeakSignal(cath, q);
1213 c->SetTrack(0,dig->Hit());
1214 c->SetTrack(1,dig->Track(0));
1215 c->SetTrack(2,dig->Track(1));
1216 // fprintf(stderr," c->fTracks[0] %d c->fTracks[1] %d\n",dig->fHit,dig->fTracks[0]);
1220 fSeg[cath]->GetPadC(ix, iy, x, y, z);
1223 c->AddCharge(cath, q);
1225 } // loop over digits
1227 fprintf(stderr," fin du cluster c\n");
1231 c->SetX(cath, c->GetX(cath)/c->GetCharge(cath));
1233 c->SetX(cath, fSeg[cath]->GetAnod(c->GetX(cath)));
1234 c->SetY(cath, c->GetY(cath)/c->GetCharge(cath));
1236 // apply correction to the coordinate along the anode wire
1240 fSeg[cath]->GetPadI(x, y, fZPlane, ix, iy);
1241 fSeg[cath]->GetPadC(ix, iy, x, y, z);
1242 Int_t isec=fSeg[cath]->Sector(ix,iy);
1243 TF1* cogCorr = fSeg[cath]->CorrFunc(isec-1);
1246 Float_t yOnPad=(c->GetY(cath)-y)/fSeg[cath]->Dpy(isec);
1247 c->SetY(cath, c->GetY(cath)-cogCorr->Eval(yOnPad, 0, 0));
1252 void AliMUONClusterFinderVS::FillCluster(AliMUONRawCluster* c, Int_t cath)
1255 // Completes cluster information starting from list of digits
1265 Float_t xpad, ypad, zpad;
1268 for (Int_t i=0; i<c->GetMultiplicity(cath); i++)
1270 dig = fInput->Digit(cath,c->GetIndex(i,cath));
1272 GetPadC(dig->PadX(),dig->PadY(),xpad,ypad, zpad);
1274 fprintf(stderr,"x %f y %f cx %f cy %f\n",xpad,ypad,c->GetX(0),c->GetY(0));
1275 dx = xpad - c->GetX(0);
1276 dy = ypad - c->GetY(0);
1277 dr = TMath::Sqrt(dx*dx+dy*dy);
1282 fprintf(stderr," dr %f\n",dr);
1283 Int_t q=dig->Signal();
1284 if (dig->Physics() >= dig->Signal()) {
1286 } else if (dig->Physics() == 0) {
1288 } else c->SetPhysics(i,1);
1289 c->SetPeakSignal(cath,q);
1290 c->SetTrack(0,dig->Hit());
1291 c->SetTrack(1,dig->Track(0));
1292 c->SetTrack(2,dig->Track(1));
1294 fprintf(stderr," c->fTracks[0] %d c->fTracks[1] %d\n",dig->Hit(),
1298 } // loop over digits
1300 // apply correction to the coordinate along the anode wire
1302 c->SetX(cath,fSeg[cath]->GetAnod(c->GetX(cath)));
1305 void AliMUONClusterFinderVS::FindCluster(Int_t i, Int_t j, Int_t cath, AliMUONRawCluster &c){
1309 // Find a super cluster on both cathodes
1312 // Add i,j as element of the cluster
1315 Int_t idx = fHitMap[cath]->GetHitIndex(i,j);
1316 AliMUONDigit* dig = (AliMUONDigit*) fHitMap[cath]->GetHit(i,j);
1317 Int_t q=dig->Signal();
1318 Int_t theX=dig->PadX();
1319 Int_t theY=dig->PadY();
1321 if (q > TMath::Abs(c.GetPeakSignal(0)) && q > TMath::Abs(c.GetPeakSignal(1))) {
1322 c.SetPeakSignal(cath,q);
1323 c.SetTrack(0,dig->Hit());
1324 c.SetTrack(1,dig->Track(0));
1325 c.SetTrack(2,dig->Track(1));
1329 // Make sure that list of digits is ordered
1331 Int_t mu=c.GetMultiplicity(cath);
1332 c.SetIndex(mu, cath, idx);
1334 if (dig->Physics() >= dig->Signal()) {
1336 } else if (dig->Physics() == 0) {
1338 } else c.SetPhysics(mu,1);
1342 for (Int_t ind = mu-1; ind >= 0; ind--) {
1343 Int_t ist=c.GetIndex(ind,cath);
1344 Int_t ql=fInput->Digit(cath, ist)->Signal();
1345 Int_t ix=fInput->Digit(cath, ist)->PadX();
1346 Int_t iy=fInput->Digit(cath, ist)->PadY();
1348 if (q>ql || (q==ql && theX > ix && theY < iy)) {
1349 c.SetIndex(ind, cath, idx);
1350 c.SetIndex(ind+1, cath, ist);
1358 c.SetMultiplicity(cath, c.GetMultiplicity(cath)+1);
1359 if (c.GetMultiplicity(cath) >= 50 ) {
1361 printf("FindCluster - multiplicity >50 %d \n",c.GetMultiplicity(0));
1362 c.SetMultiplicity(cath, 49);
1365 // Prepare center of gravity calculation
1367 fSeg[cath]->GetPadC(i, j, x, y, z);
1371 c.AddCharge(cath,q);
1373 // Flag hit as "taken"
1374 fHitMap[cath]->FlagHit(i,j);
1376 // Now look recursively for all neighbours and pad hit on opposite cathode
1378 // Loop over neighbours
1382 Int_t xList[10], yList[10];
1383 fSeg[cath]->Neighbours(i,j,&nn,xList,yList);
1384 for (Int_t in=0; in<nn; in++) {
1388 if (fHitMap[cath]->TestHit(ix,iy)==kUnused) {
1390 printf("\n Neighbours %d %d %d", cath, ix, iy);
1391 FindCluster(ix, iy, cath, c);
1396 Int_t iXopp[50], iYopp[50];
1398 // Neighbours on opposite cathode
1399 // Take into account that several pads can overlap with the present pad
1400 Int_t isec=fSeg[cath]->Sector(i,j);
1406 dx = (fSeg[cath]->Dpx(isec))/2.;
1411 dy = (fSeg[cath]->Dpy(isec))/2;
1413 // loop over pad neighbours on opposite cathode
1414 for (fSeg[iop]->FirstPad(x, y, fZPlane, dx, dy);
1415 fSeg[iop]->MorePads();
1416 fSeg[iop]->NextPad())
1419 ix = fSeg[iop]->Ix(); iy = fSeg[iop]->Iy();
1420 if (fDebugLevel > 1)
1421 printf("\n ix, iy: %f %f %f %d %d %d", x,y,z,ix, iy, fSector);
1422 if (fHitMap[iop]->TestHit(ix,iy)==kUnused){
1425 if (fDebugLevel > 1)
1426 printf("\n Opposite %d %d %d", iop, ix, iy);
1429 } // Loop over pad neighbours
1430 // This had to go outside the loop since recursive calls inside the iterator are not possible
1433 for (jopp=0; jopp<nOpp; jopp++) {
1434 if (fHitMap[iop]->TestHit(iXopp[jopp],iYopp[jopp]) == kUnused)
1435 FindCluster(iXopp[jopp], iYopp[jopp], iop, c);
1439 //_____________________________________________________________________________
1441 void AliMUONClusterFinderVS::FindRawClusters()
1444 // MUON cluster finder from digits -- finds neighbours on both cathodes and
1445 // fills the tree with raw clusters
1449 // Return if no input datad available
1450 if (!fInput->NDigits(0) && !fInput->NDigits(1)) return;
1452 fSeg[0] = fInput->Segmentation(0);
1453 fSeg[1] = fInput->Segmentation(1);
1455 fHitMap[0] = new AliMUONHitMapA1(fSeg[0], fInput->Digits(0));
1456 fHitMap[1] = new AliMUONHitMapA1(fSeg[1], fInput->Digits(1));
1464 fHitMap[0]->FillHits();
1465 fHitMap[1]->FillHits();
1467 // Outer Loop over Cathodes
1468 for (cath=0; cath<2; cath++) {
1469 for (ndig=0; ndig<fInput->NDigits(cath); ndig++) {
1470 dig = fInput->Digit(cath, ndig);
1471 Int_t i=dig->PadX();
1472 Int_t j=dig->PadY();
1473 if (fHitMap[cath]->TestHit(i,j)==kUsed ||fHitMap[0]->TestHit(i,j)==kEmpty) {
1478 fprintf(stderr,"\n CATHODE %d CLUSTER %d\n",cath,ncls);
1479 AliMUONRawCluster c;
1480 c.SetMultiplicity(0, 0);
1481 c.SetMultiplicity(1, 0);
1482 c.SetPeakSignal(cath,dig->Signal());
1483 c.SetTrack(0, dig->Hit());
1484 c.SetTrack(1, dig->Track(0));
1485 c.SetTrack(2, dig->Track(1));
1486 // tag the beginning of cluster list in a raw cluster
1487 c.SetNcluster(0,-1);
1489 fSeg[cath]->GetPadC(i,j,xcu, ycu, fZPlane);
1490 fSector= fSeg[cath]->Sector(i,j)/100;
1492 printf("\n New Seed %d %d ", i,j);
1495 FindCluster(i,j,cath,c);
1496 // ^^^^^^^^^^^^^^^^^^^^^^^^
1497 // center of gravity
1498 if (c.GetX(0)!=0.) c.SetX(0, c.GetX(0)/c.GetCharge(0)); // c.fX[0] /= c.fQ[0];
1500 c.SetX(0,fSeg[0]->GetAnod(c.GetX(0)));
1501 if (c.GetY(0)!=0.) c.SetY(0, c.GetY(0)/c.GetCharge(0)); // c.fY[0] /= c.fQ[0];
1503 if(c.GetCharge(1)!=0.) c.SetX(1, c.GetX(1)/c.GetCharge(1)); // c.fX[1] /= c.fQ[1];
1506 c.SetX(1, fSeg[0]->GetAnod(c.GetX(1)));
1507 if(c.GetCharge(1)!=0.) c.SetY(1, c.GetY(1)/c.GetCharge(1));// c.fY[1] /= c.fQ[1];
1513 fprintf(stderr,"\n Cathode 1 multiplicite %d X(CG) %f Y(CG) %f\n",
1514 c.GetMultiplicity(0),c.GetX(0),c.GetY(0));
1515 fprintf(stderr," Cathode 2 multiplicite %d X(CG) %f Y(CG) %f\n",
1516 c.GetMultiplicity(1),c.GetX(1),c.GetY(1));
1518 // Analyse cluster and decluster if necessary
1521 c.SetNcluster(1,fNRawClusters);
1522 c.SetClusterType(c.PhysicsContribution());
1529 // reset Cluster object
1530 { // begin local scope
1531 for (int k=0;k<c.GetMultiplicity(0);k++) c.SetIndex(k, 0, 0);
1532 } // end local scope
1534 { // begin local scope
1535 for (int k=0;k<c.GetMultiplicity(1);k++) c.SetIndex(k, 1, 0);
1536 } // end local scope
1538 c.SetMultiplicity(0,0);
1539 c.SetMultiplicity(1,0);
1543 } // end loop cathodes
1548 Float_t AliMUONClusterFinderVS::SingleMathiesonFit(AliMUONRawCluster *c, Int_t cath)
1550 // Performs a single Mathieson fit on one cathode
1552 Double_t arglist[20];
1554 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1556 clusterInput.Fitter()->SetFCN(fcnS1);
1557 clusterInput.Fitter()->mninit(2,10,7);
1558 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1560 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1561 // Set starting values
1562 static Double_t vstart[2];
1563 vstart[0]=c->GetX(1);
1564 vstart[1]=c->GetY(0);
1567 // lower and upper limits
1568 static Double_t lower[2], upper[2];
1570 fSeg[cath]->GetPadI(c->GetX(cath), c->GetY(cath), fZPlane, ix, iy);
1571 Int_t isec=fSeg[cath]->Sector(ix, iy);
1572 lower[0]=vstart[0]-fSeg[cath]->Dpx(isec)/2;
1573 lower[1]=vstart[1]-fSeg[cath]->Dpy(isec)/2;
1575 upper[0]=lower[0]+fSeg[cath]->Dpx(isec);
1576 upper[1]=lower[1]+fSeg[cath]->Dpy(isec);
1579 static Double_t step[2]={0.0005, 0.0005};
1581 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1582 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1583 // ready for minimisation
1587 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1588 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1589 // clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1590 Double_t fmin, fedm, errdef;
1591 Int_t npari, nparx, istat;
1593 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1597 // Get fitted parameters
1598 Double_t xrec, yrec;
1600 Double_t epxz, b1, b2;
1602 clusterInput.Fitter()->mnpout(0, chname, xrec, epxz, b1, b2, ierflg);
1603 clusterInput.Fitter()->mnpout(1, chname, yrec, epxz, b1, b2, ierflg);
1609 Float_t AliMUONClusterFinderVS::CombiSingleMathiesonFit(AliMUONRawCluster * /*c*/)
1611 // Perform combined Mathieson fit on both cathode planes
1613 Double_t arglist[20];
1615 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1616 clusterInput.Fitter()->SetFCN(fcnCombiS1);
1617 clusterInput.Fitter()->mninit(2,10,7);
1618 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1620 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1621 static Double_t vstart[2];
1622 vstart[0]=fXInit[0];
1623 vstart[1]=fYInit[0];
1626 // lower and upper limits
1627 static Float_t lower[2], upper[2];
1629 fSeg[0]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1630 isec=fSeg[0]->Sector(ix, iy);
1631 Float_t dpy=fSeg[0]->Dpy(isec);
1632 fSeg[1]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1633 isec=fSeg[1]->Sector(ix, iy);
1634 Float_t dpx=fSeg[1]->Dpx(isec);
1637 Float_t xdum, ydum, zdum;
1639 // Find save upper and lower limits
1643 for (fSeg[1]->FirstPad(fXInit[0], fYInit[0], fZPlane, dpx, 0.);
1644 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1646 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1647 fSeg[1]->GetPadC(ix,iy, upper[0], ydum, zdum);
1648 if (icount ==0) lower[0]=upper[0];
1652 if (lower[0]>upper[0]) {xdum=lower[0]; lower[0]=upper[0]; upper[0]=xdum;}
1656 printf("\n single y %f %f", fXInit[0], fYInit[0]);
1658 for (fSeg[0]->FirstPad(fXInit[0], fYInit[0], fZPlane, 0., dpy);
1659 fSeg[0]->MorePads(); fSeg[0]->NextPad())
1661 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1662 fSeg[0]->GetPadC(ix,iy,xdum,upper[1],zdum);
1663 if (icount ==0) lower[1]=upper[1];
1666 printf("\n upper lower %d %f %f", icount, upper[1], lower[1]);
1669 if (lower[1]>upper[1]) {xdum=lower[1]; lower[1]=upper[1]; upper[1]=xdum;}
1672 static Double_t step[2]={0.00001, 0.0001};
1674 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1675 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1676 // ready for minimisation
1680 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1681 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1682 // clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1683 Double_t fmin, fedm, errdef;
1684 Int_t npari, nparx, istat;
1686 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1690 // Get fitted parameters
1691 Double_t xrec, yrec;
1693 Double_t epxz, b1, b2;
1695 clusterInput.Fitter()->mnpout(0, chname, xrec, epxz, b1, b2, ierflg);
1696 clusterInput.Fitter()->mnpout(1, chname, yrec, epxz, b1, b2, ierflg);
1702 Bool_t AliMUONClusterFinderVS::DoubleMathiesonFit(AliMUONRawCluster * /*c*/, Int_t cath)
1704 // Performs a double Mathieson fit on one cathode
1708 // Initialise global variables for fit
1709 Double_t arglist[20];
1711 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1712 clusterInput.Fitter()->SetFCN(fcnS2);
1713 clusterInput.Fitter()->mninit(5,10,7);
1714 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1716 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1717 // Set starting values
1718 static Double_t vstart[5];
1719 vstart[0]=fX[fIndLocal[0][cath]][cath];
1720 vstart[1]=fY[fIndLocal[0][cath]][cath];
1721 vstart[2]=fX[fIndLocal[1][cath]][cath];
1722 vstart[3]=fY[fIndLocal[1][cath]][cath];
1723 vstart[4]=Float_t(fQ[fIndLocal[0][cath]][cath])/
1724 Float_t(fQ[fIndLocal[0][cath]][cath]+fQ[fIndLocal[1][cath]][cath]);
1725 // lower and upper limits
1726 static Float_t lower[5], upper[5];
1727 Int_t isec=fSeg[cath]->Sector(fIx[fIndLocal[0][cath]][cath], fIy[fIndLocal[0][cath]][cath]);
1728 lower[0]=vstart[0]-fSeg[cath]->Dpx(isec);
1729 lower[1]=vstart[1]-fSeg[cath]->Dpy(isec);
1731 upper[0]=lower[0]+2.*fSeg[cath]->Dpx(isec);
1732 upper[1]=lower[1]+2.*fSeg[cath]->Dpy(isec);
1734 isec=fSeg[cath]->Sector(fIx[fIndLocal[1][cath]][cath], fIy[fIndLocal[1][cath]][cath]);
1735 lower[2]=vstart[2]-fSeg[cath]->Dpx(isec)/2;
1736 lower[3]=vstart[3]-fSeg[cath]->Dpy(isec)/2;
1738 upper[2]=lower[2]+fSeg[cath]->Dpx(isec);
1739 upper[3]=lower[3]+fSeg[cath]->Dpy(isec);
1744 static Double_t step[5]={0.0005, 0.0005, 0.0005, 0.0005, 0.0001};
1746 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1747 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1748 clusterInput.Fitter()->mnparm(2,"x2",vstart[2],step[2],lower[2],upper[2],ierflag);
1749 clusterInput.Fitter()->mnparm(3,"y2",vstart[3],step[3],lower[3],upper[3],ierflag);
1750 clusterInput.Fitter()->mnparm(4,"a0",vstart[4],step[4],lower[4],upper[4],ierflag);
1751 // ready for minimisation
1755 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1756 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1757 // clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1758 // Get fitted parameters
1759 Double_t xrec[2], yrec[2], qfrac;
1761 Double_t epxz, b1, b2;
1763 clusterInput.Fitter()->mnpout(0, chname, xrec[0], epxz, b1, b2, ierflg);
1764 clusterInput.Fitter()->mnpout(1, chname, yrec[0], epxz, b1, b2, ierflg);
1765 clusterInput.Fitter()->mnpout(2, chname, xrec[1], epxz, b1, b2, ierflg);
1766 clusterInput.Fitter()->mnpout(3, chname, yrec[1], epxz, b1, b2, ierflg);
1767 clusterInput.Fitter()->mnpout(4, chname, qfrac, epxz, b1, b2, ierflg);
1769 Double_t fmin, fedm, errdef;
1770 Int_t npari, nparx, istat;
1772 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1777 Float_t AliMUONClusterFinderVS::CombiDoubleMathiesonFit(AliMUONRawCluster * /*c*/)
1780 // Perform combined double Mathieson fit on both cathode planes
1782 Double_t arglist[20];
1784 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1785 clusterInput.Fitter()->SetFCN(fcnCombiS2);
1786 clusterInput.Fitter()->mninit(6,10,7);
1787 clusterInput.Fitter()->SetPrintLevel(-1+fDebugLevel);
1789 clusterInput.Fitter()->mnexcm("SET NOW", arglist, 0, ierflag);
1790 // Set starting values
1791 static Double_t vstart[6];
1792 vstart[0]=fXInit[0];
1793 vstart[1]=fYInit[0];
1794 vstart[2]=fXInit[1];
1795 vstart[3]=fYInit[1];
1796 vstart[4]=fQrInit[0];
1797 vstart[5]=fQrInit[1];
1798 // lower and upper limits
1799 static Float_t lower[6], upper[6];
1803 fSeg[1]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1804 isec=fSeg[1]->Sector(ix, iy);
1805 dpx=fSeg[1]->Dpx(isec);
1807 fSeg[0]->GetPadI(fXInit[0], fYInit[0], fZPlane, ix, iy);
1808 isec=fSeg[0]->Sector(ix, iy);
1809 dpy=fSeg[0]->Dpy(isec);
1813 Float_t xdum, ydum, zdum;
1815 printf("\n Cluster Finder: %f %f %f %f ", fXInit[0], fXInit[1],fYInit[0], fYInit[1] );
1817 // Find save upper and lower limits
1820 for (fSeg[1]->FirstPad(fXInit[0], fYInit[0], fZPlane, dpx, 0.);
1821 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1823 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1824 // if (fHitMap[1]->TestHit(ix, iy) == kEmpty) continue;
1825 fSeg[1]->GetPadC(ix,iy,upper[0],ydum,zdum);
1826 if (icount ==0) lower[0]=upper[0];
1829 if (lower[0]>upper[0]) {xdum=lower[0]; lower[0]=upper[0]; upper[0]=xdum;}
1830 // vstart[0] = 0.5*(lower[0]+upper[0]);
1835 for (fSeg[0]->FirstPad(fXInit[0], fYInit[0], fZPlane, 0., dpy);
1836 fSeg[0]->MorePads(); fSeg[0]->NextPad())
1838 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1839 // if (fHitMap[0]->TestHit(ix, iy) == kEmpty) continue;
1840 fSeg[0]->GetPadC(ix,iy,xdum,upper[1],zdum);
1841 if (icount ==0) lower[1]=upper[1];
1845 if (lower[1]>upper[1]) {xdum=lower[1]; lower[1]=upper[1]; upper[1]=xdum;}
1846 // vstart[1] = 0.5*(lower[1]+upper[1]);
1849 fSeg[1]->GetPadI(fXInit[1], fYInit[1], fZPlane, ix, iy);
1850 isec=fSeg[1]->Sector(ix, iy);
1851 dpx=fSeg[1]->Dpx(isec);
1852 fSeg[0]->GetPadI(fXInit[1], fYInit[1], fZPlane, ix, iy);
1853 isec=fSeg[0]->Sector(ix, iy);
1854 dpy=fSeg[0]->Dpy(isec);
1857 // Find save upper and lower limits
1861 for (fSeg[1]->FirstPad(fXInit[1], fYInit[1], fZPlane, dpx, 0);
1862 fSeg[1]->MorePads(); fSeg[1]->NextPad())
1864 ix=fSeg[1]->Ix(); iy=fSeg[1]->Iy();
1865 // if (fHitMap[1]->TestHit(ix, iy) == kEmpty) continue;
1866 fSeg[1]->GetPadC(ix,iy,upper[2],ydum,zdum);
1867 if (icount ==0) lower[2]=upper[2];
1870 if (lower[2]>upper[2]) {xdum=lower[2]; lower[2]=upper[2]; upper[2]=xdum;}
1871 // vstart[2] = 0.5*(lower[2]+upper[2]);
1875 for (fSeg[0]->FirstPad(fXInit[1], fYInit[1], fZPlane, 0, dpy);
1876 fSeg[0]-> MorePads(); fSeg[0]->NextPad())
1878 ix=fSeg[0]->Ix(); iy=fSeg[0]->Iy();
1879 // if (fHitMap[0]->TestHit(ix, iy) != kEmpty) continue;
1881 fSeg[0]->GetPadC(ix,iy,xdum,upper[3],zdum);
1882 if (icount ==0) lower[3]=upper[3];
1886 if (lower[3]>upper[3]) {xdum=lower[3]; lower[3]=upper[3]; upper[3]=xdum;}
1888 // vstart[3] = 0.5*(lower[3]+upper[3]);
1896 static Double_t step[6]={0.0005, 0.0005, 0.0005, 0.0005, 0.001, 0.001};
1897 clusterInput.Fitter()->mnparm(0,"x1",vstart[0],step[0],lower[0],upper[0],ierflag);
1898 clusterInput.Fitter()->mnparm(1,"y1",vstart[1],step[1],lower[1],upper[1],ierflag);
1899 clusterInput.Fitter()->mnparm(2,"x2",vstart[2],step[2],lower[2],upper[2],ierflag);
1900 clusterInput.Fitter()->mnparm(3,"y2",vstart[3],step[3],lower[3],upper[3],ierflag);
1901 clusterInput.Fitter()->mnparm(4,"a0",vstart[4],step[4],lower[4],upper[4],ierflag);
1902 clusterInput.Fitter()->mnparm(5,"a1",vstart[5],step[5],lower[5],upper[5],ierflag);
1903 // ready for minimisation
1907 clusterInput.Fitter()->mnexcm("SET NOGR", arglist, 0, ierflag);
1908 clusterInput.Fitter()->mnexcm("MIGRAD", arglist, 0, ierflag);
1909 // clusterInput.Fitter()->mnexcm("EXIT" , arglist, 0, ierflag);
1910 // Get fitted parameters
1912 Double_t epxz, b1, b2;
1914 clusterInput.Fitter()->mnpout(0, chname, fXFit[0], epxz, b1, b2, ierflg);
1915 clusterInput.Fitter()->mnpout(1, chname, fYFit[0], epxz, b1, b2, ierflg);
1916 clusterInput.Fitter()->mnpout(2, chname, fXFit[1], epxz, b1, b2, ierflg);
1917 clusterInput.Fitter()->mnpout(3, chname, fYFit[1], epxz, b1, b2, ierflg);
1918 clusterInput.Fitter()->mnpout(4, chname, fQrFit[0], epxz, b1, b2, ierflg);
1919 clusterInput.Fitter()->mnpout(5, chname, fQrFit[1], epxz, b1, b2, ierflg);
1921 Double_t fmin, fedm, errdef;
1922 Int_t npari, nparx, istat;
1924 clusterInput.Fitter()->mnstat(fmin, fedm, errdef, npari, nparx, istat);
1932 void AliMUONClusterFinderVS::Split(AliMUONRawCluster* c)
1935 // One cluster for each maximum
1938 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1939 for (j=0; j<2; j++) {
1940 AliMUONRawCluster cnew;
1941 cnew.SetGhost(c->GetGhost());
1942 for (cath=0; cath<2; cath++) {
1943 cnew.SetChi2(cath,fChi2[0]);
1944 // ?? why not cnew.fChi2[cath]=fChi2[cath];
1947 cnew.SetNcluster(0,-1);
1948 cnew.SetNcluster(1,fNRawClusters);
1950 cnew.SetNcluster(0,fNPeaks);
1951 cnew.SetNcluster(1,0);
1953 cnew.SetMultiplicity(cath,0);
1954 cnew.SetX(cath, Float_t(fXFit[j]));
1955 cnew.SetY(cath, Float_t(fYFit[j]));
1956 cnew.SetZ(cath, fZPlane);
1958 cnew.SetCharge(cath, Int_t(clusterInput.TotalCharge(cath)*fQrFit[cath]));
1960 cnew.SetCharge(cath, Int_t(clusterInput.TotalCharge(cath)*(1-fQrFit[cath])));
1962 fSeg[cath]->SetHit(fXFit[j],fYFit[j],fZPlane);
1963 for (i=0; i<fMul[cath]; i++) {
1964 cnew.SetIndex(cnew.GetMultiplicity(cath), cath, c->GetIndex(i,cath));
1965 fSeg[cath]->SetPad(fIx[i][cath], fIy[i][cath]);
1966 Float_t q1=fInput->Response()->IntXY(fSeg[cath]);
1967 cnew.SetContrib(i, cath, q1*Float_t(cnew.GetCharge(cath))/Float_t(fQ[i][cath]));
1968 cnew.SetMultiplicity(cath, cnew.GetMultiplicity(cath)+1 );
1970 FillCluster(&cnew,0,cath);
1973 cnew.SetClusterType(cnew.PhysicsContribution());
1974 if (cnew.GetCharge(0)>0 && cnew.GetCharge(1)>0) AddRawCluster(cnew);
1981 // Minimisation functions
1983 void fcnS1(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
1985 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
1992 for (i=0; i<clusterInput.Nmul(0); i++) {
1993 Float_t q0=clusterInput.Charge(i,0);
1994 Float_t q1=clusterInput.DiscrChargeS1(i,par);
2003 void fcnCombiS1(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
2005 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2012 for (cath=0; cath<2; cath++) {
2013 for (i=0; i<clusterInput.Nmul(cath); i++) {
2014 Float_t q0=clusterInput.Charge(i,cath);
2015 Float_t q1=clusterInput.DiscrChargeCombiS1(i,par,cath);
2026 void fcnS2(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
2028 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2035 for (i=0; i<clusterInput.Nmul(0); i++) {
2037 Float_t q0=clusterInput.Charge(i,0);
2038 Float_t q1=clusterInput.DiscrChargeS2(i,par);
2048 void fcnCombiS2(Int_t & /*npar*/, Double_t * /*gin*/, Double_t &f, Double_t *par, Int_t /*iflag*/)
2050 AliMUONClusterInput& clusterInput = *(AliMUONClusterInput::Instance());
2056 for (cath=0; cath<2; cath++) {
2057 for (i=0; i<clusterInput.Nmul(cath); i++) {
2058 Float_t q0=clusterInput.Charge(i,cath);
2059 Float_t q1=clusterInput.DiscrChargeCombiS2(i,par,cath);
2069 void AliMUONClusterFinderVS::AddRawCluster(const AliMUONRawCluster& c)
2072 // Add a raw cluster copy to the list
2075 // AliMUON *pMUON=(AliMUON*)gAlice->GetModule("MUON");
2076 // pMUON->GetMUONData()->AddRawCluster(fInput->Chamber(),c);
2080 TClonesArray &lrawcl = *fRawClusters;
2081 new(lrawcl[fNRawClusters++]) AliMUONRawCluster(c);
2083 fprintf(stderr,"\nfNRawClusters %d\n",fNRawClusters);
2086 Bool_t AliMUONClusterFinderVS::TestTrack(Int_t t) const {
2087 // Test if track was user selected
2088 if (fTrack[0]==-1 || fTrack[1]==-1) {
2090 } else if (t==fTrack[0] || t==fTrack[1]) {
2097 AliMUONClusterFinderVS& AliMUONClusterFinderVS
2098 ::operator = (const AliMUONClusterFinderVS& rhs)
2100 // Protected assignement operator
2102 if (this == &rhs) return *this;
2104 AliFatal("Not implemented.");