CMS 3D CMS Logo
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
List of all members | Public Types | Public Member Functions | Private Attributes
HGCGraphT< TILES > Class Template Reference

#include <HGCGraph.h>

Public Types

enum  VerbosityLevel {
  None = 0, Basic, Advanced, Expert,
  Guru
}
 

Public Member Functions

bool areTimeCompatible (int innerIdx, int outerIdx, const edm::ValueMap< std::pair< float, float >> &layerClustersTime, float maxDeltaTime)
 
void clear ()
 
void findNtuplets (std::vector< HGCDoublet::HGCntuplet > &foundNtuplets, std::vector< int > &seedIndices, const unsigned int minClustersPerNtuplet, const bool outInDFS, const unsigned int maxOutInHops)
 
std::vector< HGCDoublet > & getAllDoublets ()
 
void makeAndConnectDoublets (const TILES &h, const std::vector< TICLSeedingRegion > &regions, int nEtaBins, int nPhiBins, const std::vector< reco::CaloCluster > &layerClusters, const std::vector< float > &mask, const edm::ValueMap< std::pair< float, float >> &layerClustersTime, int deltaIEta, int deltaIPhi, float minCosThetai, float maxCosPointing, float root_doublet_max_distance_from_seed_squared, float etaLimitIncreaseWindow, int skip_layers, int maxNumberOfLayers, float maxDeltaTime)
 
void setVerbosity (int level)
 

Private Attributes

std::vector< HGCDoublet > allDoublets_
 
std::vector< std::vector< int > > isOuterClusterOfDoublets_
 
std::vector< unsigned int > theRootDoublets_
 
int verbosity_
 

Detailed Description

template<typename TILES>
class HGCGraphT< TILES >

Definition at line 15 of file HGCGraph.h.

Member Enumeration Documentation

template<typename TILES >
enum HGCGraphT::VerbosityLevel
Enumerator
None 
Basic 
Advanced 
Expert 
Guru 

Definition at line 54 of file HGCGraph.h.

54 { None = 0, Basic, Advanced, Expert, Guru };

Member Function Documentation

template<typename TILES >
bool HGCGraphT< TILES >::areTimeCompatible ( int  innerIdx,
int  outerIdx,
const edm::ValueMap< std::pair< float, float >> &  layerClustersTime,
float  maxDeltaTime 
)

Definition at line 211 of file HGCGraph.cc.

References funct::abs(), and mathSSE::sqrt().

214  {
215  float timeIn = layerClustersTime.get(innerIdx).first;
216  float timeInE = layerClustersTime.get(innerIdx).second;
217  float timeOut = layerClustersTime.get(outerIdx).first;
218  float timeOutE = layerClustersTime.get(outerIdx).second;
219 
220  return (timeIn == -99. || timeOut == -99. ||
221  std::abs(timeIn - timeOut) < maxDeltaTime * sqrt(timeInE * timeInE + timeOutE * timeOutE));
222 }
mathSSE::sqrt
T sqrt(T t)
Definition: SSEVec.h:19
funct::abs
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
edm::ValueMap::get
const_reference_type get(ProductID id, size_t idx) const
Definition: ValueMap.h:144
template<typename TILES >
void HGCGraphT< TILES >::clear ( void  )
inline

Definition at line 45 of file HGCGraph.h.

References HGCGraphT< TILES >::allDoublets_, HGCGraphT< TILES >::isOuterClusterOfDoublets_, and HGCGraphT< TILES >::theRootDoublets_.

45  {
46  allDoublets_.clear();
47  theRootDoublets_.clear();
48  isOuterClusterOfDoublets_.clear();
49  allDoublets_.shrink_to_fit();
50  theRootDoublets_.shrink_to_fit();
51  isOuterClusterOfDoublets_.shrink_to_fit();
52  }
HGCGraphT::isOuterClusterOfDoublets_
std::vector< std::vector< int > > isOuterClusterOfDoublets_
Definition: HGCGraph.h:59
HGCGraphT::allDoublets_
std::vector< HGCDoublet > allDoublets_
Definition: HGCGraph.h:57
HGCGraphT::theRootDoublets_
std::vector< unsigned int > theRootDoublets_
Definition: HGCGraph.h:58
template<typename TILES >
void HGCGraphT< TILES >::findNtuplets ( std::vector< HGCDoublet::HGCntuplet > &  foundNtuplets,
std::vector< int > &  seedIndices,
const unsigned int  minClustersPerNtuplet,
const bool  outInDFS,
const unsigned int  maxOutInHops 
)

