| 1 |
loizides |
1.1 |
//--------------------------------------------------------------------------------------------------
|
| 2 |
bendavid |
1.15 |
// $Id: Vertex.h,v 1.14 2010/10/20 20:33:39 bendavid Exp $
|
| 3 |
loizides |
1.1 |
//
|
| 4 |
|
|
// Vertex
|
| 5 |
|
|
//
|
| 6 |
loizides |
1.10 |
// Vertex class derived from BaseVertex holding additional fit information.
|
| 7 |
loizides |
1.1 |
//
|
| 8 |
|
|
// Authors: J.Bendavid
|
| 9 |
|
|
//--------------------------------------------------------------------------------------------------
|
| 10 |
|
|
|
| 11 |
loizides |
1.5 |
#ifndef MITANA_DATATREE_VERTEX_H
|
| 12 |
|
|
#define MITANA_DATATREE_VERTEX_H
|
| 13 |
loizides |
1.1 |
|
| 14 |
bendavid |
1.4 |
#include <TMath.h>
|
| 15 |
bendavid |
1.6 |
#include "MitAna/DataTree/interface/BaseVertex.h"
|
| 16 |
bendavid |
1.13 |
#include "MitAna/DataCont/interface/RefArray.h"
|
| 17 |
|
|
#include "MitAna/DataTree/interface/Track.h"
|
| 18 |
loizides |
1.1 |
|
| 19 |
|
|
namespace mithep
|
| 20 |
|
|
{
|
| 21 |
bendavid |
1.6 |
class Vertex : public BaseVertex
|
| 22 |
loizides |
1.1 |
{
|
| 23 |
|
|
public:
|
| 24 |
bendavid |
1.15 |
Vertex() : fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
|
| 25 |
loizides |
1.5 |
Vertex(Double_t x, Double_t y, Double_t z) :
|
| 26 |
bendavid |
1.14 |
BaseVertex(x,y,z), fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
|
| 27 |
bendavid |
1.4 |
Vertex(Double_t x, Double_t y, Double_t z, Double_t xErr, Double_t yErr, Double_t zErr) :
|
| 28 |
bendavid |
1.14 |
BaseVertex(x,y,z,xErr,yErr,zErr), fChi2(0), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
|
| 29 |
loizides |
1.8 |
Vertex(const ThreeVector &pos) :
|
| 30 |
bendavid |
1.14 |
BaseVertex(pos), fChi2(0), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
|
| 31 |
loizides |
1.1 |
|
| 32 |
bendavid |
1.13 |
void AddTrack(const Track *t) { fTracks.Add(t); }
|
| 33 |
|
|
Double_t Chi2() const { return fChi2; }
|
| 34 |
loizides |
1.11 |
Int_t Compare(const TObject *o) const;
|
| 35 |
bendavid |
1.13 |
Bool_t HasTrack(const Track *t) const { return fTracks.HasObject(t); }
|
| 36 |
loizides |
1.12 |
Bool_t IsSortable() const { return kTRUE; }
|
| 37 |
bendavid |
1.13 |
Bool_t IsValid() const { return fIsValid; }
|
| 38 |
bendavid |
1.14 |
Double_t Ndof() const { return (fAdaptiveNdof>0.0 ? fAdaptiveNdof:fNdof); }
|
| 39 |
bendavid |
1.13 |
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 SetIsValid(Bool_t b) { fIsValid = b; }
|
| 45 |
bendavid |
1.14 |
void SetNdof(Double_t nDof) { fAdaptiveNdof = nDof; }
|
| 46 |
bendavid |
1.13 |
void SetNTracksFit(UInt_t n) { fNTracks = n; }
|
| 47 |
|
|
const Track *Trk(UInt_t i) const { return fTracks.At(i); }
|
| 48 |
loizides |
1.1 |
|
| 49 |
|
|
protected:
|
| 50 |
loizides |
1.9 |
Double32_t fChi2; //[0,0,12]chi squared of conversion vertex fit
|
| 51 |
bendavid |
1.13 |
Bool_t fIsValid; //is vertex valid
|
| 52 |
loizides |
1.9 |
UShort_t fNdof; //number of degrees of freedom of conversion vertex fit
|
| 53 |
bendavid |
1.14 |
Double32_t fAdaptiveNdof; //number of degrees of freedom of vertex fit (can be non-integer for weighted components)
|
| 54 |
loizides |
1.9 |
UShort_t fNTracks; //number of tracks used for the fit
|
| 55 |
bendavid |
1.13 |
RefArray<Track> fTracks; //tracks associated with the PV
|
| 56 |
loizides |
1.1 |
|
| 57 |
bendavid |
1.14 |
ClassDef(Vertex, 3) // Vertex class
|
| 58 |
loizides |
1.1 |
};
|
| 59 |
|
|
}
|
| 60 |
loizides |
1.11 |
|
| 61 |
|
|
//--------------------------------------------------------------------------------------------------
|
| 62 |
|
|
inline Int_t mithep::Vertex::Compare(const TObject *o) const
|
| 63 |
|
|
{
|
| 64 |
|
|
// Default compare function for sorting according to transverse momentum.
|
| 65 |
|
|
// Returns -1 if this object is smaller than given object, 0 if objects are
|
| 66 |
|
|
// equal and 1 if this is larger than given object.
|
| 67 |
|
|
|
| 68 |
|
|
const mithep::Vertex *v = dynamic_cast<const mithep::Vertex *>(o);
|
| 69 |
|
|
if (!v)
|
| 70 |
|
|
return 1;
|
| 71 |
|
|
|
| 72 |
|
|
Int_t myn = NTracks();
|
| 73 |
|
|
Int_t n = v->NTracks();
|
| 74 |
|
|
if (myn>n)
|
| 75 |
|
|
return -1;
|
| 76 |
|
|
else if (n>myn)
|
| 77 |
|
|
return +1;
|
| 78 |
|
|
|
| 79 |
|
|
Double_t myd = Chi2();
|
| 80 |
|
|
Double_t d = v->Chi2();
|
| 81 |
|
|
if (myd<d)
|
| 82 |
|
|
return -1;
|
| 83 |
|
|
else if (d<myd)
|
| 84 |
|
|
return +1;
|
| 85 |
|
|
|
| 86 |
|
|
return 0;
|
| 87 |
|
|
}
|
| 88 |
loizides |
1.1 |
#endif
|
