CMS 3D CMS Logo

List of all members | Classes | Public Types | Public Member Functions | Private Member Functions | Private Attributes
Multi5x5ClusterAlgo Class Reference

#include <Multi5x5ClusterAlgo.h>

Classes

class  ProtoBasicCluster
 

Public Types

typedef math::XYZPoint Point
 point in the space More...
 

Public Member Functions

std::vector< reco::BasicClustermakeClusters (const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry, const CaloSubdetectorTopology *topology_p, const CaloSubdetectorGeometry *geometryES_p, reco::CaloID::Detectors detector, bool regional=false, const std::vector< RectangularEtaPhiRegion > &regions=std::vector< RectangularEtaPhiRegion >())
 
 Multi5x5ClusterAlgo ()
 
 Multi5x5ClusterAlgo (double ebst, double ecst, const std::vector< int > &v_chstatus, const PositionCalc &posCalc, bool reassignSeedCrysToClusterItSeeds=false)
 
virtual ~Multi5x5ClusterAlgo ()
 

Private Member Functions

void addCrystal (const DetId &det)
 
bool checkMaxima (CaloNavigator< DetId > &navigator, const EcalRecHitCollection *hits)
 
void mainSearch (const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry_p, const CaloSubdetectorTopology *topology_p, const CaloSubdetectorGeometry *geometryES_p)
 
void makeCluster (const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry_p, const CaloSubdetectorGeometry *geometryES_p, const EcalRecHitCollection::const_iterator &seedIt, bool seedOutside)
 
void prepareCluster (CaloNavigator< DetId > &navigator, const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry)
 

Private Attributes

std::set< DetIdcanSeed_s
 
std::vector< reco::BasicClusterclusters_v
 
std::vector< std::pair< DetId, float > > current_v
 
reco::CaloID::Detectors detector_
 The ecal region used. More...
 
double ecalBarrelSeedThreshold
 
double ecalEndcapSeedThreshold
 
PositionCalc posCalculator_
 
std::vector< ProtoBasicClusterprotoClusters_
 
bool reassignSeedCrysToClusterItSeeds_
 
const EcalRecHitCollectionrecHits_
 
std::vector< EcalRecHitseeds
 
std::set< DetIdused_s
 
std::vector< int > v_chstatus_
 
std::vector< std::pair< DetId, int > > whichClusCrysBelongsTo_
 

Detailed Description

Definition at line 27 of file Multi5x5ClusterAlgo.h.

Member Typedef Documentation

◆ Point

point in the space

Definition at line 87 of file Multi5x5ClusterAlgo.h.

Constructor & Destructor Documentation

◆ Multi5x5ClusterAlgo() [1/2]

Multi5x5ClusterAlgo::Multi5x5ClusterAlgo ( )
inline

Definition at line 59 of file Multi5x5ClusterAlgo.h.

59 {}

◆ Multi5x5ClusterAlgo() [2/2]

Multi5x5ClusterAlgo::Multi5x5ClusterAlgo ( double  ebst,
double  ecst,
const std::vector< int > &  v_chstatus,
const PositionCalc posCalc,
bool  reassignSeedCrysToClusterItSeeds = false 
)
inline

◆ ~Multi5x5ClusterAlgo()

virtual Multi5x5ClusterAlgo::~Multi5x5ClusterAlgo ( )
inlinevirtual

Definition at line 74 of file Multi5x5ClusterAlgo.h.

74 {}

Member Function Documentation

◆ addCrystal()

void Multi5x5ClusterAlgo::addCrystal ( const DetId det)
private

Definition at line 376 of file Multi5x5ClusterAlgo.cc.

References current_v, edm::SortedCollection< T, SORT >::end(), edm::SortedCollection< T, SORT >::find(), recHits_, and used_s.

Referenced by prepareCluster().

376  {
378  if ((thisIt != recHits_->end()) && (thisIt->id() != DetId(0))) {
379  if ((used_s.find(thisIt->id()) == used_s.end())) {
380  //std::cout << " ... this is a good crystal and will be added" << std::endl;
381  current_v.push_back(std::pair<DetId, float>(det, 1.)); // by default hit energy fractions are set at 1.
382  used_s.insert(det);
383  }
384  }
385 }
const EcalRecHitCollection * recHits_
std::vector< EcalRecHit >::const_iterator const_iterator
std::set< DetId > used_s
std::vector< std::pair< DetId, float > > current_v
const_iterator end() const
Definition: DetId.h:17
iterator find(key_type k)

