GEMClusterizer Class Reference

#include <GEMClusterizer.h>

Public Member Functions
GEMClusterContainer	doAction (const GEMDigiCollection::Range &digiRange)
	GEMClusterizer ()
	~GEMClusterizer ()

Detailed Description

Author

M. Maggi – INFN Bari

Definition at line 11 of file GEMClusterizer.h.

Constructor & Destructor Documentation

GEMClusterizer::GEMClusterizer ( )

inline

Definition at line 13 of file GEMClusterizer.h.

{};

GEMClusterizer::~GEMClusterizer ( )

inline

Definition at line 14 of file GEMClusterizer.h.

References doAction().

{};

Member Function Documentation

GEMClusterContainer GEMClusterizer::doAction

(

const GEMDigiCollection::Range &

digiRange

)

Definition at line 3 of file GEMClusterizer.cc.

References GetRecoTauVFromDQM_MC_cff::cl, SoftLeptonByDistance_cfi::distance, GEMCluster::isAdjacent(), GEMCluster::merge(), and GetRecoTauVFromDQM_MC_cff::next.

Referenced by GEMRecHitBaseAlgo::reconstruct(), and ~GEMClusterizer().

{
  GEMClusterContainer initialCluster, finalCluster;
  // Return empty container for null input
  if ( std::distance(digiRange.second, digiRange.first) == 0 ) return finalCluster;

  // Start from single digi recHits
  for ( auto digi = digiRange.first; digi != digiRange.second; ++digi ) {
    GEMCluster cl(digi->strip(), digi->strip(), digi->bx());
    initialCluster.insert(cl);
  }
  if ( initialCluster.empty() ) return finalCluster; // Confirm the collection is valid

  // Start from the first initial cluster
  GEMCluster prev = *initialCluster.begin();

  // Loop over the remaining digis
  // Note that the last one remains as open in this loop
  for ( auto cl = std::next(initialCluster.begin()); cl != initialCluster.end(); ++cl ) {
    if ( prev.isAdjacent(*cl) ) {
      // Merged digi to the previous one
      prev.merge(*cl);
    }
    else {
      // Close the previous cluster and start new cluster
      finalCluster.insert(prev);
      prev = *cl;
    }
  }

  // Finalize by adding the last cluster
  finalCluster.insert(prev);
  
  return finalCluster;
}