MuonR4::BucketDumperAlg Class Reference

#include <BucketDumperAlg.h>

Inheritance diagram for MuonR4::BucketDumperAlg:

Public Member Functions
	~BucketDumperAlg ()=default
virtual StatusCode	initialize () override final
virtual StatusCode	finalize () override final
virtual StatusCode	execute (const EventContext &ctx) override final
	Execute method.
	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 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.
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 to fill the internal configuration.
TH1 *	bookGetPointer (const TH1 &hist, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TH1 *	bookGetPointer (TH1 *hist, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TH1 *	bookGetPointer (TH1 &histRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TTree *	bookGetPointer (const TTree &treeRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TTrees.
TGraph *	bookGetPointer (const TGraph &graphRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs.
TEfficiency *	bookGetPointer (const TEfficiency &eff, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency *	bookGetPointer (TEfficiency *eff, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency *	bookGetPointer (TEfficiency &effRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (const TH1 &hist, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (TH1 *hist, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (TH1 &histRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (const TTree &treeRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TTrees.
StatusCode	book (const TGraph &graphRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs.
StatusCode	book (const TEfficiency &eff, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (TEfficiency *eff, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (TEfficiency &effRef, std::string_view tDir="", std::string_view stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TH1 *	hist (std::string_view histName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered histograms of any type.
TH2 *	hist2d (std::string_view histName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered 2-d histograms.
TH3 *	hist3d (std::string_view histName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered 3-d histograms.
TTree *	tree (std::string_view treeName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered TTrees.
TGraph *	graph (std::string_view graphName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered TGraphs.
TEfficiency *	efficiency (std::string_view effName, std::string_view tDir="", std::string_view stream="")
	Simplify the retrieval of registered TEfficiency.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_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
StatusCode	dumpContainer (const EventContext &ctx, const SG::ReadHandleKey< SpacePointContainer > &spacePointKey, const SG::ReadHandleKey< xAOD::MuonSegmentContainer > &segmentKey)
	Dumps the space point container with the associated muon segment container.
StatusCode	computeAllBucketScores (const EventContext &ctx, const SpacePointContainer *spContainer, std::unordered_map< const SpacePointBucket *, std::vector< float > > &bucketScoreMap) const
	Computes ML bucket scores using the inference tool for a specific container.
CLHEP::HepRandomEngine *	getRandomEngine (const EventContext &ctx) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>
std::string	buildBookingString (std::string_view histName, std::string_view tDir, std::string_view stream, bool usePrefixPostfix=false) const
	Method to build individual booking string.
hash_t	hash (std::string_view histName) const
	Method to calculate a 32-bit hash from a string.

Private Attributes
SG::ReadHandleKeyArray< SpacePointContainer >	m_spacePointKeys
SG::ReadHandleKeyArray< xAOD::MuonSegmentContainer >	m_inSegmentKeys {this, "SegmentKey", {"MsSegments"}}
SG::ReadDecorHandleKeyArray< xAOD::MuonSegmentContainer >	m_truthDecorKeys {this, "TruthDecorLinks", {}}
ActsTrk::GeoContextReadKey_t	m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}
Gaudi::Property< bool >	m_isMC {this, "isMC", true}
Gaudi::Property< double >	m_fracToKeep {this,"dataFracToKeep", 1.}
Gaudi::Property< std::string >	m_streamName {this, "StreamName", ""}
Gaudi::Property< bool >	m_doMLBucketScore
Gaudi::Property< bool >	m_doMLBucketFilter
ServiceHandle< IAthRNGSvc >	m_rndmSvc {this, "RndmSvc", "AthRNGSvc", ""}
ToolHandle< MuonML::IGraphInferenceTool >	m_inferenceTool
	Inference tool for ML bucket scoring (optional).
ToolHandle< MuonValR4::IPatternVisualizationTool >	m_visionTool {this, "VisualizationTool", ""}
	Pattern visualization tool.
MuonVal::MuonTesterTree	m_tree {"MuonBucketDump","MuonBucketDump"}
MuonVal::ScalarBranch< float > &	m_bucket_min {m_tree.newScalar<float>("bucket_min", -1)}
MuonVal::ScalarBranch< float > &	m_bucket_max {m_tree.newScalar<float>("bucket_max", -1)}
MuonVal::ScalarBranch< uint16_t > &	m_bucket_spacePoints {m_tree.newScalar<uint16_t>("bucket_spacePoints", 0)}
MuonVal::ScalarBranch< uint16_t > &	m_bucket_segments {m_tree.newScalar<uint16_t>("bucket_segments", 0)}
MuonVal::ScalarBranch< uint16_t > &	m_bucket_layers {m_tree.newScalar<uint16_t>("bucket_layers", 0)}
MuonVal::ScalarBranch< uint8_t > &	m_bucket_truthHit {m_tree.newScalar<uint8_t>("bucket_hasTruth", 0)}
MuonVal::ScalarBranch< float > &	m_bucket_posX {m_tree.newScalar<float>("bucket_positionX")}
MuonVal::ScalarBranch< float > &	m_bucket_posY {m_tree.newScalar<float>("bucket_positionY")}
MuonVal::ScalarBranch< float > &	m_bucket_posZ {m_tree.newScalar<float>("bucket_positionZ")}
MuonVal::ScalarBranch< uint8_t > &	m_bucket_sector {m_tree.newScalar<uint8_t>("bucket_sector")}
MuonVal::ScalarBranch< uint8_t > &	m_bucket_chamberIdx {m_tree.newScalar<uint8_t>("bucket_chamberIndex")}
MuonVal::ScalarBranch< Char_t > &	m_bucket_side {m_tree.newScalar<Char_t>("bucket_side")}
MuonVal::VectorBranch< float > &	m_bucket_ml_score_class0 {m_tree.newVector<float>("bucket_ml_score_class0", false)}
	ML bucket filter scores (3 classes for the filter model).
MuonVal::VectorBranch< float > &	m_bucket_ml_score_class1 {m_tree.newVector<float>("bucket_ml_score_class1", false)}
MuonVal::VectorBranch< float > &	m_bucket_ml_score_class2 {m_tree.newVector<float>("bucket_ml_score_class2", false)}
MuonVal::ThreeVectorBranch	m_spoint_localPosition {m_tree, "localPosition"}
MuonVal::ThreeVectorBranch	m_spoint_globalPosition {m_tree, "globalPosition"}
MuonVal::MuonIdentifierBranch	m_spoint_id {m_tree, "id"}
MuonVal::VectorBranch< uint16_t > &	m_spoint_layer {m_tree.newVector<uint16_t>("Layer")}
MuonVal::VectorBranch< unsigned short > &	m_spoint_isStrip {m_tree.newVector<unsigned short>("isStrip", false)}
MuonVal::VectorBranch< unsigned short > &	m_spoint_isMdt {m_tree.newVector<unsigned short>("isMdt", false)}
MuonVal::VectorBranch< uint16_t > &	m_spoint_adc {m_tree.newVector<uint16_t>("adc")}
MuonVal::VectorBranch< uint16_t > &	m_spoint_tdc {m_tree.newVector<uint16_t>("tdc")}
MuonVal::VectorBranch< float > &	m_spoint_covX {m_tree.newVector<float>("covX")}
MuonVal::VectorBranch< float > &	m_spoint_covY {m_tree.newVector<float>("covY")}
MuonVal::VectorBranch< float > &	m_spoint_driftR {m_tree.newVector<float>("driftR")}
MuonVal::VectorBranch< unsigned short > &	m_spoint_measuresEta {m_tree.newVector<unsigned short>("measuresEta")}
MuonVal::VectorBranch< unsigned short > &	m_spoint_measuresPhi {m_tree.newVector<unsigned short>("measuresPhi")}
MuonVal::VectorBranch< unsigned short > &	m_spoint_trueLabel {m_tree.newVector<unsigned short>("trueLabel")}
MuonVal::VectorBranch< unsigned int > &	m_spoint_nEtaInstances {m_tree.newVector<unsigned int>("nEtaInUse")}
MuonVal::VectorBranch< unsigned int > &	m_spoint_nPhiInstances {m_tree.newVector<unsigned int>("nPhiInUse")}
MuonVal::VectorBranch< unsigned int > &	m_spoint_dimension {m_tree.newVector<unsigned int>("dimension")}
MuonVal::VectorBranch< uint16_t > &	m_spoint_nSegments {m_tree.newVector<uint16_t>("nSegments")}
MuonVal::MatrixBranch< int16_t > &	m_spoint_mat {m_tree.newMatrix<int16_t>("sp_seg_matching",-1)}
MuonVal::MatrixBranch< int16_t > &	m_spoint_trueSeg {m_tree.newMatrix<int16_t>("spacePoint_truthSegLink",-1)}
MuonVal::VectorBranch< float > &	m_segmentLocX {m_tree.newVector<float>("segmentLocalX")}
MuonVal::VectorBranch< float > &	m_segmentLocY {m_tree.newVector<float>("segmentLocalY")}
MuonVal::VectorBranch< float > &	m_segmentLocTheta {m_tree.newVector<float>("segmentLocalTheta")}
MuonVal::VectorBranch< float > &	m_segmentLocPhi {m_tree.newVector<float>("segmentLocalPhi")}
MuonVal::VectorBranch< uint16_t > &	m_segmentTruthIdx {m_tree.newVector<uint16_t>("segmentTruthPart")}
MuonVal::ThreeVectorBranch	m_segmentPos {m_tree, "segmentPosition"}
MuonVal::ThreeVectorBranch	m_segmentDir {m_tree, "segmentDirection"}
MuonVal::VectorBranch< float > &	m_segment_chiSquared {m_tree.newVector<float>("segment_chiSquared")}
MuonVal::VectorBranch< float > &	m_segment_numberDoF {m_tree.newVector<float>("segment_numberDoF")}
MuonVal::VectorBranch< float > &	m_truthSegLocX {m_tree.newVector<float>("truthSegmentLocalX")}
MuonVal::VectorBranch< float > &	m_truthSegLocY {m_tree.newVector<float>("truthSegmentLocalY")}
MuonVal::VectorBranch< float > &	m_truthSegLocTheta {m_tree.newVector<float>("truthSegmentLocalTheta")}
MuonVal::VectorBranch< float > &	m_truthSegLocPhi {m_tree.newVector<float>("truthSegmentLocalPhi")}
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
	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
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_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Detailed Description

Definition at line 35 of file BucketDumperAlg.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 199 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 213 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 192 of file AthHistogramming.h.

StoreGateSvc_t

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

privateinherited

Definition at line 376 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 206 of file AthHistogramming.h.

Constructor & Destructor Documentation

~BucketDumperAlg()

MuonR4::BucketDumperAlg::~BucketDumperAlg ( )

default

Member Function Documentation

AthHistogramAlgorithm()

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

Constructor with parameters:

Definition at line 40 of file AthHistogramAlgorithm.cxx.

                                                                         : 
  ::AthAlgorithm( name, pSvcLocator ),
  ::AthHistogramming( name ),
  m_histSvc ( "THistSvc/THistSvc", name )
{
  //
  // Property declaration
  // 
  // The histogram service
  declareProperty("THistSvc",
                  m_histSvc = ServiceHandle<ITHistSvc>("THistSvc/THistSvc", name),
                  "Handle to a THistSvc instance: it will be used to write "
                  "ROOT objects to ROOT files" );
  //  declareProperty("THistService",      m_histSvc, "The THistSvc" );
  
  declareProperty("RootStreamName",    m_prefix  = "/ANALYSIS", "Name of the output ROOT stream (file) that the THistSvc uses");
  declareProperty("RootDirName",       m_rootDir = "",
                  "Name of the ROOT directory inside the ROOT file where the histograms will go");
 
  declareProperty( "HistNamePrefix",   m_histNamePrefix  = "", "The prefix for the histogram THx name" );
  declareProperty( "HistNamePostfix",  m_histNamePostfix = "",      "The postfix for the histogram THx name" );
 
  declareProperty( "HistTitlePrefix",  m_histTitlePrefix  = "", "The prefix for the histogram THx title" );
  declareProperty( "HistTitlePostfix", m_histTitlePostfix = "", "The postfix for the histogram THx title" );
}

book() [1/8]

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

inlineprotectedinherited

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

Definition at line 329 of file AthHistogramming.h.

{
  // We need to create a non-const clone
  TEfficiency* effClone = dynamic_cast< TEfficiency* >( eff.Clone() );
  if ( !effClone ) {
    m_msg << MSG::ERROR << "Couldn't create a TEfficiency clone" << endmsg;
    return StatusCode::FAILURE;
  }
  return this->book( *effClone, tDir, stream );
}

book() [2/8]

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

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 297 of file AthHistogramming.h.

{
  // We need to create a non-const clone
  TH1* histClone = dynamic_cast< TH1* >( hist.Clone() );
  if ( !histClone ) {
    m_msg << MSG::ERROR << "Couldn't create a TH1 clone" << endmsg;
    return StatusCode::FAILURE;
  }
  return this->book( *histClone, tDir, stream );
}

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 397 of file AthHistogramming.h.

{
  // Call the other Book method and see if it returns a valid pointer
  TTree* treePointer = this->bookGetPointer( treeRef, tDir, stream );
  if ( treePointer )
    {
      return StatusCode::SUCCESS;
    }
  else
    {
      return StatusCode::FAILURE;
    }
}

book() [5/8]

StatusCode AthHistogramming::book ( TEfficiency & effRef, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 350 of file AthHistogramming.h.

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

book() [6/8]

StatusCode AthHistogramming::book ( TEfficiency * eff, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 340 of file AthHistogramming.h.

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

book() [7/8]

StatusCode AthHistogramming::book ( TH1 & histRef, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 318 of file AthHistogramming.h.

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

book() [8/8]

StatusCode AthHistogramming::book ( TH1 * hist, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 308 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 275 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 374 of file AthHistogramming.cxx.

{
  // Get a pointer
  const TGraph* graphPointer = &graphRef;
 
  // Check that we got a valid pointer
  if ( !graphPointer )
    {
      m_msg << MSG::WARNING
            << "We got an invalid TGraph pointer in the BookGetPointer(TGraph*) method of the class" << m_name
            << "!" << endmsg;
      return NULL;
    }
 
  // Modify the name and title according to the prefixes of this classes instance
  std::string graphName  = graphPointer->GetName();
  const std::string graphTitle = graphPointer->GetTitle();
 
  // Check if the hash for this graphName already exists, i.e., if we have a hash collision
  const hash_t graphHash = this->hash(graphName);
  GraphMap_t::const_iterator it = m_graphMap.find( graphHash );
  if ( it != m_graphMap.end() ) // It does exist!
    {
      m_msg << MSG::WARNING
            << "Detected a hash collision. The hash for the TGraph with name=" << graphName
            << " already exists and points to a TGraph with name=" << it->second->GetName()
            << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
      return NULL;
    }
 
  // Create a clone that has the new name
  TGraph* graphClone = dynamic_cast< TGraph* >( graphPointer->Clone((m_histNamePrefix+graphName+m_histNamePostfix).c_str()) );
  if( !graphClone )
    {
      m_msg << MSG::WARNING
            << "We couldn't clone the TGraph in the BookGetPointer(TGraph&) method of the class" << m_name
            << "!" << endmsg;
      return NULL;
    }
  graphClone->SetTitle ((m_histTitlePrefix+graphTitle+m_histTitlePostfix).c_str());
 
  // Massage the final string to book things
  std::string bookingString = buildBookingString( graphName, tDir, stream );
 
  // Register the TGraph into the THistSvc
  if ( !((histSvc()->regGraph(bookingString, graphClone)).isSuccess()) )
    {
      m_msg << MSG::WARNING
            << "Problem registering TGraph with name " << graphName
            << ", title " << graphTitle
            << " in " << m_name << "!" << endmsg;
      return NULL;
    }
 
  // Also register it in the local map of string to pointer
  m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphClone ) );
 
  return graphClone;
}

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 254 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 268 of file AthHistogramming.cxx.

{
  // Get a pointer
  const TTree* treePointer = &treeRef;
 
  // Check that we got a valid pointer
  if ( !treePointer )
    {
      m_msg << MSG::WARNING
            << "We got an invalid TTree pointer in the BookGetPointer(TTree*) method of the class" << m_name
            << "!" << endmsg;
      return NULL;
    }
 
  // Modify the name and title according to the prefixes of this classes instance
  std::string treeName  = treePointer->GetName();
  const std::string treeTitle = treePointer->GetTitle();
 
  // Check if the hash for this treeName already exists, i.e., if we have a hash collision
  const hash_t treeHash = this->hash(treeName);
  TreeMap_t::const_iterator it = m_treeMap.find( treeHash );
  if ( it != m_treeMap.end() ) // It does exist!
    {
      m_msg << MSG::WARNING
            << "Detected a hash collision. The hash for the TTree with name=" << treeName
            << " already exists and points to a TTree with name=" << it->second->GetName()
            << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
      return NULL;
    }
 
  // Create a clone that has the new name
  TTree* treeClone = dynamic_cast< TTree* >( treePointer->Clone(treeName.c_str()) );
  if( !treeClone )
    {
      m_msg << MSG::WARNING
            << "We couldn't clone the TTree in the BookGetPointer(TTree&) method of the class" << m_name
            << "!" << endmsg;
      return NULL;
    }
  treeClone->SetTitle (treeTitle.c_str());
 
  // Massage the final string to book things
  std::string bookingString = buildBookingString( treeName, tDir, stream );
 
  // Register the TTree into the THistSvc
  if ( !((histSvc()->regTree(bookingString, treeClone)).isSuccess()) )
    {
      m_msg << MSG::WARNING
            << "Problem registering TTree with name " << treeName
            << ", title " << treeTitle
            << " in " << m_name << "!" << endmsg;
      return NULL;
    }
 
  // Also register it in the local map of string to pointer
  m_treeMap.insert( m_treeMap.end(), std::pair< const hash_t, TTree* >( treeHash, treeClone ) );
 
  return treeClone;
}

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 139 of file AthHistogramming.cxx.

{
  std::string originalName{effRef.GetName()};
  const auto effName = splitName(originalName).second;
  const std::string effTitle(effRef.GetTitle());
  std::string bookingString = buildBookingString(originalName, tDir, stream);
  std::string finalEffName{m_histNamePrefix};
  finalEffName += effName;
  finalEffName += m_histNamePostfix;
  effRef.SetTitle((m_histTitlePrefix + effTitle + m_histTitlePostfix).c_str());
  effRef.SetName(finalEffName.c_str());
 
  const hash_t effHash = this->hash(effName);
  EffMap_t::const_iterator it = m_effMap.find(effHash);
  if (it != m_effMap.end()) {
    m_msg << MSG::WARNING
          << "Detected a hash collision. The hash for the TEfficiency with name=" << effName
          << " already exists and points to a TEfficiency with name=" << it->second->GetName()
          << " NOT going to book the new TEfficiency and returning a NULL pointer!" << endmsg;
    return nullptr;
  }
 
  if (!histSvc()->regEfficiency(bookingString, &effRef).isSuccess()) {
    m_msg << MSG::WARNING
          << "Problem registering TEfficiency with name " << effName
          << ", name prefix " << m_histNamePrefix
          << ", title " << effTitle
          << ", title prefix " << m_histTitlePrefix
          << ", and title postfix " << m_histTitlePostfix
          << " in " << m_name << "!" << endmsg;
    return nullptr;
  }
 
  m_effMap.insert(m_effMap.end(), std::pair<const hash_t, TEfficiency*>(effHash, &effRef));
 
  return &effRef;
}

bookGetPointer() [6/8]

TEfficiency * AthHistogramming::bookGetPointer ( TEfficiency * eff, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 287 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 97 of file AthHistogramming.cxx.

                                                                                          {
  
  const std::string originalName{histRef.GetName()};
  const auto histName = splitName(originalName).second;
  
  const std::string histTitle(histRef.GetTitle());
  std::string bookingString = buildBookingString(originalName, tDir, stream);
 
  std::string finalHistName{m_histNamePrefix};
  finalHistName += histName;
  finalHistName += m_histNamePostfix;
 
  histRef.SetTitle((m_histTitlePrefix + histTitle + m_histTitlePostfix).c_str());
  histRef.SetName(finalHistName.c_str());
 
  const hash_t histHash = this->hash(histName);
  HistMap_t::const_iterator it = m_histMap.find(histHash);
  if (it != m_histMap.end()) {
    m_msg << MSG::WARNING
          << "Detected a hash collision. The hash for the histogram with name=" << histName
          << " already exists and points to a histogram with name=" << it->second->GetName()
          << " NOT going to book the new histogram and returning a NULL pointer!" << endmsg;
    return nullptr;
  }
 
  if (!histSvc()->regHist(bookingString, &histRef).isSuccess()) {
    m_msg << MSG::WARNING
          << "Problem registering histogram with name " << histName
          << ", name prefix " << m_histNamePrefix
          << ", title " << histTitle
          << ", title prefix " << m_histTitlePrefix
          << ", and title postfix " << m_histTitlePostfix
          << " in " << m_name << "!" << endmsg;
    return nullptr;
  }
 
  m_histMap.insert(m_histMap.end(), std::pair<const hash_t, TH1*>(histHash, &histRef));
 
  return &histRef;
}

bookGetPointer() [8/8]

TH1 * AthHistogramming::bookGetPointer ( TH1 * hist, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

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

Definition at line 266 of file AthHistogramming.h.

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

buildBookingString()

std::string AthHistogramming::buildBookingString ( std::string_view histName, std::string_view tDir, std::string_view stream, bool usePrefixPostfix = false ) const

privateinherited

Method to build individual booking string.

Definition at line 500 of file AthHistogramming.cxx.

                                                     {
  if (tDir.empty()) {
    tDir = m_rootDir;
  }
  if (stream.empty()) {
    stream = m_streamName;
  }
  const auto [histDir, baseName] = splitName(histName);
  std::string bookingString{"/"};
  bookingString += stream;
  bookingString += '/';
  bookingString += tDir;
  if (!histDir.empty()) {
    bookingString += '/';
    bookingString += histDir;
  }
  bookingString += '/';
  if (usePrefixPostfix) {
    bookingString += m_histNamePrefix;
  }
  bookingString += baseName;
  if (usePrefixPostfix) {
    bookingString += m_histNamePostfix;
  }
  const auto tail = std::ranges::unique(
    bookingString, [](char lhs, char rhs) { return lhs == '/' && rhs == '/'; });
  bookingString.erase(tail.begin(), tail.end());
  return bookingString;
}

computeAllBucketScores()

StatusCode MuonR4::BucketDumperAlg::computeAllBucketScores ( const EventContext & ctx, const SpacePointContainer * spContainer, std::unordered_map< const SpacePointBucket *, std::vector< float > > & bucketScoreMap ) const

private

Computes ML bucket scores using the inference tool for a specific container.

Definition at line 338 of file BucketDumperAlg.cxx.

                                                                                                                                          {
        bucketScoreMap.clear();
        
        ATH_MSG_DEBUG("computeAllBucketScores: doMLBucketScore=" << m_doMLBucketScore 
                      << ", tool empty=" << m_inferenceTool.empty() 
                      << ", spContainer=" << (spContainer ? "valid" : "null"));
        
        if (!m_doMLBucketScore || m_inferenceTool.empty() || !spContainer) {
            return StatusCode::SUCCESS;
        }
        
        // Count non-empty buckets
        size_t nonEmptyBuckets = 0;
        for (const MuonR4::SpacePointBucket* bucket : *spContainer) {
            if (bucket && !bucket->empty()) {
                ++nonEmptyBuckets;
            }
        }
        
        // If no non-empty buckets, skip inference
        if (nonEmptyBuckets == 0) {
            ATH_MSG_DEBUG("Container has no non-empty buckets, skipping ML scoring");
            return StatusCode::SUCCESS;
        }
 
        // Run the inference tool
        ATH_MSG_DEBUG("Calling runGraphInference on tool: " << m_inferenceTool.name());
        MuonML::GraphRawData graphData{};
        ATH_CHECK(m_inferenceTool->runGraphInference(ctx, graphData));
        ATH_MSG_DEBUG("runGraphInference completed successfully");
 
        // Extract logits from the inference output
        if (!graphData.graph || graphData.graph->dataTensor.size() <= 2) {
            ATH_MSG_ERROR("Missing output logits tensor at index 2");
            return StatusCode::FAILURE;
        }
        
        const Ort::Value& outTensor = graphData.graph->dataTensor[2];
        const auto& info = outTensor.GetTensorTypeAndShapeInfo();
        std::vector<int64_t> outShape = info.GetShape();
        
        if (outShape.size() != 2 || outShape[1] != 3) {
            ATH_MSG_ERROR("Unexpected ONNX output tensor shape");
            return StatusCode::FAILURE;
        }
        
        const float* logitsPtr = outTensor.GetTensorData<float>();
        if (!logitsPtr) {
            ATH_MSG_ERROR("Failed to get logits data pointer");
            return StatusCode::FAILURE;
        }
        
        // Map logits to buckets - only considering non-empty buckets
        size_t totalNumPredictions = static_cast<size_t>(outShape[0]);
        size_t predIdx = 0;
        
        for (const MuonR4::SpacePointBucket* bucket : *spContainer) {
            if (!bucket || bucket->empty()) {
                continue;  // Skip empty buckets
            }
            
            if (predIdx >= totalNumPredictions) {
                ATH_MSG_ERROR("More non-empty buckets than predictions from model");
                return StatusCode::FAILURE;
            }
            
            std::vector<float> scores(3);
            scores[0] = logitsPtr[3 * predIdx + 0];
            scores[1] = logitsPtr[3 * predIdx + 1];
            scores[2] = logitsPtr[3 * predIdx + 2];
            
            bucketScoreMap[bucket] = scores;
            ++predIdx;
        }
        
        if (predIdx != totalNumPredictions) {
            ATH_MSG_ERROR("Number of non-empty buckets (" << predIdx << ") does not match predictions (" 
                          << totalNumPredictions << ")");
            return StatusCode::FAILURE;
        }
        
        ATH_MSG_DEBUG("Successfully computed ML bucket scores for " << bucketScoreMap.size() << " buckets");
        return StatusCode::SUCCESS;
    }

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 to fill the internal configuration.

Definition at line 64 of file AthHistogramming.cxx.

{
  m_histSvc          = histSvc;
  m_streamName       = prefix;
  m_rootDir          = rootDir;
  m_histNamePrefix   = histNamePrefix;
  m_histNamePostfix  = histNamePostfix;
  m_histTitlePrefix  = histTitlePrefix;
  m_histTitlePostfix = histTitlePostfix;
 
  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; }

dumpContainer()

StatusCode MuonR4::BucketDumperAlg::dumpContainer ( const EventContext & ctx, const SG::ReadHandleKey< SpacePointContainer > & spacePointKey, const SG::ReadHandleKey< xAOD::MuonSegmentContainer > & segmentKey )

private

Dumps the space point container with the associated muon segment container.

Parameters

spacePointKey	Key to the space point key (Legacy /Nsw)
segmentKey	Key to the fitted segments (Legacy / Nsw)

Filter random noise

Bucket identifier

Global bucket position

Flag whether the bucket contains at least one good hit

Number of reconstructed segments in the bucket

Associate the Space points to the reconstructed segments

For the moment this only works on MC

Truth segment parameters

Calculate the layer of the space point

Definition at line 95 of file BucketDumperAlg.cxx.

                                                                                                           {
        
        // Define the segment mapping type
        using SegmentsPerBucket_t = std::unordered_map<const SpacePointBucket*,
                                                       std::set<const xAOD::MuonSegment*, LocalSegSorter>>;
        SegmentsPerBucket_t segmentMap{};
        
        const xAOD::MuonSegmentContainer* readSegment{nullptr};
        ATH_CHECK(SG::get(readSegment, segmentKey, ctx));
        if (readSegment) {
            for (const xAOD::MuonSegment* segment : *readSegment) {
                segmentMap[detailedSegment(*segment)->parent()->parentBucket()].insert(segment);
            }
        }
 
        const ActsTrk::GeometryContext* gctx{nullptr};
        ATH_CHECK(SG::get(gctx, m_geoCtxKey, ctx));
 
        const SpacePointContainer* spContainer{nullptr};
        ATH_CHECK(SG::get(spContainer, spacePointKey, ctx));
 
        // Compute ML bucket scores if enabled - only for MuonSpacePoints container
        // The tool is configured to read "MuonSpacePoints" from StoreGate, so we only run it for that container
        std::unordered_map<const SpacePointBucket*, std::vector<float>> bucketScores;
        const std::string& containerName = spacePointKey.key();
        if (m_doMLBucketScore && containerName == "MuonSpacePoints") {
            ATH_MSG_DEBUG("Computing ML bucket scores for container: " << containerName);
            ATH_CHECK(computeAllBucketScores(ctx, spContainer, bucketScores));
            ATH_MSG_DEBUG("ML scoring completed, got scores for " << bucketScores.size() << " buckets");
        } else if (m_doMLBucketScore && containerName != "MuonSpacePoints") {
            ATH_MSG_DEBUG("Skipping ML scoring for container: " << containerName  
                         << " (only MuonSpacePoints is supported)");
        }
 
        CLHEP::HepRandomEngine* rndEngine = getRandomEngine(ctx);
 
        const SpacePointPerLayerSorter layerSorter{};
 
        for(const SpacePointBucket* bucket : *spContainer) {
            if (!m_isMC && segmentMap[bucket].empty() && m_fracToKeep < 1. &&
                CLHEP::RandFlat::shoot(rndEngine,0.,1.) > m_fracToKeep) {
                ATH_MSG_VERBOSE("Skipping bucket without segment");
                continue;
            }
            
            if (m_doMLBucketFilter && !bucketScores.empty()) {
                auto scoreIt = bucketScores.find(bucket);
                if (scoreIt != bucketScores.end() && scoreIt->second.size() >= 3) {
                    const auto& logits = scoreIt->second;
                    int predictedClass = 0;
                    float maxLogit = logits[0];
                    if (logits[1] > maxLogit) { maxLogit = logits[1]; predictedClass = 1; }
                    if (logits[2] > maxLogit) { maxLogit = logits[2]; predictedClass = 2; }
                    if (predictedClass == 0) continue;
                }
            }
            
            m_bucket_sector     = bucket->msSector()->sector();
            m_bucket_chamberIdx = static_cast<uint8_t>(bucket->msSector()->chamberIndex());
            m_bucket_side = bucket->msSector()->side();
            m_bucket_min      = bucket->coveredMin();
            m_bucket_max      = bucket->coveredMax();

            const Amg::Vector3D bucketPos = bucket->msSector()->localToGlobalTransform(*gctx) * 
                                            (0.5*(bucket->coveredMin() + bucket->coveredMax()) * Amg::Vector3D::UnitY());
            m_bucket_posX = bucketPos.x();
            m_bucket_posY = bucketPos.y();
            m_bucket_posZ = bucketPos.z();

            m_bucket_truthHit = std::ranges::any_of(*bucket,[this](const SpacePointBucket::value_type & sp){
                return m_visionTool->isLabeled(*sp);
            });

            m_bucket_segments   = segmentMap[bucket].size();
 
 
 
            std::unordered_map<const SpacePoint*, std::vector<int16_t>> spacePointToSegment{};
            std::set<const xAOD::MuonSegment*, LocalSegSorter> truthSegments{};
            auto match_itr = segmentMap.find(bucket);
            if (match_itr != segmentMap.end()) {
                for (const xAOD::MuonSegment* segment : match_itr->second) {
                    for (const auto& meas : detailedSegment(*segment)->measurements()) {
                        if (meas->fitState() == CalibratedSpacePoint::State::Valid) {
                            spacePointToSegment[meas->spacePoint()].push_back(segment->index());
                        }
                    }
                    using namespace SegmentFit;
                    const auto pars = localSegmentPars(*segment);
                    m_segmentLocX += pars[Acts::toUnderlying(ParamDefs::x0)];
                    m_segmentLocY += pars[Acts::toUnderlying(ParamDefs::y0)];
                    m_segmentLocTheta += pars[Acts::toUnderlying(ParamDefs::theta)];
                    m_segmentLocPhi += pars[Acts::toUnderlying(ParamDefs::phi)];

                    unsigned truthLink = -1;
                    if (const xAOD::TruthParticle* truthPart = getTruthMatchedParticle(*segment)) {
                         truthLink = truthPart->index();
                    }
                    if (const xAOD::MuonSegment* truthSeg = getMatchedTruthSegment(*segment)) {
                        truthSegments.insert(truthSeg);
                    }
                    m_segmentTruthIdx+=truthLink;
                    m_segmentPos.push_back(segment->position());
                    m_segmentDir.push_back(segment->direction());
                    m_segment_chiSquared.push_back(segment->chiSquared());
                    m_segment_numberDoF.push_back(segment->numberDoF());
                }
            }
 
            std::vector<unsigned int> layNumbers{};
            std::unordered_map<const SpacePoint*, std::vector<const xAOD::MuonSegment*>> spToTrueSeg{};
            if (m_isMC) {
                using SegLinkVec_t = std::vector<ElementLink<xAOD::MuonSegmentContainer>>;
                static const SG::ConstAccessor<SegLinkVec_t> segAcc{"truthSegmentLinks"};
                for (const auto& sp : *bucket){
                    for (const auto& link : segAcc(*sp->primaryMeasurement())) {
                        spToTrueSeg[sp.get()].push_back(*link);
                        truthSegments.insert(*link);
                    }
                }
            }
            
            for(const SpacePointBucket::value_type& sp : *bucket) {
                const unsigned int layNum = layerSorter.sectorLayerNum(*sp);
                if (std::find(layNumbers.begin(), layNumbers.end(), layNum) == layNumbers.end()) {
                    layNumbers.push_back(layNum);
                }
                const unsigned layer = layNumbers.size()-1;
    
                const Identifier& id = sp->identify();
 
                if (sp->type() == xAOD::UncalibMeasType::MdtDriftCircleType) {
                    const auto* dc = static_cast<const xAOD::MdtDriftCircle*>(sp->primaryMeasurement());
                    if (dc->status() != Muon::MdtDriftCircleStatus::MdtStatusDriftTime){
                        continue;
                    }
                    m_spoint_isMdt.push_back(true);
                    m_spoint_isStrip.push_back(false);
                    m_spoint_adc.push_back(dc->adc());
                    m_spoint_tdc.push_back(dc->tdc());
                } else {
                    // check the technology to fill channel, adc and tdc... pushing back 0 for now
                    m_spoint_adc.push_back(0); 
                    m_spoint_tdc.push_back(0);
                    m_spoint_isMdt.push_back(false);
                    m_spoint_isStrip.push_back(true);
                }
 
                m_spoint_id.push_back(id);
 
 
                const std::vector<int16_t>& segIdxs = spacePointToSegment[sp.get()];
                m_spoint_mat[m_spoint_mat.size()] = segIdxs;
                auto& trueSegLinks = m_spoint_trueSeg[m_spoint_trueSeg.size()];
                for (const xAOD::MuonSegment* matchedSeg : spToTrueSeg[sp.get()]) {
                    trueSegLinks.push_back(std::distance(truthSegments.begin(), truthSegments.find(matchedSeg)));
                }
                m_spoint_nSegments.push_back(segIdxs.size());
                
                m_bucket_spacePoints = bucket->size();
                m_spoint_localPosition.push_back(sp->localPosition());
                using CovIdx = SpacePoint::CovIdx;
                m_spoint_covX.push_back(sp->covariance()[Acts::toUnderlying(CovIdx::phiCov)]);
                m_spoint_covY.push_back(sp->covariance()[Acts::toUnderlying(CovIdx::etaCov)]);
                m_spoint_driftR.push_back(sp->driftRadius());
                m_spoint_measuresEta.push_back(sp->measuresEta());
                m_spoint_measuresPhi.push_back(sp->measuresPhi());
                m_spoint_nEtaInstances.push_back(sp->nEtaInstanceCounts());
                m_spoint_nPhiInstances.push_back(sp->nPhiInstanceCounts());
                m_spoint_dimension.push_back(sp->dimension());
                m_spoint_layer.push_back(layer);
                if (m_visionTool.isEnabled()) {
                    m_spoint_trueLabel.push_back(m_visionTool->isLabeled(*sp));
                }
 
                Amg::Vector3D globalPos = sp->msSector()->localToGlobalTransform(*gctx) * sp->localPosition();
                m_spoint_globalPosition.push_back( globalPos );
            }
 
            for (const xAOD::MuonSegment* truthSeg: truthSegments) {
                using namespace SegmentFit;
                const auto truthPars = localSegmentPars(*truthSeg);
                m_truthSegLocX     += truthPars[Acts::toUnderlying(ParamDefs::x0)];
                m_truthSegLocY     += truthPars[Acts::toUnderlying(ParamDefs::y0)];
                m_truthSegLocTheta += truthPars[Acts::toUnderlying(ParamDefs::theta)];
                m_truthSegLocPhi   += truthPars[Acts::toUnderlying(ParamDefs::phi)];
            }
 
            m_bucket_layers = layNumbers.size();
 
            // Add ML bucket filter scores if available
            // Only add scores if we actually computed them for this container
            if (m_doMLBucketScore && !bucketScores.empty()) {
                auto scoreIt = bucketScores.find(bucket);
                if (scoreIt != bucketScores.end() && scoreIt->second.size() >= 3) {
                    m_bucket_ml_score_class0.push_back(scoreIt->second[0]);
                    m_bucket_ml_score_class1.push_back(scoreIt->second[1]);
                    m_bucket_ml_score_class2.push_back(scoreIt->second[2]);
                } else {
                    // Empty buckets are skipped during inference, so missing scores is expected
                    // Only warn if a non-empty bucket is missing scores (indicates a real problem)
                    if (bucket && !bucket->empty()) {
                        ATH_MSG_WARNING("Non-empty bucket from scored container not found in ML scores map");
                    }
                    m_bucket_ml_score_class0.push_back(0.f);
                    m_bucket_ml_score_class1.push_back(0.f);
                    m_bucket_ml_score_class2.push_back(0.f);
                }
            } else if (m_doMLBucketScore) {
                // No scores computed for this container (e.g., NswSpacePoints) - fill with zeros
                m_bucket_ml_score_class0.push_back(0.f);
                m_bucket_ml_score_class1.push_back(0.f);
                m_bucket_ml_score_class2.push_back(0.f);
            }
 
            if (!m_tree.fill(ctx)) {
                return StatusCode::FAILURE; 
            }
        }
 
        return StatusCode::SUCCESS;
 
    }

efficiency()

TEfficiency * AthHistogramming::efficiency ( std::string_view effName, std::string_view tDir = "", std::string_view stream = "" )

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 214 of file AthHistogramming.cxx.

{
  // Build a 32 bit hash out of the name
  const hash_t effHash = this->hash(effName);
 
  // See if this entry exists in the map
  EffMap_t::const_iterator it = m_effMap.find( effHash );
  if ( it == m_effMap.end() ) // It doesn't exist!
    { // Let's see into the THistSvc if somebody else has registered the TEfficiency...
      // Massage the final string to book things
      std::string bookingString = buildBookingString(effName, tDir, stream ,false);
 
      TEfficiency* effPointer{};
      if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
        {
          // Book things
          std::string bookingString = buildBookingString( effName, tDir, stream, true );
 
          if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
            {
              m_msg << MSG::WARNING
                    << "Problem retrieving the TEfficiency with name (including pre- and post-fixes) "
                    << bookingString
                    << " or with name " << effName
                    << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
                    << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
              return NULL;
            }
          // If we get to here, we actually found the TEfficiency in the THistSvc.
          // So let's add it to the local cache map and return its pointer
          m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, effPointer ) );
          return effPointer;
        }
      // If we get to here, we actually found the TEfficiency in the THistSvc.
      // So let's add it to the local cache map and return its pointer
      m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, effPointer ) );
      return effPointer;
    }
 
  // Return the pointer to the TEfficiency that we got from the local cache map
  return it->second;
}

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

finaloverridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 85 of file BucketDumperAlg.cxx.

                                                               {
                SG::ReadHandleKey<xAOD::MuonSegmentContainer> emptyKey{};
        ATH_CHECK(emptyKey.initialize(SG::AllowEmpty));
        
        for (unsigned  keyNum = 0 ; keyNum < m_spacePointKeys.size(); ++keyNum) {
            ATH_CHECK(dumpContainer(ctx, m_spacePointKeys[keyNum], 
                                    keyNum < m_inSegmentKeys.size() ?  m_inSegmentKeys[keyNum] : emptyKey));
        }
        return StatusCode::SUCCESS;
    }

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

const DataObjIDColl & 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 MuonR4::BucketDumperAlg::finalize ( )

finaloverridevirtual

Definition at line 80 of file BucketDumperAlg.cxx.

                                         {
        ATH_CHECK(m_tree.write());
        return StatusCode::SUCCESS;
    }

getRandomEngine()

CLHEP::HepRandomEngine * MuonR4::BucketDumperAlg::getRandomEngine ( const EventContext & ctx ) const

private

Definition at line 331 of file BucketDumperAlg.cxx.

                                                                                       {
        ATHRNG::RNGWrapper* rngWrapper = m_rndmSvc->getEngine(this, m_streamName);
        std::string rngName = m_streamName;
        rngWrapper->setSeed(rngName, ctx);
        return rngWrapper->getEngine(ctx);
    }

graph()

TGraph * AthHistogramming::graph ( std::string_view graphName, std::string_view tDir = "", std::string_view stream = "" )

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 438 of file AthHistogramming.cxx.

{
  // Build a 32 bit hash out of the name
  const hash_t graphHash = this->hash(graphName);
 
  // See if this entry exists in the map
  GraphMap_t::const_iterator it = m_graphMap.find( graphHash );
  if ( it == m_graphMap.end() ) // It doesn't exist!
    { // Let's see into the THistSvc if somebody else has registered the TGraph...
 
      // Massage the final string to book things
      std::string bookingString = buildBookingString( graphName, tDir, stream, false);
 
      TGraph* graphPointer(nullptr);
      if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
        {
          // Massage the final string to book things
          std::string bookingString = buildBookingString( graphName, tDir, stream, true );
 
          if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
            {
              m_msg << MSG::WARNING
                    << "Problem retrieving the TGraph with name (including pre- and post-fixes) "
                    << bookingString
                    << " or with name " << graphName
                    << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
                    << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
              return nullptr;
            }
          // If we get to here, we actually found the TGraph in the THistSvc.
          // So let's add it to the local cache map and return its pointer
          m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphPointer ) );
          return graphPointer;
        }
      // If we get to here, we actually found the TGraph in the THistSvc.
      // So let's add it to the local cache map and return its pointer
      m_graphMap.insert( m_graphMap.end(), std::pair< const hash_t, TGraph* >( graphHash, graphPointer ) );
      return graphPointer;
    }
 
 
  // Return the pointer to the TGraph that we got from the local cache map
  return it->second;
}

hash()

AthHistogramming::hash_t AthHistogramming::hash ( std::string_view histName ) const

inlineprivateinherited

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

Definition at line 422 of file AthHistogramming.h.

{
  const uint64_t hash64 = CxxUtils::crc64( std::string{histName} );
  return (hash_t)(hash64 & 0xFFFFFFFF);
}

hist()

TH1 * AthHistogramming::hist ( std::string_view histName, std::string_view tDir = "", std::string_view stream = "" )

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 182 of file AthHistogramming.cxx.

                       {
 
  const auto histBaseName = splitName(histName).second;
  std::string bookingString = buildBookingString(histName, tDir, stream, false);
 
  const hash_t histHash = this->hash(histBaseName);
 
  HistMap_t::const_iterator it = m_histMap.find(histHash);
  if (it == m_histMap.end()) {
    TH1* histPointer(nullptr);
 
    if (!histSvc()->getHist(bookingString, histPointer).isSuccess()) {
      std::string prefixedBookingString = buildBookingString(histName, tDir, stream, true);
      if (!histSvc()->getHist(prefixedBookingString, histPointer).isSuccess()) {
        m_msg << MSG::WARNING
              << "Problem retrieving the histogram with name (including pre- and post-fixes) "
              << prefixedBookingString
              << " or with name " << histName
              << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
              << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
        return nullptr;
      }
    }
 
    m_histMap.insert(m_histMap.end(), std::pair<const hash_t, TH1*>(histHash, histPointer));
    return histPointer;
  }
 
  return it->second;
}

hist2d()

TH2 * AthHistogramming::hist2d ( std::string_view histName, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 363 of file AthHistogramming.h.

{
  // Get the TH1 pointer
  TH1* th1Pointer = this->hist(histName, tDir, stream);
  if ( !th1Pointer )
    {
      m_msg << MSG::ERROR
            << "Cannot get a 2-d histogram with name " << histName
            << "... will probably seg-fault!" << endmsg;
      return NULL;
    }
  // If the TH1 pointer is valid, simply return the dynamic_cast
  return dynamic_cast<TH2*>( th1Pointer );
}

hist3d()

TH3 * AthHistogramming::hist3d ( std::string_view histName, std::string_view tDir = "", std::string_view stream = "" )

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 380 of file AthHistogramming.h.

{
  // Get the TH1 pointer
  TH1* th1Pointer = this->hist(histName, tDir, stream);
  if ( !th1Pointer )
    {
      m_msg << MSG::ERROR
            << "Cannot get a 3-d histogram with name " << histName
            << "... will probably seg-fault!" << endmsg;
      return NULL;
    }
  // If the TH1 pointer is valid, simply return the dynamic_cast
  return dynamic_cast<TH3*>( th1Pointer );
}

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.

{
  return m_histSvc;
}

initialize()

StatusCode MuonR4::BucketDumperAlg::initialize ( )

finaloverridevirtual

Definition at line 45 of file BucketDumperAlg.cxx.

                                           {
        ATH_CHECK(m_spacePointKeys.initialize());
        ATH_CHECK(m_inSegmentKeys.initialize());
        if (m_isMC) {
            for (const auto& key : m_inSegmentKeys) {
                m_truthDecorKeys.emplace_back(key, "truthParticleLink");
            }
        }
        ATH_CHECK(m_truthDecorKeys.initialize());
        ATH_CHECK(m_geoCtxKey.initialize());
        m_tree.addBranch(std::make_shared<MuonVal::EventHashBranch>(m_tree.tree()));
        ATH_CHECK(m_visionTool.retrieve(EnableTool{!m_visionTool.empty()}));        
        if (m_visionTool.empty()) {
            m_tree.disableBranch(m_spoint_trueLabel.name());
        }
        
        // Setup ML bucket score branches
        if (m_doMLBucketScore) {
            ATH_CHECK(m_inferenceTool.retrieve());
            ATH_MSG_INFO("ML bucket scoring enabled with tool: " << m_inferenceTool.name());
        }
        
        // Disable ML score branches if not enabled
        if (!m_doMLBucketScore) {
            m_tree.disableBranch(m_bucket_ml_score_class0.name());
            m_tree.disableBranch(m_bucket_ml_score_class1.name());
            m_tree.disableBranch(m_bucket_ml_score_class2.name());
        }
        
        ATH_CHECK(m_tree.init(this));
        ATH_MSG_DEBUG("Successfully initialized");
 
        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 368 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 352 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

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 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 AthCommonAlgorithm< Gaudi::Algorithm >.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

{
  // ---- stolen from GaudiKernel/Algorithm::sysInitialize -------
  // Bypass the initialization if the algorithm
  // has already been initialized.
  if ( Gaudi::StateMachine::INITIALIZED <= FSMState() ) return StatusCode::SUCCESS;
 
  // Set the Algorithm's properties
  bindPropertiesTo( serviceLocator()->getOptsSvc() );
 
  // Bypass the initialization if the algorithm is disabled.
  // Need to do this after bindPropertiesTo.
  if ( !isEnabled( ) ) return StatusCode::SUCCESS;
  
  // ---- stolen from GaudiKernel/Algorithm::sysInitialize ------- END ---
 
 
  // Get the THistSvc
  ATH_CHECK ( histSvc().retrieve() );
 
  // Configure the underlying AthHistogramming helper
  ATH_CHECK ( AthHistogramming::configAthHistogramming( m_histSvc,
                                                        m_prefix,          m_rootDir, 
                                                        m_histNamePrefix,  m_histNamePostfix,
                                                        m_histTitlePrefix, m_histTitlePostfix ) );
  
  // Print some setup information into the log file
  ATH_MSG_DEBUG ("Initializing {}...", name());
  ATH_MSG_DEBUG (" using THistService     = " << m_histSvc );
  ATH_MSG_DEBUG (" using RootStreamName   = {}", m_prefix );
  ATH_MSG_DEBUG (" using RootDirName      = {}", m_rootDir );
  ATH_MSG_DEBUG (" using HistNamePrefix   = {}", m_histNamePrefix );
  ATH_MSG_DEBUG (" using HistNamePostfix  = {}", m_histNamePostfix );
  ATH_MSG_DEBUG (" using HistTitlePrefix  = {}", m_histTitlePrefix );
  ATH_MSG_DEBUG (" using HistTitlePostfix = {}", m_histTitlePostfix );
 
 
  // re-direct to base class...
  return AthAlgorithm::sysInitialize();
}

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.

tree()

TTree * AthHistogramming::tree ( std::string_view treeName, std::string_view tDir = "", std::string_view stream = "" )

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 333 of file AthHistogramming.cxx.

{
  // Build a 32 bit hash out of the name
  const hash_t treeHash = this->hash(treeName);
  // See if this entry exists in the map
  TreeMap_t::const_iterator it = m_treeMap.find( treeHash );
  if ( it == m_treeMap.end() ) // It doesn't exist!
    { // Let's see into the THistSvc if somebody else has registered the TTree...
      // Massage the final string to book things
      std::string bookingString = buildBookingString( treeName, tDir, stream);
 
      TTree* treePointer(NULL);
      if ( !((histSvc()->getTree(bookingString, treePointer)).isSuccess()) )
        {
          m_msg << MSG::WARNING
                << "Problem retrieving the TTree with name " << treeName
                << " in " << m_name << "... it doesn't exist, neither in the cached map nor in the THistSvc!"
                << " Will return an NULL pointer... you have to handle it correctly!" << endmsg;
          return NULL;
        }
      // If we get to here, we actually found the TTree in the THistSvc.
      // So let's add it to the local cache map and return its pointer
      m_treeMap.insert( m_treeMap.end(), std::pair< const hash_t, TTree* >( treeHash, treePointer ) );
      return treePointer;
    }
 
  // Return the pointer to the TTree that we got from the local cache map
  return it->second;
}

updateVHKA()

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

inlineinherited

Definition at line 298 of file AthCommonDataStore.h.

                                               {
    for (auto &a : m_vhka) {
      std::vector<SG::VarHandleKey*> keys = a->keys();
      for (auto k : keys) {
        k->setOwner(this);
      }
    }
  }

Member Data Documentation

m_bucket_chamberIdx

MuonVal::ScalarBranch<uint8_t>& MuonR4::BucketDumperAlg::m_bucket_chamberIdx {m_tree.newScalar<uint8_t>("bucket_chamberIndex")}

private

Definition at line 96 of file BucketDumperAlg.h.

{m_tree.newScalar<uint8_t>("bucket_chamberIndex")};

m_bucket_layers

MuonVal::ScalarBranch<uint16_t>& MuonR4::BucketDumperAlg::m_bucket_layers {m_tree.newScalar<uint16_t>("bucket_layers", 0)}

private

Definition at line 89 of file BucketDumperAlg.h.

{m_tree.newScalar<uint16_t>("bucket_layers", 0)};

m_bucket_max

MuonVal::ScalarBranch<float>& MuonR4::BucketDumperAlg::m_bucket_max {m_tree.newScalar<float>("bucket_max", -1)}

private

Definition at line 86 of file BucketDumperAlg.h.

{m_tree.newScalar<float>("bucket_max", -1)};

m_bucket_min

MuonVal::ScalarBranch<float>& MuonR4::BucketDumperAlg::m_bucket_min {m_tree.newScalar<float>("bucket_min", -1)}

private

Definition at line 85 of file BucketDumperAlg.h.

{m_tree.newScalar<float>("bucket_min", -1)};

m_bucket_ml_score_class0

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_bucket_ml_score_class0 {m_tree.newVector<float>("bucket_ml_score_class0", false)}

private

ML bucket filter scores (3 classes for the filter model).

Definition at line 100 of file BucketDumperAlg.h.

{m_tree.newVector<float>("bucket_ml_score_class0", false)};

m_bucket_ml_score_class1

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_bucket_ml_score_class1 {m_tree.newVector<float>("bucket_ml_score_class1", false)}

private

Definition at line 101 of file BucketDumperAlg.h.

{m_tree.newVector<float>("bucket_ml_score_class1", false)};

m_bucket_ml_score_class2

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_bucket_ml_score_class2 {m_tree.newVector<float>("bucket_ml_score_class2", false)}

private

Definition at line 102 of file BucketDumperAlg.h.

{m_tree.newVector<float>("bucket_ml_score_class2", false)};

m_bucket_posX

MuonVal::ScalarBranch<float>& MuonR4::BucketDumperAlg::m_bucket_posX {m_tree.newScalar<float>("bucket_positionX")}

private

Definition at line 91 of file BucketDumperAlg.h.

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

m_bucket_posY

MuonVal::ScalarBranch<float>& MuonR4::BucketDumperAlg::m_bucket_posY {m_tree.newScalar<float>("bucket_positionY")}

private

Definition at line 92 of file BucketDumperAlg.h.

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

m_bucket_posZ

MuonVal::ScalarBranch<float>& MuonR4::BucketDumperAlg::m_bucket_posZ {m_tree.newScalar<float>("bucket_positionZ")}

private

Definition at line 93 of file BucketDumperAlg.h.

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

m_bucket_sector

MuonVal::ScalarBranch<uint8_t>& MuonR4::BucketDumperAlg::m_bucket_sector {m_tree.newScalar<uint8_t>("bucket_sector")}

private

Definition at line 95 of file BucketDumperAlg.h.

{m_tree.newScalar<uint8_t>("bucket_sector")};

m_bucket_segments

MuonVal::ScalarBranch<uint16_t>& MuonR4::BucketDumperAlg::m_bucket_segments {m_tree.newScalar<uint16_t>("bucket_segments", 0)}

private

Definition at line 88 of file BucketDumperAlg.h.

{m_tree.newScalar<uint16_t>("bucket_segments", 0)};

m_bucket_side

MuonVal::ScalarBranch<Char_t>& MuonR4::BucketDumperAlg::m_bucket_side {m_tree.newScalar<Char_t>("bucket_side")}

private

Definition at line 97 of file BucketDumperAlg.h.

{m_tree.newScalar<Char_t>("bucket_side")};

m_bucket_spacePoints

MuonVal::ScalarBranch<uint16_t>& MuonR4::BucketDumperAlg::m_bucket_spacePoints {m_tree.newScalar<uint16_t>("bucket_spacePoints", 0)}

private

Definition at line 87 of file BucketDumperAlg.h.

{m_tree.newScalar<uint16_t>("bucket_spacePoints", 0)};

m_bucket_truthHit

MuonVal::ScalarBranch<uint8_t>& MuonR4::BucketDumperAlg::m_bucket_truthHit {m_tree.newScalar<uint8_t>("bucket_hasTruth", 0)}

private

Definition at line 90 of file BucketDumperAlg.h.

{m_tree.newScalar<uint8_t>("bucket_hasTruth", 0)};

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 381 of file AthCommonDataStore.h.

m_doMLBucketFilter

Gaudi::Property<bool> MuonR4::BucketDumperAlg::m_doMLBucketFilter

private

Initial value:

{this, "DoMLBucketFilter", false,
        "Skip dumping buckets classified as class 0 (reject) by ML model. Requires DoMLBucketScore=true."}

Definition at line 71 of file BucketDumperAlg.h.

                                          {this, "DoMLBucketFilter", false,
        "Skip dumping buckets classified as class 0 (reject) by ML model. Requires DoMLBucketScore=true."};

m_doMLBucketScore

Gaudi::Property<bool> MuonR4::BucketDumperAlg::m_doMLBucketScore

private

Initial value:

{this, "DoMLBucketScore", false, 
        "Enable ML bucket score computation and dumping (requires InferenceTool to be configured)"}

Definition at line 69 of file BucketDumperAlg.h.

                                         {this, "DoMLBucketScore", false, 
        "Enable ML bucket score computation and dumping (requires InferenceTool to be configured)"};

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 202 of file AthHistogramming.h.

m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 378 of file AthCommonDataStore.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_fracToKeep

Gaudi::Property<double> MuonR4::BucketDumperAlg::m_fracToKeep {this,"dataFracToKeep", 1.}

private

Definition at line 67 of file BucketDumperAlg.h.

{this,"dataFracToKeep", 1.}; // 0.055 to balanced dataset without MC

m_geoCtxKey

ActsTrk::GeoContextReadKey_t MuonR4::BucketDumperAlg::m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}

private

Definition at line 64 of file BucketDumperAlg.h.

{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 216 of file AthHistogramming.h.

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 195 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_inferenceTool

ToolHandle<MuonML::IGraphInferenceTool> MuonR4::BucketDumperAlg::m_inferenceTool

private

Initial value:

{this, "InferenceTool", "",
        "Optional ML inference tool for computing bucket scores. If not provided, scores will be empty."}

Inference tool for ML bucket scoring (optional).

Definition at line 76 of file BucketDumperAlg.h.

                                                         {this, "InferenceTool", "",
        "Optional ML inference tool for computing bucket scores. If not provided, scores will be empty."};

m_inSegmentKeys

SG::ReadHandleKeyArray<xAOD::MuonSegmentContainer> MuonR4::BucketDumperAlg::m_inSegmentKeys {this, "SegmentKey", {"MsSegments"}}

private

Definition at line 61 of file BucketDumperAlg.h.

{this, "SegmentKey", {"MsSegments"}};

m_isMC

Gaudi::Property<bool> MuonR4::BucketDumperAlg::m_isMC {this, "isMC", true}

private

Definition at line 66 of file BucketDumperAlg.h.

{this, "isMC", true};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 242 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 239 of file AthHistogramming.h.

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_rndmSvc

ServiceHandle<IAthRNGSvc> MuonR4::BucketDumperAlg::m_rndmSvc {this, "RndmSvc", "AthRNGSvc", ""}

private

Definition at line 73 of file BucketDumperAlg.h.

{this, "RndmSvc", "AthRNGSvc", ""};

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_segment_chiSquared

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segment_chiSquared {m_tree.newVector<float>("segment_chiSquared")}

private

Definition at line 141 of file BucketDumperAlg.h.

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

m_segment_numberDoF

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segment_numberDoF {m_tree.newVector<float>("segment_numberDoF")}

private

Definition at line 142 of file BucketDumperAlg.h.

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

m_segmentDir

MuonVal::ThreeVectorBranch MuonR4::BucketDumperAlg::m_segmentDir {m_tree, "segmentDirection"}

private

Definition at line 140 of file BucketDumperAlg.h.

{m_tree, "segmentDirection"};

m_segmentLocPhi

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segmentLocPhi {m_tree.newVector<float>("segmentLocalPhi")}

private

Definition at line 135 of file BucketDumperAlg.h.

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

m_segmentLocTheta

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segmentLocTheta {m_tree.newVector<float>("segmentLocalTheta")}

private

Definition at line 134 of file BucketDumperAlg.h.

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

m_segmentLocX

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segmentLocX {m_tree.newVector<float>("segmentLocalX")}

private

Definition at line 132 of file BucketDumperAlg.h.

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

m_segmentLocY

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_segmentLocY {m_tree.newVector<float>("segmentLocalY")}

private

Definition at line 133 of file BucketDumperAlg.h.

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

m_segmentPos

MuonVal::ThreeVectorBranch MuonR4::BucketDumperAlg::m_segmentPos {m_tree, "segmentPosition"}

private

Definition at line 139 of file BucketDumperAlg.h.

{m_tree, "segmentPosition"}; 

m_segmentTruthIdx

MuonVal::VectorBranch<uint16_t>& MuonR4::BucketDumperAlg::m_segmentTruthIdx {m_tree.newVector<uint16_t>("segmentTruthPart")}

private

Definition at line 137 of file BucketDumperAlg.h.

{m_tree.newVector<uint16_t>("segmentTruthPart")};

m_spacePointKeys

SG::ReadHandleKeyArray<SpacePointContainer> MuonR4::BucketDumperAlg::m_spacePointKeys

private

Initial value:

{this, "SpacePointKeys", {"MuonSpacePoints"}, 
                                                     "Key to the space point container"}

Definition at line 58 of file BucketDumperAlg.h.

                                                              {this, "SpacePointKeys", {"MuonSpacePoints"}, 
                                                     "Key to the space point container"};

m_spoint_adc

MuonVal::VectorBranch<uint16_t>& MuonR4::BucketDumperAlg::m_spoint_adc {m_tree.newVector<uint16_t>("adc")}

private

Definition at line 112 of file BucketDumperAlg.h.

{m_tree.newVector<uint16_t>("adc")};

m_spoint_covX

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_spoint_covX {m_tree.newVector<float>("covX")}

private

Definition at line 115 of file BucketDumperAlg.h.

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

m_spoint_covY

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_spoint_covY {m_tree.newVector<float>("covY")}

private

Definition at line 116 of file BucketDumperAlg.h.

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

m_spoint_dimension

MuonVal::VectorBranch<unsigned int>& MuonR4::BucketDumperAlg::m_spoint_dimension {m_tree.newVector<unsigned int>("dimension")}

private

Definition at line 124 of file BucketDumperAlg.h.

{m_tree.newVector<unsigned int>("dimension")};

m_spoint_driftR

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_spoint_driftR {m_tree.newVector<float>("driftR")}

private

Definition at line 117 of file BucketDumperAlg.h.

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

m_spoint_globalPosition

MuonVal::ThreeVectorBranch MuonR4::BucketDumperAlg::m_spoint_globalPosition {m_tree, "globalPosition"}

private

Definition at line 105 of file BucketDumperAlg.h.

{m_tree, "globalPosition"}; 

m_spoint_id

MuonVal::MuonIdentifierBranch MuonR4::BucketDumperAlg::m_spoint_id {m_tree, "id"}

private

Definition at line 107 of file BucketDumperAlg.h.

{m_tree, "id"};

m_spoint_isMdt

MuonVal::VectorBranch<unsigned short>& MuonR4::BucketDumperAlg::m_spoint_isMdt {m_tree.newVector<unsigned short>("isMdt", false)}

private

Definition at line 110 of file BucketDumperAlg.h.

{m_tree.newVector<unsigned short>("isMdt", false)};

m_spoint_isStrip

MuonVal::VectorBranch<unsigned short>& MuonR4::BucketDumperAlg::m_spoint_isStrip {m_tree.newVector<unsigned short>("isStrip", false)}

private

Definition at line 109 of file BucketDumperAlg.h.

{m_tree.newVector<unsigned short>("isStrip", false)};

m_spoint_layer

MuonVal::VectorBranch<uint16_t>& MuonR4::BucketDumperAlg::m_spoint_layer {m_tree.newVector<uint16_t>("Layer")}

private

Definition at line 108 of file BucketDumperAlg.h.

{m_tree.newVector<uint16_t>("Layer")};

m_spoint_localPosition

MuonVal::ThreeVectorBranch MuonR4::BucketDumperAlg::m_spoint_localPosition {m_tree, "localPosition"}

private

Definition at line 104 of file BucketDumperAlg.h.

{m_tree, "localPosition"}; 

m_spoint_mat

MuonVal::MatrixBranch<int16_t>& MuonR4::BucketDumperAlg::m_spoint_mat {m_tree.newMatrix<int16_t>("sp_seg_matching",-1)}

private

Definition at line 127 of file BucketDumperAlg.h.

{m_tree.newMatrix<int16_t>("sp_seg_matching",-1)};

m_spoint_measuresEta

MuonVal::VectorBranch<unsigned short>& MuonR4::BucketDumperAlg::m_spoint_measuresEta {m_tree.newVector<unsigned short>("measuresEta")}

private

Definition at line 119 of file BucketDumperAlg.h.

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

m_spoint_measuresPhi

MuonVal::VectorBranch<unsigned short>& MuonR4::BucketDumperAlg::m_spoint_measuresPhi {m_tree.newVector<unsigned short>("measuresPhi")}

private

Definition at line 120 of file BucketDumperAlg.h.

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

m_spoint_nEtaInstances

MuonVal::VectorBranch<unsigned int>& MuonR4::BucketDumperAlg::m_spoint_nEtaInstances {m_tree.newVector<unsigned int>("nEtaInUse")}

private

Definition at line 122 of file BucketDumperAlg.h.

{m_tree.newVector<unsigned int>("nEtaInUse")};

m_spoint_nPhiInstances

MuonVal::VectorBranch<unsigned int>& MuonR4::BucketDumperAlg::m_spoint_nPhiInstances {m_tree.newVector<unsigned int>("nPhiInUse")}

private

Definition at line 123 of file BucketDumperAlg.h.

{m_tree.newVector<unsigned int>("nPhiInUse")};

m_spoint_nSegments

MuonVal::VectorBranch<uint16_t>& MuonR4::BucketDumperAlg::m_spoint_nSegments {m_tree.newVector<uint16_t>("nSegments")}

private

Definition at line 126 of file BucketDumperAlg.h.

{m_tree.newVector<uint16_t>("nSegments")};

m_spoint_tdc

MuonVal::VectorBranch<uint16_t>& MuonR4::BucketDumperAlg::m_spoint_tdc {m_tree.newVector<uint16_t>("tdc")}

private

Definition at line 113 of file BucketDumperAlg.h.

{m_tree.newVector<uint16_t>("tdc")};

m_spoint_trueLabel

MuonVal::VectorBranch<unsigned short>& MuonR4::BucketDumperAlg::m_spoint_trueLabel {m_tree.newVector<unsigned short>("trueLabel")}

private

Definition at line 121 of file BucketDumperAlg.h.

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

m_spoint_trueSeg

MuonVal::MatrixBranch<int16_t>& MuonR4::BucketDumperAlg::m_spoint_trueSeg {m_tree.newMatrix<int16_t>("spacePoint_truthSegLink",-1)}

private

Definition at line 128 of file BucketDumperAlg.h.

{m_tree.newMatrix<int16_t>("spacePoint_truthSegLink",-1)};

m_streamName

Gaudi::Property<std::string> MuonR4::BucketDumperAlg::m_streamName {this, "StreamName", ""}

private

Definition at line 68 of file BucketDumperAlg.h.

{this, "StreamName", ""};

m_tree

MuonVal::MuonTesterTree MuonR4::BucketDumperAlg::m_tree {"MuonBucketDump","MuonBucketDump"}

private

Definition at line 83 of file BucketDumperAlg.h.

{"MuonBucketDump","MuonBucketDump"};

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 209 of file AthHistogramming.h.

m_truthDecorKeys

SG::ReadDecorHandleKeyArray<xAOD::MuonSegmentContainer> MuonR4::BucketDumperAlg::m_truthDecorKeys {this, "TruthDecorLinks", {}}

private

Definition at line 63 of file BucketDumperAlg.h.

{this, "TruthDecorLinks", {}};

m_truthSegLocPhi

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_truthSegLocPhi {m_tree.newVector<float>("truthSegmentLocalPhi")}

private

Definition at line 147 of file BucketDumperAlg.h.

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

m_truthSegLocTheta

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_truthSegLocTheta {m_tree.newVector<float>("truthSegmentLocalTheta")}

private

Definition at line 146 of file BucketDumperAlg.h.

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

m_truthSegLocX

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_truthSegLocX {m_tree.newVector<float>("truthSegmentLocalX")}

private

Definition at line 144 of file BucketDumperAlg.h.

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

m_truthSegLocY

MuonVal::VectorBranch<float>& MuonR4::BucketDumperAlg::m_truthSegLocY {m_tree.newVector<float>("truthSegmentLocalY")}

private

Definition at line 145 of file BucketDumperAlg.h.

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

m_varHandleArraysDeclared

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

privateinherited

Definition at line 387 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 386 of file AthCommonDataStore.h.

m_visionTool

ToolHandle<MuonValR4::IPatternVisualizationTool> MuonR4::BucketDumperAlg::m_visionTool {this, "VisualizationTool", ""}

private

Pattern visualization tool.

Definition at line 80 of file BucketDumperAlg.h.

{this, "VisualizationTool", ""};

---

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

• BucketDumperAlg.h
• BucketDumperAlg.cxx