◆ checkMaxima()

bool Multi5x5ClusterAlgo::checkMaxima ( CaloNavigator< DetId > &  navigator,
const EcalRecHitCollection hits 
)
private

Definition at line 283 of file Multi5x5ClusterAlgo.cc.

References edm::SortedCollection< T, SORT >::end(), spr::find(), edm::SortedCollection< T, SORT >::find(), hfClusterShapes_cfi::hits, mps_fire::i, HLT_2023v12_cff::navigator, recHits_, and v_chstatus_.

Referenced by mainSearch().

283  {
284  bool maxima = true;
286  EcalRecHitCollection::const_iterator seedHit = hits->find(navigator.pos());
287  double seedEnergy = seedHit->energy();
288 
289  std::vector<DetId> swissCrossVec;
290  swissCrossVec.clear();
291 
292  swissCrossVec.push_back(navigator.west());
293  navigator.home();
294  swissCrossVec.push_back(navigator.east());
295  navigator.home();
296  swissCrossVec.push_back(navigator.north());
297  navigator.home();
298  swissCrossVec.push_back(navigator.south());
299  navigator.home();
300 
301  for (unsigned int i = 0; i < swissCrossVec.size(); ++i) {
302  // look for this hit
303  thisHit = recHits_->find(swissCrossVec[i]);
304 
305  // continue if this hit was not found
306  if ((swissCrossVec[i] == DetId(0)) || thisHit == recHits_->end())
307  continue;
308 
309  // the recHit has to be skipped in the local maximum search if it was found
310  // in the map of channels to be excluded
311  uint32_t rhFlag = thisHit->recoFlag();
312  std::vector<int>::const_iterator vit = std::find(v_chstatus_.begin(), v_chstatus_.end(), rhFlag);
313  if (vit != v_chstatus_.end())
314  continue;
315 
316  // if this crystal has more energy than the seed then we do
317  // not have a local maxima
318  if (thisHit->energy() > seedEnergy) {
319  maxima = false;
320  break;
321  }
322  }
323 
324  return maxima;
325 }
const EcalRecHitCollection * recHits_
std::vector< EcalRecHit >::const_iterator const_iterator
void find(edm::Handle< EcalRecHitCollection > &hits, DetId thisDet, std::vector< EcalRecHitCollection::const_iterator > &hit, bool debug=false)
Definition: FindCaloHit.cc:19
std::vector< int > v_chstatus_
const_iterator end() const
Definition: DetId.h:17
iterator find(key_type k)

◆ mainSearch()

void Multi5x5ClusterAlgo::mainSearch ( const EcalRecHitCollection hits,
const CaloSubdetectorGeometry geometry_p,
const CaloSubdetectorTopology topology_p,
const CaloSubdetectorGeometry geometryES_p 
)
private

Definition at line 133 of file Multi5x5ClusterAlgo.cc.

References PositionCalc::Calculate_Location(), canSeed_s, checkMaxima(), clusters_v, current_v, detector_, Multi5x5ClusterAlgo::ProtoBasicCluster::energy(), hfClusterShapes_cfi::hits, Multi5x5ClusterAlgo::ProtoBasicCluster::hits(), EcalRecHit::id(), ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, EcalRecHit::kGood, LogTrace, makeCluster(), reco::CaloCluster::multi5x5, HLT_2023v12_cff::navigator, posCalculator_, position, prepareCluster(), protoClusters_, reassignSeedCrysToClusterItSeeds_, mps_fire::result, Multi5x5ClusterAlgo::ProtoBasicCluster::seed(), run3scouting_cff::seedId, seeds, jetUpdater_cfi::sort, used_s, v_chstatus_, and whichClusCrysBelongsTo_.

Referenced by makeClusters().

