]>
Commit | Line | Data |
---|---|---|
3c18eefd | 1 | #ifndef ALIITSUTRACKCOND_H |
2 | #define ALIITSUTRACKCOND_H | |
3 | ||
4 | #include <TObject.h> | |
5 | #include <TArrayS.h> | |
6 | ||
7 | //------------------------------------------------------------------------------ | |
8 | // | |
9 | // This class defines a set of hit patterns (conditions) to consider the track reconstructable | |
10 | // Each condidition (few consequitive elements from fConditions array) is set of bit patterns, | |
11 | // with each element of condition defining a group of layers which must be present in the tracks. | |
12 | // For instance, if we require the track to have contributions from | |
13 | // {lr0 or lr1 or lr2} AND {lr2 or lr 3 or lr 4} AND {lr5 or lr6} then the condition should | |
14 | // be {BIT(0)|BIT(1)|BIT(2), BIT(2)|BIT(3)|BIT(4), BIT(5)|BIT(6)}. | |
15 | // Additionally, each condition may request min number of hits to be present | |
16 | // | |
17 | // Each AliITSUTrackCond should correspond to single track finding pass and may contain multiple | |
18 | // conditions. To consider the track reconstructable it is enough to satisfy 1 condition | |
19 | // | |
20 | //------------------------------------------------------------------------------ | |
21 | ||
22 | ||
23 | class AliITSUTrackCond : public TObject | |
24 | { | |
25 | public: | |
26 | enum {kCondStart,kNGroups,kMinClus,kNAuxSz}; | |
38997c3c | 27 | enum {kMaxBranches=50,kMaxCandidates=500}; // max number of branches one can create for single seed on any layer (except branch w/o cl. attached) |
28 | ||
3c18eefd | 29 | |
30 | AliITSUTrackCond(Int_t nLayers=0); | |
31 | AliITSUTrackCond(const AliITSUTrackCond& src); | |
32 | AliITSUTrackCond &operator=(const AliITSUTrackCond& src); | |
33 | ||
34 | ~AliITSUTrackCond() {} | |
35 | ||
38997c3c | 36 | void SetNLayers(Int_t nl); |
c03e4f8a | 37 | void SetClSharing(Int_t lr, Char_t v=0) {fClSharing[lr] = v;} |
38997c3c | 38 | void SetMaxBranches(Int_t lr, Int_t mb) {fMaxBranches[lr] = mb;} |
39 | void SetMaxCandidates(Int_t lr, Int_t nc) {fMaxCandidates[lr] = nc;} | |
3c18eefd | 40 | void SetID(Int_t id) {SetUniqueID(id);} |
41 | void AddNewCondition(Int_t minClusters); | |
42 | void AddGroupPattern(UShort_t patt); | |
43 | ||
44 | Int_t GetID() const {return GetUniqueID();} | |
38997c3c | 45 | Int_t GetMaxBranches(Int_t lr) const {return fMaxBranches[lr];} |
46 | Int_t GetMaxCandidates(Int_t lr) const {return fMaxCandidates[lr];} | |
3c18eefd | 47 | Int_t GetNConditions() const {return fNConditions;} |
48 | UShort_t GetGroup(Int_t condID,Int_t grID) const {return fConditions[fAuxData[condID*kNAuxSz+kCondStart]+grID];} | |
c8d1f258 | 49 | Bool_t CheckPattern(UShort_t patt) const; |
3c18eefd | 50 | // |
51 | virtual void Print(Option_t* option = "") const; | |
52 | ||
ee54014a | 53 | void SetMaxTr2ClChi2(Int_t lr, Float_t v) {fMaxTr2ClChi2[lr] = v;} |
54 | void SetMissPenalty(Int_t lr, Float_t v) {fMissPenalty[lr] = v;} | |
55 | void SetNSigmaRoadY(Int_t lr, Float_t v) {fNSigmaRoadY[lr] = v;} | |
56 | void SetNSigmaRoadZ(Int_t lr, Float_t v) {fNSigmaRoadZ[lr] = v;} | |
3c18eefd | 57 | // |
c03e4f8a | 58 | Char_t GetClSharing(Int_t lr) const {return fClSharing[lr];} |
ee54014a | 59 | Float_t GetMissPenalty(Int_t lr) const {return fMissPenalty[lr];} |
60 | Float_t GetMaxTr2ClChi2(Int_t lr) const {return fMaxTr2ClChi2[lr];} | |
61 | Float_t GetNSigmaRoadY(Int_t lr) const {return fNSigmaRoadY[lr];} | |
62 | Float_t GetNSigmaRoadZ(Int_t lr) const {return fNSigmaRoadZ[lr];} | |
63 | Bool_t IsLayerExcluded(Int_t lr) const {return GetMaxTr2ClChi2(lr)<=0;} | |
64 | // | |
65 | void Init(); | |
66 | Bool_t IsInitDone() const {return fInitDone;} | |
67 | // | |
68 | protected: | |
69 | // | |
70 | Bool_t fInitDone; // initialization flag | |
38997c3c | 71 | Int_t fNLayers; // total number of layers |
c03e4f8a | 72 | Char_t* fClSharing; // [fNLayers] is cluster sharing allowed |
38997c3c | 73 | Short_t* fMaxBranches; // [fNLayers] max allowed branches per seed on each layer |
74 | Short_t* fMaxCandidates; // [fNLayers] max allowed candidates per TPC seed on each layer | |
ee54014a | 75 | Float_t* fMaxTr2ClChi2; // [fNLayers] max track-to-cluster chi2 |
76 | Float_t* fMissPenalty; // [fNLayers] chi2 penalty for missing hit on the layer | |
77 | Float_t* fNSigmaRoadY; // [fNLayers] number of sigmas in Y | |
78 | Float_t* fNSigmaRoadZ; // [fNLayers] number of sigmas in Z | |
79 | // | |
3c18eefd | 80 | Short_t fNConditions; // number of conditions defined |
38997c3c | 81 | TArrayS fConditions; // fNConditions set of conditions |
3c18eefd | 82 | TArrayS fAuxData; // condition beginning (1st group), n groups, min clus |
83 | // | |
c03e4f8a | 84 | static Char_t fgkClSharing; // def cl.sharing allowed level |
ee54014a | 85 | static Int_t fgkMaxBranches; // def max number of branches per seed on current layer |
86 | static Int_t fgkMaxCandidates; // def max number of total candidates on current layer | |
87 | static Float_t fgkMaxTr2ClChi2; // def track-to-cluster chi2 cut | |
88 | static Float_t fgkMissPenalty; // penalty for missing cluster | |
89 | // | |
90 | ClassDef(AliITSUTrackCond,3) // set of requirements on track hits pattern | |
3c18eefd | 91 | }; |
92 | ||
93 | ||
94 | ||
95 | #endif |