Trk::MappingTest Class Reference

Test to build the TrackingGeometry and try to map all points to layers. More...

#include <MappingTest.h>

Inheritance diagram for Trk::MappingTest:

Collaboration diagram for Trk::MappingTest:

Public Member Functions
StatusCode	runTest ()
StatusCode	initializeTest ()
StatusCode	bookTree ()
StatusCode	initialize ()
	standard Athena-Algorithm method
StatusCode	execute (const EventContext &ctx)
	standard Athena-Algorithm method
StatusCode	finalize ()
	standard Athena-Algorithm method
	AthAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
	Standard Athena-Algorithm Constructor.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
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
	Get filter decision:
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
	Set filter decision:
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
virtual bool	isReEntrant () const override final
	Legacy algorithms are not thread-safe.
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.

Protected Attributes
Rndm::Numbers *	m_gaussDist = nullptr
	Random Number setup.
Rndm::Numbers *	m_flatDist = nullptr
Gaudi::Property< size_t >	m_numTests {this, "NumberOfTestsPerEvent", 100}
	number of tests

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
bool	m_executed = false
	Make sure it only runs once.
ServiceHandle< Trk::ITrackingGeometrySvc >	m_trackingGeometrySvc
const TrackingGeometry *	m_trackingGeometry = nullptr
	The TrackingGeometry to be retrieved.
std::string	m_trackingGeometryName = "AtlasTrackingGeometry"
	The Name of the TrackingGeometry.
Gaudi::Property< double >	m_etaCutOff {this, "EtaCutOff", 6.0, "do not map beyond this point"}
Gaudi::Property< std::string >	m_mappingVolumeName
Gaudi::Property< std::string >	m_mappingTreeName {this, "MappingTreeName", "LayerMappingTest"}
Gaudi::Property< std::string >	m_mappingTreeDescription {this, "MappingTreeDescription", "Test Algorithm for Layer - 3D point association"}
TTree *	m_mappingTree = nullptr
float	m_mappingPositionX {}
float	m_mappingPositionY {}
float	m_mappingPositionZ {}
float	m_mappingPositionR {}
float	m_assignedPositionX {}
float	m_assignedPositionY {}
float	m_assignedPositionZ {}
float	m_assignedPositionR {}
float	m_assignedCorrection {}
int	m_assignedLayerIndex {}
float	m_assignmentDistance {}
TTree *	m_unmappedTree = nullptr
float	m_unmappedPositionX {}
float	m_unmappedPositionY {}
float	m_unmappedPositionZ {}
float	m_unmappedPositionR {}
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

Test to build the TrackingGeometry and try to map all points to layers.

Author

Andre.nosp@m.as.S.nosp@m.alzbu.nosp@m.rger.nosp@m.@cern.nosp@m..ch

Definition at line 33 of file MappingTest.h.

Member Typedef Documentation

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Function Documentation

AthAlgorithm()

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

inherited

Standard Athena-Algorithm Constructor.

Definition at line 31 of file AthAlgorithm.cxx.

                                                       :
  AthCommonAlgorithm<Gaudi::Algorithm>( name, pSvcLocator )
{
  // default cardinality for non-reentrant algorithms
  setProperty( "Cardinality", 1 ).orThrow("Unable to set property 'Cardinality'", name);
}

bookTree()

StatusCode Trk::MappingTest::bookTree ( )

virtual

Reimplemented from Trk::TrkDetDescrUnitTestBase.

Definition at line 38 of file MappingTest.cxx.