136  {
137  LogTrace("EcalClusters") << "Building clusters............";
138 
139  // Loop over seeds:
140  std::vector<EcalRecHit>::iterator it;
141  for (it = seeds.begin(); it != seeds.end(); it++) {
142  // check if this crystal is able to seed
143  // (event though it is already used)
144  bool usedButCanSeed = false;
145  if (canSeed_s.find(it->id()) != canSeed_s.end())
146  usedButCanSeed = true;
147 
148  // avoid seeding for anomalous channels
149  if (!it->checkFlag(EcalRecHit::kGood)) { // if rechit is good, no need for further checks
150  if (it->checkFlags(v_chstatus_))
151  continue;
152  }
153 
154  // make sure the current seed does not belong to a cluster already.
155  if ((used_s.find(it->id()) != used_s.end()) && (usedButCanSeed == false)) {
156  if (it == seeds.begin()) {
157  LogTrace("EcalClusters") << "##############################################################";
158  LogTrace("EcalClusters") << "DEBUG ALERT: Highest energy seed already belongs to a cluster!";
159  LogTrace("EcalClusters") << "##############################################################";
160  }
161 
162  // seed crystal is used or is used and cannot seed a cluster
163  // so continue to the next seed crystal...
164  continue;
165  }
166 
167  // clear the vector of hits in current cluster
168  current_v.clear();
169 
170  // Create a navigator at the seed and get seed
171  // energy
172  CaloNavigator<DetId> navigator(it->id(), topology_p);
173  DetId seedId = navigator.pos();
175  navigator.setHome(seedId);
176 
177  // Is the seed a local maximum?
178  bool localMaxima = checkMaxima(navigator, hits);
179 
180  if (localMaxima) {
181  // build the 5x5 taking care over which crystals
182  // can seed new clusters and which can't
183  prepareCluster(navigator, hits, geometry_p);
184  }
185 
186  // If some crystals in the current vector then
187  // make them into a cluster
188  if (!current_v.empty()) {
189  makeCluster(hits, geometry_p, geometryES_p, seedIt, usedButCanSeed);
190  }
191 
192  } // End loop on seed crystals
193 
196 
197  for (size_t clusNr = 0; clusNr < protoClusters_.size(); clusNr++) {
198  if (!protoClusters_[clusNr].containsSeed()) {
199  const EcalRecHit& seedHit = protoClusters_[clusNr].seed();
200  typedef std::vector<std::pair<DetId, int> >::iterator It;
201  std::pair<It, It> result = std::equal_range(whichClusCrysBelongsTo_.begin(),
203  seedHit.id(),
205 
206  if (result.first != result.second)
207  protoClusters_[result.first->second].removeHit(seedHit);
208  protoClusters_[clusNr].addSeed();
209  }
210  }
211  }
212 
213  for (size_t clusNr = 0; clusNr < protoClusters_.size(); clusNr++) {
214  const ProtoBasicCluster& protoCluster = protoClusters_[clusNr];
215  Point position;
216  position = posCalculator_.Calculate_Location(protoCluster.hits(), hits, geometry_p, geometryES_p);
217  clusters_v.push_back(reco::BasicCluster(protoCluster.energy(),
218  position,
220  protoCluster.hits(),
222  protoCluster.seed().id()));
223  }
224 
225  protoClusters_.clear();
226  whichClusCrysBelongsTo_.clear();
227 }
void makeCluster(const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry_p, const CaloSubdetectorGeometry *geometryES_p, const EcalRecHitCollection::const_iterator &seedIt, bool seedOutside)
std::set< DetId > canSeed_s
std::vector< EcalRecHit >::const_iterator const_iterator
#define LogTrace(id)
std::vector< int > v_chstatus_
void prepareCluster(CaloNavigator< DetId > &navigator, const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry)
std::set< DetId > used_s
math::XYZPoint Calculate_Location(const HitsAndFractions &iDetIds, const edm::SortedCollection< HitType > *iRecHits, const CaloSubdetectorGeometry *iSubGeom, const CaloSubdetectorGeometry *iESGeom=nullptr)
Definition: PositionCalc.h:65
std::vector< std::pair< DetId, float > > current_v
std::vector< ProtoBasicCluster > protoClusters_
std::vector< EcalRecHit > seeds
Definition: DetId.h:17
bool checkMaxima(CaloNavigator< DetId > &navigator, const EcalRecHitCollection *hits)
DetId id() const
get the id
Definition: EcalRecHit.h:78
Structure Point Contains parameters of Gaussian fits to DMRs.
static int position[264][3]
Definition: ReadPGInfo.cc:289
reco::CaloID::Detectors detector_
The ecal region used.
std::vector< reco::BasicCluster > clusters_v
std::vector< std::pair< DetId, int > > whichClusCrysBelongsTo_

◆ makeCluster()

void Multi5x5ClusterAlgo::makeCluster ( const EcalRecHitCollection hits,
const CaloSubdetectorGeometry geometry_p,
const CaloSubdetectorGeometry geometryES_p,
const EcalRecHitCollection::const_iterator seedIt,
bool  seedOutside 
)
private

