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