MuonHoughDataNtuple Class Reference

Register all hit and truth info into a ttree. More...

#include <MuonHoughDataNtuple.h>

Inheritance diagram for MuonHoughDataNtuple:

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

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

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

Private Member Functions
int	channel (const Identifier &measId) const
int	gasGap (const Identifier &measId) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>
std::string	buildBookingString (std::string_view histName, std::string_view tDir, std::string_view stream, bool usePrefixPostfix=false) const
	Method to build individual booking string.
hash_t	hash (std::string_view histName) const
	Method to calculate a 32-bit hash from a string.

Private Attributes
SG::ReadHandleKey< xAOD::TruthParticleContainer >	m_truthMuonKey
SG::ReadHandleKey< xAOD::MuonSegmentContainer >	m_truthSegmentsKey
SG::ReadHandleKey< Muon::HoughDataPerSectorVec >	m_houghDataPerSectorVecKey {this, "HoughKey", "HoughDataPerSectorVec"}
ServiceHandle< Muon::IMuonIdHelperSvc >	m_idHelperSvc {this, "MuonIdHelperSvc", "Muon::MuonIdHelperSvc/MuonIdHelperSvc"}
MuonVal::MuonTesterTree	m_eta_hit_tree {"EtaHitHoughData","MuonHoughDataNtuple"}
MuonVal::ScalarBranch< float > &	m_maxHit_sector {m_eta_hit_tree.newScalar<float>("maxHit_Sector")}
MuonVal::ScalarBranch< float > &	m_maxHit_z0 {m_eta_hit_tree.newScalar<float>("maxHit_Z0")}
MuonVal::ScalarBranch< float > &	m_maxHit_theta {m_eta_hit_tree.newScalar<float>("maxHit_Theta")}
MuonVal::ScalarBranch< int > &	m_maxHit_region {m_eta_hit_tree.newScalar<int>("maxHit_Region")}
MuonVal::ScalarBranch< int > &	m_maxHit_stationIndex {m_eta_hit_tree.newScalar<int>("hit_StationIndex", -999)}
MuonVal::ScalarBranch< int > &	m_maxHit_stationEta {m_eta_hit_tree.newScalar<int>("hit_StationEta", -999)}
MuonVal::ScalarBranch< int > &	m_maxHit_stationPhi {m_eta_hit_tree.newScalar<int>("hit_StationPhi", -999)}
MuonVal::VectorBranch< float > &	m_hit_x {m_eta_hit_tree.newVector<float>("hit_X")}
MuonVal::VectorBranch< float > &	m_hit_ymin {m_eta_hit_tree.newVector<float>("hit_YMin")}
MuonVal::VectorBranch< float > &	m_hit_ymax {m_eta_hit_tree.newVector<float>("hit_YMax")}
MuonVal::VectorBranch< float > &	m_hit_w {m_eta_hit_tree.newVector<float>("hit_W")}
MuonVal::VectorBranch< int > &	m_hit_tech {m_eta_hit_tree.newVector<int>("hit_Tech")}
MuonVal::TwoVectorBranch	m_hit_local {m_eta_hit_tree, "hit_Local"}
MuonVal::ThreeVectorBranch	m_hit_global {m_eta_hit_tree, "hit_Global"}
MuonVal::MdtIdentifierBranch	m_hit_mdtId {m_eta_hit_tree, "hit_MDTId"}
MuonVal::CscIdentifierBranch	m_hit_cscId {m_eta_hit_tree, "hit_CSCId"}
MuonVal::TgcIdentifierBranch	m_hit_tgcId {m_eta_hit_tree, "hit_TGCId"}
MuonVal::RpcIdentifierBranch	m_hit_rpcId {m_eta_hit_tree, "hit_RPCId"}
MuonVal::TgcIdentifierBranch	m_hit_mmId {m_eta_hit_tree, "hit_MMId"}
MuonVal::TgcIdentifierBranch	m_hit_stgcId {m_eta_hit_tree, "hit_STGCId"}
MuonVal::VectorBranch< int > &	m_hit_mdtIndex {m_eta_hit_tree.newVector<int>("hit_MDTIndex")}
MuonVal::VectorBranch< int > &	m_hit_cscIndex {m_eta_hit_tree.newVector<int>("hit_CSCIndex")}
MuonVal::VectorBranch< int > &	m_hit_tgcIndex {m_eta_hit_tree.newVector<int>("hit_TGCIndex")}
MuonVal::VectorBranch< int > &	m_hit_rpcIndex {m_eta_hit_tree.newVector<int>("hit_RPCIndex")}
MuonVal::VectorBranch< int > &	m_hit_mmIndex {m_eta_hit_tree.newVector<int>("hit_MMIndex")}
MuonVal::VectorBranch< int > &	m_hit_stgcIndex {m_eta_hit_tree.newVector<int>("hit_STGCIndex")}
MuonVal::VectorBranch< bool > &	m_hit_truthMatched {m_eta_hit_tree.newVector<bool>("hit_TruthMatched")}
MuonVal::MuonTesterTree	m_phi_hit_tree {"PhiHitHoughData","MuonHoughDataNtuple"}
MuonVal::ScalarBranch< float > &	m_maxPhiHit_sector {m_phi_hit_tree.newScalar<float>("maxPhiHit_Sector")}
MuonVal::ScalarBranch< float > &	m_maxPhiHit_z0 {m_phi_hit_tree.newScalar<float>("maxPhiHit_Z0")}
MuonVal::ScalarBranch< int > &	m_maxPhiHit_stationIndex {m_phi_hit_tree.newScalar<int>("phiHit_StationIndex", -999)}
MuonVal::ScalarBranch< int > &	m_maxPhiHit_stationEta {m_phi_hit_tree.newScalar<int>("phiHit_StationEta", -999)}
MuonVal::ScalarBranch< int > &	m_maxPhiHit_stationPhi {m_phi_hit_tree.newScalar<int>("phiHit_StationPhi", -999)}
MuonVal::VectorBranch< float > &	m_phiHit_x {m_phi_hit_tree.newVector<float>("phiHit_X")}
MuonVal::VectorBranch< float > &	m_phiHit_ymin {m_phi_hit_tree.newVector<float>("phiHit_YMin")}
MuonVal::VectorBranch< float > &	m_phiHit_ymax {m_phi_hit_tree.newVector<float>("phiHit_YMax")}
MuonVal::VectorBranch< float > &	m_phiHit_w {m_phi_hit_tree.newVector<float>("phiHit_W")}
MuonVal::VectorBranch< int > &	m_phiHit_tech {m_phi_hit_tree.newVector<int>("phiHit_Tech")}
MuonVal::TwoVectorBranch	m_phiHit_local {m_phi_hit_tree, "phiHit_Local"}
MuonVal::ThreeVectorBranch	m_phiHit_global {m_phi_hit_tree, "phiHit_Global"}
MuonVal::MdtIdentifierBranch	m_phiHit_mdtId {m_phi_hit_tree, "phiHit_MDTId"}
MuonVal::CscIdentifierBranch	m_phiHit_cscId {m_phi_hit_tree, "phiHit_CSCId"}
MuonVal::TgcIdentifierBranch	m_phiHit_tgcId {m_phi_hit_tree, "phiHit_TGCId"}
MuonVal::RpcIdentifierBranch	m_phiHit_rpcId {m_phi_hit_tree, "phiHit_RPCId"}
MuonVal::TgcIdentifierBranch	m_phiHit_mmId {m_phi_hit_tree, "phiHit_MMId"}
MuonVal::TgcIdentifierBranch	m_phiHit_stgcId {m_phi_hit_tree, "phiHit_STGCId"}
MuonVal::VectorBranch< int > &	m_phiHit_mdtIndex {m_phi_hit_tree.newVector<int>("phiHit_MdtIndex")}
MuonVal::VectorBranch< int > &	m_phiHit_cscIndex {m_phi_hit_tree.newVector<int>("phiHit_CscIndex")}
MuonVal::VectorBranch< int > &	m_phiHit_tgcIndex {m_phi_hit_tree.newVector<int>("phiHit_TgcIndex")}
MuonVal::VectorBranch< int > &	m_phiHit_rpcIndex {m_phi_hit_tree.newVector<int>("phiHit_RpcIndex")}
MuonVal::VectorBranch< int > &	m_phiHit_mmIndex {m_phi_hit_tree.newVector<int>("phiHit_MMIndex")}
MuonVal::VectorBranch< int > &	m_phiHit_stgcIndex {m_phi_hit_tree.newVector<int>("phiHit_STGCIndex")}
MuonVal::VectorBranch< bool > &	m_phiHit_truthMatched {m_phi_hit_tree.newVector<bool>("phiHit_TruthMatched")}
MuonVal::MuonTesterTree	m_truth_tree {"TruthHoughData","MuonHoughDataNtuple"}
MuonVal::ScalarBranch< int > &	m_truth_pdgId {m_truth_tree.newScalar<int>("pdgId", -999)}
MuonVal::ScalarBranch< int > &	m_truth_barcode {m_truth_tree.newScalar<int>("barcode", -999)}
MuonVal::ScalarBranch< float > &	m_truth_pt {m_truth_tree.newScalar<float>("truth_Pt", -999)}
MuonVal::ScalarBranch< float > &	m_truth_eta {m_truth_tree.newScalar<float>("truth_Eta", -999)}
MuonVal::ScalarBranch< float > &	m_truth_phi {m_truth_tree.newScalar<float>("truth_Phi", -999)}
MuonVal::ThreeVectorBranch	m_truth_seg_pos {m_truth_tree, "truth_seg_Pos"}
MuonVal::ThreeVectorBranch	m_truth_seg_p {m_truth_tree, "truth_seg_P"}
MuonVal::VectorBranch< int > &	m_truth_seg_nPrecisionHits {m_truth_tree.newVector<int>("truth_seg_NPrecisionHits")}
MuonVal::VectorBranch< int > &	m_truth_seg_nTriggerHits {m_truth_tree.newVector<int>("truth_seg_NTriggerHits")}
MuonVal::VectorBranch< int > &	m_truth_seg_sector {m_truth_tree.newVector<int>("truth_seg_Sector")}
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();.
std::string	m_prefix
	Name of the ROOT output stream (file).