Definition at line 229 of file Multi5x5ClusterAlgo.cc.

References PositionCalc::Calculate_Location(), current_v, reco::CaloID::DET_ECAL_BARREL, reco::CaloID::DET_ECAL_ENDCAP, EcalBarrel, hcalRecHitTable_cff::energy, EcalRecHit::energy(), hfClusterShapes_cfi::hits, ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, LogTrace, posCalculator_, position, protoClusters_, reassignSeedCrysToClusterItSeeds_, used_s, and whichClusCrysBelongsTo_.

Referenced by mainSearch().

233  {
234  double energy = 0;
235  //double chi2 = 0;
236  reco::CaloID caloID;
237  Point position;
239 
240  std::vector<std::pair<DetId, float> >::iterator it;
241  for (it = current_v.begin(); it != current_v.end(); it++) {
242  EcalRecHitCollection::const_iterator itt = hits->find((*it).first);
243  EcalRecHit hit_p = *itt;
244  energy += hit_p.energy();
245  //chi2 += 0;
246  if ((*it).first.subdetId() == EcalBarrel) {
248  } else {
250  }
251  }
252  //chi2 /= energy;
253 
254  LogTrace("EcalClusters") << "******** NEW CLUSTER ********";
255  LogTrace("EcalClusters") << "No. of crystals = " << current_v.size();
256  LogTrace("EcalClusters") << " Energy = " << energy;
257  LogTrace("EcalClusters") << " Phi = " << position.phi();
258  LogTrace("EcalClusters") << " Eta " << position.eta();
259  LogTrace("EcalClusters") << "*****************************";
260 
261  // to be a valid cluster the cluster energy
262  // must be at least the seed energy
263  double seedEnergy = seedIt->energy();
264  if ((seedOutside && energy >= 0) || (!seedOutside && energy >= seedEnergy)) {
265  if (reassignSeedCrysToClusterItSeeds_) { //if we're not doing this, we dont need this info so lets not bother filling it
266  for (size_t hitNr = 0; hitNr < current_v.size(); hitNr++)
267  whichClusCrysBelongsTo_.push_back(std::pair<DetId, int>(current_v[hitNr].first, protoClusters_.size()));
268  }
269  protoClusters_.push_back(ProtoBasicCluster(energy, *seedIt, current_v));
270 
271  // clusters_v.push_back(reco::BasicCluster(energy, position, reco::CaloID(detector_), current_v, reco::CaloCluster::multi5x5, seedIt->id()));
272 
273  // if no valid cluster was built,
274  // then free up these crystals to be used in the next...
275  } else {
276  std::vector<std::pair<DetId, float> >::iterator iter;
277  for (iter = current_v.begin(); iter != current_v.end(); iter++) {
278  used_s.erase(iter->first);
279  } //for(iter)
280  } //else
281 }
std::vector< EcalRecHit >::const_iterator const_iterator
#define LogTrace(id)
std::set< DetId > used_s
math::XYZPoint Calculate_Location(const HitsAndFractions &iDetIds, const edm::SortedCollection< HitType > *iRecHits, const CaloSubdetectorGeometry *iSubGeom, const CaloSubdetectorGeometry *iESGeom=nullptr)
Definition: PositionCalc.h:65
std::vector< std::pair< DetId, float > > current_v
std::vector< ProtoBasicCluster > protoClusters_
Structure Point Contains parameters of Gaussian fits to DMRs.
static int position[264][3]
Definition: ReadPGInfo.cc:289
float energy() const
Definition: EcalRecHit.h:69
std::vector< std::pair< DetId, int > > whichClusCrysBelongsTo_

◆ makeClusters()

std::vector< reco::BasicCluster > Multi5x5ClusterAlgo::makeClusters ( const EcalRecHitCollection hits,
const CaloSubdetectorGeometry geometry,
const CaloSubdetectorTopology topology_p,
const CaloSubdetectorGeometry geometryES_p,
reco::CaloID::Detectors  detector,
bool  regional = false,
const std::vector< RectangularEtaPhiRegion > &  regions = std::vector<RectangularEtaPhiRegion>() 
)

Definition at line 54 of file Multi5x5ClusterAlgo.cc.

