]>
Commit | Line | Data |
---|---|---|
0df3ca52 | 1 | #ifndef ALIMUONCLUSTERFINDERAZ_H |
2 | #define ALIMUONCLUSTERFINDERAZ_H | |
3 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
4 | * See cxx source for full Copyright notice */ | |
5 | ||
6 | #include <TROOT.h> | |
7 | class TH2F; | |
8 | class TH2D; | |
9 | class TClonesArray; | |
10 | class AliSegmentation; | |
11 | class AliMUONResponse; | |
12 | class TMinuit; | |
13 | class TMatrixD; | |
14 | class AliMUONPixel; | |
15 | #include "AliMUONClusterFinderVS.h" | |
16 | ||
17 | // Some constants | |
18 | static const Int_t kDim = 2000; // array size | |
19 | static const Double_t kCouplMin = 1.e-3; // threshold on coupling | |
20 | ||
21 | //class AliMUONClusterFinderAZ : public TObject { | |
22 | class AliMUONClusterFinderAZ : public AliMUONClusterFinderVS { | |
23 | ||
24 | public: | |
25 | ||
26 | AliMUONClusterFinderAZ(Bool_t draw, Int_t iReco);// Constructor | |
27 | virtual ~AliMUONClusterFinderAZ(); // Destructor | |
28 | ||
29 | void FindRawClusters(); // the same interface as for old cluster finder | |
30 | void EventLoop(Int_t nev, Int_t ch); // first event | |
31 | Bool_t TestTrack(Int_t t); // test if track was selected | |
c1aed84f | 32 | |
0df3ca52 | 33 | static AliMUONClusterFinderAZ* fgClusterFinder; |
c1aed84f | 34 | |
0df3ca52 | 35 | Int_t fnPads[2]; // ! number of pads in the cluster on 2 cathodes |
36 | Float_t fXyq[6][kDim]; // ! pad information | |
37 | Int_t fPadIJ[2][kDim]; // ! pad information | |
38 | AliSegmentation *fSegmentation[2]; // ! segmentation | |
39 | AliMUONResponse *fResponse; // ! response | |
40 | Float_t fZpad; // ! z-coordinate of the hit | |
41 | Int_t fNpar; // ! number of fit parameters | |
42 | Double_t fQtot; // ! total cluster charge | |
43 | Int_t fReco; // ! =1 if run reco with writing to TreeR | |
44 | ||
45 | protected: | |
46 | ||
47 | private: | |
48 | ||
49 | static TMinuit* fgMinuit; // ! Fitter | |
50 | Bool_t fUsed[2][kDim]; // ! flags for used pads | |
51 | TH2F *fHist[4]; // ! histograms | |
52 | TClonesArray *fMuonDigits; // ! pointer to digits | |
53 | Bool_t fDraw; // ! draw flag | |
54 | Int_t fnMu; // number of muons passing thru the selected area | |
55 | Double_t fxyMu[2][7]; // ! muon information | |
56 | TObjArray *fPixArray; // collection of pixels | |
57 | ||
58 | // Functions | |
59 | ||
60 | void ModifyHistos(void); // modify histograms | |
61 | void AddPad(Int_t cath, Int_t digit); // add a pad to the cluster | |
62 | Bool_t Overlap(Int_t cath, TObject *dig); // check if the pad from one cathode overlaps with a pad in the cluster on the other cathode | |
63 | Bool_t Overlap(Float_t *xy1, Int_t iPad, Float_t *xy12, Int_t iSkip); // check if pads xy1 and iPad overlap and return overlap area | |
64 | Bool_t CheckPrecluster(Int_t *nShown); // check precluster to simplify it (if possible) | |
65 | void BuildPixArray(); // build array of pixels | |
66 | void AjustPixel(Float_t width, Int_t ixy); // ajust size of small pixels | |
67 | void AjustPixel(Float_t wxmin, Float_t wymin); // ajust size of large pixels | |
68 | Bool_t MainLoop(); // repeat MLEM algorithm until pixels become sufficiently small | |
69 | void Mlem(Double_t *coef, Double_t *probi); // use MLEM for cluster finding | |
70 | void FindCOG(TH2D *mlem, Double_t *xyc); // find COG position around maximum bin | |
71 | Int_t FindNearest(AliMUONPixel *pixPtr0); // find nearest neighbouring pixel to the given one | |
72 | void Split(TH2D *mlem, Double_t *coef); // steering function for pixels | |
73 | void AddBin(TH2D *mlem, Int_t ic, Int_t jc, Int_t mode, Bool_t* used, TObjArray *pix); // add a bin to the cluster | |
74 | TObject* BinToPix(TH2D *mlem, Int_t jc, Int_t ic); // hist. bin-to-pixel | |
c1aed84f | 75 | void AddCluster(Int_t ic, Int_t nclust, TMatrixD *aijcluclu, Bool_t *used, Int_t *clustNumb, Int_t &nCoupled); // add a cluster to the group of coupled clusters |
76 | Double_t MinGroupCoupl(Int_t nCoupled, Int_t *clustNumb, TMatrixD *aijcluclu, Int_t *minGroup); // find group of cluster with min. coupling to others | |
77 | Int_t SelectPad(Int_t nCoupled, Int_t nForFit, Int_t *clustNumb, Int_t *clustFit, TMatrixD *aijcluclu); //select pads for fit | |
78 | void Merge(Int_t nForFit, Int_t nCoupled, Int_t *clustNumb, Int_t *clustFit, TObjArray **clusters, TMatrixD *aijcluclu, TMatrixD *aijclupad); // merge clusters | |
0df3ca52 | 79 | Int_t Fit(Int_t nfit, Int_t *clustFit, TObjArray **clusters, Double_t *parOk); // do the fitting |
80 | void UpdatePads(Int_t nfit, Double_t *par); // subtract fitted charges from pads | |
81 | void AddRawCluster(Double_t x, Double_t y, Double_t fmin); // add new raw cluster | |
82 | Int_t FindLocalMaxima(Int_t *localMax, Double_t *maxVal); // find local maxima | |
83 | void FlagLocalMax(TH2D *hist, Int_t i, Int_t j, Int_t *isLocalMax); // flag local max | |
84 | void FindCluster(Int_t *localMax, Int_t iMax); // find cluster around local max | |
85 | ||
86 | ClassDef(AliMUONClusterFinderAZ,0) // cluster finder in MUON arm of ALICE | |
87 | }; | |
88 | #endif |