std::string	m_rootDir
	Name of the ROOT directory.
std::string	m_histNamePrefix
	The prefix for the histogram THx name.
std::string	m_histNamePostfix
	The postfix for the histogram THx name.
std::string	m_histTitlePrefix
	The prefix for the histogram THx title.
std::string	m_histTitlePostfix
	The postfix for the histogram THx title.
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers.
EffMap_t	m_effMap
	The map of histogram names to their pointers.
TreeMap_t	m_treeMap
	The map of TTree names to their pointers.
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers.
std::string	m_streamName
	Name of the ROOT output stream (file).
std::string	m_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Detailed Description

Register all hit and truth info into a ttree.

Definition at line 31 of file MuonHoughDataNtuple.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 199 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 213 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 171 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 192 of file AthHistogramming.h.

StoreGateSvc_t

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

privateinherited

Definition at line 376 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 206 of file AthHistogramming.h.

Constructor & Destructor Documentation

MuonHoughDataNtuple()

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

Definition at line 26 of file MuonHoughDataNtuple.cxx.

                                                                                        :
  AthHistogramAlgorithm(name, pSvcLocator) {}

~MuonHoughDataNtuple()

MuonHoughDataNtuple::~MuonHoughDataNtuple ( )

overridevirtual

Definition at line 29 of file MuonHoughDataNtuple.cxx.

