#include <InDetVertexSplitter.h>

Inheritance diagram for InDet::InDetVertexSplitter:

Collaboration diagram for InDet::InDetVertexSplitter:

Public Member Functions
	InDetVertexSplitter (const std::string &name, ISvcLocator *pSvcLocator)
	Author: Peter V.
	~InDetVertexSplitter ()
	Destructor - check up memory allocation delete any memory allocation on the heap.
StatusCode	initialize ()
	Initialize initialize StoreGate.
StatusCode	finalize ()
	Finalize - delete any memory allocation from the heap.
StatusCode	execute ()
	Execute - on event by event.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
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
StatusCode	split_vertices ()
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
std::vector< std::string >	m_trackKeys
bool	m_isMatchedOdd
bool	m_isUnmatchOdd
int	m_addToVxMatched
int	m_addToVxUnmatch
int	m_eventN
std::string	m_vertexContainerName
	containers to retrieve
std::string	m_tpbContainerName
std::string	m_trackContainerName
int	m_maxVtx
bool	m_priOnly
bool	m_savetpb
DataObjIDColl	m_extendedExtraObjects
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 31 of file InDetVertexSplitter.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ InDetVertexSplitter()

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

Author: Peter V.

Loscutoff (plosc.nosp@m.utof.nosp@m.f@gma.nosp@m.il.c.nosp@m.om February 2009 head file Constructor

switches to control the analysis through job options

Definition at line 36 of file InDetVertexSplitter.cxx.

                            : 
  AthAlgorithm(name, pSvcLocator),
  m_isMatchedOdd(false),
  m_isUnmatchOdd(false),
  m_addToVxMatched(0),
  m_addToVxUnmatch(0),
  m_eventN(0){
  declareProperty("TPBContainerName", m_tpbContainerName = "TrackParticleCandidate");
  declareProperty("TrackContainerName", m_trackContainerName = "Tracks");
  declareProperty("VertexContainerName", m_vertexContainerName = "VxPrimaryCandidate");
  declareProperty("MaxVertexNumber", m_maxVtx = 1); //this should not be changed until a more robust handling of multi vertices is implemented
  declareProperty("PrimaryOnly",m_priOnly = true);  //this should not be changed presently
  declareProperty("UseTrackParticleBase",m_savetpb = true); //is this needed?
}

◆ ~InDetVertexSplitter()

InDet::InDetVertexSplitter::~InDetVertexSplitter ( )

default

Destructor - check up memory allocation delete any memory allocation on the heap.

Member Function Documentation

◆ declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< 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< 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< Algorithm > >::detStore ( ) const

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

95{ return m_detStore; }

AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

◆ evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

85{ return m_evtStore; }

AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

StatusCode InDet::InDetVertexSplitter::execute ( )

Execute - on event by event.

Definition at line 103 of file InDetVertexSplitter.cxx.

                                             {
 
  ATH_MSG_DEBUG("in execute()");
 
  StatusCode sc = StatusCode::SUCCESS;
 
  sc = split_vertices();
  if (sc.isFailure()) {
     ATH_MSG_ERROR("InDetVertexSplitter Failed");
     return sc;
  }
 
  return sc;
}

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< 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 & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 50 of file AthAlgorithm.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 Algorithm::extraOutputDeps();
}

◆ finalize()

StatusCode InDet::InDetVertexSplitter::finalize ( )

Finalize - delete any memory allocation from the heap.

Definition at line 93 of file InDetVertexSplitter.cxx.

                                              {
  ATH_MSG_DEBUG("in finalize()");
  
  return StatusCode::SUCCESS;
 
}

◆ initialize()

StatusCode InDet::InDetVertexSplitter::initialize ( )

Initialize initialize StoreGate.

Definition at line 64 of file InDetVertexSplitter.cxx.

                                                {
 
  m_isMatchedOdd = false;
  m_isUnmatchOdd = false;
  m_addToVxMatched = 1;
  m_addToVxUnmatch = 1;
  m_eventN = 0;
  std::stringstream ss;
  for (int i = 1; i <=m_maxVtx; i++){
    ss.str("");
    ss << "odd_" << i << "_Tracks";
    m_trackKeys.push_back(ss.str());
    ss.str("");
    ss << "even_" << i << "_Tracks";
    m_trackKeys.push_back(ss.str()); 
    ss.str("");
    ss << "all_" << i << "_Tracks";
    m_trackKeys.push_back(ss.str());
    ss.str("");
  }
 
  ATH_MSG_INFO ("Initializing InDetVertexSplitter");
  
  return StatusCode::SUCCESS;
}    

◆ inputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< 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.

◆ msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

◆ msgLvl()

bool AthCommonMsg< 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< 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< Algorithm > >::renounce ( T & h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

◆ split_vertices()

StatusCode InDet::InDetVertexSplitter::split_vertices ( )

private

Definition at line 120 of file InDetVertexSplitter.cxx.

                                                    {
 
  ATH_MSG_DEBUG("in split_vertices()");
 
  StatusCode sc = StatusCode::SUCCESS;
 
  const VxContainer* vtxTES=nullptr;
  sc=evtStore()->retrieve( vtxTES, m_vertexContainerName);
  if( sc.isFailure()  ||  !vtxTES ) {
    ATH_MSG_WARNING("No VxContainer container found in TDS tried " << m_vertexContainerName);
    return StatusCode::SUCCESS;
  }  
 
  ATH_MSG_DEBUG("Vertex successfully retrieved");
 
  const Rec::TrackParticleContainer* tpbTES=nullptr;
  const TrackCollection* trkTES=nullptr;
 
  if (m_savetpb){
    sc=evtStore()->retrieve( tpbTES, m_tpbContainerName);
    if( sc.isFailure()  ||  !tpbTES ) {
      ATH_MSG_WARNING("No TrackParticleBase container found in TDS tried " << m_tpbContainerName);
      return StatusCode::SUCCESS;
    }  
    ATH_MSG_DEBUG("TrackParticleCandidate Collection successfully retrieved");
  }
  else {
    sc=evtStore()->retrieve( trkTES, m_trackContainerName);
    if( sc.isFailure()  ||  !trkTES ) {
      ATH_MSG_WARNING("No TrackCollection container found in TDS tried " << m_trackContainerName);
      return StatusCode::SUCCESS;
    }  
    ATH_MSG_DEBUG("TrackParticleCandidate Collection successfully retrieved");
  }  
 
  std::map<std::string,TrackCollection*> trackmap;
  std::map<std::string,Trk::TrackParticleBaseCollection*> tpbmap;
 
//  We need to create every container for each event, even if we don't write to them
 
  for (const auto & thisKey : m_trackKeys){
    TrackCollection* tempTracks = nullptr;
    trackmap[thisKey] = tempTracks;
    if (evtStore()->contains<TrackCollection>(thisKey) && (evtStore()->retrieve(trackmap[thisKey],thisKey)).isSuccess()){
      //nop
    } else {
      trackmap[thisKey] = new TrackCollection;
    }
  }  
 
  for (const auto & thisKey : m_trackKeys){
    Trk::TrackParticleBaseCollection* tempTpbs = nullptr;
    tpbmap[thisKey] = tempTpbs;
    if (evtStore()->contains<Trk::TrackParticleBaseCollection>(thisKey) &&
  (evtStore()->retrieve(tpbmap[thisKey],thisKey)).isSuccess()){
    } else {
      tpbmap[thisKey] = new Trk::TrackParticleBaseCollection;
    }
  }  
 
  if (m_savetpb and tpbTES){
    //we loop over that list
    for (const Rec::TrackParticle* tpb: *tpbTES){
      const Trk::TrackParameters* trkPerigee = &(tpb->definingParameters());
      bool trackmatched = false;
      //we compare it to the tracks already associated with vertices
            
      ATH_MSG_DEBUG("Found "<<vtxTES->size()<<" vertices");  
      
      int i_vtx = 0;
      //  We're relying here on the implicit sorting of vertices by sqrt(N_tracks)*Sum Pt_track^2
      //  This should pick out the most interesting N vertices
      //  Hopefully we have only 1 primary vertex, but if there is > 1 we can grab all of those too
      std::stringstream sss;
      std::string oeNameString;
      oeNameString.reserve(20);
      for (const Trk::VxCandidate* vtx : *vtxTES){
        if ( (!m_priOnly || vtx->vertexType() == 1) && (i_vtx < m_maxVtx) ){
          i_vtx++;
          const std::vector<Trk::VxTrackAtVertex*> & vertexTracks = *vtx->vxTrackAtVertex();
          ATH_MSG_DEBUG("parent vertex has "<<vertexTracks.size()<<" tracks, at position: "<<vtx->recVertex().position().x());
          std::vector<Trk::VxTrackAtVertex*>::const_iterator tavI = vertexTracks.begin();
          std::vector<Trk::VxTrackAtVertex*>::const_iterator tavIe= vertexTracks.end();
          for (; tavI != tavIe; ++tavI){
            const Trk::TrackParameters* vxTrkPerigee = (*tavI)->initialPerigee();
            if (trkPerigee == vxTrkPerigee) {trackmatched = true;}
          }
          Trk::TrackParticleBase *trkCopy1 = new Trk::TrackParticleBase((*tpb));
          Trk::TrackParticleBase *trkCopy2 = new Trk::TrackParticleBase((*tpb));
          if (!trackmatched){
            oeNameString.clear();
            if (m_isUnmatchOdd)  oeNameString = "odd";
            if (!m_isUnmatchOdd) oeNameString = "even";
            sss.str("");
            sss << oeNameString << "_" << m_addToVxUnmatch << "_Tracks";
            std::string oecontainerName = sss.str();          
            std::string allNameString = "all";
            sss.str("");
            sss << allNameString << "_" << m_addToVxUnmatch << "_Tracks";
            std::string allcontainerName = sss.str();  
            ATH_MSG_DEBUG("found an unmatched trackparticlebase, giving it the key: "<< oecontainerName); 
            tpbmap[oecontainerName]->push_back(trkCopy1);
            ATH_MSG_DEBUG("found an unmatched trackparticlebase, giving it the key: "<< allcontainerName);  
            tpbmap[allcontainerName]->push_back(trkCopy2);  
            m_isUnmatchOdd = !m_isUnmatchOdd;
            m_addToVxUnmatch++;
            if (m_addToVxUnmatch > m_maxVtx) m_addToVxUnmatch = 1;
          }
          if (trackmatched){
            oeNameString.clear();
            if (m_isMatchedOdd)  oeNameString = "odd";
            if (!m_isMatchedOdd) oeNameString = "even";
            sss.str("");
            sss << oeNameString << "_" << m_addToVxMatched << "_Tracks";
            std::string oecontainerName = sss.str();          
            std::string allNameString = "all";
            sss.str("");
            sss << allNameString << "_" << m_addToVxMatched << "_Tracks";
            std::string allcontainerName = sss.str();  
            ATH_MSG_DEBUG("found a matched trackparticlebase, giving it the key: "<< oecontainerName); 
            tpbmap[oecontainerName]->push_back(trkCopy1);
            ATH_MSG_DEBUG("found a matched trackparticlebase, giving it the key: "<< allcontainerName);  
            tpbmap[allcontainerName]->push_back(trkCopy2);  
            m_isMatchedOdd = !m_isMatchedOdd;
            m_addToVxMatched++;
            if (m_addToVxMatched > m_maxVtx) m_addToVxMatched = 1;
          }
        }
      }
    }
  }
  if (!m_savetpb and trkTES){
    TrackCollection::const_iterator trkItr = trkTES->begin();
    TrackCollection::const_iterator trkItrE = trkTES->end();
    //we loop over that list
    for (; trkItr != trkItrE; ++trkItr){
      const Trk::Perigee* trkPerigee = (*trkItr)->perigeeParameters();
      bool trackmatched = false;
      //we compare it to the tracks already associated with vertices
      
      VxContainer::const_iterator vtxItr  = vtxTES->begin();
      VxContainer::const_iterator vtxItrE = vtxTES->end();  
      
      ATH_MSG_DEBUG("Found "<<vtxTES->size()<<" vertices");  
      
      int i_vtx = 0;
      //  We're relying here on the implicit sorting of vertices by sqrt(N_tracks)*Sum Pt_track^2
      //  This should pick out the most interesting N vertices
      //  Hopefully we have only 1 primary vertex, but if there is > 1 we can grab all of those too
      std::stringstream sss;
      std::string oeNameString;
      oeNameString.reserve(20);
      for (; vtxItr != vtxItrE; ++vtxItr){
        if ( (!m_priOnly || (*vtxItr)->vertexType() == 1) && (i_vtx < m_maxVtx) ){
          i_vtx++;
          const std::vector<Trk::VxTrackAtVertex*> & vertexTracks = (*(*vtxItr)->vxTrackAtVertex());
          ATH_MSG_DEBUG("parent vertex has "<<vertexTracks.size()<<" tracks, at position: "<<(*vtxItr)->recVertex().position().x());
          std::vector<Trk::VxTrackAtVertex*>::const_iterator tavI = vertexTracks.begin();
          std::vector<Trk::VxTrackAtVertex*>::const_iterator tavIe= vertexTracks.end();
          for (; tavI != tavIe; ++tavI){
            const Trk::TrackParameters* vxTrkPerigee = (*tavI)->initialPerigee();
            if (trkPerigee == vxTrkPerigee) {trackmatched = true;}
          }
          Trk::Track *trkCopy1 = new Trk::Track((*(*trkItr)));
          Trk::Track *trkCopy2 = new Trk::Track((*(*trkItr)));
          if (!trackmatched){
            oeNameString.clear();
            if (m_isUnmatchOdd)  oeNameString = "odd";
            if (!m_isUnmatchOdd) oeNameString = "even";
            sss.str("");
            sss << oeNameString << "_" << m_addToVxUnmatch << "_Tracks";
            std::string oecontainerName = sss.str();          
            std::string allNameString = "all";
            sss.str("");
            sss << allNameString << "_" << m_addToVxUnmatch << "_Tracks";
            std::string allcontainerName = sss.str();  
            ATH_MSG_DEBUG("found an unmatched track, giving it the key: "<< oecontainerName); 
            trackmap[oecontainerName]->push_back(trkCopy1);
            ATH_MSG_DEBUG("found an unmatched track, giving it the key: "<< allcontainerName);  
            trackmap[allcontainerName]->push_back(trkCopy2);  
            m_isUnmatchOdd = !m_isUnmatchOdd;
            m_addToVxUnmatch++;
            if (m_addToVxUnmatch > m_maxVtx) m_addToVxUnmatch = 1;
          }
          if (trackmatched){
            oeNameString.clear();
            if (m_isMatchedOdd)  oeNameString = "odd";
            if (!m_isMatchedOdd) oeNameString = "even";
            sss.str("");
            sss << oeNameString << "_" << m_addToVxMatched << "_Tracks";
            std::string oecontainerName = sss.str();          
            std::string allNameString = "all";
            sss.str("");
            sss << allNameString << "_" << m_addToVxMatched << "_Tracks";
            std::string allcontainerName = sss.str();  
            ATH_MSG_DEBUG("found a matched track, giving it the key: "<< oecontainerName); 
            trackmap[oecontainerName]->push_back(trkCopy1);
            ATH_MSG_DEBUG("found a matched track, giving it the key: "<< allcontainerName);  
            trackmap[allcontainerName]->push_back(trkCopy2);  
            m_isMatchedOdd = !m_isMatchedOdd;
            m_addToVxMatched++;
            if (m_addToVxMatched > m_maxVtx) m_addToVxMatched = 1;
          }
        }
      }
    }
  }
  if (m_savetpb){
    for (const auto & key: m_trackKeys){
      if(evtStore()->record(tpbmap[key],key,false).isFailure() ){
        ATH_MSG_ERROR("Could not save the "<< key);
      }
    }
  } else {
    for (const auto & key: m_trackKeys){
      if(evtStore()->record(trackmap[key],key,false).isFailure() ){
        ATH_MSG_ERROR("Could not save the "<< key);
      }
    }
  }
  ATH_MSG_DEBUG("split_vertices() succeeded");
  m_eventN++;
  return StatusCode::SUCCESS;
}

◆ sysInitialize()

StatusCode AthAlgorithm::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< Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, and PyAthena::Alg.

Definition at line 66 of file AthAlgorithm.cxx.

                                       {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<Algorithm>>::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< 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< 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_addToVxMatched

int InDet::InDetVertexSplitter::m_addToVxMatched

private

Definition at line 48 of file InDetVertexSplitter.h.

◆ m_addToVxUnmatch

int InDet::InDetVertexSplitter::m_addToVxUnmatch

private

Definition at line 49 of file InDetVertexSplitter.h.

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_eventN

int InDet::InDetVertexSplitter::m_eventN

private

Definition at line 50 of file InDetVertexSplitter.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 79 of file AthAlgorithm.h.

◆ m_isMatchedOdd

bool InDet::InDetVertexSplitter::m_isMatchedOdd

private

Definition at line 46 of file InDetVertexSplitter.h.

◆ m_isUnmatchOdd

bool InDet::InDetVertexSplitter::m_isUnmatchOdd

private

Definition at line 47 of file InDetVertexSplitter.h.

◆ m_maxVtx

int InDet::InDetVertexSplitter::m_maxVtx

private

Definition at line 58 of file InDetVertexSplitter.h.

◆ m_priOnly

bool InDet::InDetVertexSplitter::m_priOnly

private

Definition at line 59 of file InDetVertexSplitter.h.

◆ m_savetpb

bool InDet::InDetVertexSplitter::m_savetpb

private

Definition at line 60 of file InDetVertexSplitter.h.

◆ m_tpbContainerName

std::string InDet::InDetVertexSplitter::m_tpbContainerName

private

Definition at line 56 of file InDetVertexSplitter.h.

◆ m_trackContainerName

std::string InDet::InDetVertexSplitter::m_trackContainerName

private

Definition at line 57 of file InDetVertexSplitter.h.

◆ m_trackKeys

std::vector<std::string> InDet::InDetVertexSplitter::m_trackKeys

private

Definition at line 44 of file InDetVertexSplitter.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vertexContainerName

std::string InDet::InDetVertexSplitter::m_vertexContainerName

private

containers to retrieve

Definition at line 55 of file InDetVertexSplitter.h.

◆ m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

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

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ InDetVertexSplitter()

◆ ~InDetVertexSplitter()

Member Function Documentation

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ split_vertices()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_addToVxMatched

◆ m_addToVxUnmatch

◆ m_detStore

◆ m_eventN

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_isMatchedOdd

◆ m_isUnmatchOdd

◆ m_maxVtx

◆ m_priOnly

◆ m_savetpb

◆ m_tpbContainerName

◆ m_trackContainerName

◆ m_trackKeys

◆ m_varHandleArraysDeclared

◆ m_vertexContainerName

◆ m_vhka