CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
EgammaTowerIsolation.h
Go to the documentation of this file.
1 #ifndef EgammaTowerIsolation_h
2 #define EgammaTowerIsolation_h
3 
4 //*****************************************************************************
5 // File: EgammaTowerIsolation.h
6 // ----------------------------------------------------------------------------
7 // OrigAuth: Matthias Mozer
8 // Institute: IIHE-VUB
9 // Adding feature to exclude towers used by H/E
10 //
11 // 11/11/12 Hack by VI to make it 100 times faster
12 //=============================================================================
13 //*****************************************************************************
14 
15 #include <vector>
16 
17 //CMSSW includes
22 
23 #include <cmath>
24 #include <algorithm>
25 #include <cstdint>
26 #include <atomic>
27 
29 
30 /*
31  for each set of cuts it will compute Et for all, depth1 and depth2 twice:
32  one between inner and outer and once inside outer vetoid the tower to excude
33 
34  */
35 template <unsigned int NC>
37 public:
38  struct Sum {
39  Sum() : he{0}, h2{0}, heBC{0}, h2BC{0} {}
40  float he[NC];
41  float h2[NC];
42  float heBC[NC];
43  float h2BC[NC];
44  };
45 
46  // number of cuts
47  constexpr static unsigned int NCuts = NC;
48 
49  //constructors
50 
52  EgammaTowerIsolationNew(float extRadius[NC], float intRadius[NC], CaloTowerCollection const& towers);
53 
54  ~EgammaTowerIsolationNew() { delete[] mem; }
55 
56  template <typename I>
57  void compute(bool et, Sum& sum, reco::Candidate const& cand, I first, I last) const {
58  reco::SuperCluster const& sc = *cand.get<reco::SuperClusterRef>().get();
59  return compute(et, sum, sc, first, last);
60  }
61  template <typename I>
62  void compute(bool et, Sum& sum, reco::SuperCluster const& sc, I first, I last) const;
63 
64  void setRadius(float const extRadius[NC], float const intRadius[NC]) {
65  for (std::size_t i = 0; i != NCuts; ++i) {
66  extRadius2_[i] = extRadius[i] * extRadius[i];
67  intRadius2_[i] = intRadius[i] * intRadius[i];
68  }
69  maxEta = *std::max_element(extRadius, extRadius + NC);
70  }
71 
72 public:
75 
76  float maxEta;
77  //SOA
78  const uint32_t nt;
79  float* eta;
80  float* phi;
81  float* he;
82  float* h2;
83  float* st;
84  uint32_t* id;
85  uint32_t* mem = nullptr;
86  void initSoa() {
87  mem = new uint32_t[nt * 6];
88  eta = (float*)(mem);
89  phi = eta + nt;
90  he = phi + nt;
91  h2 = he + nt;
92  st = h2 + nt;
93  id = (uint32_t*)(st) + nt;
94  }
95 };
96 
97 /*#define ETISTATDEBUG*/
98 #ifdef ETISTATDEBUG
99 namespace etiStat {
100 
101  struct Count {
102  std::atomic<uint32_t> create = 0;
103  std::atomic<uint32_t> comp = 0;
104  std::atomic<uint32_t> span = 0;
105  static Count count;
106  ~Count();
107  };
108 
109 } // namespace etiStat
110 #endif
111 
112 template <unsigned int NC>
114  float intRadius[NC],
116  : maxEta(*std::max_element(extRadius, extRadius + NC)), nt(towers.size()) {
117  if (nt == 0)
118  return;
119  initSoa();
120 
121 #ifdef ETISTATDEBUG
122  etiStat::Count::count.create++;
123 #endif
124 
125  for (std::size_t i = 0; i != NCuts; ++i) {
126  extRadius2_[i] = extRadius[i] * extRadius[i];
127  intRadius2_[i] = intRadius[i] * intRadius[i];
128  }
129 
130  // sort in eta (kd-tree anoverkill,does not vectorize...)
131  uint32_t index[nt];
132 #ifdef __clang__
133  std::vector<float> e(nt);
134 #else
135  float e[nt];
136 #endif
137  for (std::size_t k = 0; k != nt; ++k) {
138  e[k] = towers[k].eta();
139  index[k] = k;
140  std::push_heap(index, index + k + 1, [&e](uint32_t i, uint32_t j) { return e[i] < e[j]; });
141  }
142  std::sort_heap(index, index + nt, [&e](uint32_t i, uint32_t j) { return e[i] < e[j]; });
143 
144  for (std::size_t i = 0; i != nt; ++i) {
145  auto j = index[i];
146  eta[i] = towers[j].eta();
147  phi[i] = towers[j].phi();
148  id[i] = towers[j].id();
149  st[i] = 1.f / std::cosh(eta[i]); // std::sin(towers[j].theta()); //;
150  he[i] = towers[j].hadEnergy();
151  h2[i] = towers[j].hadEnergyHeOuterLayer();
152  }
153 }
154 
155 template <unsigned int NC>
156 template <typename I>
158  bool et, Sum& sum, reco::SuperCluster const& sc, I first, I last) const {
159  if (nt == 0)
160  return;
161 
162 #ifdef ETISTATDEBUG
163  etiStat::Count::count.comp++;
164 #endif
165 
166  float candEta = sc.eta();
167  float candPhi = sc.phi();
168 
169  auto lb = std::lower_bound(eta, eta + nt, candEta - maxEta);
170  auto ub = std::upper_bound(lb, eta + nt, candEta + maxEta);
171  uint32_t il = lb - eta;
172  uint32_t iu = std::min(nt, uint32_t(ub - eta + 1));
173 
174 #ifdef ETISTATDEBUG
175  etiStat::Count::count.span += (iu - il);
176 #endif
177 
178  // should be restricted in eta....
179  for (std::size_t i = il; i != iu; ++i) {
180  float dr2 = reco::deltaR2(candEta, candPhi, eta[i], phi[i]);
181  float tt = et ? st[i] : 1.f;
182  for (std::size_t j = 0; j != NCuts; ++j) {
183  if (dr2 < extRadius2_[j]) {
184  if (dr2 >= intRadius2_[j]) {
185  sum.he[j] += he[i] * tt;
186  sum.h2[j] += h2[i] * tt;
187  }
188  if (std::find(first, last, id[i]) == last) {
189  sum.heBC[j] += he[i] * tt;
190  sum.h2BC[j] += h2[i] * tt;
191  }
192  }
193  }
194  }
195 }
196 
198 public:
199  enum HcalDepth { AllDepths = -1, Undefined = 0, Depth1 = 1, Depth2 = 2 };
200 
201  //constructors
203  float extRadiusI, float intRadiusI, float etLow, signed int depth, const CaloTowerCollection* towers);
204 
205  double getTowerEtSum(const reco::Candidate* cand, const std::vector<CaloTowerDetId>* detIdToExclude = nullptr) const {
206  reco::SuperCluster const& sc = *cand->get<reco::SuperClusterRef>().get();
207  return getSum(true, sc, detIdToExclude);
208  }
209  double getTowerESum(const reco::Candidate* cand, const std::vector<CaloTowerDetId>* detIdToExclude = nullptr) const {
210  reco::SuperCluster const& sc = *cand->get<reco::SuperClusterRef>().get();
211  return getSum(false, sc, detIdToExclude);
212  }
214  const std::vector<CaloTowerDetId>* detIdToExclude = nullptr) const {
215  return getSum(true, *sc, detIdToExclude);
216  }
217  double getTowerESum(reco::SuperCluster const* sc, const std::vector<CaloTowerDetId>* detIdToExclude = nullptr) const {
218  return getSum(false, *sc, detIdToExclude);
219  }
220 
221 private:
222  double getSum(bool et, reco::SuperCluster const& sc, const std::vector<CaloTowerDetId>* detIdToExclude) const;
223 
224 private:
225  signed int depth_;
226  float extRadius;
227  float intRadius;
228 };
229 
230 #endif
double getTowerESum(const reco::Candidate *cand, const std::vector< CaloTowerDetId > *detIdToExclude=nullptr) const
double getSum(bool et, reco::SuperCluster const &sc, const std::vector< CaloTowerDetId > *detIdToExclude) const
__host__ __device__ constexpr RandomIt upper_bound(RandomIt first, RandomIt last, const T &value, Compare comp={})
double maxEta
static constexpr unsigned int NCuts
void find(edm::Handle< EcalRecHitCollection > &hits, DetId thisDet, std::vector< EcalRecHitCollection::const_iterator > &hit, bool debug=false)
Definition: FindCaloHit.cc:19
double eta() const
pseudorapidity of cluster centroid
Definition: CaloCluster.h:181
double getTowerEtSum(reco::SuperCluster const *sc, const std::vector< CaloTowerDetId > *detIdToExclude=nullptr) const
void setRadius(float const extRadius[NC], float const intRadius[NC])
const std::complex< double > I
Definition: I.h:8
int nt
Definition: AMPTWrapper.h:42
constexpr auto deltaR2(const T1 &t1, const T2 &t2) -> decltype(t1.eta())
Definition: deltaR.h:16
double getTowerESum(reco::SuperCluster const *sc, const std::vector< CaloTowerDetId > *detIdToExclude=nullptr) const
__host__ __device__ constexpr RandomIt lower_bound(RandomIt first, RandomIt last, const T &value, Compare comp={})
T get() const
get a component
Definition: Candidate.h:221
EgammaTowerIsolation(float extRadiusI, float intRadiusI, float etLow, signed int depth, const CaloTowerCollection *towers)
tuple last
Definition: dqmdumpme.py:56
double phi() const
azimuthal angle of cluster centroid
Definition: CaloCluster.h:184
tuple size
Write out results.
void compute(bool et, Sum &sum, reco::Candidate const &cand, I first, I last) const
double getTowerEtSum(const reco::Candidate *cand, const std::vector< CaloTowerDetId > *detIdToExclude=nullptr) const