ATLAS Offline Software
Loading...
Searching...
No Matches
ActsTrk::ActsMuonTrackingGeometryTest Class Reference

Extrapolation test for the ActsMuonTrackingGeometry for gen3. More...

#include <ActsMuonTrackingGeometryTest.h>

Inheritance diagram for ActsTrk::ActsMuonTrackingGeometryTest:

Public Member Functions

 ~ActsMuonTrackingGeometryTest ()=default
StatusCode initialize () override
StatusCode execute (const EventContext &ctx) override
 Execute method.
StatusCode finalize () override
 AthHistogramAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
 Constructor with parameters:
virtual StatusCode sysInitialize ()
 Initialization method invoked by the framework.
const ServiceHandle< ITHistSvc > & histSvc () const
 The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies.
bool filterPassed (const EventContext &ctx) const
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
const EventContext & getContext () const
 Deprecated methods (use the ones with EventContext).
bool filterPassed () const
void setFilterPassed (bool state) 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.
StatusCode configAthHistogramming (const ServiceHandle< ITHistSvc > &histSvc, const std::string &prefix, const std::string &rootDir, const std::string &histNamePrefix, const std::string &histNamePostfix, const std::string &histTitlePrefix, const std::string &histTitlePostfix)
 To be called by the derived classes to fill the internal configuration.