{}

Member Function Documentation

book() [1/8]

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

inlineprotectedinherited

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

Definition at line 329 of file AthHistogramming.h.

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

book() [2/8]

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

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 297 of file AthHistogramming.h.

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

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 397 of file AthHistogramming.h.

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

book() [5/8]

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

inlineprotectedinherited

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

Definition at line 350 of file AthHistogramming.h.

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

book() [6/8]

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

inlineprotectedinherited

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

Definition at line 340 of file AthHistogramming.h.

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

book() [7/8]

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

inlineprotectedinherited

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

Definition at line 318 of file AthHistogramming.h.

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

book() [8/8]

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

inlineprotectedinherited

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

Definition at line 308 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 275 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 374 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 254 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 268 of file AthHistogramming.cxx.

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

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 139 of file AthHistogramming.cxx.

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

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 287 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 97 of file AthHistogramming.cxx.

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

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 266 of file AthHistogramming.h.

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

buildBookingString()

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

privateinherited

Method to build individual booking string.

Definition at line 500 of file AthHistogramming.cxx.

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

channel()

int MuonHoughDataNtuple::channel ( const Identifier & measId ) const

private

configAthHistogramming()

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

protectedinherited

To be called to fill the internal configuration.

Definition at line 64 of file AthHistogramming.cxx.

{
  m_histSvc          = histSvc;
  m_streamName       = prefix;
  m_rootDir          = rootDir;
  m_histNamePrefix   = histNamePrefix;
  m_histNamePostfix  = histNamePostfix;
  m_histTitlePrefix  = histTitlePrefix;
  m_histTitlePostfix = histTitlePostfix;
 
  return StatusCode::SUCCESS;
}

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 214 of file AthHistogramming.cxx.

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

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::evtStore ( )

inlineinherited

The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode MuonHoughDataNtuple::execute ( const EventContext & ctx )

overridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 59 of file MuonHoughDataNtuple.cxx.

