Line data Source code
1 : #ifndef ALIITSTRACKERSA_H
2 : #define ALIITSTRACKERSA_H
3 :
4 :
5 :
6 : #include "AliITSgeomTGeo.h"
7 : #include "AliITStrackerMI.h"
8 :
9 : /* Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *
10 : * See cxx source for full Copyright notice */
11 :
12 : /* $Id$ */
13 :
14 :
15 : ////////////////////////////////////////////////////
16 : // Stand alone tracker class //
17 : // Origin: Elisabetta Crescio //
18 : // e-mail: crescio@to.infn.it //
19 : // adapted for cosmics by A.Dainese //
20 : ////////////////////////////////////////////////////
21 :
22 : class AliITSclusterTable;
23 : class AliITStrackSA;
24 : class AliESDVertex;
25 : class AliESDEvent;
26 : class AliITSVertexer;
27 : class TTree;
28 : class TArrayD;
29 :
30 : class AliITStrackerSA : public AliITStrackerMI {
31 :
32 :
33 : public:
34 :
35 : AliITStrackerSA();
36 : AliITStrackerSA(const Char_t *geom);
37 : virtual ~AliITStrackerSA();
38 : virtual Int_t Clusters2Tracks(AliESDEvent *event);
39 : Int_t FindTracks(AliESDEvent* event, Bool_t useAllClusters=kFALSE);
40 :
41 : AliITStrackV2* FitTrack(AliITStrackSA* tr,Double_t* primaryVertex,Bool_t onePoint=kFALSE);
42 : void StoreTrack(AliITStrackV2 *t,AliESDEvent *event, Bool_t pureSA) const;
43 : Int_t FindTrackLowChiSquare() const;
44 16 : Int_t LoadClusters(TTree *cf) {Int_t rc=AliITStrackerMI::LoadClusters(cf); SetClusterTree(cf); return rc;}
45 :
46 16 : void SetClusterTree(TTree * itscl){fITSclusters = itscl;}
47 :
48 4 : void SetOutwardFinding() {fInwardFlag=kFALSE;}
49 0 : void SetInwardFinding() {fInwardFlag=kTRUE;}
50 : void SetOuterStartLayer(Int_t osl = 0) {
51 8 : if(osl>(AliITSgeomTGeo::GetNLayers()-2)) AliWarning("Minimum Number of layers is 2. OuterStartLayer set to Nlayers-2");
52 4 : fOuterStartLayer = TMath::Min(AliITSgeomTGeo::GetNLayers()-2,osl);
53 4 : }
54 0 : Int_t GetOuterStartLayer() const {return fOuterStartLayer;}
55 : void SetInnerStartLayer(Int_t isl = 5) {
56 0 : if(isl<1) AliWarning("Minimum Number of layers is 2. InnerStartLayer set to 1");
57 0 : fInnerStartLayer = TMath::Max(1,isl);
58 0 : }
59 0 : Int_t GetInnerStartLayer() const {return fInnerStartLayer;}
60 :
61 2 : void SetSAFlag(Bool_t fl){fITSStandAlone=fl;} // StandAlone flag setter
62 4 : Bool_t GetSAFlag() const {return fITSStandAlone;} // StandAlone flag getter
63 : void SetFixedWindowSizes(Int_t n=46, Double_t *phi=0, Double_t *lam=0);
64 : void SetCalculatedWindowSizes(Int_t n=10, Double_t phimin=0.002, Double_t phimax=0.0145, Double_t lambdamin=0.003, Double_t lambdamax=0.008);
65 :
66 4 : void SetMinNPoints(Int_t np){fMinNPoints=np;}
67 0 : Int_t GetMinNPoints() const {return fMinNPoints;}
68 0 : void SetMinimumChargeSDDSSD(Double_t minq=0.){fMinQ=minq;}
69 : enum {kSAflag=0x8000}; //flag to mark clusters used in the SA tracker
70 : protected:
71 :
72 : //Initialization
73 : void Init();
74 : void ResetForFinding();
75 : void ConfigureTrackFinding();
76 : void UpdatePoints();
77 : Bool_t SetFirstPoint(Int_t lay, Int_t clu, Double_t* primaryVertex);
78 : static Double_t Curvature(Double_t x1,Double_t y1,Double_t x2,Double_t y2,
79 : Double_t x3,Double_t y3);
80 :
81 : Double_t ChoosePoint(Double_t p1, Double_t p2, Double_t pp);
82 :
83 : static Int_t FindIntersection(Double_t a1, Double_t b1, Double_t c1, Double_t c2,
84 : Double_t& x1,Double_t& y1, Double_t& x2, Double_t& y2);
85 : static Int_t FindEquation(Double_t x1, Double_t y1, Double_t x2, Double_t y2,
86 : Double_t x3, Double_t y3,Double_t& a, Double_t& b,
87 : Double_t& c);
88 :
89 : Int_t FindLabel(AliITStrackV2* track);
90 : Int_t SearchClusters(Int_t layer,Double_t phiwindow,Double_t lambdawindow,
91 : AliITStrackSA* trs,Double_t zvertex,Int_t flagp);
92 :
93 : void GetCoorAngles(AliITSRecPoint* cl,Double_t &phi,Double_t &lambda,Double_t &x,Double_t &y,Double_t &z,const Double_t* vertex);
94 : void GetCoorErrors(AliITSRecPoint* cl,Double_t &sx,Double_t &sy, Double_t &sz);
95 :
96 27798 : AliITSclusterTable* GetClusterCoord(Int_t layer,Int_t n) const {return (AliITSclusterTable*)fCluCoord[layer]->UncheckedAt(n);}
97 176 : void RemoveClusterCoord(Int_t layer, Int_t n) {fCluCoord[layer]->RemoveAt(n);fCluCoord[layer]->Compress();}
98 :
99 : Int_t FindIndex(Int_t lay, Double_t lamMin) const;
100 :
101 : Double_t fPhiEstimate; //Estimation of phi angle on next layer
102 : Bool_t fITSStandAlone; //Tracking is performed in the ITS alone if kTRUE
103 : Double_t fPoint1[2]; //! coord. of 1-st point to evaluate the curvature
104 : Double_t fPoint2[2]; //! coord. of 2-nd point to evaluate the curvature
105 : Double_t fPoint3[2]; //! coord. of 3-rd point to evaluate the curvature
106 : Double_t fPointc[2]; //! current point coord (for curvature eval.)
107 : Double_t fLambdac; //! current value of the Lambda angle in the window
108 : Double_t fPhic; //! current value of the Phi angle in the window
109 : Double_t fCoef1; //! param. of the equation of the circ. approx a layer
110 : Double_t fCoef2; //! param. of the equation of the circ. approx a layer
111 : Double_t fCoef3; //! param. of the equation of the circ. approx a layer
112 : Int_t fNloop; // Number of iterqations on phi and lambda windows
113 : Double_t *fPhiWin; // phi window sizes
114 : Double_t *fLambdaWin; // lambda window sizes
115 : TClonesArray *fListOfTracks; //! container for found tracks
116 : TClonesArray *fListOfSATracks; //! container for found SA tracks
117 : TTree *fITSclusters; //! pointer to ITS tree of clusters
118 : Bool_t fInwardFlag; // set to kTRUE for inward track finding
119 : Int_t fOuterStartLayer; // Outward search for tracks with <6 points: outer layer to start from
120 : Int_t fInnerStartLayer; // Inward search for tracks with <6 points: inner layer to start from
121 : Int_t fMinNPoints; // minimum number of clusters for a track
122 : Double_t fMinQ; // lower cut on cluster charge (SDD and SSD)
123 :
124 : TClonesArray** fCluCoord; //! array with cluster info
125 :
126 : private:
127 : AliITStrackerSA(const AliITStrackerSA& tracker);
128 : AliITStrackerSA& operator=(const AliITStrackerSA& source);
129 :
130 194490 : ClassDef(AliITStrackerSA,12)
131 : };
132 :
133 : #endif
134 :
135 :
|