{
    ATH_MSG_VERBOSE("Booking the Material Tree.");
    
    // ------------------------------> OUTPUT NTUPLE (geometry validation)
    
    m_mappingTree = new TTree(m_mappingTreeName.value().c_str(),
                  m_mappingTreeDescription.value().c_str());
    // add the Branches
    m_mappingTree->Branch("ValPosX",  &m_mappingPositionX, "valpx/F");
    m_mappingTree->Branch("ValPosY",  &m_mappingPositionY, "valpy/F");
    m_mappingTree->Branch("ValPosZ",  &m_mappingPositionZ, "valpz/F");
    m_mappingTree->Branch("ValPosR",  &m_mappingPositionR, "valpr/F");
    
    // add the Branches for the association objects
    m_mappingTree->Branch("AssocPosX",     &m_assignedPositionX,  "asspx/F");
    m_mappingTree->Branch("AssocPosY",     &m_assignedPositionY,  "asspy/F");
    m_mappingTree->Branch("AssocPosZ",     &m_assignedPositionZ,  "asspz/F");
    m_mappingTree->Branch("AssocPosR",     &m_assignedPositionR,  "asspr/F");
    m_mappingTree->Branch("AssocCorr",     &m_assignedCorrection, "asscor/F");   
    m_mappingTree->Branch("AssocLayer",    &m_assignedLayerIndex, "assidx/I");
    m_mappingTree->Branch("AssocDistance", &m_assignmentDistance, "asignd/F");
    
    // ------------------------------> OUTPUT NTUPLE (unmapped hits)
    m_unmappedTree = new TTree("UnmappedHits", "Unmapped Hits of the MappingTest Algorithm");
    // add the Branches
    m_unmappedTree->Branch("UnmappedHitX", &m_unmappedPositionX, "unmappedx/F");
    m_unmappedTree->Branch("UnmappedHitY", &m_unmappedPositionY, "unmappedy/F");
    m_unmappedTree->Branch("UnmappedHitZ", &m_unmappedPositionZ, "unmappedz/F");
    m_unmappedTree->Branch("UnmappedHitR", &m_unmappedPositionR, "unmappedr/F");
    
    // now register the Tree
    SmartIF<ITHistSvc> tHistSvc{service("THistSvc")};
    if (!tHistSvc) {
        ATH_MSG_ERROR( "initialize() Could not find Hist Service  -> Switching Tree output off !" );
        delete m_unmappedTree; m_unmappedTree = nullptr;
        delete m_mappingTree; m_mappingTree = nullptr;
    }
    if (tHistSvc && ((tHistSvc->regTree("/val/UnmappedAssociations", m_unmappedTree)).isFailure()
            ||  (tHistSvc->regTree("/val/MappingTest", m_mappingTree)).isFailure()) ) {
        ATH_MSG_ERROR( "initialize() Could not register the validation Tree -> Switching Tree output off !" );
        delete m_unmappedTree; m_unmappedTree = nullptr;
        delete m_mappingTree; m_mappingTree = nullptr;
    }
    
    return StatusCode::SUCCESS;
    
}

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 Trk::TrkDetDescrUnitTestBase::execute ( const EventContext & ctx )

virtualinherited

standard Athena-Algorithm method

Implements AthAlgorithm.

Definition at line 40 of file TrkDetDescrUnitTestBase.cxx.

{
    return runTest();
}

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 & AthCommonAlgorithm< 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 89 of file AthCommonAlgorithm.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 AthCommonAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

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

finalize()

StatusCode Trk::TrkDetDescrUnitTestBase::finalize ( )

inherited

standard Athena-Algorithm method

Definition at line 45 of file TrkDetDescrUnitTestBase.cxx.

{
 
   ATH_MSG_INFO( "finalize()" );
   return StatusCode::SUCCESS;
}

initialize()

StatusCode Trk::TrkDetDescrUnitTestBase::initialize ( )

inherited

standard Athena-Algorithm method

Definition at line 19 of file TrkDetDescrUnitTestBase.cxx.

{
    ATH_MSG_INFO( "Creating random number services, call bookTree() and initializeTest()" );
 
    // intialize the random number generators
    m_gaussDist = new Rndm::Numbers(randSvc(), Rndm::Gauss(0.,1.));
    m_flatDist  = new Rndm::Numbers(randSvc(), Rndm::Flat(0.,1.));
 
    if  (bookTree().isFailure()){
        ATH_MSG_FATAL( "Could not book the TTree object" );
        return StatusCode::FAILURE;
    }
    
    if (initializeTest().isFailure()){
        ATH_MSG_FATAL( "Could not initialize the test" );
        return StatusCode::FAILURE;
    }
    
    return StatusCode::SUCCESS;
}

