]> git.uio.no Git - u/mrichter/AliRoot.git/blame - TPC/AliTPCclustererMI.h
Modifications needed to do the following:
[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);
1c53abe2 33 virtual void SetInput(TTree * tree); // set input tree with digits
34 virtual void SetOutput(TTree * tree); //set output tree with
35private:
13116aec 36 Bool_t IsMaximum(Float_t k, Int_t max, const Float_t *bins);
37 void MakeCluster2(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 38 AliTPCclusterMI &c);
13116aec 39 void MakeCluster(Int_t k,Int_t max,Float_t *bins,UInt_t m,
1c53abe2 40 AliTPCclusterMI &c);
41 Float_t GetSigmaY2(Int_t iz);
42 Float_t GetSigmaZ2(Int_t iz);
43 Float_t FitMax(Float_t vmatrix[5][5], Float_t y, Float_t z, Float_t sigmay, Float_t sigmaz);
44 void AddCluster(AliTPCclusterMI &c); // add the cluster to the array
13116aec 45 void UnfoldCluster(Float_t * matrix[7], Float_t recmatrix[5][5],
1c53abe2 46 Float_t & meani, Float_t & meanj, Float_t & sum, Float_t &overlap );
f8aae377 47 void FindClusters();
1c53abe2 48
49
50
13116aec 51 Float_t * fBins; //!digits array
52 Float_t * fResBins; //!digits array with res. after 1 finder
1c53abe2 53 Int_t fLoop; //loop - cf in 2 loops
54 Int_t fMaxBin;
55 Int_t fMaxTime;
56 Int_t fMaxPad;
57 Int_t fSector; //!current sector
508541c7 58 Int_t fRow; //!current row
1c53abe2 59 Float_t fSign; //!current sign
60 Float_t fRx; // current radius
61 Float_t fPadWidth; // the width of the pad
62 Float_t fPadLength; // the width of the pad
63 Float_t fZWidth; //the z bin width
64
65 TTree * fInput; //!input tree with digits - object not owner
66 TTree * fOutput; //!output tree with digits - object not owner
67 AliTPCClustersRow * fRowCl; //! current cluster row
68 AliSimDigits * fRowDig; //! current digits row
69 const AliTPCParam * fParam; //! tpc parameters
70 Int_t fNcluster; // number of clusters - for given row
71 ClassDef(AliTPCclustererMI,1) // Time Projection Chamber digits
72};
73
13116aec 74inline Bool_t AliTPCclustererMI::IsMaximum(Float_t q,Int_t max,const Float_t *bins){
1c53abe2 75 //is this a local maximum ?
76 if (bins[-max] >= q) return kFALSE;
77 if (bins[-1 ] >= q) return kFALSE;
78 if (bins[+max] > q) return kFALSE;
79 if (bins[+1 ] > q) return kFALSE;
80 if (bins[-max-1] >= q) return kFALSE;
81 if (bins[+max-1] >= q) return kFALSE;
82 if (bins[+max+1] > q) return kFALSE;
83 if (bins[-max+1] >= q) return kFALSE;
84 return kTRUE;
85}
86
87
88
89//-----------------------------------------------------------------
90
91#endif
92
93