CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
Phase2EndcapRing.cc
Go to the documentation of this file.
1 #include "Phase2EndcapRing.h"
2 
4 
10 
11 #include "LayerCrossingSide.h"
12 #include "DetGroupMerger.h"
14 
15 #include "TkDetUtil.h"
17 
18 using namespace std;
19 
21 
23 public:
25  return (fabs(a.front().det()->position().z()) < fabs(b.front().det()->position().z()));
26  }
27 };
28 
29 Phase2EndcapRing::Phase2EndcapRing(vector<const GeomDet*>& innerDets,
30  vector<const GeomDet*>& outerDets,
31  const vector<const GeomDet*>& innerDetBrothers,
32  const vector<const GeomDet*>& outerDetBrothers)
34  theFrontDets(innerDets.begin(), innerDets.end()),
35  theBackDets(outerDets.begin(), outerDets.end()),
36  theFrontDetBrothers(innerDetBrothers.begin(), innerDetBrothers.end()),
37  theBackDetBrothers(outerDetBrothers.begin(), outerDetBrothers.end()) {
38  theDets.assign(theFrontDets.begin(), theFrontDets.end());
39  theDets.insert(theDets.end(), theBackDets.begin(), theBackDets.end());
40  theDets.insert(theDets.end(), theFrontDetBrothers.begin(), theFrontDetBrothers.end());
41  theDets.insert(theDets.end(), theBackDetBrothers.begin(), theBackDetBrothers.end());
42 
43  // the dets should be already phi-ordered. TO BE CHECKED
44  //sort( theFrontDets.begin(), theFrontDets.end(), DetLessPhi() );
45  //sort( theBackDets.begin(), theBackDets.end(), DetLessPhi() );
46 
48 
51 
52  theFrontBinFinder = BinFinderType(theFrontDets.front()->surface().position().phi(), theFrontDets.size());
53  theBackBinFinder = BinFinderType(theBackDets.front()->surface().position().phi(), theBackDets.size());
54 
55 #ifdef EDM_ML_DEBUG
56  LogDebug("TkDetLayers") << "DEBUG INFO for Phase2EndcapRing";
57  for (vector<const GeomDet*>::const_iterator it = theFrontDets.begin(); it != theFrontDets.end(); it++) {
58  LogDebug("TkDetLayers") << "frontDet detId,phi,z,r: " << (*it)->geographicalId().rawId() << " , "
59  << (*it)->surface().position().phi() << " , " << (*it)->surface().position().z() << " , "
60  << (*it)->surface().position().perp();
61  }
62 
63  if (!theFrontDetBrothers.empty()) {
64  for (vector<const GeomDet*>::const_iterator it = theFrontDetBrothers.begin(); it != theFrontDetBrothers.end();
65  it++) {
66  LogDebug("TkDetLayers") << "frontDet brothers detId,phi,z,r: " << (*it)->geographicalId().rawId() << " , "
67  << (*it)->surface().position().phi() << " , " << (*it)->surface().position().z() << " , "
68  << (*it)->surface().position().perp();
69  }
70  }
71 
72  for (vector<const GeomDet*>::const_iterator it = theBackDets.begin(); it != theBackDets.end(); it++) {
73  LogDebug("TkDetLayers") << "backDet detId,phi,z,r: " << (*it)->geographicalId().rawId() << " , "
74  << (*it)->surface().position().phi() << " , " << (*it)->surface().position().z() << " , "
75  << (*it)->surface().position().perp();
76  }
77 
78  if (!theBackDetBrothers.empty()) {
79  for (vector<const GeomDet*>::const_iterator it = theBackDetBrothers.begin(); it != theBackDetBrothers.end(); it++) {
80  LogDebug("TkDetLayers") << "backDet brothers detId,phi,z,r: " << (*it)->geographicalId().rawId() << " , "
81  << (*it)->surface().position().phi() << " , " << (*it)->surface().position().z() << " , "
82  << (*it)->surface().position().perp();
83  }
84  }
85 #endif
86 }
87 
89 
90 const vector<const GeometricSearchDet*>& Phase2EndcapRing::components() const {
91  throw DetLayerException("Phase2EndcapRing doesn't have GeometricSearchDet components");
92 }
93 
94 pair<bool, TrajectoryStateOnSurface> Phase2EndcapRing::compatible(const TrajectoryStateOnSurface&,
95  const Propagator&,
96  const MeasurementEstimator&) const {
97  edm::LogError("TkDetLayers") << "temporary dummy implementation of Phase2EndcapRing::compatible()!!";
98  return pair<bool, TrajectoryStateOnSurface>();
99 }
100 
102  const Propagator& prop,
103  const MeasurementEstimator& est,
104  std::vector<DetGroup>& result) const {
105  SubLayerCrossings crossings;
106  crossings = computeCrossings(tsos, prop.propagationDirection());
107  if (!crossings.isValid())
108  return;
109 
110  std::vector<DetGroup> closestResult;
111  std::vector<DetGroup> closestBrotherResult;
112  addClosest(tsos, prop, est, crossings.closest(), closestResult, closestBrotherResult);
113  if (closestResult.empty())
114  return;
115 
116  DetGroupElement closestGel(closestResult.front().front());
117  int crossingSide = LayerCrossingSide().endcapSide(closestGel.trajectoryState(), prop);
118  float phiWindow = tkDetUtil::computeWindowSize(closestGel.det(), closestGel.trajectoryState(), est);
119  searchNeighbors(tsos, prop, est, crossings.closest(), phiWindow, closestResult, closestBrotherResult, false);
120 
121  vector<DetGroup> closestCompleteResult;
123  std::move(closestResult), std::move(closestBrotherResult), closestCompleteResult, 0, crossingSide);
124 
125  vector<DetGroup> nextResult;
126  vector<DetGroup> nextBrotherResult;
127  searchNeighbors(tsos, prop, est, crossings.other(), phiWindow, nextResult, nextBrotherResult, true);
128 
129  vector<DetGroup> nextCompleteResult;
131  std::move(nextResult), std::move(nextBrotherResult), nextCompleteResult, 0, crossingSide);
132 
134  std::move(closestCompleteResult), std::move(nextCompleteResult), result, crossings.closestIndex(), crossingSide);
135 
136  //due to propagator problems, when we add single pt sub modules, we should order them in z (endcap)
137  if (!theFrontDetBrothers.empty() && !theBackDetBrothers.empty())
138  sort(result.begin(), result.end(), DetGroupElementZLess());
139 
140 #ifdef EDM_ML_DEBUG
141  LogTrace("TkDetLayers") << "Number of groups : " << result.size() << std::endl;
142  for (auto& grp : result) {
143  if (grp.empty())
144  continue;
145  LogTrace("TkDetLayers") << "New group in Phase2EndcapRing made by : " << std::endl;
146  for (auto const& det : grp) {
147  LogTrace("TkDetLayers") << " geom det at r: " << det.det()->position().perp()
148  << " id:" << det.det()->geographicalId().rawId()
149  << " tsos at:" << det.trajectoryState().globalPosition() << std::endl;
150  }
151  }
152 #endif
153 }
154 
156  PropagationDirection propDir) const {
157  auto rho = startingState.transverseCurvature();
158 
159  HelixPlaneCrossing::PositionType startPos(startingState.globalPosition());
160  HelixPlaneCrossing::DirectionType startDir(startingState.globalMomentum());
161  HelixForwardPlaneCrossing crossing(startPos, startDir, rho, propDir);
162 
163  pair<bool, double> frontPath = crossing.pathLength(*theFrontDisk);
164  if (!frontPath.first)
165  return SubLayerCrossings();
166 
167  pair<bool, double> backPath = crossing.pathLength(*theBackDisk);
168  if (!backPath.first)
169  return SubLayerCrossings();
170 
171  GlobalPoint gFrontPoint(crossing.position(frontPath.second));
172  GlobalPoint gBackPoint(crossing.position(backPath.second));
173 
174  int frontIndex = theFrontBinFinder.binIndex(gFrontPoint.barePhi());
175  SubLayerCrossing frontSLC(0, frontIndex, gFrontPoint);
176 
177  int backIndex = theBackBinFinder.binIndex(gBackPoint.barePhi());
178  SubLayerCrossing backSLC(1, backIndex, gBackPoint);
179 
180  // 0ss: frontDisk has index=0, backDisk has index=1
181  float frontDist = std::abs(Geom::deltaPhi(gFrontPoint.barePhi(), theFrontDets[frontIndex]->surface().phi()));
182  float backDist = std::abs(Geom::deltaPhi(gBackPoint.barePhi(), theBackDets[backIndex]->surface().phi()));
183 
184  if (frontDist < backDist) {
185  return SubLayerCrossings(frontSLC, backSLC, 0);
186  } else {
187  return SubLayerCrossings(backSLC, frontSLC, 1);
188  }
189 }
190 
192  const Propagator& prop,
193  const MeasurementEstimator& est,
194  const SubLayerCrossing& crossing,
195  vector<DetGroup>& result,
196  vector<DetGroup>& brotherresult) const {
197  const vector<const GeomDet*>& sub(subLayer(crossing.subLayerIndex()));
198  const GeomDet* det(sub[crossing.closestDetIndex()]);
199  bool firstgroup = CompatibleDetToGroupAdder::add(*det, tsos, prop, est, result);
200  if (theFrontDetBrothers.empty() && theBackDetBrothers.empty())
201  return firstgroup;
202  // it assumes that the closestDetIndex is ok also for the brother detectors: the crossing is NOT recomputed
203  const vector<const GeomDet*>& subBrothers(subLayerBrothers(crossing.subLayerIndex()));
204  const GeomDet* detBrother(subBrothers[crossing.closestDetIndex()]);
205  bool brothergroup = CompatibleDetToGroupAdder::add(*detBrother, tsos, prop, est, brotherresult);
206  return firstgroup || brothergroup;
207 }
208 
210  const Propagator& prop,
211  const MeasurementEstimator& est,
212  const SubLayerCrossing& crossing,
213  float window,
214  vector<DetGroup>& result,
215  vector<DetGroup>& brotherresult,
216  bool checkClosest) const {
217  const GlobalPoint& gCrossingPos = crossing.position();
218 
219  const vector<const GeomDet*>& sLayer(subLayer(crossing.subLayerIndex()));
220  // It assumes that what is ok for the front modules in the pt modules is ok also for the back module
221  const vector<const GeomDet*>& sBrotherLayer(subLayerBrothers(crossing.subLayerIndex()));
222 
223  int closestIndex = crossing.closestDetIndex();
224  int negStartIndex = closestIndex - 1;
225  int posStartIndex = closestIndex + 1;
226 
227  if (checkClosest) { // must decide if the closest is on the neg or pos side
228  if (Geom::phiLess(gCrossingPos.barePhi(), sLayer[closestIndex]->surface().phi())) {
229  posStartIndex = closestIndex;
230  } else {
231  negStartIndex = closestIndex;
232  }
233  }
234 
235  const BinFinderType& binFinder = (crossing.subLayerIndex() == 0 ? theFrontBinFinder : theBackBinFinder);
236 
237  typedef CompatibleDetToGroupAdder Adder;
238  int half = sLayer.size() / 2; // to check if dets are called twice....
239  for (int idet = negStartIndex; idet >= negStartIndex - half; idet--) {
240  const GeomDet& neighborDet = *sLayer[binFinder.binIndex(idet)];
241  if (!tkDetUtil::overlapInPhi(gCrossingPos, neighborDet, window))
242  break;
243  if (!Adder::add(neighborDet, tsos, prop, est, result))
244  break;
245  if (theFrontDetBrothers.empty() && theBackDetBrothers.empty())
246  break;
247  // If the two above checks are passed also the brother module will be added with no further checks
248  const GeomDet& neighborBrotherDet = *sBrotherLayer[binFinder.binIndex(idet)];
249  Adder::add(neighborBrotherDet, tsos, prop, est, brotherresult);
250  // maybe also add shallow crossing angle test here???
251  }
252  for (int idet = posStartIndex; idet < posStartIndex + half; idet++) {
253  const GeomDet& neighborDet = *sLayer[binFinder.binIndex(idet)];
254  if (!tkDetUtil::overlapInPhi(gCrossingPos, neighborDet, window))
255  break;
256  if (!Adder::add(neighborDet, tsos, prop, est, result))
257  break;
258  if (theFrontDetBrothers.empty() && theBackDetBrothers.empty())
259  break;
260  // If the two above checks are passed also the brother module will be added with no further checks
261  const GeomDet& neighborBrotherDet = *sBrotherLayer[binFinder.binIndex(idet)];
262  Adder::add(neighborBrotherDet, tsos, prop, est, brotherresult);
263  // maybe also add shallow crossing angle test here???
264  }
265 }
Common base class.
void groupedCompatibleDetsV(const TrajectoryStateOnSurface &tsos, const Propagator &prop, const MeasurementEstimator &est, std::vector< DetGroup > &result) const override __attribute__((hot))
const std::vector< const GeometricSearchDet * > & components() const override __attribute__((cold))
Returns basic components, if any.
def window
Definition: svgfig.py:643
int binIndex(T phi) const override
returns an index in the valid range for the bin that contains phi
std::vector< const GeomDet * > theDets
int closestIndex() const
std::vector< const GeomDet * > theFrontDets
int closestDetIndex() const
std::vector< const GeomDet * > theFrontDetBrothers
GlobalPoint globalPosition() const
std::vector< const GeomDet * > theBackDets
virtual PropagationDirection propagationDirection() const final
Definition: Propagator.h:139
PropagationDirection
Log< level::Error, false > LogError
bool overlapInPhi(float phi, const GeomDet &det, float phiWindow)
Definition: TkDetUtil.h:18
const std::vector< const GeomDet * > & subLayer(int ind) const
#define LogTrace(id)
tuple result
Definition: mps_fire.py:311
const GlobalPoint & position() const
float computeWindowSize(const GeomDet *det, const TrajectoryStateOnSurface &tsos, const MeasurementEstimator &est)
Definition: TkDetUtil.cc:10
T barePhi() const
Definition: PV3DBase.h:65
std::pair< const GeomDet *, TrajectoryStateOnSurface > DetWithState
int subLayerIndex() const
ReferenceCountingPointer< BoundDisk > theFrontDisk
def move
Definition: eostools.py:511
BinFinderType theFrontBinFinder
Abs< T >::type abs(const T &t)
Definition: Abs.h:22
static int endcapSide(const TrajectoryStateOnSurface &startingState, const Propagator &prop)
ReferenceCountingPointer< BoundDisk > theDisk
const std::vector< const GeomDet * > & subLayerBrothers(int ind) const
std::vector< const GeomDet * > theBackDetBrothers
void searchNeighbors(const TrajectoryStateOnSurface &tsos, const Propagator &prop, const MeasurementEstimator &est, const SubLayerCrossing &crossing, float window, std::vector< DetGroup > &result, std::vector< DetGroup > &brotherresult, bool checkClosest) const __attribute__((hot))
bool phiLess(float phi1, float phi2)
Definition: VectorUtil.h:18
const SubLayerCrossing & other() const
static bool add(const GeometricSearchDet &det, const TrajectoryStateOnSurface &tsos, const Propagator &prop, const MeasurementEstimator &est, std::vector< DetGroup > &result) __attribute__((hot))
void add(std::map< std::string, TH1 * > &h, TH1 *hist)
bool addClosest(const TrajectoryStateOnSurface &tsos, const Propagator &prop, const MeasurementEstimator &est, const SubLayerCrossing &crossing, std::vector< DetGroup > &result, std::vector< DetGroup > &brotherresult) const __attribute__((hot))
double b
Definition: hdecay.h:118
const SubLayerCrossing & closest() const
GlobalVector globalMomentum() const
~Phase2EndcapRing() override
double a
Definition: hdecay.h:119
bool operator()(DetGroup a, DetGroup b)
string end
Definition: dataset.py:937
PeriodicBinFinderInPhi< float > BinFinderType
static void orderAndMergeTwoLevels(std::vector< DetGroup > &&one, std::vector< DetGroup > &&two, std::vector< DetGroup > &result, int firstIndex, int firstCrossed)
std::pair< const GeomDet *, TrajectoryStateOnSurface > DetWithState
SubLayerCrossings computeCrossings(const TrajectoryStateOnSurface &tsos, PropagationDirection propDir) const __attribute__((hot))
BinFinderType theBackBinFinder
std::pair< bool, TrajectoryStateOnSurface > compatible(const TrajectoryStateOnSurface &, const Propagator &, const MeasurementEstimator &) const override
ReferenceCountingPointer< BoundDisk > theBackDisk
#define LogDebug(id)
Phase2EndcapRing(std::vector< const GeomDet * > &innerDets, std::vector< const GeomDet * > &outerDets, const std::vector< const GeomDet * > &innerDetBrothers=std::vector< const GeomDet * >(), const std::vector< const GeomDet * > &outerDetBrothers=std::vector< const GeomDet * >())