initializeTest()

StatusCode Trk::MappingTest::initializeTest ( )

virtual

Reimplemented from Trk::TrkDetDescrUnitTestBase.

Definition at line 24 of file MappingTest.cxx.

{
 
    // Get the TrackingGeometry from StoreGate
    // initialize the TrackingGeometrySvc
    if (m_trackingGeometrySvc.retrieve().isFailure()) {
        ATH_MSG_FATAL( "Cannot retrieve TrackingGeometrySvc. Abort job. " );
        return StatusCode::FAILURE;
    }
    m_trackingGeometryName = m_trackingGeometrySvc->trackingGeometryName();
        
    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()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

Only relevant for non-reentrant algorithms. Actual number of clones needs to be set via the "Cardinality" property.

Reimplemented in AFP_DigiTop, AlgB, AlgT, BCM_Digitization, CscDigitBuilder, CscDigitToCscRDO, G4AtlasAlg, G4RunAlg, HGTD_Digitization, HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ISF::SimKernelMT, ITk::StripDigitization, ITkPixelCablingAlg, ITkStripCablingAlg, LArHitEMapMaker, LArTTL1Maker, LUCID_DigiTop, LVL1::L1TopoSimulation, MergeCalibHits, MergeGenericMuonSimHitColl, MergeHijingPars, MergeMcEventCollection, MergeTrackRecordCollection, MergeTruthJets, MergeTruthParticles, MuonDigitizer, PileUpMTAlg, PixelDigitization, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_Digitization, 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, SGInputLoader, Simulation::BeamEffectsAlg, TileHitVecToCnt, TileMuonFitter, TilePulseForTileMuonReceiver, TileRawChannelMaker, TRTDigitization, and ZDC_DigiTop.

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

{ return false; }

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();
  }

runTest()

StatusCode Trk::MappingTest::runTest ( )

virtual

Implements Trk::TrkDetDescrUnitTestBase.

Definition at line 87 of file MappingTest.cxx.

