1 |
pam-fi |
1.1 |
/** |
2 |
|
|
* \file TrkLevel1.h |
3 |
|
|
* \author Elena Vannuccini |
4 |
|
|
*/ |
5 |
|
|
#ifndef trklevel1_h |
6 |
|
|
#define trklevel1_h |
7 |
|
|
|
8 |
|
|
#include <TObject.h> |
9 |
|
|
#include <TClonesArray.h> |
10 |
|
|
#include <TRef.h> |
11 |
|
|
|
12 |
|
|
#include <TrkStruct.h> |
13 |
|
|
|
14 |
pam-fi |
1.2 |
#define INC_CUT 4. |
15 |
pam-fi |
1.1 |
/** |
16 |
|
|
* \brief Class to describe tracker clusters. |
17 |
|
|
* |
18 |
pam-fi |
1.2 |
* A cluster is defined as a group of adjacent strips whose signals exceed noise by INC_CUT sigma, and at least one strip has signal/noise > SEED_CUT. Tipical values are SEED_CUT = 7 and INC_CUT = 4. |
19 |
|
|
* |
20 |
pam-fi |
1.1 |
*/ |
21 |
|
|
// ================================================================== |
22 |
|
|
class TrkCluster : public TObject { |
23 |
|
|
|
24 |
|
|
private: |
25 |
|
|
|
26 |
|
|
|
27 |
|
|
public: |
28 |
|
|
|
29 |
pam-fi |
1.2 |
int view; ///< view |
30 |
|
|
int maxs; ///< strip number (1-3072) of cluster center |
31 |
|
|
int indmax; |
32 |
pam-fi |
1.1 |
|
33 |
pam-fi |
1.2 |
Int_t CLlength; ///< number of stored strip info (signal+sigma+adc+bad) |
34 |
|
|
Float_t *clsignal; //[CLlength] |
35 |
pam-fi |
1.1 |
Float_t *clsigma; //[CLlength] |
36 |
|
|
Int_t *cladc; //[CLlength] |
37 |
|
|
Bool_t *clbad; //[CLlength] |
38 |
|
|
|
39 |
|
|
TrkCluster(); |
40 |
|
|
~TrkCluster(); |
41 |
|
|
TrkCluster(const TrkCluster&); |
42 |
|
|
|
43 |
|
|
void Dump(); |
44 |
|
|
|
45 |
pam-fi |
1.2 |
Int_t GetLadder() { return 1+(Int_t)((maxs-1)/1024); }; ///< ladder number |
46 |
|
|
Float_t GetSignal(Float_t); ///< cluster signal |
47 |
|
|
Float_t GetSignalToNoise(Float_t); ///< cluster signal/noise |
48 |
|
|
Int_t GetMultiplicity(Float_t); ///< cluster multiplicity |
49 |
|
|
Float_t GetSignal() { return GetSignal(INC_CUT); }; |
50 |
|
|
Float_t GetSignalToNoise() { return GetSignalToNoise(INC_CUT); }; |
51 |
|
|
Int_t GetMultiplicity() { return GetMultiplicity(INC_CUT); }; |
52 |
|
|
|
53 |
|
|
Bool_t IsBad(Int_t); ///< bad-cluster flag |
54 |
|
|
|
55 |
|
|
TrkCluster* GetTrkCluster(){ return this; }; |
56 |
pam-fi |
1.1 |
|
57 |
|
|
friend class TrkLevel1; |
58 |
|
|
|
59 |
pam-fi |
1.2 |
ClassDef(TrkCluster,2); |
60 |
pam-fi |
1.1 |
|
61 |
|
|
}; |
62 |
|
|
|
63 |
|
|
/** |
64 |
|
|
* \brief Class to describe tracker LEVEL1 data. |
65 |
|
|
* |
66 |
pam-fi |
1.2 |
* A Level1 tracker event is defined as a collection of clusters ( TrkCluster objects ). |
67 |
|
|
* The result of common-noise computation for each viking is also stored ( cnev[24][12] ). |
68 |
|
|
* A general flag summarize the event status (missing sections, crc failures, decoding errors ans so on...). |
69 |
pam-fi |
1.1 |
*/ |
70 |
|
|
class TrkLevel1 : public TObject { |
71 |
|
|
|
72 |
|
|
private: |
73 |
|
|
|
74 |
|
|
public: |
75 |
|
|
|
76 |
pam-fi |
1.2 |
Int_t good[12]; ///< event status |
77 |
|
|
Float_t cnev[24][12]; ///< CN |
78 |
|
|
Int_t cnnev[24][12]; ///< number of strips for CN computation |
79 |
|
|
// Int_t fshower[12]; |
80 |
|
|
// Int_t good1; |
81 |
pam-fi |
1.1 |
// Int_t crc[12]; |
82 |
pam-fi |
1.2 |
|
83 |
pam-fi |
1.1 |
TClonesArray *Cluster; ///< clusters |
84 |
|
|
|
85 |
|
|
|
86 |
|
|
TrkLevel1(); |
87 |
|
|
|
88 |
|
|
int nclstr() {return Cluster->GetEntries();} ///< number of stored clusters |
89 |
|
|
|
90 |
|
|
void Dump(); |
91 |
|
|
void SetFromLevel1Struct(cTrkLevel1 *); |
92 |
|
|
void GetLevel1Struct(cTrkLevel1 *) const; |
93 |
|
|
void Clear(); |
94 |
|
|
|
95 |
|
|
TrkCluster* GetCluster(int); |
96 |
|
|
|
97 |
|
|
TrkLevel1* GetTrkLevel1(){return this;} |
98 |
|
|
TClonesArray* GetClusters(){return Cluster;};///< returns pointer to the cluster array |
99 |
|
|
|
100 |
pam-fi |
1.2 |
ClassDef(TrkLevel1,2); |
101 |
pam-fi |
1.1 |
|
102 |
|
|
}; |
103 |
|
|
|
104 |
|
|
|
105 |
|
|
#endif |