13 /**************************************************************************/
15 /**************************************************************************/
17 // Basic structures for Reve. Design criteria:
19 // * provide basic cross-referencing functionality;
21 // * small memory/disk footprint (floats / count on compression in
24 // * simple usage from tree selections;
26 // * placement in TClonesArray (composites are TObject derived);
28 // * minimal member-naming (impossible to make everybody happy).
30 void DisablePODTObjectStreamers();
32 /**************************************************************************/
34 /**************************************************************************/
36 // Minimal Float_t copy of TVector3.
37 // Used to represent points and momenta.
44 Vector() : x(0), y(0), z(0) {}
45 Vector(Float_t _x, Float_t _y, Float_t _z) : x(_x), y(_y), z(_z) {}
48 Float_t* c_vec() { return &x; }
49 void Set(Float_t* v) { x=v[0]; y=v[1]; z=v[2]; }
50 void Set(Double_t* v) { x=v[0]; y=v[1]; z=v[2]; }
51 void Set(Float_t _x, Float_t _y, Float_t _z) { x=_x; y=_y; z=_z; }
52 void Set(Double_t _x, Double_t _y, Double_t _z) { x=_x; y=_y; z=_z; }
53 void Set(const TVector3& v) { x=v.x(); y=v.y(); z=v.z(); }
56 Float_t Theta() const;
57 Float_t CosTheta() const;
60 Float_t Mag() const { return TMath::Sqrt(x*x+y*y+z*z);}
61 Float_t Mag2() const { return x*x+y*y+z*z;}
63 Float_t Perp() const { return TMath::Sqrt(x*x+y*y);}
64 Float_t Perp2() const { return x*x+y*y;}
65 Float_t R() const { return Perp(); }
67 Float_t Distance(const Vector& v) const;
68 Float_t SquareDistance(const Vector& v) const;
73 inline Float_t Vector::Phi() const
74 { return x == 0.0 && y == 0.0 ? 0.0 : TMath::ATan2(y,x); }
76 inline Float_t Vector::Theta() const
77 { return x == 0.0 && y == 0.0 && z == 0.0 ? 0.0 : TMath::ATan2(Perp(),z); }
79 inline Float_t Vector::CosTheta() const
80 { Float_t ptot = Mag(); return ptot == 0.0 ? 1.0 : z/ptot; }
82 inline Float_t Vector::Distance( const Vector& b) const
84 return TMath::Sqrt((x - b.x)*(x - b.x) + (y - b.y)*(y - b.y) + (z - b.z)*(z - b.z));
86 inline Float_t Vector::SquareDistance(const Vector& b) const
88 return ((x - b.x)*(x - b.x) + (y - b.y)*(y - b.y) + (z - b.z)*(z - b.z));
91 /**************************************************************************/
93 /**************************************************************************/
98 enum Type_e { Reference, Daughter, Decay };
104 PathMark(Type_e t=Reference) : V(), P(), time (0), type(t) {}
105 virtual ~PathMark() {}
107 const char* type_name();
109 ClassDef(PathMark, 1);
112 /**************************************************************************/
114 /**************************************************************************/
116 class MCTrack : public TParticle // ?? Copy stuff over ??
119 Int_t label; // Label of the track
120 Int_t index; // Index of the track (in some source array)
121 Int_t eva_label; // Label of primary particle
123 Bool_t decayed; // True if decayed during tracking.
124 // ?? Perhaps end-of-tracking point/momentum would be better.
125 Float_t t_decay; // Decay time
126 Vector V_decay; // Decay vertex
127 Vector P_decay; // Decay momentum
129 MCTrack() : label(-1), index(-1), eva_label(-1),
130 decayed(false), t_decay(0), V_decay(), P_decay() {}
131 virtual ~MCTrack() {}
133 MCTrack& operator=(const TParticle& p)
134 { *((TParticle*)this) = p; return *this; }
136 void ResetPdgCode() { fPdgCode = 0; }
138 ClassDef(MCTrack, 1);
142 /**************************************************************************/
144 /**************************************************************************/
148 class MCTrackRef : public TObject
158 MCTrackRef() : label(-1), status(-1), V(), P(), length(0), time(0) {}
159 virtual ~MCTrackRef() {}
161 ClassDef(MCTrackRef, 1)
165 /**************************************************************************/
167 /**************************************************************************/
169 // Representation of a hit.
171 // Members det_id (and subdet_id) serve for cross-referencing into
172 // geometry. Hits should be stored in det_id (+some label ordering) in
173 // order to maximize branch compression.
176 class Hit : public TObject
179 UShort_t det_id; // Custom detector id
180 UShort_t subdet_id; // Custom sub-detector id
181 Int_t label; // Label of particle that produced the hit
185 // ?? Float_t charge. Probably specific.
187 Hit() : det_id(0), subdet_id(0), label(0), eva_label(0), V() {}
194 /**************************************************************************/
196 /**************************************************************************/
198 // Base class for reconstructed clusters
200 // ?? Should Hit and cluster have common base? No.
202 class Cluster : public TObject
205 UShort_t det_id; // Custom detector id
206 UShort_t subdet_id; // Custom sub-detector id
207 Int_t label[3]; // Labels of particles that contributed hits
208 // ?? Should include reconstructed track using it? Rather not, separate.
211 // Vector W; // Cluster widths
212 // ?? Coord system? Special variables Wz, Wy?
214 Cluster() : det_id(0), subdet_id(0), V() { label[0] = label[1] = label [2] = 0; }
215 virtual ~Cluster() {}
217 ClassDef(Cluster, 1);
221 /**************************************************************************/
223 /**************************************************************************/
225 class RecTrack : public TObject
228 Int_t label; // Label of the track
229 Int_t index; // Index of the track (in some source array)
230 Int_t status; // Status as exported from reconstruction
232 Vector V; // Start vertex from reconstruction
233 Vector P; // Reconstructed momentum at start vertex
238 RecTrack() : label(-1), index(-1), status(0), sign(0), V(), P(), beta(0) {}
239 virtual ~RecTrack() {}
241 Float_t Pt() { return P.Perp(); }
243 ClassDef(RecTrack, 1);
246 // Another class with specified points/clusters
249 /**************************************************************************/
251 /**************************************************************************/
253 class RecKink : public RecTrack
256 Int_t label_sec; // Label of the secondary track
257 Vector V_end; // End vertex: last point on the primary track
258 Vector V_kink; // Kink vertex: reconstructed position of the kink
259 Vector P_sec; // Momentum of secondary track
261 RecKink() : RecTrack(), label_sec(0), V_end(), V_kink(), P_sec() {}
262 virtual ~RecKink() {}
264 ClassDef(RecKink, 1);
268 /**************************************************************************/
270 /**************************************************************************/
272 class RecV0 : public TObject
277 Vector V_neg; // Vertex of negative track
278 Vector P_neg; // Momentum of negative track
279 Vector V_pos; // Vertex of positive track
280 Vector P_pos; // Momentum of positive track
282 Vector V_ca; // Point of closest approach
283 Vector V0_birth; // Reconstucted birth point of neutral particle
285 // ? Data from simulation.
286 Int_t label; // Neutral mother label read from kinematics
287 Int_t pdg; // PDG code of mother
288 Int_t d_label[2]; // Daughter labels ?? Rec labels present anyway.
290 RecV0() : status(), V_neg(), P_neg(), V_pos(), P_pos(),
291 V_ca(), V0_birth(), label(0), pdg(0)
292 { d_label[0] = d_label[1] = 0; }
298 /**************************************************************************/
299 /**************************************************************************/
301 // Missing primary vertex.
303 // Missing GenInfo, RecInfo.
305 class GenInfo : public TObject
308 Bool_t is_rec; // is reconstructed
315 GenInfo() : is_rec(false), has_V0(false), has_kink(false),
316 label(0), n_hits(0), n_clus(0) {}
317 virtual ~GenInfo() {}
319 ClassDef(GenInfo, 1);
322 /**************************************************************************/
323 /**************************************************************************/
325 // This whole construction is highly embarrassing. It requires
326 // shameless copying of experiment data. What is good about this
329 // 1) Filters can be applied at copy time so that only part of the
330 // data is copied over.
332 // 2) Once the data is extracted it can be used without experiment
333 // software. Thus, external service can provide this data and local
334 // client can be really thin.
336 // 3) Some pretty advanced visualization schemes/selections can be
337 // implemented in a general framework by providing data extractors
338 // only. This is also good for PR or VIP displays.
340 // 4) These classes can be extended by particular implementations. The
341 // container classes will use TClonesArray with user-specified element
344 // The common behaviour could be implemented entirely without usage of
345 // a common base classes, by just specifying names of members that
346 // retrieve specific data. This is fine as long as one only uses tree
347 // selections but becomes painful for extraction of data into local
348 // structures (could a) use interpreter but this is an overkill and
349 // would cause serious trouble for multi-threaded environment; b) use
350 // member offsets and data-types from the dictionary).