{
    ATH_MSG_VERBOSE("Running the MappingTest Test");
    
    // ------------------------------- get the trackingGeometry at first place
    if (!m_trackingGeometry) {
        if ((detStore()->retrieve(m_trackingGeometry, m_trackingGeometryName)).isFailure())
            ATH_MSG_FATAL( "Could not retrieve TrackingGeometry '" << m_trackingGeometryName << "' from DetectorStore." );
        else
            ATH_MSG_INFO( "TrackingGeometry '" << m_trackingGeometryName << "' successfully retrieved from DetectorStore." );
    }
    // only run if it didn't already run before
    if (!m_executed && m_trackingGeometry){
        // get the volume and the overal boundaries
        const TrackingVolume* tVolume = m_trackingGeometry->trackingVolume(m_mappingVolumeName);
        if (tVolume){
            ATH_MSG_INFO("Retrieved TrackingVolume '" << tVolume->volumeName() << "'. Start the mapping validation.");
            const Trk::CylinderVolumeBounds* cvb = dynamic_cast<const Trk::CylinderVolumeBounds*>(&(tVolume->volumeBounds()));
            if (cvb){
                double mRad  = cvb->innerRadius();
                double dRad  = cvb->deltaRadius();
                double zHalf = cvb->halflengthZ();
                // run the mapping
                for ( size_t it = 0; it < TrkDetDescrUnitTestBase::m_numTests; ++it ){ 
                    // create the mapping position
                    double mapRad = mRad + TrkDetDescrUnitTestBase::m_flatDist->shoot()*dRad;
                    double mapPhi = M_PI * (2*TrkDetDescrUnitTestBase::m_flatDist->shoot() - 1.);
                    double mapZ   = zHalf * (2*TrkDetDescrUnitTestBase::m_flatDist->shoot() - 1.);
                    double mapX   = mapRad*cos(mapPhi);
                    double mapY   = mapRad*sin(mapPhi);
                    // the mapping position & unit is the same
                    Amg::Vector3D position(mapX, mapY, mapZ);
                    Amg::Vector3D direction = position.normalized();
                    // create curvilinear parameters
                    Trk::NeutralCurvilinearParameters ncp(position,direction,0.);
                    // get the closest material layer
                    const Trk::LayerIntersection<Amg::Vector3D> lIntersect 
                        = m_trackingGeometry->closestMaterialLayer<Trk::NeutralCurvilinearParameters>(ncp, Trk::mappingMode, true);
                    if (lIntersect.intersection.valid){
                        // the mapping positions
                        m_mappingPositionX = mapX;
                        m_mappingPositionY = mapY;
                        m_mappingPositionZ = mapZ;
                        m_mappingPositionR = mapRad;
                        // the resulting assigned position
                        m_assignedPositionX  = lIntersect.intersection.position.x();
                        m_assignedPositionY  = lIntersect.intersection.position.y();
                        m_assignedPositionZ  = lIntersect.intersection.position.z();
                        m_assignedPositionR  = lIntersect.intersection.position.perp();
                        m_assignedCorrection = 0.;
                        m_assignedLayerIndex = lIntersect.object->layerIndex().value();
                        m_assignmentDistance = lIntersect.intersection.pathLength;
                        // and now write the tree
                        m_mappingTree->Fill();
                    } else {
                        // the unmapped positions
                        // and now fill the tree
                        m_unmappedPositionX = mapY;
                        m_unmappedPositionY = mapY;
                        m_unmappedPositionZ = mapZ;
                        m_unmappedPositionR = mapRad;
                        // and now fill the tree
                        m_unmappedTree->Fill();
                    }
                }
            }
        } else 
            ATH_MSG_INFO("Could not retrieve the TrackingVolume '" << m_mappingVolumeName << "'." );
        
    }
    m_executed = true;
    return StatusCode::SUCCESS;
       
}

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Reimplemented in AthFilterAlgorithm.

Definition at line 99 of file AthCommonAlgorithm.h.

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

sysExecute()

StatusCode AthCommonAlgorithm< 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.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonAlgorithm< 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 AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, HypoBase, InputMakerBase, and PyAthena::Alg.

Definition at line 60 of file AthCommonAlgorithm.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_assignedCorrection

float Trk::MappingTest::m_assignedCorrection {}

private

Definition at line 78 of file MappingTest.h.

{};

m_assignedLayerIndex

int Trk::MappingTest::m_assignedLayerIndex {}

private

Definition at line 79 of file MappingTest.h.

{};

m_assignedPositionR

float Trk::MappingTest::m_assignedPositionR {}

private

Definition at line 77 of file MappingTest.h.

{};

m_assignedPositionX

float Trk::MappingTest::m_assignedPositionX {}

private

Definition at line 74 of file MappingTest.h.

{};

m_assignedPositionY

float Trk::MappingTest::m_assignedPositionY {}

private

Definition at line 75 of file MappingTest.h.

{};

m_assignedPositionZ

float Trk::MappingTest::m_assignedPositionZ {}

private

Definition at line 76 of file MappingTest.h.

{};

m_assignmentDistance

float Trk::MappingTest::m_assignmentDistance {}

private

Definition at line 80 of file MappingTest.h.

{};

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_etaCutOff

Gaudi::Property<double> Trk::MappingTest::m_etaCutOff {this, "EtaCutOff", 6.0, "do not map beyond this point"}

private

Definition at line 57 of file MappingTest.h.

{this, "EtaCutOff", 6.0, "do not map beyond this point"};

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_executed

bool Trk::MappingTest::m_executed = false

private

Make sure it only runs once.

Definition at line 49 of file MappingTest.h.

m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_flatDist

Rndm::Numbers* Trk::TrkDetDescrUnitTestBase::m_flatDist = nullptr

protectedinherited

Definition at line 58 of file TrkDetDescrUnitTestBase.h.

m_gaussDist

Rndm::Numbers* Trk::TrkDetDescrUnitTestBase::m_gaussDist = nullptr