Definition at line 226 of file HGCGraph.cc.

230  {
231  HGCDoublet::HGCntuplet tmpNtuplet;
232  tmpNtuplet.reserve(minClustersPerNtuplet);
233  std::vector<std::pair<unsigned int, unsigned int>> outInToVisit;
234  for (auto rootDoublet : theRootDoublets_) {
235  tmpNtuplet.clear();
236  outInToVisit.clear();
237  int seedIndex = allDoublets_[rootDoublet].seedIndex();
238  int outInHops = 0;
239  allDoublets_[rootDoublet].findNtuplets(
240  allDoublets_, tmpNtuplet, seedIndex, outInDFS, outInHops, maxOutInHops, outInToVisit);
241  while (!outInToVisit.empty()) {
242  allDoublets_[outInToVisit.back().first].findNtuplets(
243  allDoublets_, tmpNtuplet, seedIndex, outInDFS, outInToVisit.back().second, maxOutInHops, outInToVisit);
244  outInToVisit.pop_back();
245  }
246 
247  if (tmpNtuplet.size() > minClustersPerNtuplet) {
248  foundNtuplets.push_back(tmpNtuplet);
249  seedIndices.push_back(seedIndex);
250  }
251  }
252 }
HGCDoublet::HGCntuplet
std::vector< unsigned int > HGCntuplet
Definition: HGCDoublet.h:16
foundNtuplets
auto const & foundNtuplets
Definition: CAHitNtupletGeneratorKernelsImpl.h:591
HGCGraphT::allDoublets_
std::vector< HGCDoublet > allDoublets_
Definition: HGCGraph.h:57
HGCGraphT::theRootDoublets_
std::vector< unsigned int > theRootDoublets_
Definition: HGCGraph.h:58
template<typename TILES >
std::vector<HGCDoublet>& HGCGraphT< TILES >::getAllDoublets ( )
inline

Definition at line 39 of file HGCGraph.h.

References HGCGraphT< TILES >::allDoublets_.

39 { return allDoublets_; }
HGCGraphT::allDoublets_
std::vector< HGCDoublet > allDoublets_
Definition: HGCGraph.h:57
template<typename TILES >
void HGCGraphT< TILES >::makeAndConnectDoublets ( const TILES &  h,
const std::vector< TICLSeedingRegion > &  regions,
int  nEtaBins,
int  nPhiBins,
const std::vector< reco::CaloCluster > &  layerClusters,
const std::vector< float > &  mask,
const edm::ValueMap< std::pair< float, float >> &  layerClustersTime,
int  deltaIEta,
int  deltaIPhi,
float  minCosThetai,
float  maxCosPointing,
float  root_doublet_max_distance_from_seed_squared,
float  etaLimitIncreaseWindow,
int  skip_layers,
int  maxNumberOfLayers,
float  maxDeltaTime 
)

Definition at line 12 of file HGCGraph.cc.

References funct::abs(), reco::deltaR2(), PVValHelper::eta, LogDebug, M_PI, SiStripPI::max, min(), L1TMuonDQMOffline_cfi::nEtaBins, None, ecaldqm::binning::nPhiBins, hltrates_dqm_sourceclient-live_cfg::offset, PVValHelper::phi, alignCSCRings::r, and findQualityFiles::size.

