Go to the documentation of this file. 1 #ifndef __L1Trigger_VertexFinder_VertexFinder_h__
2 #define __L1Trigger_VertexFinder_VertexFinder_h__
56 edm::LogWarning(
"VertexFinder") <<
"PrimaryVertex::No Primary Vertex has been found.";
92 return (vertex0.
pt() > vertex1.pt());
98 return (vertex0.
z0() < vertex1.z0());
106 template <
typename ForwardIterator,
typename T>
124 const std::vector<float>& bin_centers,
125 const std::vector<unsigned int>&
counts);
float CentralDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find distance between centres of two clusters.
unsigned int iterationsPerTrack() const
Number of iterations.
void SortVerticesInZ0()
Sort vertices in z.
void Kmeans()
Kmeans Algorithm.
float centralDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find distance between centres of two clusters.
RecoVertex primaryVertex() const
Reconstructed Primary Vertex.
void FastHisto(const TrackerTopology *tTopo)
Histogramming algorithm.
FitTrackCollection fitTracks_
void fastHistoLooseAssociation()
High pT Vertex Algorithm.
unsigned int numVertices() const
Number of reconstructed vertices.
double z0() const
Vertex z0 position [cm].
float MaxDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find maximum distance in two clusters of tracks.
void DBSCAN()
DBSCAN algorithm.
void AdaptiveVertexReconstruction()
Vertexing algorithms.
std::vector< RecoVertex<> > RecoVertexCollection
Log< level::Warning, false > LogWarning
bool operator()(const L1Track track0, const L1Track track1)
unsigned int NumIterations() const
Number of iterations.
void AgglomerativeHierarchicalClustering()
Simple Merge Algorithm.
void fastHisto(const TrackerTopology *tTopo)
Histogramming algorithm.
bool operator()(const L1Track track0, const L1Track track1)
const AlgoSettings * settings_
void PVR()
Principal Vertex Reconstructor algorithm.
void SortVerticesInPt()
Sort vertices in pT.
void HPV()
High pT Vertex Algorithm.
unsigned int primaryVertexId() const
Reconstructed Primary Vertex Id.
void GapClustering()
Gap Clustering Algorithm.
std::vector< L1Track > FitTrackCollection
float MinDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find minimum distance in two clusters of tracks.
unsigned int numIterations() const
Number of iterations.
const std::vector< RecoVertex<> > & vertices() const
Returns the z positions of the reconstructed primary vertices.
unsigned int numInputTracks() const
Storage for tracks out of the L1 Track finder.
float MeanDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find average distance in two clusters of tracks.
void associatePrimaryVertex(double trueZ0)
Associate the primary vertex with the real one.
std::vector< RecoVertex<> > vertices_
unsigned int IterationsPerTrack() const
Accessors.
void computeAndSetVertexParameters(RecoVertex<> &vertex, const std::vector< float > &bin_centers, const std::vector< unsigned int > &counts)
Compute the vertex parameters.
VertexFinder(FitTrackCollection &fitTracks, const AlgoSettings &settings)
Constructor and destructor.
unsigned int numMatchedVertices_
void findPrimaryVertex()
Find the primary vertex.
float minDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find minimum distance in two clusters of tracks.
void strided_iota(ForwardIterator first, ForwardIterator last, T value, T stride)
const FitTrackCollection & fitTracks() const
Storage for tracks out of the L1 Track finder.
float maxDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find maximum distance in two clusters of tracks.
void agglomerativeHierarchicalClustering()
Simple Merge Algorithm.
float meanDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find average distance in two clusters of tracks.
double pt() const
Sum of fitted tracks transverse momentum [GeV].
Abs< T >::type abs(const T &t)
void adaptiveVertexReconstruction()
Adaptive Vertex Reconstruction algorithm.
void FastHistoLooseAssociation()
TDR histogramming algorithmn.
Simple wrapper class for TTTrack.