protectedinherited

Random Number setup.

Definition at line 57 of file TrkDetDescrUnitTestBase.h.

m_mappingPositionR

float Trk::MappingTest::m_mappingPositionR {}

private

Definition at line 72 of file MappingTest.h.

{};

m_mappingPositionX

float Trk::MappingTest::m_mappingPositionX {}

private

Definition at line 69 of file MappingTest.h.

{};

m_mappingPositionY

float Trk::MappingTest::m_mappingPositionY {}

private

Definition at line 70 of file MappingTest.h.

{};

m_mappingPositionZ

float Trk::MappingTest::m_mappingPositionZ {}

private

Definition at line 71 of file MappingTest.h.

{};

m_mappingTree

TTree* Trk::MappingTest::m_mappingTree = nullptr

private

Definition at line 67 of file MappingTest.h.

m_mappingTreeDescription

Gaudi::Property<std::string> Trk::MappingTest::m_mappingTreeDescription {this, "MappingTreeDescription", "Test Algorithm for Layer - 3D point association"}

private

Definition at line 65 of file MappingTest.h.

{this, "MappingTreeDescription", "Test Algorithm for Layer - 3D point association"};

m_mappingTreeName

Gaudi::Property<std::string> Trk::MappingTest::m_mappingTreeName {this, "MappingTreeName", "LayerMappingTest"}

private

Definition at line 63 of file MappingTest.h.

{this, "MappingTreeName", "LayerMappingTest"};

m_mappingVolumeName

Gaudi::Property<std::string> Trk::MappingTest::m_mappingVolumeName

private

Initial value:

{this, "HighestVolume", "InDet::Detectors::Pixel::Barrel",
      "only map within this volume"}

Definition at line 59 of file MappingTest.h.

     {this, "HighestVolume", "InDet::Detectors::Pixel::Barrel",
      "only map within this volume"};

m_numTests

Gaudi::Property<size_t> Trk::TrkDetDescrUnitTestBase::m_numTests {this, "NumberOfTestsPerEvent", 100}

protectedinherited

number of tests

Definition at line 61 of file TrkDetDescrUnitTestBase.h.

{this, "NumberOfTestsPerEvent", 100};

m_trackingGeometry

const TrackingGeometry* Trk::MappingTest::m_trackingGeometry = nullptr

private

The TrackingGeometry to be retrieved.

Definition at line 54 of file MappingTest.h.

m_trackingGeometryName

std::string Trk::MappingTest::m_trackingGeometryName = "AtlasTrackingGeometry"

private

The Name of the TrackingGeometry.

Definition at line 55 of file MappingTest.h.

m_trackingGeometrySvc

ServiceHandle<Trk::ITrackingGeometrySvc> Trk::MappingTest::m_trackingGeometrySvc

private

Initial value:

{this, "TrackingGeometrySvc", "TrackingGeometrySvc/AtlasTrackingGeometrySvc",
     "Service handle for retrieving the TrackingGeometry"}

Definition at line 51 of file MappingTest.h.

    {this, "TrackingGeometrySvc", "TrackingGeometrySvc/AtlasTrackingGeometrySvc",
     "Service handle for retrieving the TrackingGeometry"};

m_unmappedPositionR

float Trk::MappingTest::m_unmappedPositionR {}

private

Definition at line 86 of file MappingTest.h.

{};

m_unmappedPositionX

float Trk::MappingTest::m_unmappedPositionX {}

private

Definition at line 83 of file MappingTest.h.

{};

m_unmappedPositionY

float Trk::MappingTest::m_unmappedPositionY {}

private

Definition at line 84 of file MappingTest.h.

{};

m_unmappedPositionZ

float Trk::MappingTest::m_unmappedPositionZ {}

private

Definition at line 85 of file MappingTest.h.

{};

m_unmappedTree

TTree* Trk::MappingTest::m_unmappedTree = nullptr

private

Definition at line 82 of file MappingTest.h.

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• MappingTest.h
• MappingTest.cxx