References canSeed_s, clusters_v, reco::CaloID::DET_ECAL_BARREL, reco::CaloID::DET_ECAL_ENDCAP, reco::CaloID::DET_NONE, hgcalTestNeighbor_cfi::detector, detector_, ecalBarrelSeedThreshold, ecalEndcapSeedThreshold, hcalRecHitTable_cff::energy, ET, CaloSubdetectorGeometry::getGeometry(), hfClusterShapes_cfi::hits, isClusterEtLess(), ALPAKA_ACCELERATOR_NAMESPACE::vertexFinder::it, LogTrace, mainSearch(), recHits_, nano_mu_digi_cff::region, seeds, jetUpdater_cfi::sort, AlCaHLTBitMon_QueryRunRegistry::string, DiMuonV_cfg::threshold, used_s, x, and y.

Referenced by Multi5x5ClusterProducer::clusterizeECALPart().

60  {
61  seeds.clear();
62  used_s.clear();
63  canSeed_s.clear();
64  clusters_v.clear();
65 
66  recHits_ = hits;
67 
68  double threshold = 0;
69  std::string ecalPart_string;
74  ecalPart_string = "EndCap";
75  }
79  ecalPart_string = "Barrel";
80  }
81 
82  LogTrace("EcalClusters") << "-------------------------------------------------------------";
83  LogTrace("EcalClusters") << "Island algorithm invoked for ECAL" << ecalPart_string;
84  LogTrace("EcalClusters") << "Looking for seeds, energy threshold used = " << threshold << " GeV";
85 
86  int nregions = 0;
87  if (regional)
88  nregions = regions.size();
89 
90  if (!regional || nregions) {
92  for (it = hits->begin(); it != hits->end(); it++) {
93  double energy = it->energy();
94  if (energy < threshold)
95  continue; // need to check to see if this line is useful!
96 
97  auto thisCell = geometry_p->getGeometry(it->id());
98  // Require that RecHit is within clustering region in case
99  // of regional reconstruction
100  bool withinRegion = false;
101  if (regional) {
102  std::vector<RectangularEtaPhiRegion>::const_iterator region;
103  for (region = regions.begin(); region != regions.end(); region++) {
104  if (region->inRegion(thisCell->etaPos(), thisCell->phiPos())) {
105  withinRegion = true;
106  break;
107  }
108  }
109  }
110 
111  if (!regional || withinRegion) {
112  float ET = it->energy() * thisCell->getPosition().basicVector().unit().perp();
113  if (ET > threshold)
114  seeds.push_back(*it);
115  }
116  }
117  }
118 
119  sort(seeds.begin(), seeds.end(), [](auto const& x, auto const& y) { return (x.energy() > y.energy()); });
120 
121  LogTrace("EcalClusters") << "Total number of seeds found in event = " << seeds.size();
122 
123  mainSearch(hits, geometry_p, topology_p, geometryES_p);
124  sort(clusters_v.rbegin(), clusters_v.rend(), isClusterEtLess);
125 
126  LogTrace("EcalClusters") << "---------- end of main search. clusters have been sorted ----";
127 
128  return clusters_v;
129 }
std::set< DetId > canSeed_s
const EcalRecHitCollection * recHits_
std::vector< EcalRecHit >::const_iterator const_iterator
#define LogTrace(id)
void mainSearch(const EcalRecHitCollection *hits, const CaloSubdetectorGeometry *geometry_p, const CaloSubdetectorTopology *topology_p, const CaloSubdetectorGeometry *geometryES_p)
std::set< DetId > used_s
bool isClusterEtLess(const reco::CaloCluster &x, const reco::CaloCluster &y)
Definition: ClusterEtLess.h:7
std::vector< EcalRecHit > seeds
reco::CaloID::Detectors detector_
The ecal region used.
std::vector< reco::BasicCluster > clusters_v
#define ET

◆ prepareCluster()

void Multi5x5ClusterAlgo::prepareCluster ( CaloNavigator< DetId > &  navigator,
const EcalRecHitCollection hits,
const CaloSubdetectorGeometry geometry 
)
private

Definition at line 327 of file Multi5x5ClusterAlgo.cc.

References funct::abs(), addCrystal(), canSeed_s, PVValHelper::dx, PVValHelper::dy, and HLT_2023v12_cff::navigator.

Referenced by mainSearch().

