TPC parameters and Pedestals added to the database (Marian)
[u/mrichter/AliRoot.git] / TPC / AliTPCclustererMI.h
CommitLineData
1c53abe2 1#ifndef ALITPCCLUSTERERMI_H
2#define ALITPCCLUSTERERMI_H
3
722aa38c 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
10
1c53abe2 11//-------------------------------------------------------
12// TPC clusterer
13//
14// Origin: Marian Ivanov
15//-------------------------------------------------------
16#include <Rtypes.h>
17#include <TObject.h>
18#define kMAXCLUSTER 2500
19
20class TFile;
21class AliTPCParam;
22class AliTPCclusterMI;
23class AliTPCClustersRow;
f8aae377 24class AliRawReader;
1c53abe2 25class AliSimDigits;
26class TTree;
27
28class AliTPCclustererMI : public TObject{
29public:
f8aae377 30 AliTPCclustererMI(const AliTPCParam* par);
31 virtual void Digits2Clusters();
32 virtual void Digits2Clusters(AliRawReader* rawReader);
b6f060dc 33 virtual void SetPedSubtraction(Bool_t pedestalSub = kFALSE)
34 { fPedSubtraction = pedestalSub; };
c8c88e5d 35 virtual void SetOldRCUFormat(Bool_t rcuFormat = kFALSE)
36 { fIsOldRCUFormat = rcuFormat; };
1c53abe2 37 virtual void SetInput(TTree * tree); // set input tree with digits
38 virtual void SetOutput(TTree * tree); //set output tree with
39private:
13116aec 40 Bool_t IsMaximum(Float_t k, Int_t max, const Float_t *bins);
41 void MakeCluster2(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 42 AliTPCclusterMI &c);
13116aec 43 void MakeCluster(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 44 AliTPCclusterMI &c);
45 Float_t GetSigmaY2(Int_t iz);
46 Float_t GetSigmaZ2(Int_t iz);
47 Float_t FitMax(Float_t vmatrix[5][5], Float_t y, Float_t z, Float_t sigmay, Float_t sigmaz);
48 void AddCluster(AliTPCclusterMI &c); // add the cluster to the array
13116aec 49 void UnfoldCluster(Float_t * matrix[7], Float_t recmatrix[5][5],
1c53abe2 50 Float_t & meani, Float_t & meanj, Float_t & sum, Float_t &overlap );
f8aae377 51 void FindClusters();
1c53abe2 52
53
54
13116aec 55 Float_t * fBins; //!digits array
56 Float_t * fResBins; //!digits array with res. after 1 finder
1c53abe2 57 Int_t fLoop; //loop - cf in 2 loops
58 Int_t fMaxBin;
59 Int_t fMaxTime;
60 Int_t fMaxPad;
61 Int_t fSector; //!current sector
508541c7 62 Int_t fRow; //!current row
1c53abe2 63 Float_t fSign; //!current sign
64 Float_t fRx; // current radius
65 Float_t fPadWidth; // the width of the pad
66 Float_t fPadLength; // the width of the pad
67 Float_t fZWidth; //the z bin width
68
b6f060dc 69 Bool_t fPedSubtraction; // perform pedestal subtraction or not
c8c88e5d 70 Bool_t fIsOldRCUFormat; // assume old RCU raw data format
b6f060dc 71
1c53abe2 72 TTree * fInput; //!input tree with digits - object not owner
73 TTree * fOutput; //!output tree with digits - object not owner
74 AliTPCClustersRow * fRowCl; //! current cluster row
75 AliSimDigits * fRowDig; //! current digits row
76 const AliTPCParam * fParam; //! tpc parameters
77 Int_t fNcluster; // number of clusters - for given row
78 ClassDef(AliTPCclustererMI,1) // Time Projection Chamber digits
79};
80
13116aec 81inline Bool_t AliTPCclustererMI::IsMaximum(Float_t q,Int_t max,const Float_t *bins){
1c53abe2 82 //is this a local maximum ?
83 if (bins[-max] >= q) return kFALSE;
84 if (bins[-1 ] >= q) return kFALSE;
85 if (bins[+max] > q) return kFALSE;
86 if (bins[+1 ] > q) return kFALSE;
87 if (bins[-max-1] >= q) return kFALSE;
88 if (bins[+max-1] >= q) return kFALSE;
89 if (bins[+max+1] > q) return kFALSE;
90 if (bins[-max+1] >= q) return kFALSE;
91 return kTRUE;
92}
93
94
95
96//-----------------------------------------------------------------
97
98#endif
99
100