1 #ifndef __L1Trigger_VertexFinder_VertexFinder_h__ 2 #define __L1Trigger_VertexFinder_VertexFinder_h__ 21 static constexpr
unsigned BitsToRepresent(
unsigned x) {
return x < 2 ? 1 : 1 + BitsToRepresent(x >> 1); }
68 edm::LogWarning(
"VertexFinder") <<
"PrimaryVertex::No primary vertex has been found.";
110 template <
class data_type,
typename stream_type = std::ostream>
112 std::vector<data_type>
data,
119 template <
typename ForwardIterator,
typename T>
131 const std::vector<float>& bin_centers,
132 const std::vector<unsigned int>&
counts);
bool operator()(const L1Track track0, const L1Track track1)
const FitTrackCollection & fitTracks() const
Accessors.
FitTrackCollection fitTracks_
void fastHistoLooseAssociation()
High pT Vertex Algorithm.
float maxDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find maximum distance in two clusters of tracks.
void GapClustering()
Gap Clustering Algorithm.
float meanDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find average distance in two clusters of tracks.
bool operator()(const L1Track track0, const L1Track track1)
std::vector< L1Track > FitTrackCollection
float centralDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find distance between centres of two clusters.
unsigned int numVerticesEmulation() const
Number of emulation vertices.
uint32_t T const *__restrict__ uint32_t const *__restrict__ int32_t int Histo::index_type cudaStream_t stream
void agglomerativeHierarchicalClustering()
Simple Merge Algorithm.
T PrimaryVertex() const
Reconstructed primary vertex.
unsigned int numMatchedVertices_
void adaptiveVertexReconstruction()
Adaptive Vertex Reconstruction algorithm.
void findPrimaryVertex()
Find the primary vertex.
void fastHisto(const TrackerTopology *tTopo)
Histogramming algorithm.
static constexpr unsigned BitsToRepresent(unsigned x)
const std::vector< RecoVertex<> > & vertices() const
Returns the z positions of the reconstructed primary vertices.
Simple wrapper class for TTTrack.
void printHistogram(stream_type &stream, std::vector< data_type > data, int width=80, int minimum=0, int maximum=-1, std::string title="", std::string color="")
Print an ASCII histogram.
Abs< T >::type abs(const T &t)
std::vector< VertexWord > VertexWordCollection
VertexFinder(FitTrackCollection &fitTracks, const AlgoSettings &settings)
Constructor and destructor.
RecoVertexCollection vertices_
unsigned int numInputTracks() const
Storage for tracks out of the L1 Track finder.
float minDistance(RecoVertex<> cluster0, RecoVertex<> cluster1)
Find minimum distance in two clusters of tracks.
void sortVerticesInPt()
Sort vertices in pT.
void PVR()
Find maximum distance in two clusters of tracks.
void strided_iota(ForwardIterator first, ForwardIterator last, T value, T stride)
const AlgoSettings * settings_
Precision vx_precision() const
void fastHistoEmulation()
Histogramming algorithm (emulation)
void HPV()
High pT Vertex Algorithm.
std::vector< RecoVertex<> > RecoVertexCollection
void sortVerticesInZ0()
Sort vertices in z.
l1t::VertexWordCollection verticesEmulation_
unsigned int numIterations() const
Number of iterations.
char data[epos_bytes_allocation]
void Kmeans()
Kmeans Algorithm.
void associatePrimaryVertex(double trueZ0)
Associate the primary vertex with the real one.
const l1t::VertexWordCollection & verticesEmulation() const
Returns the emulation primary vertices.
unsigned int primaryVertexId() const
Reconstructed Primary Vertex Id.
Log< level::Warning, false > LogWarning
unsigned int numVertices() const
Number of reconstructed vertices.
unsigned int iterationsPerTrack() const
Number of iterations.
void DBSCAN()
DBSCAN algorithm.
void computeAndSetVertexParameters(RecoVertex<> &vertex, const std::vector< float > &bin_centers, const std::vector< unsigned int > &counts)
Vertexing algorithms.