ATLAS Offline Software
Loading...
Searching...
No Matches
VrtSecInclusive.cxx
Go to the documentation of this file.
1/*
2 Copyright (C) 2002-2026 CERN for the benefit of the ATLAS collaboration
3*/
4
5// Header include
8
11
12// FrameWork include(s):
14
15// ROOT Classes
16#include "TMath.h"
17#include "TH1F.h"
18#include "TH2F.h"
19#include "TNtuple.h"
20#include "TTree.h"
21#include "TROOT.h"
22
23#include <chrono>
24#include <exception>
25#include <functional>
26#include <iostream>
27#include <memory>
28#include <new>
29#include <string>
30#include <tuple>
31
32using namespace std;
33
34
35namespace VKalVrtAthena {
36
37 //Constructor and destructor
38 //__________________________________________________________________________
39 VrtSecInclusive::VrtSecInclusive(const std::string& name, ISvcLocator* pSvcLocator):
40 AthAlgorithm (name,pSvcLocator),
41 m_ntupleVars ( nullptr )
42 {
47
48 if( m_FillNtuple ) {
49 m_ntupleVars = std::make_unique<NtupleVars>( );
50 }
51 }
52
53
54 //__________________________________________________________________________
58
59
60 //__________________________________________________________________________
62 {
63 ATH_MSG_INFO("initialize: begin");
64 //
65 // first instantiate tools
66
67 // VKalVrt vertex fitter
68 if (m_fitSvc.retrieve().isFailure()) {
69 ATH_MSG_ERROR("initialize: Can't find Trk::TrkVKalVrtFitter");
70 return StatusCode::SUCCESS;
71 } else {
72 ATH_MSG_INFO("initialize: Trk::TrkVKalVrtFitter found");
73 }
74
75 //
76 // retreive tool to get trackParameters of generated Particles
77 if(m_truthToTrack.retrieve().isFailure()) {
78 ATH_MSG_INFO("initialize: Cannot retrieve Trk::TruthToTrack Tool!");
79 return StatusCode::FAILURE;
80 }
81 else {
82 ATH_MSG_INFO("initialize: Retrieved Trk::TruthToTrack Tool" << m_truthToTrack);
83
84 }
85 // extract TrackToVertex extrapolator tool
86 if ( m_trackToVertexTool.retrieve().isFailure() ) {
87 ATH_MSG_ERROR("initialize: failed to retrieve trackToVertex tool ");
88 return StatusCode::SUCCESS;
89 }
90 else {
91 ATH_MSG_INFO("initialize: Retrieved Reco::TrackToVertex Tool" << m_trackToVertexTool);
92 }
93 // extract TrackToVertexIPEstimator extrapolator tool
94 if ( m_trackToVertexIPEstimatorTool.retrieve().isFailure() ) {
95 ATH_MSG_ERROR("initialize: failed to retrieve trackToVertexIPEstimator tool ");
96 return StatusCode::SUCCESS;
97 }
98 else {
99 ATH_MSG_INFO("initialize: Retrieved Trk::TrackToVertexIPEstimator Tool" << m_trackToVertexIPEstimatorTool);
100 }
101
102 if( detStore()->retrieve(m_atlasId, "AtlasID").isFailure() ) return StatusCode::FAILURE;
103 if( detStore()->retrieve(m_pixelId, "PixelID").isFailure() ) return StatusCode::FAILURE;
104 if( detStore()->retrieve(m_sctId, "SCT_ID") .isFailure() ) return StatusCode::FAILURE;
105
106 if ( m_pixelCondSummaryTool.retrieve().isFailure() ) {
107 ATH_MSG_ERROR("initialize: failed to retrieve PixelConditionsSummaryTool");
108 return StatusCode::SUCCESS;
109 }
110 else {
111 ATH_MSG_INFO("initialize: Retrieved PixelConditionsSummaryTool" << m_pixelCondSummaryTool);
112 }
113 if ( m_sctCondSummaryTool.retrieve().isFailure() ) {
114 ATH_MSG_ERROR("initialize: failed to retrieve SCTConditionsSummaryTool");
115 return StatusCode::SUCCESS;
116 }
117 else {
118 ATH_MSG_INFO("initialize: Retrieved SCTConditionsSummaryTool" << m_sctCondSummaryTool);
119 }
120
121 ATH_CHECK( m_extrapolator.retrieve() );
122
123 // extract VertexMapper
124 if( m_doMapToLocal ) {
125 ATH_CHECK( m_vertexMapper.retrieve() );
126 }
127
128 // Track selection algorithm configuration
132
133 // if none of the above two flags are activated, use ID tracks (default)
135
137
138 }
139
140
141 // Vertexing algorithm configuration
142 m_vertexingAlgorithms.emplace_back( "extractIncompatibleTrackPairs", &VrtSecInclusive::extractIncompatibleTrackPairs );
143 m_vertexingAlgorithms.emplace_back( "findNtrackVertices", &VrtSecInclusive::findNtrackVertices );
144 m_vertexingAlgorithms.emplace_back( "rearrangeTracks", &VrtSecInclusive::rearrangeTracks );
145
147 m_vertexingAlgorithms.emplace_back( "reassembleVertices", &VrtSecInclusive::reassembleVertices );
148 }
149
151 m_vertexingAlgorithms.emplace_back( "mergeByShuffling", &VrtSecInclusive::mergeByShuffling );
152 }
153
155 m_vertexingAlgorithms.emplace_back( "mergeFinalVertices", &VrtSecInclusive::mergeFinalVertices );
156 }
157
159 m_vertexingAlgorithms.emplace_back( "associateNonSelectedTracks", &VrtSecInclusive::associateNonSelectedTracks );
160 }
161
163
164
165 // now make histograms/ntuples
166
167 ServiceHandle<ITHistSvc> hist_root("THistSvc", name());
168 ATH_CHECK( hist_root.retrieve() );
169
170 if( m_FillHist ) {
171
172 std::vector<double> rbins = { 0.1, 0.3, 0.5, 1, 2, 3, 5, 7, 10, 14, 20, 28, 38, 50, 64, 80, 100, 130, 170, 220, 280, 350, 450, 600 };
173 std::vector<double> nbins = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 20, 24, 28, 38, 50, 70, 100, 150 };
174
175 const size_t& nAlgs = m_vertexingAlgorithms.size();
176
177 ATH_MSG_INFO("initialize: Filling Histograms");
178 //
179 m_hists["trkSelCuts"] = new TH1F("trkSelCuts", ";Cut Order;Tracks", 10, -0.5, 10-0.5 );
180 m_hists["selTracksDist"] = new TH1F("selTracksDist", ";Selected Tracks;Events", 2000, -0.5, 2000-0.5 );
181 m_hists["initVertexDispD0"] = new TH2F("initVertexDispD0", ";Rough d0 wrt init [mm];r [mm];Vertices", 1000, -100, 100, rbins.size()-1, &(rbins[0]) );
182 m_hists["initVertexDispZ0"] = new TH2F("initVertexDispZ0", ";Rough z0 wrt init [mm];z [mm];Vertices", 1000, -100, 100, 100, -1000, 1000 );
183 m_hists["incompMonitor"] = new TH1F("incompMonitor", ";Setp;Track Pairs", 10, -0.5, 10-0.5 );
184 m_hists["2trkVerticesDist"] = new TH1F("2trkVerticesDist", ";2-track Vertices;Events", 1000, -0.5, 1000-0.5 );
185 m_hists["2trkChi2Dist"] = new TH1F("2trkChi2Dist", ";log10(#chi^{2}/N_{dof});Entries", 100, -3, 7 );
186 m_hists["NtrkChi2Dist"] = new TH1F("NtrkChi2Dist", ";log10(#chi^{2}/N_{dof});Entries", 100, -3, 7 );
187 m_hists["vPosDist"] = new TH2F("vPosDist", ";r;#vec{x}*#vec{p}/p_{T} [mm]", rbins.size()-1, &(rbins[0]), 200, -1000, 1000 );
188 m_hists["vPosMomAngTDist"] = new TH2F("vPosMomAngDistT", ";r;cos(#vec{r},#vec{p}_{T})", rbins.size()-1, &(rbins[0]), 200, -1.0, 1.0 );
189 m_hists["disabledCount"] = new TH1F("disabledCount", ";N_{modules};Tracks", 20, -0.5, 10-0.5 );
190 m_hists["vertexYield"] = new TH1F("vertexYield", ";Algorithm Step;Vertices", nAlgs, -0.5, nAlgs-0.5 );
191 m_hists["vertexYieldNtrk"] = new TH2F("vertexYieldNtrk", ";Ntrk;Algorithm Step;Vertices", 100, 0, 100, nAlgs, -0.5, nAlgs-0.5 );
192 m_hists["vertexYieldChi2"] = new TH2F("vertexYieldChi2", ";#chi^{2}/N_{dof};Algorithm Step;Vertices", 100, 0, 100, nAlgs, -0.5, nAlgs-0.5 );
193 m_hists["mergeType"] = new TH1F("mergeType", ";Merge Algorithm Type;Entries", 10, -0.5, 10-0.5 );
194 m_hists["associateMonitor"] = new TH1F("associateMonitor", ";Step;Vertices", 10, -0.5, 10-0.5 );
195 m_hists["shuffleMinSignif1"] = new TH1F("shuffleMinSignif1", ";Min( log_{10}( Significance ) );Vertices", 100, -3, 5 );
196 m_hists["shuffleMinSignif2"] = new TH1F("shuffleMinSignif2", ";Min( log_{10}( Significance ) );Vertices", 100, -3, 5 );
197 m_hists["shuffleMinSignif3"] = new TH1F("shuffleMinSignif3", ";Min( log_{10}( Significance ) );Vertices", 100, -3, 5 );
198 m_hists["finalCutMonitor"] = new TH1F("finalCutMonitor", ";Step;Vertices", 6, -0.5, 6-0.5 );
199 m_hists["finalVtxNtrk"] = new TH1F("finalVtxNtrk", ";N_{trk};Vertices", nbins.size()-1, &(nbins[0]) );
200 m_hists["finalVtxR"] = new TH1F("finalVtxR", ";r [mm];Vertices", 600, 0, 600 );
201 m_hists["finalVtxNtrkR"] = new TH2F("finalVtxNtrkR", ";N_{trk};r [mm];Vertices", nbins.size()-1, &(nbins[0]), rbins.size()-1, &(rbins[0]) );
202 m_hists["CPUTime"] = new TH1F("CPUTime", ";Step;Accum. CPU Time [s]", 10, -0.5, 10-0.5 );
203 m_hists["nMatchedTruths"] = new TH2F("nMatchedTruths", ";Step;;r [mm];Matched truth vertices", 11, -0.5, 11-0.5, rbins.size()-1, &(rbins[0]) );
204 m_hists["vPosMomAngT"] = new TH1F("vPosMomAngT", ";cos(#vec{r},#vec{p}_{T}", 200, -1.0, 1.0 );
205 m_hists["vPosMomAng3D"] = new TH1F("vPosMomAng3D", ";cos(#vec{r},#vec{p})", 200, -1.0, 1.0 );
206 m_hists["2trkVtxDistFromPV"] = new TH1F("2trkVtDistFromPV", ";2tr vertex distance from PV;Events", 100, 0, 3 );
207
208
209 std::string histDir("/AANT/VrtSecInclusive" + m_augVerString + "/");
210
211 for( auto& pair : m_hists ) {
212 ATH_CHECK( hist_root->regHist( histDir + pair.first, pair.second ) );
213 }
214 }
215
216
217 if( m_FillNtuple ) {
218
220
221 m_tree_Vert = new TTree("tree_VrtSecInclusive","TTree of VrtSecInclusive");
222 ATH_CHECK( hist_root->regTree("/AANT/tree_VrtSecInclusive", m_tree_Vert) );
223
225
226 }
227
228 // initialize keys
229 ATH_CHECK(m_eventInfoKey.initialize());
230
231 // Instantiate and initialize our event info decorator write
233 this->declare(m_vertexingStatusKey);
234 m_vertexingStatusKey.setOwner(&(*this));
235 ATH_CHECK(m_vertexingStatusKey.initialize());
236
237 //
238 ATH_MSG_INFO("initialize: Exit VrtSecInclusive::initialize()");
239 return StatusCode::SUCCESS;
240 }
241
242
243
244 //__________________________________________________________________________
246 {
247
248 ATH_MSG_INFO("finalize: VrtSecInclusive finalize()");
249 return StatusCode::SUCCESS;
250 }
251
252 //__________________________________________________________________________
254 {
255
256 ATH_MSG_DEBUG("initEvent: begin");
257
258 // Clear all variables to be stored to the AANT
259 if( m_FillNtuple ) {
261 }
262
263
264 ATH_MSG_DEBUG("initEvent: from initEvent ");
265 return StatusCode::SUCCESS;
266
267 }
268
269
270 //__________________________________________________________________________
272 {
273 //
274 ATH_MSG_DEBUG("VrtSecInclusive execute()");
275
277
279 if (!eventInfo.isValid()) {
280 ATH_MSG_ERROR ("Could not retrieve EventInfo");
281 return StatusCode::FAILURE;
282 }
283
285
286 // clear ntuple variables
287 StatusCode sc = this->initEvent();
288 if(sc.isFailure()) {
289 ATH_MSG_WARNING("Problem in initEvent ");
290 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
291 return StatusCode::SUCCESS;
292 }
293
294 // add event level info to ntuple
295 if( m_FillNtuple ) sc = addEventInfo();
296
297 if (sc.isFailure() ) {
298 ATH_MSG_WARNING("Failure in getEventInfo() ");
299 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
300 return StatusCode::SUCCESS;
301 }
302
303
305 //
306 // Setup StoreGate Variables
307 //
308
309 // Check Return StatusCode::Failure if the user-specified container names have duplication.
310 {
311 std::vector<std::string> userContainerNames { m_secondaryVerticesContainerName, m_all2trksVerticesContainerName };
312 std::set<std::string> userContainerNamesSet;
313 for( auto& name : userContainerNames ) userContainerNamesSet.insert( name );
314 if( userContainerNamesSet.size() != userContainerNames.size() ) {
315 ATH_MSG_ERROR( " > " << __FUNCTION__ << ": detected duplicated user-specified container name. Please check your job property" );
316 return StatusCode::FAILURE;
317 }
318 }
319
320 auto *secondaryVertexContainer = new xAOD::VertexContainer;
321 auto *secondaryVertexAuxContainer = new xAOD::VertexAuxContainer;
322
323 secondaryVertexContainer ->setStore( secondaryVertexAuxContainer );
324
325 ATH_CHECK( evtStore()->record( secondaryVertexContainer, "VrtSecInclusive_" + m_secondaryVerticesContainerName + m_augVerString ) );
326 ATH_CHECK( evtStore()->record( secondaryVertexAuxContainer, "VrtSecInclusive_" + m_secondaryVerticesContainerName + m_augVerString + "Aux." ) );
327
329 auto *twoTrksVertexContainer = new xAOD::VertexContainer;
330 auto *twoTrksVertexAuxContainer = new xAOD::VertexAuxContainer;
331
332 twoTrksVertexContainer ->setStore( twoTrksVertexAuxContainer );
333
334 ATH_CHECK( evtStore()->record( twoTrksVertexContainer, "VrtSecInclusive_" + m_all2trksVerticesContainerName + m_augVerString ) );
335 ATH_CHECK( evtStore()->record( twoTrksVertexAuxContainer, "VrtSecInclusive_" + m_all2trksVerticesContainerName + m_augVerString + "Aux." ) );
336
337 for( auto itr = m_vertexingAlgorithms.begin(); itr!=m_vertexingAlgorithms.end(); ++itr ) {
338
339 auto& name = itr->first;
340
341 auto *intermediateVertexContainer = new xAOD::VertexContainer;
342 auto *intermediateVertexAuxContainer = new xAOD::VertexAuxContainer;
343
344 intermediateVertexContainer ->setStore( intermediateVertexAuxContainer );
345
346 ATH_CHECK( evtStore()->record( intermediateVertexContainer, "VrtSecInclusive_IntermediateVertices_" + name + m_augVerString ) );
347 ATH_CHECK( evtStore()->record( intermediateVertexAuxContainer, "VrtSecInclusive_IntermediateVertices_" + name + m_augVerString + "Aux." ) );
348 }
349
350 }
351
353
354
355 // Later use elsewhere in the algorithm
356 m_selectedTracks.clear();
357 m_associatedTracks.clear();
358 m_leptonicTracks.clear();
359
361
363 //
364 // now start algorithm
365 //
366
367 //--------------------------------------------------------
368 // Primary vertex processing
369 //
370 sc = this->processPrimaryVertices(); // fetch the 1st primary reconstructed vertex
371
372 if( sc.isFailure() or !m_thePV ) {
373
374 ATH_MSG_WARNING("processPrimaryVertices() failed");
375 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
376 return StatusCode::SUCCESS;
377 }
378
379 // Perform track selection and store it to selectedBaseTracks
380 for( auto alg : m_trackSelectionAlgs ) {
381 ATH_CHECK( (this->*alg)() );
382 }
383
384 if( m_FillNtuple )
385 m_ntupleVars->get<unsigned int>( "NumSelTrks" ) = static_cast<int>( m_selectedTracks.size() );
386
387 // fill information about selected tracks in AANT
389
390 //-------------------------------------------------------
391 // Skip the event if the number of selected tracks is more than m_SelTrkMaxCutoff
392 if( m_selectedTracks.size() < 2 ) {
393 ATH_MSG_DEBUG( "execute: Too few (<2) selected reco tracks. Terminated reconstruction." );
395 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
397 return StatusCode::SUCCESS;
398 }
399
400 if( m_selectedTracks.size() > m_SelTrkMaxCutoff ) {
401 ATH_MSG_INFO( "execute: Too many selected reco tracks. Terminated reconstruction." );
403 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
405 return StatusCode::SUCCESS;
406 }
407
408 //-------------------------------------------------------
409 // Core part of Vertexing
410 //
411
412 {
413
415
416 // set of vertices created in the following while loop.
417 std::vector<WrkVrt> workVerticesContainer;
418
419 // the main sequence of the main vertexing algorithms
420 // see initialize() what kind of algorithms exist.
421 for( auto itr = m_vertexingAlgorithms.begin(); itr!=m_vertexingAlgorithms.end(); ++itr ) {
422
423 auto& name = itr->first;
424 auto alg = itr->second;
425
426 auto t_start = std::chrono::system_clock::now();
427
428 ATH_CHECK( (this->*alg)( &workVerticesContainer ) );
429
430 auto t_end = std::chrono::system_clock::now();
431
432 if( m_FillHist ) {
433 auto sec = std::chrono::duration_cast<std::chrono::microseconds>( t_end - t_start ).count();
434 m_hists["CPUTime"]->Fill( m_vertexingAlgorithmStep, sec/1.e6 );
435 }
436
437 std::erase_if( workVerticesContainer,
438 []( WrkVrt& wrkvrt ) {
439 return ( !wrkvrt.isGood || wrkvrt.nTracksTotal() < 2 ); }
440 );
441
442 ATH_CHECK( monitorVertexingAlgorithmStep( &workVerticesContainer, name, std::next( itr ) == m_vertexingAlgorithms.end() ) );
443
445
446 }
447 }
448
450 vertexingStatusDecor(*eventInfo) = m_vertexingStatus;
451
452 // Fill AANT
453 if( m_FillNtuple ) {
454 m_tree_Vert->Fill();
456 }
457
459
460 ATH_MSG_VERBOSE( "execute: process done." );
461 // end
462 return StatusCode::SUCCESS;
463
464 }
465
466 void VrtSecInclusive::lockTrackDecorations( const xAOD::TrackParticle* trk, bool onlySelection ) const {
468 const_cast<SG::AuxVectorData*> (trk->container());
469 cont_nc->lockDecoration (m_decor_isSelected->auxid());
470
471 if (onlySelection) return;
472
473 if (m_decor_isAssociated && m_decor_isAssociated->isAvailable (*cont_nc)) {
474 cont_nc->lockDecoration (m_decor_isAssociated->auxid());
475 }
476 if (m_decor_is_svtrk_final && m_decor_is_svtrk_final->isAvailable (*cont_nc)) {
477 cont_nc->lockDecoration (m_decor_is_svtrk_final->auxid());
478 }
479
480 for (const auto& p : m_trkDecors) {
481 cont_nc->lockDecoration (p.second.auxid());
482 }
483 }
484
487 const_cast<SG::AuxVectorData*> (cont);
488 for (const IPDecoratorType& dec : m_ipDecors) {
489 if (dec.isAvailable (*cont)) {
490 cont_nc->lockDecoration (dec.auxid());
491 }
492 }
493
494 if (m_decor_svLink) {
495 if (m_decor_svLink->isAvailable (*cont)) {
496 cont_nc->lockDecoration (m_decor_svLink->auxid());
497 }
498 }
499 }
500
501 StatusCode VrtSecInclusive::lockTrackDecorations( bool onlySelection ) const
502 {
503 const xAOD::TrackParticleContainer* trackParticleContainer{};
504 ATH_CHECK( evtStore()->retrieve( trackParticleContainer, m_TrackLocation) );
505 for( const xAOD::TrackParticle* trk : *trackParticleContainer ) {
506 lockTrackDecorations( trk, onlySelection );
507 }
508
509 const xAOD::MuonContainer* muons{};
510 ATH_CHECK( evtStore()->retrieve( muons, m_MuonLocation) );
511 if (muons->ownPolicy() != SG::VIEW_ELEMENTS) {
512 lockLeptonDecorations (muons);
513 }
514 for( const xAOD::Muon* muon : *muons ) {
515 if (muons->ownPolicy() == SG::VIEW_ELEMENTS) {
516 lockLeptonDecorations (muon->container());
517 }
518 if ( const xAOD::TrackParticle* trk = muon->trackParticle( xAOD::Muon::InnerDetectorTrackParticle ) ) {
519 lockTrackDecorations( trk, onlySelection );
520 }
521 }
522
523 const xAOD::ElectronContainer *electrons{};
524 ATH_CHECK( evtStore()->retrieve( electrons, m_ElectronLocation ) );
525 if (electrons->ownPolicy() != SG::VIEW_ELEMENTS) {
526 lockLeptonDecorations (electrons);
527 }
528 for( const xAOD::Electron* electron : *electrons ) {
529 if (electrons->ownPolicy() == SG::VIEW_ELEMENTS) {
530 lockLeptonDecorations (electron->container());
531 }
532 if( electron->nTrackParticles() > 0 ) {
533 if (const xAOD::TrackParticle* trk = electron->trackParticle(0)) {
534 lockTrackDecorations( trk, onlySelection );
535 }
536 }
537 }
538
539 const xAOD::TrackParticleContainer* IDtracks{};
540 ATH_CHECK( evtStore()->retrieve( IDtracks, m_TrackLocation) );
541 for( const auto *trk : *IDtracks ) {
542 lockTrackDecorations( trk, onlySelection );
543 }
544
545 return StatusCode::SUCCESS;
546 }
547
548} // end of namespace bracket
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
#define ATH_MSG_INFO(x)
#define ATH_MSG_VERBOSE(x)
#define ATH_MSG_WARNING(x)
#define ATH_MSG_DEBUG(x)
static Double_t sc
Handle class for adding a decoration to an object.
#define ATLAS_THREAD_SAFE
AthAlgorithm(const std::string &name, ISvcLocator *pSvcLocator)
Constructor with parameters:
const ServiceHandle< StoreGateSvc > & detStore() const
SG::OwnershipPolicy ownPolicy() const
Return the ownership policy setting for this container.
const SG::AuxVectorData * container() const
Return the container holding this element.
Manage lookup of vectors of auxiliary data.
void lockDecoration(SG::auxid_t auxid)
Explicitly lock a decoration.
virtual bool isValid() override final
Can the handle be successfully dereferenced?
Property holding a SG store/key/clid/attr name from which a WriteDecorHandle is made.
Handle class for adding a decoration to an object.
Gaudi::Property< bool > m_doSelectIDAndGSFTracks
SG::AuxElement::Decorator< std::vector< std::vector< float > > > IPDecoratorType
StatusCode associateNonSelectedTracks(std::vector< WrkVrt > *)
in addition to selected tracks, associate as much tracks as possible
VrtSecInclusive(const std::string &name, ISvcLocator *pSvcLocator)
Standard Athena-Algorithm Constructor.
std::map< std::string, PatternStrategyFunc > m_patternStrategyFuncs
bool checkTrackHitPatternToVertex(const xAOD::TrackParticle *trk, const Amg::Vector3D &vertex)
A classical method with hard-coded geometry.
bool checkTrackHitPatternToVertexByExtrapolationAssist(const xAOD::TrackParticle *trk, const Amg::Vector3D &vertex)
New method with track extrapolation.
Gaudi::Property< bool > m_doMergeFinalVerticesDistance
bool checkTrackHitPatternToVertexByExtrapolation(const xAOD::TrackParticle *trk, const Amg::Vector3D &vertex)
New method with track extrapolation.
ToolHandle< IInDetConditionsTool > m_pixelCondSummaryTool
Condition service.
StatusCode mergeFinalVertices(std::vector< WrkVrt > *)
attempt to merge vertices by lookng at the distance between two vertices
Gaudi::Property< bool > m_doReassembleVertices
StatusCode refitAndSelectGoodQualityVertices(std::vector< WrkVrt > *)
finalization of the vertex and store to xAOD::VertexContainer
void lockTrackDecorations(const xAOD::TrackParticle *trk, bool onlySelection) const
lock decorations at the end of the algorithm
std::map< unsigned, SG::Decorator< float > > m_trkDecors
void lockLeptonDecorations(const SG::AuxVectorData *cont) const
PublicToolHandle< Trk::IVertexMapper > m_vertexMapper
StatusCode reassembleVertices(std::vector< WrkVrt > *)
attempt to merge vertices when all tracks of a vertex A is close to vertex B in terms of impact param...
Gaudi::Property< unsigned int > m_SelTrkMaxCutoff
Gaudi::Property< bool > m_doMergeByShuffling
std::unique_ptr< NtupleVars > m_ntupleVars
StatusCode rearrangeTracks(std::vector< WrkVrt > *)
ToolHandle< IInDetConditionsTool > m_sctCondSummaryTool
PublicToolHandle< Trk::ITruthToTrack > m_truthToTrack
Gaudi::Property< bool > m_doSelectTracksFromElectrons
StatusCode extractIncompatibleTrackPairs(std::vector< WrkVrt > *)
related to the graph method and verte finding
Gaudi::Property< std::string > m_all2trksVerticesContainerName
Gaudi::Property< bool > m_FillHist
bool checkTrackHitPatternToVertexOuterOnly(const xAOD::TrackParticle *trk, const Amg::Vector3D &vertex)
A classical method with hard-coded geometry.
std::optional< SG::Decorator< char > > m_decor_isSelected
std::map< std::string, TH1 * > m_hists
SG::ReadHandleKey< xAOD::EventInfo > m_eventInfoKey
Read/Write Handle Keys.
Gaudi::Property< std::string > m_secondaryVerticesContainerName
StatusCode findNtrackVertices(std::vector< WrkVrt > *)
StatusCode monitorVertexingAlgorithmStep(std::vector< WrkVrt > *, const std::string &name, bool final=false)
monitor the intermediate status of vertexing
Gaudi::Property< std::string > m_TrackLocation
Gaudi::Property< bool > m_FillNtuple
std::optional< SG::Decorator< char > > m_decor_is_svtrk_final
std::optional< VertexELType > m_decor_svLink
const AtlasDetectorID * m_atlasId
PublicToolHandle< Trk::IExtrapolator > m_extrapolator
Gaudi::Property< std::string > m_MuonLocation
std::vector< IPDecoratorType > m_ipDecors
std::vector< const xAOD::TrackParticle * > m_associatedTracks
PublicToolHandle< Reco::ITrackToVertex > m_trackToVertexTool
get a handle on the Track to Vertex tool
Gaudi::Property< std::string > m_ElectronLocation
ToolHandle< Trk::ITrkVKalVrtFitter > m_fitSvc
std::vector< const xAOD::TrackParticle * > m_selectedTracks
Gaudi::Property< bool > m_doMapToLocal
StatusCode mergeByShuffling(std::vector< WrkVrt > *)
attempt to merge splitted vertices when they are significantly distant due to the long-tail behavior ...
std::vector< std::pair< std::string, vertexingAlg > > m_vertexingAlgorithms
Gaudi::Property< std::string > m_augVerString
~VrtSecInclusive()
Default Destructor.
PublicToolHandle< Trk::ITrackToVertexIPEstimator > m_trackToVertexIPEstimatorTool
SG::WriteDecorHandleKey< xAOD::EventInfo > m_vertexingStatusKey
std::vector< const xAOD::TrackParticle * > m_leptonicTracks
Gaudi::Property< bool > m_doAssociateNonSelectedTracks
Gaudi::Property< bool > m_FillIntermediateVertices
std::optional< SG::Decorator< char > > m_decor_isAssociated
Gaudi::Property< bool > m_doSelectTracksFromMuons
std::vector< TrackSelectionAlg > m_trackSelectionAlgs
@ VIEW_ELEMENTS
this data object is a view, it does not own its elmts
STL namespace.
std::size_t erase_if(T_container &container, T_Func pred)
VertexAuxContainer_v1 VertexAuxContainer
Definition of the current jet auxiliary container.
ElectronContainer_v1 ElectronContainer
Definition of the current "electron container version".
TrackParticle_v1 TrackParticle
Reference the current persistent version:
VertexContainer_v1 VertexContainer
Definition of the current "Vertex container version".
TrackParticleContainer_v1 TrackParticleContainer
Definition of the current "TrackParticle container version".
Muon_v1 Muon
Reference the current persistent version:
MuonContainer_v1 MuonContainer
Definition of the current "Muon container version".
Electron_v1 Electron
Definition of the current "egamma version".