27  {
28  isOuterClusterOfDoublets_.clear();
29  isOuterClusterOfDoublets_.resize(layerClusters.size());
30  allDoublets_.clear();
31  theRootDoublets_.clear();
32  bool checkDistanceRootDoubletVsSeed = root_doublet_max_distance_from_seed_squared < 9999;
33  float origin_eta;
34  float origin_phi;
35  for (const auto &r : regions) {
36  bool isGlobal = (r.index == -1);
37  auto zSide = r.zSide;
38  int startEtaBin, endEtaBin, startPhiBin, endPhiBin;
39 
40  if (isGlobal) {
41  startEtaBin = 0;
42  startPhiBin = 0;
43  endEtaBin = nEtaBins;
44  endPhiBin = nPhiBins;
45  origin_eta = 0;
46  origin_phi = 0;
47  } else {
48  auto firstLayerOnZSide = maxNumberOfLayers * zSide;
49  const auto &firstLayerHisto = histo[firstLayerOnZSide];
50  origin_eta = r.origin.eta();
51  origin_phi = r.origin.phi();
52  int entryEtaBin = firstLayerHisto.etaBin(origin_eta);
53  int entryPhiBin = firstLayerHisto.phiBin(origin_phi);
54  // For track-seeded iterations, if the impact point is below a certain
55  // eta-threshold, i.e., it has higher eta, make the initial search
56  // window bigger in both eta and phi by one bin, to contain better low
57  // energy showers.
58  auto etaWindow = deltaIEta;
59  auto phiWindow = deltaIPhi;
60  if (std::abs(origin_eta) > etaLimitIncreaseWindow) {
61  etaWindow++;
62  phiWindow++;
63  LogDebug("HGCGraph") << "Limit of Eta for increase: " << etaLimitIncreaseWindow
64  << " reached! Increasing inner search window" << std::endl;
65  }
66  startEtaBin = std::max(entryEtaBin - etaWindow, 0);
67  endEtaBin = std::min(entryEtaBin + etaWindow + 1, nEtaBins);
68  startPhiBin = entryPhiBin - phiWindow;
69  endPhiBin = entryPhiBin + phiWindow + 1;
70  if (verbosity_ > Guru) {
71  LogDebug("HGCGraph") << " Entrance eta, phi: " << origin_eta << ", " << origin_phi
72  << " entryEtaBin: " << entryEtaBin << " entryPhiBin: " << entryPhiBin
73  << " globalBin: " << firstLayerHisto.globalBin(origin_eta, origin_phi)
74  << " on layer: " << firstLayerOnZSide << " startEtaBin: " << startEtaBin
75  << " endEtaBin: " << endEtaBin << " startPhiBin: " << startPhiBin
76  << " endPhiBin: " << endPhiBin << " phiBin(0): " << firstLayerHisto.phiBin(0.)
77  << " phiBin(" << M_PI / 2. << "): " << firstLayerHisto.phiBin(M_PI / 2.) << " phiBin("
78  << M_PI << "): " << firstLayerHisto.phiBin(M_PI) << " phiBin(" << -M_PI / 2.
79  << "): " << firstLayerHisto.phiBin(-M_PI / 2.) << " phiBin(" << -M_PI
80  << "): " << firstLayerHisto.phiBin(-M_PI) << " phiBin(" << 2. * M_PI
81  << "): " << firstLayerHisto.phiBin(2. * M_PI) << std::endl;
82  }
83  }
84 
85  for (int il = 0; il < maxNumberOfLayers - 1; ++il) {
86  for (int outer_layer = 0; outer_layer < std::min(1 + skip_layers, maxNumberOfLayers - 1 - il); ++outer_layer) {
87  int currentInnerLayerId = il + maxNumberOfLayers * zSide;
88  int currentOuterLayerId = currentInnerLayerId + 1 + outer_layer;
89  auto const &outerLayerHisto = histo[currentOuterLayerId];
90  auto const &innerLayerHisto = histo[currentInnerLayerId];
91  const int etaLimitIncreaseWindowBin = innerLayerHisto.etaBin(etaLimitIncreaseWindow);
92  if (verbosity_ > Advanced) {
93  LogDebug("HGCGraph") << "Limit of Eta for increase: " << etaLimitIncreaseWindow
94  << " at etaBin: " << etaLimitIncreaseWindowBin << std::endl;
95  }
96 
97  for (int ieta = startEtaBin; ieta < endEtaBin; ++ieta) {
98  auto offset = ieta * nPhiBins;
99  for (int iphi_it = startPhiBin; iphi_it < endPhiBin; ++iphi_it) {
100  int iphi = ((iphi_it % nPhiBins + nPhiBins) % nPhiBins);
101  if (verbosity_ > Guru) {
102  LogDebug("HGCGraph") << "Inner Global Bin: " << (offset + iphi)
103  << " on layers I/O: " << currentInnerLayerId << "/" << currentOuterLayerId
104  << " with clusters: " << innerLayerHisto[offset + iphi].size() << std::endl;
105  }
106  for (auto innerClusterId : innerLayerHisto[offset + iphi]) {
107  // Skip masked clusters
108  if (mask[innerClusterId] == 0.) {
109  if (verbosity_ > Advanced)
110  LogDebug("HGCGraph") << "Skipping inner masked cluster " << innerClusterId << std::endl;
111  continue;
112  }
113 
114  // For global-seeded iterations, if the inner cluster is above a certain
115  // eta-threshold, i.e., it has higher eta, make the outer search
116  // window bigger in both eta and phi by one bin, to contain better low
117  // energy showers. Track-Seeded iterations are excluded since, in
118  // that case, the inner search window has already been enlarged.
119  auto etaWindow = deltaIEta;
120  auto phiWindow = deltaIPhi;
121  if (isGlobal && ieta > etaLimitIncreaseWindowBin) {
122  etaWindow++;
123  phiWindow++;
124  if (verbosity_ > Advanced) {
125  LogDebug("HGCGraph") << "Eta and Phi window increased by one" << std::endl;
126  }
127  }
128  const auto etaRangeMin = std::max(0, ieta - etaWindow);
129  const auto etaRangeMax = std::min(ieta + etaWindow + 1, nEtaBins);
130 
131  for (int oeta = etaRangeMin; oeta < etaRangeMax; ++oeta) {
132  // wrap phi bin
133  for (int phiRange = 0; phiRange < 2 * phiWindow + 1; ++phiRange) {
134  // The first wrapping is to take into account the
135  // cases in which we would have to seach in
136  // negative bins. The second wrap is mandatory to
137  // account for all other cases, since we add in
138  // between a full nPhiBins slot.
139  auto ophi = ((iphi + phiRange - phiWindow) % nPhiBins + nPhiBins) % nPhiBins;
140  if (verbosity_ > Guru) {
141  LogDebug("HGCGraph") << "Outer Global Bin: " << (oeta * nPhiBins + ophi)
142  << " on layers I/O: " << currentInnerLayerId << "/" << currentOuterLayerId
143  << " with clusters: " << innerLayerHisto[oeta * nPhiBins + ophi].size()
144  << std::endl;
145  }
146  for (auto outerClusterId : outerLayerHisto[oeta * nPhiBins + ophi]) {
147  // Skip masked clusters
148  if (mask[outerClusterId] == 0.) {
149  if (verbosity_ > Advanced)
150  LogDebug("HGCGraph") << "Skipping outer masked cluster " << outerClusterId << std::endl;
151  continue;
152  }
153  auto doubletId = allDoublets_.size();
154  if (maxDeltaTime != -1 &&
155  !areTimeCompatible(innerClusterId, outerClusterId, layerClustersTime, maxDeltaTime)) {
156  if (verbosity_ > Advanced)
157  LogDebug("HGCGraph") << "Rejecting doublets due to timing!" << std::endl;
158  continue;
159  }
160  allDoublets_.emplace_back(innerClusterId, outerClusterId, doubletId, &layerClusters, r.index);
161  if (verbosity_ > Advanced) {
162  LogDebug("HGCGraph")
163  << "Creating doubletsId: " << doubletId << " layerLink in-out: [" << currentInnerLayerId
164  << ", " << currentOuterLayerId << "] clusterLink in-out: [" << innerClusterId << ", "
165  << outerClusterId << "]" << std::endl;
166  }
167  isOuterClusterOfDoublets_[outerClusterId].push_back(doubletId);
168  auto &neigDoublets = isOuterClusterOfDoublets_[innerClusterId];
169  auto &thisDoublet = allDoublets_[doubletId];
170  if (verbosity_ > Expert) {
171  LogDebug("HGCGraph")
172  << "Checking compatibility of doubletId: " << doubletId
173  << " with all possible inners doublets link by the innerClusterId: " << innerClusterId
174  << std::endl;
175  }
176  bool isRootDoublet = thisDoublet.checkCompatibilityAndTag(allDoublets_,
177  neigDoublets,
178  r.directionAtOrigin,
179  minCosTheta,
180  minCosPointing,
181  verbosity_ > Advanced);
182  if (isRootDoublet and checkDistanceRootDoubletVsSeed) {
183  if (reco::deltaR2(layerClusters[innerClusterId].eta(),
184  layerClusters[innerClusterId].phi(),
185  origin_eta,
186  origin_phi) > root_doublet_max_distance_from_seed_squared) {
187  isRootDoublet = false;
188  }
189  }
190  if (isRootDoublet) {
191  theRootDoublets_.push_back(doubletId);
192  }
193  }
194  }
195  }
196  }
197  }
198  }
199  }
200  }
201  }
202  // #ifdef FP_DEBUG
203  if (verbosity_ > None) {
204  LogDebug("HGCGraph") << "number of Root doublets " << theRootDoublets_.size() << " over a total number of doublets "
205  << allDoublets_.size() << std::endl;
206  }
207  // #endif
208 }
HGCGraphT::isOuterClusterOfDoublets_
std::vector< std::vector< int > > isOuterClusterOfDoublets_
Definition: HGCGraph.h:59
caConstants::maxNumberOfLayers
constexpr uint32_t maxNumberOfLayers
Definition: CAConstants.h:45
L1TMuonDQMOffline_cfi.nEtaBins
int nEtaBins
Definition: L1TMuonDQMOffline_cfi.py:21
HGCGraphT::allDoublets_
std::vector< HGCDoublet > allDoublets_
Definition: HGCGraph.h:57
funct::abs
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
min
T min(T a, T b)
Definition: MathUtil.h:58
HGCGraphT::theRootDoublets_
std::vector< unsigned int > theRootDoublets_
Definition: HGCGraph.h:58
M_PI
#define M_PI
Definition: BXVectorInputProducer.cc:49
HGCGraphT::areTimeCompatible
bool areTimeCompatible(int innerIdx, int outerIdx, const edm::ValueMap< std::pair< float, float >> &layerClustersTime, float maxDeltaTime)
Definition: HGCGraph.cc:211
reco::deltaR2
constexpr auto deltaR2(const T1 &t1, const T2 &t2) -> decltype(t1.eta())
Definition: deltaR.h:16
HGCGraphT::verbosity_
int verbosity_
Definition: HGCGraph.h:60
hltrates_dqm_sourceclient-live_cfg.offset
tuple offset
Definition: hltrates_dqm_sourceclient-live_cfg.py:83
findQualityFiles.size
tuple size
Write out results.
Definition: findQualityFiles.py:443
LogDebug
#define LogDebug(id)
Definition: MessageLogger.h:233
template<typename TILES >
void HGCGraphT< TILES >::setVerbosity ( int  level)
inline

