gar::rec::alg Namespace Reference

Classes
class	AlgCluster
class	EnergyCut
class	GenericCluster
class	GenericClusterVec
class	GenericHit
class	GenericHitVec
class	KNNClusterAlg
class	NNDistance
class	StripSplitterAlg
class	XIndex

Typedefs
typedef std::vector< gar::rec::CaloHit * >	CaloHitVec
typedef std::vector< gar::rec::Track * >	TrackVec
typedef std::vector< gar::rec::Cluster * >	ClusterVec

Functions
template<class In , class Out , class Pred >
void	cluster (In first, In last, Out result, Pred *pred)
template<class T , class Pred >
void	addToGenericHitVec (GenericHitVec< T > &v, CaloHitVec vec, Pred pred)
template<class T , class Pred , class Order >
void	addToGenericHitVec (GenericHitVec< T > &v, CaloHitVec vec, Pred pred, Order order)

Typedef Documentation

typedef std::vector<gar::rec::CaloHit*> gar::rec::alg::CaloHitVec

Definition at line 36 of file KNNClusterAlg.h.

typedef std::vector<gar::rec::Cluster*> gar::rec::alg::ClusterVec

Definition at line 38 of file KNNClusterAlg.h.

typedef std::vector<gar::rec::Track*> gar::rec::alg::TrackVec

Definition at line 37 of file KNNClusterAlg.h.

Function Documentation

template<class T , class Pred >

void gar::rec::alg::addToGenericHitVec	(	GenericHitVec< T > &	v,
		CaloHitVec	vec,
		Pred	pred
	)

Helper method that copies all hit pointers from an LCIO collection that fullfill the predicate to a GenericHitVec. The predicate can either be a bool funtion or functor that takes a T*, e.g.

See also

EnergyCut

Definition at line 208 of file NNClusters.h.

                                                                              {

        for( unsigned int i=0 ; i < vec.size() ; i++ ){

          T* hit = dynamic_cast<T*>( vec.at(i) ) ;

          if( pred( hit ) ){

            v.push_back( new GenericHit<T>( hit ) ) ;
          }
        }
      }

template<class T , class Pred , class Order >

void gar::rec::alg::addToGenericHitVec	(	GenericHitVec< T > &	v,
		CaloHitVec	vec,
		Pred	pred,
		Order	order
	)

Same as addToGenericHitVec(GenericHitVec<T>& v, CaloHitList vec, Pred pred ) except that an additional order function/functor can be given that defines the index of the hit, e.g.

See also

ZIndex.

Definition at line 226 of file NNClusters.h.

                                                                                            {

        for( unsigned int i=0 ; i < vec.size() ; i++ ){

          T* hit = dynamic_cast<T*>( vec.at(i) ) ;

          if( pred( hit ) ){

            v.push_back( new GenericHit<T>( hit , order(hit) ) ) ;
          }
        }
      }

template<class In , class Out , class Pred >

void gar::rec::alg::cluster	(	In	first,
		In	last,
		Out	result,
		Pred *	pred
	)

Simple nearest neighbour (NN) clustering algorithm. Users have to provide an input iterator of GenericHit objects and an output iterator for the clusters found. The predicate has to have a method with the following signature: bool mergeHits( GenericHit<T>*, GenericHit<T>*) where T is the original (LCIO) type of the hit objects. All pairs of hits for which this method returns 'true' will be merged into one output cluster - all other pairs of hits will be in distinct clusters.

$see GenericCluster

See also

GenericHit

NNDistance

Author

F.Gaede (DESY)

Version

Id

NNClusters.h,v 1.5 2007-06-05 15:35:49 engels Exp

Definition at line 41 of file NNClusters.h.

                                                                {

        //unused clang caught it: typedef typename In::value_type GenericHitPtr ;
        typedef typename Pred::hit_type HitType ;

        typedef std::vector< GenericCluster<HitType >* >  ClusterList ;

        ClusterList tmp ;
        tmp.reserve( 1024 ) ;

        //   int i(0),j(0) ;

        while( first != last ) {

          //     j=i+1 ;

          for( In other = first+1 ; other != last  ; other ++ ) {

            //       std::cout << "  in nested loop " << i << " , " << j << std::endl ;

            if( pred->mergeHits( (*first) , (*other) ) ) {

              if( (*first)->second == 0 && (*other)->second == 0 ) {  // no cluster exists

                GenericCluster<HitType >* cl = new GenericCluster<HitType >( (*first) ) ;

                cl->addHit( (*other) ) ;

                tmp.push_back( cl ) ;

              }
              else if( (*first)->second != 0 && (*other)->second != 0 ) { // two clusters

                //        if(  (*first)->second == (*other)->second )
                //          std::cout << " Merging identical clusters !? " << std::endl ;

                if(  (*first)->second != (*other)->second )  // this is a bug fix for old gcc 3.2 compiler !
                (*first)->second->mergeClusters( (*other)->second ) ;

              } else {  // one cluster exists

                if( (*first)->second != 0 ) {

                  (*first)->second->addHit( (*other)  ) ;

                } else {

                  (*other)->second->addHit( (*first)  ) ;
                }
              }

            } // dCut
            //       ++j ;
          }
          //     ++i ;
          ++first ;
        }

        // remove empty clusters
        //   std::remove_copy_if( tmp.begin() , tmp.end() , result , &empty_list< GenericCluster<HitType > > ) ;

        for( typename ClusterList::iterator i = tmp.begin(); i !=  tmp.end() ; i++ ){

          if( (*i)->size() > 0 ) {

            result++ = *i ;
          }
          else {  delete *i ; }
        }
      }