{
  // retrieve containers
  const EventContext & context = ctx;
  SG::ReadHandle<Muon::HoughDataPerSectorVec> houghSecVec{m_houghDataPerSectorVecKey, context};
 
  SG::ReadHandle<xAOD::MuonSegmentContainer> truthSegContainer(m_truthSegmentsKey, context);
 
  if(!houghSecVec.isValid()){
    ATH_MSG_FATAL("Failed to retrieve Hough data per sector vector");
    return StatusCode::FAILURE;
  }
  
  std::vector<HitTruthMatching> truthMuons{};
 
  SG::ReadHandle<xAOD::TruthParticleContainer> truthMuonContainer(m_truthMuonKey, context);
 
  if(!truthMuonContainer.isValid()){
    ATH_MSG_FATAL("Failed to retrieve truth muon container");
    return StatusCode::FAILURE;
  }
  for (const xAOD::TruthParticle* truth_mu : *truthMuonContainer) {
     truthMuons.emplace_back(truth_mu);
  }
 
  if(!truthSegContainer.isValid()){
    ATH_MSG_FATAL("Failed to retrieve truth segment container");
    return StatusCode::FAILURE;
  }
  ATH_MSG_DEBUG("Houghidipuff retrieved all input collections! Start puffing...");
 
  // filling variables for eta/phi hit with maximum entries for hough 
  for(unsigned int sec_i=0; sec_i<houghSecVec->vec.size(); ++sec_i){ // looping sector
    // Eta Hit 
    // starting from all layers
    for (const std::vector<std::shared_ptr<MuonHough::MuonLayerHough::Maximum>>& maxvec : 
        houghSecVec->vec[sec_i].maxVec){
      // then to all Maxima in the same layer
      for(const std::shared_ptr<MuonHough::MuonLayerHough::Maximum>& max : maxvec){ // looping maximum collection
        m_maxHit_sector = sec_i;
        m_maxHit_z0 = max->pos;
        m_maxHit_theta = max->theta;
        m_maxHit_region = toInt(max->refregion);
        bool firstHit = true; // to store station information
        // now record all hits in the maximum
        int hit_index = 0;
        for (const std::shared_ptr<MuonHough::Hit>& hit : max->hits){
          m_hit_x.push_back(hit->x);
          m_hit_ymin.push_back(hit->ymin);
          m_hit_ymax.push_back(hit->ymax);
          m_hit_w.push_back(hit->w);
          // hit debug info
          const MuonHough::HitDebugInfo* hdi = hit->debugInfo();
          m_hit_tech.push_back(hdi->type);
          // more information from prd
          if(hit->prd){
            const Trk::PrepRawData* prd = hit->prd;
            const Identifier measId = prd->identify();
            // station info
            if(firstHit){
              m_maxHit_stationIndex = toInt(m_idHelperSvc->stationIndex(measId));
              m_maxHit_stationEta = m_idHelperSvc->stationEta(measId);
              m_maxHit_stationPhi = m_idHelperSvc->stationPhi(measId);
              firstHit = false;
            }
            // local position 
            m_hit_local.push_back(prd->localPosition());
            // global position -- which is the real one??? 
            const Muon::MdtPrepData* DC{dynamic_cast<const Muon::MdtPrepData*>(prd)};
            if (DC) m_hit_global.push_back(DC->globalPosition());
            const Muon::MuonCluster* CL{dynamic_cast<const Muon::MuonCluster*>(prd)};
            if (CL) m_hit_global.push_back(CL->globalPosition());
            // information from identifiers
            if (m_idHelperSvc->isMdt(measId)) {
                m_hit_mdtId.push_back(measId);
                m_hit_mdtIndex.push_back(hit_index);
            } 
            else if (m_idHelperSvc->isCsc(measId)) {
                m_hit_cscId.push_back(measId);
                m_hit_cscIndex.push_back(hit_index);
            }
            else if (m_idHelperSvc->isTgc(measId)) {
                m_hit_tgcId.push_back(measId);
                m_hit_tgcIndex.push_back(hit_index);
            }
            else if (m_idHelperSvc->isRpc(measId)) {
                m_hit_rpcId.push_back(measId);
                m_hit_rpcIndex.push_back(hit_index);
            }
            else if (m_idHelperSvc->isMM(measId)) {
                m_hit_mmId.push_back(measId);
                m_hit_mmIndex.push_back(hit_index);
            }
            else if (m_idHelperSvc->issTgc(measId)) {
                m_hit_stgcId.push_back(measId);
                m_hit_stgcIndex.push_back(hit_index);
            }
            hit_index++;
            // truth matching to muons
            bool matched = std::find_if(truthMuons.begin(), truthMuons.end(), 
                                         [prd](const HitTruthMatching& hit){
                                            return hit.assocHits.count(prd->identify());
                                        }) != truthMuons.end();
            
            m_hit_truthMatched.push_back(matched);
          }
        }
        ATH_CHECK(m_eta_hit_tree.fill(context));
      }
    }
    // PhiHit vec
    // starting from all layers
    for (const std::vector<std::shared_ptr<MuonHough::MuonPhiLayerHough::Maximum>>& phimaxvec : 
        houghSecVec->vec[sec_i].phiMaxVec){
      // then to all Maxima in the same layer
      for(const std::shared_ptr<MuonHough::MuonPhiLayerHough::Maximum>& max : phimaxvec){ // looping maximum collection
        m_maxPhiHit_sector = sec_i;
        m_maxPhiHit_z0 = max->pos;
        bool firstHit = true; // to store station information
        // now record all hits in the maximum
        int phiHit_index = 0;
        for (const std::shared_ptr<MuonHough::PhiHit>& phi_hit : max->hits){
          m_phiHit_x.push_back(phi_hit->r);
          m_phiHit_ymin.push_back(phi_hit->phimin);
          m_phiHit_ymax.push_back(phi_hit->phimax);
          m_phiHit_w.push_back(phi_hit->w);
          // phi hit debug info
          const MuonHough::HitDebugInfo* hdi = phi_hit->debugInfo();
          m_phiHit_tech.push_back(hdi->type);
          // information from prd
          if(phi_hit->prd){
            const Trk::PrepRawData* prd = phi_hit->prd;
            const Identifier measId = prd->identify();
            // station info
            if(firstHit){
              m_maxPhiHit_stationIndex = toInt(m_idHelperSvc->stationIndex(prd->identify()));
              m_maxPhiHit_stationEta = m_idHelperSvc->stationEta(prd->identify());
              m_maxPhiHit_stationPhi = m_idHelperSvc->stationPhi(prd->identify());
              firstHit = false;
            }
            // local position 
            m_phiHit_local.push_back(prd->localPosition());
            // global position -- which is the real one??? 
            const Muon::MdtPrepData* DC{dynamic_cast<const Muon::MdtPrepData*>(prd)};
            if (DC) m_phiHit_global.push_back(DC->globalPosition());
            const Muon::MuonCluster* CL{dynamic_cast<const Muon::MuonCluster*>(prd)};
            if (CL) m_phiHit_global.push_back(CL->globalPosition());
            // information from identifiers
            if (m_idHelperSvc->isMdt(measId)) {
                m_phiHit_mdtId.push_back(measId);
                m_phiHit_mdtIndex.push_back(phiHit_index);
            } 
            else if (m_idHelperSvc->isCsc(measId)) {
                m_phiHit_cscId.push_back(measId);
                m_phiHit_cscIndex.push_back(phiHit_index);
            }
            else if (m_idHelperSvc->isTgc(measId)) {
                m_phiHit_tgcId.push_back(measId);
                m_phiHit_tgcIndex.push_back(phiHit_index);
            }
            else if (m_idHelperSvc->isRpc(measId)) {
                m_phiHit_rpcId.push_back(measId);
                m_phiHit_rpcIndex.push_back(phiHit_index);
            }
            else if (m_idHelperSvc->isMM(measId)) {
                m_phiHit_mmId.push_back(measId);
                m_phiHit_mmIndex.push_back(phiHit_index);
            }
            else if (m_idHelperSvc->issTgc(measId)) {
                m_phiHit_stgcId.push_back(measId);
                m_phiHit_stgcIndex.push_back(phiHit_index);
            }
            phiHit_index++;
 
            // truth matching to muons
            bool matched = std::find_if(truthMuons.begin(), truthMuons.end(), 
                                         [prd](const HitTruthMatching& hit){
                                            return hit.assocHits.count(prd->identify());
                                        }) != truthMuons.end();
            
            m_phiHit_truthMatched.push_back(matched);
          }
        }
        ATH_CHECK(m_phi_hit_tree.fill(context));
      }
    }
  }
  
  // filling truth values 
  for(const xAOD::TruthParticle* truthMu: *truthMuonContainer){
    m_truth_pdgId = truthMu->pdgId();
    m_truth_barcode = HepMC::uniqueID(truthMu);
 
    m_truth_pt = truthMu->pt();
    m_truth_eta = truthMu->eta();
    m_truth_phi = truthMu->phi();
    // access the truth segment from truth particle
    static const SG::AuxElement::ConstAccessor<ElementLink<xAOD::TruthParticleContainer>> truthMuLink("truthParticleLink");
    // filling truth segment values
    for(const xAOD::MuonSegment* truthSeg: *truthSegContainer){
      if(!truthMuLink.isAvailable(*truthSeg)) { continue; } // if segment isn't linked to truth muon, skip
      ElementLink<xAOD::TruthParticleContainer> truthLink = truthMuLink(*truthSeg);
      const xAOD::TruthParticle* truthParticle = *truthLink;
      if(truthParticle!=truthMu) { continue; } // i have no idea if this works
      m_truth_seg_pos.push_back(truthSeg->x(), truthSeg->y(), truthSeg->z());
      m_truth_seg_p.push_back(truthSeg->px(), truthSeg->py(), truthSeg->pz());
 
      m_truth_seg_nPrecisionHits.push_back(truthSeg->nPrecisionHits());
      m_truth_seg_sector.push_back(truthSeg->sector());
 
      int nTriggerHits = truthSeg->nPhiLayers() + truthSeg->nTrigEtaLayers();
      m_truth_seg_nTriggerHits.push_back(nTriggerHits);
    }
    ATH_CHECK(m_truth_tree.fill(context));
  }
 
 
  return StatusCode::SUCCESS;
}

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

