InDet::InDetPriVxFinder Class Reference

#include <InDetPriVxFinder.h>

Inheritance diagram for InDet::InDetPriVxFinder:

Collaboration diagram for InDet::InDetPriVxFinder:

Public Member Functions
	InDetPriVxFinder (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~InDetPriVxFinder ()=default
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) const override
virtual StatusCode	finalize () override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
virtual bool	filterPassed (const EventContext &ctx) const
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
void	monitor_vertex (const std::string &prefix, const xAOD::Vertex &vertex) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadHandleKey< TrackCollection >	m_trkTracksName {this,"TrkTracksName","Tracks","Trk::Track Collection used in Vertexing"}
SG::ReadHandleKey< xAOD::TrackParticleContainer >	m_tracksName {this,"TracksName","InDetTrackParticles","xAOD::TrackParticle Collection used in Vertexing"}
SG::WriteHandleKey< xAOD::VertexContainer >	m_vxCandidatesOutputName {this,"VxCandidatesOutputName","PrimaryVertices","Output Vertex Collection"}
ToolHandle< IVertexFinder >	m_VertexFinderTool {this, "VertexFinderTool", "", "Primary vertex finder tool"}
ToolHandle< Trk::IVertexMergingTool >	m_VertexMergingTool {this, "VertexMergingTool", "", "Vertex merging tool"}
ToolHandle< Trk::IVertexCollectionSortingTool >	m_VertexCollectionSortingTool {this, "VertexCollectionSortingTool", "", "Vertex collection sorting tool"}
ToolHandle< GenericMonitoringTool >	m_monTool {this, "PriVxMonTool", "", "Monitoring tool"}
BooleanProperty	m_doVertexMerging {this, "doVertexMerging", false, "Do vertex merging"}
BooleanProperty	m_doVertexSorting {this, "doVertexSorting", false, "Do vertex sorting"}
BooleanProperty	m_useTrackParticles {this, "useTrackParticles", true, "Use track particles as input"}
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

Definition at line 43 of file InDetPriVxFinder.h.

Member Typedef Documentation

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::StoreGateSvc_t

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

InDetPriVxFinder()

InDet::InDetPriVxFinder::InDetPriVxFinder	(	const std::string &	name,
		ISvcLocator *	pSvcLocator )

Definition at line 25 of file InDetPriVxFinder.cxx.

                                                  : AthReentrantAlgorithm(name, pSvcLocator)
 { }

~InDetPriVxFinder()

virtual InDet::InDetPriVxFinder::~InDetPriVxFinder ( )

virtualdefault

Member Function Documentation

cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t )

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::detStore ( ) const

inlineinherited

The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode InDet::InDetPriVxFinder::execute ( const EventContext & ctx ) const

overridevirtual

