MuonValR4::MuonFastRecoTester Class Reference

#include <MuonFastRecoTester.h>

Inheritance diagram for MuonValR4::MuonFastRecoTester:

Public Member Functions
virtual	~MuonFastRecoTester ()=default
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) override
	Execute method.
virtual StatusCode	finalize () override
	AthHistogramAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
	Constructor with parameters:
virtual StatusCode	sysInitialize ()
	Initialization method invoked by the framework.
const ServiceHandle< ITHistSvc > &	histSvc () const
	The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
bool	filterPassed (const EventContext &ctx) const
void	setFilterPassed (bool state, const EventContext &ctx) const
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
const EventContext &	getContext () const
	Deprecated methods (use the ones with EventContext).
bool	filterPassed () const
void	setFilterPassed (bool state) const

Protected Member Functions
virtual bool	isReEntrant () const override final
	Legacy algorithms are not thread-safe.
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution
std::enable_if_t< std::is_void_v< std::result_of_t< decltype(&T::renounce)(T)> > &&!std::is_base_of_v< SG::VarHandleKeyArray, T > &&std::is_base_of_v< Gaudi::DataHandle, T >, void >	renounce (T &h)
void	extraDeps_update_handler (Gaudi::Details::PropertyBase &ExtraDeps)
	Add StoreName to extra input/output deps as needed.
StatusCode	configAthHistogramming (const ServiceHandle< ITHistSvc > &histSvc, const std::string &prefix, const std::string &rootDir, const std::string &histNamePrefix, const std::string &histNamePostfix, const std::string &histTitlePrefix, const std::string &histTitlePostfix)
	To be called by the derived classes to fill the internal configuration.
