]>
Commit | Line | Data |
---|---|---|
0df3ca52 | 1 | #ifndef ALIMUONPIXEL_H |
2 | #define ALIMUONPIXEL_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 TObjArray; | |
8 | ||
9 | class AliMUONPixel : public TObject { | |
10 | ||
11 | public: | |
12 | ||
13 | AliMUONPixel(){ | |
14 | ;} // Default constructor | |
15 | AliMUONPixel(Double_t xc, Double_t yc, Double_t wx, Double_t wy, Double_t charge); // constructor | |
16 | virtual ~AliMUONPixel(); // Destructor | |
17 | ||
18 | Double_t Charge(void) const { return fCharge; } // pixel charge | |
19 | Double_t Size(Int_t ixy) const { return fSize[ixy]; } // pixel size | |
20 | Double_t Coord(Int_t ixy) const { return fXY[ixy]; } // pixel coordinate | |
21 | ||
22 | void SetCharge(Double_t Charge) { fCharge = Charge; } // set charge | |
23 | void SetSize(Int_t ixy, Double_t Size) { fSize[ixy] = Size; } // set size | |
24 | void SetCoord(Int_t ixy, Double_t Coord) { fXY[ixy] = Coord; } | |
25 | void Shift(Int_t ixy, Double_t shift) { fXY[ixy] += shift; } | |
26 | void Print(void) {printf("%9.4f %9.4f %9.4f %9.4f %9.4f \n", fXY[0], fXY[1], fSize[0], fSize[1], fCharge); } | |
27 | // What is necessary for sorting TObjArray's | |
28 | Bool_t IsSortable() const { return kTRUE; } | |
29 | Int_t Compare(const TObject* pixel) const; // "Compare" function for sorting | |
30 | ||
31 | protected: | |
32 | ||
33 | private: | |
34 | ||
35 | Double_t fCharge; // pixel charge | |
36 | Double_t fSize[2]; // pixel size | |
37 | Double_t fXY[2]; // pixel coordinates | |
38 | ||
39 | // Functions | |
40 | ||
41 | ClassDef(AliMUONPixel,0) // pixel for MLEM method of cluster finding | |
42 | }; | |
43 | #endif |