VertexMatcher Class Reference

#include <VertexMatcher.h>

Inheritance diagram for VertexMatcher:

Collaboration diagram for VertexMatcher:

Public Types
typedef std::map< TIDA::Vertex *, TIDA::Vertex * >	map_type
typedef std::map< TIDA::Vertex *, TIDA::Vertex * >	rmap_type

Public Member Functions
	VertexMatcher (const std::string &s, double d=3)
	~VertexMatcher ()
virtual BestMatcher< TIDA::Vertex > *	clone () override
virtual double	distance (const TIDA::Vertex *v0, const TIDA::Vertex *v1) const override
virtual void	match (const std::vector< TIDA::Vertex * > &ref, const std::vector< TIDA::Vertex * > &test)
virtual const TIDA::Vertex *	matched (TIDA::Vertex *t)
const map_type &	matched () const
virtual const TIDA::Vertex *	revmatched (TIDA::Vertex *t)
const rmap_type &	revmatched () const
void	clear ()
unsigned	size () const

Protected Member Functions
std::map< int, int >	matcher (const std::vector< Tp * > &ref, const std::vector< Tq * > &test)

Protected Attributes
double	m_d
std::string	mname
map_type	mmatched
rmap_type	mrevmatched

Detailed Description

Definition at line 22 of file VertexMatcher.h.

Member Typedef Documentation

map_type

typedef std::map<TIDA::Vertex *, TIDA::Vertex *> TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::map_type

inherited

Definition at line 28 of file TIDAAssociator.h.

rmap_type

typedef std::map<TIDA::Vertex *, TIDA::Vertex *> TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::rmap_type

inherited

Definition at line 29 of file TIDAAssociator.h.

Constructor & Destructor Documentation

VertexMatcher()

VertexMatcher::VertexMatcher ( const std::string &  s, double  d = 3  )

inline

Definition at line 26 of file VertexMatcher.h.

: BestMatcher<TIDA::Vertex>( s, d*d ) { }  

~VertexMatcher()

VertexMatcher::~VertexMatcher ( )

inline

Definition at line 28 of file VertexMatcher.h.

{ }

Member Function Documentation

clear()

void TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::clear

inlineinherited

Definition at line 63 of file TIDAAssociator.h.

{ mmatched.clear(); mrevmatched.clear(); } 

clone()

virtual BestMatcher<TIDA::Vertex>* VertexMatcher::clone ( )

inlineoverridevirtual

Implements TIDA::Associator< TIDA::Vertex, TIDA::Vertex >.

Definition at line 30 of file VertexMatcher.h.

{ return new VertexMatcher(*this); }

distance()

virtual double VertexMatcher::distance ( const TIDA::Vertex *  v0, const TIDA::Vertex *  v1  ) const

inlineoverridevirtual

ha ha ha, divide by the "expected uncertainty" you must be MAD

Implements BestMatcher< TIDA::Vertex >.

Definition at line 32 of file VertexMatcher.h.

                                                                                       {
    double d = (v0->z()-v1->z());
    return d*d;
 
    //    if ( v0->dz() && v1->dz() ) return d*d/( v0->dz()*v0->dz() + v1->dz()*v1->dz() );
    //    else                        return d*d;
 };

match()

virtual void BestMatcher< TIDA::Vertex , TIDA::Vertex >::match ( const std::vector< TIDA::Vertex * > &  ref, const std::vector< TIDA::Vertex * > &  test  )

inlinevirtualinherited

Implements TIDA::Associator< TIDA::Vertex, TIDA::Vertex >.

Definition at line 68 of file BestMatcher.h.

  {
    this->clear();
    
    std::map<int,int> matched = matcher( ref, test);
 
    std::map<int,int>::iterator  mitr = matched.begin();
    while ( mitr!=matched.end() ) {
      this->mmatched.insert(    typename TIDA::Associator<T,S>::map_type::value_type( ref[mitr->first],   test[mitr->second]) );
      this->mrevmatched.insert( typename TIDA::Associator<S,T>::map_type::value_type( test[mitr->second], ref[mitr->first] ) );
      ++mitr;
    }  
 
  }

matched() [1/2]

const map_type& TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::matched

inlineinherited

