13 |
|
|
14 |
|
#include <TMath.h> |
15 |
|
#include "MitAna/DataTree/interface/BaseVertex.h" |
16 |
+ |
#include "MitAna/DataCont/interface/RefArray.h" |
17 |
+ |
#include "MitAna/DataTree/interface/Track.h" |
18 |
|
|
19 |
|
namespace mithep |
20 |
|
{ |
21 |
|
class Vertex : public BaseVertex |
22 |
|
{ |
23 |
|
public: |
24 |
< |
Vertex() : fChi2(0), fNdof(0), fNTracks(0) {} |
24 |
> |
Vertex() : fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {} |
25 |
|
Vertex(Double_t x, Double_t y, Double_t z) : |
26 |
< |
BaseVertex(x,y,z), fChi2(0), fNdof(0), fNTracks(0) {} |
26 |
> |
BaseVertex(x,y,z), fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {} |
27 |
|
Vertex(Double_t x, Double_t y, Double_t z, Double_t xErr, Double_t yErr, Double_t zErr) : |
28 |
< |
BaseVertex(x,y,z,xErr,yErr,zErr), fChi2(0), fNdof(0), fNTracks(0) {} |
28 |
> |
BaseVertex(x,y,z,xErr,yErr,zErr), fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {} |
29 |
|
Vertex(const ThreeVector &pos) : |
30 |
< |
BaseVertex(pos), fChi2(0), fNdof(0), fNTracks(0) {} |
30 |
> |
BaseVertex(pos), fChi2(0), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {} |
31 |
|
|
32 |
+ |
void AddTrack(const Track *t) { fTracks.Add(t); } |
33 |
|
Double_t Chi2() const { return fChi2; } |
34 |
|
Int_t Compare(const TObject *o) const; |
35 |
< |
UShort_t Ndof() const { return fNdof; } |
36 |
< |
UInt_t NTracks() const { return fNTracks; } |
35 |
> |
Bool_t HasTrack(const Track *t) const { return fTracks.HasObject(t); } |
36 |
> |
Bool_t IsSortable() const { return kTRUE; } |
37 |
> |
Bool_t IsValid() const { return fIsValid; } |
38 |
> |
Double_t Ndof() const { return (fAdaptiveNdof>0.0 ? fAdaptiveNdof:fNdof); } |
39 |
> |
UInt_t NTracksFit() const { return fNTracks; } |
40 |
> |
UInt_t NTracks() const { return fTracks.Entries(); } |
41 |
|
EObjType ObjType() const { return kVertex; } |
42 |
|
Double_t Prob() const { return TMath::Prob(fChi2,fNdof); } |
43 |
< |
void SetChi2(Double_t chi2) { fChi2 = chi2; } |
44 |
< |
void SetNdof(UShort_t nDof) { fNdof = nDof; } |
45 |
< |
void SetNTracks(UShort_t ntrks) { fNTracks = ntrks; } |
43 |
> |
void SetChi2(Double_t chi2) { fChi2 = chi2; } |
44 |
> |
void SetIsValid(Bool_t b) { fIsValid = b; } |
45 |
> |
void SetNdof(Double_t nDof) { fAdaptiveNdof = nDof; } |
46 |
> |
void SetNTracksFit(UInt_t n) { fNTracks = n; } |
47 |
> |
const Track *Trk(UInt_t i) const { return fTracks.At(i); } |
48 |
|
|
49 |
|
protected: |
50 |
|
Double32_t fChi2; //[0,0,12]chi squared of conversion vertex fit |
51 |
+ |
Bool_t fIsValid; //is vertex valid |
52 |
|
UShort_t fNdof; //number of degrees of freedom of conversion vertex fit |
53 |
+ |
Double32_t fAdaptiveNdof; //number of degrees of freedom of vertex fit (can be non-integer for weighted components) |
54 |
|
UShort_t fNTracks; //number of tracks used for the fit |
55 |
+ |
RefArray<Track> fTracks; //tracks associated with the PV |
56 |
|
|
57 |
< |
ClassDef(Vertex, 1) // Vertex class |
57 |
> |
ClassDef(Vertex, 3) // Vertex class |
58 |
|
}; |
59 |
|
} |
60 |
|
|