MuonValR4::MuonHoughTransformTester Class Reference

#include <MuonHoughTransformTester.h>

Inheritance diagram for MuonValR4::MuonHoughTransformTester:

Classes
struct	ObjectMatching

Public Types
using	TruthHitCol = std::unordered_set<const xAOD::MuonSimHit*>

Public Member Functions
virtual	~MuonHoughTransformTester ()=default
virtual StatusCode	initialize () override
virtual StatusCode	execute () override
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.
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

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

Private Types
typedef ServiceHandle< 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
std::vector< ObjectMatching >	matchWithTruth (const ActsTrk::GeometryContext &gctx, const xAOD::MuonSegmentContainer *truthSegments, const MuonR4::SegmentSeedContainer *seedContainer, const MuonR4::SegmentContainer *segmentContainer) const
unsigned int	countOnSameSide (const ActsTrk::GeometryContext &gctx, const xAOD::MuonSegment &truthSeg, const MuonR4::Segment &recoSeg) const
	Calculates how many measurements from the segment fit have the same drift sign as when evaluated with the truth parameters.
void	fillChamberInfo (const MuonGMR4::SpectrometerSector *chamber)
	Fill the current chamber info into the output.
void	fillTruthInfo (const ActsTrk::GeometryContext &gctx, const xAOD::MuonSegment *truthSegment)
	Fill the associated truth information into the tree.
void	fillBucketInfo (const MuonR4::SpacePointBucket &bucket)
	Fill the hit summary info of the associated bucket.
void	fillSeedInfo (const ObjectMatching &obj)
	Fill the info associated to the seed.
void	fillSegmentInfo (const ActsTrk::GeometryContext &gctx, const ObjectMatching &obj)
	Fill the info assciated to the segment.
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 {"MuonEtaHoughTest","MuonEtaHoughTransformTest"}
SG::ReadHandleKey< xAOD::MuonSegmentContainer >	m_truthSegmentKey {this, "TruthSegmentKey","MuonTruthSegments", "truth segment container"}
SG::ReadHandleKeyArray< MuonR4::SegmentSeedContainer >	m_inHoughSegmentSeedKeys {this, "SegmentSeedKeys", {"MuonHoughStationSegmentSeeds"}}
SG::ReadHandleKeyArray< MuonR4::SegmentContainer >	m_inSegmentKeys {this, "SegmentKeys", {"R4MuonSegments"}}
SG::ReadHandleKey< MuonR4::SpacePointContainer >	m_spKey {this, "SpacePointKey", "MuonSpacePoints"}
SG::ReadHandleKey< ActsTrk::GeometryContext >	m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}
ServiceHandle< Muon::IMuonIdHelperSvc >	m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}
Gaudi::Property< bool >	m_isMC {this, "isMC", false, "Toggle whether the job is ran on MC or not"}
Gaudi::Property< bool >	m_writeSpacePoints
MuonVal::ScalarBranch< int > &	m_out_chamberIndex {m_tree.newScalar<int>("chamberIndex")}
	====== Common block: Filled for all entries ===========
MuonVal::ScalarBranch< short > &	m_out_stationSide {m_tree.newScalar<short>("stationSide")}
	+1 for A-, -1 of C-side
MuonVal::ScalarBranch< int > &	m_out_stationPhi {m_tree.newScalar<int>("stationPhi")}
	phi index of the station
MuonVal::ScalarBranch< float > &	m_out_bucketStart {m_tree.newScalar<float>("bucketStart", 1)}
MuonVal::ScalarBranch< float > &	m_out_bucketEnd {m_tree.newScalar<float>("bucketEnd", -1)}
std::shared_ptr< SpacePointTesterModule >	m_spTester {}
	Branch dumping all the space points from the difference buckets.
MuonVal::MatrixBranch< unsigned char > &	m_spMatchedToPattern {m_tree.newMatrix<unsigned char>("seedMatchedSp")}
	Branch indicating which space points in the tree are associated to the i-th pattern.
MuonVal::MatrixBranch< unsigned char > &	m_spMatchedToSegment {m_tree.newMatrix<unsigned char>("segmentMatchedSp")}
	Branch indicating which space points in the tree are associated to the i-th segment.
MuonVal::ScalarBranch< unsigned char > &	m_out_nSpacePoints {m_tree.newScalar<unsigned char>("bucketNHits",0)}
	Number of all space points in the bucket.
MuonVal::ScalarBranch< unsigned char > &	m_out_nPrecSpacePoints {m_tree.newScalar<unsigned char>("bucketNPrecMeas",0)}
	Number of precision hits in the bucket.
MuonVal::ScalarBranch< unsigned char > &	m_out_nPhiSpacePoints {m_tree.newScalar<unsigned char>("bucketNPhiMeass",0)}
	Number of phi hits in the bucket.
MuonVal::ScalarBranch< unsigned char > &	m_out_nTrueSpacePoints {m_tree.newScalar<unsigned char>("bucketNTrueMeas",0)}
	Number of all space points in the bucket.
MuonVal::ScalarBranch< unsigned char > &	m_out_nTruePrecSpacePoints {m_tree.newScalar<unsigned char>("bucketNTruePrecMeas",0)}
	Number of precision hits in the bucket.
MuonVal::ScalarBranch< unsigned char > &	m_out_nTruePhiSpacePoints {m_tree.newScalar<unsigned char>("bucketNTruePhiMeass",0)}
	Number of phi hits in the bucket.
MuonVal::ScalarBranch< bool > &	m_out_hasTruth {m_tree.newScalar<bool>("hasTruth",false)}
	======= Truth block: Filled if we have a truth match. ============
MuonVal::ScalarBranch< float > &	m_out_gen_Eta {m_tree.newScalar<float>("genEta",-10.)}
	global particle properties
MuonVal::ScalarBranch< float > &	m_out_gen_Phi {m_tree.newScalar<float>("genPhi",-10.)}
MuonVal::ScalarBranch< float > &	m_out_gen_Pt {m_tree.newScalar<float>("genPt",-10.)}
MuonVal::ScalarBranch< short > &	m_out_gen_Q {m_tree.newScalar<short>("genQ", 0)}
MuonVal::ScalarBranch< float > &	m_out_gen_y0 {m_tree.newScalar<float>("genY0", 0.0)}
	Truth - segment parameters.
MuonVal::ScalarBranch< float > &	m_out_gen_tantheta {m_tree.newScalar<float>("genTanTheta", 0.0)}
MuonVal::ScalarBranch< float > &	m_out_gen_tanphi {m_tree.newScalar<float>("genTanPhi", 0.0)}
MuonVal::ScalarBranch< float > &	m_out_gen_x0 {m_tree.newScalar<float>("genX0", 0.0)}
MuonVal::ScalarBranch< float > &	m_out_gen_time {m_tree.newScalar<float>("genTime", 0.0)}
MuonVal::ScalarBranch< unsigned short > &	m_out_gen_nHits {m_tree.newScalar<unsigned short>("genNHits",0)}
	Truth - hit count summary.
MuonVal::ScalarBranch< unsigned short > &	m_out_gen_nRPCHits {m_tree.newScalar<unsigned short>("genNRpcHits",0)}
MuonVal::ScalarBranch< unsigned short > &	m_out_gen_nMDTHits {m_tree.newScalar<unsigned short>("genNMdtHits",0)}
MuonVal::ScalarBranch< unsigned short > &	m_out_gen_nTGCHits {m_tree.newScalar<unsigned short>("genNTgcHits",0)}
MuonVal::ScalarBranch< unsigned short > &	m_out_gen_nNswHits {m_tree.newScalar<unsigned short>("genNNswHits",0)}
MuonVal::ScalarBranch< float > &	m_out_gen_minYhit {m_tree.newScalar<float>("genMinYhit", 1.0)}
MuonVal::ScalarBranch< float > &	m_out_gen_maxYhit {m_tree.newScalar<float>("genMaxYhit", -1.0)}
MuonVal::ScalarBranch< unsigned > &	m_out_seed_n {m_tree.newScalar<unsigned>("nSeeds", 0)}
	========== Seed block: Filled when we have one or multiple seeds ============= seed count
