MSVtxValidationAlg Class Reference

#include <MSVtxValidationAlg.h>

Inheritance diagram for MSVtxValidationAlg:

Classes
struct	TriggerInfo

Public Member Functions
virtual StatusCode	initialize () override final
virtual StatusCode	execute () override final
virtual StatusCode	finalize () override final
	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
using	ParticleBranchPtr_t = std::shared_ptr<MuonVal::IParticleFourMomBranch>
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t
typedef uint32_t	hash_t
	typedef for the internal hash
typedef std::map< const hash_t, TH1 * >	HistMap_t
	Typedef for convenience.
typedef std::map< const hash_t, TEfficiency * >	EffMap_t
	Typedef for convenience.
typedef std::map< const hash_t, TTree * >	TreeMap_t
	Typedef for convenience.
typedef std::map< const hash_t, TGraph * >	GraphMap_t
	Typedef for convenience.

Private Member Functions
StatusCode	fillTruth (const EventContext &ctx)
StatusCode	fillTruthVertex (const EventContext &ctx)
StatusCode	fillTruthParticle (const EventContext &ctx)
StatusCode	fillJet (const EventContext &ctx)
StatusCode	fillMet (const EventContext &ctx)
StatusCode	fillMuons (const EventContext &ctx)
StatusCode	fillTracklets (const EventContext &ctx)
StatusCode	fillMSVtx (const EventContext &ctx)
StatusCode	fillLLP (std::vector< const xAOD::TruthParticle * > &llps)
void	fillHits (const xAOD::Vertex *vtx, const std::string &decorator_str, MuonVal::VectorBranch< int > &branch)
TriggerInfo	getTriggerDecisions (std::string triggerString)
template<typename T>
bool	getTriggerMatchingDecision (const T *object, TriggerInfo &triggerInfo, float dRmatching)
StatusCode	fillActiveVertices (const EventContext &ctx, const xAOD::Jet *jet)
StatusCode	fillMSVtxIsolation (const xAOD::Vertex *msVtx, const xAOD::TrackParticleContainer *tracks, const xAOD::JetContainer *jets)
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
SG::ReadHandleKey< xAOD::EventInfo >	m_evtKey {this, "EvtKey", "EventInfo"}
SG::ReadHandleKey< xAOD::TruthParticleContainer >	m_TruthParticleKey {this, "TruthParticleKey", "TruthParticles"}
SG::ReadHandleKey< xAOD::TruthVertexContainer >	m_TruthVertexKey {this, "TruthVertexKey", "TruthVertices"}
SG::ReadHandleKey< xAOD::TrackParticleContainer >	m_TrackParticleKey {this, "TrackParticleKey", "InDetTrackParticles"}
SG::ReadHandleKey< xAOD::JetContainer >	m_JetKey {this, "JetKey", "HLT_AntiKt4EMTopoJets_nojcalib"}
SG::ReadHandleKey< xAOD::MissingETContainer >	m_MetKey {this, "MetKey", "STCalibMET"}
SG::ReadHandleKey< xAOD::MuonContainer >	m_MuonKey {this, "MuonKey", "Muons"}
SG::ReadHandleKey< xAOD::MuonSegmentContainer >	m_MuonSegKey {this, "MuonSegmentsKey", "MuonSegments"}
SG::ReadHandleKey< xAOD::TrackParticleContainer >	m_TrackletKey {this, "TrackletKey", "MSonlyTracklets"}
SG::ReadHandleKey< xAOD::VertexContainer >	m_MSVtxKey {this, "MSVertexKey", "MSDisplacedVertex"}
PublicToolHandle< Trig::TrigDecisionTool >	m_trigDec {this, "TrigDecisionTool", "", "TrigDecisionTool (optional)"}
PublicToolHandle< Trig::R3MatchingTool >	m_matchingTool {this, "R3MatchingTool", "", "R3MatchingTool (optional)"}
Gaudi::Property< std::string >	m_triggerStringJets {this, "TriggerString", "HLT_j400.*"}
Gaudi::Property< float >	m_jetTriggerMatchingDR {this, "jetTriggerMatching", 0.1, "max dR distance for jet trigger matching"}
Gaudi::Property< bool >	m_isMC {this, "isMC", true, "is the input data simulated (MC) or real data?"}
Gaudi::Property< bool >	m_readTriggers {this, "readTriggers", false, "should trigger information be read?"}
Gaudi::Property< bool >	m_dumpTruthParticles {this, "dumpTruthParticles", false, "dump truth particles to the tree"}
Gaudi::Property< bool >	m_dumpTruthVertices {this, "dumpTruthVertices", false, "dump truth vertices to the tree"}
Gaudi::Property< bool >	m_fillMET {this, "fillMET", false, "add met information to the tree"}
Gaudi::Property< bool >	m_fillJets {this, "fillJets", false, "add jet information to the tree"}
Gaudi::Property< bool >	m_computeActiveVertices {this, "computeActiveVertices", false, "extracts active vertices in the vicinity of a jet by looping through truth particles. Requires isMC."}
Gaudi::Property< bool >	m_computeVertexIso {this, "computeVertexIso", false, "add vertex isolation variables to the tree"}
Gaudi::Property< int >	m_pdgId_portal {this, "pdgId_portal", 25, "Truth portal PDGId"}
Gaudi::Property< int >	m_pdgId_llp {this, "pdgId_llp", 35, "Truth LLP PDGId"}
Gaudi::Property< bool >	m_llp_genStableChildren {this, "llp_genStableChildren", false, "Restricts the TruthParticle-LLP linking to generator stable children rather than detector stable children"}
Gaudi::Property< float >	m_trackIso_pT {this, "trackIso_pT", 5.0*Gaudi::Units::GeV, "minimum track pT [GeV] to be considered for isolation"}
Gaudi::Property< float >	m_softTrackIso_R {this, "softTrackIso_R", 0.2, "cone radius around vertex to sum up track pT"}
Gaudi::Property< float >	m_jetIso_pT {this, "jetIso_pT", 20.0*Gaudi::Units::GeV, "minimum jet pT [GeV] to be considered for isolation"}
Gaudi::Property< float >	m_jetIso_LogRatio {this, "jetIso_LogRatio", 0.5, "max log ECal/HCal ratio for jet to be considered for isolation"}
MuonVal::MuonTesterTree	m_tree {"MSVtxValidTree", "MSVtxValidation"}
std::unordered_set< int >	m_hadronicProcessEnum = {111, 116, 121, 131, 132, 141, 151, 152, 161, 165, 166, 167, 210, 310}
std::unordered_set< int >	m_emProcessEnum = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,30,31,40,49}
MuonVal::ThreeVectorBranch	m_truthVtx_pos {m_tree, "truthVtx_"}
MuonVal::VectorBranch< int > &	m_truthVtx_status {m_tree.newVector<int>("truthVtx_status")}
MuonVal::VectorBranch< int > &	m_truthVtx_interactionType {m_tree.newVector<int>("truthVtx_ interactionType")}
MuonVal::VectorBranch< int > &	m_truthVtx_NchildrenDirect {m_tree.newVector<int>("truthVtx_NchildrenDirect")}
MuonVal::VectorBranch< int > &	m_truthVtx_Nchildren {m_tree.newVector<int>("truthVtx_Nchildren")}
MuonVal::VectorBranch< int > &	m_truthVtx_NchildrenCharged {m_tree.newVector<int>("truthVtx_NchildrenCharged")}
MuonVal::MatrixBranch< int > &	m_truthVtx_truthParticle_link {m_tree.newMatrix<int>("truthVtx_truthParticle_link")}
ParticleBranchPtr_t	m_truthParticle {nullptr}
MuonVal::VectorBranch< int > &	m_truthParticle_llpVtx_link {m_tree.newVector<int>("truthParticle_llpVtx_link")}
std::unique_ptr< std::vector< int > >	m_truthParticle_llpVtx_link_tmp = std::make_unique<std::vector<int>>()
MuonVal::VectorBranch< int > &	m_truthParticle_actVtx_link {m_tree.newVector<int>("truthParticle_actVtx_link")}
std::unique_ptr< std::vector< int > >	m_truthParticle_actVtx_link_tmp = std::make_unique<std::vector<int>>()
MuonVal::VectorBranch< int > &	m_truthParticle_truthVtx_link {m_tree.newVector<int>("truthParticle_truthVtx_link")}
std::unique_ptr< std::vector< int > >	m_truthParticle_truthVtx_link_tmp = std::make_unique<std::vector<int>>()
ParticleBranchPtr_t	m_portal {nullptr}
MuonVal::ScalarBranch< int > &	m_portal_N {m_tree.newScalar<int>("portal_N",defaults::Int)}
ParticleBranchPtr_t	m_llp {nullptr}
MuonVal::ScalarBranch< int > &	m_llp_N {m_tree.newScalar<int>("llp_N",defaults::Int)}
MuonVal::VectorBranch< int > &	m_llp_Nchildren {m_tree.newVector<int>("llp_Nchildren")}
MuonVal::VectorBranch< int > &	m_llp_NchildrenCharged {m_tree.newVector<int>("llp_NchildrenCharged")}
MuonVal::ThreeVectorBranch	m_llpVtx_pos {m_tree, "llpVtx_"}
MuonVal::ScalarBranch< int > &	m_llpVtx_N {m_tree.newScalar<int>("llpVtx_N",defaults::Int)}
MuonVal::VectorBranch< float > &	m_llpVtx_Lxy {m_tree.newVector<float>("llpVtx_Lxy")}
MuonVal::VectorBranch< float > &	m_llpVtx_ctau {m_tree.newVector<float>("llpVtx_ctau")}
MuonVal::MatrixBranch< int > &	m_llpVtx_truthParticle_link {m_tree.newMatrix<int>("llpVtx_truthParticle_link")}
MuonVal::ThreeVectorBranch	m_msVtx_pos {m_tree, "msVtx_"}
MuonVal::ScalarBranch< int > &	m_msVtx_N {m_tree.newScalar<int>("msVtx_N",defaults::Int)}
MuonVal::VectorBranch< float > &	m_msVtx_chi2 {m_tree.newVector<float>("msVtx_chi2")}
MuonVal::VectorBranch< int > &	m_msVtx_nDoF {m_tree.newVector<int>("msVtx_nDoF")}
MuonVal::VectorBranch< int > &	m_msVtx_Ntrklet {m_tree.newVector<int>("msVtx_Ntrklet")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT {m_tree.newVector<int>("msVtx_nMDT")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT_inwards {m_tree.newVector<int>("msVtx_nMDT_inwards")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT_I {m_tree.newVector<int>("msVtx_nMDT_I")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT_E {m_tree.newVector<int>("msVtx_nMDT_E")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT_M {m_tree.newVector<int>("msVtx_nMDT_M")}
MuonVal::VectorBranch< int > &	m_msVtx_nMDT_O {m_tree.newVector<int>("msVtx_nMDT_O")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC {m_tree.newVector<int>("msVtx_nRPC")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC_inwards {m_tree.newVector<int>("msVtx_nRPC_inwards")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC_I {m_tree.newVector<int>("msVtx_nRPC_I")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC_E {m_tree.newVector<int>("msVtx_nRPC_E")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC_M {m_tree.newVector<int>("msVtx_nRPC_M")}
MuonVal::VectorBranch< int > &	m_msVtx_nRPC_O {m_tree.newVector<int>("msVtx_nRPC_O")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC {m_tree.newVector<int>("msVtx_nTGC")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC_inwards {m_tree.newVector<int>("msVtx_nTGC_inwards")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC_I {m_tree.newVector<int>("msVtx_nTGC_I")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC_E {m_tree.newVector<int>("msVtx_nTGC_E")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC_M {m_tree.newVector<int>("msVtx_nTGC_M")}
MuonVal::VectorBranch< int > &	m_msVtx_nTGC_O {m_tree.newVector<int>("msVtx_nTGC_O")}
MuonVal::VectorBranch< float > &	m_msVtx_isoTracks_mindR {m_tree.newVector<float>("msVtx_isoTracks_mindR")}
MuonVal::VectorBranch< float > &	m_msVtx_isoTracks_pTsum {m_tree.newVector<float>("msVtx_isoTracks_pTsum")}
MuonVal::VectorBranch< float > &	m_msVtx_isoJets_mindR {m_tree.newVector<float>("msVtx_isoJets_mindR")}
MuonVal::ThreeVectorBranch	m_trklet_pos {m_tree, "trklet_"}
MuonVal::ThreeVectorBranch	m_trklet_mom {m_tree, "trklet_p"}
MuonVal::ScalarBranch< int > &	m_trklet_N {m_tree.newScalar<int>("trklet_N",defaults::Int)}
MuonVal::VectorBranch< float > &	m_trklet_d0 {m_tree.newVector<float>("trklet_d0")}
MuonVal::VectorBranch< float > &	m_trklet_z0 {m_tree.newVector<float>("trklet_z0")}
MuonVal::VectorBranch< float > &	m_trklet_theta {m_tree.newVector<float>("trklet_theta")}
MuonVal::VectorBranch< float > &	m_trklet_eta {m_tree.newVector<float>("trklet_eta")}
MuonVal::VectorBranch< float > &	m_trklet_phi {m_tree.newVector<float>("trklet_phi")}
MuonVal::VectorBranch< float > &	m_trklet_qOverP {m_tree.newVector<float>("trklet_qOverP")}
MuonVal::VectorBranch< float > &	m_trklet_q {m_tree.newVector<float>("trklet_q")}
MuonVal::VectorBranch< int > &	m_trklet_vtxLink {m_tree.newVector<int>("trklet_vtxLink")}
std::shared_ptr< MuonPRDTest::SegmentVariables >	m_muonSeg {nullptr}
ParticleBranchPtr_t	m_muon {nullptr}
ParticleBranchPtr_t	m_jet {nullptr}
MuonVal::ScalarBranch< int > &	m_jet_N {m_tree.newScalar<int>("jet_N",defaults::Int)}
MuonVal::VectorBranch< int > &	m_jet_triggers {m_tree.newVector<int>("jet_triggers")}
MuonVal::VectorBranch< int > &	m_jet_NactVtx {m_tree.newVector<int>("jet_NactVtx")}
MuonVal::MatrixBranch< int > &	m_jet_actVtx_link {m_tree.newMatrix<int>("jet_actVtx_link")}
MuonVal::ThreeVectorBranch	m_actVtx_pos {m_tree, "actVtx_"}
MuonVal::VectorBranch< int > &	m_actVtx_NChildren {m_tree.newVector<int>("actVtx_NChildren")}
MuonVal::VectorBranch< int > &	m_actVtx_chainDepth {m_tree.newVector<int>("actVtx_chainDepth")}
MuonVal::VectorBranch< float > &	m_actVtx_energy {m_tree.newVector<float>("actVtx_energy")}
MuonVal::VectorBranch< float > &	m_actVtx_mass {m_tree.newVector<float>("actVtx_mass")}
MuonVal::VectorBranch< float > &	m_actVtx_pT {m_tree.newVector<float>("actVtx_pT")}
MuonVal::VectorBranch< float > &	m_actVtx_scalarPtSum {m_tree.newVector<float>("actVtx_scalarPtSum")}
MuonVal::VectorBranch< int > &	m_actVtx_jet_link {m_tree.newVector<int>("actVtx_jet_link")}
MuonVal::VectorBranch< float > &	m_actVtx_jet_dEta {m_tree.newVector<float>("actVtx_jet_dEta")}
MuonVal::VectorBranch< float > &	m_actVtx_jet_dPhi {m_tree.newVector<float>("actVtx_jet_dPhi")}
MuonVal::MatrixBranch< int > &	m_actVtx_truthParticle_link {m_tree.newMatrix<int>("actVtx_truthParticle_link")}
MuonVal::ScalarBranch< float > &	m_met {m_tree.newScalar<float>("met",defaults::Float)}
MuonVal::ScalarBranch< float > &	m_met_x {m_tree.newScalar<float>("met_X",defaults::Float)}
MuonVal::ScalarBranch< float > &	m_met_y {m_tree.newScalar<float>("met_Y",defaults::Float)}
MuonVal::ScalarBranch< float > &	m_met_phi {m_tree.newScalar<float>("met_phi",defaults::Float)}
MuonVal::ScalarBranch< float > &	m_sumEt {m_tree.newScalar<float>("sumEt",defaults::Float)}
TH1F *	m_h_LLP1LLP2dR {nullptr}
TH1F *	m_h_diLLPMass {nullptr}
TH1F *	m_h_leadLLPLxy {nullptr}
TH1F *	m_h_leadLLPLz {nullptr}
TH1F *	m_h_leadLLPctau {nullptr}
TH1F *	m_h_leadLLPpt {nullptr}
TH1F *	m_h_subleadLLPLxy {nullptr}
TH1F *	m_h_subleadLLPLz {nullptr}
TH1F *	m_h_subleadLLPctau {nullptr}
TH1F *	m_h_subleadLLPpt {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 50 of file MSVtxValidationAlg.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.

ParticleBranchPtr_t

using MSVtxValidationAlg::ParticleBranchPtr_t = std::shared_ptr<MuonVal::IParticleFourMomBranch>

private

Definition at line 138 of file MSVtxValidationAlg.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.

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

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 MSVtxValidationAlg::execute ( )

finaloverridevirtual

Definition at line 520 of file MSVtxValidationAlg.cxx.

                                       {  
    ATH_MSG_DEBUG ("Executing " << name() << "...");
 
    const EventContext& ctx = Gaudi::Hive::currentContext();
 
    // event variables
    const xAOD::EventInfo* eventInfo{nullptr};
    ATH_CHECK(SG::get(eventInfo, m_evtKey, ctx));
 
    ATH_MSG_DEBUG("Start to run over event "<<eventInfo->eventNumber()<<" in run" <<eventInfo->runNumber());
 
    if(m_isMC) ATH_CHECK(fillTruth(ctx));
    if(m_fillJets) ATH_CHECK(fillJet(ctx));
    if(m_fillMET) ATH_CHECK(fillMet(ctx));
    ATH_CHECK(fillMuons(ctx));
    ATH_CHECK(fillTracklets(ctx));
    ATH_CHECK(fillMSVtx(ctx));
 
    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();
}

fillActiveVertices()

StatusCode MSVtxValidationAlg::fillActiveVertices ( const EventContext & ctx, const xAOD::Jet * jet )

private

Definition at line 346 of file MSVtxValidationAlg.cxx.

                                                                                             {
    const xAOD::TruthParticleContainer* truth_particles{nullptr};
    ATH_CHECK(SG::get(truth_particles, m_TruthParticleKey, ctx));
 
    std::vector<ActiveVertex> actVertices = getActiveVertices(jet, *truth_particles);
 
    if (!actVertices.size()){
        m_jet_actVtx_link.push_back({}); // empty links for this jet as no active vertex was identified 
        return StatusCode::SUCCESS;  
    } 
 
    for (ActiveVertex actVtx : actVertices) {
        if (!actVtx.vtx) continue;
        // index of active vertex found in the event. Not just a simple counter since each jet can have several active vertices
        size_t actVtxIdx = m_actVtx_NChildren.size();
        // fill the active vertex branches
        m_actVtx_pos.push_back(actVtx.vtx->v4().Vect());
        m_actVtx_NChildren.push_back(actVtx.nChildren);
        m_actVtx_chainDepth.push_back(actVtx.decayDepth);
        m_actVtx_energy.push_back(actVtx.vtxEnergy/Gaudi::Units::GeV);
        m_actVtx_mass.push_back(actVtx.vtxMass/Gaudi::Units::GeV);
        m_actVtx_pT.push_back(actVtx.vtxPt/Gaudi::Units::GeV);
        m_actVtx_scalarPtSum.push_back(actVtx.vtxScalarPtSum/Gaudi::Units::GeV);
 
        m_actVtx_jet_link.push_back(jet->index()); // link the active vertex to the jet
        m_actVtx_jet_dEta.push_back(jet->eta() - actVtx.vtx->v4().Eta());
        m_actVtx_jet_dPhi.push_back(jet->p4().DeltaPhi(actVtx.vtx->v4()));
 
        m_jet_actVtx_link.push_back(jet->index(), actVtxIdx); // link the jet to the active vertex
 
        // note that a truth particle can be linked to multiple active vertices, so the link index is not unique
        if (!m_dumpTruthParticles) continue;
        for (auto tpLink : actVtx.vtx->outgoingParticleLinks()) {
            if (!tpLink) continue;
            m_actVtx_truthParticle_link.push_back(actVtxIdx, tpLink.index());
            m_truthParticle_actVtx_link_tmp->at(tpLink.index()) = actVtxIdx;
        }
    }
    m_jet_NactVtx.push_back(actVertices.size()); // number of active vertices associated to this jet
 
    return StatusCode::SUCCESS;
}

fillHits()

void MSVtxValidationAlg::fillHits ( const xAOD::Vertex * vtx, const std::string & decorator_str, MuonVal::VectorBranch< int > & branch )

private

Definition at line 500 of file MSVtxValidationAlg.cxx.

                                                                                                                         {
    // fills branch with the number of hits close to the vertex. When the decorator is not available, the default integer value is used
    const SG::AuxElement::Accessor<int> hits_acc(decorator_str);
    if (hits_acc.isAvailable(*vtx)) branch.push_back(hits_acc(*vtx));
 
    return;
}

fillJet()

StatusCode MSVtxValidationAlg::fillJet ( const EventContext & ctx )

private

Definition at line 291 of file MSVtxValidationAlg.cxx.

                                                              {
    const xAOD::JetContainer* jets{nullptr};
    ATH_CHECK(SG::get(jets, m_JetKey, ctx));
 
    TriggerInfo triggerInfo;
    if (m_readTriggers) triggerInfo = getTriggerDecisions(m_triggerStringJets);
 
    m_jet_N = jets->size();
    for (const xAOD::Jet* jet : *jets) {
        m_jet->push_back(jet);
        if (m_readTriggers) m_jet_triggers.push_back(getTriggerMatchingDecision(jet, triggerInfo, m_jetTriggerMatchingDR));
        if (m_computeActiveVertices && m_isMC) ATH_CHECK(fillActiveVertices(ctx, jet));
    }
 
    // copy linking data from temp vector and clear the temp vector for the next event
    if (m_dumpTruthParticles) {
        for (int link : *m_truthParticle_actVtx_link_tmp) m_truthParticle_actVtx_link.push_back(link);
        m_truthParticle_actVtx_link_tmp->clear();
    }
 
    return StatusCode::SUCCESS;
}

fillLLP()

StatusCode MSVtxValidationAlg::fillLLP ( std::vector< const xAOD::TruthParticle * > & llps )

private

Definition at line 170 of file MSVtxValidationAlg.cxx.

                                                                                {
 
    // LLP and LLP children
    m_llp_N = llps.size();
    std::sort(llps.begin(), llps.end(), comparePt); // sort llps by pT
    const xAOD::TruthParticle* leadLLP = nullptr;
    const xAOD::TruthParticle* subleadLLP = nullptr;
    
    int num_vtx = 0;
    for(unsigned int llp_idx=0; const xAOD::TruthParticle* llp : llps){
        m_llp->push_back(llp);
 
        if(llp->hasDecayVtx()){
            const xAOD::TruthVertex* decVtx = llp->decayVtx();
            m_llpVtx_pos.push_back(decVtx->v4().Vect());
            m_llpVtx_Lxy.push_back(decVtx->perp());
            m_llpVtx_ctau.push_back(getCTau(decVtx));
            ++num_vtx;
        }
 
        // leading LLP
        if(llp_idx==0){
            if(llp->hasDecayVtx()){
                const xAOD::TruthVertex* decVtx = llp->decayVtx();
                m_h_leadLLPLxy->Fill(decVtx->perp());
                m_h_leadLLPLz->Fill(decVtx->z());
                m_h_leadLLPctau->Fill(getCTau(decVtx));
            }
            m_h_leadLLPpt->Fill(llp->pt()/Gaudi::Units::GeV);
            leadLLP = llp;
        }
        // subleading llp
        if(llp_idx==1){
            if(llp->hasDecayVtx()){
                const xAOD::TruthVertex* decVtx = llp->decayVtx();
                m_h_subleadLLPLxy->Fill(decVtx->perp());
                m_h_subleadLLPLz->Fill(decVtx->z());
                m_h_subleadLLPctau->Fill(getCTau(decVtx));
            }
            m_h_subleadLLPpt->Fill(llp->pt()/Gaudi::Units::GeV);
            subleadLLP = llp;
 
            // di-llp histograms
            TLorentzVector llpSum = subleadLLP->p4()+leadLLP->p4();
            m_h_LLP1LLP2dR->Fill(leadLLP->p4().DeltaR(subleadLLP->p4()));
            m_h_diLLPMass->Fill(llpSum.E()/Gaudi::Units::GeV);
        }
 
        // LLP children
        if (llp->hasDecayVtx() && llp->nChildren()>0 && !llp->isGenStable()) {
            std::vector<const xAOD::TruthParticle*> stableChildren = getStableChildren(llp, m_llp_genStableChildren);
            m_llp_Nchildren.push_back((int)stableChildren.size());
            int nChargedChildren = 0;
            for (const xAOD::TruthParticle *child : stableChildren){
                if (child->charge() != 0) ++nChargedChildren;
                if (!m_dumpTruthParticles) continue;
                m_llpVtx_truthParticle_link.push_back(llp_idx, child->index());
                m_truthParticle_llpVtx_link_tmp->at(child->index()) = llp_idx;
            }
            m_llp_NchildrenCharged.push_back(nChargedChildren);
        }
        ++llp_idx;
    }
    m_llpVtx_N = num_vtx;
 
    // copy linking data from temp vector and clear the temp vector for the next event
    if (m_dumpTruthParticles) {
        for (int link : *m_truthParticle_llpVtx_link_tmp) m_truthParticle_llpVtx_link.push_back(link);
        m_truthParticle_llpVtx_link_tmp->clear();
    }
 
 
    return StatusCode::SUCCESS;
}

fillMet()

StatusCode MSVtxValidationAlg::fillMet ( const EventContext & ctx )

private

Definition at line 390 of file MSVtxValidationAlg.cxx.

                                                              {
    const xAOD::MissingETContainer* MET{nullptr};
    ATH_CHECK(SG::get(MET, m_MetKey, ctx));
 
    m_met = (*MET)["Final"]->met()/Gaudi::Units::GeV;
    m_met_x = (*MET)["Final"]->mpx()/Gaudi::Units::GeV;
    m_met_y = (*MET)["Final"]->mpy()/Gaudi::Units::GeV;
    m_met_phi = (*MET)["Final"]->phi();
    m_sumEt = (*MET)["Final"]->sumet()/Gaudi::Units::GeV;
 
    return StatusCode::SUCCESS;
}

fillMSVtx()

StatusCode MSVtxValidationAlg::fillMSVtx ( const EventContext & ctx )

private

Definition at line 443 of file MSVtxValidationAlg.cxx.

                                                                {
    const xAOD::VertexContainer* msVertices{nullptr};
    ATH_CHECK(SG::get(msVertices, m_MSVtxKey, ctx));
 
    const xAOD::TrackParticleContainer* tracks{nullptr};
    const xAOD::JetContainer* jets{nullptr};
    if (m_computeVertexIso) {
        ATH_CHECK(SG::get(tracks, m_TrackParticleKey, ctx));
        ATH_CHECK(SG::get(jets, m_JetKey, ctx));
    }
 
    m_msVtx_N = msVertices->size();
    for(const xAOD::Vertex* msVtx : *msVertices){
        m_msVtx_pos.push_back(msVtx->position());
        m_msVtx_chi2.push_back(msVtx->chiSquared());
        m_msVtx_nDoF.push_back(msVtx->numberDoF());
 
        // hits close to vertex: total, inwards of the vertex, inner layer, extended layer, middle layer, outer layer
        fillHits(msVtx, "nMDT", m_msVtx_nMDT);
        fillHits(msVtx, "nMDT_inwards", m_msVtx_nMDT_inwards);
        fillHits(msVtx, "nMDT_I", m_msVtx_nMDT_I);
        fillHits(msVtx, "nMDT_E", m_msVtx_nMDT_E);
        fillHits(msVtx, "nMDT_M", m_msVtx_nMDT_M);
        fillHits(msVtx, "nMDT_O", m_msVtx_nMDT_O);
 
        fillHits(msVtx, "nRPC", m_msVtx_nRPC);
        fillHits(msVtx, "nRPC_inwards", m_msVtx_nRPC_inwards);
        fillHits(msVtx, "nRPC_I", m_msVtx_nRPC_I);
        fillHits(msVtx, "nRPC_E", m_msVtx_nRPC_E);
        fillHits(msVtx, "nRPC_M", m_msVtx_nRPC_M);
        fillHits(msVtx, "nRPC_O", m_msVtx_nRPC_O);
 
        fillHits(msVtx, "nTGC", m_msVtx_nTGC);
        fillHits(msVtx, "nTGC_inwards", m_msVtx_nTGC_inwards);
        fillHits(msVtx, "nTGC_I", m_msVtx_nTGC_I);
        fillHits(msVtx, "nTGC_E", m_msVtx_nTGC_E);
        fillHits(msVtx, "nTGC_M", m_msVtx_nTGC_M);
        fillHits(msVtx, "nTGC_O", m_msVtx_nTGC_O);
 
        // set a linking index for each tracklet used in the reconstruction of the vertex 
        size_t nTrk = msVtx->nTrackParticles();
        m_msVtx_Ntrklet.push_back(nTrk);
 
        for(size_t j=0; j<nTrk; ++j){ 
            const xAOD::TrackParticle *consti = msVtx->trackParticle(j);
            if (!consti) continue;
            m_trklet_vtxLink[consti->index()] = msVtx->index();
        }
 
        // optionally compute the vertex isolation from tracks and jets
        if (m_computeVertexIso) ATH_CHECK(fillMSVtxIsolation(msVtx, tracks, jets));
    }
 
    return StatusCode::SUCCESS;
}

fillMSVtxIsolation()

StatusCode MSVtxValidationAlg::fillMSVtxIsolation ( const xAOD::Vertex * msVtx, const xAOD::TrackParticleContainer * tracks, const xAOD::JetContainer * jets )

private

Definition at line 509 of file MSVtxValidationAlg.cxx.

                                                                                                                                                 {
 
    VtxIso iso = getIso(msVtx, *tracks, *jets, m_trackIso_pT, m_softTrackIso_R, m_jetIso_pT, m_jetIso_LogRatio);
    m_msVtx_isoTracks_mindR.push_back(iso.track_mindR);
    m_msVtx_isoTracks_pTsum.push_back(iso.track_pTsum);
    m_msVtx_isoJets_mindR.push_back(iso.jet_mindR);
 
    return StatusCode::SUCCESS;
}

fillMuons()

StatusCode MSVtxValidationAlg::fillMuons ( const EventContext & ctx )

private

Definition at line 404 of file MSVtxValidationAlg.cxx.

                                                                {
    const xAOD::MuonContainer* muons{nullptr};
    ATH_CHECK(SG::get(muons, m_MuonKey, ctx));
 
    for (const xAOD::Muon* muon : *muons) m_muon->push_back(muon); 
 
    return StatusCode::SUCCESS;
}

fillTracklets()

StatusCode MSVtxValidationAlg::fillTracklets ( const EventContext & ctx )

private

Definition at line 414 of file MSVtxValidationAlg.cxx.

                                                                    {
    
    const xAOD::TrackParticleContainer* msOnlyTracklets{nullptr};
    ATH_CHECK(SG::get(msOnlyTracklets, m_TrackletKey, ctx));
 
    m_trklet_N = msOnlyTracklets->size();
    for(const xAOD::TrackParticle* mstrklet : *msOnlyTracklets){
        // perigee parameters
        m_trklet_d0.push_back(mstrklet->d0());
        m_trklet_z0.push_back(mstrklet->z0());
        m_trklet_phi.push_back(mstrklet->phi());
        m_trklet_theta.push_back(mstrklet->theta());
        m_trklet_eta.push_back(mstrklet->eta());
        m_trklet_qOverP.push_back(mstrklet->qOverP());
        m_trklet_q.push_back(mstrklet->charge());
        // cartesian parameters
        const Trk::Perigee &tkl_perigee = mstrklet->perigeeParameters();
        const Amg::Vector3D &trklet_pos = tkl_perigee.position();
        const Amg::Vector3D &trklet_mom = tkl_perigee.momentum()/Gaudi::Units::GeV;
        m_trklet_pos.push_back(trklet_pos);
        m_trklet_mom.push_back(trklet_mom);
        // set default link index to vertex to -1 and adjust when in fillMSVtx
        m_trklet_vtxLink.push_back(-1);
    }
 
    return StatusCode::SUCCESS;
}

fillTruth()

StatusCode MSVtxValidationAlg::fillTruth ( const EventContext & ctx )

private

Definition at line 123 of file MSVtxValidationAlg.cxx.

                                                                {
    ATH_CHECK(fillTruthParticle(ctx)); // need to be run before fillTruthVertex to set up the truth particle - truth vertex linking
    if(m_dumpTruthVertices) ATH_CHECK(fillTruthVertex(ctx));
 
    return StatusCode::SUCCESS;
}

fillTruthParticle()

StatusCode MSVtxValidationAlg::fillTruthParticle ( const EventContext & ctx )

private

Definition at line 131 of file MSVtxValidationAlg.cxx.

                                                                        {
    // Fill truth particle branches and histograms
    const xAOD::TruthParticleContainer* truth_particles{nullptr};
    ATH_CHECK(SG::get(truth_particles, m_TruthParticleKey, ctx));
 
    // dump the TruthParticle information and collect portal, LLPs
    std::vector<const xAOD::TruthParticle*> portals{}, llps{};
    for(const xAOD::TruthParticle* tp : *truth_particles){
        if (!tp) continue;
        if (m_dumpTruthParticles) {
            m_truthParticle->push_back(tp);
            // set default link index to -1
            m_truthParticle_llpVtx_link_tmp->push_back(-1); // adjusted in fillLLP
            m_truthParticle_actVtx_link_tmp->push_back(-1); // adjusted in fillJet
            m_truthParticle_truthVtx_link_tmp->push_back(-1); // adjusted in fillTruthVertex
        }
 
        // fill vector of portal particles, skipping the particle if it is a self-decay
        if(std::abs(tp->pdgId()) == m_pdgId_portal){
          bool selfdecay = false;
          for (size_t p = 0; p < tp->production_vertex()->nIncomingParticles(); ++p) if (tp->parent(p)->pdgId() == tp->pdgId()) { selfdecay = true; break;}
          if (!selfdecay) portals.push_back(tp);
        }
 
        // fill vector of LLPs
        if(std::abs(tp->pdgId()) == m_pdgId_llp) llps.push_back(tp);
    }
 
    // portal
    m_portal_N = portals.size();
    for(const xAOD::TruthParticle* portal : portals) m_portal->push_back(portal);
 
    // LLP and LLP Children
    ATH_CHECK(fillLLP(llps)); 
 
    return StatusCode::SUCCESS;
}

fillTruthVertex()

StatusCode MSVtxValidationAlg::fillTruthVertex ( const EventContext & ctx )

private

Definition at line 246 of file MSVtxValidationAlg.cxx.

                                                                      {
    const xAOD::TruthVertexContainer* truth_vertices{nullptr};
    ATH_CHECK(SG::get(truth_vertices, m_TruthVertexKey, ctx));
 
    int truthVtxIdx = 0;
    for (const xAOD::TruthVertex* vtx : *truth_vertices){
        if (!vtx) continue;
        m_truthVtx_pos.push_back(vtx->v4().Vect());
        m_truthVtx_status.push_back(vtx->status());
 
        // set the interaction type based on the status code
        int interactionType = -1;
        if (m_hadronicProcessEnum.count(vtx->status() - 1000)) interactionType = 0;
        else if (m_emProcessEnum.count(vtx->status() - 1000)) interactionType = 1;
        m_truthVtx_interactionType.push_back(interactionType);
 
        // children
        m_truthVtx_NchildrenDirect.push_back(vtx->nOutgoingParticles());
        int nChildren = 0;
        int nChildrenCharged = 0;
        for(const xAOD::TruthParticle* child : vtx->particles_out()){
            std::vector<const xAOD::TruthParticle*> stableChildren = getStableChildren(child, false);
            nChildren += stableChildren.size();
            for (const xAOD::TruthParticle *stableChild : stableChildren){
                if (stableChild->charge() != 0) ++nChildrenCharged;
                if (!m_dumpTruthParticles) continue;
                m_truthVtx_truthParticle_link.push_back(truthVtxIdx, stableChild->index());
                m_truthParticle_truthVtx_link_tmp->at(stableChild->index()) = truthVtxIdx;
            }
        }
        m_truthVtx_Nchildren.push_back(nChildren);
        m_truthVtx_NchildrenCharged.push_back(nChildrenCharged);
        truthVtxIdx++;
    }
 
    // copy linking data from temp vector and clear the temp vector for the next event
    if (m_dumpTruthParticles) {
        for (int link : *m_truthParticle_truthVtx_link_tmp) m_truthParticle_truthVtx_link.push_back(link);
        m_truthParticle_truthVtx_link_tmp->clear();
    }
 
    return StatusCode::SUCCESS;
}

finalize()

StatusCode MSVtxValidationAlg::finalize ( )

finaloverridevirtual

Definition at line 544 of file MSVtxValidationAlg.cxx.

                                        {
    ATH_MSG_DEBUG ("Finalizing " << name() << "...");
    ATH_CHECK(m_tree.write());
 
    return StatusCode::SUCCESS;
}

getTriggerDecisions()

MSVtxValidationAlg::TriggerInfo MSVtxValidationAlg::getTriggerDecisions ( std::string triggerString )

private

Definition at line 315 of file MSVtxValidationAlg.cxx.

                                                                                             {
    // for the configured trigger chain, store the trigger decision for this event
    const Trig::ChainGroup* chain = m_trigDec->getChainGroup(triggerString);
    std::vector<std::string> triggerNames = chain->getListOfTriggers();
    
    std::vector<bool> triggerPassed;
    for (const std::string& triggerName : triggerNames) {
        if (m_trigDec->isPassed(triggerName)) triggerPassed.push_back(true);
        else triggerPassed.push_back(false);
    }
 
    return {triggerString, triggerNames, triggerPassed};
}

getTriggerMatchingDecision()

template<typename T>

bool MSVtxValidationAlg::getTriggerMatchingDecision ( const T * object, TriggerInfo & triggerInfo, float dRmatching )

private

Definition at line 331 of file MSVtxValidationAlg.cxx.

                                                                                                               {
 
    bool firedTrigger = false;
    for (size_t i = 0; i < triggerInfo.passed.size(); ++i) {
        if (!triggerInfo.passed[i]) continue; // skip if trigger not passed
        if (m_matchingTool->match(*object, triggerInfo.names[i], dRmatching, false)) {
            firedTrigger = true;
            break; // this object has fired one for the triggers in the chain so do not need to check the other triggers
        }
    }
 
    return firedTrigger;
}

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 MSVtxValidationAlg::initialize ( )

finaloverridevirtual

Definition at line 14 of file MSVtxValidationAlg.cxx.

                                          {
    ATH_MSG_DEBUG ("Initializing " << name() << "...");
 
    ATH_CHECK(m_evtKey.initialize());
    ATH_CHECK(m_TruthParticleKey.initialize(m_isMC));
    ATH_CHECK(m_TruthVertexKey.initialize(m_isMC && m_dumpTruthVertices));
    ATH_CHECK(m_TrackParticleKey.initialize(m_computeVertexIso));
    ATH_CHECK(m_JetKey.initialize(m_fillJets || m_computeVertexIso || m_computeActiveVertices));
    ATH_CHECK(m_MetKey.initialize(m_fillMET));
    ATH_CHECK(m_MuonKey.initialize());
    ATH_CHECK(m_MuonSegKey.initialize());
    ATH_CHECK(m_TrackletKey.initialize());
    ATH_CHECK(m_MSVtxKey.initialize());
    if (m_readTriggers) {
        m_trigDec.setTypeAndName("Trig::TrigDecisionTool/TrigDecisionTool");
        m_matchingTool.setTypeAndName("Trig::R3MatchingTool/R3MatchingTool");
        ATH_CHECK(m_trigDec.retrieve());
        ATH_CHECK(m_matchingTool.retrieve());
    }
 
    // attach branches to the tree
    m_tree.addBranch(std::make_unique<MuonVal::EventInfoBranch>(m_tree, 0));
 
    // truth TrackParticles
    m_truthParticle = std::make_shared<MuonVal::IParticleFourMomBranch>(m_tree, "truthParticle");
    m_truthParticle->addVariableGeV<float>(defaults::Float, "m");
    m_truthParticle->addVariable<int>(defaults::Int, "pdgId");
    m_truthParticle->addVariable<int>(defaults::Int, "status");
    m_truthParticle->addVariable<float>(defaults::Float, "pX");
    m_truthParticle->addVariable<float>(defaults::Float, "pY");
    m_truthParticle->addVariable<float>(defaults::Float, "pZ");
    m_tree.addBranch(m_truthParticle);
    
    // portal
    m_portal = std::make_shared<MuonVal::IParticleFourMomBranch>(m_tree, "portal");
    m_portal->addVariableGeV<float>(defaults::Float, "m");
    m_tree.addBranch(m_portal);
 
    // LLP
    m_llp = std::make_shared<MuonVal::IParticleFourMomBranch>(m_tree, "llp");
    m_llp->addVariableGeV<float>(defaults::Float, "m");
    m_tree.addBranch(m_llp);
 
    // muon segments: dumps the entire muon segment container without needing an explicit fill call
    m_muonSeg = std::make_shared<MuonPRDTest::SegmentVariables>(m_tree, m_MuonSegKey.key(), "muonSeg", msgLevel());
    m_tree.addBranch(m_muonSeg);
 
    // muons
    m_muon = std::make_shared<MuonVal::IParticleFourMomBranch>(m_tree, "muon");
    m_tree.addBranch(m_muon);
 
    // jets
    m_jet = std::make_shared<MuonVal::IParticleFourMomBranch>(m_tree, "jet");
    m_jet->addVariableGeV<float>(defaults::Float, "m");
    m_tree.addBranch(m_jet);
    
    ATH_CHECK(m_tree.init(this));
 
    // --- //
    // Book output histograms following the THistSvc recommendation on managing ownership. Register via histSvc()->regHist("/<stream>/histName", rawHistPtr); //
    // --- //
 
    // llp pair
    auto h_LLP1LLP2dR = std::make_unique<TH1F>("h_LLP1LLP2dR","h_LLP1LLP2dR; #Delta R(LLP1, LLP2); Count / bin",50,0,4); 
    m_h_LLP1LLP2dR = h_LLP1LLP2dR.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_LLP1LLP2dR", std::move(h_LLP1LLP2dR))); 
 
    auto h_diLLPMass = std::make_unique<TH1F>("h_diLLPMass","h_diLLPMass; m_{LL1, LLP2} [GeV]; Count / bin",50,0,1000);
    m_h_diLLPMass = h_diLLPMass.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_diLLPMass", std::move(h_diLLPMass)));
 
    // leading LLP
    auto h_leadLLPLxy = std::make_unique<TH1F>("h_leadLLPLxy","h_leadLLPLxy; lead LLP L_{xy} [mm]; Count / bin",50,0,10000); 
    m_h_leadLLPLxy = h_leadLLPLxy.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_leadLLPLxy", std::move(h_leadLLPLxy)));
 
    auto h_leadLLPLz = std::make_unique<TH1F>("h_leadLLPLz","h_leadLLPLz; lead LLP L_{z} [mm]; Count / bin",50,0,14000); 
    m_h_leadLLPLz = h_leadLLPLz.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_leadLLPLz", std::move(h_leadLLPLz)));
 
    auto h_leadLLPctau = std::make_unique<TH1F>("h_leadLLPctau","h_leadLLPctau; lead LLP c#tau [mm]; Count / bin",50,0,2000); 
    m_h_leadLLPctau = h_leadLLPctau.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_leadLLPctau", std::move(h_leadLLPctau)));
 
    auto h_leadLLPpt = std::make_unique<TH1F>("h_leadLLPpt","h_leadLLPpt; lead LLP p_{T} [GeV]; Count / bin",50,0,400); 
    m_h_leadLLPpt = h_leadLLPpt.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_leadLLPpt", std::move(h_leadLLPpt)));
 
    // subleading LLP
    auto h_subleadLLPLxy = std::make_unique<TH1F>("h_subleadLLPLxy","h_subleadLLPLxy; sublead LLP L_{xy} [mm]; Count / bin",50,0,10000); 
    m_h_subleadLLPLxy = h_subleadLLPLxy.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_subleadLLPLxy", std::move(h_subleadLLPLxy)));
 
    auto h_subleadLLPLz = std::make_unique<TH1F>("h_subleadLLPLz","h_subleadLLPLz; sublead LLP L_{z} [mm]; Count / bin",50,0,10000); 
    m_h_subleadLLPLz = h_subleadLLPLz.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_subleadLLPLz", std::move(h_subleadLLPLz)));
 
    auto h_subleadLLPctau = std::make_unique<TH1F>("h_subleadLLPctau","h_subleadLLPctau; sublead LLP c#tau [mm]; Count / bin",50,0,2000); 
    m_h_subleadLLPctau = h_subleadLLPctau.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_subleadLLPctau", std::move(h_subleadLLPctau)));
 
    auto h_subleadLLPpt = std::make_unique<TH1F>("h_subleadLLPpt","h_subleadLLPpt; sublead LLP p_{T} [GeV]; Count / bin",50,0,400); 
    m_h_subleadLLPpt = h_subleadLLPpt.get();
    ATH_CHECK(histSvc()->regHist("/MSVtxValidation/h_subleadLLPpt", std::move(h_subleadLLPpt)));
 
    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.

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_actVtx_chainDepth

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_actVtx_chainDepth {m_tree.newVector<int>("actVtx_chainDepth")}

private

Definition at line 238 of file MSVtxValidationAlg.h.

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

m_actVtx_energy

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_energy {m_tree.newVector<float>("actVtx_energy")}

private

Definition at line 239 of file MSVtxValidationAlg.h.

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

m_actVtx_jet_dEta

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_jet_dEta {m_tree.newVector<float>("actVtx_jet_dEta")}

private

Definition at line 244 of file MSVtxValidationAlg.h.

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

m_actVtx_jet_dPhi

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_jet_dPhi {m_tree.newVector<float>("actVtx_jet_dPhi")}

private

Definition at line 245 of file MSVtxValidationAlg.h.

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

m_actVtx_jet_link

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_actVtx_jet_link {m_tree.newVector<int>("actVtx_jet_link")}

private

Definition at line 243 of file MSVtxValidationAlg.h.

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

m_actVtx_mass

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_mass {m_tree.newVector<float>("actVtx_mass")}

private

Definition at line 240 of file MSVtxValidationAlg.h.

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

m_actVtx_NChildren

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_actVtx_NChildren {m_tree.newVector<int>("actVtx_NChildren")}

private

Definition at line 237 of file MSVtxValidationAlg.h.

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

m_actVtx_pos

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_actVtx_pos {m_tree, "actVtx_"}

private

Definition at line 236 of file MSVtxValidationAlg.h.

{m_tree, "actVtx_"};

m_actVtx_pT

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_pT {m_tree.newVector<float>("actVtx_pT")}

private

Definition at line 241 of file MSVtxValidationAlg.h.

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

m_actVtx_scalarPtSum

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_actVtx_scalarPtSum {m_tree.newVector<float>("actVtx_scalarPtSum")}

private

Definition at line 242 of file MSVtxValidationAlg.h.

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

m_actVtx_truthParticle_link

MuonVal::MatrixBranch<int>& MSVtxValidationAlg::m_actVtx_truthParticle_link {m_tree.newMatrix<int>("actVtx_truthParticle_link")}

private

Definition at line 246 of file MSVtxValidationAlg.h.

{m_tree.newMatrix<int>("actVtx_truthParticle_link")};

m_computeActiveVertices

Gaudi::Property<bool> MSVtxValidationAlg::m_computeActiveVertices {this, "computeActiveVertices", false, "extracts active vertices in the vicinity of a jet by looping through truth particles. Requires isMC."}

private

Definition at line 99 of file MSVtxValidationAlg.h.

{this, "computeActiveVertices", false, "extracts active vertices in the vicinity of a jet by looping through truth particles. Requires isMC."};

m_computeVertexIso

Gaudi::Property<bool> MSVtxValidationAlg::m_computeVertexIso {this, "computeVertexIso", false, "add vertex isolation variables to the tree"}

private

Definition at line 100 of file MSVtxValidationAlg.h.

{this, "computeVertexIso", false, "add vertex isolation variables to the tree"};

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_dumpTruthParticles

Gaudi::Property<bool> MSVtxValidationAlg::m_dumpTruthParticles {this, "dumpTruthParticles", false, "dump truth particles to the tree"}

private

Definition at line 95 of file MSVtxValidationAlg.h.

{this, "dumpTruthParticles", false, "dump truth particles to the tree"};

m_dumpTruthVertices

Gaudi::Property<bool> MSVtxValidationAlg::m_dumpTruthVertices {this, "dumpTruthVertices", false, "dump truth vertices to the tree"}

private

Definition at line 96 of file MSVtxValidationAlg.h.

{this, "dumpTruthVertices", false, "dump truth vertices to the tree"};

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_emProcessEnum

std::unordered_set<int> MSVtxValidationAlg::m_emProcessEnum = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,30,31,40,49}

private

Definition at line 144 of file MSVtxValidationAlg.h.

{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,21,22,23,24,25,26,30,31,40,49};

m_evtKey

SG::ReadHandleKey<xAOD::EventInfo> MSVtxValidationAlg::m_evtKey {this, "EvtKey", "EventInfo"}

private

Definition at line 63 of file MSVtxValidationAlg.h.

{this, "EvtKey", "EventInfo"};

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_fillJets

Gaudi::Property<bool> MSVtxValidationAlg::m_fillJets {this, "fillJets", false, "add jet information to the tree"}

private

Definition at line 98 of file MSVtxValidationAlg.h.

{this, "fillJets", false, "add jet information to the tree"};

m_fillMET

Gaudi::Property<bool> MSVtxValidationAlg::m_fillMET {this, "fillMET", false, "add met information to the tree"}

private

Definition at line 97 of file MSVtxValidationAlg.h.

{this, "fillMET", false, "add met information to the tree"};

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_h_diLLPMass

TH1F* MSVtxValidationAlg::m_h_diLLPMass {nullptr}

private

Definition at line 260 of file MSVtxValidationAlg.h.

{nullptr};

m_h_leadLLPctau

TH1F* MSVtxValidationAlg::m_h_leadLLPctau {nullptr}

private

Definition at line 263 of file MSVtxValidationAlg.h.

{nullptr};

m_h_leadLLPLxy

TH1F* MSVtxValidationAlg::m_h_leadLLPLxy {nullptr}

private

Definition at line 261 of file MSVtxValidationAlg.h.

{nullptr};

m_h_leadLLPLz

TH1F* MSVtxValidationAlg::m_h_leadLLPLz {nullptr}

private

Definition at line 262 of file MSVtxValidationAlg.h.

{nullptr};

m_h_leadLLPpt

TH1F* MSVtxValidationAlg::m_h_leadLLPpt {nullptr}

private

Definition at line 264 of file MSVtxValidationAlg.h.

{nullptr};

m_h_LLP1LLP2dR

TH1F* MSVtxValidationAlg::m_h_LLP1LLP2dR {nullptr}

private

Definition at line 259 of file MSVtxValidationAlg.h.

{nullptr};

m_h_subleadLLPctau

TH1F* MSVtxValidationAlg::m_h_subleadLLPctau {nullptr}

private

Definition at line 267 of file MSVtxValidationAlg.h.

{nullptr};

m_h_subleadLLPLxy

TH1F* MSVtxValidationAlg::m_h_subleadLLPLxy {nullptr}

private

Definition at line 265 of file MSVtxValidationAlg.h.

{nullptr};

m_h_subleadLLPLz

TH1F* MSVtxValidationAlg::m_h_subleadLLPLz {nullptr}

private

Definition at line 266 of file MSVtxValidationAlg.h.

{nullptr};

m_h_subleadLLPpt

TH1F* MSVtxValidationAlg::m_h_subleadLLPpt {nullptr}

private

Definition at line 268 of file MSVtxValidationAlg.h.

{nullptr};

m_hadronicProcessEnum

std::unordered_set<int> MSVtxValidationAlg::m_hadronicProcessEnum = {111, 116, 121, 131, 132, 141, 151, 152, 161, 165, 166, 167, 210, 310}

private

Definition at line 142 of file MSVtxValidationAlg.h.

{111, 116, 121, 131, 132, 141, 151, 152, 161, 165, 166, 167, 210, 310};

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_isMC

Gaudi::Property<bool> MSVtxValidationAlg::m_isMC {this, "isMC", true, "is the input data simulated (MC) or real data?"}

private

Definition at line 92 of file MSVtxValidationAlg.h.

{this, "isMC", true, "is the input data simulated (MC) or real data?"};

m_jet

ParticleBranchPtr_t MSVtxValidationAlg::m_jet {nullptr}

private

Definition at line 229 of file MSVtxValidationAlg.h.

{nullptr};

m_jet_actVtx_link

MuonVal::MatrixBranch<int>& MSVtxValidationAlg::m_jet_actVtx_link {m_tree.newMatrix<int>("jet_actVtx_link")}

private

Definition at line 233 of file MSVtxValidationAlg.h.

{m_tree.newMatrix<int>("jet_actVtx_link")};

m_jet_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_jet_N {m_tree.newScalar<int>("jet_N",defaults::Int)}

private

Definition at line 230 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("jet_N",defaults::Int)};

m_jet_NactVtx

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_jet_NactVtx {m_tree.newVector<int>("jet_NactVtx")}

private

Definition at line 232 of file MSVtxValidationAlg.h.

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

m_jet_triggers

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_jet_triggers {m_tree.newVector<int>("jet_triggers")}

private

Definition at line 231 of file MSVtxValidationAlg.h.

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

m_jetIso_LogRatio

Gaudi::Property<float> MSVtxValidationAlg::m_jetIso_LogRatio {this, "jetIso_LogRatio", 0.5, "max log ECal/HCal ratio for jet to be considered for isolation"}

private

Definition at line 109 of file MSVtxValidationAlg.h.

{this, "jetIso_LogRatio", 0.5, "max log ECal/HCal ratio for jet to be considered for isolation"};

m_jetIso_pT

Gaudi::Property<float> MSVtxValidationAlg::m_jetIso_pT {this, "jetIso_pT", 20.0*Gaudi::Units::GeV, "minimum jet pT [GeV] to be considered for isolation"}

private

Definition at line 108 of file MSVtxValidationAlg.h.

{this, "jetIso_pT", 20.0*Gaudi::Units::GeV, "minimum jet pT [GeV] to be considered for isolation"};

m_JetKey

SG::ReadHandleKey<xAOD::JetContainer> MSVtxValidationAlg::m_JetKey {this, "JetKey", "HLT_AntiKt4EMTopoJets_nojcalib"}

private

Definition at line 67 of file MSVtxValidationAlg.h.

{this, "JetKey", "HLT_AntiKt4EMTopoJets_nojcalib"};

m_jetTriggerMatchingDR

Gaudi::Property<float> MSVtxValidationAlg::m_jetTriggerMatchingDR {this, "jetTriggerMatching", 0.1, "max dR distance for jet trigger matching"}

private

Definition at line 88 of file MSVtxValidationAlg.h.

{this, "jetTriggerMatching", 0.1, "max dR distance for jet trigger matching"};

m_llp

ParticleBranchPtr_t MSVtxValidationAlg::m_llp {nullptr}

private

Definition at line 167 of file MSVtxValidationAlg.h.

{nullptr};

m_llp_genStableChildren

Gaudi::Property<bool> MSVtxValidationAlg::m_llp_genStableChildren {this, "llp_genStableChildren", false, "Restricts the TruthParticle-LLP linking to generator stable children rather than detector stable children"}

private

Definition at line 104 of file MSVtxValidationAlg.h.

{this, "llp_genStableChildren", false, "Restricts the TruthParticle-LLP linking to generator stable children rather than detector stable children"};

m_llp_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_llp_N {m_tree.newScalar<int>("llp_N",defaults::Int)}

private

Definition at line 168 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("llp_N",defaults::Int)};

m_llp_Nchildren

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_llp_Nchildren {m_tree.newVector<int>("llp_Nchildren")}

private

Definition at line 169 of file MSVtxValidationAlg.h.

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

m_llp_NchildrenCharged

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_llp_NchildrenCharged {m_tree.newVector<int>("llp_NchildrenCharged")}

private

Definition at line 170 of file MSVtxValidationAlg.h.

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

m_llpVtx_ctau

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_llpVtx_ctau {m_tree.newVector<float>("llpVtx_ctau")}

private

Definition at line 176 of file MSVtxValidationAlg.h.

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

m_llpVtx_Lxy

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_llpVtx_Lxy {m_tree.newVector<float>("llpVtx_Lxy")}

private

Definition at line 175 of file MSVtxValidationAlg.h.

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

m_llpVtx_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_llpVtx_N {m_tree.newScalar<int>("llpVtx_N",defaults::Int)}

private

Definition at line 174 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("llpVtx_N",defaults::Int)};

m_llpVtx_pos

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_llpVtx_pos {m_tree, "llpVtx_"}

private

Definition at line 173 of file MSVtxValidationAlg.h.

{m_tree, "llpVtx_"};

m_llpVtx_truthParticle_link

MuonVal::MatrixBranch<int>& MSVtxValidationAlg::m_llpVtx_truthParticle_link {m_tree.newMatrix<int>("llpVtx_truthParticle_link")}

private

Definition at line 177 of file MSVtxValidationAlg.h.

{m_tree.newMatrix<int>("llpVtx_truthParticle_link")};

m_matchingTool

PublicToolHandle<Trig::R3MatchingTool> MSVtxValidationAlg::m_matchingTool {this, "R3MatchingTool", "", "R3MatchingTool (optional)"}

private

Definition at line 79 of file MSVtxValidationAlg.h.

{this, "R3MatchingTool", "", "R3MatchingTool (optional)"};

m_met

MuonVal::ScalarBranch<float>& MSVtxValidationAlg::m_met {m_tree.newScalar<float>("met",defaults::Float)}

private

Definition at line 249 of file MSVtxValidationAlg.h.

{m_tree.newScalar<float>("met",defaults::Float)};

m_met_phi

MuonVal::ScalarBranch<float>& MSVtxValidationAlg::m_met_phi {m_tree.newScalar<float>("met_phi",defaults::Float)}

private

Definition at line 252 of file MSVtxValidationAlg.h.

{m_tree.newScalar<float>("met_phi",defaults::Float)};

m_met_x

MuonVal::ScalarBranch<float>& MSVtxValidationAlg::m_met_x {m_tree.newScalar<float>("met_X",defaults::Float)}

private

Definition at line 250 of file MSVtxValidationAlg.h.

{m_tree.newScalar<float>("met_X",defaults::Float)};

m_met_y

MuonVal::ScalarBranch<float>& MSVtxValidationAlg::m_met_y {m_tree.newScalar<float>("met_Y",defaults::Float)}

private

Definition at line 251 of file MSVtxValidationAlg.h.

{m_tree.newScalar<float>("met_Y",defaults::Float)};

m_MetKey

SG::ReadHandleKey<xAOD::MissingETContainer> MSVtxValidationAlg::m_MetKey {this, "MetKey", "STCalibMET"}

private

Definition at line 68 of file MSVtxValidationAlg.h.

{this, "MetKey", "STCalibMET"};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 248 of file AthHistogramming.h.

m_msVtx_chi2

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_msVtx_chi2 {m_tree.newVector<float>("msVtx_chi2")}

private

Definition at line 182 of file MSVtxValidationAlg.h.

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

m_msVtx_isoJets_mindR

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_msVtx_isoJets_mindR {m_tree.newVector<float>("msVtx_isoJets_mindR")}

private

Definition at line 207 of file MSVtxValidationAlg.h.

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

m_msVtx_isoTracks_mindR

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_msVtx_isoTracks_mindR {m_tree.newVector<float>("msVtx_isoTracks_mindR")}

private

Definition at line 205 of file MSVtxValidationAlg.h.

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

m_msVtx_isoTracks_pTsum

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_msVtx_isoTracks_pTsum {m_tree.newVector<float>("msVtx_isoTracks_pTsum")}

private

Definition at line 206 of file MSVtxValidationAlg.h.

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

m_msVtx_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_msVtx_N {m_tree.newScalar<int>("msVtx_N",defaults::Int)}

private

Definition at line 181 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("msVtx_N",defaults::Int)};

m_msVtx_nDoF

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nDoF {m_tree.newVector<int>("msVtx_nDoF")}

private

Definition at line 183 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT {m_tree.newVector<int>("msVtx_nMDT")}

private

Definition at line 186 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT_E

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT_E {m_tree.newVector<int>("msVtx_nMDT_E")}

private

Definition at line 189 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT_I

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT_I {m_tree.newVector<int>("msVtx_nMDT_I")}

private

Definition at line 188 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT_inwards

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT_inwards {m_tree.newVector<int>("msVtx_nMDT_inwards")}

private

Definition at line 187 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT_M

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT_M {m_tree.newVector<int>("msVtx_nMDT_M")}

private

Definition at line 190 of file MSVtxValidationAlg.h.

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

m_msVtx_nMDT_O

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nMDT_O {m_tree.newVector<int>("msVtx_nMDT_O")}

private

Definition at line 191 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC {m_tree.newVector<int>("msVtx_nRPC")}

private

Definition at line 192 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC_E

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC_E {m_tree.newVector<int>("msVtx_nRPC_E")}

private

Definition at line 195 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC_I

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC_I {m_tree.newVector<int>("msVtx_nRPC_I")}

private

Definition at line 194 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC_inwards

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC_inwards {m_tree.newVector<int>("msVtx_nRPC_inwards")}

private

Definition at line 193 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC_M

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC_M {m_tree.newVector<int>("msVtx_nRPC_M")}

private

Definition at line 196 of file MSVtxValidationAlg.h.

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

m_msVtx_nRPC_O

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nRPC_O {m_tree.newVector<int>("msVtx_nRPC_O")}

private

Definition at line 197 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC {m_tree.newVector<int>("msVtx_nTGC")}

private

Definition at line 198 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC_E

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC_E {m_tree.newVector<int>("msVtx_nTGC_E")}

private

Definition at line 201 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC_I

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC_I {m_tree.newVector<int>("msVtx_nTGC_I")}

private

Definition at line 200 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC_inwards

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC_inwards {m_tree.newVector<int>("msVtx_nTGC_inwards")}

private

Definition at line 199 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC_M

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC_M {m_tree.newVector<int>("msVtx_nTGC_M")}

private

Definition at line 202 of file MSVtxValidationAlg.h.

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

m_msVtx_nTGC_O

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_nTGC_O {m_tree.newVector<int>("msVtx_nTGC_O")}

private

Definition at line 203 of file MSVtxValidationAlg.h.

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

m_msVtx_Ntrklet

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_msVtx_Ntrklet {m_tree.newVector<int>("msVtx_Ntrklet")}

private

Definition at line 184 of file MSVtxValidationAlg.h.

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

m_msVtx_pos

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_msVtx_pos {m_tree, "msVtx_"}

private

Definition at line 180 of file MSVtxValidationAlg.h.

{m_tree, "msVtx_"};

m_MSVtxKey

SG::ReadHandleKey<xAOD::VertexContainer> MSVtxValidationAlg::m_MSVtxKey {this, "MSVertexKey", "MSDisplacedVertex"}

private

Definition at line 72 of file MSVtxValidationAlg.h.

{this, "MSVertexKey", "MSDisplacedVertex"};

m_muon

ParticleBranchPtr_t MSVtxValidationAlg::m_muon {nullptr}

private

Definition at line 226 of file MSVtxValidationAlg.h.

{nullptr};

m_MuonKey

SG::ReadHandleKey<xAOD::MuonContainer> MSVtxValidationAlg::m_MuonKey {this, "MuonKey", "Muons"}

private

Definition at line 69 of file MSVtxValidationAlg.h.

{this, "MuonKey", "Muons"};

m_muonSeg

std::shared_ptr<MuonPRDTest::SegmentVariables> MSVtxValidationAlg::m_muonSeg {nullptr}

private

Definition at line 223 of file MSVtxValidationAlg.h.

{nullptr};

m_MuonSegKey

SG::ReadHandleKey<xAOD::MuonSegmentContainer> MSVtxValidationAlg::m_MuonSegKey {this, "MuonSegmentsKey", "MuonSegments"}

private

Definition at line 70 of file MSVtxValidationAlg.h.

{this, "MuonSegmentsKey", "MuonSegments"};

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 245 of file AthHistogramming.h.

m_pdgId_llp

Gaudi::Property<int> MSVtxValidationAlg::m_pdgId_llp {this, "pdgId_llp", 35, "Truth LLP PDGId"}

private

Definition at line 103 of file MSVtxValidationAlg.h.

{this, "pdgId_llp", 35, "Truth LLP PDGId"};

m_pdgId_portal

Gaudi::Property<int> MSVtxValidationAlg::m_pdgId_portal {this, "pdgId_portal", 25, "Truth portal PDGId"}

private

Definition at line 102 of file MSVtxValidationAlg.h.

{this, "pdgId_portal", 25, "Truth portal PDGId"};

m_portal

ParticleBranchPtr_t MSVtxValidationAlg::m_portal {nullptr}

private

Definition at line 163 of file MSVtxValidationAlg.h.

{nullptr};

m_portal_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_portal_N {m_tree.newScalar<int>("portal_N",defaults::Int)}

private

Definition at line 164 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("portal_N",defaults::Int)};

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file)

Definition at line 88 of file AthHistogramAlgorithm.h.

m_readTriggers

Gaudi::Property<bool> MSVtxValidationAlg::m_readTriggers {this, "readTriggers", false, "should trigger information be read?"}

private

Definition at line 93 of file MSVtxValidationAlg.h.

{this, "readTriggers", false, "should trigger information be read?"};

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_softTrackIso_R

Gaudi::Property<float> MSVtxValidationAlg::m_softTrackIso_R {this, "softTrackIso_R", 0.2, "cone radius around vertex to sum up track pT"}

private

Definition at line 107 of file MSVtxValidationAlg.h.

{this, "softTrackIso_R", 0.2, "cone radius around vertex to sum up track pT"};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file)

Definition at line 226 of file AthHistogramming.h.

m_sumEt

MuonVal::ScalarBranch<float>& MSVtxValidationAlg::m_sumEt {m_tree.newScalar<float>("sumEt",defaults::Float)}

private

Definition at line 253 of file MSVtxValidationAlg.h.

{m_tree.newScalar<float>("sumEt",defaults::Float)};

m_trackIso_pT

Gaudi::Property<float> MSVtxValidationAlg::m_trackIso_pT {this, "trackIso_pT", 5.0*Gaudi::Units::GeV, "minimum track pT [GeV] to be considered for isolation"}

private

Definition at line 106 of file MSVtxValidationAlg.h.

{this, "trackIso_pT", 5.0*Gaudi::Units::GeV, "minimum track pT [GeV] to be considered for isolation"};

m_TrackletKey

SG::ReadHandleKey<xAOD::TrackParticleContainer> MSVtxValidationAlg::m_TrackletKey {this, "TrackletKey", "MSonlyTracklets"}

private

Definition at line 71 of file MSVtxValidationAlg.h.

{this, "TrackletKey", "MSonlyTracklets"};

m_TrackParticleKey

SG::ReadHandleKey<xAOD::TrackParticleContainer> MSVtxValidationAlg::m_TrackParticleKey {this, "TrackParticleKey", "InDetTrackParticles"}

private

Definition at line 66 of file MSVtxValidationAlg.h.

{this, "TrackParticleKey", "InDetTrackParticles"};

m_tree

MuonVal::MuonTesterTree MSVtxValidationAlg::m_tree {"MSVtxValidTree", "MSVtxValidation"}

private

Definition at line 137 of file MSVtxValidationAlg.h.

{"MSVtxValidTree", "MSVtxValidation"};

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_trigDec

PublicToolHandle<Trig::TrigDecisionTool> MSVtxValidationAlg::m_trigDec {this, "TrigDecisionTool", "", "TrigDecisionTool (optional)"}

private

Definition at line 78 of file MSVtxValidationAlg.h.

{this, "TrigDecisionTool", "", "TrigDecisionTool (optional)"};

m_triggerStringJets

Gaudi::Property<std::string> MSVtxValidationAlg::m_triggerStringJets {this, "TriggerString", "HLT_j400.*"}

private

Definition at line 87 of file MSVtxValidationAlg.h.

{this, "TriggerString", "HLT_j400.*"}; // accepts single trigger name, comma separated list of trigger names, or regex

m_trklet_d0

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_d0 {m_tree.newVector<float>("trklet_d0")}

private

Definition at line 213 of file MSVtxValidationAlg.h.

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

m_trklet_eta

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_eta {m_tree.newVector<float>("trklet_eta")}

private

Definition at line 216 of file MSVtxValidationAlg.h.

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

m_trklet_mom

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_trklet_mom {m_tree, "trklet_p"}

private

Definition at line 211 of file MSVtxValidationAlg.h.

{m_tree, "trklet_p"};

m_trklet_N

MuonVal::ScalarBranch<int>& MSVtxValidationAlg::m_trklet_N {m_tree.newScalar<int>("trklet_N",defaults::Int)}

private

Definition at line 212 of file MSVtxValidationAlg.h.

{m_tree.newScalar<int>("trklet_N",defaults::Int)};

m_trklet_phi

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_phi {m_tree.newVector<float>("trklet_phi")}

private

Definition at line 217 of file MSVtxValidationAlg.h.

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

m_trklet_pos

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_trklet_pos {m_tree, "trklet_"}

private

Definition at line 210 of file MSVtxValidationAlg.h.

{m_tree, "trklet_"};

m_trklet_q

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_q {m_tree.newVector<float>("trklet_q")}

private

Definition at line 219 of file MSVtxValidationAlg.h.

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

m_trklet_qOverP

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_qOverP {m_tree.newVector<float>("trklet_qOverP")}

private

Definition at line 218 of file MSVtxValidationAlg.h.

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

m_trklet_theta

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_theta {m_tree.newVector<float>("trklet_theta")}

private

Definition at line 215 of file MSVtxValidationAlg.h.

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

m_trklet_vtxLink

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_trklet_vtxLink {m_tree.newVector<int>("trklet_vtxLink")}

private

Definition at line 220 of file MSVtxValidationAlg.h.

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

m_trklet_z0

MuonVal::VectorBranch<float>& MSVtxValidationAlg::m_trklet_z0 {m_tree.newVector<float>("trklet_z0")}

private

Definition at line 214 of file MSVtxValidationAlg.h.

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

m_truthParticle

ParticleBranchPtr_t MSVtxValidationAlg::m_truthParticle {nullptr}

private

Definition at line 154 of file MSVtxValidationAlg.h.

{nullptr};

m_truthParticle_actVtx_link

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthParticle_actVtx_link {m_tree.newVector<int>("truthParticle_actVtx_link")}

private

Definition at line 157 of file MSVtxValidationAlg.h.

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

m_truthParticle_actVtx_link_tmp

std::unique_ptr<std::vector<int> > MSVtxValidationAlg::m_truthParticle_actVtx_link_tmp = std::make_unique<std::vector<int>>()

private

Definition at line 158 of file MSVtxValidationAlg.h.

m_truthParticle_llpVtx_link

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthParticle_llpVtx_link {m_tree.newVector<int>("truthParticle_llpVtx_link")}

private

Definition at line 155 of file MSVtxValidationAlg.h.

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

m_truthParticle_llpVtx_link_tmp

std::unique_ptr<std::vector<int> > MSVtxValidationAlg::m_truthParticle_llpVtx_link_tmp = std::make_unique<std::vector<int>>()

private

Definition at line 156 of file MSVtxValidationAlg.h.

m_truthParticle_truthVtx_link

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthParticle_truthVtx_link {m_tree.newVector<int>("truthParticle_truthVtx_link")}

private

Definition at line 159 of file MSVtxValidationAlg.h.

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

m_truthParticle_truthVtx_link_tmp

std::unique_ptr<std::vector<int> > MSVtxValidationAlg::m_truthParticle_truthVtx_link_tmp = std::make_unique<std::vector<int>>()

private

Definition at line 160 of file MSVtxValidationAlg.h.

m_TruthParticleKey

SG::ReadHandleKey<xAOD::TruthParticleContainer> MSVtxValidationAlg::m_TruthParticleKey {this, "TruthParticleKey", "TruthParticles"}

private

Definition at line 64 of file MSVtxValidationAlg.h.

{this, "TruthParticleKey", "TruthParticles"};

m_TruthVertexKey

SG::ReadHandleKey<xAOD::TruthVertexContainer> MSVtxValidationAlg::m_TruthVertexKey {this, "TruthVertexKey", "TruthVertices"}

private

Definition at line 65 of file MSVtxValidationAlg.h.

{this, "TruthVertexKey", "TruthVertices"};

m_truthVtx_interactionType

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthVtx_interactionType {m_tree.newVector<int>("truthVtx_ interactionType")}

private

Definition at line 147 of file MSVtxValidationAlg.h.

{m_tree.newVector<int>("truthVtx_ interactionType")}; // 0 for hadronic, 1 for EM, -1 for other

m_truthVtx_Nchildren

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthVtx_Nchildren {m_tree.newVector<int>("truthVtx_Nchildren")}

private

Definition at line 149 of file MSVtxValidationAlg.h.

{m_tree.newVector<int>("truthVtx_Nchildren")}; // number of detector stable decay products

m_truthVtx_NchildrenCharged

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthVtx_NchildrenCharged {m_tree.newVector<int>("truthVtx_NchildrenCharged")}

private

Definition at line 150 of file MSVtxValidationAlg.h.

{m_tree.newVector<int>("truthVtx_NchildrenCharged")}; // number of charged detector stable decay products

m_truthVtx_NchildrenDirect

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthVtx_NchildrenDirect {m_tree.newVector<int>("truthVtx_NchildrenDirect")}

private

Definition at line 148 of file MSVtxValidationAlg.h.

{m_tree.newVector<int>("truthVtx_NchildrenDirect")}; // number of outgoing particles from the vertex

m_truthVtx_pos

MuonVal::ThreeVectorBranch MSVtxValidationAlg::m_truthVtx_pos {m_tree, "truthVtx_"}

private

Definition at line 145 of file MSVtxValidationAlg.h.

{m_tree, "truthVtx_"};

m_truthVtx_status

MuonVal::VectorBranch<int>& MSVtxValidationAlg::m_truthVtx_status {m_tree.newVector<int>("truthVtx_status")}

private

Definition at line 146 of file MSVtxValidationAlg.h.

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

m_truthVtx_truthParticle_link

MuonVal::MatrixBranch<int>& MSVtxValidationAlg::m_truthVtx_truthParticle_link {m_tree.newMatrix<int>("truthVtx_truthParticle_link")}

private

Definition at line 151 of file MSVtxValidationAlg.h.

{m_tree.newMatrix<int>("truthVtx_truthParticle_link")};

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.

---

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

• MSVtxValidationAlg.h
• MSVtxValidationAlg.cxx