const DataObjIDColl & AthCommonAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 89 of file AthCommonAlgorithm.cxx.

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

filterPassed()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

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

finalize()

StatusCode MuonHoughDataNtuple::finalize ( )

overridevirtual

Definition at line 51 of file MuonHoughDataNtuple.cxx.

{
  ATH_CHECK(m_truth_tree.write());
  ATH_CHECK(m_eta_hit_tree.write());
  ATH_CHECK(m_phi_hit_tree.write());
  return StatusCode::SUCCESS;
}

gasGap()

int MuonHoughDataNtuple::gasGap ( const Identifier & measId ) const

private

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 438 of file AthHistogramming.cxx.

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

hash()

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

inlineprivateinherited

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

Definition at line 422 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 182 of file AthHistogramming.cxx.

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

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 363 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 380 of file AthHistogramming.h.

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

histSvc()

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

inlineinherited

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

Definition at line 113 of file AthHistogramAlgorithm.h.

{
  return m_histSvc;
}

initialize()

StatusCode MuonHoughDataNtuple::initialize ( )

overridevirtual

Definition at line 31 of file MuonHoughDataNtuple.cxx.

{
  ATH_CHECK(m_houghDataPerSectorVecKey.initialize());        
  ATH_CHECK(m_truthMuonKey.initialize());
  ATH_CHECK(m_truthSegmentsKey.initialize());
  m_truth_tree.addBranch(std::make_unique<MuonVal::EventInfoBranch>(m_truth_tree, 0));
  m_eta_hit_tree.addBranch(std::make_unique<MuonVal::EventInfoBranch>(m_eta_hit_tree, 0));
  m_phi_hit_tree.addBranch(std::make_unique<MuonVal::EventInfoBranch>(m_phi_hit_tree, 0));
   
  
  ATH_CHECK(m_truth_tree.init(this));
 
  ATH_CHECK(m_eta_hit_tree.init(this));
  ATH_CHECK(m_phi_hit_tree.init(this));
  ATH_CHECK(m_idHelperSvc.retrieve());
  ATH_MSG_DEBUG("MuonHoughDataNtuple succesfully initialised");
 
  return StatusCode::SUCCESS;
}

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

isClonable()

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

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

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

Reimplemented in AFP_DigiTop, AlgB, AlgT, BCM_Digitization, CscDigitBuilder, CscDigitToCscRDO, G4AtlasAlg, G4RunAlg, HGTD_Digitization, HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ISF::SimKernelMT, ITk::StripDigitization, ITkPixelCablingAlg, ITkStripCablingAlg, LArHitEMapMaker, LArTTL1Maker, LUCID_DigiTop, LVL1::L1TopoSimulation, MergeCalibHits, MergeGenericMuonSimHitColl, MergeHijingPars, MergeMcEventCollection, MergeTrackRecordCollection, MergeTruthJets, MergeTruthParticles, MuonDigitizer, PileUpMTAlg, PixelDigitization, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_Digitization, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, SGInputLoader, Simulation::BeamEffectsAlg, TileHitVecToCnt, TileMuonFitter, TilePulseForTileMuonReceiver, TileRawChannelMaker, TRTDigitization, and ZDC_DigiTop.

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

{ return false; }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

renounce()

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

inlineprotectedinherited

Definition at line 368 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 352 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Definition at line 99 of file AthCommonAlgorithm.h.

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

sysExecute()

StatusCode AthCommonAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx )

overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthCommonAlgorithm< Gaudi::Algorithm >.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

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

sysStart()

virtual StatusCode AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::sysStart ( )

overridevirtualinherited

Handle START transition.

We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.

tree()

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

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 333 of file AthHistogramming.cxx.

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

updateVHKA()

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