Definition at line 75 of file InDetPriVxFinder.cxx.

  {
 
    SG::WriteHandle<xAOD::VertexContainer> outputVertices (m_vxCandidatesOutputName, ctx);
 
    xAOD::VertexContainer*    vertexContainer = nullptr;
    xAOD::VertexAuxContainer* vertexAuxContainer = nullptr;
    auto vertexContainerPair = std::make_pair(vertexContainer, vertexAuxContainer);
 
    if (m_useTrackParticles) {
      SG::ReadHandle<xAOD::TrackParticleContainer> trackParticleCollection(m_tracksName, ctx);
      if (trackParticleCollection.isValid()) {
        vertexContainerPair = m_VertexFinderTool->findVertex(ctx, trackParticleCollection.cptr());
      } else {
        ATH_MSG_ERROR("No TrackParticle Collection with key "
                      << m_tracksName.key()
                      << " exists in StoreGate. No Vertexing Possible");
        return StatusCode::FAILURE;
      }
    } else {
      SG::ReadHandle<TrackCollection> trackCollection(m_trkTracksName, ctx);
      if (trackCollection.isValid()) {
        vertexContainerPair = m_VertexFinderTool->findVertex(ctx, trackCollection.cptr());
      } else {
        ATH_MSG_ERROR("No Trk::Track Collection with key "
                      << m_trkTracksName.key()
                      << " exists in StoreGate. No Vertexing Possible");
        return StatusCode::FAILURE;
      }
    }
 
    // now  re-merge and resort the vertex container and store to SG
    std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer* > myVertexContainerPair{nullptr, nullptr};
    auto deletePair = [](std::pair<xAOD::VertexContainer*, xAOD::VertexAuxContainer*  > &p){
      delete p.first; p.first = nullptr;
      delete p.second; p.second = nullptr;
    };
 
    if (vertexContainerPair.first) {
      //sort xAOD::Vertex container
      if(m_doVertexMerging && vertexContainerPair.first->size() > 1) {
        myVertexContainerPair = m_VertexMergingTool->mergeVertexContainer( *vertexContainerPair.first );
        deletePair(vertexContainerPair); //also cleans up the aux store
        vertexContainerPair = myVertexContainerPair;
      }
 
      if (m_doVertexSorting) {
        myVertexContainerPair = m_VertexCollectionSortingTool->sortVertexContainer(*vertexContainerPair.first);
        deletePair(vertexContainerPair);
      }
 
      if (myVertexContainerPair.first == nullptr) {
        ATH_MSG_ERROR("Vertex container has no associated store.");
        return StatusCode::FAILURE;
      }
 
      if (not myVertexContainerPair.first->hasStore()) {
        ATH_MSG_ERROR("Vertex container has no associated store.");
        return StatusCode::FAILURE;
      }
      ATH_MSG_DEBUG("Successfully reconstructed "
                    << myVertexContainerPair.first->size() - 1
                    << " vertices (excluding dummy)");
    }
 
    ATH_CHECK(outputVertices.record(
        std::unique_ptr<xAOD::VertexContainer>(myVertexContainerPair.first),
        std::unique_ptr<xAOD::VertexAuxContainer>(myVertexContainerPair.second)));
 
    auto NVertices = Monitored::Scalar<int>( "NVertices" , 0 );
    for ( xAOD::VertexContainer::iterator vertexIter = myVertexContainerPair.first->begin();
          vertexIter != myVertexContainerPair.first->end(); ++vertexIter ) {
        if((*vertexIter)->nTrackParticles() > 0 and (*vertexIter)->vertexType() != 0 ){
            NVertices++;
            monitor_vertex( "allVertex", **vertexIter);
            //This expects that vertices are already sorted by SumpT(or different criteria)!!!
            if( vertexIter == myVertexContainerPair.first->begin() ) monitor_vertex( "primVertex", **vertexIter);
        }
    }
    auto mon = Monitored::Group( m_monTool, NVertices);
 
    return StatusCode::SUCCESS;
  }

extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps )

protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

extraOutputDeps()

const DataObjIDColl & AthCommonReentrantAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 94 of file AthCommonReentrantAlgorithm.cxx.

{
  // If we didn't find any symlinks to add, just return the collection
  // from the base class.  Otherwise, return the extended collection.
  if (!m_extendedExtraObjects.empty()) {
    return m_extendedExtraObjects;
  }
  return BaseAlg::extraOutputDeps();
}

filterPassed()

virtual bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

                                                           {
    return execState( ctx ).filterPassed();
  }

finalize()

StatusCode InDet::InDetPriVxFinder::finalize ( )

overridevirtual

Definition at line 159 of file InDetPriVxFinder.cxx.

  {
    return StatusCode::SUCCESS;
  }

initialize()

StatusCode InDet::InDetPriVxFinder::initialize ( )

overridevirtual