MuonVal::VectorBranch< unsigned short > &	m_out_seed_hasPhiExtension {m_tree.newVector<unsigned short>("seedHasPhiExtension", false)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nMatchedHits {m_tree.newVector<unsigned short>("seedTruthMatchedHits", false)}
MuonVal::VectorBranch< float > &	m_out_seed_y0 {m_tree.newVector<float>("seedY0", 0.0)}
MuonVal::VectorBranch< float > &	m_out_seed_x0 {m_tree.newVector<float>("seedX0", 0.0)}
MuonVal::VectorBranch< float > &	m_out_seed_tantheta {m_tree.newVector<float>("seedTanTheta", 0.0)}
MuonVal::VectorBranch< float > &	m_out_seed_tanphi {m_tree.newVector<float>("seedTanPhi", 0.0)}
MuonVal::VectorBranch< float > &	m_out_seed_minYhit {m_tree.newVector<float>("seedMinYhit", 1.0)}
MuonVal::VectorBranch< float > &	m_out_seed_maxYhit {m_tree.newVector<float>("seedMaxYhit", -1.0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nHits {m_tree.newVector<unsigned short>("seedNHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nPrecHits {m_tree.newVector<unsigned short>("seedNPrecHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nEtaHits {m_tree.newVector<unsigned short>("seedNEtaHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nPhiHits {m_tree.newVector<unsigned short>("seedNPhiHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nMdt {m_tree.newVector<unsigned short>("seedNMdtHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nRpc {m_tree.newVector<unsigned short>("seedNRpcHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nTgc {m_tree.newVector<unsigned short>("seedNTgcHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nsTgc {m_tree.newVector<unsigned short>("seedNsTgcHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nMm {m_tree.newVector<unsigned short>("seedNMmHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nTrueHits {m_tree.newVector<unsigned short>("seedNTrueHits", 0)}
	Labelled hits from the pattern visualization tool.
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nTruePrecHits {m_tree.newVector<unsigned short>("seedNTruePrecHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nTruePhiHits {m_tree.newVector<unsigned short>("seedNTruePhiHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_seed_nTrueEtaHits {m_tree.newVector<unsigned short>("seedNTrueEtaHits", 0)}
MuonVal::VectorBranch< unsigned char > &	m_out_seed_ledToSegment {m_tree.newVector<unsigned char>("seedConvertedToSegment",false)}
MuonVal::ScalarBranch< unsigned > &	m_out_segment_n {m_tree.newScalar<unsigned>("nSegments", 0)}
	========== Segment block: Filled when we have one or multiple segments =============
MuonVal::VectorBranch< float > &	m_out_segment_chi2 {m_tree.newVector<float>("segmentChi2", -1.)}
MuonVal::VectorBranch< uint16_t > &	m_out_segment_nDoF {m_tree.newVector<uint16_t>("segmentNdoF", 0)}
MuonVal::VectorBranch< bool > &	m_out_segment_hasTimeFit {m_tree.newVector<bool>("segmentHasTimeFit", false)}
MuonVal::VectorBranch< uint16_t > &	m_out_segment_fitIter {m_tree.newVector<uint16_t>("segmentFitIterations", 0)}
MuonVal::VectorBranch< bool > &	m_out_segment_hasPhi {m_tree.newVector<bool>("segmentHasPhiHits", false)}
MuonVal::VectorBranch< float > &	m_out_segment_y0 {m_tree.newVector<float>("segmentY0", 0.0)}
MuonVal::VectorBranch< float > &	m_out_segment_x0 {m_tree.newVector<float>("segmentX0", 0.0)}
MuonVal::VectorBranch< float > &	m_out_segment_tantheta {m_tree.newVector<float>("segmentTanTheta", 0.0)}
MuonVal::VectorBranch< float > &	m_out_segment_tanphi {m_tree.newVector<float>("segmentTanPhi", 0.0)}
MuonVal::VectorBranch< float > &	m_out_segment_time {m_tree.newVector<float>("segmentTime", 0.)}
MuonVal::VectorBranch< float > &	m_out_segment_err_y0 {m_tree.newVector<float>("segmentErrY0", -1.0)}
MuonVal::VectorBranch< float > &	m_out_segment_err_x0 {m_tree.newVector<float>("segmentErrX0", -1.0)}
MuonVal::VectorBranch< float > &	m_out_segment_err_tantheta {m_tree.newVector<float>("segmentErrTanTheta", -1.0)}
MuonVal::VectorBranch< float > &	m_out_segment_err_tanphi {m_tree.newVector<float>("segmentErrTanPhi", -1.0)}
MuonVal::VectorBranch< float > &	m_out_segment_err_time {m_tree.newVector<float>("segmentErrTime", -1.0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_truthMatchedHits {m_tree.newVector<unsigned short>("segmentTruthMatchedHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nMdtHits {m_tree.newVector<unsigned short>("segmentNMdtHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nRpcEtaHits {m_tree.newVector<unsigned short>("segmentNRpcEtaHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nRpcPhiHits {m_tree.newVector<unsigned short>("segmentNRpcPhiHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTgcEtaHits {m_tree.newVector<unsigned short>("segmentNTgcEtaHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTgcPhiHits {m_tree.newVector<unsigned short>("segmentNTgcPhiHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nMmEtaHits {m_tree.newVector<unsigned short>("segmentNMmEtaHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nMmStereoHits {m_tree.newVector<unsigned short>("segmentNMmStereoHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nsTgcStripHits {m_tree.newVector<unsigned short>("segmentNsTgcStripHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nsTgcWireHits {m_tree.newVector<unsigned short>("segmentNsTgcWireHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nsTgcPadpHits {m_tree.newVector<unsigned short>("segmentNsTgcPadHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTrueHits {m_tree.newVector<unsigned short>("segmentNTrueHits", 0)}
	Labelled hits from the pattern visualization tool.
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTruePrecHits {m_tree.newVector<unsigned short>("segmentNTruePrecHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTruePhiHits {m_tree.newVector<unsigned short>("segmentNTruePhiHits", 0)}
MuonVal::VectorBranch< unsigned short > &	m_out_segment_nTrueEtaHits {m_tree.newVector<unsigned short>("segmentNTrueEtaHits", 0)}
MuonVal::VectorBranch< float > &	m_out_segment_minYhit {m_tree.newVector<float>("segmentMinYhit", 1.0)}
MuonVal::VectorBranch< float > &	m_out_segment_maxYhit {m_tree.newVector<float>("segmentMaxYhit", -1.0)}
ToolHandle< MuonValR4::IPatternVisualizationTool >	m_visionTool {this, "VisualizationTool", ""}
	Pattern visualization tool.
const MuonGMR4::MuonDetectorManager *	m_detMgr {nullptr}
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 37 of file MuonHoughTransformTester.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 205 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 219 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 169 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 198 of file AthHistogramming.h.

StoreGateSvc_t

typedef ServiceHandle<StoreGateSvc> AthCommonDataStore< AthCommonMsg< 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 212 of file AthHistogramming.h.

TruthHitCol

using MuonValR4::MuonHoughTransformTester::TruthHitCol = std::unordered_set<const xAOD::MuonSimHit*>

Definition at line 46 of file MuonHoughTransformTester.h.

Constructor & Destructor Documentation

~MuonHoughTransformTester()

virtual MuonValR4::MuonHoughTransformTester::~MuonHoughTransformTester ( )

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 335 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 303 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 403 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 356 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 346 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 324 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 314 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 281 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 427 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 260 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 312 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 146 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 293 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 98 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 272 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 560 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 66 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;
}

countOnSameSide()

unsigned int MuonValR4::MuonHoughTransformTester::countOnSameSide ( const ActsTrk::GeometryContext & gctx, const xAOD::MuonSegment & truthSeg, const MuonR4::Segment & recoSeg ) const

private

Calculates how many measurements from the segment fit have the same drift sign as when evaluated with the truth parameters.

Parameters

gctx	Geometry context to fetch the alignment constants
truthSeg	Reference to the truth segment
recoSeg	Reference to the reco segment.

Definition at line 85 of file MuonHoughTransformTester.cxx.

                                                                                              {
        unsigned int same{0};
        using namespace SegmentFit;
        const auto[truePos, trueDir] = makeLine(localSegmentPars(truthSeg)); 
        const auto[recoPos, recoDir] = makeLine(localSegmentPars(gctx, recoSeg));
        const std::vector<int> truthSigns = SeedingAux::strawSigns(truePos, trueDir, recoSeg.measurements());
        const std::vector<int> recoSigns = SeedingAux::strawSigns(recoPos, recoDir, recoSeg.measurements());
        for (unsigned int s = 0 ; s < truthSigns.size(); ++s) {
            same += (truthSigns[s] != 0) && truthSigns[s] == recoSigns[s];
        }
        return same;
    }

declareGaudiProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T, V, H > & hndl, const SG::VarHandleKeyType &  )

inlineprivateinherited

specialization for handling Gaudi::Property<SG::VarHandleKey>

Definition at line 156 of file AthCommonDataStore.h.

  {
    return *AthCommonDataStore<PBASE>::declareProperty(hndl.name(),
                                                       hndl.value(), 
                                                       hndl.documentation());
 
  }

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

                                                                     {
    typedef typename SG::HandleClassifier<T>::type htype;
    return AthCommonDataStore<PBASE>::declareGaudiProperty(t, htype());
  }

detStore()

const ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Algorithm > >::detStore ( ) const

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ 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 250 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< 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::MuonHoughTransformTester::execute ( )

overridevirtual

Definition at line 234 of file MuonHoughTransformTester.cxx.

                                                  {
        
        const EventContext & ctx = Gaudi::Hive::currentContext();
        const ActsTrk::GeometryContext* gctxPtr{nullptr};
        ATH_CHECK(SG::get(gctxPtr, m_geoCtxKey, ctx));
        const ActsTrk::GeometryContext& gctx{*gctxPtr};
 
 
        ConstDataVector<MuonR4::SegmentSeedContainer> segmentSeeds{SG::VIEW_ELEMENTS};
        ConstDataVector<MuonR4::SegmentContainer> segments{SG::VIEW_ELEMENTS};
 
        for (const SG::ReadHandleKey<SegmentSeedContainer>& key : m_inHoughSegmentSeedKeys) {
            const SegmentSeedContainer* readSegmentSeeds{nullptr};
            ATH_CHECK(SG::get(readSegmentSeeds, key, ctx));
            segmentSeeds.insert(segmentSeeds.end(),readSegmentSeeds->begin(), readSegmentSeeds->end());
        }
        for (const SG::ReadHandleKey<SegmentContainer>& key : m_inSegmentKeys) {
            const SegmentContainer* readSegments{nullptr};
            ATH_CHECK(SG::get(readSegments, key, ctx));
            segments.insert(segments.end(),readSegments->begin(), readSegments->end());
        }
        const xAOD::MuonSegmentContainer* readTruthSegments{nullptr};
 
        if(m_isMC){
             ATH_CHECK(SG::get(readTruthSegments , m_truthSegmentKey, ctx));
        }
            
        ATH_MSG_DEBUG("Succesfully retrieved input collections. Seeds: "<<segmentSeeds.size()
                    <<", segments: "<<segments.size() <<", truth segments: "<<(readTruthSegments? readTruthSegments->size() : -1)<<".");
        std::vector<ObjectMatching> objects = matchWithTruth(gctx, readTruthSegments, segmentSeeds.asDataVector(), 
                                                             segments.asDataVector());
        for (const ObjectMatching& obj : objects) {
            fillChamberInfo(obj.chamber);
            fillSeedInfo(obj);
            fillSegmentInfo(gctx, obj);
            if(m_isMC) fillTruthInfo(gctx, obj.truthSegment);
            ATH_CHECK(m_tree.fill(ctx));
        }
        return StatusCode::SUCCESS;
    }

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 50 of file AthAlgorithm.cxx.

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

fillBucketInfo()

void MuonValR4::MuonHoughTransformTester::fillBucketInfo ( const MuonR4::SpacePointBucket & bucket )

private

Fill the hit summary info of the associated bucket.

Definition at line 326 of file MuonHoughTransformTester.cxx.

                                                                                {
        m_out_bucketEnd = bucket.coveredMax();
        m_out_bucketStart = bucket.coveredMin();
        m_out_nSpacePoints = bucket.size();
        m_out_nPrecSpacePoints = std::ranges::count_if(bucket, [](const SpacePointBucket::value_type& sp){
            return isPrecHit(*sp);
        });
        m_out_nPhiSpacePoints = std::ranges::count_if(bucket, [](const SpacePointBucket::value_type& sp){
            return sp->measuresPhi();
        });
        if (!m_visionTool.isEnabled()){
            return;
        }
        m_out_nTrueSpacePoints = std::ranges::count_if(bucket,[this](const SpacePointBucket::value_type& sp){
            return m_visionTool->isLabeled(*sp);
        });
        m_out_nTruePrecSpacePoints = std::ranges::count_if(bucket,[this](const SpacePointBucket::value_type& sp){
            return isPrecHit(*sp) && m_visionTool->isLabeled(*sp);
        });
        m_out_nTruePhiSpacePoints = std::ranges::count_if(bucket,[this](const SpacePointBucket::value_type& sp){
            return sp->measuresPhi() && m_visionTool->isLabeled(*sp);
        });
    }

fillChamberInfo()

void MuonValR4::MuonHoughTransformTester::fillChamberInfo ( const MuonGMR4::SpectrometerSector * chamber )

private

Fill the current chamber info into the output.

Parameters

chamber

Pointer to the reference sector to which the view belongs to

Definition at line 274 of file MuonHoughTransformTester.cxx.

                                                                                            {
        m_out_chamberIndex = Acts::toUnderlying(msSector->chamberIndex());
        m_out_stationSide = msSector->side();
        m_out_stationPhi = msSector->stationPhi();
    }                

fillSeedInfo()

void MuonValR4::MuonHoughTransformTester::fillSeedInfo ( const ObjectMatching & obj )

private

Fill the info associated to the seed.

Parameters

obj	Pointer to the matching object connecting the seeds & segment & truth

Definition at line 349 of file MuonHoughTransformTester.cxx.

                                                                         {
 
        m_out_seed_n = obj.matchedSeeds.size();
        for (const auto [iseed, seed] : Acts::enumerate(obj.matchedSeeds)){
            if (iseed ==0) {
                fillBucketInfo(*seed->parentBucket());
            }
            double minYhit = m_out_bucketEnd.getVariable();
            double maxYhit = m_out_bucketStart.getVariable();
            for (const SpacePoint* hit : seed->getHitsInMax()){
                minYhit = std::min(hit->localPosition().y(),minYhit); 
                maxYhit = std::max(hit->localPosition().y(),maxYhit); 
            }
            m_out_seed_minYhit.push_back(minYhit);
            m_out_seed_maxYhit.push_back(maxYhit);
 
            m_out_seed_hasPhiExtension.push_back(seed->hasPhiExtension()); 
            m_out_seed_nMatchedHits.push_back(countMatched(obj.truthSegment, seed));
            m_out_seed_y0.push_back(seed->interceptY());
            m_out_seed_tantheta.push_back(seed->tanBeta());
            if (seed->hasPhiExtension()){
                m_out_seed_x0.push_back(seed->interceptX());
                m_out_seed_tanphi.push_back(seed->tanAlpha());
            } else{
                m_out_seed_x0.push_back(-999);
                m_out_seed_tanphi.push_back(-999);
            }
         
            m_out_seed_nHits.push_back(seed->getHitsInMax().size());
            unsigned nMdtSeed{0}, nRpcSeed{0}, nTgcSeed{0}, nMmSeed{0}, nsTgcSeed{0}; 
            unsigned nPrecHits{0}, nEtaHits{0}, nPhiHits{0}, nTrueHits{0}, nTruePrecHits{0}, nTrueEtaHits{0}, nTruePhiHits{0};
            std::vector<unsigned char> treeIdxs{};
           
            for (const HoughHitType & houghSP: seed->getHitsInMax()){                
                if (m_writeSpacePoints){
                    unsigned treeIdx = m_spTester->push_back(*houghSP);
                    treeIdxs.push_back(treeIdx);
                }
                nPrecHits += isPrecHit(*houghSP);
                nPhiHits  += houghSP->measuresPhi();
                nEtaHits  += houghSP->measuresEta();
 
                if (m_visionTool.isEnabled()) {
                    nTrueHits += m_visionTool->isLabeled(*houghSP);
                    nTruePrecHits += m_visionTool->isLabeled(*houghSP) && isPrecHit(*houghSP);
                    nTruePhiHits += m_visionTool->isLabeled(*houghSP) && houghSP->measuresPhi();
                    nTrueEtaHits += m_visionTool->isLabeled(*houghSP) && houghSP->measuresEta();
                }
                switch (houghSP->type()) {
                    case xAOD::UncalibMeasType::MdtDriftCircleType: 
                        ++nMdtSeed;
                        break;
                    case xAOD::UncalibMeasType::RpcStripType:
                        nRpcSeed+=houghSP->measuresEta();
                        nRpcSeed+=houghSP->measuresPhi();
                        break;
                    case xAOD::UncalibMeasType::TgcStripType:
                        nTgcSeed+=houghSP->measuresEta();
                        nTgcSeed+=houghSP->measuresPhi();
                        break;
                    case xAOD::UncalibMeasType::sTgcStripType:
                        nsTgcSeed += houghSP->measuresEta();
                        nsTgcSeed += houghSP->measuresPhi();
                        break;
                    case xAOD::UncalibMeasType::MMClusterType:
                        ++nMmSeed;
                        break;
                    default:
                        ATH_MSG_WARNING("Technology "<<houghSP->identify()  <<" not yet implemented");                        
                }                    
            }
            m_out_seed_nMdt.push_back(nMdtSeed);
            m_out_seed_nRpc.push_back(nRpcSeed);
            m_out_seed_nTgc.push_back(nTgcSeed);
            m_out_seed_nsTgc.push_back(nsTgcSeed);
            m_out_seed_nMm.push_back(nMmSeed);
 
            m_out_seed_nPrecHits.push_back(nPrecHits);
            m_out_seed_nEtaHits.push_back(nEtaHits); 
            m_out_seed_nPhiHits.push_back(nPhiHits);
 
            m_out_seed_nTrueHits.push_back(nTrueHits);
            m_out_seed_nTruePrecHits.push_back(nTruePrecHits);            
            m_out_seed_nTrueEtaHits.push_back(nTrueEtaHits);
            m_out_seed_nTruePhiHits.push_back(nTruePhiHits);
 
            m_out_seed_ledToSegment.push_back(obj.matchedSeedFoundSegment.at(iseed));
            if (m_writeSpacePoints) {
                m_spMatchedToPattern[iseed] = std::move(treeIdxs);
                
            } 
        }
    }

fillSegmentInfo()

void MuonValR4::MuonHoughTransformTester::fillSegmentInfo ( const ActsTrk::GeometryContext & gctx, const ObjectMatching & obj )

private

Fill the info assciated to the segment.

Parameters

obj	Pointer to the matching object connecting the seeds & segment & truth

Definition at line 443 of file MuonHoughTransformTester.cxx.

                                                                             {
        using namespace SegmentFit;
 
        m_out_segment_n = obj.matchedSegments.size(); 
        for (auto & segment : obj.matchedSegments){
            m_out_segment_hasPhi.push_back(std::ranges::find_if(segment->measurements(), [](const auto& meas){  return meas->measuresPhi();}) 
                                !=segment->measurements().end());
            m_out_segment_fitIter.push_back(segment->nFitIterations());
            m_out_segment_truthMatchedHits.push_back(countMatched(obj.truthSegment, segment));
            m_out_segment_chi2.push_back(segment->chi2());
            m_out_segment_nDoF.push_back(segment->nDoF());
            m_out_segment_hasTimeFit.push_back(segment->hasTimeFit());
 
            m_out_segment_err_x0.push_back(segment->covariance()(Acts::toUnderlying(ParamDefs::x0), Acts::toUnderlying(ParamDefs::x0)));
            m_out_segment_err_y0.push_back(segment->covariance()(Acts::toUnderlying(ParamDefs::y0), Acts::toUnderlying(ParamDefs::y0)));
            m_out_segment_err_tantheta.push_back(segment->covariance()(Acts::toUnderlying(ParamDefs::theta), Acts::toUnderlying(ParamDefs::theta)));
            m_out_segment_err_tanphi.push_back(segment->covariance()(Acts::toUnderlying(ParamDefs::phi), Acts::toUnderlying(ParamDefs::phi)));
            m_out_segment_err_time.push_back(segment->covariance()(Acts::toUnderlying(ParamDefs::t0), Acts::toUnderlying(ParamDefs::t0)));
            const auto [locPos, locDir] = makeLine(localSegmentPars(gctx, *segment));
            m_out_segment_tanphi.push_back(houghTanAlpha(locDir));
            m_out_segment_tantheta.push_back(houghTanBeta(locDir));
            m_out_segment_y0.push_back(locPos.y());
            m_out_segment_x0.push_back(locPos.x());
            m_out_segment_time.push_back(segment->segementT0() + segment->position().mag() * c_inv);
 
            unsigned nMdtHits{0}, nRpcEtaHits{0}, nRpcPhiHits{0}, nTgcEtaHits{0}, nTgcPhiHits{0},
                     nMmEtaHits{0}, nMmStereoHits{0}, nStgcStripHits{0},nStgcWireHits{0}, nStgcPadHits{0};
            unsigned nTrueHits{0}, nTruePrecHits{0}, nTrueEtaHits{0}, nTruePhiHits{0};
            
            double minYhit = std::numeric_limits<double>::max();
            double maxYhit = -1 * std::numeric_limits<double>::max();
 
            std::vector<unsigned char> matched;
            for (const auto & meas : segment->measurements()){
                // skip dummy measurement from beam spot constraint
                if (meas->type() == xAOD::UncalibMeasType::Other) continue;
                minYhit = std::min(meas->localPosition().y(),minYhit); 
                maxYhit = std::max(meas->localPosition().y(),maxYhit);
                if (m_writeSpacePoints) {
                    unsigned treeIdx = m_spTester->push_back(*meas->spacePoint());
                    if (treeIdx >= matched.size()){
                        matched.resize(treeIdx +1);
                    }
                    matched[treeIdx] = true;
                }
                if (m_visionTool.isEnabled()) {
                    nTrueHits += m_visionTool->isLabeled(*meas->spacePoint());
                    nTruePrecHits += isPrecHit(*meas) && m_visionTool->isLabeled(*meas->spacePoint());
                    nTrueEtaHits += meas->measuresEta() && m_visionTool->isLabeled(*meas->spacePoint());
                    nTruePhiHits += meas->measuresPhi() && m_visionTool->isLabeled(*meas->spacePoint());
                }
                switch (meas->type()) {
                    case xAOD::UncalibMeasType::MdtDriftCircleType:
                        ++nMdtHits;
                        break;
                    case xAOD::UncalibMeasType::RpcStripType:
                        nRpcEtaHits += meas->measuresEta();
                        nRpcPhiHits += meas->measuresPhi();
                        break;
                    case xAOD::UncalibMeasType::TgcStripType:
                        nTgcEtaHits += meas->measuresEta();
                        nTgcPhiHits += meas->measuresPhi();
                        break;
                    case xAOD::UncalibMeasType::MMClusterType:{
                        const MmIdHelper& idHelper{m_idHelperSvc->mmIdHelper()};
                        nMmEtaHits += !idHelper.isStereo(meas->spacePoint()->identify());
                        nMmStereoHits += !idHelper.isStereo(meas->spacePoint()->identify());
                        break;
                    } case xAOD::UncalibMeasType::sTgcStripType: {
                        const auto* prd = static_cast<const xAOD::sTgcMeasurement*>(meas->spacePoint()->primaryMeasurement());
                        nStgcStripHits += prd->channelType() == sTgcIdHelper::sTgcChannelTypes::Strip;
                        nStgcWireHits += prd->channelType() == sTgcIdHelper::sTgcChannelTypes::Wire;
                        nStgcPadHits += prd->channelType() == sTgcIdHelper::sTgcChannelTypes::Pad;
                        prd = dynamic_cast<const xAOD::sTgcMeasurement*>(meas->spacePoint()->secondaryMeasurement());
                        if (prd) {
                            nStgcWireHits += prd->channelType() == sTgcIdHelper::sTgcChannelTypes::Wire;
                            nStgcPadHits += prd->channelType() == sTgcIdHelper::sTgcChannelTypes::Pad;                            
                        }
                        break;
                    } default:
                        break;
                }
            }
            m_out_segment_nMdtHits.push_back(nMdtHits);
            m_out_segment_nRpcEtaHits.push_back(nRpcEtaHits);
            m_out_segment_nRpcPhiHits.push_back(nRpcPhiHits);
            m_out_segment_nTgcEtaHits.push_back(nTgcEtaHits);
            m_out_segment_nTgcPhiHits.push_back(nTgcPhiHits);
 
            m_out_segment_nMmEtaHits.push_back(nMmEtaHits);
            m_out_segment_nMmStereoHits.push_back(nMmStereoHits);
            m_out_segment_nsTgcStripHits.push_back(nStgcStripHits);
            m_out_segment_nsTgcWireHits.push_back(nStgcWireHits);
            m_out_segment_nsTgcPadpHits.push_back(nStgcPadHits);
        
 
        m_out_segment_nTrueHits.push_back(nTrueHits);
            m_out_segment_nTruePrecHits.push_back(nTruePrecHits);
            m_out_segment_nTruePhiHits.push_back(nTruePhiHits);
            m_out_segment_nTrueEtaHits.push_back(nTrueEtaHits);
 
            m_out_segment_minYhit.push_back(minYhit);
            m_out_segment_maxYhit.push_back(maxYhit);
            if (m_writeSpacePoints) {
                m_spMatchedToSegment.push_back(std::move(matched));
            }
        }
    }

fillTruthInfo()

void MuonValR4::MuonHoughTransformTester::fillTruthInfo ( const ActsTrk::GeometryContext & gctx, const xAOD::MuonSegment * truthSegment )

private

Fill the associated truth information into the tree.

Parameters

truthSegment	Pointer to the truth parameters in form of a segment
gctx	Geometry context for the alignment of the spectrometer sector

Definition at line 279 of file MuonHoughTransformTester.cxx.

                                                                                  {
        if (!segment) return; 
        m_out_hasTruth = true; 
 
        const Amg::Vector3D segDir{segment->direction()};
        static const SG::Accessor<float> acc_pt{"pt"};
        static const SG::Accessor<float> acc_charge{"charge"};
        // eta is interpreted as the eta-location 
        m_out_gen_Eta = segDir.eta();
        m_out_gen_Phi = segDir.phi();
        m_out_gen_Pt  = acc_pt(*segment);
        m_out_gen_Q = acc_charge(*segment);
 
        const auto [chamberPos, chamberDir] = SegmentFit::makeLine(SegmentFit::localSegmentPars(*segment));
        m_out_gen_nHits = segment->nPrecisionHits()+segment->nPhiLayers() + segment->nTrigEtaLayers(); 
        using namespace Muon::MuonStationIndex;
        m_out_gen_nMDTHits = segment->nPrecisionHits() * (segment->technology() == TechnologyIndex::MDT); 
        m_out_gen_nNswHits = segment->nPrecisionHits() * (segment->technology() != TechnologyIndex::MDT); 
        m_out_gen_nTGCHits = (segment->nPhiLayers() + segment->nTrigEtaLayers()) * !isBarrel(segment->chamberIndex());
        m_out_gen_nRPCHits = (segment->nPhiLayers() + segment->nTrigEtaLayers()) *  isBarrel(segment->chamberIndex());
 
        m_out_gen_tantheta = houghTanBeta(chamberDir); 
        m_out_gen_tanphi   = houghTanAlpha(chamberDir);
        m_out_gen_y0 = chamberPos.y(); 
        m_out_gen_x0 = chamberPos.x(); 
        m_out_gen_time = segment->t0();
 
        double minYhit = std::numeric_limits<double>::max();
        double maxYhit = -1 * std::numeric_limits<double>::max();
        for (const xAOD::MuonSimHit* hit : getMatchingSimHits(*segment)){
            const Identifier hitId = hit->identify();
            const MuonGMR4::MuonReadoutElement* RE = m_detMgr->getReadoutElement(hitId); 
            const IdentifierHash hash{m_idHelperSvc->isMdt(hitId) ? RE->measurementHash(hitId)
                                                                  : RE->layerHash(hitId) };
            const Amg::Transform3D localToChamber = RE->msSector()->globalToLocalTrans(gctx) * RE->localToGlobalTrans(gctx, hash);
            const Amg::Vector3D chamberPos = localToChamber * xAOD::toEigen(hit->localPosition()); 
            minYhit = std::min(chamberPos.y(), minYhit); 
            maxYhit = std::max(chamberPos.y(), maxYhit); 
        }
        m_out_gen_minYhit = minYhit;
        m_out_gen_maxYhit = maxYhit;
 
        ATH_MSG_DEBUG("A true max on chamber index "<<m_out_chamberIndex.getVariable()<<" side "<<m_out_stationSide.getVariable()<<" phi "<<m_out_stationPhi.getVariable()<<" with "
                    <<m_out_gen_nMDTHits.getVariable()<<" MDT and "<<m_out_gen_nRPCHits.getVariable()+m_out_gen_nTGCHits.getVariable()<< " trigger hits is at "
                    <<m_out_gen_tantheta.getVariable()<<" and "<<m_out_gen_y0.getVariable()); 
    }

finalize()

StatusCode MuonValR4::MuonHoughTransformTester::finalize ( )

overridevirtual

Definition at line 230 of file MuonHoughTransformTester.cxx.

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

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 492 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 428 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 198 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 369 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 386 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::MuonHoughTransformTester::initialize ( )

overridevirtual

The collection of readHandle keys should be either 1 or 2

Definition at line 54 of file MuonHoughTransformTester.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_truthSegmentKey.initialize(!m_truthSegmentKey.empty()));        
        ATH_CHECK(m_inSegmentKeys.initialize());
        ATH_CHECK(m_inHoughSegmentSeedKeys.initialize());
        ATH_CHECK(m_spKey.initialize(m_writeSpacePoints));
        if (m_writeSpacePoints) {
            m_spTester = std::make_unique<SpacePointTesterModule>(m_tree, m_spKey.key(), msgLevel());
            m_tree.addBranch(m_spTester);
        } else {
            m_tree.disableBranch(m_spMatchedToPattern.name());
            m_tree.disableBranch(m_spMatchedToSegment.name());
        }
        ATH_CHECK(m_tree.init(this)); 
        ATH_CHECK(m_idHelperSvc.retrieve());
        ATH_CHECK(detStore()->retrieve(m_detMgr));
 
        ATH_CHECK(m_visionTool.retrieve(EnableTool{!m_visionTool.empty()}));
        ATH_MSG_DEBUG("Succesfully initialised");
        return StatusCode::SUCCESS;
    }

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

matchWithTruth()

std::vector< ObjectMatching > MuonValR4::MuonHoughTransformTester::matchWithTruth ( const ActsTrk::GeometryContext & gctx, const xAOD::MuonSegmentContainer * truthSegments, const MuonR4::SegmentSeedContainer * seedContainer, const MuonR4::SegmentContainer * segmentContainer ) const

private

Step 1: Truth matched seeds and segments, and non-reconstructed truth. Go from truth to the matched reco objects and fill one common tree entry

Now we have processed all truth segments, as well as all reco objects that share sim hits with them. We still need to collect seeds and segments that are not matched to any truth. This happens in all data events, or through fake hits / segments.

Definition at line 100 of file MuonHoughTransformTester.cxx.

                                                                                                     {
        std::vector<ObjectMatching> allAssociations{};
        std::unordered_set<const SegmentSeed*> usedSeeds{};
        std::unordered_set<const Segment*> usedSegs{};

        if (m_isMC) {
            // collect the sim hits that contributed to our segments and seeds.
            std::vector<simHitSet> truthHitsVec{}, seedSimHitVec{}, segmentSimHitVec{};
            for (const SegmentSeed* seed: *seedContainer) {
                seedSimHitVec.emplace_back(getMatchingSimHits(*seed));
            }
            for (const Segment* segment: *segmentContainer){
                segmentSimHitVec.emplace_back(getMatchingSimHits(*segment));
            }
 
            // Now look at the truth segments, collecting their sim hits.
            // Compare these to the sim hits on our reco objects 
            for (const xAOD::MuonSegment* truth: *truthSegments) {
                const simHitSet& truthHits{truthHitsVec.emplace_back(getMatchingSimHits(*truth))};
                ObjectMatching & matchedWithTruth = allAssociations.emplace_back(); 
                matchedWithTruth.truthSegment = truth;
                matchedWithTruth.chamber = m_detMgr->getSectorEnvelope((*truthHits.begin())->identify());
 
                std::vector<std::pair<const SegmentSeed*, unsigned>> matchedSeeds{};
                
                // Find seeds sharing at least one simHit with our truth segment 
                // can't wait for views::enumerate
                int seedIdx{-1};
                for (const SegmentSeed* seed : *seedContainer) {
                    ++seedIdx;
                    if (seed->msSector() != matchedWithTruth.chamber) {
                        continue;
                    }
                    const simHitSet& seedHits{seedSimHitVec[seedIdx]};
                    unsigned int matchedHits = countMatched(truthHits, seedHits);
                    if (!matchedHits) {
                        continue;
                    }
                    matchedSeeds.emplace_back(std::make_pair(seed, matchedHits));
                }
                // Find segments sharing at least one simHit with our truth segment 
                std::vector<std::pair<const Segment*, unsigned>> matchedSegs{};
                int segmentIdx{-1};
                for (const Segment* segment  : *segmentContainer) {
                    ++segmentIdx; 
                    if (segment->msSector() != matchedWithTruth.chamber) {
                        continue;
                    }
                    const simHitSet& segmentHits{segmentSimHitVec[segmentIdx]};
                    unsigned int matchedHits = countMatched(truthHits, segmentHits);
                    if (!matchedHits) {
                        continue;
                    }
                    matchedSegs.emplace_back(std::make_pair(segment,matchedHits));
                }
 
                // sort by quality of match 
 
                // for segments (by hit count and same-side hits) 
                std::ranges::sort(matchedSegs,
                        [this, &truth, &gctx](const std::pair<const Segment*, unsigned>& segA, 
                                              const std::pair<const Segment*, unsigned>& segB){
                    if (segA.second != segB.second) return segA.second > segB.second;
                    return countOnSameSide(gctx, *truth, *segA.first) > countOnSameSide(gctx, *truth, *segB.first);
                });
                // and for seeds (by raw hit count)
                std::ranges::sort(matchedSeeds, [](const std::pair<const SegmentSeed*, unsigned>& seedA, 
                                                const std::pair<const SegmentSeed*, unsigned>& seedB) {
                    return seedA.second > seedB.second;
                });
 
 
                // now we can populate our association object 
 
                // first, we handle the segments and any seeds connected with them
                for (const auto& [matched, nMatchedHits] : matchedSegs) {
                    // add segment to the list of all segments
                    matchedWithTruth.matchedSegments.push_back(matched);
                    // and update our book-keeping to record that this segment and its seed have already been written 
                    usedSeeds.insert(matched->parent());
                    usedSegs.insert(matched);
                }
        
                // now, we add the seeds
                for (const auto& [seed , nHits] : matchedSeeds) {
                    // add seed to the list of all seeds
                    ATH_MSG_VERBOSE("Seed with "<<nHits);
                    matchedWithTruth.matchedSeeds.push_back(seed);
                    matchedWithTruth.matchedSeedFoundSegment.push_back(usedSeeds.count(seed)); 
                    usedSeeds.insert(seed); 
                }
            } // end of loop over truth segments
        }

 
        // start with segments, and also collect "their" seeds in a common entry
        for (const Segment* seg: *segmentContainer) {
            // skip segments that were previously seen and written in the truth loop
            if (usedSegs.count(seg)) {
                continue;
            }
            ObjectMatching & match = allAssociations.emplace_back();
            match.chamber = seg->msSector();
            match.matchedSegments = {seg}; 
            match.matchedSeeds = {seg->parent()};
            // this seed has been written as well - do not write it in the following loop 
            usedSeeds.insert(seg->parent());
            match.matchedSeedFoundSegment.push_back(1);
        }
        for (const SegmentSeed* seed: *seedContainer) {
            // skip seeds that are on segments or seen in the truth loop so these will be seeds without segment 
            if (usedSeeds.count(seed)) {
                continue;
            }
            ObjectMatching & match = allAssociations.emplace_back(); 
            match.chamber = seed->msSector();
            match.matchedSeeds = {seed}; 
            match.matchedSeedFoundSegment.push_back(0);
        }
        return allAssociations;
    }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

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 590 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< Algorithm > >::outputHandles ( ) const

overridevirtualinherited

Return this algorithm's output handles.

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

renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

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

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

m_detMgr

const MuonGMR4::MuonDetectorManager* MuonValR4::MuonHoughTransformTester::m_detMgr {nullptr}

private

Definition at line 268 of file MuonHoughTransformTester.h.

{nullptr};

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 208 of file AthHistogramming.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 79 of file AthAlgorithm.h.

m_geoCtxKey

SG::ReadHandleKey<ActsTrk::GeometryContext> MuonValR4::MuonHoughTransformTester::m_geoCtxKey {this, "AlignmentKey", "ActsAlignment", "cond handle key"}

private

Definition at line 105 of file MuonHoughTransformTester.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 222 of file AthHistogramming.h.

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 201 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::MuonHoughTransformTester::m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}

private

Definition at line 107 of file MuonHoughTransformTester.h.

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

m_inHoughSegmentSeedKeys

SG::ReadHandleKeyArray<MuonR4::SegmentSeedContainer> MuonValR4::MuonHoughTransformTester::m_inHoughSegmentSeedKeys {this, "SegmentSeedKeys", {"MuonHoughStationSegmentSeeds"}}

private

Definition at line 100 of file MuonHoughTransformTester.h.

{this, "SegmentSeedKeys", {"MuonHoughStationSegmentSeeds"}};

m_inSegmentKeys

SG::ReadHandleKeyArray<MuonR4::SegmentContainer> MuonValR4::MuonHoughTransformTester::m_inSegmentKeys {this, "SegmentKeys", {"R4MuonSegments"}}

private

Definition at line 101 of file MuonHoughTransformTester.h.

{this, "SegmentKeys", {"R4MuonSegments"}};

m_isMC

Gaudi::Property<bool> MuonValR4::MuonHoughTransformTester::m_isMC {this, "isMC", false, "Toggle whether the job is ran on MC or not"}

private

Definition at line 110 of file MuonHoughTransformTester.h.

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

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 248 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 245 of file AthHistogramming.h.

m_out_bucketEnd

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_bucketEnd {m_tree.newScalar<float>("bucketEnd", -1)}

private

Definition at line 125 of file MuonHoughTransformTester.h.

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

m_out_bucketStart

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_bucketStart {m_tree.newScalar<float>("bucketStart", 1)}

private

Definition at line 124 of file MuonHoughTransformTester.h.

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

m_out_chamberIndex

MuonVal::ScalarBranch<int>& MuonValR4::MuonHoughTransformTester::m_out_chamberIndex {m_tree.newScalar<int>("chamberIndex")}

private

====== Common block: Filled for all entries ===========

chamber index field

Definition at line 118 of file MuonHoughTransformTester.h.

{m_tree.newScalar<int>("chamberIndex")};

m_out_gen_Eta

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_Eta {m_tree.newScalar<float>("genEta",-10.)}

private

global particle properties

Definition at line 154 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genEta",-10.)};

m_out_gen_maxYhit

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_maxYhit {m_tree.newScalar<float>("genMaxYhit", -1.0)}

private

Definition at line 172 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genMaxYhit", -1.0)};

m_out_gen_minYhit

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_minYhit {m_tree.newScalar<float>("genMinYhit", 1.0)}

private

Definition at line 171 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genMinYhit", 1.0)}; 

m_out_gen_nHits

MuonVal::ScalarBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_gen_nHits {m_tree.newScalar<unsigned short>("genNHits",0)}

private

Truth - hit count summary.

Definition at line 165 of file MuonHoughTransformTester.h.

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

m_out_gen_nMDTHits

MuonVal::ScalarBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_gen_nMDTHits {m_tree.newScalar<unsigned short>("genNMdtHits",0)}

private

Definition at line 167 of file MuonHoughTransformTester.h.

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

m_out_gen_nNswHits

MuonVal::ScalarBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_gen_nNswHits {m_tree.newScalar<unsigned short>("genNNswHits",0)}

private

Definition at line 169 of file MuonHoughTransformTester.h.

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

m_out_gen_nRPCHits

MuonVal::ScalarBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_gen_nRPCHits {m_tree.newScalar<unsigned short>("genNRpcHits",0)}

private

Definition at line 166 of file MuonHoughTransformTester.h.

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

m_out_gen_nTGCHits

MuonVal::ScalarBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_gen_nTGCHits {m_tree.newScalar<unsigned short>("genNTgcHits",0)}

private

Definition at line 168 of file MuonHoughTransformTester.h.

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

m_out_gen_Phi

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_Phi {m_tree.newScalar<float>("genPhi",-10.)}

private

Definition at line 155 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genPhi",-10.)};

m_out_gen_Pt

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_Pt {m_tree.newScalar<float>("genPt",-10.)}

private

Definition at line 156 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genPt",-10.)};    

m_out_gen_Q

MuonVal::ScalarBranch<short>& MuonValR4::MuonHoughTransformTester::m_out_gen_Q {m_tree.newScalar<short>("genQ", 0)}

private

Definition at line 157 of file MuonHoughTransformTester.h.

{m_tree.newScalar<short>("genQ", 0)};

m_out_gen_tanphi

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_tanphi {m_tree.newScalar<float>("genTanPhi", 0.0)}

private

Definition at line 161 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genTanPhi", 0.0)}; 

m_out_gen_tantheta

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_tantheta {m_tree.newScalar<float>("genTanTheta", 0.0)}

private

Definition at line 160 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genTanTheta", 0.0)}; 

m_out_gen_time

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_time {m_tree.newScalar<float>("genTime", 0.0)}

private

Definition at line 163 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genTime", 0.0)}; 

m_out_gen_x0

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_x0 {m_tree.newScalar<float>("genX0", 0.0)}

private

Definition at line 162 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genX0", 0.0)}; 

m_out_gen_y0

MuonVal::ScalarBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_gen_y0 {m_tree.newScalar<float>("genY0", 0.0)}

private

Truth - segment parameters.

Definition at line 159 of file MuonHoughTransformTester.h.

{m_tree.newScalar<float>("genY0", 0.0)}; 

m_out_hasTruth

MuonVal::ScalarBranch<bool>& MuonValR4::MuonHoughTransformTester::m_out_hasTruth {m_tree.newScalar<bool>("hasTruth",false)}

private

======= Truth block: Filled if we have a truth match. ============

existence of a truth match

Definition at line 151 of file MuonHoughTransformTester.h.

{m_tree.newScalar<bool>("hasTruth",false)};

m_out_nPhiSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nPhiSpacePoints {m_tree.newScalar<unsigned char>("bucketNPhiMeass",0)}

private

Number of phi hits in the bucket.

Definition at line 139 of file MuonHoughTransformTester.h.

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

m_out_nPrecSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nPrecSpacePoints {m_tree.newScalar<unsigned char>("bucketNPrecMeas",0)}

private

Number of precision hits in the bucket.

Definition at line 137 of file MuonHoughTransformTester.h.

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

m_out_nSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nSpacePoints {m_tree.newScalar<unsigned char>("bucketNHits",0)}

private

Number of all space points in the bucket.

Definition at line 135 of file MuonHoughTransformTester.h.

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

m_out_nTruePhiSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nTruePhiSpacePoints {m_tree.newScalar<unsigned char>("bucketNTruePhiMeass",0)}

private

Number of phi hits in the bucket.

Definition at line 146 of file MuonHoughTransformTester.h.

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

m_out_nTruePrecSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nTruePrecSpacePoints {m_tree.newScalar<unsigned char>("bucketNTruePrecMeas",0)}

private

Number of precision hits in the bucket.

Definition at line 144 of file MuonHoughTransformTester.h.

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

m_out_nTrueSpacePoints

MuonVal::ScalarBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_nTrueSpacePoints {m_tree.newScalar<unsigned char>("bucketNTrueMeas",0)}

private

Number of all space points in the bucket.

Definition at line 142 of file MuonHoughTransformTester.h.

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

m_out_seed_hasPhiExtension

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_hasPhiExtension {m_tree.newVector<unsigned short>("seedHasPhiExtension", false)}

private

Definition at line 180 of file MuonHoughTransformTester.h.

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

m_out_seed_ledToSegment

MuonVal::VectorBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_out_seed_ledToSegment {m_tree.newVector<unsigned char>("seedConvertedToSegment",false)}

private

Definition at line 211 of file MuonHoughTransformTester.h.

{m_tree.newVector<unsigned char>("seedConvertedToSegment",false)}; 

m_out_seed_maxYhit

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_maxYhit {m_tree.newVector<float>("seedMaxYhit", -1.0)}

private

Definition at line 192 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("seedMaxYhit", -1.0)}; 

m_out_seed_minYhit

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_minYhit {m_tree.newVector<float>("seedMinYhit", 1.0)}

private

Definition at line 191 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("seedMinYhit", 1.0)}; 

m_out_seed_n

MuonVal::ScalarBranch<unsigned>& MuonValR4::MuonHoughTransformTester::m_out_seed_n {m_tree.newScalar<unsigned>("nSeeds", 0)}

private

========== Seed block: Filled when we have one or multiple seeds ============= seed count

Definition at line 176 of file MuonHoughTransformTester.h.

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

m_out_seed_nEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nEtaHits {m_tree.newVector<unsigned short>("seedNEtaHits", 0)}

private

Definition at line 196 of file MuonHoughTransformTester.h.

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

m_out_seed_nHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nHits {m_tree.newVector<unsigned short>("seedNHits", 0)}

private

Definition at line 194 of file MuonHoughTransformTester.h.

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

m_out_seed_nMatchedHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nMatchedHits {m_tree.newVector<unsigned short>("seedTruthMatchedHits", false)}

private

Definition at line 182 of file MuonHoughTransformTester.h.

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

m_out_seed_nMdt

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nMdt {m_tree.newVector<unsigned short>("seedNMdtHits", 0)}

private

Definition at line 199 of file MuonHoughTransformTester.h.

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

m_out_seed_nMm

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nMm {m_tree.newVector<unsigned short>("seedNMmHits", 0)}

private

Definition at line 203 of file MuonHoughTransformTester.h.

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

m_out_seed_nPhiHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nPhiHits {m_tree.newVector<unsigned short>("seedNPhiHits", 0)}

private

Definition at line 197 of file MuonHoughTransformTester.h.

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

m_out_seed_nPrecHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nPrecHits {m_tree.newVector<unsigned short>("seedNPrecHits", 0)}

private

Definition at line 195 of file MuonHoughTransformTester.h.

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

m_out_seed_nRpc

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nRpc {m_tree.newVector<unsigned short>("seedNRpcHits", 0)}

private

Definition at line 200 of file MuonHoughTransformTester.h.

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

m_out_seed_nsTgc

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nsTgc {m_tree.newVector<unsigned short>("seedNsTgcHits", 0)}

private

Definition at line 202 of file MuonHoughTransformTester.h.

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

m_out_seed_nTgc

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nTgc {m_tree.newVector<unsigned short>("seedNTgcHits", 0)}

private

Definition at line 201 of file MuonHoughTransformTester.h.

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

m_out_seed_nTrueEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nTrueEtaHits {m_tree.newVector<unsigned short>("seedNTrueEtaHits", 0)}

private

Definition at line 209 of file MuonHoughTransformTester.h.

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

m_out_seed_nTrueHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nTrueHits {m_tree.newVector<unsigned short>("seedNTrueHits", 0)}

private

Labelled hits from the pattern visualization tool.

Definition at line 206 of file MuonHoughTransformTester.h.

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

m_out_seed_nTruePhiHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nTruePhiHits {m_tree.newVector<unsigned short>("seedNTruePhiHits", 0)}

private

Definition at line 208 of file MuonHoughTransformTester.h.

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

m_out_seed_nTruePrecHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_seed_nTruePrecHits {m_tree.newVector<unsigned short>("seedNTruePrecHits", 0)}

private

Definition at line 207 of file MuonHoughTransformTester.h.

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

m_out_seed_tanphi

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_tanphi {m_tree.newVector<float>("seedTanPhi", 0.0)}

private

Definition at line 188 of file MuonHoughTransformTester.h.

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

m_out_seed_tantheta

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_tantheta {m_tree.newVector<float>("seedTanTheta", 0.0)}

private

Definition at line 187 of file MuonHoughTransformTester.h.

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

m_out_seed_x0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_x0 {m_tree.newVector<float>("seedX0", 0.0)}

private

Definition at line 186 of file MuonHoughTransformTester.h.

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

m_out_seed_y0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_seed_y0 {m_tree.newVector<float>("seedY0", 0.0)}

private

Definition at line 185 of file MuonHoughTransformTester.h.

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

m_out_segment_chi2

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_chi2 {m_tree.newVector<float>("segmentChi2", -1.)}

private

Definition at line 220 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentChi2", -1.)};

m_out_segment_err_tanphi

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_err_tanphi {m_tree.newVector<float>("segmentErrTanPhi", -1.0)}

private

Definition at line 239 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentErrTanPhi", -1.0)}; 

m_out_segment_err_tantheta

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_err_tantheta {m_tree.newVector<float>("segmentErrTanTheta", -1.0)}

private

Definition at line 238 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentErrTanTheta", -1.0)}; 

m_out_segment_err_time

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_err_time {m_tree.newVector<float>("segmentErrTime", -1.0)}

private

Definition at line 240 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentErrTime", -1.0)};

m_out_segment_err_x0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_err_x0 {m_tree.newVector<float>("segmentErrX0", -1.0)}

private

Definition at line 237 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentErrX0", -1.0)}; 

m_out_segment_err_y0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_err_y0 {m_tree.newVector<float>("segmentErrY0", -1.0)}

private

Definition at line 236 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentErrY0", -1.0)}; 

m_out_segment_fitIter

MuonVal::VectorBranch<uint16_t>& MuonValR4::MuonHoughTransformTester::m_out_segment_fitIter {m_tree.newVector<uint16_t>("segmentFitIterations", 0)}

private

Definition at line 223 of file MuonHoughTransformTester.h.

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

m_out_segment_hasPhi

MuonVal::VectorBranch<bool>& MuonValR4::MuonHoughTransformTester::m_out_segment_hasPhi {m_tree.newVector<bool>("segmentHasPhiHits", false)}

private

Definition at line 226 of file MuonHoughTransformTester.h.

{m_tree.newVector<bool>("segmentHasPhiHits", false)}; 

m_out_segment_hasTimeFit

MuonVal::VectorBranch<bool>& MuonValR4::MuonHoughTransformTester::m_out_segment_hasTimeFit {m_tree.newVector<bool>("segmentHasTimeFit", false)}

private

Definition at line 222 of file MuonHoughTransformTester.h.

{m_tree.newVector<bool>("segmentHasTimeFit", false)}; 

m_out_segment_maxYhit

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_maxYhit {m_tree.newVector<float>("segmentMaxYhit", -1.0)}

private

Definition at line 263 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentMaxYhit", -1.0)}; 

m_out_segment_minYhit

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_minYhit {m_tree.newVector<float>("segmentMinYhit", 1.0)}

private

Definition at line 262 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentMinYhit", 1.0)}; 

m_out_segment_n

MuonVal::ScalarBranch<unsigned>& MuonValR4::MuonHoughTransformTester::m_out_segment_n {m_tree.newScalar<unsigned>("nSegments", 0)}

private

========== Segment block: Filled when we have one or multiple segments =============

Definition at line 216 of file MuonHoughTransformTester.h.

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

m_out_segment_nDoF

MuonVal::VectorBranch<uint16_t>& MuonValR4::MuonHoughTransformTester::m_out_segment_nDoF {m_tree.newVector<uint16_t>("segmentNdoF", 0)}

private

Definition at line 221 of file MuonHoughTransformTester.h.

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

m_out_segment_nMdtHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nMdtHits {m_tree.newVector<unsigned short>("segmentNMdtHits", 0)}

private

Definition at line 244 of file MuonHoughTransformTester.h.

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

m_out_segment_nMmEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nMmEtaHits {m_tree.newVector<unsigned short>("segmentNMmEtaHits", 0)}

private

Definition at line 250 of file MuonHoughTransformTester.h.

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

m_out_segment_nMmStereoHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nMmStereoHits {m_tree.newVector<unsigned short>("segmentNMmStereoHits", 0)}

private

Definition at line 251 of file MuonHoughTransformTester.h.

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

m_out_segment_nRpcEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nRpcEtaHits {m_tree.newVector<unsigned short>("segmentNRpcEtaHits", 0)}

private

Definition at line 245 of file MuonHoughTransformTester.h.

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

m_out_segment_nRpcPhiHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nRpcPhiHits {m_tree.newVector<unsigned short>("segmentNRpcPhiHits", 0)}

private

Definition at line 246 of file MuonHoughTransformTester.h.

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

m_out_segment_nsTgcPadpHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nsTgcPadpHits {m_tree.newVector<unsigned short>("segmentNsTgcPadHits", 0)}

private

Definition at line 254 of file MuonHoughTransformTester.h.

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

m_out_segment_nsTgcStripHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nsTgcStripHits {m_tree.newVector<unsigned short>("segmentNsTgcStripHits", 0)}

private

Definition at line 252 of file MuonHoughTransformTester.h.

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

m_out_segment_nsTgcWireHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nsTgcWireHits {m_tree.newVector<unsigned short>("segmentNsTgcWireHits", 0)}

private

Definition at line 253 of file MuonHoughTransformTester.h.

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

m_out_segment_nTgcEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTgcEtaHits {m_tree.newVector<unsigned short>("segmentNTgcEtaHits", 0)}

private

Definition at line 247 of file MuonHoughTransformTester.h.

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

m_out_segment_nTgcPhiHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTgcPhiHits {m_tree.newVector<unsigned short>("segmentNTgcPhiHits", 0)}

private

Definition at line 248 of file MuonHoughTransformTester.h.

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

m_out_segment_nTrueEtaHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTrueEtaHits {m_tree.newVector<unsigned short>("segmentNTrueEtaHits", 0)}

private

Definition at line 259 of file MuonHoughTransformTester.h.

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

m_out_segment_nTrueHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTrueHits {m_tree.newVector<unsigned short>("segmentNTrueHits", 0)}

private

Labelled hits from the pattern visualization tool.

Definition at line 256 of file MuonHoughTransformTester.h.

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

m_out_segment_nTruePhiHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTruePhiHits {m_tree.newVector<unsigned short>("segmentNTruePhiHits", 0)}

private

Definition at line 258 of file MuonHoughTransformTester.h.

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

m_out_segment_nTruePrecHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_nTruePrecHits {m_tree.newVector<unsigned short>("segmentNTruePrecHits", 0)}

private

Definition at line 257 of file MuonHoughTransformTester.h.

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

m_out_segment_tanphi

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_tanphi {m_tree.newVector<float>("segmentTanPhi", 0.0)}

private

Definition at line 232 of file MuonHoughTransformTester.h.

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

m_out_segment_tantheta

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_tantheta {m_tree.newVector<float>("segmentTanTheta", 0.0)}

private

Definition at line 231 of file MuonHoughTransformTester.h.

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

m_out_segment_time

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_time {m_tree.newVector<float>("segmentTime", 0.)}

private

Definition at line 233 of file MuonHoughTransformTester.h.

{m_tree.newVector<float>("segmentTime", 0.)};

m_out_segment_truthMatchedHits

MuonVal::VectorBranch<unsigned short>& MuonValR4::MuonHoughTransformTester::m_out_segment_truthMatchedHits {m_tree.newVector<unsigned short>("segmentTruthMatchedHits", 0)}

private

Definition at line 243 of file MuonHoughTransformTester.h.

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

m_out_segment_x0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_x0 {m_tree.newVector<float>("segmentX0", 0.0)}

private

Definition at line 230 of file MuonHoughTransformTester.h.

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

m_out_segment_y0

MuonVal::VectorBranch<float>& MuonValR4::MuonHoughTransformTester::m_out_segment_y0 {m_tree.newVector<float>("segmentY0", 0.0)}

private

Definition at line 229 of file MuonHoughTransformTester.h.

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

m_out_stationPhi

MuonVal::ScalarBranch<int>& MuonValR4::MuonHoughTransformTester::m_out_stationPhi {m_tree.newScalar<int>("stationPhi")}

private

phi index of the station

Definition at line 122 of file MuonHoughTransformTester.h.

{m_tree.newScalar<int>("stationPhi")};

m_out_stationSide

MuonVal::ScalarBranch<short>& MuonValR4::MuonHoughTransformTester::m_out_stationSide {m_tree.newScalar<short>("stationSide")}

private

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

Definition at line 120 of file MuonHoughTransformTester.h.

{m_tree.newScalar<short>("stationSide")};

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file)

Definition at line 88 of file AthHistogramAlgorithm.h.

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::MuonHoughTransformTester::m_spKey {this, "SpacePointKey", "MuonSpacePoints"}

private

Definition at line 104 of file MuonHoughTransformTester.h.

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

m_spMatchedToPattern

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_spMatchedToPattern {m_tree.newMatrix<unsigned char>("seedMatchedSp")}

private

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

Definition at line 130 of file MuonHoughTransformTester.h.

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

m_spMatchedToSegment

MuonVal::MatrixBranch<unsigned char>& MuonValR4::MuonHoughTransformTester::m_spMatchedToSegment {m_tree.newMatrix<unsigned char>("segmentMatchedSp")}

private

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

Definition at line 132 of file MuonHoughTransformTester.h.

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

m_spTester

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

private

Branch dumping all the space points from the difference buckets.

Definition at line 128 of file MuonHoughTransformTester.h.

{};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file)

Definition at line 226 of file AthHistogramming.h.

m_tree

MuonVal::MuonTesterTree MuonValR4::MuonHoughTransformTester::m_tree {"MuonEtaHoughTest","MuonEtaHoughTransformTest"}

private

Definition at line 95 of file MuonHoughTransformTester.h.

{"MuonEtaHoughTest","MuonEtaHoughTransformTest"}; 

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 215 of file AthHistogramming.h.

m_truthSegmentKey

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

private

Definition at line 98 of file MuonHoughTransformTester.h.

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

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

m_visionTool

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

private

Pattern visualization tool.

Definition at line 266 of file MuonHoughTransformTester.h.

{this, "VisualizationTool", ""};

m_writeSpacePoints

Gaudi::Property<bool> MuonValR4::MuonHoughTransformTester::m_writeSpacePoints

private

Initial value:

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

Definition at line 112 of file MuonHoughTransformTester.h.

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

---

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

• MuonHoughTransformTester.h
• MuonHoughTransformTester.cxx