Definition at line 59 of file TIDAAssociator.h.

{ return mmatched; }

matched() [2/2]

virtual const TIDA::Vertex * TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::matched ( TIDA::Vertex *  t )

inlinevirtualinherited

Definition at line 45 of file TIDAAssociator.h.

                                  { 
     typename map_type::const_iterator titr = mmatched.find(t);
     if ( titr != mmatched.end() ) return titr->second;
     else                          return 0;
  } 

matcher()

std::map<int, int> BestMatcher< TIDA::Vertex , TIDA::Vertex >::matcher ( const std::vector< Tp * > &  ref, const std::vector< Tq * > &  test  )

inlineprotectedinherited

inserting into a multimatch sorts them into order as they are added so you get the list of best matches imediately NB: probably quicker to add them to a vector and then sort them afterward

now go through from best to worst, adding to another sorted set only the matches that do not use tracks already used by a better matching pair already found

set of unique track pairings NB: for some reason, using the multiset is faster than using a vector, even though we are only iterating through it later

hooray!! now print out the answer, make a map etc this isn't technically needed, could just use the set of "matched" objects, but hey ho

Definition at line 91 of file BestMatcher.h.

                                                                                    { 
    
    
    std::multiset<matched_> m;
    
    for (unsigned int i=0 ; i<ref.size() ; i++ ) { 
      
      for (unsigned int j=0 ; j<test.size() ; j++ ) { 
    double d = distance(ref[i], test[j]);   
    if ( d<m_d ){  
      m.insert( matched_(d, i, j) ); 
    }
      }
    }
    
    
    std::vector<bool>  refused(  ref.size(), false ); 
    std::vector<bool> testused( test.size(), false ); 
 
    std::multiset<matched_> unique;
 
    typename std::multiset<matched_>::iterator mitr = m.begin();
    
    double  chi2 = 0;
    
    for ( ; mitr!=m.end() ; ++mitr ) {
 
      int rind = mitr->first();
      int tind = mitr->second();
 
      if (  refused[rind] ) continue;
      if ( testused[tind] ) continue;
 
      refused[rind]  = true;
      testused[tind] = true;
 
      unique.insert( *mitr );
 
      chi2 += (mitr->d()*mitr->d());
 
    }
    
    
    //    std::cout << "chi2 of matches " << chi2 << std::endl;
   
    
    //  std::cout << "\nmatched" << std::endl; 
    
    std::map<int, int> matches;
 
 
    mitr = unique.begin();
    while ( mitr!=unique.end() ) {
      matches.insert( std::map<int, int>::value_type( mitr->first(), mitr->second() ) );
      //   std::cout << "\tbest match " << *mitr << "\t" <<  ref[mitr->first()] << "\t" << test[mitr->second()] << std::endl;
      ++mitr;
    }  
 
    return matches;
    
  }

revmatched() [1/2]

const rmap_type& TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::revmatched

inlineinherited

Definition at line 60 of file TIDAAssociator.h.

{ return mrevmatched; }

revmatched() [2/2]

virtual const TIDA::Vertex * TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::revmatched ( TIDA::Vertex *  t )

inlinevirtualinherited

Definition at line 52 of file TIDAAssociator.h.

                                     { 
     typename rmap_type::const_iterator titr = mrevmatched.find(t);
     if ( titr != mrevmatched.end() ) return titr->second;
     else                             return 0;
  } 

size()

unsigned TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::size

inlineinherited

Definition at line 66 of file TIDAAssociator.h.

{ return mmatched.size(); }

Member Data Documentation

m_d

double BestMatcher< TIDA::Vertex , TIDA::Vertex >::m_d

protectedinherited

Definition at line 171 of file BestMatcher.h.

mmatched

map_type TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::mmatched

protectedinherited

Definition at line 73 of file TIDAAssociator.h.

mname

std::string TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::mname

protectedinherited

Definition at line 71 of file TIDAAssociator.h.

mrevmatched

rmap_type TIDA::Associator< TIDA::Vertex , TIDA::Vertex >::mrevmatched

protectedinherited

Definition at line 74 of file TIDAAssociator.h.

---

The documentation for this class was generated from the following file:

• VertexMatcher.h