inlineinherited

Definition at line 298 of file AthCommonDataStore.h.

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

Member Data Documentation

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 381 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 202 of file AthHistogramming.h.

m_eta_hit_tree

MuonVal::MuonTesterTree MuonHoughDataNtuple::m_eta_hit_tree {"EtaHitHoughData","MuonHoughDataNtuple"}

private

Definition at line 53 of file MuonHoughDataNtuple.h.

{"EtaHitHoughData","MuonHoughDataNtuple"}; 

m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 378 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 216 of file AthHistogramming.h.

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 195 of file AthHistogramming.h.

m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix

privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix

privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc

privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix

privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix

privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

m_hit_cscId

MuonVal::CscIdentifierBranch MuonHoughDataNtuple::m_hit_cscId {m_eta_hit_tree, "hit_CSCId"}

private

Definition at line 78 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_CSCId"};

m_hit_cscIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_cscIndex {m_eta_hit_tree.newVector<int>("hit_CSCIndex")}

private

Definition at line 85 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_CSCIndex")}; 

m_hit_global

MuonVal::ThreeVectorBranch MuonHoughDataNtuple::m_hit_global {m_eta_hit_tree, "hit_Global"}

private

Definition at line 74 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_Global"}; 

m_hit_local

MuonVal::TwoVectorBranch MuonHoughDataNtuple::m_hit_local {m_eta_hit_tree, "hit_Local"}

private

Definition at line 73 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_Local"}; 

m_hit_mdtId

MuonVal::MdtIdentifierBranch MuonHoughDataNtuple::m_hit_mdtId {m_eta_hit_tree, "hit_MDTId"}

private

Definition at line 77 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_MDTId"};

m_hit_mdtIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_mdtIndex {m_eta_hit_tree.newVector<int>("hit_MDTIndex")}

private

Definition at line 84 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_MDTIndex")}; 

m_hit_mmId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_hit_mmId {m_eta_hit_tree, "hit_MMId"}

private

Definition at line 81 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_MMId"};

m_hit_mmIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_mmIndex {m_eta_hit_tree.newVector<int>("hit_MMIndex")}

private

Definition at line 88 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_MMIndex")}; 

m_hit_rpcId

MuonVal::RpcIdentifierBranch MuonHoughDataNtuple::m_hit_rpcId {m_eta_hit_tree, "hit_RPCId"}

private

Definition at line 80 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_RPCId"};

m_hit_rpcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_rpcIndex {m_eta_hit_tree.newVector<int>("hit_RPCIndex")}

private

Definition at line 87 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_RPCIndex")}; 

m_hit_stgcId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_hit_stgcId {m_eta_hit_tree, "hit_STGCId"}

private

Definition at line 82 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_STGCId"};

m_hit_stgcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_stgcIndex {m_eta_hit_tree.newVector<int>("hit_STGCIndex")}

private

Definition at line 89 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_STGCIndex")}; 

m_hit_tech

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_tech {m_eta_hit_tree.newVector<int>("hit_Tech")}

private

Definition at line 70 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_Tech")}; 

m_hit_tgcId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_hit_tgcId {m_eta_hit_tree, "hit_TGCId"}

private

Definition at line 79 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree, "hit_TGCId"};

m_hit_tgcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_hit_tgcIndex {m_eta_hit_tree.newVector<int>("hit_TGCIndex")}

private

Definition at line 86 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<int>("hit_TGCIndex")}; 

m_hit_truthMatched

MuonVal::VectorBranch<bool>& MuonHoughDataNtuple::m_hit_truthMatched {m_eta_hit_tree.newVector<bool>("hit_TruthMatched")}

private

Definition at line 91 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<bool>("hit_TruthMatched")}; 

m_hit_w

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_hit_w {m_eta_hit_tree.newVector<float>("hit_W")}

private

Definition at line 68 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<float>("hit_W")}; 

m_hit_x

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_hit_x {m_eta_hit_tree.newVector<float>("hit_X")}

private

Definition at line 65 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<float>("hit_X")}; 

m_hit_ymax

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_hit_ymax {m_eta_hit_tree.newVector<float>("hit_YMax")}

private

Definition at line 67 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<float>("hit_YMax")}; 

m_hit_ymin

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_hit_ymin {m_eta_hit_tree.newVector<float>("hit_YMin")}

private

Definition at line 66 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newVector<float>("hit_YMin")}; 

m_houghDataPerSectorVecKey

SG::ReadHandleKey<Muon::HoughDataPerSectorVec> MuonHoughDataNtuple::m_houghDataPerSectorVecKey {this, "HoughKey", "HoughDataPerSectorVec"}

private

Definition at line 49 of file MuonHoughDataNtuple.h.

{this, "HoughKey", "HoughDataPerSectorVec"};

m_idHelperSvc

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

private

Definition at line 50 of file MuonHoughDataNtuple.h.

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

m_maxHit_region

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxHit_region {m_eta_hit_tree.newScalar<int>("maxHit_Region")}

private

Definition at line 58 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<int>("maxHit_Region")}; 

m_maxHit_sector

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_maxHit_sector {m_eta_hit_tree.newScalar<float>("maxHit_Sector")}

private

Definition at line 55 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<float>("maxHit_Sector")}; 

m_maxHit_stationEta

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxHit_stationEta {m_eta_hit_tree.newScalar<int>("hit_StationEta", -999)}

private

Definition at line 61 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<int>("hit_StationEta", -999)}; 

m_maxHit_stationIndex

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxHit_stationIndex {m_eta_hit_tree.newScalar<int>("hit_StationIndex", -999)}