329  {
330  DetId thisDet;
331  std::set<DetId>::iterator setItr;
332 
333  // now add the 5x5 taking care to mark the edges
334  // as able to seed and where overlapping in the central
335  // region with crystals that were previously able to seed
336  // change their status so they are not able to seed
337  //std::cout << std::endl;
338  for (int dx = -2; dx < 3; ++dx) {
339  for (int dy = -2; dy < 3; ++dy) {
340  // navigate in free steps forming
341  // a full 5x5
342  thisDet = navigator.offsetBy(dx, dy);
343  navigator.home();
344 
345  // add the current crystal
346  //std::cout << "adding " << dx << ", " << dy << std::endl;
347  addCrystal(thisDet);
348 
349  // now consider if we are in an edge (outer 16)
350  // or central (inner 9) region
351  if ((abs(dx) > 1) || (abs(dy) > 1)) {
352  // this is an "edge" so should be allowed to seed
353  // provided it is not already used
354  //std::cout << " setting can seed" << std::endl;
355  canSeed_s.insert(thisDet);
356  } // end if "edge"
357  else {
358  // or else we are in the central 3x3
359  // and must remove any of these crystals from the canSeed set
360  setItr = canSeed_s.find(thisDet);
361  if (setItr != canSeed_s.end()) {
362  //std::cout << " unsetting can seed" << std::endl;
363  canSeed_s.erase(setItr);
364  }
365  } // end if "centre"
366 
367  } // end loop on dy
368 
369  } // end loop on dx
370 
371  //std::cout << "*** " << std::endl;
372  //std::cout << " current_v contains " << current_v.size() << std::endl;
373  //std::cout << "*** " << std::endl;
374 }
std::set< DetId > canSeed_s
void addCrystal(const DetId &det)
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
Definition: DetId.h:17

Member Data Documentation

◆ canSeed_s

std::set<DetId> Multi5x5ClusterAlgo::canSeed_s
private

Definition at line 110 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), makeClusters(), and prepareCluster().

◆ clusters_v

std::vector<reco::BasicCluster> Multi5x5ClusterAlgo::clusters_v
private

Definition at line 117 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeClusters().

◆ current_v

std::vector<std::pair<DetId, float> > Multi5x5ClusterAlgo::current_v
private

Definition at line 114 of file Multi5x5ClusterAlgo.h.

Referenced by addCrystal(), mainSearch(), and makeCluster().

◆ detector_

reco::CaloID::Detectors Multi5x5ClusterAlgo::detector_
private

The ecal region used.

Definition at line 94 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeClusters().

◆ ecalBarrelSeedThreshold

double Multi5x5ClusterAlgo::ecalBarrelSeedThreshold
private

Definition at line 97 of file Multi5x5ClusterAlgo.h.

Referenced by makeClusters().

◆ ecalEndcapSeedThreshold

double Multi5x5ClusterAlgo::ecalEndcapSeedThreshold
private

Definition at line 98 of file Multi5x5ClusterAlgo.h.

Referenced by makeClusters().

◆ posCalculator_

PositionCalc Multi5x5ClusterAlgo::posCalculator_
private

Definition at line 91 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), makeCluster(), and Multi5x5ClusterAlgo().

◆ protoClusters_

std::vector<ProtoBasicCluster> Multi5x5ClusterAlgo::protoClusters_
private

Definition at line 118 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeCluster().

◆ reassignSeedCrysToClusterItSeeds_

bool Multi5x5ClusterAlgo::reassignSeedCrysToClusterItSeeds_
private

Definition at line 122 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeCluster().

◆ recHits_

const EcalRecHitCollection* Multi5x5ClusterAlgo::recHits_
private

Definition at line 101 of file Multi5x5ClusterAlgo.h.

Referenced by addCrystal(), checkMaxima(), and makeClusters().

◆ seeds

std::vector<EcalRecHit> Multi5x5ClusterAlgo::seeds
private

Definition at line 104 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeClusters().

◆ used_s

std::set<DetId> Multi5x5ClusterAlgo::used_s
private

Definition at line 109 of file Multi5x5ClusterAlgo.h.

Referenced by addCrystal(), mainSearch(), makeCluster(), and makeClusters().

◆ v_chstatus_

std::vector<int> Multi5x5ClusterAlgo::v_chstatus_
private

Definition at line 120 of file Multi5x5ClusterAlgo.h.

Referenced by checkMaxima(), mainSearch(), and Multi5x5ClusterAlgo().

◆ whichClusCrysBelongsTo_

std::vector<std::pair<DetId, int> > Multi5x5ClusterAlgo::whichClusCrysBelongsTo_
private

Definition at line 106 of file Multi5x5ClusterAlgo.h.

Referenced by mainSearch(), and makeCluster().