ViewVC Help

View File | Revision Log | Show Annotations | Root Listing

root/cvsroot/UserCode/MitAna/DataTree/interface/Vertex.h

Comparing UserCode/MitAna/DataTree/interface/Vertex.h (file contents):
Revision 1.3 by bendavid, Mon Jul 7 15:32:28 2008 UTC vs.
Revision 1.15 by bendavid, Fri Oct 22 00:05:25 2010 UTC

#	Line 3 | Line 3
3		//
4		// Vertex
5		//
6	<	// Vertex class implemented as holding a 3d vector as a point in space.
6	>	// Vertex class derived from BaseVertex holding additional fit information.
7		//
8		// Authors: J.Bendavid
9		//--------------------------------------------------------------------------------------------------
10
11	<	#ifndef DATATREE_VERTEX_H
12	<	#define DATATREE_VERTEX_H
11	>	#ifndef MITANA_DATATREE_VERTEX_H
12	>	#define MITANA_DATATREE_VERTEX_H
13
14	<	#include "MitAna/DataTree/interface/DataObject.h"
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 DataObject
21	>	class Vertex : public BaseVertex
22		{
23		public:
24	<	Vertex() : fPoint(0,0,0) {}
25	<	Vertex(Double_t x, Double_t y, Double_t z) : fPoint(x,y,z) {}
26	<	~Vertex() {}
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), 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), fIsValid(kFALSE), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
29	>	Vertex(const ThreeVector &pos) :
30	>	BaseVertex(pos), fChi2(0), fNdof(0), fAdaptiveNdof(0), fNTracks(0) {}
31
32	<	Double_t          Phi()   const { return fPoint.Phi(); }
33	<	Double_t          Rho()   const { return fPoint.Rho(); }
34	<	void              SetXYZ(Double_t x, Double_t y, Double_t z) { fPoint.SetXYZ(x,y,z); }
35	<	Double_t          X()     const { return fPoint.X();   }
36	<	Double_t          Y()     const { return fPoint.Y();   }
37	<	Double_t          Z()     const { return fPoint.Z();   }
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	>	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                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	<	ThreeVector       fPoint; //point in space
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	+
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		#endif

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines