Phase2TrackerClusterizerSequentialAlgorithm Class Reference

#include <Phase2TrackerClusterizerSequentialAlgorithm.h>

Public Member Functions
void	clusterizeDetUnit (const edm::DetSet< Phase2TrackerDigi > &, Phase2TrackerCluster1DCollectionNew::FastFiller &) const

Detailed Description

Definition at line 9 of file Phase2TrackerClusterizerSequentialAlgorithm.h.

Member Function Documentation

void Phase2TrackerClusterizerSequentialAlgorithm::clusterizeDetUnit ( const edm::DetSet< Phase2TrackerDigi > &  digis, Phase2TrackerCluster1DCollectionNew::FastFiller &  clusters  ) const

inline

Definition at line 15 of file Phase2TrackerClusterizerSequentialAlgorithm.h.

References edm::DetSet< T >::begin(), gather_cfg::cout, edm::DetSet< T >::empty(), edm::DetSet< T >::end(), Phase2TrackerDigi::overThreshold(), callgraph::previous, and edmNew::DetSetVector< T >::FastFiller::push_back().

                                                                                                              {
  if (digis.empty())
    return;
  auto di = digis.begin();
  unsigned int sizeCluster = 1;
  Phase2TrackerDigi firstDigi = *di;
  bool HIPbit = firstDigi.overThreshold();
  auto previous = firstDigi;
  ++di;
  for (; di != digis.end(); ++di) {
    auto digi = *di;
#ifdef VERIFY_PH2_TK_CLUS
    if (!(previous < digi))
      std::cout << "not ordered " << previous << ' ' << digi << std::endl;
#endif
    if (digi - previous == 1) {
      HIPbit |= digi.overThreshold();
      ++sizeCluster;
    } else {
      clusters.push_back(Phase2TrackerCluster1D(firstDigi, sizeCluster, HIPbit));
      firstDigi = digi;
      HIPbit = digi.overThreshold();
      sizeCluster = 1;
    }
    previous = digi;
  }
  clusters.push_back(Phase2TrackerCluster1D(firstDigi, sizeCluster, HIPbit));
}