private

Definition at line 60 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<int>("hit_StationIndex", -999)}; 

m_maxHit_stationPhi

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxHit_stationPhi {m_eta_hit_tree.newScalar<int>("hit_StationPhi", -999)}

private

Definition at line 62 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<int>("hit_StationPhi", -999)}; 

m_maxHit_theta

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_maxHit_theta {m_eta_hit_tree.newScalar<float>("maxHit_Theta")}

private

Definition at line 57 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<float>("maxHit_Theta")}; 

m_maxHit_z0

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_maxHit_z0 {m_eta_hit_tree.newScalar<float>("maxHit_Z0")}

private

Definition at line 56 of file MuonHoughDataNtuple.h.

{m_eta_hit_tree.newScalar<float>("maxHit_Z0")}; 

m_maxPhiHit_sector

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_maxPhiHit_sector {m_phi_hit_tree.newScalar<float>("maxPhiHit_Sector")}

private

Definition at line 96 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newScalar<float>("maxPhiHit_Sector")}; 

m_maxPhiHit_stationEta

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxPhiHit_stationEta {m_phi_hit_tree.newScalar<int>("phiHit_StationEta", -999)}

private

Definition at line 100 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newScalar<int>("phiHit_StationEta", -999)}; 

m_maxPhiHit_stationIndex

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxPhiHit_stationIndex {m_phi_hit_tree.newScalar<int>("phiHit_StationIndex", -999)}

private

Definition at line 99 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newScalar<int>("phiHit_StationIndex", -999)}; 

m_maxPhiHit_stationPhi

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_maxPhiHit_stationPhi {m_phi_hit_tree.newScalar<int>("phiHit_StationPhi", -999)}

private

Definition at line 101 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newScalar<int>("phiHit_StationPhi", -999)}; 

m_maxPhiHit_z0

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_maxPhiHit_z0 {m_phi_hit_tree.newScalar<float>("maxPhiHit_Z0")}

private

Definition at line 97 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newScalar<float>("maxPhiHit_Z0")}; 

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 242 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 239 of file AthHistogramming.h.

m_phi_hit_tree

MuonVal::MuonTesterTree MuonHoughDataNtuple::m_phi_hit_tree {"PhiHitHoughData","MuonHoughDataNtuple"}

private

Definition at line 94 of file MuonHoughDataNtuple.h.

{"PhiHitHoughData","MuonHoughDataNtuple"}; 

m_phiHit_cscId

MuonVal::CscIdentifierBranch MuonHoughDataNtuple::m_phiHit_cscId {m_phi_hit_tree, "phiHit_CSCId"}

private

Definition at line 117 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_CSCId"};

m_phiHit_cscIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_cscIndex {m_phi_hit_tree.newVector<int>("phiHit_CscIndex")}

private

Definition at line 124 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_CscIndex")}; 

m_phiHit_global

MuonVal::ThreeVectorBranch MuonHoughDataNtuple::m_phiHit_global {m_phi_hit_tree, "phiHit_Global"}

private

Definition at line 113 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_Global"}; 

m_phiHit_local

MuonVal::TwoVectorBranch MuonHoughDataNtuple::m_phiHit_local {m_phi_hit_tree, "phiHit_Local"}

private

Definition at line 112 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_Local"}; 

m_phiHit_mdtId

MuonVal::MdtIdentifierBranch MuonHoughDataNtuple::m_phiHit_mdtId {m_phi_hit_tree, "phiHit_MDTId"}

private

Definition at line 116 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_MDTId"};

m_phiHit_mdtIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_mdtIndex {m_phi_hit_tree.newVector<int>("phiHit_MdtIndex")}

private

Definition at line 123 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_MdtIndex")}; 

m_phiHit_mmId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_phiHit_mmId {m_phi_hit_tree, "phiHit_MMId"}

private

Definition at line 120 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_MMId"};

m_phiHit_mmIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_mmIndex {m_phi_hit_tree.newVector<int>("phiHit_MMIndex")}

private

Definition at line 127 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_MMIndex")}; 

m_phiHit_rpcId

MuonVal::RpcIdentifierBranch MuonHoughDataNtuple::m_phiHit_rpcId {m_phi_hit_tree, "phiHit_RPCId"}

private

Definition at line 119 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_RPCId"};

m_phiHit_rpcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_rpcIndex {m_phi_hit_tree.newVector<int>("phiHit_RpcIndex")}

private

Definition at line 126 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_RpcIndex")}; 

m_phiHit_stgcId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_phiHit_stgcId {m_phi_hit_tree, "phiHit_STGCId"}

private

Definition at line 121 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_STGCId"};

m_phiHit_stgcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_stgcIndex {m_phi_hit_tree.newVector<int>("phiHit_STGCIndex")}

private

Definition at line 128 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_STGCIndex")}; 

m_phiHit_tech

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_tech {m_phi_hit_tree.newVector<int>("phiHit_Tech")}

private

Definition at line 109 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_Tech")}; 

m_phiHit_tgcId

MuonVal::TgcIdentifierBranch MuonHoughDataNtuple::m_phiHit_tgcId {m_phi_hit_tree, "phiHit_TGCId"}

private

Definition at line 118 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree, "phiHit_TGCId"};

m_phiHit_tgcIndex

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_phiHit_tgcIndex {m_phi_hit_tree.newVector<int>("phiHit_TgcIndex")}

private

Definition at line 125 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<int>("phiHit_TgcIndex")}; 

m_phiHit_truthMatched

