1 #ifndef ALITPCCLUSTERER_H
2 #define ALITPCCLUSTERER_H
3 /* Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *
4 * See cxx source for full Copyright notice */
8 //-------------------------------------------------------
9 // The TPC cluster finder
11 // Origin: Iouri Belikov, CERN, Jouri.Belikov@cern.ch
12 //-------------------------------------------------------
14 #include "AliTPCClustersArray.h"
20 class AliTPCclusterer : public TObject {
22 AliTPCclusterer(const AliTPCParam *par);
23 Int_t Digits2Clusters(TTree *dig, TTree *clu);
28 UShort_t GetQ() const {return fQ;}
29 UInt_t GetMask() const {return fMask;}
30 void SetQ(UShort_t q) {fQ=q;}
31 void SetMask(UInt_t m) {fMask=m;}
34 UInt_t fMask; //peak mask
38 static Bool_t IsMaximum(Int_t k, Int_t max, const AliBin *bins);
39 static void FindPeaks(Int_t k,Int_t m,AliBin*b,Int_t*idx,UInt_t*msk,Int_t&n);
40 static void MarkPeak(Int_t k, Int_t max, AliBin *bins, UInt_t m);
41 static void MakeCluster(Int_t k,Int_t max,AliBin *bins,UInt_t m,
44 AliTPCClustersArray fClusterArray; //! container managing the clusters
46 ClassDef(AliTPCclusterer,1) // the TPC cluster finder
50 inline Bool_t AliTPCclusterer::IsMaximum(Int_t k,Int_t max,const AliBin *bins){
51 //is this a local maximum ?
52 UShort_t q=bins[k].GetQ();
53 if (q==1023) return kFALSE;
54 if (bins[k-max].GetQ() > q) return kFALSE;
55 if (bins[k-1 ].GetQ() > q) return kFALSE;
56 if (bins[k+max].GetQ() > q) return kFALSE;
57 if (bins[k+1 ].GetQ() > q) return kFALSE;
58 if (bins[k-max-1].GetQ() > q) return kFALSE;
59 if (bins[k+max-1].GetQ() > q) return kFALSE;
60 if (bins[k+max+1].GetQ() > q) return kFALSE;
61 if (bins[k-max+1].GetQ() > q) return kFALSE;
65 //-----------------------------------------------------------------