#include <PVClusterComparer.h>
Public Member Functions | |
bool | operator() (const PVCluster &v1, const PVCluster &v2) const |
Use this operator in a std::sort to sort them in decreasing sumPt. | |
bool | operator() (const reco::Vertex &v1, const reco::Vertex &v2) const |
double | pTSquaredSum (const PVCluster &v) const |
Calculate sum of square of the pT's of the tracks in the vertex. | |
double | pTSquaredSum (const reco::Vertex &v) const |
PVClusterComparer () | |
Constructor does nothing, no data members. |
RecoPixelVertexing/PixelVertexFinding/PVClusterComparer.h This helper class is used to sort the collection of vertexes by sumPt. It is used in DivisiveVertexFinder. The sum of the squares of the pT is only done for tracks with pT>2.5 GeV. If the pT>10 GeV, then the max value of 10 is used. (The pT of pixel tracks is not very precise.)
Definition at line 18 of file PVClusterComparer.h.
PVClusterComparer::PVClusterComparer | ( | ) |
Use this operator in a std::sort to sort them in decreasing sumPt.
Definition at line 30 of file PVClusterComparer.cc.
References pTSquaredSum().
{ return ( pTSquaredSum(v1) > pTSquaredSum(v2) ); }
bool PVClusterComparer::operator() | ( | const reco::Vertex & | v1, |
const reco::Vertex & | v2 | ||
) | const |
Definition at line 33 of file PVClusterComparer.cc.
References pTSquaredSum().
{ return ( pTSquaredSum(v1) > pTSquaredSum(v2) ); }
double PVClusterComparer::pTSquaredSum | ( | const PVCluster & | v | ) | const |
Calculate sum of square of the pT's of the tracks in the vertex.
Definition at line 7 of file PVClusterComparer.cc.
References i.
Referenced by operator()().
double PVClusterComparer::pTSquaredSum | ( | const reco::Vertex & | v | ) | const |
Definition at line 18 of file PVClusterComparer.cc.
References i, reco::Vertex::tracks_begin(), and reco::Vertex::tracks_end().
{ double sum=0; for (reco::Vertex::trackRef_iterator i=v.tracks_begin(); i!=v.tracks_end(); ++i) { double pt = (*i)->pt(); if (pt > 2.5) { // Don't count tracks below 2.5 GeV if (pt > 10.0) pt = 10.0; sum += pt*pt; } } return sum; }