MuonVal::VectorBranch<bool>& MuonHoughDataNtuple::m_phiHit_truthMatched {m_phi_hit_tree.newVector<bool>("phiHit_TruthMatched")}

private

Definition at line 130 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<bool>("phiHit_TruthMatched")}; 

m_phiHit_w

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_phiHit_w {m_phi_hit_tree.newVector<float>("phiHit_W")}

private

Definition at line 107 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<float>("phiHit_W")}; 

m_phiHit_x

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_phiHit_x {m_phi_hit_tree.newVector<float>("phiHit_X")}

private

Definition at line 104 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<float>("phiHit_X")}; 

m_phiHit_ymax

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_phiHit_ymax {m_phi_hit_tree.newVector<float>("phiHit_YMax")}

private

Definition at line 106 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<float>("phiHit_YMax")}; 

m_phiHit_ymin

MuonVal::VectorBranch<float>& MuonHoughDataNtuple::m_phiHit_ymin {m_phi_hit_tree.newVector<float>("phiHit_YMin")}

private

Definition at line 105 of file MuonHoughDataNtuple.h.

{m_phi_hit_tree.newVector<float>("phiHit_YMin")}; 

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_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 220 of file AthHistogramming.h.

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 209 of file AthHistogramming.h.

m_truth_barcode

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_truth_barcode {m_truth_tree.newScalar<int>("barcode", -999)}

private

Definition at line 136 of file MuonHoughDataNtuple.h.

{m_truth_tree.newScalar<int>("barcode", -999)};  // FIXME barcode-based

m_truth_eta

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_truth_eta {m_truth_tree.newScalar<float>("truth_Eta", -999)}

private

Definition at line 139 of file MuonHoughDataNtuple.h.

{m_truth_tree.newScalar<float>("truth_Eta", -999)}; 

m_truth_pdgId

MuonVal::ScalarBranch<int>& MuonHoughDataNtuple::m_truth_pdgId {m_truth_tree.newScalar<int>("pdgId", -999)}

private

Definition at line 135 of file MuonHoughDataNtuple.h.

{m_truth_tree.newScalar<int>("pdgId", -999)}; 

m_truth_phi

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_truth_phi {m_truth_tree.newScalar<float>("truth_Phi", -999)}

private

Definition at line 140 of file MuonHoughDataNtuple.h.

{m_truth_tree.newScalar<float>("truth_Phi", -999)}; 

m_truth_pt

MuonVal::ScalarBranch<float>& MuonHoughDataNtuple::m_truth_pt {m_truth_tree.newScalar<float>("truth_Pt", -999)}

private

Definition at line 138 of file MuonHoughDataNtuple.h.

{m_truth_tree.newScalar<float>("truth_Pt", -999)}; 

m_truth_seg_nPrecisionHits

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_truth_seg_nPrecisionHits {m_truth_tree.newVector<int>("truth_seg_NPrecisionHits")}

private

Definition at line 146 of file MuonHoughDataNtuple.h.

{m_truth_tree.newVector<int>("truth_seg_NPrecisionHits")};

m_truth_seg_nTriggerHits

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_truth_seg_nTriggerHits {m_truth_tree.newVector<int>("truth_seg_NTriggerHits")}

private

Definition at line 147 of file MuonHoughDataNtuple.h.

{m_truth_tree.newVector<int>("truth_seg_NTriggerHits")};

m_truth_seg_p

MuonVal::ThreeVectorBranch MuonHoughDataNtuple::m_truth_seg_p {m_truth_tree, "truth_seg_P"}

private

Definition at line 144 of file MuonHoughDataNtuple.h.

{m_truth_tree, "truth_seg_P"};

m_truth_seg_pos

MuonVal::ThreeVectorBranch MuonHoughDataNtuple::m_truth_seg_pos {m_truth_tree, "truth_seg_Pos"}

private

Definition at line 143 of file MuonHoughDataNtuple.h.

{m_truth_tree, "truth_seg_Pos"};

m_truth_seg_sector

MuonVal::VectorBranch<int>& MuonHoughDataNtuple::m_truth_seg_sector {m_truth_tree.newVector<int>("truth_seg_Sector")}

private

Definition at line 148 of file MuonHoughDataNtuple.h.

{m_truth_tree.newVector<int>("truth_seg_Sector")};

m_truth_tree

MuonVal::MuonTesterTree MuonHoughDataNtuple::m_truth_tree {"TruthHoughData","MuonHoughDataNtuple"}

private

Definition at line 133 of file MuonHoughDataNtuple.h.

{"TruthHoughData","MuonHoughDataNtuple"}; 

m_truthMuonKey

SG::ReadHandleKey<xAOD::TruthParticleContainer> MuonHoughDataNtuple::m_truthMuonKey

private

Initial value:

{
    this, "MuonTruthParticlesKey", "MuonTruthParticles"}

Definition at line 44 of file MuonHoughDataNtuple.h.

                                                            {
    this, "MuonTruthParticlesKey", "MuonTruthParticles"};

m_truthSegmentsKey

SG::ReadHandleKey<xAOD::MuonSegmentContainer> MuonHoughDataNtuple::m_truthSegmentsKey

private

Initial value:

{
    this, "MuonTruthSegmentsKey", "MuonTruthSegments"}

Definition at line 46 of file MuonHoughDataNtuple.h.

                                                              {
    this, "MuonTruthSegmentsKey", "MuonTruthSegments"};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 387 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 386 of file AthCommonDataStore.h.

---

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

• MuonHoughDataNtuple.h
• MuonHoughDataNtuple.cxx