TH1 * bookGetPointer (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
TH1 * bookGetPointer (TH1 *hist, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
TH1 * bookGetPointer (TH1 &histRef, std::string tDir="", std::string stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
TTree * bookGetPointer (const TTree &treeRef, std::string tDir="", std::string stream="")
 Simplify the booking and registering (into THistSvc) of TTrees.
TGraph * bookGetPointer (const TGraph &graphRef, std::string tDir="", std::string stream="")
 Simplify the booking and registering (into THistSvc) of TGraphs.
TEfficiency * bookGetPointer (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency * bookGetPointer (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency * bookGetPointer (TEfficiency &effRef, std::string tDir="", std::string stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode book (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
StatusCode book (TH1 *hist, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
StatusCode book (TH1 &histRef, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of histograms.
StatusCode book (const TTree &treeRef, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TTrees.
StatusCode book (const TGraph &graphRef, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TGraphs.
StatusCode book (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode book (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode book (TEfficiency &effRef, const std::string &tDir="", const std::string &stream="")
 Simplify the booking and registering (into THistSvc) of TEfficiency.
TH1 * hist (const std::string &histName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered histograms of any type.
TH2 * hist2d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered 2-d histograms.
TH3 * hist3d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered 3-d histograms.
TTree * tree (const std::string &treeName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered TTrees.
TGraph * graph (const std::string &graphName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered TGraphs.
TEfficiency * efficiency (const std::string &effName, const std::string &tDir="", const std::string &stream="")
 Simplify the retrieval of registered TEfficiency.

Private Types

typedef ServiceHandle< StoreGateSvcStoreGateSvc_t
typedef uint32_t hash_t
 typedef for the internal hash
typedef std::map< const hash_t, TH1 * > HistMap_t
 Typedef for convenience.
typedef std::map< const hash_t, TEfficiency * > EffMap_t
 Typedef for convenience.
typedef std::map< const hash_t, TTree * > TreeMap_t
 Typedef for convenience.
typedef std::map< const hash_t, TGraph * > GraphMap_t
 Typedef for convenience.

Private Member Functions

Amg::Transform3D toLocalTrf (const ActsTrk::GeometryContext &gctx, const Identifier &hitId) const
Amg::Transform3D toGlobalTrf (const ActsTrk::GeometryContext &gctx, const Identifier &hitId) const
IdentifierHash layerHash (const Identifier &id) const
Gaudi::Details::PropertyBase & declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
 specialization for handling Gaudi::Property<SG::VarHandleKey>
void buildBookingString (std::string &bookingString, std::string &histName, std::string &tDir, std::string &stream, bool usePrefixPostfix=false)
 Method to build individual booking string.
void myReplace (std::string &str, const std::string &oldStr, const std::string &newStr)
 Helper method to replace sub-string.
hash_t hash (const std::string &histName) const
 Method to calculate a 32-bit hash from a string.

Private Attributes

const MuonGMR4::MuonDetectorManagerm_r4DetMgr {nullptr}
ServiceHandle< Muon::IMuonIdHelperSvcm_idHelperSvc {this, "IdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}
ServiceHandle< IAthRNGSvcm_rndmGenSvc {this, "AthRNGSvc", "AthRNGSvc"}
PublicToolHandle< ActsTrk::ITrackingGeometryToolm_trackingGeometryTool {this, "TrackingGeometryTool", "ActsTrackingGeometryTool"}
SG::ReadCondHandleKey< MuonGM::MuonDetectorManagerm_detMgrKey
SG::ReadCondHandleKey< AtlasFieldCacheCondObjm_fieldCacheCondObjInputKey
ActsTrk::GeoContextReadKey_t m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}
SG::ReadHandleKey< xAOD::TruthParticleContainerm_truthParticleKey {this, "TruthKey", "MuonTruthParticles"}
SG::ReadDecorHandleKey< xAOD::TruthParticleContainerm_truthSegLinkKey {this, "TruthKeyToSeg", m_truthParticleKey, "truthSegmentLinks", "TruthParticle to TruthSegment link"}
UnsignedIntegerProperty m_nEvents {this, "nEvents", 100}
DoubleProperty m_pathLimit {this, "PathLimit", 30.*Gaudi::Units::m}
DoubleProperty m_maxStepSize {this, "MaxStepSize", 1*Gaudi::Units::m}
UnsignedIntegerProperty m_maxSteps {this, "MaxSteps", 100000}
UnsignedIntegerProperty m_maxTargetSkipping {this, "MaxTargetSkipping", 10000}
DoubleProperty m_stepTolerance {this, "StepTolerance", 1e-10}
Gaudi::Property< bool > m_startFromFirstHit {this, "StartFromFirstHit", false, "Start from first hit"}
Gaudi::Property< std::vector< double > > m_etaRange {this, "EtaRange", {-3, 3}, "The eta range for particles"}
MuonVal::MuonTesterTree m_tree {"MuonNavigationTestGen3R4", "MuonNavigationTestGen3R4"}
MuonVal::MuonIdentifierBranch m_detId {m_tree, "detId"}
MuonVal::VectorBranch< unsigned short > & m_techIdx {m_tree.newVector<unsigned short>("detId_techIdx")}
MuonVal::VectorBranch< unsigned short > & m_gasGapId {m_tree.newVector<unsigned short>("detId_gasGap")}
MuonVal::ThreeVectorBranch m_truthLoc {m_tree, "truthLoc"}
MuonVal::ThreeVectorBranch m_truthGlob {m_tree, "truthGlob"}
MuonVal::ThreeVectorBranch m_truthDir {m_tree, "truthDir"}
MuonVal::ScalarBranch< float > & m_truthPt {m_tree.newScalar<float>("truthPt")}
MuonVal::ScalarBranch< float > & m_truthP {m_tree.newScalar<float>("truthP")}
MuonVal::ThreeVectorBranch m_startGlob {m_tree, "startGlob"}
MuonVal::VectorBranch< float > & m_actsPropabsMomentum {m_tree.newVector<float>("actsPropabsMomentum")}
MuonVal::ThreeVectorBranch m_actsPropLoc {m_tree, "actsPropLoc"}
MuonVal::ThreeVectorBranch m_actsPropGlob {m_tree, "actsPropGlob"}
MuonVal::ThreeVectorBranch m_actsPropDir {m_tree, "actsPropDir"}
MuonVal::VectorBranch< float > & m_actsHitWireDist {m_tree.newVector<float>("actsHitWireDist")}
MuonVal::VectorBranch< float > & m_actsStepSize {m_tree.newVector<float>("actsStepSize")}
MuonVal::ScalarBranch< float > & m_propLength {m_tree.newScalar<float>("propLength")}
MuonVal::VectorBranch< unsigned short > & m_isPropagated {m_tree.newVector<unsigned short>("isPropagated")}
MuonVal::ScalarBranch< unsigned int > & m_propSteps {m_tree.newScalar<unsigned int>("propSteps")}
MuonVal::ScalarBranch< unsigned int > & m_event {m_tree.newScalar<unsigned int>("event")}
ServiceHandle< ITHistSvc > m_histSvc
 Default constructor: AthHistogramAlgorithm();.
std::string m_prefix
 Name of the ROOT output stream (file).
std::string m_rootDir
 Name of the ROOT directory.
std::string m_histNamePrefix
 The prefix for the histogram THx name.
std::string m_histNamePostfix
 The postfix for the histogram THx name.
std::string m_histTitlePrefix
 The prefix for the histogram THx title.
std::string m_histTitlePostfix
 The postfix for the histogram THx title.
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
HistMap_t m_histMap
 The map of histogram names to their pointers.
EffMap_t m_effMap
 The map of histogram names to their pointers.
TreeMap_t m_treeMap
 The map of TTree names to their pointers.
GraphMap_t m_graphMap
 The map of TGraph names to their pointers.
std::string m_streamName
 Name of the ROOT output stream (file).
std::string m_name
 Instance name.
MsgStream m_msg
 Cached Message Stream.

Detailed Description

Extrapolation test for the ActsMuonTrackingGeometry for gen3.

Definition at line 37 of file ActsMuonTrackingGeometryTest.h.

Member Typedef Documentation

◆ EffMap_t

typedef std::map< const hash_t, TEfficiency* > AthHistogramming::EffMap_t
privateinherited

Typedef for convenience.

Definition at line 207 of file AthHistogramming.h.

◆ GraphMap_t

typedef std::map< const hash_t, TGraph* > AthHistogramming::GraphMap_t
privateinherited

Typedef for convenience.

Definition at line 221 of file AthHistogramming.h.

◆ hash_t

typedef uint32_t AthHistogramming::hash_t
privateinherited

typedef for the internal hash

Definition at line 171 of file AthHistogramming.h.

◆ HistMap_t

typedef std::map< const hash_t, TH1* > AthHistogramming::HistMap_t
privateinherited

Typedef for convenience.

Definition at line 200 of file AthHistogramming.h.

◆ StoreGateSvc_t

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

Definition at line 388 of file AthCommonDataStore.h.

◆ TreeMap_t

typedef std::map< const hash_t, TTree* > AthHistogramming::TreeMap_t
privateinherited

Typedef for convenience.

Definition at line 214 of file AthHistogramming.h.

Constructor & Destructor Documentation

◆ ~ActsMuonTrackingGeometryTest()

ActsTrk::ActsMuonTrackingGeometryTest::~ActsMuonTrackingGeometryTest ( )
default

Member Function Documentation

◆ AthHistogramAlgorithm()

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

Constructor with parameters:

Definition at line 40 of file AthHistogramAlgorithm.cxx.

32 :
33 ::AthAlgorithm( name, pSvcLocator ),
34 ::AthHistogramming( name ),
35 m_histSvc ( "THistSvc/THistSvc", name )
36{
37 //
38 // Property declaration
39 //
40 // The histogram service
41 declareProperty("THistSvc",
42 m_histSvc = ServiceHandle<ITHistSvc>("THistSvc/THistSvc", name),
43 "Handle to a THistSvc instance: it will be used to write "
44 "ROOT objects to ROOT files" );
45 // declareProperty("THistService", m_histSvc, "The THistSvc" );
46
47 declareProperty("RootStreamName", m_prefix = "/ANALYSIS", "Name of the output ROOT stream (file) that the THistSvc uses");
48 declareProperty("RootDirName", m_rootDir = "",
49 "Name of the ROOT directory inside the ROOT file where the histograms will go");
50
51 declareProperty( "HistNamePrefix", m_histNamePrefix = "", "The prefix for the histogram THx name" );
52 declareProperty( "HistNamePostfix", m_histNamePostfix = "", "The postfix for the histogram THx name" );
53
54 declareProperty( "HistTitlePrefix", m_histTitlePrefix = "", "The prefix for the histogram THx title" );
55 declareProperty( "HistTitlePostfix", m_histTitlePostfix = "", "The postfix for the histogram THx title" );
56}
AthAlgorithm(const std::string &name, ISvcLocator *pSvcLocator)
Constructor with parameters:
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)
std::string m_histNamePrefix
The prefix for the histogram THx name.
ServiceHandle< ITHistSvc > m_histSvc
Default constructor: AthHistogramAlgorithm();.
std::string m_prefix
Name of the ROOT output stream (file).
std::string m_histNamePostfix
The postfix for the histogram THx name.
std::string m_histTitlePostfix
The postfix for the histogram THx title.
std::string m_rootDir
Name of the ROOT directory.
std::string m_histTitlePrefix
The prefix for the histogram THx title.
AthHistogramming(const std::string &name)
Constructor with parameters:

◆ book() [1/8]

StatusCode AthHistogramming::book ( const TEfficiency & eff,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 337 of file AthHistogramming.h.

338{
339 // We need to create a non-const clone
340 TEfficiency* effClone = dynamic_cast< TEfficiency* >( eff.Clone() );
341 if ( !effClone ) {
342 m_msg << MSG::ERROR << "Couldn't create a TEfficiency clone" << endmsg;
343 return StatusCode::FAILURE;
344 }
345 return this->book( *effClone, tDir, stream );
346}
#define endmsg
StatusCode book(const TH1 &hist, const std::string &tDir="", const std::string &stream="")
Simplify the booking and registering (into THistSvc) of histograms.
MsgStream m_msg
Cached Message Stream.

◆ book() [2/8]

StatusCode AthHistogramming::book ( const TGraph & graphRef,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TGraphs.

◆ book() [3/8]

StatusCode AthHistogramming::book ( const TH1 & hist,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 305 of file AthHistogramming.h.

306{
307 // We need to create a non-const clone
308 TH1* histClone = dynamic_cast< TH1* >( hist.Clone() );
309 if ( !histClone ) {
310 m_msg << MSG::ERROR << "Couldn't create a TH1 clone" << endmsg;
311 return StatusCode::FAILURE;
312 }
313 return this->book( *histClone, tDir, stream );
314}
TH1 * hist(const std::string &histName, const std::string &tDir="", const std::string &stream="")
Simplify the retrieval of registered histograms of any type.

◆ book() [4/8]

StatusCode AthHistogramming::book ( const TTree & treeRef,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TTrees.

Definition at line 405 of file AthHistogramming.h.

406{
407 // Call the other Book method and see if it returns a valid pointer
408 TTree* treePointer = this->bookGetPointer( treeRef, tDir, stream );
409 if ( treePointer )
410 {
411 return StatusCode::SUCCESS;
412 }
413 else
414 {
415 return StatusCode::FAILURE;
416 }
417}
TH1 * bookGetPointer(const TH1 &hist, const std::string &tDir="", const std::string &stream="")
Simplify the booking and registering (into THistSvc) of histograms.

◆ book() [5/8]

StatusCode AthHistogramming::book ( TEfficiency & effRef,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 358 of file AthHistogramming.h.

359{
360 // Call the other Book method and see if it returns a valid pointer
361 TEfficiency* effPointer = this->bookGetPointer( effRef, tDir, stream );
362 if ( !effPointer ) {
363 m_msg << MSG::ERROR << "Couldn't book a TEfficiency" << endmsg;
364 return StatusCode::FAILURE;
365 }
366 return StatusCode::SUCCESS;
367}

◆ book() [6/8]

StatusCode AthHistogramming::book ( TEfficiency * eff,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 348 of file AthHistogramming.h.

349{
350 if ( !eff ) {
351 m_msg << MSG::ERROR << "Got a zero pointer to a TEfficiency" << endmsg;
352 return StatusCode::FAILURE;
353 }
354 return this->book( *eff, tDir, stream );
355}

◆ book() [7/8]

StatusCode AthHistogramming::book ( TH1 & histRef,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 326 of file AthHistogramming.h.

327{
328 // Call the other Book method and see if it returns a valid pointer
329 TH1* histPointer = this->bookGetPointer( histRef, tDir, stream );
330 if ( !histPointer ) {
331 m_msg << MSG::ERROR << "Couldn't book a TH1" << endmsg;
332 return StatusCode::FAILURE;
333 }
334 return StatusCode::SUCCESS;
335}

◆ book() [8/8]

StatusCode AthHistogramming::book ( TH1 * hist,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 316 of file AthHistogramming.h.

317{
318 if ( !hist ) {
319 m_msg << MSG::ERROR << "Got a zero pointer to a TH1" << endmsg;
320 return StatusCode::FAILURE;
321 }
322 return this->book( *hist, tDir, stream );
323}

◆ bookGetPointer() [1/8]

TEfficiency * AthHistogramming::bookGetPointer ( const TEfficiency & eff,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 283 of file AthHistogramming.h.

284{
285 // We need to create a non-const clone
286 TEfficiency* histClone = dynamic_cast< TEfficiency* >( hist.Clone() );
287 if ( !histClone ) {
288 m_msg << MSG::ERROR << "Couldn't create a TEfficiency clone in bookGetPointer" << endmsg;
289 return 0;
290 }
291 return this->bookGetPointer( *histClone, tDir, stream );
292
293}

◆ bookGetPointer() [2/8]

TGraph * AthHistogramming::bookGetPointer ( const TGraph & graphRef,
std::string tDir = "",
std::string stream = "" )
protectedinherited

Simplify the booking and registering (into THistSvc) of TGraphs.

Definition at line 412 of file AthHistogramming.cxx.

413{
414 // Get a pointer
415 const TGraph* graphPointer = &graphRef;
416
417 // Check that we got a valid pointer
418 if ( !graphPointer )
419 {
420 m_msg << MSG::WARNING
421 << "We got an invalid TGraph pointer in the BookGetPointer(TGraph*) method of the class" << m_name
422 << "!" << endmsg;
423 return NULL;
424 }
425
426 // Modify the name and title according to the prefixes of this classes instance
427 std::string graphName = graphPointer->GetName();
428 const std::string graphTitle = graphPointer->GetTitle();
429
430 // Check if the hash for this graphName already exists, i.e., if we have a hash collision
431 const hash_t graphHash = this->hash(graphName);
432 GraphMap_t::const_iterator it = m_graphMap.find( graphHash );
433 if ( it != m_graphMap.end() ) // It does exist!
434 {
435 m_msg << MSG::WARNING
436 << "Detected a hash collision. The hash for the TGraph with name=" << graphName
437 << " already exists and points to a TGraph with name=" << it->second->GetName()
438 << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
439 return NULL;
440 }
441
442 // Create a clone that has the new name
443 TGraph* graphClone = dynamic_cast< TGraph* >( graphPointer->Clone((m_histNamePrefix+graphName+m_histNamePostfix).c_str()) );
444 if( !graphClone )
445 {
446 m_msg << MSG::WARNING
447 << "We couldn't clone the TGraph in the BookGetPointer(TGraph&) method of the class" << m_name
448 << "!" << endmsg;
449 return NULL;
450 }
451 graphClone->SetTitle ((m_histTitlePrefix+graphTitle+m_histTitlePostfix).c_str());
452
453 // Massage the final string to book things
454 std::string bookingString("");
455 this->buildBookingString( bookingString, graphName, tDir, stream );
456
457 // Register the TGraph into the THistSvc
458 if ( !((histSvc()->regGraph(bookingString, graphClone)).isSuccess()) )
459 {
460 m_msg << MSG::WARNING
461 << "Problem registering TGraph with name " << graphName
462 << ", title " << graphTitle
463 << " in " << m_name << "!" << endmsg;
464 return NULL;
465 }
466
467 // Also register it in the local map of string to pointer
468 m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphClone ) );
469
470 return graphClone;
471}
const ServiceHandle< ITHistSvc > & histSvc() const
The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a...
std::string m_histNamePostfix
The postfix for the histogram THx name.
hash_t hash(const std::string &histName) const
Method to calculate a 32-bit hash from a string.
uint32_t hash_t
typedef for the internal hash
std::string m_histTitlePostfix
The postfix for the histogram THx title.
std::string m_histTitlePrefix
The prefix for the histogram THx title.
std::string m_name
Instance name.
void buildBookingString(std::string &bookingString, std::string &histName, std::string &tDir, std::string &stream, bool usePrefixPostfix=false)
Method to build individual booking string.
std::string m_histNamePrefix
The prefix for the histogram THx name.
GraphMap_t m_graphMap
The map of TGraph names to their pointers.

◆ bookGetPointer() [3/8]

TH1 * AthHistogramming::bookGetPointer ( const TH1 & hist,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 262 of file AthHistogramming.h.

263{
264 // We need to create a non-const clone
265 TH1* histClone = dynamic_cast< TH1* >( hist.Clone() );
266 if ( !histClone ) {
267 m_msg << MSG::ERROR << "Couldn't create a TH1 clone in bookGetPointer" << endmsg;
268 return 0;
269 }
270 return this->bookGetPointer( *histClone, tDir, stream );
271
272}

◆ bookGetPointer() [4/8]

TTree * AthHistogramming::bookGetPointer ( const TTree & treeRef,
std::string tDir = "",
std::string stream = "" )
protectedinherited

Simplify the booking and registering (into THistSvc) of TTrees.

Definition at line 297 of file AthHistogramming.cxx.

298{
299 // Get a pointer
300 const TTree* treePointer = &treeRef;
301
302 // Check that we got a valid pointer
303 if ( !treePointer )
304 {
305 m_msg << MSG::WARNING
306 << "We got an invalid TTree pointer in the BookGetPointer(TTree*) method of the class" << m_name
307 << "!" << endmsg;
308 return NULL;
309 }
310
311 // Modify the name and title according to the prefixes of this classes instance
312 std::string treeName = treePointer->GetName();
313 const std::string treeTitle = treePointer->GetTitle();
314
315 // Check if the hash for this treeName already exists, i.e., if we have a hash collision
316 const hash_t treeHash = this->hash(treeName);
317 TreeMap_t::const_iterator it = m_treeMap.find( treeHash );
318 if ( it != m_treeMap.end() ) // It does exist!
319 {
320 m_msg << MSG::WARNING
321 << "Detected a hash collision. The hash for the TTree with name=" << treeName
322 << " already exists and points to a TTree with name=" << it->second->GetName()
323 << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
324 return NULL;
325 }
326
327 // Create a clone that has the new name
328 TTree* treeClone = dynamic_cast< TTree* >( treePointer->Clone(treeName.c_str()) );
329 if( !treeClone )
330 {
331 m_msg << MSG::WARNING
332 << "We couldn't clone the TTree in the BookGetPointer(TTree&) method of the class" << m_name
333 << "!" << endmsg;
334 return NULL;
335 }
336 treeClone->SetTitle (treeTitle.c_str());
337
338 // Massage the final string to book things
339 std::string bookingString("");
340 this->buildBookingString( bookingString, treeName, tDir, stream );
341
342 // Register the TTree into the THistSvc
343 if ( !((histSvc()->regTree(bookingString, treeClone)).isSuccess()) )
344 {
345 m_msg << MSG::WARNING
346 << "Problem registering TTree with name " << treeName
347 << ", title " << treeTitle
348 << " in " << m_name << "!" << endmsg;
349 return NULL;
350 }
351
352 // Also register it in the local map of string to pointer
353 m_treeMap.insert( m_treeMap.end(), std::pair< const hash_t, TTree* >( treeHash, treeClone ) );
354
355 return treeClone;
356}
TreeMap_t m_treeMap
The map of TTree names to their pointers.

◆ bookGetPointer() [5/8]

TEfficiency * AthHistogramming::bookGetPointer ( TEfficiency & effRef,
std::string tDir = "",
std::string stream = "" )
protectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 131 of file AthHistogramming.cxx.

132{
133 // Modify the name and title according to the prefixes of this classes instance
134 std::string effName(effRef.GetName());
135 const std::string effTitle(effRef.GetTitle());
136 std::string bookingString("");
137
138 this->buildBookingString( bookingString, effName, tDir, stream );
139 effRef.SetTitle((m_histTitlePrefix+effTitle+m_histTitlePostfix).c_str() );
140 effRef.SetName(effName.c_str());
141
142 // Check if the hash for this effName already exists, i.e., if we have a hash collision
143 const hash_t effHash = this->hash(effName);
144 EffMap_t::const_iterator it = m_effMap.find( effHash );
145 if ( it != m_effMap.end() ) // It does exist!
146 {
147 m_msg << MSG::WARNING
148 << "Detected a hash collision. The hash for the TEfficiency with name=" << effName
149 << " already exists and points to a TEfficiency with name=" << it->second->GetName()
150 << " NOT going to book the new TEfficiency and returning a NULL pointer!" << endmsg;
151 return NULL;
152 }
153
154 // Set the new name and title for the TEfficiency, based on the prefixes that the user set for this class instance
155 // Create a clone that has the new name
156
157 // Massage the final string to book things
158
159 // Register the TEfficiency into the THistSvc
160 if ( !((histSvc()->regEfficiency(bookingString, &effRef)).isSuccess()) )
161 {
162 m_msg << MSG::WARNING
163 << "Problem registering TEfficiency with name " << effName
164 << ", name prefix " << m_histNamePrefix
165 << ", title " << effTitle
166 << ", tile prefix " << m_histTitlePrefix
167 << ", and tile postfix " << m_histTitlePostfix
168 << " in " << m_name << "!" << endmsg;
169 return NULL;
170 }
171
172 // Also register it in the local map of string to pointer
173 m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, &effRef ) );
174
175 return &effRef;
176}
EffMap_t m_effMap
The map of histogram names to their pointers.

◆ bookGetPointer() [6/8]

TEfficiency * AthHistogramming::bookGetPointer ( TEfficiency * eff,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of TEfficiency.

Definition at line 295 of file AthHistogramming.h.

296{
297 if ( !hist ) {
298 m_msg << MSG::ERROR << "Got a zero pointer to a TEfficiency in bookGetPointer" << endmsg;
299 return 0;
300 }
301 return this->bookGetPointer( *hist, tDir, stream );
302}

◆ bookGetPointer() [7/8]

TH1 * AthHistogramming::bookGetPointer ( TH1 & histRef,
std::string tDir = "",
std::string stream = "" )
protectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 83 of file AthHistogramming.cxx.

84{
85 // Modify the name and title according to the prefixes of this classes instance
86 std::string histName(histRef.GetName());
87 const std::string histTitle(histRef.GetTitle());
88 std::string bookingString("");
89
90 this->buildBookingString( bookingString, histName, tDir, stream );
91 histRef.SetTitle((m_histTitlePrefix+histTitle+m_histTitlePostfix).c_str() );
92 histRef.SetName(histName.c_str());
93
94 // Check if the hash for this histName already exists, i.e., if we have a hash collision
95 const hash_t histHash = this->hash(histName);
96 HistMap_t::const_iterator it = m_histMap.find( histHash );
97 if ( it != m_histMap.end() ) // It does exist!
98 {
99 m_msg << MSG::WARNING
100 << "Detected a hash collision. The hash for the histogram with name=" << histName
101 << " already exists and points to a histogram with name=" << it->second->GetName()
102 << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
103 return NULL;
104 }
105
106 // Set the new name and title for the histogram, based on the prefixes that the user set for this class instance
107 // Create a clone that has the new name
108
109 // Massage the final string to book things
110
111 // Register the histogram into the THistSvc
112 if ( !((histSvc()->regHist(bookingString, &histRef)).isSuccess()) )
113 {
114 m_msg << MSG::WARNING
115 << "Problem registering histogram with name " << histName
116 << ", name prefix " << m_histNamePrefix
117 << ", title " << histTitle
118 << ", tile prefix " << m_histTitlePrefix
119 << ", and tile postfix " << m_histTitlePostfix
120 << " in " << m_name << "!" << endmsg;
121 return NULL;
122 }
123
124 // Also register it in the local map of string to pointer
125 m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, &histRef ) );
126
127 return &histRef;
128}
HistMap_t m_histMap
The map of histogram names to their pointers.

◆ bookGetPointer() [8/8]

TH1 * AthHistogramming::bookGetPointer ( TH1 * hist,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the booking and registering (into THistSvc) of histograms.

Definition at line 274 of file AthHistogramming.h.

275{
276 if ( !hist ) {
277 m_msg << MSG::ERROR << "Got a zero pointer to a TH1 in bookGetPointer" << endmsg;
278 return 0;
279 }
280 return this->bookGetPointer( *hist, tDir, stream );
281}

◆ buildBookingString()

void AthHistogramming::buildBookingString ( std::string & bookingString,
std::string & histName,
std::string & tDir,
std::string & stream,
bool usePrefixPostfix = false )
privateinherited

Method to build individual booking string.

Definition at line 545 of file AthHistogramming.cxx.

550{
551 // Massage the final string to book things
552 if(tDir.empty()) tDir = m_rootDir;
553 size_t pos = histName.rfind('/');
554 if(pos != std::string::npos){
555 tDir+='/';
556 tDir.append(histName, 0,pos);
557 histName.erase(0,pos+1);
558 };
559 if(stream.empty()) stream = m_streamName;
560
561 if(usePrefixPostfix){
562 bookingString = "/"+stream+"/"+tDir+"/"+m_histNamePrefix+histName+m_histNamePostfix;
563 } else {
564 bookingString = "/"+stream+"/"+tDir+"/"+histName;
565 }
566 while(bookingString.find("//") != std::string::npos){
567 this->myReplace(bookingString,"//","/");
568 }
569
570 return;
571}
std::string m_rootDir
Name of the ROOT directory.
std::string m_streamName
Name of the ROOT output stream (file).
void myReplace(std::string &str, const std::string &oldStr, const std::string &newStr)
Helper method to replace sub-string.

◆ configAthHistogramming()

StatusCode AthHistogramming::configAthHistogramming ( const ServiceHandle< ITHistSvc > & histSvc,
const std::string & prefix,
const std::string & rootDir,
const std::string & histNamePrefix,
const std::string & histNamePostfix,
const std::string & histTitlePrefix,
const std::string & histTitlePostfix )
protectedinherited

To be called by the derived classes to fill the internal configuration.

Definition at line 51 of file AthHistogramming.cxx.

55{
58 m_rootDir = rootDir;
59 m_histNamePrefix = histNamePrefix;
60 m_histNamePostfix = histNamePostfix;
61 m_histTitlePrefix = histTitlePrefix;
62 m_histTitlePostfix = histTitlePostfix;
63
64 return StatusCode::SUCCESS;
65}
ServiceHandle< ITHistSvc > m_histSvc
Pointer to the THistSvc (event store by default).

◆ 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.

158 {
160 hndl.value(),
161 hndl.documentation());
162
163 }

◆ declareProperty()

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

Definition at line 145 of file AthCommonDataStore.h.

145 {
146 typedef typename SG::HandleClassifier<T>::type htype;
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>

◆ 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.

◆ efficiency()

TEfficiency * AthHistogramming::efficiency ( const std::string & effName,
const std::string & tDir = "",
const std::string & stream = "" )
protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 235 of file AthHistogramming.cxx.

236{
237 // Build a 32 bit hash out of the name
238 const hash_t effHash = this->hash(effName);
239
240 // See if this entry exists in the map
241 EffMap_t::const_iterator it = m_effMap.find( effHash );
242 if ( it == m_effMap.end() ) // It doesn't exist!
243 { // Let's see into the THistSvc if somebody else has registered the TEfficiency...
244
245 // Need to copy the strings as we will massage them from here on
246 std::string effNameCopy = effName;
247 std::string tDirCopy = tDir;
248 std::string streamCopy = stream;
249
250 // Massage the final string to book things
251 std::string bookingString("");
252 this->buildBookingString( bookingString, effNameCopy, tDirCopy, streamCopy ,false);
253
254 TEfficiency* effPointer(NULL);
255 if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
256 {
257 // Massage the final string to book things
258 std::string bookingString("");
259 this->buildBookingString( bookingString, effNameCopy, tDirCopy, streamCopy, true );
260
261 if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
262 {
263 m_msg << MSG::WARNING
264 << "Problem retrieving the TEfficiency with name (including pre- and post-fixes) "
265 << m_histNamePrefix + effNameCopy + m_histNamePostfix
266 << " or with name " << effNameCopy
267 << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
268 << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
269 return NULL;
270 }
271 // If we get to here, we actually found the TEfficiency in the THistSvc.
272 // So let's add it to the local cache map and return its pointer
273 m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, effPointer ) );
274 return effPointer;
275 }
276 // If we get to here, we actually found the TEfficiency in the THistSvc.
277 // So let's add it to the local cache map and return its pointer
278 m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, effPointer ) );
279 return effPointer;
280 }
281
282 // Return the pointer to the TEfficiency that we got from the local cache map
283 return it->second;
284}
std::pair< StatusCode, TEfficiency * > getEfficiency(ITHistSvc &svc, const std::string &name)

◆ 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.

◆ execute()

StatusCode ActsTrk::ActsMuonTrackingGeometryTest::execute ( const EventContext & ctx)
overridevirtual

Execute method.

Provides access to the EventContext if needed but is non-const as opposed to AthReentrantAlgorithm.

find the closest propagated hit to the truth hit

Implements AthAlgorithm.

Definition at line 107 of file ActsMuonTrackingGeometryTest.cxx.

107 {
108
109
110 const ActsTrk::GeometryContext* gctx{nullptr};
111 const AtlasFieldCacheCondObj* fieldCondObj{nullptr};
112 const MuonGM::MuonDetectorManager* detMgr{nullptr};
113 const xAOD::TruthParticleContainer* truthParticles{nullptr};
114
115 ATH_CHECK(SG::get(fieldCondObj, m_fieldCacheCondObjInputKey, ctx));
116 ATH_CHECK(SG::get(detMgr, m_detMgrKey, ctx));
117 ATH_CHECK(SG::get(truthParticles, m_truthParticleKey, ctx));
118 ATH_CHECK(SG::get(gctx, m_geoCtxKey, ctx));
119
120
121 const Acts::MagneticFieldContext mfContext = Acts::MagneticFieldContext(fieldCondObj);
122
123 auto anygctx = gctx->context();
124
125 //Get the tracking geometry
126 auto trackingGeometry = m_trackingGeometryTool->trackingGeometry();
127
128 if (!trackingGeometry) {
129 ATH_MSG_ERROR("Failed to retrieve the tracking geometry");
130 return StatusCode::FAILURE;
131 }
132
133 //Configure the ACTS propagator with the navigator and the stepper
134 using Stepper = Acts::EigenStepper<>;
135 using Navigator = Acts::Navigator;
136 using Propagator = Acts::Propagator<Stepper,Navigator>;
137 using ActorList = Acts::ActorList<Acts::detail::SteppingLogger, Acts::MaterialInteractor, Acts::EndOfWorldReached>;
138 using PropagatorOptions = Propagator::Options<ActorList>;
139
140 Navigator::Config navCfg;
141 navCfg.trackingGeometry = trackingGeometry;
142 navCfg.resolveSensitive = true;
143 navCfg.resolveMaterial= false;
144 navCfg.resolvePassive = true;
145
146 Navigator navigator(navCfg, Acts::getDefaultLogger("Navigator", ActsTrk::actsLevelVector(msgLevel())));
147
148 auto bField = std::make_shared<ATLASMagneticFieldWrapper>();
149 auto bfieldCache = bField->makeCache(mfContext);
150
151 auto stepper = Stepper(bField);
152
153 PropagatorOptions options(anygctx, mfContext);
154 options.pathLimit = m_pathLimit;
155 options.stepping.maxStepSize = m_maxStepSize;
156 options.stepping.stepTolerance = m_stepTolerance;
157 options.maxSteps = m_maxSteps;
158 options.maxTargetSkipping = m_maxTargetSkipping;
159
160
161 //switch off material interactions
162 auto& materialInteractor = options.actorList.get<Acts::MaterialInteractor>();
163 materialInteractor.energyLoss = false;
164 materialInteractor.multipleScattering = false;
165 materialInteractor.recordInteractions = false;
166
167 Propagator propagator(std::move(stepper), std::move(navigator),
168 Acts::getDefaultLogger("Propagator", ActsTrk::actsLevelVector(msgLevel())));
169
170 for(const xAOD::TruthParticle* truthParticle : *truthParticles) {
171
172 ATH_MSG_DEBUG("Processing truth particle with PDG ID: " << truthParticle->pdgId() << " ,pT: "
173 << truthParticle->pt() << " , p: " << truthParticle->p4().P() << ", eta: " << truthParticle->eta() << " , phi: " << truthParticle->phi());
174
175 //select only muons or geantinos particles
176 if(std::abs(truthParticle->pdgId()) != 13 && std::abs(truthParticle->pdgId()) != 998) {
177 ATH_MSG_VERBOSE("Skipping truth particle with PDG ID: " << truthParticle->pdgId()<<" only muons or charged geantinos are being processed");
178 continue;
179 }
180
181 Acts::ParticleHypothesis actsParticleHypothesis = truthParticle->pdgId() == 998 ?
182 Acts::ParticleHypothesis::chargedGeantino() : Acts::ParticleHypothesis::muon();
183
184
185 //take the truth segments witht he sim hits
186 std::vector<std::pair<const xAOD::MuonSegment*, std::vector<const xAOD::MuonSimHit*>>> muonSegmentWithSimHits;
187 const SegLink_t& segLink = segAcc(*truthParticle);
188 if (segLink.empty()) {
189 ATH_MSG_WARNING("No segment link found for truth particle with PDG ID: " << truthParticle->pdgId());
190 continue;
191 }
192 for(const auto& truthSegLink: segLink) {
193 const xAOD::MuonSegment* seg{*truthSegLink};
194 if(!seg){
195 continue;
196 }
197 auto unordedHits = MuonR4::getMatchingSimHits(*seg);
198 std::vector<const xAOD::MuonSimHit*> muonSimHits{unordedHits.begin(), unordedHits.end()};
199 ATH_MSG_VERBOSE("Segment at : "<<Amg::toString(seg->position())<<" with Sim Hits: "<<unordedHits.size());
200 muonSegmentWithSimHits.emplace_back(seg,muonSimHits);
201
202 }
203
204 const auto& particle = truthParticle->p4();
205 m_truthPt = particle.Pt();
206 m_truthP = particle.P();
207
208 const xAOD::TruthVertex* prodVertex = truthParticle->prodVtx();
209 Amg::Vector3D prodPos = prodVertex ? Amg::Vector3D(prodVertex->x(), prodVertex->y(), prodVertex->z())
210 : Amg::Vector3D::Zero();
211 Amg::Vector3D prodDir{Amg::dirFromAngles(particle.Phi(), particle.Theta())};
212 ATH_MSG_VERBOSE("Truth particle produced at " << Amg::toString(prodPos) << " with direction " << Amg::toString(prodDir));
213
214 //position, direction and momentum at the start of the propagation
215 Amg::Vector3D startPropPos{prodPos};
216 Amg::Vector3D startPropDir{prodDir};
217 double startPropP{energyToActs(particle.P())};
218
220
221 if(muonSegmentWithSimHits.empty()) {
222 ATH_MSG_DEBUG("No segments found for truth particle with PDG ID: " << truthParticle->pdgId());
223 continue;
224 }
225 // sort the segments by their radial distance
226 std::ranges::sort(muonSegmentWithSimHits,
227 [](const auto& a, const auto& b) {
228 return a.first->position().perp() < b.first->position().perp();
229 });
230
231
232 //sort the sim hits of the first segment to get the starting propagation position as the first one
233 std::vector<const xAOD::MuonSimHit*>& muonSimHits = muonSegmentWithSimHits.front().second;
234 std::ranges::sort(muonSimHits,
235 [this, &gctx](const xAOD::MuonSimHit* hit1, const xAOD::MuonSimHit* hit2){
236 const Amg::Vector3D globalPos1 = toGlobalTrf(*gctx,hit1->identify())*xAOD::toEigen(hit1->localPosition());
237 const Amg::Vector3D globalPos2 = toGlobalTrf(*gctx,hit2->identify())*xAOD::toEigen(hit2->localPosition());
238 return globalPos1.norm()<globalPos2.norm();
239 });
240
241 ATH_MSG_VERBOSE("After sorting..");
242 for(const auto& simHit: muonSimHits){
243 ATH_MSG_VERBOSE("Sim Hit of first segment at position: "<<Amg::toString(toGlobalTrf(*gctx, simHit->identify())*xAOD::toEigen(simHit->localPosition())));
244
245 }
246
247
248 startPropPos = toGlobalTrf(*gctx, muonSimHits.front()->identify())*xAOD::toEigen(muonSimHits.front()->localPosition());
249 startPropDir = toGlobalTrf(*gctx, muonSimHits.front()->identify()).linear()*xAOD::toEigen(muonSimHits.front()->localDirection());
250 startPropP = energyToActs(muonSimHits.front()->kineticEnergy());
251
252
253 ATH_MSG_VERBOSE("Kinetic Energy from the simHit: "<<startPropP / Gaudi::Units::GeV<<" and mass: "<<muonSimHits.front()->mass()<<" and energy deposit: "<<muonSimHits.front()->energyDeposit() / Gaudi::Units::eV);
254
255
256 }
257
258 ATH_MSG_VERBOSE("Starting propagation from"<<Amg::toString(startPropPos)<<" with direction"
259 <<Amg::toString(startPropDir)<<" and momentum "<<startPropP);
260
261
262
263 Acts::BoundTrackParameters start = Acts::BoundTrackParameters::createCurvilinear(
264 Acts::VectorHelpers::makeVector4(startPropPos, 0.), startPropDir,
265 truthParticle->charge() / startPropP,
266 std::nullopt,
267 actsParticleHypothesis);
268
269 ATH_MSG_DEBUG("start propagating here");
270 auto result = propagator.propagate(start, options);
271 const Acts::detail::SteppingLogger::result_type state = result.value().get<Acts::detail::SteppingLogger::result_type>();
272 const Acts::MaterialInteractor::result_type material = result.value().get<Acts::MaterialInteractor::result_type>();
273
274 m_propSteps = state.steps.size();
275 ATH_MSG_DEBUG("Number of propagated steps : " << m_propSteps);
276 m_propLength = result.value().pathLength;
277 std::vector<PropagatorRecorder> propagatedHits;
278
279 for(const auto& step : state.steps) {
280 if(!step.surface) {
281 continue;
282 }
283
284 const SurfaceCache* sCache = dynamic_cast<const SurfaceCache *>(step.surface->surfacePlacement());
285 if(!sCache) {
286 ATH_MSG_VERBOSE("Surface found but it's a portal, continuing..");
287 continue;
288 }
289 const Identifier ID = sCache->identify();
290 const Amg::Transform3D toGap{toLocalTrf(*gctx, ID)};
291 ATH_MSG_VERBOSE("Identify propagated hit " << m_idHelperSvc->toString(ID) << " with hit at local position " << Amg::toString(toGap*step.position)<<" and global direction "<<Amg::toString(step.momentum.unit()));
292
293
294 PropagatorRecorder newRecord{};
295 newRecord.id = ID;
296 newRecord.actsPropPos = toGap*step.position;
297 newRecord.actsGlobalPos = step.position;
298 newRecord.actsPropDir = toGap.linear()*step.momentum.unit();
299 newRecord.actsPropabsMomentum = step.momentum.norm();
300 newRecord.actsStepSize = step.stepSize.value();
301 //calculate the distance of the propagated hit to the wire in case of MDTs
302
303 if(m_idHelperSvc->isMdt(ID)){
304 //get the surface
305 const auto* tubeSurf = dynamic_cast<const Acts::StrawSurface*>(&sCache->surface());
306 if(tubeSurf){
307 Amg::Vector3D wirePos = toGap*tubeSurf->center(anygctx);
308 Amg::Vector3D wireDir = toGap.linear()*tubeSurf->lineDirection(anygctx);
309 Amg::Vector3D localPropHit = newRecord.actsPropPos;
310 Amg::Vector3D dirPropHit = newRecord.actsPropDir;
311 double distToWire = Amg::lineDistance(wirePos, wireDir, localPropHit, dirPropHit);
312 newRecord.actsHitWireDist = distToWire;
313 }
314
315 }
316
317 propagatedHits.emplace_back(newRecord);
318
319 }
320
321
322 for (const auto&[segment, simHits] : muonSegmentWithSimHits) {
323 for(const xAOD::MuonSimHit* simHit : simHits){
324
325 const Identifier ID = simHit->identify();
326
327 const Amg::Vector3D localPos = xAOD::toEigen(simHit->localPosition());
328
329 const Amg::Vector3D globalPos = toGlobalTrf(*gctx, simHit->identify())*xAOD::toEigen(simHit->localPosition());
330 const Amg::Vector3D localDir = xAOD::toEigen(simHit->localDirection());
331
332 if(m_r4DetMgr->getReadoutElement(ID)->detectorType() == ActsTrk::DetectorType::sTgc && localPos.z() != 0.0){
333 continue;
334
335 }
336
337 m_detId.push_back(ID);
338 m_techIdx.push_back(toInt(m_idHelperSvc->technologyIndex(ID)));
339 m_gasGapId.push_back(layerHash(ID));
340
341 m_truthLoc.push_back(localPos);
342 m_truthDir.push_back(localDir);
343 m_truthGlob.push_back(globalPos);
344 m_startGlob.push_back(startPropPos);
345 ATH_MSG_DEBUG("Truth hit with ID: " << m_idHelperSvc->toString(ID)
346 << " at local position: " << Amg::toString(localPos)
347 << " and global position: " << Amg::toString(globalPos)
348 << " and direction: " << Amg::toString(localDir));
349
350 //get the matching propagated hits
351 auto it_begin = std::ranges::find_if(propagatedHits,
352 [this, ID](const auto& propagatedHit) {
353 return m_idHelperSvc->detElId(ID) == m_idHelperSvc->detElId(propagatedHit.id) &&
354 layerHash(ID) == layerHash(propagatedHit.id);
355 });
356 m_isPropagated.push_back(it_begin != propagatedHits.end());
357
358 if(it_begin == propagatedHits.end()){
359 m_actsPropLoc.push_back(dummyVec);
360 Amg::Vector3D zero = Amg::Vector3D::Zero();
361 m_actsPropDir.push_back(zero);
362 m_actsPropGlob.push_back(dummyVec);
363 m_actsPropabsMomentum.push_back(0.);
364 m_actsStepSize.push_back(0.);
365 m_actsHitWireDist.push_back(-1.);
366 continue;
367 }
368
369 //find - if any - propagated hits on the same layer
370 auto it_end = std::find_if(it_begin, propagatedHits.end(),
371 [this, ID](const auto& propagatedHit) {
372 return m_idHelperSvc->detElId(ID) != m_idHelperSvc->detElId(propagatedHit.id) ||
373 layerHash(ID) != layerHash(propagatedHit.id);
374 });
375
377 auto it = std::min_element(it_begin, it_end,
378 [&localPos](const PropagatorRecorder& a,
379 const PropagatorRecorder& b){
380 return (localPos - a.actsPropPos).mag() < (localPos - b.actsPropPos).mag();
381 });
382
383 ATH_MSG_DEBUG("Found propagated hit with ID: " << m_idHelperSvc->toString(it->id)
384 << " at local position: " << Amg::toString(it->actsPropPos)
385 << " and global position: " << Amg::toString(it->actsGlobalPos)
386 << " and direction: " << Amg::toString(it->actsPropDir));
387
388 m_actsPropLoc.push_back(it->actsPropPos);
389 m_actsPropDir.push_back(it->actsPropDir);
390 m_actsPropGlob.push_back(it->actsGlobalPos);
391 m_actsPropabsMomentum.push_back(it->actsPropabsMomentum);
392 m_actsStepSize.push_back(it->actsStepSize);
393 m_actsHitWireDist.push_back(it->actsHitWireDist);
394
395
396 }
397 }
398
399 m_event = ctx.eventID().event_number();
400 m_tree.fill(ctx);
401
402
403 }
404
405
406 return StatusCode::SUCCESS;
407 }
Scalar mag() const
mag method
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_ERROR(x)
#define ATH_MSG_VERBOSE(x)
#define ATH_MSG_WARNING(x)
#define ATH_MSG_DEBUG(x)
static Double_t a
Eigen::Matrix< double, 3, 1 > Vector3D
ElementLink< xAOD::MuonSegmentContainer > SegLink_t
MuonVal::ScalarBranch< unsigned int > & m_propSteps
MuonVal::VectorBranch< unsigned short > & m_isPropagated
MuonVal::VectorBranch< unsigned short > & m_gasGapId
MuonVal::VectorBranch< float > & m_actsHitWireDist
SG::ReadHandleKey< xAOD::TruthParticleContainer > m_truthParticleKey
const MuonGMR4::MuonDetectorManager * m_r4DetMgr
ServiceHandle< Muon::IMuonIdHelperSvc > m_idHelperSvc
Amg::Transform3D toGlobalTrf(const ActsTrk::GeometryContext &gctx, const Identifier &hitId) const
MuonVal::VectorBranch< float > & m_actsPropabsMomentum
SG::ReadCondHandleKey< AtlasFieldCacheCondObj > m_fieldCacheCondObjInputKey
IdentifierHash layerHash(const Identifier &id) const
MuonVal::ScalarBranch< unsigned int > & m_event
Amg::Transform3D toLocalTrf(const ActsTrk::GeometryContext &gctx, const Identifier &hitId) const
MuonVal::VectorBranch< unsigned short > & m_techIdx
SG::ReadCondHandleKey< MuonGM::MuonDetectorManager > m_detMgrKey
MuonVal::VectorBranch< float > & m_actsStepSize
PublicToolHandle< ActsTrk::ITrackingGeometryTool > m_trackingGeometryTool
Acts::GeometryContext context() const
Amg::Vector3D position() const
Returns the position as Amg::Vector.
Identifier identify() const
Returns the global ATLAS identifier of the SimHit.
ConstVectorMap< 3 > localPosition() const
Returns the local postion of the traversing particle.
float z() const
Vertex longitudinal distance along the beam line form the origin.
float y() const
Vertex y displacement.
float x() const
Vertex x displacement.
void zero(TH2 *h)
zero the contents of a 2d histogram
Acts::SympyStepper Stepper
Adapted from Acts Examples/Algorithms/TrackFinding/src/TrackFindingAlgorithmFunction....
constexpr double energyToActs(const double athenaE)
Converts an energy scalar from Athena to Acts units.
@ sTgc
Micromegas (NSW).
Acts::Logging::Level actsLevelVector(MSG::Level lvl)
std::string toString(const Translation3D &translation, int precision=4)
GeoPrimitvesToStringConverter.
double lineDistance(const AmgVector(N)&posA, const AmgVector(N)&dirA, const AmgVector(N)&posB, const AmgVector(N)&dirB)
: Calculates the shortest distance between two lines
Amg::Vector3D dirFromAngles(const double phi, const double theta)
Constructs a direction vector from the azimuthal & polar angles.
Eigen::Affine3d Transform3D
Eigen::Matrix< double, 3, 1 > Vector3D
std::unordered_set< const xAOD::MuonSimHit * > getMatchingSimHits(const xAOD::MuonSegment &segment)
: Returns all sim hits matched to a xAOD::MuonSegment
constexpr int toInt(const EnumType enumVal)
const T * get(const ReadCondHandleKey< T > &key, const EventContext &ctx)
Convenience function to retrieve an object given a ReadCondHandleKey.
constexpr ParticleHypothesis particle[PARTICLEHYPOTHESES]
the array of masses
void Zero(TH1D *hin)
Definition generate.cxx:32
ID
//////////////////////////////////////// JetAlgorithmType::ID defines most common physics jet finding...
TruthVertex_v1 TruthVertex
Typedef to implementation.
Definition TruthVertex.h:15
MuonSimHit_v1 MuonSimHit
Defined the version of the MuonSimHit.
Definition MuonSimHit.h:12
TruthParticle_v1 TruthParticle
Typedef to implementation.
MuonSegment_v1 MuonSegment
Reference the current persistent version:
TruthParticleContainer_v1 TruthParticleContainer
Declare the latest version of the truth particle container.

◆ 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 & 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.

51{
52 // If we didn't find any symlinks to add, just return the collection
53 // from the base class. Otherwise, return the extended collection.
54 if (!m_extendedExtraObjects.empty()) {
56 }
57 return Algorithm::extraOutputDeps();
58}
DataObjIDColl m_extendedExtraObjects

◆ filterPassed() [1/2]

bool AthAlgorithm::filterPassed ( ) const
inherited

Definition at line 94 of file AthAlgorithm.cxx.

94 {
95 return filterPassed( Gaudi::Hive::currentContext() );
96}
bool filterPassed() const

◆ filterPassed() [2/2]

bool AthAlgorithm::filterPassed ( const EventContext & ctx) const
inherited

Definition at line 98 of file AthAlgorithm.cxx.

98 {
99 return execState( ctx ).filterPassed();
100}

◆ finalize()

StatusCode ActsTrk::ActsMuonTrackingGeometryTest::finalize ( )
override

Definition at line 102 of file ActsMuonTrackingGeometryTest.cxx.

102 {
103 ATH_CHECK(m_tree.write());
104 return StatusCode::SUCCESS;
105 }

◆ getContext()

const EventContext & AthAlgorithm::getContext ( ) const
inherited

Deprecated methods (use the ones with EventContext).

Definition at line 90 of file AthAlgorithm.cxx.

90 {
91 return Gaudi::Hive::currentContext();
92}

◆ graph()

TGraph * AthHistogramming::graph ( const std::string & graphName,
const std::string & tDir = "",
const std::string & stream = "" )
protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 477 of file AthHistogramming.cxx.

478{
479 // Build a 32 bit hash out of the name
480 const hash_t graphHash = this->hash(graphName);
481
482 // See if this entry exists in the map
483 GraphMap_t::const_iterator it = m_graphMap.find( graphHash );
484 if ( it == m_graphMap.end() ) // It doesn't exist!
485 { // Let's see into the THistSvc if somebody else has registered the TGraph...
486
487 // Need to copy the strings as we will massage them from here on
488 std::string graphNameCopy = graphName;
489 std::string tDirCopy = tDir;
490 std::string streamCopy = stream;
491
492 // Massage the final string to book things
493 std::string bookingString("");
494 this->buildBookingString( bookingString, graphNameCopy, tDirCopy, streamCopy, true);
495
496 TGraph* graphPointer(NULL);
497 if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
498 {
499 // Massage the final string to book things
500 std::string bookingString("");
501 this->buildBookingString( bookingString, graphNameCopy, tDirCopy, streamCopy, false );
502
503 if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
504 {
505 m_msg << MSG::WARNING
506 << "Problem retrieving the TGraph with name (including pre- and post-fixes) "
507 << m_histNamePrefix + graphNameCopy + m_histNamePostfix
508 << " or with name " << graphNameCopy
509 << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
510 << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
511 return NULL;
512 }
513 // If we get to here, we actually found the TGraph in the THistSvc.
514 // So let's add it to the local cache map and return its pointer
515 m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphPointer ) );
516 return graphPointer;
517 }
518 // If we get to here, we actually found the TGraph in the THistSvc.
519 // So let's add it to the local cache map and return its pointer
520 m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphPointer ) );
521 return graphPointer;
522 }
523
524
525 // Return the pointer to the TGraph that we got from the local cache map
526 return it->second;
527}
std::pair< StatusCode, TGraph * > getGraph(ITHistSvc &svc, const std::string &name)

◆ hash()

AthHistogramming::hash_t AthHistogramming::hash ( const std::string & histName) const
inlineprivateinherited

Method to calculate a 32-bit hash from a string.

Definition at line 430 of file AthHistogramming.h.

431{
432 const uint64_t hash64 = CxxUtils::crc64( histName );
433 return (hash_t)(hash64 & 0xFFFFFFFF);
434}
uint64_t crc64(const CRCTable &table, const char *data, size_t data_len)
Find the CRC-64 of a string,.
Definition crc64.cxx:696
std::uint64_t hash64(const void *data, std::size_t size)
Passthrough to XXH3_64bits.
Definition XXH.cxx:9

◆ hist()

TH1 * AthHistogramming::hist ( const std::string & histName,
const std::string & tDir = "",
const std::string & stream = "" )
protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 183 of file AthHistogramming.cxx.

184{
185 // Build a 32 bit hash out of the name
186 const hash_t histHash = this->hash(histName);
187
188 // See if this entry exists in the map
189 HistMap_t::const_iterator it = m_histMap.find( histHash );
190 if ( it == m_histMap.end() ) // It doesn't exist!
191 { // Let's see into the THistSvc if somebody else has registered the histogram...
192
193 // Need to copy the strings as we will massage them from here on
194 std::string histNameCopy = histName;
195 std::string tDirCopy = tDir;
196 std::string streamCopy = stream;
197
198 // Massage the final string to book things
199 std::string bookingString("");
200 this->buildBookingString( bookingString, histNameCopy, tDirCopy, streamCopy ,false);
201
202 TH1* histPointer(NULL);
203 if ( !((histSvc()->getHist(bookingString, histPointer)).isSuccess()) )
204 {
205 // Massage the final string to book things
206 std::string bookingString("");
207 this->buildBookingString( bookingString, histNameCopy, tDirCopy, streamCopy, true );
208
209 if ( !((histSvc()->getHist(bookingString, histPointer)).isSuccess()) )
210 {
211 m_msg << MSG::WARNING
212 << "Problem retrieving the histogram with name (including pre- and post-fixes) "
213 << m_histNamePrefix + histNameCopy + m_histNamePostfix
214 << " or with name " << histNameCopy
215 << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
216 << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
217 return NULL;
218 }
219 // If we get to here, we actually found the histogram in the THistSvc.
220 // So let's add it to the local cache map and return its pointer
221 m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, histPointer ) );
222 return histPointer;
223 }
224 // If we get to here, we actually found the histogram in the THistSvc.
225 // So let's add it to the local cache map and return its pointer
226 m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, histPointer ) );
227 return histPointer;
228 }
229
230
231 // Return the pointer to the histogram that we got from the local cache map
232 return it->second;
233}
std::pair< StatusCode, TH1 * > getHist(ITHistSvc &svc, const std::string &name, size_t index=0)

◆ hist2d()

TH2 * AthHistogramming::hist2d ( const std::string & histName,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 371 of file AthHistogramming.h.

372{
373 // Get the TH1 pointer
374 TH1* th1Pointer = this->hist(histName, tDir, stream);
375 if ( !th1Pointer )
376 {
377 m_msg << MSG::ERROR
378 << "Cannot get a 2-d histogram with name " << histName
379 << "... will probably seg-fault!" << endmsg;
380 return NULL;
381 }
382 // If the TH1 pointer is valid, simply return the dynamic_cast
383 return dynamic_cast<TH2*>( th1Pointer );
384}

◆ hist3d()

TH3 * AthHistogramming::hist3d ( const std::string & histName,
const std::string & tDir = "",
const std::string & stream = "" )
inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 388 of file AthHistogramming.h.

389{
390 // Get the TH1 pointer
391 TH1* th1Pointer = this->hist(histName, tDir, stream);
392 if ( !th1Pointer )
393 {
394 m_msg << MSG::ERROR
395 << "Cannot get a 3-d histogram with name " << histName
396 << "... will probably seg-fault!" << endmsg;
397 return NULL;
398 }
399 // If the TH1 pointer is valid, simply return the dynamic_cast
400 return dynamic_cast<TH3*>( th1Pointer );
401}

◆ histSvc()

const ServiceHandle< ITHistSvc > & AthHistogramAlgorithm::histSvc ( ) const
inlineinherited

The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.

Definition at line 113 of file AthHistogramAlgorithm.h.

114{
115 return m_histSvc;
116}

◆ initialize()

StatusCode ActsTrk::ActsMuonTrackingGeometryTest::initialize ( )
override

Definition at line 85 of file ActsMuonTrackingGeometryTest.cxx.

85 {
86 ATH_CHECK(AthHistogramAlgorithm::initialize());
87 ATH_CHECK(m_idHelperSvc.retrieve());
89 ATH_CHECK(m_detMgrKey.initialize());
90 ATH_CHECK(m_rndmGenSvc.retrieve());
91 ATH_CHECK(m_geoCtxKey.initialize());
93 ATH_CHECK(m_truthParticleKey.initialize());
94 ATH_CHECK(m_truthSegLinkKey.initialize());
95 ATH_CHECK(detStore()->retrieve(m_r4DetMgr));
96
97 ATH_CHECK(m_tree.init(this));
98 ATH_MSG_INFO("ActsMuonTrackingGeometryTest successfully initialized");
99 return StatusCode::SUCCESS;
100 }
#define ATH_MSG_INFO(x)
SG::ReadDecorHandleKey< xAOD::TruthParticleContainer > m_truthSegLinkKey
const ServiceHandle< StoreGateSvc > & detStore() const

◆ 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.

◆ isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const
inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 111 of file AthAlgorithm.h.

111{ return false; }

◆ layerHash()

IdentifierHash ActsTrk::ActsMuonTrackingGeometryTest::layerHash ( const Identifier & id) const
private

Definition at line 80 of file ActsMuonTrackingGeometryTest.cxx.

80 {
81 return m_r4DetMgr->getReadoutElement(id)->layerHash(id);
82 }

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

24 {
25 return this->msgStream();
26 }

◆ msgLvl()

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

Definition at line 30 of file AthCommonMsg.h.

30 {
31 return this->msgLevel(lvl);
32 }

◆ myReplace()

void AthHistogramming::myReplace ( std::string & str,
const std::string & oldStr,
const std::string & newStr )
privateinherited

Helper method to replace sub-string.

Definition at line 575 of file AthHistogramming.cxx.

578{
579 size_t pos = 0;
580 while((pos = str.find(oldStr, pos)) != std::string::npos)
581 {
582 str.replace(pos, oldStr.length(), newStr);
583 pos += newStr.length();
584 }
585}

◆ 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.

381 {
382 h.renounce();
384 }
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)

◆ 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.

364 {
366 }

◆ setFilterPassed() [1/2]

void AthAlgorithm::setFilterPassed ( bool state) const
inherited

Definition at line 102 of file AthAlgorithm.cxx.

102 {
103 setFilterPassed( state, Gaudi::Hive::currentContext() );
104}
void setFilterPassed(bool state) const

◆ setFilterPassed() [2/2]

void AthAlgorithm::setFilterPassed ( bool state,
const EventContext & ctx ) const
inherited

Definition at line 106 of file AthAlgorithm.cxx.

106 {
107 execState( ctx ).setFilterPassed(state);
108}

◆ sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )
virtualinherited

Initialization method invoked by the framework.

This method is responsible for any bookkeeping of initialization required by the framework itself. It will in turn invoke the initialize() method of the derived algorithm, and of any sub-algorithms which it creates.

Reimplemented from AthAlgorithm.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

76{
77 // ---- stolen from GaudiKernel/Algorithm::sysInitialize -------
78 // Bypass the initialization if the algorithm
79 // has already been initialized.
80 if ( Gaudi::StateMachine::INITIALIZED <= FSMState() ) return StatusCode::SUCCESS;
81
82 // Set the Algorithm's properties
83 bindPropertiesTo( serviceLocator()->getOptsSvc() );
84
85 // Bypass the initialization if the algorithm is disabled.
86 // Need to do this after bindPropertiesTo.
87 if ( !isEnabled( ) ) return StatusCode::SUCCESS;
88
89 // ---- stolen from GaudiKernel/Algorithm::sysInitialize ------- END ---
90
91
92 // Get the THistSvc
93 ATH_CHECK ( histSvc().retrieve() );
94
95 // Configure the underlying AthHistogramming helper
100
101 // Print some setup information into the log file
102 ATH_MSG_DEBUG ("Initializing " << name() << "...");
103 ATH_MSG_DEBUG (" using THistService = " << m_histSvc );
104 ATH_MSG_DEBUG (" using RootStreamName = " << m_prefix );
105 ATH_MSG_DEBUG (" using RootDirName = " << m_rootDir );
106 ATH_MSG_DEBUG (" using HistNamePrefix = " << m_histNamePrefix );
107 ATH_MSG_DEBUG (" using HistNamePostfix = " << m_histNamePostfix );
108 ATH_MSG_DEBUG (" using HistTitlePrefix = " << m_histTitlePrefix );
109 ATH_MSG_DEBUG (" using HistTitlePostfix = " << m_histTitlePostfix );
110
111
112 // re-direct to base class...
114}
virtual StatusCode sysInitialize() override
Override sysInitialize.
const ServiceHandle< ITHistSvc > & histSvc() const
The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a...
StatusCode configAthHistogramming(const ServiceHandle< ITHistSvc > &histSvc, const std::string &prefix, const std::string &rootDir, const std::string &histNamePrefix, const std::string &histNamePostfix, const std::string &histTitlePrefix, const std::string &histTitlePostfix)
To be called by the derived classes to fill the internal configuration.

◆ 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.

◆ toGlobalTrf()

Amg::Transform3D ActsTrk::ActsMuonTrackingGeometryTest::toGlobalTrf ( const ActsTrk::GeometryContext & gctx,
const Identifier & hitId ) const
private

Definition at line 72 of file ActsMuonTrackingGeometryTest.cxx.

72 {
73 const MuonGMR4::MuonReadoutElement* reElement = m_r4DetMgr->getReadoutElement(hitId);
74 const IdentifierHash trfHash = reElement->detectorType() == ActsTrk::DetectorType::Mdt ?
75 reElement->measurementHash(hitId) : reElement->layerHash(hitId);
76 return reElement->localToGlobalTransform(gctx, trfHash);
77 }
virtual DetectorType detectorType() const =0
Returns the detector element type.
const Amg::Transform3D & localToGlobalTransform(const ActsTrk::GeometryContext &ctx) const
Returns the transformation from the local coordinate system of the readout element into the global AT...
virtual IdentifierHash measurementHash(const Identifier &measId) const =0
The measurement hash is a continous numbering schema of all readout channels described by the specifi...
virtual IdentifierHash layerHash(const Identifier &measId) const =0
The layer hash removes the bits from the IdentifierHash corresponding to the measurement's channel nu...
@ Mdt
MuonSpectrometer.

◆ toLocalTrf()

Amg::Transform3D ActsTrk::ActsMuonTrackingGeometryTest::toLocalTrf ( const ActsTrk::GeometryContext & gctx,
const Identifier & hitId ) const
private

Definition at line 65 of file ActsMuonTrackingGeometryTest.cxx.

65 {
66 const MuonGMR4::MuonReadoutElement* reElement = m_r4DetMgr->getReadoutElement(hitId);
67 const IdentifierHash trfHash = reElement->detectorType() == ActsTrk::DetectorType::Mdt ?
68 reElement->measurementHash(hitId) : reElement->layerHash(hitId);
69 return reElement->globalToLocalTransform(gctx, trfHash);
70 }
Amg::Transform3D globalToLocalTransform(const ActsTrk::GeometryContext &ctx) const
Returns the transformation from the global ATLAS coordinate system into the local coordinate system o...

◆ tree()

TTree * AthHistogramming::tree ( const std::string & treeName,
const std::string & tDir = "",
const std::string & stream = "" )
protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 363 of file AthHistogramming.cxx.

364{
365 // Build a 32 bit hash out of the name
366 const hash_t treeHash = this->hash(treeName);
367
368 // See if this entry exists in the map
369 TreeMap_t::const_iterator it = m_treeMap.find( treeHash );
370 if ( it == m_treeMap.end() ) // It doesn't exist!
371 { // Let's see into the THistSvc if somebody else has registered the TTree...
372
373 // Need to copy the strings as we will massage them from here on
374 std::string treeNameCopy = treeName;
375 std::string tDirCopy = tDir;
376 std::string streamCopy = stream;
377
378 // Massage the final string to book things
379 std::string bookingString("");
380 this->buildBookingString( bookingString, treeNameCopy, tDirCopy, streamCopy );
381
382 TTree* treePointer(NULL);
383 if ( !((histSvc()->getTree(bookingString, treePointer)).isSuccess()) )
384 {
385 m_msg << MSG::WARNING
386 << "Problem retrieving the TTree with name " << treeNameCopy
387 << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
388 << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
389 return NULL;
390 }
391 // If we get to here, we actually found the TTree in the THistSvc.
392 // So let's add it to the local cache map and return its pointer
393 m_treeMap.insert( m_treeMap.end(), std::pair< const hash_t, TTree* >( treeHash, treePointer ) );
394 return treePointer;
395 }
396
397 // Return the pointer to the TTree that we got from the local cache map
398 return it->second;
399}
std::pair< StatusCode, TTree * > getTree(ITHistSvc &svc, const std::string &name)

◆ updateVHKA()

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

Definition at line 308 of file AthCommonDataStore.h.

308 {
309 // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310 // << " size: " << m_vhka.size() << endmsg;
311 for (auto &a : m_vhka) {
313 for (auto k : keys) {
314 k->setOwner(this);
315 }
316 }
317 }

Member Data Documentation

◆ m_actsHitWireDist

MuonVal::VectorBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_actsHitWireDist {m_tree.newVector<float>("actsHitWireDist")}
private

Definition at line 106 of file ActsMuonTrackingGeometryTest.h.

106{m_tree.newVector<float>("actsHitWireDist")};

◆ m_actsPropabsMomentum

MuonVal::VectorBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_actsPropabsMomentum {m_tree.newVector<float>("actsPropabsMomentum")}
private

Definition at line 102 of file ActsMuonTrackingGeometryTest.h.

102{m_tree.newVector<float>("actsPropabsMomentum")};

◆ m_actsPropDir

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_actsPropDir {m_tree, "actsPropDir"}
private

Definition at line 105 of file ActsMuonTrackingGeometryTest.h.

105{m_tree, "actsPropDir"};

◆ m_actsPropGlob

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_actsPropGlob {m_tree, "actsPropGlob"}
private

Definition at line 104 of file ActsMuonTrackingGeometryTest.h.

104{m_tree, "actsPropGlob"};

◆ m_actsPropLoc

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_actsPropLoc {m_tree, "actsPropLoc"}
private

Definition at line 103 of file ActsMuonTrackingGeometryTest.h.

103{m_tree, "actsPropLoc"};

◆ m_actsStepSize

MuonVal::VectorBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_actsStepSize {m_tree.newVector<float>("actsStepSize")}
private

Definition at line 107 of file ActsMuonTrackingGeometryTest.h.

107{m_tree.newVector<float>("actsStepSize")};

◆ m_detId

MuonVal::MuonIdentifierBranch ActsTrk::ActsMuonTrackingGeometryTest::m_detId {m_tree, "detId"}
private

Definition at line 93 of file ActsMuonTrackingGeometryTest.h.

93{m_tree, "detId"};

◆ m_detMgrKey

SG::ReadCondHandleKey<MuonGM::MuonDetectorManager> ActsTrk::ActsMuonTrackingGeometryTest::m_detMgrKey
private
Initial value:
{this, "MuonManagerKey",
"MuonDetectorManager", "MuonManager ReadKey for IOV Range intersection"}

Definition at line 58 of file ActsMuonTrackingGeometryTest.h.

58 {this, "MuonManagerKey",
59 "MuonDetectorManager", "MuonManager ReadKey for IOV Range intersection"};

◆ 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_effMap

EffMap_t AthHistogramming::m_effMap
privateinherited

The map of histogram names to their pointers.

Definition at line 210 of file AthHistogramming.h.

◆ m_etaRange

Gaudi::Property<std::vector<double> > ActsTrk::ActsMuonTrackingGeometryTest::m_etaRange {this, "EtaRange", {-3, 3}, "The eta range for particles"}
private

Definition at line 90 of file ActsMuonTrackingGeometryTest.h.

90{this, "EtaRange", {-3, 3}, "The eta range for particles"};

◆ m_event

MuonVal::ScalarBranch<unsigned int>& ActsTrk::ActsMuonTrackingGeometryTest::m_event {m_tree.newScalar<unsigned int>("event")}
private

Definition at line 111 of file ActsMuonTrackingGeometryTest.h.

111{m_tree.newScalar<unsigned int>("event")};

◆ 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 AthAlgorithm::m_extendedExtraObjects
privateinherited

Definition at line 114 of file AthAlgorithm.h.

◆ m_fieldCacheCondObjInputKey

SG::ReadCondHandleKey<AtlasFieldCacheCondObj> ActsTrk::ActsMuonTrackingGeometryTest::m_fieldCacheCondObjInputKey
private
Initial value:
{this, "AtlasFieldCacheCondObj",
"fieldCondObj", "Name of the Magnetic Field conditions object key"}

Definition at line 61 of file ActsMuonTrackingGeometryTest.h.

61 {this, "AtlasFieldCacheCondObj",
62 "fieldCondObj", "Name of the Magnetic Field conditions object key"};

◆ m_gasGapId

MuonVal::VectorBranch<unsigned short>& ActsTrk::ActsMuonTrackingGeometryTest::m_gasGapId {m_tree.newVector<unsigned short>("detId_gasGap")}
private

Definition at line 95 of file ActsMuonTrackingGeometryTest.h.

95{m_tree.newVector<unsigned short>("detId_gasGap")};

◆ m_geoCtxKey

ActsTrk::GeoContextReadKey_t ActsTrk::ActsMuonTrackingGeometryTest::m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}
private

Definition at line 64 of file ActsMuonTrackingGeometryTest.h.

64{this, "AlignmentKey", "ActsAlignment", "cond handle key"};

◆ m_graphMap

GraphMap_t AthHistogramming::m_graphMap
privateinherited

The map of TGraph names to their pointers.

Definition at line 224 of file AthHistogramming.h.

◆ m_histMap

HistMap_t AthHistogramming::m_histMap
privateinherited

The map of histogram names to their pointers.

Definition at line 203 of file AthHistogramming.h.

◆ m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix
privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

◆ m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix
privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

◆ m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc
privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

◆ m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix
privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

◆ m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix
privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

◆ m_idHelperSvc

ServiceHandle<Muon::IMuonIdHelperSvc> ActsTrk::ActsMuonTrackingGeometryTest::m_idHelperSvc {this, "IdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}
private

Definition at line 52 of file ActsMuonTrackingGeometryTest.h.

52{this, "IdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"};

◆ m_isPropagated

MuonVal::VectorBranch<unsigned short>& ActsTrk::ActsMuonTrackingGeometryTest::m_isPropagated {m_tree.newVector<unsigned short>("isPropagated")}
private

Definition at line 109 of file ActsMuonTrackingGeometryTest.h.

109{m_tree.newVector<unsigned short>("isPropagated")};

◆ m_maxSteps

UnsignedIntegerProperty ActsTrk::ActsMuonTrackingGeometryTest::m_maxSteps {this, "MaxSteps", 100000}
private

Definition at line 76 of file ActsMuonTrackingGeometryTest.h.

76{this, "MaxSteps", 100000};

◆ m_maxStepSize

DoubleProperty ActsTrk::ActsMuonTrackingGeometryTest::m_maxStepSize {this, "MaxStepSize", 1*Gaudi::Units::m}
private

Definition at line 74 of file ActsMuonTrackingGeometryTest.h.

74{this, "MaxStepSize", 1*Gaudi::Units::m};

◆ m_maxTargetSkipping

UnsignedIntegerProperty ActsTrk::ActsMuonTrackingGeometryTest::m_maxTargetSkipping {this, "MaxTargetSkipping", 10000}
private

Definition at line 78 of file ActsMuonTrackingGeometryTest.h.

78{this, "MaxTargetSkipping", 10000};

◆ m_msg

MsgStream AthHistogramming::m_msg
privateinherited

Cached Message Stream.

Definition at line 250 of file AthHistogramming.h.

◆ m_name

std::string AthHistogramming::m_name
privateinherited

Instance name.

Definition at line 247 of file AthHistogramming.h.

◆ m_nEvents

UnsignedIntegerProperty ActsTrk::ActsMuonTrackingGeometryTest::m_nEvents {this, "nEvents", 100}
private

Definition at line 70 of file ActsMuonTrackingGeometryTest.h.

70{this, "nEvents", 100};

◆ m_pathLimit

DoubleProperty ActsTrk::ActsMuonTrackingGeometryTest::m_pathLimit {this, "PathLimit", 30.*Gaudi::Units::m}
private

Definition at line 72 of file ActsMuonTrackingGeometryTest.h.

72{this, "PathLimit", 30.*Gaudi::Units::m};

◆ m_prefix

std::string AthHistogramAlgorithm::m_prefix
privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

◆ m_propLength

MuonVal::ScalarBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_propLength {m_tree.newScalar<float>("propLength")}
private

Definition at line 108 of file ActsMuonTrackingGeometryTest.h.

108{m_tree.newScalar<float>("propLength")};

◆ m_propSteps

MuonVal::ScalarBranch<unsigned int>& ActsTrk::ActsMuonTrackingGeometryTest::m_propSteps {m_tree.newScalar<unsigned int>("propSteps")}
private

Definition at line 110 of file ActsMuonTrackingGeometryTest.h.

110{m_tree.newScalar<unsigned int>("propSteps")};

◆ m_r4DetMgr

const MuonGMR4::MuonDetectorManager* ActsTrk::ActsMuonTrackingGeometryTest::m_r4DetMgr {nullptr}
private

Definition at line 50 of file ActsMuonTrackingGeometryTest.h.

50{nullptr};

◆ m_rndmGenSvc

ServiceHandle<IAthRNGSvc> ActsTrk::ActsMuonTrackingGeometryTest::m_rndmGenSvc {this, "AthRNGSvc", "AthRNGSvc"}
private

Definition at line 54 of file ActsMuonTrackingGeometryTest.h.

54{this, "AthRNGSvc", "AthRNGSvc"};

◆ m_rootDir

std::string AthHistogramAlgorithm::m_rootDir
privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

◆ m_startFromFirstHit

Gaudi::Property<bool> ActsTrk::ActsMuonTrackingGeometryTest::m_startFromFirstHit {this, "StartFromFirstHit", false, "Start from first hit"}
private

Definition at line 82 of file ActsMuonTrackingGeometryTest.h.

82{this, "StartFromFirstHit", false, "Start from first hit"};

◆ m_startGlob

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_startGlob {m_tree, "startGlob"}
private

Definition at line 101 of file ActsMuonTrackingGeometryTest.h.

101{m_tree, "startGlob"};

◆ m_stepTolerance

DoubleProperty ActsTrk::ActsMuonTrackingGeometryTest::m_stepTolerance {this, "StepTolerance", 1e-10}
private

Definition at line 80 of file ActsMuonTrackingGeometryTest.h.

80{this, "StepTolerance", 1e-10};

◆ m_streamName

std::string AthHistogramming::m_streamName
privateinherited

Name of the ROOT output stream (file).

Definition at line 228 of file AthHistogramming.h.

◆ m_techIdx

MuonVal::VectorBranch<unsigned short>& ActsTrk::ActsMuonTrackingGeometryTest::m_techIdx {m_tree.newVector<unsigned short>("detId_techIdx")}
private

Definition at line 94 of file ActsMuonTrackingGeometryTest.h.

94{m_tree.newVector<unsigned short>("detId_techIdx")};

◆ m_trackingGeometryTool

PublicToolHandle<ActsTrk::ITrackingGeometryTool> ActsTrk::ActsMuonTrackingGeometryTest::m_trackingGeometryTool {this, "TrackingGeometryTool", "ActsTrackingGeometryTool"}
private

Definition at line 56 of file ActsMuonTrackingGeometryTest.h.

56{this, "TrackingGeometryTool", "ActsTrackingGeometryTool"};

◆ m_tree

MuonVal::MuonTesterTree ActsTrk::ActsMuonTrackingGeometryTest::m_tree {"MuonNavigationTestGen3R4", "MuonNavigationTestGen3R4"}
private

Definition at line 92 of file ActsMuonTrackingGeometryTest.h.

92{"MuonNavigationTestGen3R4", "MuonNavigationTestGen3R4"};

◆ m_treeMap

TreeMap_t AthHistogramming::m_treeMap
privateinherited

The map of TTree names to their pointers.

Definition at line 217 of file AthHistogramming.h.

◆ m_truthDir

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_truthDir {m_tree, "truthDir"}
private

Definition at line 98 of file ActsMuonTrackingGeometryTest.h.

98{m_tree, "truthDir"};

◆ m_truthGlob

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_truthGlob {m_tree, "truthGlob"}
private

Definition at line 97 of file ActsMuonTrackingGeometryTest.h.

97{m_tree, "truthGlob"};

◆ m_truthLoc

MuonVal::ThreeVectorBranch ActsTrk::ActsMuonTrackingGeometryTest::m_truthLoc {m_tree, "truthLoc"}
private

Definition at line 96 of file ActsMuonTrackingGeometryTest.h.

96{m_tree, "truthLoc"};

◆ m_truthP

MuonVal::ScalarBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_truthP {m_tree.newScalar<float>("truthP")}
private

Definition at line 100 of file ActsMuonTrackingGeometryTest.h.

100{m_tree.newScalar<float>("truthP")};

◆ m_truthParticleKey

SG::ReadHandleKey<xAOD::TruthParticleContainer> ActsTrk::ActsMuonTrackingGeometryTest::m_truthParticleKey {this, "TruthKey", "MuonTruthParticles"}
private

Definition at line 66 of file ActsMuonTrackingGeometryTest.h.

66{this, "TruthKey", "MuonTruthParticles"};

◆ m_truthPt

MuonVal::ScalarBranch<float>& ActsTrk::ActsMuonTrackingGeometryTest::m_truthPt {m_tree.newScalar<float>("truthPt")}
private

Definition at line 99 of file ActsMuonTrackingGeometryTest.h.

99{m_tree.newScalar<float>("truthPt")};

◆ m_truthSegLinkKey

SG::ReadDecorHandleKey<xAOD::TruthParticleContainer> ActsTrk::ActsMuonTrackingGeometryTest::m_truthSegLinkKey {this, "TruthKeyToSeg", m_truthParticleKey, "truthSegmentLinks", "TruthParticle to TruthSegment link"}
private

Definition at line 68 of file ActsMuonTrackingGeometryTest.h.

68{this, "TruthKeyToSeg", m_truthParticleKey, "truthSegmentLinks", "TruthParticle to TruthSegment link"};

◆ 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: