11#ifndef VERTEXNEWMATCHER_H
12#define VERTEXNEWMATCHER_H
34 virtual std::unique_ptr<VertexAssociator>
uclone()
const override {
return std::make_unique<VertexNewMatcher>(*
this); }
39 const std::vector<TIDA::Track*>& refTracks= v0->tracks();
40 const std::vector<TIDA::Track*>& testTracks = v1->
tracks();
44 track_matcher.
match( refTracks, testTracks );
46 double n_matches = (double)track_matcher.
size();
47 double eff = n_matches/refTracks.size();
50 return (1-eff)*(1-eff);
truely generic template class of a best matching algorithm based on an efficient implementation of th...
TIDA::Associator< TIDA::Vertex > VertexAssociator
std::ostream & operator<<(std::ostream &s, const VertexNewMatcher &)
virtual void match(const std::vector< T * > &ref, const std::vector< S * > &test)
BestMatcher(const std::string &name, double d)
const std::vector< TIDA::Track * > & tracks() const
VertexNewMatcher(const std::string &s, double d=0.5)
virtual std::unique_ptr< VertexAssociator > uclone() const override
BestMatcher< TIDA::Vertex > * clone() override
virtual double distance(const TIDA::Vertex *v0, const TIDA::Vertex *v1) const override