TH1 *	bookGetPointer (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TH1 *	bookGetPointer (TH1 *hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TH1 *	bookGetPointer (TH1 &histRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
TTree *	bookGetPointer (const TTree &treeRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TTrees.
TGraph *	bookGetPointer (const TGraph &graphRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs.
TEfficiency *	bookGetPointer (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency *	bookGetPointer (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TEfficiency *	bookGetPointer (TEfficiency &effRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (TH1 *hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (TH1 &histRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms.
StatusCode	book (const TTree &treeRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TTrees.
StatusCode	book (const TGraph &graphRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs.
StatusCode	book (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
StatusCode	book (TEfficiency &effRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency.
TH1 *	hist (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered histograms of any type.
TH2 *	hist2d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 2-d histograms.
TH3 *	hist3d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 3-d histograms.
TTree *	tree (const std::string &treeName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TTrees.
TGraph *	graph (const std::string &graphName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TGraphs.
TEfficiency *	efficiency (const std::string &effName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TEfficiency.

Private Types
enum class	measType { Prec , NonPrec , Phi , nTypes }
	Enum for measurement types. More...
enum class	ePatBranchType : std::uint8_t {   eReco , eTruth , ePileup , eMismatched ,   eAll }
	Enum for different types of pattern hit content branches. More...
using	simHitSet = std::unordered_set<const xAOD::MuonSimHit*>
using	TruthParticleMap = std::map<const xAOD::TruthParticle*, std::vector<simHitSet>>
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
TruthParticleMap	fillTruthMap (const xAOD::MuonSegmentContainer *truthSegments, const TrigRoiDescriptorCollection *roiCollection) const
	Fill the truth particle map.
void	fillSpacePointInfo (const MuonR4::SpacePointContainer *spc, const MuonR4::GlobalPatternContainer *patternCont, const TruthParticleMap &truthHits, SpacePointTesterModule &spTester, MuonVal::VectorBranch< unsigned char > &spTypeBranch, MuonVal::MatrixBranch< unsigned char > &spMatchedToPatternBranch, MuonVal::MatrixBranch< unsigned char > &spMatchedToTruthBranch) const
	Fill the space point information into the tree.
void	fillGlobPatternInfo (const MuonR4::GlobalPatternContainer *patternCont, const TruthParticleMap &truthHits, const std::vector< const MuonR4::SpacePointContainer * > &spContainers)
	Fill the info associated to the global patterns into the tree.
void	fillTruthInfo (const TruthParticleMap &truthHits, const std::vector< const MuonR4::SpacePointContainer * > &spContainers)
	Fill the truth particle information into the tree.
void	fillRoIInfo (const TrigRoiDescriptorCollection *roiCollection)
	Fill the RoI information into the tree.
void	updatePatHitInfo (const ePatBranchType type, const std::size_t patIdx, const Muon::MuonStationIndex::StIndex hitSt, const MuonR4::SpacePoint *sp, const bool isSecondaryMatched=false)
	Update the hit counts for a given pattern branch type.
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>
void	buildBookingString (std::string &bookingString, std::string &histName, std::string &tDir, std::string &stream, bool usePrefixPostfix=false)
	Method to build individual booking string.
void	myReplace (std::string &str, const std::string &oldStr, const std::string &newStr)
	Helper method to replace sub-string.
hash_t	hash (const std::string &histName) const
	Method to calculate a 32-bit hash from a string.

Private Attributes
MuonVal::MuonTesterTree	m_tree {"MuonFastRecoTest","FastRecoTester"}
SG::ReadHandleKey< MuonR4::SpacePointContainer >	m_spKey {this, "SpacePointKey", "MuonSpacePoints"}
SG::ReadHandleKey< MuonR4::SpacePointContainer >	m_NSWspKey {this, "NswSpacePointKey", "NswSpacePoints"}
SG::ReadHandleKey< MuonR4::GlobalPatternContainer >	m_patternKey {this, "PatternKey", "R4MuonGlobalPatterns", "global pattern container"}
SG::ReadHandleKey< xAOD::MuonSegmentContainer >	m_truthSegmentKey {this, "TruthSegmentKey","MuonTruthSegments", "truth segment container"}
SG::ReadHandleKey< TrigRoiDescriptorCollection >	m_roiCollectionKey {this, "MuRoIs", "EFMuMSReco_RoI", "Name of the input data from HLTSeeding"}
ActsTrk::GeoContextReadKey_t	m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}
ServiceHandle< Muon::IMuonIdHelperSvc >	m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}
BooleanProperty	m_isMC {this, "isMC", false, "Toggle whether the job is ran on MC or not"}
BooleanProperty	m_isSeededReco {this, "isSeededReco", false, "Toggle whether the job is ran on seeded reconstruction or not"}
BooleanProperty	m_writeSpacePoints
std::shared_ptr< SpacePointTesterModule >	m_spTester {}
	====== Spacepoint block ===========
std::shared_ptr< SpacePointTesterModule >	m_NSWspTester {}
MuonVal::VectorBranch< unsigned char > &	m_spType {m_tree.newVector<unsigned char>(m_spKey.key()+"_type")}
	Type of spacepoints: 1 for trigger eta, 2 for precision, 3 for only-phi.
MuonVal::VectorBranch< unsigned char > &	m_NSWspType {m_tree.newVector<unsigned char>(m_NSWspKey.key()+"_type")}
MuonVal::MatrixBranch< unsigned char > &	m_spMatchedToPattern {m_tree.newMatrix<unsigned char>(m_spKey.key()+"_patternMatched")}
	Branch indicating which space points in the tree are associated to the i-th pattern.
MuonVal::MatrixBranch< unsigned char > &	m_NSWspMatchedToPattern {m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_patternMatched")}
MuonVal::MatrixBranch< unsigned char > &	m_spMatchedToTruth {m_tree.newMatrix<unsigned char>(m_spKey.key()+"_truthMatched")}
	Branch indicating which space points in the tree are associated to the i-th truth particle.
MuonVal::MatrixBranch< unsigned char > &	m_NSWspMatchedToTruth {m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_truthMatched")}
MuonVal::VectorBranch< short > &	m_gen_Q {m_tree.newVector<short>("gen_Q", 0)}
	====== Truth particle block ===========
MuonVal::VectorBranch< float > &	m_gen_Eta {m_tree.newVector<float>("gen_Eta",-10.)}
MuonVal::VectorBranch< float > &	m_gen_Phi {m_tree.newVector<float>("gen_Phi",-10.)}
MuonVal::VectorBranch< float > &	m_gen_Pt {m_tree.newVector<float>("gen_Pt",-10.)}
MuonVal::MatrixBranch< unsigned char > &	m_gen_nNonPrecMeas {m_tree.newMatrix<unsigned char>("gen_NNonPrecMeas", 0)}
	Number of trigger eta measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_gen_nPrecMeas {m_tree.newMatrix<unsigned char>("gen_NPrecMeas", 0)}
	Number of precision measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_gen_nPhiMeas {m_tree.newMatrix<unsigned char>("gen_NPhiMeas", 0)}
	Number of phi measurements per station.
MuonVal::ScalarBranch< unsigned > &	m_pat_n {m_tree.newScalar<unsigned>("pat_nPatterns", 0)}
	====== Global Pattern block ===========
MuonVal::VectorBranch< float > &	m_pat_Eta {m_tree.newVector<float>("pat_Eta", 0.0)}
	pattern average theta & phi
MuonVal::VectorBranch< float > &	m_pat_phi {m_tree.newVector<float>("pat_Phi", 0.0)}
MuonVal::VectorBranch< uint16_t > &	m_pat_sector1 {m_tree.newVector<uint16_t>("pat_Sector1", 0)}
	pattern primary & secondary sectors (different if the pattern is in the sector overlap)
MuonVal::VectorBranch< uint16_t > &	m_pat_sector2 {m_tree.newVector<uint16_t>("pat_Sector2", 0)}
MuonVal::VectorBranch< float > &	m_pat_meanNormResidual2 {m_tree.newVector<float>("pat_meanNormResidual2", 0.0)}
	mean square normalized pattern residual
MuonVal::VectorBranch< short > &	m_pat_side {m_tree.newVector<short>("pat_Side", 0)}
	+1 for A-, -1 of C-side
MuonVal::VectorBranch< unsigned char > &	m_pat_nStations {m_tree.newVector<unsigned char>("pat_NStations", 0)}
	Number of stations.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NNonPrecMeas", 0)}
	Number of trigger eta measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPrecMeas", 0)}
	Number of precision measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nPhiMeas {m_tree.newMatrix<unsigned char>("pat_NPhiMeas", 0)}
	Number of phi measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nTruthNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NTruthNonPrecMeas", 0)}
	Number of truth trigger eta measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nTruthPrecMeas {m_tree.newMatrix<unsigned char>("pat_NTruthPrecMeas", 0)}
	Number of truth precision measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nTruthPhiMeas {m_tree.newMatrix<unsigned char>("pat_NTruthPhiMeas", 0)}
	Number of truth phi measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nMisTruthNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthNonPrecMeas", 0)}
	Number of mismatched truth trigger eta measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nMisTruthPrecMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthPrecMeas", 0)}
	Number of mismatched truth precision measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nMisTruthPhiMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthPhiMeas", 0)}
	Number of mismatched truth phi measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nPileupNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPileupNonPrecMeas", 0)}
	Number of pileup trigger eta measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nPileupPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPileupPrecMeas", 0)}
	Number of pileup precision measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nPileupPhiMeas {m_tree.newMatrix<unsigned char>("pat_NPileupPhiMeas", 0)}
	Number of pileup phi measurements per station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nAllNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NAllNonPrecMeas", 0)}
	Number of trigger eta measurements in the buckets crossed by the pattern, grouped by station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nAllPrecMeas {m_tree.newMatrix<unsigned char>("pat_NAllPrecMeas", 0)}
	Number of precision measurements in the buckets crossed by the pattern, grouped by station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_nAllPhiMeas {m_tree.newMatrix<unsigned char>("pat_NAllPhiMeas", 0)}
	Number of phi measurements in the buckets crossed by the pattern, grouped by station.
MuonVal::MatrixBranch< unsigned char > &	m_pat_MatchedToTruth {m_tree.newMatrix<unsigned char>("pat_truthMatched")}
	Branch indicating which truth particles in the tree are associated to the i-th pattern.
MuonVal::VectorBranch< float > &	m_roi_EtaMin {m_tree.newVector<float>("roi_EtaMin",-10.)}
	====== RoI info ===========
MuonVal::VectorBranch< float > &	m_roi_EtaMax {m_tree.newVector<float>("roi_EtaMax",-10.)}
MuonVal::VectorBranch< float > &	m_roi_PhiMin {m_tree.newVector<float>("roi_PhiMin",-10.)}
MuonVal::VectorBranch< float > &	m_roi_PhiMax {m_tree.newVector<float>("roi_PhiMax",-10.)}
MuonVal::VectorBranch< float > &	m_roi_ZMin {m_tree.newVector<float>("roi_ZMin",-10.)}
MuonVal::VectorBranch< float > &	m_roi_ZMax {m_tree.newVector<float>("roi_ZMax",-10.)}
MuonR4::SpacePointPerLayerSorter	m_spSorter {}
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();.
std::string	m_prefix
	Name of the ROOT output stream (file).
std::string	m_rootDir
	Name of the ROOT directory.
std::string	m_histNamePrefix
	The prefix for the histogram THx name.
std::string	m_histNamePostfix
	The postfix for the histogram THx name.
std::string	m_histTitlePrefix
	The prefix for the histogram THx title.
std::string	m_histTitlePostfix
	The postfix for the histogram THx title.
DataObjIDColl	m_extendedExtraObjects
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers.
EffMap_t	m_effMap
	The map of histogram names to their pointers.
TreeMap_t	m_treeMap
	The map of TTree names to their pointers.
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers.
std::string	m_streamName
	Name of the ROOT output stream (file).
std::string	m_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Detailed Description

Definition at line 25 of file MuonFastRecoTester.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 207 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 221 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 171 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 200 of file AthHistogramming.h.

simHitSet

using MuonValR4::MuonFastRecoTester::simHitSet = std::unordered_set<const xAOD::MuonSimHit*>

private

Definition at line 37 of file MuonFastRecoTester.h.

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 214 of file AthHistogramming.h.

TruthParticleMap

using MuonValR4::MuonFastRecoTester::TruthParticleMap = std::map<const xAOD::TruthParticle*, std::vector<simHitSet>>

private

Definition at line 38 of file MuonFastRecoTester.h.

Member Enumeration Documentation

ePatBranchType

enum class MuonValR4::MuonFastRecoTester::ePatBranchType : std::uint8_t

strongprivate

Enum for different types of pattern hit content branches.

Enumerator
eReco
eTruth
ePileup
eMismatched
eAll

Definition at line 77 of file MuonFastRecoTester.h.

                              : std::uint8_t {
        eReco,    // Counts of pattern hits
        eTruth,   // Counts of pattern hits matched to truth
        ePileup,  // Counts of pattern hits matched to pileup truth
        eMismatched, // Counts of pattern hits matched to truth but not to the main truth particle of the pattern
        eAll,     // Counts of all hits in the buckets crossed by the pattern
    };

measType

enum class MuonValR4::MuonFastRecoTester::measType

strongprivate

Enum for measurement types.

Enumerator
Prec
NonPrec
Phi
nTypes

Definition at line 36 of file MuonFastRecoTester.h.

{Prec, NonPrec, Phi, nTypes};

Constructor & Destructor Documentation

~MuonFastRecoTester()

virtual MuonValR4::MuonFastRecoTester::~MuonFastRecoTester ( )

virtualdefault

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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 337 of file AthHistogramming.h.

{
  // 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 305 of file AthHistogramming.h.

{
  // 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 405 of file AthHistogramming.h.

{
  // 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 358 of file AthHistogramming.h.

{
  // 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 348 of file AthHistogramming.h.

{
  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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 326 of file AthHistogramming.h.

{
  // 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 316 of file AthHistogramming.h.

{
  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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 283 of file AthHistogramming.h.

{
  // 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 tDir = "", std::string stream = "" )

protectedinherited

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

Definition at line 412 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("");
  this->buildBookingString( bookingString, 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, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

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

Definition at line 262 of file AthHistogramming.h.

{
  // 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 tDir = "", std::string stream = "" )

protectedinherited

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

Definition at line 297 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("");
  this->buildBookingString( bookingString, 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 tDir = "", std::string stream = "" )

protectedinherited

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

Definition at line 131 of file AthHistogramming.cxx.

{
  // Modify the name and title according to the prefixes of this classes instance
  std::string effName(effRef.GetName());
  const std::string effTitle(effRef.GetTitle());
  std::string bookingString("");
 
  this->buildBookingString( bookingString, effName, tDir, stream );
  effRef.SetTitle((m_histTitlePrefix+effTitle+m_histTitlePostfix).c_str() );
  effRef.SetName(effName.c_str());
 
  // Check if the hash for this effName already exists, i.e., if we have a hash collision
  const hash_t effHash = this->hash(effName);
  EffMap_t::const_iterator it = m_effMap.find( effHash );
  if ( it != m_effMap.end() ) // It does exist!
    {
      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 NULL;
    }
 
  // Set the new name and title for the TEfficiency, based on the prefixes that the user set for this class instance
  // Create a clone that has the new name
 
  // Massage the final string to book things
 
  // Register the TEfficiency into the THistSvc
  if ( !((histSvc()->regEfficiency(bookingString, &effRef)).isSuccess()) )
    {
      m_msg << MSG::WARNING
            << "Problem registering TEfficiency with name " << effName
            << ", name prefix " << m_histNamePrefix
            << ", title " << effTitle
            << ", tile prefix " << m_histTitlePrefix
            << ", and tile postfix " << m_histTitlePostfix
            << " in " << m_name << "!" << endmsg;
      return NULL;
    }
 
  // Also register it in the local map of string to pointer
  m_effMap.insert( m_effMap.end(), std::pair< const hash_t, TEfficiency* >( effHash, &effRef ) );
 
  return &effRef;
}

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 295 of file AthHistogramming.h.

{
  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 tDir = "", std::string stream = "" )

protectedinherited

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

Definition at line 83 of file AthHistogramming.cxx.

{
  // Modify the name and title according to the prefixes of this classes instance
  std::string histName(histRef.GetName());
  const std::string histTitle(histRef.GetTitle());
  std::string bookingString("");
 
  this->buildBookingString( bookingString, histName, tDir, stream );
  histRef.SetTitle((m_histTitlePrefix+histTitle+m_histTitlePostfix).c_str() );
  histRef.SetName(histName.c_str());
 
  // Check if the hash for this histName already exists, i.e., if we have a hash collision
  const hash_t histHash = this->hash(histName);
  HistMap_t::const_iterator it = m_histMap.find( histHash );
  if ( it != m_histMap.end() ) // It does exist!
    {
      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 NULL;
    }
 
  // Set the new name and title for the histogram, based on the prefixes that the user set for this class instance
  // Create a clone that has the new name
 
  // Massage the final string to book things
 
  // Register the histogram into the THistSvc
  if ( !((histSvc()->regHist(bookingString, &histRef)).isSuccess()) )
    {
      m_msg << MSG::WARNING
            << "Problem registering histogram with name " << histName
            << ", name prefix " << m_histNamePrefix
            << ", title " << histTitle
            << ", tile prefix " << m_histTitlePrefix
            << ", and tile postfix " << m_histTitlePostfix
            << " in " << m_name << "!" << endmsg;
      return NULL;
    }
 
  // Also register it in the local map of string to pointer
  m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, &histRef ) );
 
  return &histRef;
}

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 274 of file AthHistogramming.h.

{
  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()

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

privateinherited

Method to build individual booking string.

Definition at line 545 of file AthHistogramming.cxx.

{
  // Massage the final string to book things
  if(tDir.empty()) tDir = m_rootDir;
  size_t pos = histName.rfind('/');
  if(pos != std::string::npos){
    tDir+='/';
    tDir.append(histName, 0,pos);
    histName.erase(0,pos+1);
  };
  if(stream.empty()) stream = m_streamName;
 
  if(usePrefixPostfix){
    bookingString = "/"+stream+"/"+tDir+"/"+m_histNamePrefix+histName+m_histNamePostfix;
  } else {
    bookingString = "/"+stream+"/"+tDir+"/"+histName;
  }
  while(bookingString.find("//") != std::string::npos){
    this->myReplace(bookingString,"//","/");
  }
 
  return;
}

configAthHistogramming()

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

protectedinherited

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

Definition at line 51 of file AthHistogramming.cxx.

{
  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; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 235 of file AthHistogramming.cxx.

{
  // 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...
 
      // Need to copy the strings as we will massage them from here on
      std::string effNameCopy = effName;
      std::string tDirCopy     = tDir;
      std::string streamCopy   = stream;
 
      // Massage the final string to book things
      std::string bookingString("");
      this->buildBookingString( bookingString, effNameCopy, tDirCopy, streamCopy ,false);
 
      TEfficiency* effPointer(NULL);
      if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
        {
          // Massage the final string to book things
          std::string bookingString("");
          this->buildBookingString( bookingString, effNameCopy, tDirCopy, streamCopy, true );
 
          if ( !((histSvc()->getEfficiency(bookingString, effPointer)).isSuccess()) )
            {
              m_msg << MSG::WARNING
                    << "Problem retrieving the TEfficiency with name (including pre- and post-fixes) "
                    << m_histNamePrefix + effNameCopy + m_histNamePostfix
                    << " or with name " << effNameCopy
                    << " 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 MuonValR4::MuonFastRecoTester::execute ( const EventContext & ctx )

overridevirtual

Execute method.

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

Implements AthAlgorithm.

Definition at line 117 of file MuonFastRecoTester.cxx.

                                                                  {
        
                //const ActsTrk::GeometryContext* gctxPtr{nullptr};
        //ATH_CHECK(SG::get(gctxPtr, m_geoCtxKey, ctx));
 
        const SpacePointContainer* spContainer {nullptr};
        ATH_CHECK(SG::get(spContainer, m_spKey, ctx));
            
        const SpacePointContainer* NSWspContainer {nullptr};
        ATH_CHECK(SG::get(NSWspContainer, m_NSWspKey, ctx));
 
        const GlobalPatternContainer* globPatterns{nullptr};
        ATH_CHECK(SG::get(globPatterns, m_patternKey, ctx));
 
        const xAOD::MuonSegmentContainer* readTruthSegments{nullptr};
        if(m_isMC){
             ATH_CHECK(SG::get(readTruthSegments , m_truthSegmentKey, ctx));
        }
        const TrigRoiDescriptorCollection* roiCollection{nullptr};
        if(m_isSeededReco) {
            ATH_CHECK(SG::get(roiCollection, m_roiCollectionKey, ctx));
        }
            
        ATH_MSG_DEBUG("Succesfully retrieved input collections: Global Patterns: "<<globPatterns->size()
                    <<", truth segments: "<<(readTruthSegments? std::to_string(readTruthSegments->size()) : std::to_string(-1))
                    <<", Rois: "<<(roiCollection ? std::to_string(roiCollection->size()) : std::to_string(-1)));
 
        const TruthParticleMap truthMap{fillTruthMap(readTruthSegments, roiCollection)};
        fillTruthInfo(truthMap, {spContainer, NSWspContainer});
        fillRoIInfo(roiCollection);
 
        if (m_writeSpacePoints) {
            fillSpacePointInfo(spContainer, globPatterns, truthMap, 
                *m_spTester, m_spType, m_spMatchedToPattern, m_spMatchedToTruth);
            fillSpacePointInfo(NSWspContainer, globPatterns, truthMap, 
                *m_NSWspTester, m_NSWspType, m_NSWspMatchedToPattern, m_NSWspMatchedToTruth);
        }
        fillGlobPatternInfo(globPatterns, truthMap, 
            std::vector<const MuonR4::SpacePointContainer*>{spContainer, NSWspContainer});
 
        ATH_CHECK(m_tree.fill(ctx));
        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 & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 50 of file AthAlgorithm.cxx.

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

fillGlobPatternInfo()

void MuonValR4::MuonFastRecoTester::fillGlobPatternInfo ( const MuonR4::GlobalPatternContainer * patternCont, const TruthParticleMap & truthHits, const std::vector< const MuonR4::SpacePointContainer * > & spContainers )

private

Fill the info associated to the global patterns into the tree.

Parameters

patternCont	Pointer to the global pattern container
truthHits	Map of truth particle hits, needed to match patterns to truth
spContainers	Vector of pointers to space point containers, needed to compute pattern hit counts

Definition at line 342 of file MuonFastRecoTester.cxx.

                                                                                                                  {
        m_pat_n = patternCont->size();
        // Resize all the matrix branches
        resize_all(patternCont->size(), s_nStations,
                    m_pat_nNonPrecMeas, m_pat_nPrecMeas, m_pat_nPhiMeas, 
                    m_pat_nPileupNonPrecMeas, m_pat_nPileupPrecMeas, m_pat_nPileupPhiMeas,
                    m_pat_nAllNonPrecMeas, m_pat_nAllPrecMeas, m_pat_nAllPhiMeas);
        if (m_isMC) {
            resize_all(patternCont->size(), s_nStations,
                        m_pat_nTruthNonPrecMeas, m_pat_nTruthPrecMeas, m_pat_nTruthPhiMeas,
                        m_pat_nMisTruthNonPrecMeas, m_pat_nMisTruthPrecMeas, m_pat_nMisTruthPhiMeas);
        }
        auto isSecondaryMatched = [&truthHits](const SpacePoint* sp, std::size_t tpIdx) {
            return sp->secondaryMeasurement() && isTruthMatched(*sp->secondaryMeasurement(), truthHits) == tpIdx;
        };
        std::size_t patternIdx{0};
        for (const GlobalPattern* pattern : *patternCont) {
            // We define a map of truth particles and associated hits for the current pattern, so we can determine the main truth particle is multiple are associated
            std::unordered_map<std::size_t, std::vector<const SpacePoint*>> patternTruthHits{};
 
            const std::vector<StIndex> stations {pattern->getStations()};
            for (const StIndex station : stations) {
                for (const SpacePoint* sp : pattern->hitsInStation(station)) {
                    updatePatHitInfo(ePatBranchType::eReco, patternIdx, station, sp);
 
                    if (!m_isMC) continue;
                    if (const auto tpIdx {isTruthMatched(*sp->primaryMeasurement(), truthHits)}; tpIdx.has_value()) {
                        // By convention, if truth particle index is equal to the size of the truth map, it means it's a pileup particle
                        if (*tpIdx >= truthHits.size() ) {
                            updatePatHitInfo(ePatBranchType::ePileup, patternIdx, station, sp, isSecondaryMatched(sp, *tpIdx));
                        } else {
                            patternTruthHits[*tpIdx].push_back(sp);
                        }
                    }
                }
            }
            if (!patternTruthHits.empty()) {
                // Sort the TPs by number of matched hits and define the main truth particle as the one with the most hits in the pattern
                std::vector<std::size_t> sortedTPs {};
                std::ranges::transform(patternTruthHits, std::back_inserter(sortedTPs), [](const auto& pair){ return pair.first; });
                std::ranges::sort(sortedTPs, [&patternTruthHits](const auto& a, const auto& b){
                    return patternTruthHits.at(a).size() > patternTruthHits.at(b).size();
                });
                const auto mainTP = sortedTPs.front();
                for (const SpacePoint* sp : patternTruthHits[mainTP]) {
                    const StIndex station {m_idHelperSvc->stationIndex(sp->identify())};
                    updatePatHitInfo(ePatBranchType::eTruth, patternIdx, station, sp, isSecondaryMatched(sp, mainTP));
                }
                // Add truth hits that are matched to other truth particles than the main one
                for (const auto& [tpIdx, hits] : patternTruthHits) {
                    if (tpIdx == mainTP) continue;
                    for (const SpacePoint* sp : hits) {
                        const StIndex station {m_idHelperSvc->stationIndex(sp->identify())};
                        updatePatHitInfo(ePatBranchType::eMismatched, patternIdx, station, sp, isSecondaryMatched(sp, tpIdx));
                    }
                }
                // Save the matched truth particle index in the tree, either is a signal or pileup particle
                std::ranges::transform(sortedTPs, std::back_inserter(m_pat_MatchedToTruth[patternIdx]), [](const auto& tp){ return tp; });
            }
            // Loop over the space point containers to count the number of hits in the buckets crossed by the pattern
            for (const SpacePointContainer* spContainer : spContainers) {
                if (!spContainer) continue;
                for (const SpacePointBucket* bucket : *spContainer) {
                    bool bucketInPattern{false};
                    const StIndex bucketStation {m_idHelperSvc->stationIndex(bucket->front()->identify())};
                    std::vector<const SpacePoint*> allHits{};
                    
                    for (const auto& sp : *bucket) {
                        if (isInPattern(sp.get(), bucketStation, *pattern)) {
                            bucketInPattern = true;
                        }
                        allHits.push_back(sp.get());
                    }
                    if (bucketInPattern) {
                        for (const SpacePoint* sp : allHits) {
                            updatePatHitInfo(ePatBranchType::eAll, patternIdx, bucketStation, sp);
                        }
                    }
                }
            }
            m_pat_Eta.push_back(-std::log(std::tan(pattern->theta()/2.)));
            m_pat_phi.push_back(pattern->phi());
            m_pat_sector1.push_back(pattern->sector());
            m_pat_sector2.push_back(pattern->secondarySector());
            m_pat_meanNormResidual2.push_back(pattern->meanNormResidual2());
            m_pat_side.push_back(pattern->hitsInStation(stations.front()).front()->msSector()->side());
            m_pat_nStations.push_back(stations.size());
 
            if (msgLevel(MSG::VERBOSE)) {
                const auto mainTP {m_pat_MatchedToTruth[patternIdx].size() > 0 ? static_cast<int>(m_pat_MatchedToTruth[patternIdx].front()) : -1};
                unsigned nPrecHits{0}, nNonPrecHits{0}, nPhiHits{0};
                unsigned gen_nPrecHits{0}, gen_nNonPrecHits{0}, gen_nPhiHits{0};
                for (std::size_t stIdx = 0; stIdx < s_nStations; ++stIdx) {
                    nPrecHits += static_cast<unsigned>(m_pat_nTruthPrecMeas[patternIdx][stIdx]);
                    nNonPrecHits += static_cast<unsigned>(m_pat_nTruthNonPrecMeas[patternIdx][stIdx]);
                    nPhiHits += static_cast<unsigned>(m_pat_nTruthPhiMeas[patternIdx][stIdx]);
                    if (mainTP < 0) continue;
                    gen_nPrecHits += static_cast<unsigned>(m_gen_nPrecMeas[mainTP][stIdx]);
                    gen_nNonPrecHits += static_cast<unsigned>(m_gen_nNonPrecMeas[mainTP][stIdx]);
                    gen_nPhiHits += static_cast<unsigned>(m_gen_nPhiMeas[mainTP][stIdx]);
                }
                ATH_MSG_VERBOSE("Pat #" << patternIdx<< ": " << *pattern << "mainTP: "<<std::to_string(mainTP)
                    <<", nTruthMatchedHits Trig: "<<nNonPrecHits<<" / "<<gen_nNonPrecHits<<", Prec: "<<nPrecHits<<" / "<<gen_nPrecHits<<", Phi: "<<nPhiHits<<" / "<<gen_nPhiHits);
            }
            patternIdx++;
        }                        
    }

fillRoIInfo()

void MuonValR4::MuonFastRecoTester::fillRoIInfo ( const TrigRoiDescriptorCollection * roiCollection )

private

Fill the RoI information into the tree.

Parameters

roiCollection

Pointer to the RoI collection

Definition at line 301 of file MuonFastRecoTester.cxx.

                                                                                         {
        if (!m_isSeededReco || !roiCollection || roiCollection->empty()) return;
        for (const TrigRoiDescriptor* roi : *roiCollection) {
            m_roi_EtaMin.push_back(roi->etaMinus());
            m_roi_EtaMax.push_back(roi->etaPlus());
            m_roi_PhiMin.push_back(roi->phiMinus());
            m_roi_PhiMax.push_back(roi->phiPlus());
            m_roi_ZMin.push_back(roi->zedMinus());
            m_roi_ZMax.push_back(roi->zedPlus());
        }
    }

fillSpacePointInfo()

void MuonValR4::MuonFastRecoTester::fillSpacePointInfo ( const MuonR4::SpacePointContainer * spc, const MuonR4::GlobalPatternContainer * patternCont, const TruthParticleMap & truthHits, SpacePointTesterModule & spTester, MuonVal::VectorBranch< unsigned char > & spTypeBranch, MuonVal::MatrixBranch< unsigned char > & spMatchedToPatternBranch, MuonVal::MatrixBranch< unsigned char > & spMatchedToTruthBranch ) const

private

Fill the space point information into the tree.

Parameters

spc	Pointer to the space point container
patternCont	Pointer to the global pattern container, needed to match spacepoints to patterns
truthHits	Map of truth particle hits
spTester	Space point branches
spTypeBranch	Branch for space point types
spMatchedToPatternBranch	Branch for space point matches to patterns
spMatchedToTruthBranch	Branch for space point matches to truth

Definition at line 312 of file MuonFastRecoTester.cxx.

                                                                                                                  {
        if (!spc) return;
        for (const SpacePointBucket* bucket : *spc) {
            for (const auto& sp : *bucket) {
                measType type {MuonR4::isPrecisionHit(*sp) ? measType::Prec : (sp->measuresEta() ? measType::NonPrec : measType::Phi)};
                spTypeBranch.push_back(Acts::toUnderlying(type));
                if(!m_isMC) continue;
                if (const auto tpIdx {isTruthMatched(*sp->primaryMeasurement(), truthHits)}; tpIdx.has_value()) {
                    unsigned treeIdx = spTester.push_back(*sp);
                    spMatchedToTruthBranch[tpIdx.value()].push_back(treeIdx);
                }
            }
        }
        std::size_t patternIdx{0};
        for (const GlobalPattern* pattern : *patternCont) {
            for (const StIndex station : pattern->getStations()) {
                for (const SpacePoint* sp : pattern->hitsInStation(station)) {
                    unsigned treeIdx = spTester.push_back(*sp);
                    spMatchedToPatternBranch[patternIdx].push_back(treeIdx);
                }
            }       
            ++patternIdx;
        }
    }

fillTruthInfo()

void MuonValR4::MuonFastRecoTester::fillTruthInfo ( const TruthParticleMap & truthHits, const std::vector< const MuonR4::SpacePointContainer * > & spContainers )

private

Fill the truth particle information into the tree.

Parameters

truthHits	Map of truth particle hits
spContainers	Vector of pointers to space point containers, needed for truth hit counts

Track which layers already have a spacepoint to avoid double counting. This is done per station.

Select the measurement type

Select the truth particle

Filling truth hit counts. We cannot use directly the segments because we have sim hits that haven't made it into spacepoints due to inefficiencies

Select the buckets in this station

Geometric (sanity) check: sector & side

Definition at line 187 of file MuonFastRecoTester.cxx.

                                                                                                            {
        if (!m_isMC || truthHits.empty()) return;
        resize_all(truthHits.size(), s_nStations, 
                   m_gen_nNonPrecMeas, m_gen_nPrecMeas, m_gen_nPhiMeas);
        using enum measType;
        using LayerBookeeper = std::unordered_map<const MuonGMR4::SpectrometerSector*, std::set<unsigned>>;
        using MeasBookeeper = std::array<std::vector<const SpacePoint*>, Acts::toUnderlying(nTypes)>;
        MeasBookeeper measInStation{};
        LayerBookeeper seenEtaLayers{};
        LayerBookeeper seenPhiLayers{};
 
        auto processMeas = [&truthHits, &measInStation, &seenEtaLayers, &seenPhiLayers, this]
                    (const SpacePoint* sp, const measType type, const bool process2Dmeas, const int tpIdx, const std::size_t stIdx) {
            const bool isPrec {MuonR4::isPrecisionHit(*sp)};
            if ((type == Prec && !isPrec) || 
                (type == NonPrec && (isPrec || !sp->measuresEta())) || (type == Phi && sp->measuresEta())) {
                return;
            }
            /* Check if the hit has already been counted, i.e. duplicated hits. Needed for precision hits, since we can have multiple on the same layer */
            std::vector<const SpacePoint*>& outCont {measInStation[Acts::toUnderlying(type)]};
            if (std::ranges::find_if(outCont, [sp](const SpacePoint* s) { 
                    return s->primaryMeasurement() == sp->primaryMeasurement(); }) != outCont.end()) {
                return;
            }
            if (isTruthMatched(*sp->primaryMeasurement(), truthHits) != tpIdx) return;
 
            const bool isDoubleMatched {sp->dimension() == 2u && sp->secondaryMeasurement() && isTruthMatched(*sp->secondaryMeasurement(), truthHits) == tpIdx};
            if (process2Dmeas && !isDoubleMatched) return;
 
            /* Check if we have already measurements in the same layer, except for precision hits */
            const unsigned layNum {m_spSorter.sectorLayerNum(*sp)};
            
            if (sp->measuresEta()) {
                const bool isSeenLayer {seenEtaLayers[sp->msSector()].count(layNum) > 0};
                if (isSeenLayer && !sp->isStraw()) return;
                if (!isSeenLayer) seenEtaLayers[sp->msSector()].insert(layNum);
                auto& measCounter = isPrec ? m_gen_nPrecMeas : m_gen_nNonPrecMeas;
                ++measCounter[tpIdx][stIdx];
 
                // Eta hit can also have phi measurements. For combined spacepoints, need to be check the secondaty measurements. No need for 2D spacepoints.
                if (sp->measuresPhi() && isDoubleMatched) {
                    seenPhiLayers[sp->msSector()].insert(layNum);
                    ++m_gen_nPhiMeas[tpIdx][stIdx];
                    measInStation[Acts::toUnderlying(Phi)].push_back(sp);
                }
            } else {
                if (seenPhiLayers[sp->msSector()].count(layNum) > 0) return;
                seenPhiLayers[sp->msSector()].insert(layNum);
                ++m_gen_nPhiMeas[tpIdx][stIdx];
            }
            outCont.push_back(sp);
            ATH_MSG_VERBOSE("---> "<<(isPrec ? "Prec" : (type == NonPrec ? "Trig" : "Phi "))<< " " << *sp << " in sector "<<sp->msSector()->identString() << " lay "<<layNum);
        };
 
        int tpIdx{-1};
        for (const auto& [tp, _] : truthHits) {
            if(!tp) continue;
            m_gen_Eta.push_back(tp->eta());
            m_gen_Phi.push_back(tp->phi());
            m_gen_Pt.push_back(tp->pt());
            m_gen_Q.push_back(tp->charge());
            ++tpIdx;
            // Save the sectors compatible for the tp
            std::vector<int> sectors{};
            sectorMap.getSectors(tp->phi(), sectors);
            const int side {tp->eta() > 0 ? 1 : -1};
            ATH_MSG_VERBOSE("tp: " << tpIdx << ", Eta: " << tp->eta() << ", Phi: " << inDegrees(tp->phi()) << ", Pt [GeV]: " << tp->pt() * 1e-3 << ", Q: " << tp->charge());
            for (std::size_t stIdx = 0; stIdx < s_nStations; ++stIdx) {
                ATH_MSG_VERBOSE("\tStation "<< stName(static_cast<StIndex>(stIdx)) << ": matched hits before layer deduplication: ");
                // Clear the bookkeeping structures for the new station
                for (auto& vec : measInStation) vec.clear();
                seenEtaLayers.clear();
                seenPhiLayers.clear();
                // We fill per measurement type, so we give priority to precision hits if they are in the same layer as trigger hits, e.g. sTGCs
                for (const measType type : {Prec, NonPrec, Phi}) {
                    // We fill first 2D measurements and then 1D ones
                    for (const bool process2Dmeas : {true, false}) {
                        for (const auto& spContainer : spContainers) {
                            if (!spContainer) continue;
                            for (const SpacePointBucket* bucket : *spContainer) {
                                if (static_cast<std::size_t>(m_idHelperSvc->stationIndex(bucket->front()->identify())) != stIdx) continue;
                                if (bucket->msSector()->side() != side ||
                                    std::ranges::none_of(sectors, [&](int s){ return bucket->msSector()->sector() == s; })) {
                                    continue;
                                }
                                for (const auto& sp : *bucket) {
                                    /* Process first the precision hits, 2D measurements first and then 1D */
                                    processMeas(sp.get(), type, process2Dmeas, tpIdx, stIdx);
                                }
                            } // End loop over buckets
                        } // End loop over containers
                    } // End loop over "process2Dmeas" flag
                } // End loop over measurement types
                if (msgLevel(MSG::VERBOSE)) {
                    const auto gen_nNonPrecHits {static_cast<unsigned>(m_gen_nNonPrecMeas[tpIdx][stIdx])};
                    const auto gen_nPrecHits    {static_cast<unsigned>(m_gen_nPrecMeas[tpIdx][stIdx])};
                    const auto gen_nPhiHits     {static_cast<unsigned>(m_gen_nPhiMeas[tpIdx][stIdx])};
                    if (gen_nNonPrecHits + gen_nPrecHits + gen_nPhiHits > 0) {
                        ATH_MSG_VERBOSE("\t after deduplication: N trig/Prec/phi meas: " 
                               << gen_nNonPrecHits << "/" << gen_nPrecHits << "/" << gen_nPhiHits);
                    }
                }
                 
            } // End loop over stations      
        } // End loop over truth particles
    }

fillTruthMap()

TruthParticleMap MuonValR4::MuonFastRecoTester::fillTruthMap ( const xAOD::MuonSegmentContainer * truthSegments, const TrigRoiDescriptorCollection * roiCollection ) const

private

Fill the truth particle map.

Parameters

truthSegments	Pointer to the truth segments
roiCollection	Pointer to the RoI collection, needed to match truth particles to RoIs in seeded reco

Returns

Map of truth particle hits

In seeded reco, we want to include only truth particles that are in the RoIs

Check eta

Check phi

Definition at line 160 of file MuonFastRecoTester.cxx.

                                                                                                              {
        if (!truthSegments) return TruthParticleMap{};
        ATH_MSG_VERBOSE("Filling truth map with "<<truthSegments->size());                                                    
        auto isInROI = [roiCollection](const xAOD::TruthParticle* tp) {
            for (const TrigRoiDescriptor* roi : *roiCollection) {
                if (tp->eta() < roi->etaMinus() || tp->eta() > roi->etaPlus()) continue;
                const double dPhiPlus = CxxUtils::deltaPhi(roi->phiPlus(), tp->phi());
                const double dPhiMinus = CxxUtils::deltaPhi(roi->phiMinus(), tp->phi());
                if (dPhiPlus >= 0. && dPhiMinus <= 0.) return true;
            }
            return false;
        };
 
        TruthParticleMap truthMap{};
        for (const xAOD::MuonSegment* truth : *truthSegments) {
            const xAOD::TruthParticle* tp = getTruthMatchedParticle(*truth);
            // In case of seeded reco, we only save truth particles that are in the RoIs
            if (!m_isSeededReco || !tp || isInROI(tp)){
                truthMap[tp].push_back(getMatchingSimHits(*truth));
            }    
        }
        return truthMap;
    }

filterPassed() [1/2]

bool AthAlgorithm::filterPassed ( ) const

inherited

Definition at line 94 of file AthAlgorithm.cxx.

                                      {
  return filterPassed( Gaudi::Hive::currentContext() );
}

filterPassed() [2/2]

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

inherited

Definition at line 98 of file AthAlgorithm.cxx.

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

finalize()

StatusCode MuonValR4::MuonFastRecoTester::finalize ( )

overridevirtual

Definition at line 113 of file MuonFastRecoTester.cxx.

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

getContext()

const EventContext & AthAlgorithm::getContext ( ) const

inherited

Deprecated methods (use the ones with EventContext).

Definition at line 90 of file AthAlgorithm.cxx.

                                                   {
  return Gaudi::Hive::currentContext();
}

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 477 of file AthHistogramming.cxx.

{
  // 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...
 
      // Need to copy the strings as we will massage them from here on
      std::string graphNameCopy = graphName;
      std::string tDirCopy      = tDir;
      std::string streamCopy    = stream;
 
      // Massage the final string to book things
      std::string bookingString("");
      this->buildBookingString( bookingString, graphNameCopy, tDirCopy, streamCopy, true);
 
      TGraph* graphPointer(NULL);
      if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
        {
          // Massage the final string to book things
          std::string bookingString("");
          this->buildBookingString( bookingString, graphNameCopy, tDirCopy, streamCopy, false );
 
          if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
            {
              m_msg << MSG::WARNING
                    << "Problem retrieving the TGraph with name (including pre- and post-fixes) "
                    << m_histNamePrefix + graphNameCopy + m_histNamePostfix
                    << " or with name " << graphNameCopy
                    << " 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 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 ( const std::string & histName ) const

inlineprivateinherited

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

Definition at line 430 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 183 of file AthHistogramming.cxx.

{
  // Build a 32 bit hash out of the name
  const hash_t histHash = this->hash(histName);
 
  // See if this entry exists in the map
  HistMap_t::const_iterator it = m_histMap.find( histHash );
  if ( it == m_histMap.end() ) // It doesn't exist!
    { // Let's see into the THistSvc if somebody else has registered the histogram...
 
      // Need to copy the strings as we will massage them from here on
      std::string histNameCopy = histName;
      std::string tDirCopy     = tDir;
      std::string streamCopy   = stream;
 
      // Massage the final string to book things
      std::string bookingString("");
      this->buildBookingString( bookingString, histNameCopy, tDirCopy, streamCopy ,false);
 
      TH1* histPointer(NULL);
      if ( !((histSvc()->getHist(bookingString, histPointer)).isSuccess()) )
        {
          // Massage the final string to book things
          std::string bookingString("");
          this->buildBookingString( bookingString, histNameCopy, tDirCopy, streamCopy, true );
 
          if ( !((histSvc()->getHist(bookingString, histPointer)).isSuccess()) )
            {
              m_msg << MSG::WARNING
                    << "Problem retrieving the histogram with name (including pre- and post-fixes) "
                    << m_histNamePrefix + histNameCopy + m_histNamePostfix
                    << " or with name " << histNameCopy
                    << " 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 histogram in the THistSvc.
          // So let's add it to the local cache map and return its pointer
          m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, histPointer ) );
          return histPointer;
        }
      // If we get to here, we actually found the histogram in the THistSvc.
      // So let's add it to the local cache map and return its pointer
      m_histMap.insert( m_histMap.end(), std::pair< const hash_t, TH1* >( histHash, histPointer ) );
      return histPointer;
    }
 
 
  // Return the pointer to the histogram that we got from the local cache map
  return it->second;
}

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 371 of file AthHistogramming.h.

{
  // 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 ( const std::string & histName, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 388 of file AthHistogramming.h.

{
  // 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 MuonValR4::MuonFastRecoTester::initialize ( )

overridevirtual

Definition at line 59 of file MuonFastRecoTester.cxx.

                                              {
        ATH_CHECK(m_geoCtxKey.initialize());
        {
            int infoOpts = 0;
            if (m_isMC) infoOpts = EventInfoBranch::isMC;
            m_tree.addBranch(std::make_unique<EventInfoBranch>(m_tree, infoOpts));  
        }       
        ATH_CHECK(m_spKey.initialize(!m_spKey.empty()));
        ATH_CHECK(m_NSWspKey.initialize(!m_NSWspKey.empty()));
        ATH_CHECK(m_roiCollectionKey.initialize(m_isSeededReco));
        if (m_writeSpacePoints) {
            if (!m_spKey.empty()) {
                m_spTester = std::make_shared<SpacePointTesterModule>(m_tree, m_spKey.key(), msgLevel(), "Muon");
                m_tree.addBranch(m_spTester);
                if (!m_isMC) m_tree.disableBranch(m_spMatchedToTruth.name());
            }
            if (!m_NSWspKey.empty()) {
                m_NSWspTester = std::make_shared<SpacePointTesterModule>(m_tree, m_NSWspKey.key(), msgLevel(), "Nsw");
                m_tree.addBranch(m_NSWspTester);
                if (!m_isMC) m_tree.disableBranch(m_NSWspMatchedToTruth.name());
            }
        } else {
            m_tree.disableBranch(m_spType.name());
            m_tree.disableBranch(m_NSWspType.name());
            m_tree.disableBranch(m_spMatchedToPattern.name());
            m_tree.disableBranch(m_NSWspMatchedToPattern.name());
            m_tree.disableBranch(m_spMatchedToTruth.name());
            m_tree.disableBranch(m_NSWspMatchedToTruth.name());
        }
        if (!m_isMC) {
            m_tree.disableBranch(m_gen_Eta.name());
            m_tree.disableBranch(m_gen_Phi.name());
            m_tree.disableBranch(m_gen_Pt.name());
            m_tree.disableBranch(m_gen_Q.name());
            m_tree.disableBranch(m_pat_nTruthNonPrecMeas.name());
            m_tree.disableBranch(m_pat_nTruthPrecMeas.name());
            m_tree.disableBranch(m_pat_nTruthPhiMeas.name());
            m_tree.disableBranch(m_pat_MatchedToTruth.name());
        }
        if (!m_isSeededReco) {
            m_tree.disableBranch(m_roi_EtaMin.name());
            m_tree.disableBranch(m_roi_EtaMax.name());
            m_tree.disableBranch(m_roi_PhiMin.name());
            m_tree.disableBranch(m_roi_PhiMax.name());
            m_tree.disableBranch(m_roi_ZMin.name());
            m_tree.disableBranch(m_roi_ZMax.name());
        }
        ATH_CHECK(m_patternKey.initialize());
        ATH_CHECK(m_truthSegmentKey.initialize(!m_truthSegmentKey.empty()));   
        ATH_CHECK(m_tree.init(this)); 
        ATH_CHECK(m_idHelperSvc.retrieve());
        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.

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 111 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);
  }

myReplace()

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

privateinherited

Helper method to replace sub-string.

Definition at line 575 of file AthHistogramming.cxx.

{
  size_t pos = 0;
  while((pos = str.find(oldStr, pos)) != std::string::npos)
    {
      str.replace(pos, oldStr.length(), newStr);
      pos += newStr.length();
    }
}

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed() [1/2]

void AthAlgorithm::setFilterPassed ( bool state ) const

inherited

Definition at line 102 of file AthAlgorithm.cxx.

                                                     {
  setFilterPassed( state, Gaudi::Hive::currentContext() );
}

setFilterPassed() [2/2]

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

inherited

Definition at line 106 of file AthAlgorithm.cxx.

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

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthAlgorithm.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

{
  // ---- 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 ( const std::string & treeName, const std::string & tDir = "", const std::string & stream = "" )

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 363 of file AthHistogramming.cxx.

{
  // 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...
 
      // Need to copy the strings as we will massage them from here on
      std::string treeNameCopy = treeName;
      std::string tDirCopy     = tDir;
      std::string streamCopy   = stream;
 
      // Massage the final string to book things
      std::string bookingString("");
      this->buildBookingString( bookingString, treeNameCopy, tDirCopy, streamCopy );
 
      TTree* treePointer(NULL);
      if ( !((histSvc()->getTree(bookingString, treePointer)).isSuccess()) )
        {
          m_msg << MSG::WARNING
                << "Problem retrieving the TTree with name " << treeNameCopy
                << " 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;
}

updatePatHitInfo()

void MuonValR4::MuonFastRecoTester::updatePatHitInfo ( const ePatBranchType type, const std::size_t patIdx, const Muon::MuonStationIndex::StIndex hitSt, const MuonR4::SpacePoint * sp, const bool isSecondaryMatched = false )

private

Update the hit counts for a given pattern branch type.

Parameters

type	The pattern branch type
patIdx	Index of the pattern
hitSt	Station index of the hit
sp	Pointer to the space point
isSecondaryMatched	if the spacepoint has a secondary measurement and it is matched to truth

Definition at line 452 of file MuonFastRecoTester.cxx.

                                                                             {
        using enum ePatBranchType;
        const bool isTruthInfo = (type == ePatBranchType::eTruth || type == ePatBranchType::eMismatched);
        const auto updateCounts = [&](unsigned char& nonPrecCount, 
                                      unsigned char& precCount, 
                                      unsigned char& phiCount) {
            if (sp->measuresEta()) {
                if (MuonR4::isPrecisionHit(*sp)) precCount++;
                else nonPrecCount++;
                if (type == ePatBranchType::eTruth) {
                    ATH_MSG_VERBOSE("---> "<<(MuonR4::isPrecisionHit(*sp) ? "Prec" : "Trig")<< " " << *sp << " in sector "<<sp->msSector()->identString() << " lay "<<m_spSorter.sectorLayerNum(*sp));
                }
            }
            if (sp->measuresPhi() && (!isTruthInfo || isSecondaryMatched)) {
                ++phiCount;
                if (type == ePatBranchType::eTruth) {
                    ATH_MSG_VERBOSE("---> "<<"Phi  " << *sp << " in sector "<<sp->msSector()->identString() << " lay "<<m_spSorter.sectorLayerNum(*sp));
                }
            }
        };
        const auto stIdx = Acts::toUnderlying(hitSt);
        switch (type) {
            case eReco:
                updateCounts(m_pat_nNonPrecMeas[patIdx][stIdx], 
                    m_pat_nPrecMeas[patIdx][stIdx], m_pat_nPhiMeas[patIdx][stIdx]);
                return;
            case eTruth:
                updateCounts(m_pat_nTruthNonPrecMeas[patIdx][stIdx], 
                    m_pat_nTruthPrecMeas[patIdx][stIdx], m_pat_nTruthPhiMeas[patIdx][stIdx]);
                return;
            case eMismatched:
                updateCounts(m_pat_nMisTruthNonPrecMeas[patIdx][stIdx], 
                    m_pat_nMisTruthPrecMeas[patIdx][stIdx], m_pat_nMisTruthPhiMeas[patIdx][stIdx]);
                return;
            case eAll:
                updateCounts(m_pat_nAllNonPrecMeas[patIdx][stIdx], 
                    m_pat_nAllPrecMeas[patIdx][stIdx], m_pat_nAllPhiMeas[patIdx][stIdx]);
                return;
            case ePileup:
                updateCounts(m_pat_nPileupNonPrecMeas[patIdx][stIdx], 
                    m_pat_nPileupPrecMeas[patIdx][stIdx], m_pat_nPileupPhiMeas[patIdx][stIdx]);
                return;
        }
    }

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 210 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 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 114 of file AthAlgorithm.h.

m_gen_Eta

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_gen_Eta {m_tree.newVector<float>("gen_Eta",-10.)}

private

Definition at line 139 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("gen_Eta",-10.)};

m_gen_nNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_gen_nNonPrecMeas {m_tree.newMatrix<unsigned char>("gen_NNonPrecMeas", 0)}

private

Number of trigger eta measurements per station.

Definition at line 144 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("gen_NNonPrecMeas", 0)};

m_gen_nPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_gen_nPhiMeas {m_tree.newMatrix<unsigned char>("gen_NPhiMeas", 0)}

private

Number of phi measurements per station.

Definition at line 148 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("gen_NPhiMeas", 0)};

m_gen_nPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_gen_nPrecMeas {m_tree.newMatrix<unsigned char>("gen_NPrecMeas", 0)}

private

Number of precision measurements per station.

Definition at line 146 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("gen_NPrecMeas", 0)};

m_gen_Phi

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_gen_Phi {m_tree.newVector<float>("gen_Phi",-10.)}

private

Definition at line 140 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("gen_Phi",-10.)};

m_gen_Pt

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_gen_Pt {m_tree.newVector<float>("gen_Pt",-10.)}

private

Definition at line 141 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("gen_Pt",-10.)}; 

m_gen_Q

MuonVal::VectorBranch<short>& MuonValR4::MuonFastRecoTester::m_gen_Q {m_tree.newVector<short>("gen_Q", 0)}

private

====== Truth particle block ===========

properties of truth particles

Definition at line 138 of file MuonFastRecoTester.h.

{m_tree.newVector<short>("gen_Q", 0)};

m_geoCtxKey

ActsTrk::GeoContextReadKey_t MuonValR4::MuonFastRecoTester::m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}

private

Definition at line 112 of file MuonFastRecoTester.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 224 of file AthHistogramming.h.

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 203 of file AthHistogramming.h.

m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix

privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix

privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc

privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix

privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix

privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

m_idHelperSvc

ServiceHandle<Muon::IMuonIdHelperSvc> MuonValR4::MuonFastRecoTester::m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}

private

Definition at line 113 of file MuonFastRecoTester.h.

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

m_isMC

BooleanProperty MuonValR4::MuonFastRecoTester::m_isMC {this, "isMC", false, "Toggle whether the job is ran on MC or not"}

private

Definition at line 115 of file MuonFastRecoTester.h.

{this, "isMC", false, "Toggle whether the job is ran on MC or not"};

m_isSeededReco

BooleanProperty MuonValR4::MuonFastRecoTester::m_isSeededReco {this, "isSeededReco", false, "Toggle whether the job is ran on seeded reconstruction or not"}

private

Definition at line 117 of file MuonFastRecoTester.h.

{this, "isSeededReco", false, "Toggle whether the job is ran on seeded reconstruction or not"};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 250 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 247 of file AthHistogramming.h.

m_NSWspKey

SG::ReadHandleKey<MuonR4::SpacePointContainer> MuonValR4::MuonFastRecoTester::m_NSWspKey {this, "NswSpacePointKey", "NswSpacePoints"}

private

Definition at line 101 of file MuonFastRecoTester.h.

{this, "NswSpacePointKey", "NswSpacePoints"};

m_NSWspMatchedToPattern

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_NSWspMatchedToPattern {m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_patternMatched")}

private

Definition at line 131 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_patternMatched")};

m_NSWspMatchedToTruth

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_NSWspMatchedToTruth {m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_truthMatched")}

private

Definition at line 134 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>(m_NSWspKey.key()+"_truthMatched")};

m_NSWspTester

std::shared_ptr<SpacePointTesterModule> MuonValR4::MuonFastRecoTester::m_NSWspTester {}

private

Definition at line 125 of file MuonFastRecoTester.h.

{};

m_NSWspType

MuonVal::VectorBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_NSWspType {m_tree.newVector<unsigned char>(m_NSWspKey.key()+"_type")}

private

Definition at line 128 of file MuonFastRecoTester.h.

{m_tree.newVector<unsigned char>(m_NSWspKey.key()+"_type")};

m_pat_Eta

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_pat_Eta {m_tree.newVector<float>("pat_Eta", 0.0)}

private

pattern average theta & phi

Definition at line 155 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("pat_Eta", 0.0)};

m_pat_MatchedToTruth

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_MatchedToTruth {m_tree.newMatrix<unsigned char>("pat_truthMatched")}

private

Branch indicating which truth particles in the tree are associated to the i-th pattern.

We can have in principle multiple truth particles associated to the same pattern.

Definition at line 204 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_truthMatched")};

m_pat_meanNormResidual2

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_pat_meanNormResidual2 {m_tree.newVector<float>("pat_meanNormResidual2", 0.0)}

private

mean square normalized pattern residual

Definition at line 161 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("pat_meanNormResidual2", 0.0)};

m_pat_n

MuonVal::ScalarBranch<unsigned>& MuonValR4::MuonFastRecoTester::m_pat_n {m_tree.newScalar<unsigned>("pat_nPatterns", 0)}

private

====== Global Pattern block ===========

pattern count

Definition at line 153 of file MuonFastRecoTester.h.

{m_tree.newScalar<unsigned>("pat_nPatterns", 0)};

m_pat_nAllNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nAllNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NAllNonPrecMeas", 0)}

private

Number of trigger eta measurements in the buckets crossed by the pattern, grouped by station.

Definition at line 196 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NAllNonPrecMeas", 0)};

m_pat_nAllPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nAllPhiMeas {m_tree.newMatrix<unsigned char>("pat_NAllPhiMeas", 0)}

private

Number of phi measurements in the buckets crossed by the pattern, grouped by station.

Definition at line 200 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NAllPhiMeas", 0)};

m_pat_nAllPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nAllPrecMeas {m_tree.newMatrix<unsigned char>("pat_NAllPrecMeas", 0)}

private

Number of precision measurements in the buckets crossed by the pattern, grouped by station.

Definition at line 198 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NAllPrecMeas", 0)};

m_pat_nMisTruthNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nMisTruthNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthNonPrecMeas", 0)}

private

Number of mismatched truth trigger eta measurements per station.

Definition at line 182 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NMisTruthNonPrecMeas", 0)};

m_pat_nMisTruthPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nMisTruthPhiMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthPhiMeas", 0)}

private

Number of mismatched truth phi measurements per station.

Definition at line 186 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NMisTruthPhiMeas", 0)};

m_pat_nMisTruthPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nMisTruthPrecMeas {m_tree.newMatrix<unsigned char>("pat_NMisTruthPrecMeas", 0)}

private

Number of mismatched truth precision measurements per station.

Definition at line 184 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NMisTruthPrecMeas", 0)};

m_pat_nNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NNonPrecMeas", 0)}

private

Number of trigger eta measurements per station.

Definition at line 168 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NNonPrecMeas", 0)};

m_pat_nPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nPhiMeas {m_tree.newMatrix<unsigned char>("pat_NPhiMeas", 0)}

private

Number of phi measurements per station.

Definition at line 172 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NPhiMeas", 0)};

m_pat_nPileupNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nPileupNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPileupNonPrecMeas", 0)}

private

Number of pileup trigger eta measurements per station.

Definition at line 189 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NPileupNonPrecMeas", 0)};

m_pat_nPileupPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nPileupPhiMeas {m_tree.newMatrix<unsigned char>("pat_NPileupPhiMeas", 0)}

private

Number of pileup phi measurements per station.

Definition at line 193 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NPileupPhiMeas", 0)};

m_pat_nPileupPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nPileupPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPileupPrecMeas", 0)}

private

Number of pileup precision measurements per station.

Definition at line 191 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NPileupPrecMeas", 0)};

m_pat_nPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nPrecMeas {m_tree.newMatrix<unsigned char>("pat_NPrecMeas", 0)}

private

Number of precision measurements per station.

Definition at line 170 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NPrecMeas", 0)};

m_pat_nStations

MuonVal::VectorBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nStations {m_tree.newVector<unsigned char>("pat_NStations", 0)}

private

Number of stations.

Definition at line 165 of file MuonFastRecoTester.h.

{m_tree.newVector<unsigned char>("pat_NStations", 0)};    

m_pat_nTruthNonPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nTruthNonPrecMeas {m_tree.newMatrix<unsigned char>("pat_NTruthNonPrecMeas", 0)}

private

Number of truth trigger eta measurements per station.

Definition at line 175 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NTruthNonPrecMeas", 0)};

m_pat_nTruthPhiMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nTruthPhiMeas {m_tree.newMatrix<unsigned char>("pat_NTruthPhiMeas", 0)}

private

Number of truth phi measurements per station.

Definition at line 179 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NTruthPhiMeas", 0)};

m_pat_nTruthPrecMeas

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_pat_nTruthPrecMeas {m_tree.newMatrix<unsigned char>("pat_NTruthPrecMeas", 0)}

private

Number of truth precision measurements per station.

Definition at line 177 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>("pat_NTruthPrecMeas", 0)};

m_pat_phi

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_pat_phi {m_tree.newVector<float>("pat_Phi", 0.0)}

private

Definition at line 156 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("pat_Phi", 0.0)};

m_pat_sector1

MuonVal::VectorBranch<uint16_t>& MuonValR4::MuonFastRecoTester::m_pat_sector1 {m_tree.newVector<uint16_t>("pat_Sector1", 0)}

private

pattern primary & secondary sectors (different if the pattern is in the sector overlap)

Definition at line 158 of file MuonFastRecoTester.h.

{m_tree.newVector<uint16_t>("pat_Sector1", 0)};

m_pat_sector2

MuonVal::VectorBranch<uint16_t>& MuonValR4::MuonFastRecoTester::m_pat_sector2 {m_tree.newVector<uint16_t>("pat_Sector2", 0)}

private

Definition at line 159 of file MuonFastRecoTester.h.

{m_tree.newVector<uint16_t>("pat_Sector2", 0)};

m_pat_side

MuonVal::VectorBranch<short>& MuonValR4::MuonFastRecoTester::m_pat_side {m_tree.newVector<short>("pat_Side", 0)}

private

+1 for A-, -1 of C-side

Definition at line 163 of file MuonFastRecoTester.h.

{m_tree.newVector<short>("pat_Side", 0)};

m_patternKey

SG::ReadHandleKey<MuonR4::GlobalPatternContainer> MuonValR4::MuonFastRecoTester::m_patternKey {this, "PatternKey", "R4MuonGlobalPatterns", "global pattern container"}

private

Definition at line 104 of file MuonFastRecoTester.h.

{this, "PatternKey", "R4MuonGlobalPatterns", "global pattern container"};

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_roi_EtaMax

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_EtaMax {m_tree.newVector<float>("roi_EtaMax",-10.)}

private

Definition at line 208 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_EtaMax",-10.)};

m_roi_EtaMin

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_EtaMin {m_tree.newVector<float>("roi_EtaMin",-10.)}

private

====== RoI info ===========

Definition at line 207 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_EtaMin",-10.)};

m_roi_PhiMax

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_PhiMax {m_tree.newVector<float>("roi_PhiMax",-10.)}

private

Definition at line 210 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_PhiMax",-10.)};

m_roi_PhiMin

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_PhiMin {m_tree.newVector<float>("roi_PhiMin",-10.)}

private

Definition at line 209 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_PhiMin",-10.)};

m_roi_ZMax

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_ZMax {m_tree.newVector<float>("roi_ZMax",-10.)}

private

Definition at line 212 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_ZMax",-10.)};

m_roi_ZMin

MuonVal::VectorBranch<float>& MuonValR4::MuonFastRecoTester::m_roi_ZMin {m_tree.newVector<float>("roi_ZMin",-10.)}

private

Definition at line 211 of file MuonFastRecoTester.h.

{m_tree.newVector<float>("roi_ZMin",-10.)}; 

m_roiCollectionKey

SG::ReadHandleKey<TrigRoiDescriptorCollection> MuonValR4::MuonFastRecoTester::m_roiCollectionKey {this, "MuRoIs", "EFMuMSReco_RoI", "Name of the input data from HLTSeeding"}

private

Definition at line 110 of file MuonFastRecoTester.h.

{this, "MuRoIs", "EFMuMSReco_RoI", "Name of the input data from HLTSeeding"};

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_spKey

SG::ReadHandleKey<MuonR4::SpacePointContainer> MuonValR4::MuonFastRecoTester::m_spKey {this, "SpacePointKey", "MuonSpacePoints"}

private

Definition at line 100 of file MuonFastRecoTester.h.

{this, "SpacePointKey", "MuonSpacePoints"};

m_spMatchedToPattern

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_spMatchedToPattern {m_tree.newMatrix<unsigned char>(m_spKey.key()+"_patternMatched")}

private

Branch indicating which space points in the tree are associated to the i-th pattern.

Definition at line 130 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>(m_spKey.key()+"_patternMatched")};

m_spMatchedToTruth

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_spMatchedToTruth {m_tree.newMatrix<unsigned char>(m_spKey.key()+"_truthMatched")}

private

Branch indicating which space points in the tree are associated to the i-th truth particle.

Definition at line 133 of file MuonFastRecoTester.h.

{m_tree.newMatrix<unsigned char>(m_spKey.key()+"_truthMatched")};

m_spSorter

MuonR4::SpacePointPerLayerSorter MuonValR4::MuonFastRecoTester::m_spSorter {}

private

Definition at line 214 of file MuonFastRecoTester.h.

{};

m_spTester

std::shared_ptr<SpacePointTesterModule> MuonValR4::MuonFastRecoTester::m_spTester {}

private

====== Spacepoint block ===========

Branch dumping all the space points from the difference buckets

Definition at line 124 of file MuonFastRecoTester.h.

{};

m_spType

MuonVal::VectorBranch<unsigned char>& MuonValR4::MuonFastRecoTester::m_spType {m_tree.newVector<unsigned char>(m_spKey.key()+"_type")}

private

Type of spacepoints: 1 for trigger eta, 2 for precision, 3 for only-phi.

Definition at line 127 of file MuonFastRecoTester.h.

{m_tree.newVector<unsigned char>(m_spKey.key()+"_type")};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 228 of file AthHistogramming.h.

m_tree

MuonVal::MuonTesterTree MuonValR4::MuonFastRecoTester::m_tree {"MuonFastRecoTest","FastRecoTester"}

private

Definition at line 97 of file MuonFastRecoTester.h.

{"MuonFastRecoTest","FastRecoTester"}; 

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 217 of file AthHistogramming.h.

m_truthSegmentKey

SG::ReadHandleKey<xAOD::MuonSegmentContainer> MuonValR4::MuonFastRecoTester::m_truthSegmentKey {this, "TruthSegmentKey","MuonTruthSegments", "truth segment container"}

private

Definition at line 107 of file MuonFastRecoTester.h.

{this, "TruthSegmentKey","MuonTruthSegments", "truth segment container"};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

m_writeSpacePoints

BooleanProperty MuonValR4::MuonFastRecoTester::m_writeSpacePoints

private

Initial value:

{this, "writeSpacePoints", false,
                                             "Toggle whether the particular space poitns shall be written"}

Definition at line 119 of file MuonFastRecoTester.h.

                                      {this, "writeSpacePoints", false,
                                             "Toggle whether the particular space poitns shall be written"};

---

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

• MuonFastRecoTester.h
• MuonFastRecoTester.cxx