]>
Commit | Line | Data |
---|---|---|
1 | #ifndef ALIMUONCLUSTERFINDERSIMPLEFIT_H | |
2 | #define ALIMUONCLUSTERFINDERSIMPLEFIT_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$ | |
8 | ||
9 | /// \ingroup rec | |
10 | /// \class AliMUONClusterFinderSimpleFit | |
11 | /// \brief Basic cluster finder | |
12 | /// | |
13 | // Author Laurent Aphecetche, Subatech | |
14 | ||
15 | #ifndef AliMUONVCLUSTERFINDER_H | |
16 | # include "AliMUONVClusterFinder.h" | |
17 | #endif | |
18 | ||
19 | class AliMUONMathieson; | |
20 | ||
21 | class AliMUONClusterFinderSimpleFit : public AliMUONVClusterFinder | |
22 | { | |
23 | public: | |
24 | AliMUONClusterFinderSimpleFit(AliMUONVClusterFinder* clusterFinder); | |
25 | virtual ~AliMUONClusterFinderSimpleFit(); | |
26 | ||
27 | using AliMUONVClusterFinder::Prepare; | |
28 | ||
29 | virtual Bool_t Prepare(Int_t detElemId, | |
30 | TObjArray* pads[2], | |
31 | const AliMpArea& area); | |
32 | ||
33 | virtual AliMUONCluster* NextCluster(); | |
34 | ||
35 | virtual void SetChargeHints(Double_t /*lowestPadCharge*/, Double_t lowestClusterCharge) { | |
36 | fLowestClusterCharge=lowestClusterCharge; | |
37 | } | |
38 | ||
39 | private: | |
40 | /// Not implemented | |
41 | AliMUONClusterFinderSimpleFit(const AliMUONClusterFinderSimpleFit& rhs); | |
42 | /// Not implemented | |
43 | AliMUONClusterFinderSimpleFit& operator=(const AliMUONClusterFinderSimpleFit& rhs); | |
44 | ||
45 | void ComputePosition(AliMUONCluster& cluster); | |
46 | ||
47 | private: | |
48 | AliMUONVClusterFinder* fClusterFinder; //!< the preclustering we use | |
49 | AliMUONMathieson* fMathieson; //!< Mathieson to compute the charge repartition | |
50 | Double_t fLowestClusterCharge; //!< minimum cluster charge we allow | |
51 | ||
52 | ClassDef(AliMUONClusterFinderSimpleFit,2) // Basic cluster finder | |
53 | }; | |
54 | ||
55 | #endif |