Making the copy constructor and the assignment operator private. Removing their dummy...
[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;
194b0609 22class AliTPCRecoParam;
1c53abe2 23class AliTPCclusterMI;
24class AliTPCClustersRow;
f8aae377 25class AliRawReader;
1c53abe2 26class AliSimDigits;
27class TTree;
65c045f0 28class TTreeSRedirector;
1c53abe2 29
30class AliTPCclustererMI : public TObject{
31public:
194b0609 32 AliTPCclustererMI(const AliTPCParam* par, const AliTPCRecoParam * recoParam = 0);
65c045f0 33 virtual ~AliTPCclustererMI();
f8aae377 34 virtual void Digits2Clusters();
35 virtual void Digits2Clusters(AliRawReader* rawReader);
c8c88e5d 36 virtual void SetOldRCUFormat(Bool_t rcuFormat = kFALSE)
37 { fIsOldRCUFormat = rcuFormat; };
1c53abe2 38 virtual void SetInput(TTree * tree); // set input tree with digits
39 virtual void SetOutput(TTree * tree); //set output tree with
40private:
97f127bb 41 Bool_t IsMaximum(Float_t k, Int_t max, const Float_t *bins) const;
13116aec 42 void MakeCluster2(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 43 AliTPCclusterMI &c);
13116aec 44 void MakeCluster(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 45 AliTPCclusterMI &c);
46 Float_t GetSigmaY2(Int_t iz);
47 Float_t GetSigmaZ2(Int_t iz);
48 Float_t FitMax(Float_t vmatrix[5][5], Float_t y, Float_t z, Float_t sigmay, Float_t sigmaz);
49 void AddCluster(AliTPCclusterMI &c); // add the cluster to the array
13116aec 50 void UnfoldCluster(Float_t * matrix[7], Float_t recmatrix[5][5],
1c53abe2 51 Float_t & meani, Float_t & meanj, Float_t & sum, Float_t &overlap );
f8aae377 52 void FindClusters();
65c045f0 53 Double_t ProcesSignal(Float_t * signal, Int_t nchannels, Int_t id[3]);
54 void DumpHistos();
1c53abe2 55
56
13116aec 57 Float_t * fBins; //!digits array
58 Float_t * fResBins; //!digits array with res. after 1 finder
1c53abe2 59 Int_t fLoop; //loop - cf in 2 loops
97f127bb 60 Int_t fMaxBin; //current ( for current sector) maximal bin
61 Int_t fMaxTime; //current ( for current sector) maximal time
62 Int_t fMaxPad; //current ( for current sector) maximal pad
1c53abe2 63 Int_t fSector; //!current sector
508541c7 64 Int_t fRow; //!current row
1c53abe2 65 Float_t fSign; //!current sign
66 Float_t fRx; // current radius
67 Float_t fPadWidth; // the width of the pad
68 Float_t fPadLength; // the width of the pad
69 Float_t fZWidth; //the z bin width
70
b6f060dc 71 Bool_t fPedSubtraction; // perform pedestal subtraction or not
c8c88e5d 72 Bool_t fIsOldRCUFormat; // assume old RCU raw data format
b6f060dc 73
1c53abe2 74 TTree * fInput; //!input tree with digits - object not owner
75 TTree * fOutput; //!output tree with digits - object not owner
76 AliTPCClustersRow * fRowCl; //! current cluster row
77 AliSimDigits * fRowDig; //! current digits row
78 const AliTPCParam * fParam; //! tpc parameters
79 Int_t fNcluster; // number of clusters - for given row
65c045f0 80 TObjArray * fAmplitudeHisto; //! array of histograms of amplitudes
81 TTreeSRedirector *fDebugStreamer; //!debug streamer
194b0609 82 const AliTPCRecoParam * fRecoParam; //! reconstruction parameters
1c53abe2 83 ClassDef(AliTPCclustererMI,1) // Time Projection Chamber digits
84};
85
97f127bb 86inline Bool_t AliTPCclustererMI::IsMaximum(Float_t q,Int_t max,const Float_t *bins) const {
1c53abe2 87 //is this a local maximum ?
88 if (bins[-max] >= q) return kFALSE;
89 if (bins[-1 ] >= q) return kFALSE;
90 if (bins[+max] > q) return kFALSE;
91 if (bins[+1 ] > q) return kFALSE;
92 if (bins[-max-1] >= q) return kFALSE;
93 if (bins[+max-1] >= q) return kFALSE;
94 if (bins[+max+1] > q) return kFALSE;
95 if (bins[-max+1] >= q) return kFALSE;
96 return kTRUE;
97}
98
99
100
101//-----------------------------------------------------------------
102
103#endif
104
105