Definition at line 53 of file HGCGraph.h.

References testEve_cfg::level, and HGCGraphT< TILES >::verbosity_.

53 { verbosity_ = level; }
HGCGraphT::verbosity_
int verbosity_
Definition: HGCGraph.h:60
testEve_cfg.level
tuple level
Definition: testEve_cfg.py:47

Member Data Documentation

template<typename TILES >
std::vector<HGCDoublet> HGCGraphT< TILES >::allDoublets_
private

Definition at line 57 of file HGCGraph.h.

Referenced by HGCGraphT< TILES >::clear(), and HGCGraphT< TILES >::getAllDoublets().

template<typename TILES >
std::vector<std::vector<int> > HGCGraphT< TILES >::isOuterClusterOfDoublets_
private

Definition at line 59 of file HGCGraph.h.

Referenced by HGCGraphT< TILES >::clear().

template<typename TILES >
std::vector<unsigned int> HGCGraphT< TILES >::theRootDoublets_
private

Definition at line 58 of file HGCGraph.h.

Referenced by HGCGraphT< TILES >::clear().

template<typename TILES >
int HGCGraphT< TILES >::verbosity_
private

Definition at line 60 of file HGCGraph.h.

Referenced by HGCGraphT< TILES >::setVerbosity().

Generated for CMSSW Reference Manual by doxygen 1.8.5