RPCClusterizer Class Reference

#include <RPCClusterizer.h>

Public Member Functions
RPCClusterContainer	doAction (const RPCDigiCollection::Range &digiRange)
	RPCClusterizer ()
	~RPCClusterizer ()

Detailed Description

Author

M. Maggi – INFN Bari

Definition at line 11 of file RPCClusterizer.h.

Constructor & Destructor Documentation

RPCClusterizer()

RPCClusterizer::RPCClusterizer ( )

inline

Definition at line 13 of file RPCClusterizer.h.

{};

~RPCClusterizer()

RPCClusterizer::~RPCClusterizer ( )

inline

Definition at line 14 of file RPCClusterizer.h.

{};

Member Function Documentation

doAction()

RPCClusterContainer RPCClusterizer::doAction

(

const RPCDigiCollection::Range &

digiRange

)

Definition at line 3 of file RPCClusterizer.cc.

References haddnano::cl, HLT_2023v11_cff::distance, RPCCluster::isAdjacent(), RPCCluster::merge(), and GetRecoTauVFromDQM_MC_cff::next.

Referenced by RPCRecHitBaseAlgo::reconstruct().

                                                                                    {
  RPCClusterContainer 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) {
    RPCCluster cl(digi->strip(), digi->strip(), digi->bx());
    if (digi->hasTime())
      cl.addTime(digi->time());
    if (digi->hasY())
      cl.addY(digi->coordinateY());
    initialCluster.insert(cl);
  }
  if (initialCluster.empty())
    return finalCluster;  // Confirm the collection is valid

  // Start from the first initial cluster
  RPCCluster 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;
}