Definition at line 30 of file InDetPriVxFinder.cxx.

  {
    /* Get the VertexFinderTool */
    if ( m_VertexFinderTool.retrieve().isFailure() )
    {
      ATH_MSG_FATAL("Failed to retrieve tool " << m_VertexFinderTool);
      return StatusCode::FAILURE;
    }
    ATH_MSG_DEBUG("Retrieved tool " << m_VertexFinderTool);
 
    /*Get the Vertex Merging Tool*/
    if (m_doVertexMerging) {
      if ( m_VertexMergingTool.retrieve().isFailure() )
      {
        ATH_MSG_FATAL("Failed to retrieve tool " << m_VertexMergingTool);
        return StatusCode::FAILURE;
      }
      ATH_MSG_DEBUG("Retrieved tool " << m_VertexMergingTool);
    } else {
      m_VertexMergingTool.disable();
    }
 
    /*Get the Vertex Collection Sorting Tool*/
    if (m_doVertexSorting) {
      if ( m_VertexCollectionSortingTool.retrieve().isFailure() )
      {
        ATH_MSG_FATAL("Failed to retrieve tool " << m_VertexCollectionSortingTool);
        return StatusCode::FAILURE;
      }
      else
      {
        ATH_MSG_VERBOSE("Retrieved tool " << m_VertexCollectionSortingTool);
      }
    } else {
      m_VertexCollectionSortingTool.disable();
    }
    if (!m_monTool.empty()) CHECK(m_monTool.retrieve());
 
    ATH_CHECK(m_trkTracksName.initialize(!m_useTrackParticles));
    ATH_CHECK(m_tracksName.initialize(m_useTrackParticles));
    ATH_CHECK(m_vxCandidatesOutputName.initialize());
    return StatusCode::SUCCESS;
  }

inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::inputHandles ( ) const

overridevirtualinherited

Return this algorithm's input handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

isClonable()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

{
  // Reentrant algorithms are clonable.
  return true;
}

monitor_vertex()

void InDet::InDetPriVxFinder::monitor_vertex ( const std::string & prefix, const xAOD::Vertex & vertex ) const

private

Definition at line 164 of file InDetPriVxFinder.cxx.

                                                                                                 {
     if (prefix == "allVertex"){
         auto x        = Monitored::Scalar<double>( "allVertexX",       vertex.x()               );
         auto y        = Monitored::Scalar<double>( "allVertexY",       vertex.y()               );
         auto z        = Monitored::Scalar<double>( "allVertexZ",       vertex.z()               );
         auto chi2     = Monitored::Scalar<double>( "allVertexChi2",    vertex.chiSquared()      );
         auto nDoF     = Monitored::Scalar<double>( "allVertexnDoF",    vertex.numberDoF()       );
         auto NTracks  = Monitored::Scalar<int>   ( "allVertexNTracks", vertex.nTrackParticles() );
         auto mon = Monitored::Group(m_monTool,  x, y, z, chi2, nDoF, NTracks );
     }
     else if (prefix == "primVertex"){
         auto x        = Monitored::Scalar<double>( "primVertexX",       vertex.x()               );
         auto y        = Monitored::Scalar<double>( "primVertexY",       vertex.y()               );
         auto z        = Monitored::Scalar<double>( "primVertexZ",       vertex.z()               );
         auto chi2     = Monitored::Scalar<double>( "primVertexChi2",    vertex.chiSquared()      );
         auto nDoF     = Monitored::Scalar<double>( "primVertexnDoF",    vertex.numberDoF()       );
         auto NTracks  = Monitored::Scalar<int>   ( "primVertexNTracks", vertex.nTrackParticles() );
         auto mon = Monitored::Group(m_monTool,  x, y, z, chi2, nDoF, NTracks );
     }
  }

msg()

MsgStream & AthCommonMsg< Gaudi::Algorithm >::msg ( ) const

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

bool AthCommonMsg< Gaudi::Algorithm >::msgLvl ( const MSG::Level lvl ) const

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

We override this to include handle instances from key arrays if they have not yet been declared. See comments on updateVHKA.

renounce()

std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void > AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

  {
    h.renounce();
    PBASE::renounce (h);
  }

renounceArray()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray )

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

virtual void AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state, const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

                                                                            {
    execState( ctx ).setFilterPassed( state );
  }

sysExecute()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonReentrantAlgorithm< Gaudi::Algorithm >::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

