ATLAS Offline Software
Loading...
Searching...
No Matches
GridTripletSeedingTool.cxx
Go to the documentation of this file.
1/*
2 Copyright (C) 2002-2025 CERN for the benefit of the ATLAS collaboration
3*/
4
6
7namespace ActsTrk {
8
10 const std::string& name,
11 const IInterface* parent)
12 : base_class(type, name, parent) {}
13
15 ATH_MSG_DEBUG("Initializing " << name() << "...");
16
17 ATH_MSG_DEBUG("Properties Summary:");
23
24 ATH_MSG_DEBUG(" * Used by space point grid config:");
25 ATH_MSG_DEBUG(" " << m_minPt);
28 ATH_MSG_DEBUG(" " << m_zMin);
29 ATH_MSG_DEBUG(" " << m_zMax);
37
38 ATH_MSG_DEBUG(" * Used by seed finder config:");
39 ATH_MSG_DEBUG(" " << m_minPt);
42 ATH_MSG_DEBUG(" " << m_zMin);
43 ATH_MSG_DEBUG(" " << m_zMax);
45 ATH_MSG_DEBUG(" " << m_rMax);
66 } else if (not m_rRangeMiddleSP.empty())
86 }
89 ATH_MSG_DEBUG(" " << m_phiMin);
90 ATH_MSG_DEBUG(" " << m_phiMax);
91 ATH_MSG_DEBUG(" " << m_rMin);
92 ATH_MSG_DEBUG(" " << m_zAlign);
93 ATH_MSG_DEBUG(" " << m_rAlign);
95
96 ATH_MSG_DEBUG(" * Used by seed filter config:");
120 }
127
128 // Make the logger && Propagate to ACTS routines
129 m_logger = makeActsAthenaLogger(this, "Acts");
130
131 if (m_zBinEdges.size() - 1 != m_zBinNeighborsTop.size() &&
132 not m_zBinNeighborsTop.empty()) {
133 ATH_MSG_ERROR("Inconsistent config zBinNeighborsTop");
134 return StatusCode::FAILURE;
135 }
136
137 if (m_zBinEdges.size() - 1 != m_zBinNeighborsBottom.size() &&
138 not m_zBinNeighborsBottom.empty()) {
139 ATH_MSG_ERROR("Inconsistent config zBinNeighborsBottom");
140 return StatusCode::FAILURE;
141 }
142
143 if (m_rBinEdges.size() - 1 != m_rBinNeighborsTop.size() &&
144 not m_rBinNeighborsTop.empty()) {
145 ATH_MSG_ERROR("Inconsistent config rBinNeighborsTop");
146 return StatusCode::FAILURE;
147 }
148
149 if (m_rBinEdges.size() - 1 != m_rBinNeighborsBottom.size() &&
150 not m_rBinNeighborsBottom.empty()) {
151 ATH_MSG_ERROR("Inconsistent config rBinNeighborsBottom");
152 return StatusCode::FAILURE;
153 }
154
155 if (m_zBinsCustomLooping.size() != 0) {
156 // zBinsCustomLooping can contain a number of elements <= to the total
157 // number of bin in zBinEdges
158 for (std::size_t i : m_zBinsCustomLooping) {
159 if (i >= m_zBinEdges.size()) {
161 "Inconsistent config zBinsCustomLooping contains bins that are not "
162 "in zBinEdges");
163 return StatusCode::FAILURE;
164 }
165 }
166 }
167
168 if (m_rBinsCustomLooping.size() != 0) {
169 for (std::size_t i : m_rBinsCustomLooping) {
170 if (i >= m_rBinEdges.size()) {
172 "Inconsistent config rBinsCustomLooping contains bins that are not "
173 "in rBinEdges");
174 return StatusCode::FAILURE;
175 }
176 }
177 }
178
179 m_gridCfg.minPt = m_minPt;
180 m_gridCfg.rMin = 0;
181 m_gridCfg.rMax = m_gridRMax;
182 m_gridCfg.zMin = m_zMin;
183 m_gridCfg.zMax = m_zMax;
184 m_gridCfg.deltaRMax = m_deltaRMax;
185 m_gridCfg.cotThetaMax = m_cotThetaMax;
186 m_gridCfg.impactMax = m_impactMax;
187 m_gridCfg.phiMin = m_gridPhiMin;
188 m_gridCfg.phiMax = m_gridPhiMax;
189 m_gridCfg.phiBinDeflectionCoverage = m_phiBinDeflectionCoverage;
190 m_gridCfg.maxPhiBins = m_maxPhiBins;
191 m_gridCfg.zBinEdges = m_zBinEdges;
192 m_gridCfg.rBinEdges = m_rBinEdges;
193 m_gridCfg.bFieldInZ = 0; // will be set later
194 m_gridCfg.bottomBinFinder = Acts::GridBinFinder<3ul>(
196 m_rBinNeighborsBottom.value());
197 m_gridCfg.topBinFinder = Acts::GridBinFinder<3ul>(m_numPhiNeighbors.value(),
198 m_zBinNeighborsTop.value(),
199 m_rBinNeighborsTop.value());
200 m_gridCfg.navigation[0ul] = {};
201 m_gridCfg.navigation[1ul] = m_zBinsCustomLooping;
202 m_gridCfg.navigation[2ul] = m_rBinsCustomLooping;
203
204 m_bottomDoubletFinderCfg.spacePointsSortedByRadius = true;
205 m_bottomDoubletFinderCfg.candidateDirection = Acts::Direction::Backward();
216 m_bottomDoubletFinderCfg.helixCutTolerance = 1.;
218 m_bottomDoubletFinderCfg.experimentCuts
220 this);
221 }
222
223 m_topDoubletFinderCfg = m_bottomDoubletFinderCfg; // copy the bottom cuts
224 m_topDoubletFinderCfg.candidateDirection = Acts::Direction::Forward();
227
231 m_tripletFinderCfg.sigmaScattering = m_sigmaScattering;
232 m_tripletFinderCfg.radLengthPerSeed = m_radLengthPerSeed;
234 m_tripletFinderCfg.helixCutTolerance = 1.;
235 m_tripletFinderCfg.toleranceParam = m_toleranceParam;
236
237 m_filterCfg.deltaInvHelixDiameter = m_deltaInvHelixDiameter;
238 m_filterCfg.deltaRMin = m_deltaRMin;
239 m_filterCfg.compatSeedWeight = m_compatSeedWeight;
240 m_filterCfg.impactWeightFactor = m_impactWeightFactor;
241 m_filterCfg.zOriginWeightFactor = m_zOriginWeightFactor;
242 m_filterCfg.maxSeedsPerSpM = m_maxSeedsPerSpM;
243 m_filterCfg.compatSeedLimit = m_compatSeedLimit;
244 m_filterCfg.seedWeightIncrement = m_seedWeightIncrement;
245 m_filterCfg.numSeedIncrement = m_numSeedIncrement;
246 m_filterCfg.seedConfirmation = m_seedConfirmationInFilter;
247 m_filterCfg.centralSeedConfirmationRange.zMinSeedConf = m_seedConfCentralZMin;
248 m_filterCfg.centralSeedConfirmationRange.zMaxSeedConf = m_seedConfCentralZMax;
249 m_filterCfg.centralSeedConfirmationRange.rMaxSeedConf = m_seedConfCentralRMax;
250 m_filterCfg.centralSeedConfirmationRange.nTopForLargeR =
252 m_filterCfg.centralSeedConfirmationRange.nTopForSmallR =
254 m_filterCfg.centralSeedConfirmationRange.seedConfMinBottomRadius =
256 m_filterCfg.centralSeedConfirmationRange.seedConfMaxZOrigin =
258 m_filterCfg.centralSeedConfirmationRange.minImpactSeedConf =
260 m_filterCfg.forwardSeedConfirmationRange.zMinSeedConf = m_seedConfForwardZMin;
261 m_filterCfg.forwardSeedConfirmationRange.zMaxSeedConf = m_seedConfForwardZMax;
262 m_filterCfg.forwardSeedConfirmationRange.rMaxSeedConf = m_seedConfForwardRMax;
263 m_filterCfg.forwardSeedConfirmationRange.nTopForLargeR =
265 m_filterCfg.forwardSeedConfirmationRange.nTopForSmallR =
267 m_filterCfg.forwardSeedConfirmationRange.seedConfMinBottomRadius =
269 m_filterCfg.forwardSeedConfirmationRange.seedConfMaxZOrigin =
271 m_filterCfg.forwardSeedConfirmationRange.minImpactSeedConf =
273 m_filterCfg.maxSeedsPerSpMConf = m_maxSeedsPerSpMConf;
274 m_filterCfg.maxQualitySeedsPerSpMConf = m_maxQualitySeedsPerSpMConf;
275 m_filterCfg.useDeltaRinsteadOfTopRadius = m_useDeltaRorTopRadius;
276
277 m_finder = Acts::TripletSeeder(logger().cloneWithSuffix("Finder"));
278
279 m_loggerFilter = logger().cloneWithSuffix("Filter");
280
281 ATH_CHECK(detStore()->retrieve(m_pixelId, "PixelID"));
282
283 return StatusCode::SUCCESS;
284}
285
287 const xAOD::SpacePoint* sp, float r) const {
288 float zabs = std::abs(sp->z());
289 float absCotTheta = zabs / r;
290
291 // checking configuration to remove pixel space points
292 Identifier identifier = m_pixelId->wafer_id(sp->elementIdList().at(0));
293 if (m_pixelId->is_barrel(identifier)) {
294 if (zabs > 200 && r < 40)
295 return false;
296
297 return true;
298 }
299
300 // Inner layers
301 // Below 1.20 - accept all
302 static constexpr float cotThetaEta120 = 1.5095;
303 if (absCotTheta < cotThetaEta120)
304 return true;
305
306 // Below 3.40 - remove if too close to beamline
307 static constexpr float cotThetaEta340 = 14.9654;
308 if (absCotTheta < cotThetaEta340 && r < m_expCutrMin)
309 return false;
310
311 // Outer layers
312 // Above 2.20
313 static constexpr float cotThetaEta220 = 4.4571;
314 if (absCotTheta > cotThetaEta220 && r > 260.)
315 return false;
316
317 // Above 2.60
318 static constexpr float cotThetaEta260 = 6.6947;
319 if (absCotTheta > cotThetaEta260 && r > 200.)
320 return false;
321
322 // Above 3.20
323 static constexpr float cotThetaEta320 = 12.2459;
324 if (absCotTheta > cotThetaEta320 && r > 140.)
325 return false;
326
327 // Above 4.00
328 static constexpr float cotThetaEta400 = 27.2899;
329 if (absCotTheta > cotThetaEta400)
330 return false;
331
332 return true;
333}
334
336 const Acts::ConstSpacePointProxy2& middle,
337 const Acts::ConstSpacePointProxy2& other, float cotTheta,
338 bool isBottomCandidate) const {
339 // We remove some doublets that have the middle space point in some specific
340 // areas This should eventually be moved inside ACTS and allow a veto
341 // mechanism according to the user desire. As of now we cannot really do this
342 // since we define a range of validity of the middle candidate, and if we want
343 // to veto some sub-regions inside it, we need to do it here.
344 if (std::abs(middle.zr()[0]) > 1500 and middle.zr()[1] > 100 and
345 middle.zr()[1] < 150) {
346 return false;
347 }
348
349 // We remove here some seeds, in case the bottom space point radius is
350 // too small (i.e. < fastTrackingRMin)
351
352 // This operation is done only within a specific eta window
353 // Instead of eta we use the doublet cottheta
354 static constexpr float cotThetaEta120 = 1.5095;
355 static constexpr float cotThetaEta360 = 18.2855;
356
357 float absCotTheta = std::abs(cotTheta);
358 if (isBottomCandidate && other.zr()[1] < m_expCutrMin &&
359 absCotTheta > cotThetaEta120 && absCotTheta < cotThetaEta360) {
360 return false;
361 }
362
363 return true;
364}
365
367 const Acts::ConstSpacePointProxy2& spM,
368 const Acts::Range1D<float>& rMiddleSpRange) const {
370 return {rMiddleSpRange.min(), rMiddleSpRange.max()};
371 }
372 if (m_rRangeMiddleSP.empty()) {
373 throw std::runtime_error(
374 "m_rRangeMiddleSP is empty, please check the configuration.");
375 }
376
377 // get zBin position of the middle SP
378 auto pVal =
379 std::lower_bound(m_zBinEdges.begin(), m_zBinEdges.end(), spM.zr()[0]);
380 int zBin = std::distance(m_zBinEdges.begin(), pVal);
381 // protects against zM at the limit of zBinEdges
382 zBin == 0 ? zBin : --zBin;
383 return {m_rRangeMiddleSP[zBin][0], m_rRangeMiddleSP[zBin][1]};
384}
385
387 const EventContext& ctx,
388 const std::vector<const xAOD::SpacePointContainer*>& spacePointCollections,
389 const Eigen::Vector3f& beamSpotPos, float bFieldInZ,
390 ActsTrk::SeedContainer& seedContainer) const {
391 (void)ctx;
392
393 auto gridCfg = m_gridCfg;
394 gridCfg.bFieldInZ = bFieldInZ;
395
396 Acts::CylindricalSpacePointGrid2 grid(gridCfg,
397 logger().cloneWithSuffix("Grid"));
398
399 std::size_t totalSpacePoints = 0;
400 for (const xAOD::SpacePointContainer* spacePoints : spacePointCollections) {
401 totalSpacePoints += spacePoints->size();
402 }
403
404 std::vector<const xAOD::SpacePoint*> selectedXAODSpacePoints;
405 std::vector<float> selectedSpacePointsR;
406 selectedXAODSpacePoints.reserve(totalSpacePoints);
407 selectedSpacePointsR.reserve(totalSpacePoints);
408
409 for (const xAOD::SpacePointContainer* spacePoints : spacePointCollections) {
410 for (const xAOD::SpacePoint* sp : *spacePoints) {
411 float x = static_cast<float>(sp->x() - beamSpotPos[0]);
412 float y = static_cast<float>(sp->y() - beamSpotPos[1]);
413 float z = static_cast<float>(sp->z());
414 float r = std::hypot(x, y);
415 float phi = std::atan2(y, x);
416
418 continue;
419 }
420
421 grid.insert(selectedXAODSpacePoints.size(), phi, z, r);
422 selectedXAODSpacePoints.push_back(sp);
423 selectedSpacePointsR.push_back(r);
424 }
425 }
426
427 for (std::size_t i = 0; i < grid.numberOfBins(); ++i) {
428 std::ranges::sort(grid.at(i), [&](const Acts::SpacePointIndex2& a,
429 const Acts::SpacePointIndex2& b) {
430 return selectedSpacePointsR[a] < selectedSpacePointsR[b];
431 });
432 }
433
434 Acts::SpacePointContainer2 selectedSpacePoints;
435 selectedSpacePoints.createColumns(
436 Acts::SpacePointColumns::XY |
437 Acts::SpacePointColumns::ZR | Acts::SpacePointColumns::VarianceZ |
438 Acts::SpacePointColumns::VarianceR);
440 selectedSpacePoints.createColumns(Acts::SpacePointColumns::Strip);
441 }
442 selectedSpacePoints.reserve(grid.numberOfSpacePoints());
443 seedContainer.spacePoints().reserve(grid.numberOfSpacePoints());
444 std::vector<Acts::SpacePointIndex2> copyFromIndices;
445 copyFromIndices.reserve(grid.numberOfSpacePoints());
446 std::vector<Acts::SpacePointIndexRange2> gridSpacePointRanges;
447 gridSpacePointRanges.reserve(grid.numberOfBins());
448 for (std::size_t i = 0; i < grid.numberOfBins(); ++i) {
449 std::uint32_t begin = selectedSpacePoints.size();
450 for (const Acts::SpacePointIndex2 spIndex : grid.at(i)) {
451 const xAOD::SpacePoint* sp = selectedXAODSpacePoints[spIndex];
452
453 seedContainer.spacePoints().push_back(sp);
454 auto newSp = selectedSpacePoints.createSpacePoint();
455 newSp.xy() =
456 std::array<float, 2>{static_cast<float>(sp->x() - beamSpotPos[0]),
457 static_cast<float>(sp->y() - beamSpotPos[1])};
458 newSp.zr() = std::array<float, 2>{static_cast<float>(sp->z()),
459 selectedSpacePointsR[spIndex]};
460 newSp.varianceZ() = static_cast<float>(sp->varianceZ());
461 newSp.varianceR() = static_cast<float>(sp->varianceR());
463 Eigen::Vector3f topStripVector =
464 sp->topHalfStripLength() * sp->topStripDirection();
465 Eigen::Vector3f bottomStripVector =
466 sp->bottomHalfStripLength() * sp->bottomStripDirection();
467 Eigen::Vector3f stripCenterDistance = sp->stripCenterDistance();
468 Eigen::Vector3f topStripCenter = sp->topStripCenter();
469
470 newSp.topStripVector() = std::array<float, 3>{
471 topStripVector.x(), topStripVector.y(), topStripVector.z()};
472 newSp.bottomStripVector() =
473 std::array<float, 3>{bottomStripVector.x(), bottomStripVector.y(),
474 bottomStripVector.z()};
475 newSp.stripCenterDistance() = std::array<float, 3>{
476 stripCenterDistance.x(), stripCenterDistance.y(),
477 stripCenterDistance.z()};
478 newSp.topStripCenter() = std::array<float, 3>{
479 topStripCenter.x(), topStripCenter.y(), topStripCenter.z()};
480 }
481
482 copyFromIndices.push_back(spIndex);
483 }
484 std::uint32_t end = selectedSpacePoints.size();
485 gridSpacePointRanges.emplace_back(begin, end);
486 }
487
488 // clear temporary
489 selectedXAODSpacePoints = {};
490 selectedSpacePointsR = {};
491
492 ACTS_VERBOSE("Number of space points after selection "
493 << selectedSpacePoints.size() << " out of " << totalSpacePoints);
494
495 // Compute radius range. We rely on the fact the grid is storing the proxies
496 // with a sorting in the radius
497 const Acts::Range1D<float> rRange = [&]() -> Acts::Range1D<float> {
498 float minRange = std::numeric_limits<float>::max();
499 float maxRange = std::numeric_limits<float>::lowest();
500 for (const Acts::SpacePointIndexRange2& range : gridSpacePointRanges) {
501 if (range.first == range.second) {
502 continue;
503 }
504 auto first = selectedSpacePoints[range.first];
505 auto last = selectedSpacePoints[range.second - 1];
506 minRange = std::min(first.zr()[1], minRange);
507 maxRange = std::max(last.zr()[1], maxRange);
508 }
509 return {minRange, maxRange};
510 }();
511
512 auto bottomDoubletFinder =
513 Acts::DoubletSeedFinder::create(Acts::DoubletSeedFinder::DerivedConfig(
514 m_bottomDoubletFinderCfg, bFieldInZ));
515 auto topDoubletFinder = Acts::DoubletSeedFinder::create(
516 Acts::DoubletSeedFinder::DerivedConfig(m_topDoubletFinderCfg, bFieldInZ));
517 auto tripletFinder = Acts::TripletSeedFinder::create(
518 Acts::TripletSeedFinder::DerivedConfig(m_tripletFinderCfg, bFieldInZ));
519
520 // variable middle SP radial region of interest
521 const Acts::Range1D<float> rMiddleSpRange(
522 std::floor(rRange.min() / 2) * 2 + m_deltaRMiddleMinSPRange,
523 std::floor(rRange.max() / 2) * 2 - m_deltaRMiddleMaxSPRange);
524
525 Acts::BroadTripletSeedFilter::State filterState;
526 Acts::BroadTripletSeedFilter::Cache filterCache;
527 Acts::TripletSeeder::Cache cache;
528
529 Acts::BroadTripletSeedFilter filter(m_filterCfg, filterState, filterCache,
531
532 std::vector<Acts::SpacePointContainer2::ConstRange> bottomSpRanges;
533 std::optional<Acts::SpacePointContainer2::ConstRange> middleSpRange;
534 std::vector<Acts::SpacePointContainer2::ConstRange> topSpRanges;
535
536 Acts::SeedContainer2 tmpSeedContainer;
537
538 for (const auto [bottom, middle, top] : grid.binnedGroup()) {
539 ACTS_VERBOSE("Process middle bin " << middle);
540 if (middle >= gridSpacePointRanges.size()) {
541 ATH_MSG_ERROR("Grid Binned Group returned an unreasonable middle bin");
542 return StatusCode::FAILURE;
543 }
544
545 bottomSpRanges.clear();
546 topSpRanges.clear();
547
548 std::ranges::transform(
549 bottom, std::back_inserter(bottomSpRanges),
550 [&](std::size_t b) -> Acts::SpacePointContainer2::ConstRange {
551 return selectedSpacePoints.range(gridSpacePointRanges[b]).asConst();
552 });
553 middleSpRange =
554 selectedSpacePoints.range(gridSpacePointRanges[middle]).asConst();
555 std::ranges::transform(
556 top, std::back_inserter(topSpRanges),
557 [&](std::size_t t) -> Acts::SpacePointContainer2::ConstRange {
558 return selectedSpacePoints.range(gridSpacePointRanges[t]).asConst();
559 });
560
561 // we compute this here since all middle space point candidates belong to
562 // the same z-bin
563 auto firstMiddleSp = middleSpRange->front();
564 auto radiusRangeForMiddle =
565 retrieveRadiusRangeForMiddle(firstMiddleSp, rMiddleSpRange);
566
567 ACTS_VERBOSE("Validity range (radius) for the middle space point is ["
568 << radiusRangeForMiddle.first << ", "
569 << radiusRangeForMiddle.second << "]");
570
571 m_finder->createSeedsFromGroups(
572 cache, *bottomDoubletFinder, *topDoubletFinder, *tripletFinder, filter,
573 selectedSpacePoints, bottomSpRanges, *middleSpRange, topSpRanges,
574 radiusRangeForMiddle, tmpSeedContainer);
575 }
576
577 // Selection function - temporary implementation
578 // need change from ACTS for final implementation
579 // To be used only on PPP
580 auto selectionFunction =
581 [&filterState](const Acts::MutableSeedProxy2& seed) -> bool {
582 float seedQuality = seed.quality();
583 float bottomQuality =
584 filterState.bestSeedQualityMap.at(seed.spacePointIndices()[0]);
585 float middleQuality =
586 filterState.bestSeedQualityMap.at(seed.spacePointIndices()[1]);
587 float topQuality =
588 filterState.bestSeedQualityMap.at(seed.spacePointIndices()[2]);
589
590 return bottomQuality <= seedQuality || middleQuality <= seedQuality ||
591 topQuality <= seedQuality;
592 };
593
594 seedContainer.reserve(tmpSeedContainer.size());
595
596 // Select the seeds
597 for (Acts::MutableSeedProxy2 seed : tmpSeedContainer) {
598 if (m_seedQualitySelection && !selectionFunction(seed)) {
599 continue;
600 }
601
602 seedContainer.push_back(seed);
603 }
604
605 return StatusCode::SUCCESS;
606}
607
608} // namespace ActsTrk
Scalar phi() const
phi method
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
#define ATH_MSG_DEBUG(x)
static Double_t sp
static Double_t a
std::unique_ptr< const Acts::Logger > makeActsAthenaLogger(IMessageSvc *svc, const std::string &name, int level, std::optional< std::string > parent_name)
@ top
#define y
#define x
#define z
bool spacePointSelectionFunction(const xAOD::SpacePoint *sp, float r) const
Acts::TripletSeedFinder::Config m_tripletFinderCfg
Gaudi::Property< bool > m_useDeltaRorTopRadius
Gaudi::Property< bool > m_seedQualitySelection
Gaudi::Property< float > m_seedConfForwardMinImpact
Acts::DoubletSeedFinder::Config m_bottomDoubletFinderCfg
Gaudi::Property< std::vector< std::pair< int, int > > > m_rBinNeighborsTop
Gaudi::Property< float > m_impactWeightFactor
std::pair< float, float > retrieveRadiusRangeForMiddle(const Acts::ConstSpacePointProxy2 &spM, const Acts::Range1D< float > &rMiddleSpRange) const
Acts::DoubletSeedFinder::Config m_topDoubletFinderCfg
Gaudi::Property< float > m_collisionRegionMax
StatusCode createSeeds2(const EventContext &ctx, const std::vector< const xAOD::SpacePointContainer * > &spacePointCollections, const Eigen::Vector3f &beamSpotPos, float bFieldInZ, ActsTrk::SeedContainer &seedContainer) const override
Gaudi::Property< float > m_seedConfCentralMinBottomRadius
std::optional< Acts::TripletSeeder > m_finder
Gaudi::Property< int > m_phiBinDeflectionCoverage
Gaudi::Property< float > m_zOriginWeightFactor
Gaudi::Property< std::size_t > m_maxSeedsPerSpMConf
Gaudi::Property< float > m_maxPtScattering
Gaudi::Property< bool > m_useVariableMiddleSPRange
Gaudi::Property< float > m_toleranceParam
Gaudi::Property< float > m_deltaRMaxBottomSP
Gaudi::Property< float > m_seedConfForwardMinBottomRadius
Gaudi::Property< float > m_compatSeedWeight
Gaudi::Property< std::vector< std::vector< double > > > m_rRangeMiddleSP
Gaudi::Property< float > m_deltaRMinTopSP
Gaudi::Property< float > m_seedConfForwardZMin
Acts::BroadTripletSeedFilter::Config m_filterCfg
Gaudi::Property< std::vector< std::pair< int, int > > > m_rBinNeighborsBottom
Gaudi::Property< bool > m_useDetailedDoubleMeasurementInfo
Gaudi::Property< std::vector< std::pair< int, int > > > m_zBinNeighborsBottom
Acts::CylindricalSpacePointGrid2::Config m_gridCfg
Gaudi::Property< float > m_gridPhiMin
Gaudi::Property< bool > m_interactionPointCut
Gaudi::Property< size_t > m_seedConfCentralNTopSmallR
Gaudi::Property< std::vector< float > > m_rBinEdges
Gaudi::Property< float > m_seedConfForwardRMax
Gaudi::Property< float > m_deltaRMiddleMaxSPRange
GridTripletSeedingTool(const std::string &type, const std::string &name, const IInterface *parent)
Gaudi::Property< std::vector< std::pair< int, int > > > m_zBinNeighborsTop
Gaudi::Property< float > m_deltaInvHelixDiameter
Gaudi::Property< float > m_collisionRegionMin
Gaudi::Property< float > m_seedConfCentralMaxZOrigin
Gaudi::Property< float > m_seedConfCentralMinImpact
Gaudi::Property< std::size_t > m_maxQualitySeedsPerSpMConf
Gaudi::Property< float > m_gridPhiMax
Gaudi::Property< std::vector< float > > m_zBinEdges
Gaudi::Property< bool > m_seedConfirmation
Gaudi::Property< float > m_seedConfForwardMaxZOrigin
Gaudi::Property< float > m_seedWeightIncrement
bool doubletSelectionFunction(const Acts::ConstSpacePointProxy2 &middle, const Acts::ConstSpacePointProxy2 &other, float cotTheta, bool isBottomCandidate) const
Gaudi::Property< float > m_radLengthPerSeed
Gaudi::Property< float > m_cotThetaMax
Gaudi::Property< float > m_deltaRMinBottomSP
Gaudi::Property< size_t > m_seedConfCentralNTopLargeR
virtual StatusCode initialize() override
Gaudi::Property< float > m_deltaRMiddleMinSPRange
Gaudi::Property< float > m_seedConfForwardZMax
Gaudi::Property< bool > m_seedConfirmationInFilter
Gaudi::Property< std::vector< std::size_t > > m_rBinsCustomLooping
const Acts::Logger & logger() const
Private access to the logger.
Gaudi::Property< float > m_seedConfCentralRMax
std::unique_ptr< const Acts::Logger > m_logger
logging instance
Gaudi::Property< float > m_sigmaScattering
std::unique_ptr< const Acts::Logger > m_loggerFilter
Gaudi::Property< std::vector< size_t > > m_zBinsCustomLooping
Gaudi::Property< float > m_seedConfCentralZMax
Gaudi::Property< float > m_deltaRMaxTopSP
Gaudi::Property< std::size_t > m_compatSeedLimit
Gaudi::Property< size_t > m_seedConfForwardNTopSmallR
Gaudi::Property< float > m_seedConfCentralZMin
Gaudi::Property< bool > m_useExperimentCuts
Gaudi::Property< float > m_numSeedIncrement
Gaudi::Property< size_t > m_seedConfForwardNTopLargeR
int r
Definition globals.cxx:22
The AlignStoreProviderAlg loads the rigid alignment corrections and pipes them through the readout ge...
SpacePointContainer_v1 SpacePointContainer
Define the version of the space point container.
Acts::MutableSeedProxy2 push_back(Acts::SpacePointIndexSubset2 sp)
const SpacePointContainer & spacePoints() const noexcept