]>
Commit | Line | Data |
---|---|---|
1 | #ifndef ALITRDTIMEBIN_H | |
2 | #define ALITRDTIMEBIN_H | |
3 | ||
4 | /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. * | |
5 | * See cxx source for full Copyright notice */ | |
6 | ||
7 | /* $Id: AliTRDtimeBin.h,v */ | |
8 | ||
9 | ////////////////////////////////////////////////////////////////////// | |
10 | // // | |
11 | // Hit compression class // | |
12 | // Adapted from AliTPCTimeBin by Marian // | |
13 | // // | |
14 | ////////////////////////////////////////////////////////////////////// | |
15 | ||
16 | #include <TObject.h> | |
17 | ||
18 | class AliTRDcluster; | |
19 | ||
20 | //----------------------------------------------------------------- | |
21 | class AliTRDtimeBin : public TObject { | |
22 | ||
23 | // Provides tools to address clusters which lay within one time bin | |
24 | ||
25 | public: | |
26 | ||
27 | AliTRDtimeBin(); | |
28 | virtual ~AliTRDtimeBin() { }; | |
29 | void InsertCluster(AliTRDcluster *c, UInt_t index); | |
30 | ||
31 | operator Int_t() const {return fN;} | |
32 | AliTRDcluster* operator[](Int_t i); | |
33 | UInt_t GetIndex(Int_t i) const {return fIndex[i];} | |
34 | ||
35 | Int_t Find(Double_t y) const; | |
36 | ||
37 | protected: | |
38 | ||
39 | enum { kMaxClusterPerTimeBin=3500 }; | |
40 | ||
41 | UInt_t fN; // ???? | |
42 | AliTRDcluster *fClusters[kMaxClusterPerTimeBin]; // ???? | |
43 | UInt_t fIndex[kMaxClusterPerTimeBin]; // ???? | |
44 | ||
45 | ClassDef(AliTRDtimeBin,1) // Provides tools to address clusters which lay within one time bin | |
46 | ||
47 | }; | |
48 | ||
49 | #endif | |
50 |