CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
List of all members | Public Member Functions
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 ( )
inline

Definition at line 13 of file RPCClusterizer.h.

13 {};
RPCClusterizer::~RPCClusterizer ( )
inline

Definition at line 14 of file RPCClusterizer.h.

14 {};

Member Function Documentation

RPCClusterContainer RPCClusterizer::doAction ( const RPCDigiCollection::Range digiRange)

Definition at line 3 of file RPCClusterizer.cc.

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

Referenced by RPCRecHitBaseAlgo::reconstruct().

3  {
4  RPCClusterContainer initialCluster, finalCluster;
5  // Return empty container for null input
6  if (std::distance(digiRange.second, digiRange.first) == 0)
7  return finalCluster;
8 
9  // Start from single digi recHits
10  for (auto digi = digiRange.first; digi != digiRange.second; ++digi) {
11  RPCCluster cl(digi->strip(), digi->strip(), digi->bx());
12  if (digi->hasTime())
13  cl.addTime(digi->time());
14  if (digi->hasY())
15  cl.addY(digi->coordinateY());
16  initialCluster.insert(cl);
17  }
18  if (initialCluster.empty())
19  return finalCluster; // Confirm the collection is valid
20 
21  // Start from the first initial cluster
22  RPCCluster prev = *initialCluster.begin();
23 
24  // Loop over the remaining digis
25  // Note that the last one remains as open in this loop
26  for (auto cl = std::next(initialCluster.begin()); cl != initialCluster.end(); ++cl) {
27  if (prev.isAdjacent(*cl)) {
28  // Merged digi to the previous one
29  prev.merge(*cl);
30  } else {
31  // Close the previous cluster and start new cluster
32  finalCluster.insert(prev);
33  prev = *cl;
34  }
35  }
36 
37  // Finalize by adding the last cluster
38  finalCluster.insert(prev);
39 
40  return finalCluster;
41 }
void merge(const RPCCluster &cl)
Definition: RPCCluster.cc:47
tuple cl
Definition: haddnano.py:49
std::set< RPCCluster > RPCClusterContainer
bool isAdjacent(const RPCCluster &cl) const
Definition: RPCCluster.cc:31