Reimplemented in HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.cxx.

                                                               {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }      
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;  
}

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

updateVHKA()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::updateVHKA ( Gaudi::Details::PropertyBase & )

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

                                               {
    // debug() << "updateVHKA for property " << p.name() << " " << p.toString() 
    //         << "  size: " << m_vhka.size() << endmsg;
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_doVertexMerging

BooleanProperty InDet::InDetPriVxFinder::m_doVertexMerging {this, "doVertexMerging", false, "Do vertex merging"}

private

Definition at line 69 of file InDetPriVxFinder.h.

{this, "doVertexMerging", false, "Do vertex merging"};

m_doVertexSorting

BooleanProperty InDet::InDetPriVxFinder::m_doVertexSorting {this, "doVertexSorting", false, "Do vertex sorting"}

private

Definition at line 70 of file InDetPriVxFinder.h.

{this, "doVertexSorting", false, "Do vertex sorting"};

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

m_monTool

ToolHandle<GenericMonitoringTool> InDet::InDetPriVxFinder::m_monTool {this, "PriVxMonTool", "", "Monitoring tool"}

private

Definition at line 67 of file InDetPriVxFinder.h.

{this, "PriVxMonTool", "", "Monitoring tool"};

m_tracksName

SG::ReadHandleKey<xAOD::TrackParticleContainer> InDet::InDetPriVxFinder::m_tracksName {this,"TracksName","InDetTrackParticles","xAOD::TrackParticle Collection used in Vertexing"}

private

Definition at line 61 of file InDetPriVxFinder.h.

{this,"TracksName","InDetTrackParticles","xAOD::TrackParticle Collection used in Vertexing"};

m_trkTracksName

SG::ReadHandleKey<TrackCollection> InDet::InDetPriVxFinder::m_trkTracksName {this,"TrkTracksName","Tracks","Trk::Track Collection used in Vertexing"}

private

Definition at line 60 of file InDetPriVxFinder.h.

{this,"TrkTracksName","Tracks","Trk::Track Collection used in Vertexing"};

m_useTrackParticles

BooleanProperty InDet::InDetPriVxFinder::m_useTrackParticles {this, "useTrackParticles", true, "Use track particles as input"}

private

Definition at line 71 of file InDetPriVxFinder.h.

{this, "useTrackParticles", true, "Use track particles as input"};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_VertexCollectionSortingTool

ToolHandle<Trk::IVertexCollectionSortingTool > InDet::InDetPriVxFinder::m_VertexCollectionSortingTool {this, "VertexCollectionSortingTool", "", "Vertex collection sorting tool"}

private

Definition at line 66 of file InDetPriVxFinder.h.

{this, "VertexCollectionSortingTool", "", "Vertex collection sorting tool"};

m_VertexFinderTool

ToolHandle< IVertexFinder > InDet::InDetPriVxFinder::m_VertexFinderTool {this, "VertexFinderTool", "", "Primary vertex finder tool"}

private

Definition at line 64 of file InDetPriVxFinder.h.

{this, "VertexFinderTool", "", "Primary vertex finder tool"};

m_VertexMergingTool

ToolHandle<Trk::IVertexMergingTool > InDet::InDetPriVxFinder::m_VertexMergingTool {this, "VertexMergingTool", "", "Vertex merging tool"}

private

Definition at line 65 of file InDetPriVxFinder.h.

{this, "VertexMergingTool", "", "Vertex merging tool"};

m_vhka

std::vector<SG::VarHandleKeyArray*> AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_vhka

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

m_vxCandidatesOutputName

SG::WriteHandleKey<xAOD::VertexContainer> InDet::InDetPriVxFinder::m_vxCandidatesOutputName {this,"VxCandidatesOutputName","PrimaryVertices","Output Vertex Collection"}

private

Definition at line 62 of file InDetPriVxFinder.h.

{this,"VxCandidatesOutputName","PrimaryVertices","Output Vertex Collection"};

---

The documentation for this class was generated from the following files:

• InDetPriVxFinder.h
• InDetPriVxFinder.cxx