EventReco::RunHyPERAlg Class Reference

This class is in charge of building the HyPER graph and running the HyPER algorithm: The user-inputs are: More...

#include <RunHyPERAlg.h>

Inheritance diagram for EventReco::RunHyPERAlg:

Public Types
using	MetaStorePtr_t = ServiceHandle< StoreGateSvc >&
	Type of the metadata store pointer in Athena.
using	ConstMetaStorePtr_t = const ServiceHandle< StoreGateSvc >&
using	MetaStore_t = ServiceHandle< StoreGateSvc >
	Type of the metadata store variable in Athena.

Public Member Functions
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) override
	execute this algorithm
virtual StatusCode	finalize () override
StatusCode	buildGraph ()
	These methods build the HyPER graph based on the user-input topology.
StatusCode	buildTtbarAllHadronicGraph ()
StatusCode	buildTtbarLJetsGraph ()
StatusCode	buildTtbarDiLeptonGraph ()
bool	buildDileptonPartialCandidate (const std::vector< int > &indicesindices, const std::vector< int > &ids, PtEtaPhiMVector &bJetP4, PtEtaPhiMVector &leptonP4, float &analyserCharge) const
void	buildTopP4TtbarAllHadronic (const std::vector< int > &topIndices, const std::vector< int > &wIndices, PtEtaPhiMVector &top_b_p4, PtEtaPhiMVector &top_W_decay0_p4, PtEtaPhiMVector &top_W_decay1_p4)
void	buildTopP4TtbarLJets (const std::vector< int > &topHadIndices, const std::vector< int > &wHadIndices, const std::vector< int > &topLepIndices, const std::vector< int > &topLepIDs, PtEtaPhiMVector &tophad_b_p4, PtEtaPhiMVector &tophad_w_decay0_p4, PtEtaPhiMVector &tophad_w_decay1_p4, PtEtaPhiMVector &toplep_b_p4, PtEtaPhiMVector &toplep_lep_p4)
	AnaAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
	constructor with parameters
::StatusCode	requestFileExecute ()
	register this algorithm to have an implementation of fileexecute
::StatusCode	requestBeginInputFile ()
	register this algorithm to have an implementation of beginInputFile
::StatusCode	requestEndInputFile ()
	register this algorithm to have an implementation of endInputFile
void	handle (const Incident &inc)
	receive the given incident
virtual StatusCode	sysInitialize ()
	Initialization method invoked by the framework.
const ServiceHandle< ITHistSvc > &	histSvc () const
	The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual StatusCode	sysExecute (const EventContext &ctx) override
	Execute an algorithm.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
virtual bool	filterPassed (const EventContext &ctx) const
	Get filter decision:
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
	Set filter decision:
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
ConstMetaStorePtr_t	inputMetaStore () const
MetaStorePtr_t	inputMetaStore ()
ConstMetaStorePtr_t	outputMetaStore () const
MetaStorePtr_t	outputMetaStore ()

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

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

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

Private Attributes
Gaudi::Property< std::string >	m_topology
Gaudi::Property< std::string >	m_btagger
std::string	m_btagDecorName
ToolHandle< AthOnnx::IOnnxRuntimeInferenceTool >	m_onnxToolTrainedOnEven
ToolHandle< AthOnnx::IOnnxRuntimeInferenceTool >	m_onnxToolTrainedOnOdd
std::unique_ptr< HyPERModel >	m_hyperModel
std::unique_ptr< HyPERGraph >	m_hyperGraph
InputsPack	m_hyperInputs {}
std::unique_ptr< HyPERParser >	m_hyperParser
Gaudi::Property< long unsigned int >	m_fullLogEventNumber
HyPERTopology	m_hyperTopology {HyPERTopology::NotSelected}
bool	m_ljetsUseBTag {false}
CP::SysListHandle	m_systematicsList {this}
CP::SysReadHandle< xAOD::ElectronContainer >	m_electronsHandle
CP::SysReadSelectionHandle	m_electronSelection
CP::SysReadHandle< xAOD::MuonContainer >	m_muonsHandle
CP::SysReadSelectionHandle	m_muonSelection
CP::SysReadHandle< xAOD::JetContainer >	m_jetsHandle
CP::SysReadSelectionHandle	m_jetSelection
CP::SysReadHandle< xAOD::MissingETContainer >	m_metHandle
CP::SysReadHandle< xAOD::EventInfo >	m_eventInfoHandle
CP::SysReadSelectionHandle	m_selection
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarAllHadronic_Top1_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarAllHadronic_Top2_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarAllHadronic_W1_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarAllHadronic_W2_Indices
CP::SysWriteDecorHandle< float >	m_hyper_TtbarAllHadronic_Top1_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarAllHadronic_Top2_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarAllHadronic_W1_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarAllHadronic_W2_Score
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_top_Wplus_decay0_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_top_Wplus_decay1_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_topbar_Wminus_decay0_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_topbar_Wminus_decay1_p4
CP::SysWriteDecorHandle< float >	m_hyper_TtbarLJets_Classification_Score
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_TopHad_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_TopLep_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_WHad_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_WLep_Indices
CP::SysWriteDecorHandle< float >	m_hyper_TtbarLJets_TopHad_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarLJets_TopLep_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarLJets_WHad_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarLJets_WLep_Score
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_TopHad_IDs
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarLJets_TopLep_IDs
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_toplep_b_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_toplep_lep_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_tophad_b_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_tophad_w_decay0_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_tophad_w_decay1_p4
CP::SysWriteDecorHandle< float >	m_hyper_TtbarDiLepton_Classification_Score
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarDiLepton_Top1_Indices
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarDiLepton_Top2_Indices
CP::SysWriteDecorHandle< float >	m_hyper_TtbarDiLepton_Top1_Score
CP::SysWriteDecorHandle< float >	m_hyper_TtbarDiLepton_Top2_Score
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarDiLepton_Top1_IDs
CP::SysWriteDecorHandle< std::vector< int > >	m_hyper_TtbarDiLepton_Top2_IDs
CP::SysWriteDecorHandle< float >	m_hyper_TtbarDiLepton_HE_Score
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_top_b_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_topbar_bbar_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_top_lep_p4
CP::SysWriteDecorHandle< PtEtaPhiMVector >	m_topbar_lepbar_p4
std::unique_ptr< SG::ConstAccessor< int > >	m_bTagDecoAcc
MetaStore_t	m_inputMetaStore
	Object accessing the input metadata store.
MetaStore_t	m_outputMetaStore
	Object accessing the output metadata store.
bool	m_hasFileExecute {false}
	the value of hasFileExecute
bool	m_hasBeginInputFile {false}
	the value of hasBeginInputFile
bool	m_hasEndInputFile {false}
	the value of hasEndInputFile
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();.
std::string	m_prefix
	Name of the ROOT output stream (file).
std::string	m_rootDir
	Name of the ROOT directory.
std::string	m_histNamePrefix
	The prefix for the histogram THx name.
std::string	m_histNamePostfix
	The postfix for the histogram THx name.
std::string	m_histTitlePrefix
	The prefix for the histogram THx title.
std::string	m_histTitlePostfix
	The postfix for the histogram THx title.
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers.
EffMap_t	m_effMap
	The map of histogram names to their pointers.
TreeMap_t	m_treeMap
	The map of TTree names to their pointers.
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers.
std::string	m_streamName
	Name of the ROOT output stream (file).
std::string	m_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Detailed Description

This class is in charge of building the HyPER graph and running the HyPER algorithm: The user-inputs are:

• The HyPER topology
• The b-tagger to use
• The object containers to use
• The event selection
• The algortithm debug level. Apart from the usual handles to the xAOD containers and tools, the class stores pointers to:
• The HyPER ONNX model to be used -> Implemented in HyPER<TOPOLOGY>Model.h
• The graph class -> Implemented in HyPERGraph.h
• A parser object -> Implemented in HyPER<TOPOLOGY>Parser.h

Definition at line 77 of file RunHyPERAlg.h.

Member Typedef Documentation

ConstMetaStorePtr_t

using EL::AnaAlgorithm::ConstMetaStorePtr_t = const ServiceHandle< StoreGateSvc >&

inherited

Definition at line 112 of file AnaAlgorithm.h.

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 199 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 213 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 171 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 192 of file AthHistogramming.h.

MetaStore_t

using EL::AnaAlgorithm::MetaStore_t = ServiceHandle< StoreGateSvc >

inherited

Type of the metadata store variable in Athena.

Definition at line 564 of file AnaAlgorithm.h.

MetaStorePtr_t

using EL::AnaAlgorithm::MetaStorePtr_t = ServiceHandle< StoreGateSvc >&

inherited

Type of the metadata store pointer in Athena.

Definition at line 111 of file AnaAlgorithm.h.

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 206 of file AthHistogramming.h.

Member Function Documentation

AnaAlgorithm()

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

constructor with parameters

This matches the Athena algorithm constructor (for dual-use purposes). Within EventLoop the pSvcLocator will always be nullptr (unless we ever have dual-use services).

Guarantee

strong

Failures

out of memory II

Definition at line 90 of file AnaAlgorithm.cxx.

    : AsgComponent (name)
    , m_inputMetaStore  (asg::SgEventMeta::InputStore, nullptr)
    , m_outputMetaStore (asg::SgEventMeta::OutputStore, nullptr)
#else
    : AthHistogramAlgorithm (name, pSvcLocator)
    , m_inputMetaStore  ("StoreGateSvc/InputMetaDataStore", name)
    , m_outputMetaStore ("StoreGateSvc/MetaDataStore", name)
#endif
  {
#ifdef XAOD_STANDALONE
    declareProperty ("RootStreamName", m_treeStreamName = "ANALYSIS",
                     "Name of the stream to put trees into");
#endif
 
    ANA_MSG_DEBUG ("AnaAlgorithm: " << name);
  }

beginInputFile()

StatusCode EL::AnaAlgorithm::beginInputFile ( )

protectedinherited

perform the action for the beginning of an input file

Ideally you don't use this, but instead rely on meta-data tools instead. However, there are enough people asking for it that I decided to implement it anyways.

Warning

To use this you have to call requestBeginInputFile to use this.

If a file is split across multiple jobs this will be called more than once. This only happens for specific batch drivers and/or if it is explicitly configured by the user. With PROOF it could even happen multiple times within the same job, and while PROOF is no longer supported that behavior may come back if support for a similar framework is added in the future. As such, this method should not be used for accounting that relies to be called exactly once per file, take a look at fileExecute if you want something that is guaranteed to be executed exactly once per input file.

The execution order of beginInputFile and fileExecute is currently unspecified.

Definition at line 353 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

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

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

book() [2/8]

StatusCode AthHistogramming::book ( const TGraph & graphRef, 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 297 of file AthHistogramming.h.

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

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 397 of file AthHistogramming.h.

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

book() [5/8]

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

inlineprotectedinherited

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

Definition at line 350 of file AthHistogramming.h.

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

book() [6/8]

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

inlineprotectedinherited

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

Definition at line 340 of file AthHistogramming.h.

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

book() [7/8]

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

inlineprotectedinherited

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

Definition at line 318 of file AthHistogramming.h.

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

book() [8/8]

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

inlineprotectedinherited

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

Definition at line 308 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 275 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 374 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 254 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 268 of file AthHistogramming.cxx.

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

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 139 of file AthHistogramming.cxx.

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

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 287 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 97 of file AthHistogramming.cxx.

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

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 266 of file AthHistogramming.h.

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

buildBookingString()

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

privateinherited

Method to build individual booking string.

Definition at line 500 of file AthHistogramming.cxx.

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

buildDileptonPartialCandidate()

bool EventReco::RunHyPERAlg::buildDileptonPartialCandidate	(	const std::vector< int > &	indices,
		const std::vector< int > &	ids,
		PtEtaPhiMVector &	bJetP4,
		PtEtaPhiMVector &	leptonP4,
		float &	analyserCharge ) const

Definition at line 216 of file RunHyPERAlg.cxx.

                                                                             {
  const int jetID = static_cast<int>(HyPERParticleID::jet);
  const int electronID = static_cast<int>(HyPERParticleID::e);
  const int muonID = static_cast<int>(HyPERParticleID::mu);
 
  if (indices.size() != 2 || ids.size() != 2)
    return false;
 
  int jetPosition = -1;
  int leptonPosition = -1;
  for (std::size_t i = 0; i < ids.size(); ++i) {
    if (ids.at(i) == jetID)
      jetPosition = static_cast<int>(i);
    if (ids.at(i) == electronID || ids.at(i) == muonID)
      leptonPosition = static_cast<int>(i);
  }
 
  if (jetPosition < 0 || leptonPosition < 0)
    return false;
 
  const int jetIndex = indices.at(jetPosition);
  const int leptonIndex = indices.at(leptonPosition);
  if (jetIndex < 0 || jetIndex >= static_cast<int>(m_hyperInputs.m_jets.size()))
    return false;
 
  const xAOD::Jet* jet = m_hyperInputs.m_jets.at(jetIndex);
  ROOT::Math::PtEtaPhiEVector jetP4 =
      buildRecoP4(jet->pt(), jet->eta(), jet->phi(), jet->e());
 
  ROOT::Math::PtEtaPhiEVector localLeptonP4;
  if (ids.at(leptonPosition) == electronID) {
    if (leptonIndex < 0 ||
        leptonIndex >= static_cast<int>(m_hyperInputs.m_electrons.size()))
      return false;
    const xAOD::Electron* electron = m_hyperInputs.m_electrons.at(leptonIndex);
    localLeptonP4 = buildRecoP4(electron->pt(), electron->eta(),
                                electron->phi(), electron->e());
    analyserCharge = electron->charge();
  } else {
    if (leptonIndex < 0 ||
        leptonIndex >= static_cast<int>(m_hyperInputs.m_muons.size()))
      return false;
    const xAOD::Muon* muon = m_hyperInputs.m_muons.at(leptonIndex);
    localLeptonP4 =
        buildRecoP4(muon->pt(), muon->eta(), muon->phi(), muon->e());
    analyserCharge = muon->charge();
  }
 
  bJetP4 = toPtEtaPhiM(jetP4);
  leptonP4 = toPtEtaPhiM(localLeptonP4);
  return true;
}

buildGraph()

StatusCode EventReco::RunHyPERAlg::buildGraph

(

)

These methods build the HyPER graph based on the user-input topology.

Definition at line 868 of file RunHyPERAlg.cxx.

                                   {
  HyPERTopology topology = m_hyperModel->getTopology();
  if (topology == EventReco::HyPERTopology::NotSelected) {
    ANA_MSG_ERROR("Bad topology while building HyPER graph");
    return StatusCode::FAILURE;
  }
 
  using Features = std::vector<float>;
 
  // Remember... For HyPER we use the following particle IDs -> jet=1 e=2 mu=3
  // met=4 tau=5 Also... VERY important! The order of filling the particles for
  // the graph is important! We use this later for the reconstruction. The order
  // is: jets -> electrons -> muons -> met -> taus
  // TODO: Write a checker function for the ordering.
 
  if (topology == EventReco::HyPERTopology::TtbarLJets)
    return this->buildTtbarLJetsGraph();
  else if (topology == EventReco::HyPERTopology::TtbarAllHadronic)
    return this->buildTtbarAllHadronicGraph();
  else if (topology == EventReco::HyPERTopology::TtbarDiLepton)
    return this->buildTtbarDiLeptonGraph();
  return StatusCode::FAILURE;  // No topology selected, this is bad behaviour.
}

buildTopP4TtbarAllHadronic()

void EventReco::RunHyPERAlg::buildTopP4TtbarAllHadronic	(	const std::vector< int > &	topIndices,
		const std::vector< int > &	wIndices,
		PtEtaPhiMVector &	top_b_p4,
		PtEtaPhiMVector &	top_W_decay0_p4,
		PtEtaPhiMVector &	top_W_decay1_p4 )

Definition at line 273 of file RunHyPERAlg.cxx.

                                                                               {
  // Check we have enough indices
  if (topIndices.size() != 3 || wIndices.size() != 2) {
    top_b_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    top_W_decay0_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    top_W_decay1_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    return;
  }
 
  // Check that W indices are within the top indices
  if (std::find(topIndices.begin(), topIndices.end(), wIndices[0]) ==
          topIndices.end() ||
      std::find(topIndices.begin(), topIndices.end(), wIndices[1]) ==
          topIndices.end()) {
    top_b_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    top_W_decay0_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    top_W_decay1_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    return;
  }
 
  const xAOD::Jet* leadWJet = nullptr;
  const xAOD::Jet* subleadWJet = nullptr;
 
  // Filter good W indices (-1 is bad)
  std::vector<int> goodWIndices;
  for (const auto idx : wIndices) {
    if (idx != -1) {
      goodWIndices.push_back(idx);
    }
  }
  // If we only have one good W index, by definition is the leading W decay
  if (goodWIndices.size() == 1) {
    int leadingWIndex = goodWIndices[0];
    leadWJet = m_hyperInputs.m_jets.at(leadingWIndex);
  }
  // If there are two good W indices, we need to determine which is leading and
  // subleading
  else if (goodWIndices.size() == 2) {
    int leadingWIndex = goodWIndices[0];
    int subleadingWIndex = goodWIndices[1];
    const xAOD::Jet* jet1 = m_hyperInputs.m_jets.at(leadingWIndex);
    const xAOD::Jet* jet2 = m_hyperInputs.m_jets.at(subleadingWIndex);
    if (jet1->pt() >= jet2->pt()) {
      leadWJet = jet1;
      subleadWJet = jet2;
    } else {
      leadWJet = jet2;
      subleadWJet = jet1;
    }
  }
  // Take out the b-jet index as the one not in the W indices
  int bJetIndex = -1;
  for (const auto idx : topIndices) {
    if (std::find(wIndices.begin(), wIndices.end(), idx) == wIndices.end()) {
      bJetIndex = idx;
      break;
    }
  }
  const xAOD::Jet* bJet =
      (bJetIndex != -1) ? m_hyperInputs.m_jets.at(bJetIndex) : nullptr;
 
  // Build the 4-vectors
  top_b_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  top_W_decay0_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  top_W_decay1_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
 
  if (bJet) {
    ROOT::Math::PtEtaPhiEVector bJetP4 =
        buildRecoP4(bJet->pt(), bJet->eta(), bJet->phi(), bJet->e());
    top_b_p4 = toPtEtaPhiM(bJetP4);
  }
  if (leadWJet) {
    ROOT::Math::PtEtaPhiEVector leadWJetP4 = buildRecoP4(
        leadWJet->pt(), leadWJet->eta(), leadWJet->phi(), leadWJet->e());
    top_W_decay0_p4 = toPtEtaPhiM(leadWJetP4);
  }
  if (subleadWJet) {
    ROOT::Math::PtEtaPhiEVector subleadWJetP4 =
        buildRecoP4(subleadWJet->pt(), subleadWJet->eta(), subleadWJet->phi(),
                    subleadWJet->e());
    top_W_decay1_p4 = toPtEtaPhiM(subleadWJetP4);
  }
}

buildTopP4TtbarLJets()

void EventReco::RunHyPERAlg::buildTopP4TtbarLJets	(	const std::vector< int > &	topHadIndices,
		const std::vector< int > &	wHadIndices,
		const std::vector< int > &	topLepIndices,
		const std::vector< int > &	topLepIDs,
		PtEtaPhiMVector &	tophad_b_p4,
		PtEtaPhiMVector &	tophad_w_decay0_p4,
		PtEtaPhiMVector &	tophad_w_decay1_p4,
		PtEtaPhiMVector &	toplep_b_p4,
		PtEtaPhiMVector &	toplep_lep_p4 )

Definition at line 361 of file RunHyPERAlg.cxx.

                                    {
  tophad_b_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  tophad_w_decay0_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  tophad_w_decay1_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  toplep_b_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
  toplep_lep_p4.SetCoordinates(0.0, 0.0, 0.0, 0.0);
 
  // Hadronic top 4-vectors
  buildTopP4TtbarAllHadronic(topHadIndices, wHadIndices, tophad_b_p4,
                             tophad_w_decay0_p4, tophad_w_decay1_p4);
 
  // Leptonic top 4-vectors
  if (topLepIndices.size() == 3 && topLepIDs.size() == 3) {
    const int jetID = static_cast<int>(HyPERParticleID::jet);
    const int electronID = static_cast<int>(HyPERParticleID::e);
    const int muonID = static_cast<int>(HyPERParticleID::mu);
 
    for (std::size_t i = 0; i < 3; ++i) {
      int idx = topLepIndices[i];
      int id = topLepIDs[i];
      if (idx < 0)
        continue;
 
      if (id == jetID) {
        if (idx < static_cast<int>(m_hyperInputs.m_jets.size())) {
          const xAOD::Jet* jet = m_hyperInputs.m_jets.at(idx);
          toplep_b_p4 = toPtEtaPhiM(
              buildRecoP4(jet->pt(), jet->eta(), jet->phi(), jet->e()));
        }
      } else if (id == electronID) {
        if (idx < static_cast<int>(m_hyperInputs.m_electrons.size())) {
          const xAOD::Electron* el = m_hyperInputs.m_electrons.at(idx);
          toplep_lep_p4 =
              toPtEtaPhiM(buildRecoP4(el->pt(), el->eta(), el->phi(), el->e()));
        }
      } else if (id == muonID) {
        if (idx < static_cast<int>(m_hyperInputs.m_muons.size())) {
          const xAOD::Muon* mu = m_hyperInputs.m_muons.at(idx);
          toplep_lep_p4 =
              toPtEtaPhiM(buildRecoP4(mu->pt(), mu->eta(), mu->phi(), mu->e()));
        }
      }
    }
  }
}

buildTtbarAllHadronicGraph()

StatusCode EventReco::RunHyPERAlg::buildTtbarAllHadronicGraph

(

)

Definition at line 1072 of file RunHyPERAlg.cxx.

                                                   {
  // For this topology we only use jets:
  // [E, eta, phi, pT, bTag, particleID = 1]
  // And Edges with the following features:
  // [dEta, dPhi, dR, m(i,j)]
  // And, the following globals:
  // [nJets, nBTagJets]
 
  // Build particles
  std::vector<Features> particles;
  float nBJets90 =
      0;  // Store number of bjets per-quantile for the global features.
  float nBJets85 = 0;
  float nBJets77 = 0;
  float nBJets70 = 0;
  float nBJets65 = 0;
  float nJets = 0;  // Store number of jets for the global features.
  for (const xAOD::Jet* jet : m_hyperInputs.m_jets) {
    nJets += 1.0f;
    // Get b-tagging decision
    if (!m_bTagDecoAcc->isAvailable(*jet)) {
      ANA_MSG_ERROR("HyPERAlg:: the jets do not have " << m_btagDecorName
                                                       << " aux variable!");
      return StatusCode::FAILURE;
    }
 
    int bTagQuantile = (*m_bTagDecoAcc)(*jet);
    if (bTagQuantile >= 2)
      nBJets90 += 1;
    if (bTagQuantile >= 3)
      nBJets85 += 1;
    if (bTagQuantile >= 4)
      nBJets77 += 1;
    if (bTagQuantile >= 5)
      nBJets70 += 1;
    if (bTagQuantile >= 6)
      nBJets65 += 1;
    Features feats = {float(jet->e() / 1000), float(jet->eta()),
                      float(jet->phi()),      float(jet->pt() / 1000),
                      float(bTagQuantile),    float(EventReco::HyPERParticleID::jet)};
    particles.push_back(feats);
  }
 
  // Add the nodes
  for (std::size_t i = 0; i < particles.size(); i++) {
    m_hyperGraph->addNode(particles[i]);
  }
 
  // Add the globals, scaling already applied here.
  Features globalFeats = {nJets / 6.0f,    nBJets90 / 2.0f, nBJets85 / 2.0f,
                          nBJets77 / 2.0f, nBJets70 / 2.0f, nBJets65 / 2.0f};
  m_hyperGraph->addGlobal(globalFeats);
 
  // Build graph edges and hyperedges
  m_hyperGraph->buildEdgeIndices();
  m_hyperGraph->buildHyperEdges(3);
 
  // Add the edges
  // Loop over the edge indices
  for (const auto& edge : m_hyperGraph->getEdgeIndicesVector()) {
    // Get the source and target nodes
    int64_t source = edge.first;
    int64_t target = edge.second;
    // Get the features
    Features firstNodeFeats = m_hyperGraph->getNodeFeats(source);
    Features secondNodeFeats = m_hyperGraph->getNodeFeats(target);
 
    // Calculate the edge features
    float dEta = secondNodeFeats[1] - firstNodeFeats[1];
    float dPhi = deltaPhi(secondNodeFeats[2], firstNodeFeats[2]);
    float dR = sqrt(dEta * dEta + dPhi * dPhi);
    ROOT::Math::PtEtaPhiEVector particle1;
    ROOT::Math::PtEtaPhiEVector particle2;
    particle1.SetCoordinates(firstNodeFeats[3], firstNodeFeats[1],
                             firstNodeFeats[2], firstNodeFeats[0]);
    particle2.SetCoordinates(secondNodeFeats[3], secondNodeFeats[1],
                             secondNodeFeats[2], secondNodeFeats[0]);
    float m = (particle1 + particle2).M();
 
    Features edgeFeats = {dEta, dPhi, dR, log(m)};
    m_hyperGraph->addEdge(source, target, edgeFeats);
  }
 
  // Scaling the node inputs
  for (std::size_t i{0}; i < static_cast<std::size_t>(m_hyperGraph->nNodes());
       i++) {
    Features& nodeFeats = m_hyperGraph->getNodeFeats(i);
    nodeFeats.at(0) = log(nodeFeats.at(0));
    nodeFeats.at(3) = log(nodeFeats.at(3));
  }
  return StatusCode::SUCCESS;
}

buildTtbarDiLeptonGraph()

StatusCode EventReco::RunHyPERAlg::buildTtbarDiLeptonGraph

(

)

Definition at line 1165 of file RunHyPERAlg.cxx.

                                                {
  // For this topology we use jets, electrons and muons:
  // [Log(E), eta, phi, Log(pT), bTagQuantile/6, charge, particleID/2]
  // And Edges with the following features:
  // [dEta, dPhi, dR, m(i,j)]
  // And, the following globals:
  // [nJets/6, Log(met_pT), met_phi, nBTagJets90/2, nBTagJets85/2,
  // nBTagJets77/2, nBTagJets70/2, nBTagJets65/2]
 
  // Build particles
  std::vector<Features> particles;
  float nBJets90 =
      0;  // Store number of bjets per-quantile for the global features.
  float nBJets85 = 0;
  float nBJets77 = 0;
  float nBJets70 = 0;
  float nBJets65 = 0;
  float nJets = 0;  // Store number of jets for the global features.
  for (const xAOD::Jet* jet : m_hyperInputs.m_jets) {
 
    nJets += 1.0f;
    // Get b-tagging decision.
    if (!m_bTagDecoAcc->isAvailable(*jet)) {
      ANA_MSG_ERROR("HyPERAlg:: the jets do not have " << m_btagDecorName
                                                       << " aux variable!");
      return StatusCode::FAILURE;
    }
    int bTagQuantile = (*m_bTagDecoAcc)(*jet);
    if (bTagQuantile >= 2)
      nBJets90 += 1;
    if (bTagQuantile >= 3)
      nBJets85 += 1;
    if (bTagQuantile >= 4)
      nBJets77 += 1;
    if (bTagQuantile >= 5)
      nBJets70 += 1;
    if (bTagQuantile >= 6)
      nBJets65 += 1;
    Features feats = {float(jet->e() / 1000),
                      float(jet->eta()),
                      float(jet->phi()),
                      float(jet->pt() / 1000),
                      float(bTagQuantile),
                      0.f,
                      float(EventReco::HyPERParticleID::jet),
                      1.f};  // TODO: This is needed because the training was
                             // done with new HyPER dataset.
    particles.push_back(feats);
  }
 
  for (const xAOD::Electron* el : m_hyperInputs.m_electrons) {
 
    Features feats = {float(el->e() / 1000),
                      float(el->eta()),
                      float(el->phi()),
                      float(el->pt() / 1000),
                      0.f,
                      float(el->charge()),
                      float(EventReco::HyPERParticleID::e),
                      2.f};
    particles.push_back(feats);
  }
 
  for (const xAOD::Muon* mu : m_hyperInputs.m_muons) {
 
    Features feats = {float(mu->e() / 1000),
                      float(mu->eta()),
                      float(mu->phi()),
                      float(mu->pt() / 1000),
                      0.f,
                      float(mu->charge()),
                      float(EventReco::HyPERParticleID::mu),
                      2.f};  // TODO: This is needed because the
                             // training was done with new HyPER
                             // dataset.
    particles.push_back(feats);
  }
 
  // MET features
  float met_pt = (*m_hyperInputs.m_met)["Final"]->met() / 1000;
  float met_phi = (*m_hyperInputs.m_met)["Final"]->phi();
 
  Features metFeats = {
      met_pt, 0.f, met_phi, met_pt, 0.f, 0.f, float(EventReco::HyPERParticleID::met),
      3.f};  // TODO: This is needed because the training was
             // done with new HyPER dataset.
  particles.push_back(metFeats);
 
  // Add the nodes
  for (std::size_t i = 0; i < particles.size(); i++) {
    m_hyperGraph->addNode(particles[i]);
  }
 
  // Add the globals, scaling already applied here.
  Features globalFeats;
 
  globalFeats = {nJets / 6.0f,    log(met_pt),     met_phi,
                 nBJets90 / 2.0f, nBJets85 / 2.0f, nBJets77 / 2.0f,
                 nBJets70 / 2.0f, nBJets65 / 2.0f};
  m_hyperGraph->addGlobal(globalFeats);
 
  // Build graph edges and hyperedges
  m_hyperGraph->buildEdgeIndices();
  m_hyperGraph->buildHyperEdges(4);
 
  // Add the edges
  // Loop over the edge indices
  for (const auto& edge : m_hyperGraph->getEdgeIndicesVector()) {
    // Get the source and target nodes
    int64_t source = edge.first;
    int64_t target = edge.second;
    // Get the features
    Features firstNodeFeats = m_hyperGraph->getNodeFeats(source);
    Features secondNodeFeats = m_hyperGraph->getNodeFeats(target);
 
    // Calculate the edge features
    float dEta = secondNodeFeats[1] - firstNodeFeats[1];
    float dPhi = deltaPhi(secondNodeFeats[2], firstNodeFeats[2]);
    float dR = sqrt(dEta * dEta + dPhi * dPhi);
    ROOT::Math::PtEtaPhiEVector particle1;
    ROOT::Math::PtEtaPhiEVector particle2;
    particle1.SetCoordinates(firstNodeFeats[3], firstNodeFeats[1],
                             firstNodeFeats[2], firstNodeFeats[0]);
    particle2.SetCoordinates(secondNodeFeats[3], secondNodeFeats[1],
                             secondNodeFeats[2], secondNodeFeats[0]);
    float m = (particle1 + particle2).M();
 
    Features edgeFeats = {dEta, dPhi, dR, log(m)};
    m_hyperGraph->addEdge(source, target, edgeFeats);
  }
 
  // Scaling the node inputs
  for (std::size_t i{0}; i < static_cast<std::size_t>(m_hyperGraph->nNodes());
       i++) {
    Features& nodeFeats = m_hyperGraph->getNodeFeats(i);
    nodeFeats.at(0) = log(nodeFeats.at(0));
    nodeFeats.at(3) = log(nodeFeats.at(3));
    nodeFeats.at(4) = nodeFeats.at(4) / 6.0f;
    nodeFeats.at(6) = nodeFeats.at(6) / 2.0f;
  }
  return StatusCode::SUCCESS;
}

buildTtbarLJetsGraph()

StatusCode EventReco::RunHyPERAlg::buildTtbarLJetsGraph

(

)

Definition at line 892 of file RunHyPERAlg.cxx.

                                             {
  // For this topology we use jets, electrons and muons:
  // [E, eta, phi, pT, charge, particleID]
  // And Edges with the following features:
  // [dEta, dPhi, dR, m(i,j)]
  // And, the following globals:
  // [nJets, nBTagJets]
 
  // Build particles
  std::vector<Features> particles;
  float nBJets90 =
      0;  // Store number of bjets per-quantile for the global features.
  float nBJets85 = 0;
  float nBJets77 = 0;
  float nBJets70 = 0;
  float nBJets65 = 0;
  float nJets = 0;  // Store number of jets for the global features.
  for (const xAOD::Jet* jet : m_hyperInputs.m_jets) {
    nJets += 1.0f;
    Features feats;
    if (m_ljetsUseBTag) {
      // Get b-tagging decision.
      if (!m_bTagDecoAcc->isAvailable(*jet)) {
        ANA_MSG_ERROR("HyPERAlg:: the jets do not have " << m_btagDecorName
                                                         << " aux variable!");
        return StatusCode::FAILURE;
      }
      int bTagQuantile = (*m_bTagDecoAcc)(*jet);
      if (bTagQuantile >= 2)
        nBJets90 += 1;
      if (bTagQuantile >= 3)
        nBJets85 += 1;
      if (bTagQuantile >= 4)
        nBJets77 += 1;
      if (bTagQuantile >= 5)
        nBJets70 += 1;
      if (bTagQuantile >= 6)
        nBJets65 += 1;
      feats = {float(jet->e() / 1000),
               float(jet->eta()),
               float(jet->phi()),
               float(jet->pt() / 1000),
               float(bTagQuantile),
               0.f,
               float(EventReco::HyPERParticleID::jet),
               1.f};  // TODO: This is needed because the training was
                      // done with new HyPER dataset.
    } else {
      feats = {float(jet->e() / 1000),
               float(jet->eta()),
               float(jet->phi()),
               float(jet->pt() / 1000),
               0.f,
               float(EventReco::HyPERParticleID::jet),
               1.f};  // TODO: This is needed because the training was
                      // done with new HyPER dataset.
    }
    particles.push_back(feats);
  }
  for (const xAOD::Electron* el : m_hyperInputs.m_electrons) {
    Features feats;
    if (m_ljetsUseBTag) {
      feats = {float(el->e() / 1000),
               float(el->eta()),
               float(el->phi()),
               float(el->pt() / 1000),
               0.f,
               float(el->charge()),
               float(EventReco::HyPERParticleID::e),
               2.f};
    } else {
      feats = {float(el->e() / 1000),
               float(el->eta()),
               float(el->phi()),
               float(el->pt() / 1000),
               float(el->charge()),
               float(EventReco::HyPERParticleID::e),
               2.f};  // TODO: This is needed because the training was
                      // done with new HyPER dataset.
    }
    particles.push_back(feats);
  }
  for (const xAOD::Muon* mu : m_hyperInputs.m_muons) {
    Features feats;
    if (m_ljetsUseBTag) {
      feats = {float(mu->e() / 1000),
               float(mu->eta()),
               float(mu->phi()),
               float(mu->pt() / 1000),
               0.f,
               float(mu->charge()),
               float(EventReco::HyPERParticleID::mu),
               2.f};
    } else {
      feats = {float(mu->e() / 1000),
               float(mu->eta()),
               float(mu->phi()),
               float(mu->pt() / 1000),
               float(mu->charge()),
               float(EventReco::HyPERParticleID::mu),
               2.f};  // TODO: This is needed because the training was
                      // done with new HyPER dataset.
    }
    particles.push_back(feats);
  }
  Features metFeats;
  if (m_ljetsUseBTag) {
    metFeats = {float((*m_hyperInputs.m_met)["Final"]->met() / 1000),
                0.f,
                float((*m_hyperInputs.m_met)["Final"]->phi()),
                float((*m_hyperInputs.m_met)["Final"]->met() / 1000),
                0.f,
                0.f,
                float(EventReco::HyPERParticleID::met),
                3.f};
  } else {
    metFeats = {float((*m_hyperInputs.m_met)["Final"]->met() / 1000),
                0.f,
                float((*m_hyperInputs.m_met)["Final"]->phi()),
                float((*m_hyperInputs.m_met)["Final"]->met() / 1000),
                0.f,
                float(EventReco::HyPERParticleID::met),
                3.f};
  }
  particles.push_back(metFeats);
 
  // Add the nodes
  for (std::size_t i = 0; i < particles.size(); i++) {
    m_hyperGraph->addNode(particles[i]);
  }
 
  // Add the globals, scaling already applied here.
  Features globalFeats;
  if (m_ljetsUseBTag)
    globalFeats = {nJets / 6.0f,    nBJets90 / 2.0f, nBJets85 / 2.0f,
                   nBJets77 / 2.0f, nBJets70 / 2.0f, nBJets65 / 2.0f};
  else
    globalFeats = {nJets / 6.0f};
  m_hyperGraph->addGlobal(globalFeats);
 
  // Build graph edges and hyperedges
  m_hyperGraph->buildEdgeIndices();
  m_hyperGraph->buildHyperEdges(3);
 
  // Add the edges
  // Loop over the edge indices
  for (const auto& edge : m_hyperGraph->getEdgeIndicesVector()) {
    // Get the source and target nodes
    int64_t source = edge.first;
    int64_t target = edge.second;
    // Get the features
    Features firstNodeFeats = m_hyperGraph->getNodeFeats(source);
    Features secondNodeFeats = m_hyperGraph->getNodeFeats(target);
 
    // Calculate the edge features
    float dEta = secondNodeFeats[1] - firstNodeFeats[1];
    float dPhi = deltaPhi(secondNodeFeats[2], firstNodeFeats[2]);
    float dR = sqrt(dEta * dEta + dPhi * dPhi);
    ROOT::Math::PtEtaPhiEVector particle1;
    ROOT::Math::PtEtaPhiEVector particle2;
    particle1.SetCoordinates(firstNodeFeats[3], firstNodeFeats[1],
                             firstNodeFeats[2], firstNodeFeats[0]);
    particle2.SetCoordinates(secondNodeFeats[3], secondNodeFeats[1],
                             secondNodeFeats[2], secondNodeFeats[0]);
    float m = (particle1 + particle2).M();
 
    Features edgeFeats = {dEta, dPhi, dR, log(m)};
    m_hyperGraph->addEdge(source, target, edgeFeats);
  }
 
  // Scaling the node inputs
  for (std::size_t i{0}; i < static_cast<std::size_t>(m_hyperGraph->nNodes());
       i++) {
    Features& nodeFeats = m_hyperGraph->getNodeFeats(i);
    nodeFeats.at(0) = log(nodeFeats.at(0));
    nodeFeats.at(3) = log(nodeFeats.at(3));
  }
  return StatusCode::SUCCESS;
}

configAthHistogramming()

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

protectedinherited

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

Definition at line 64 of file AthHistogramming.cxx.

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

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 214 of file AthHistogramming.cxx.

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

endInputFile()

StatusCode EL::AnaAlgorithm::endInputFile ( )

protectedinherited

perform the action for the end of an input file

Ideally you don't use this, but instead rely on meta-data tools instead. However, there are enough people asking for it that I decided to implement it anyways.

Warning

To use this you have to call requestEndInputFile to use this.

If a file is split across multiple jobs this will be called more than once. This only happens for specific batch drivers and/or if it is explicitly configured by the user. With PROOF it could even happen multiple times within the same job, and while PROOF is no longer supported that behavior may come back if support for a similar framework is added in the future. As such, this method should not be used for accounting that relies to be called exactly once per file, take a look at fileExecute if you want something that is guaranteed to be executed exactly once per input file.

The execution order of endInputFile and fileExecute is currently unspecified.

Definition at line 361 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute() [1/2]

StatusCode EL::AnaAlgorithm::execute ( )

protectedinherited

execute this algorithm

Deprecated

Prefer method with EventContext.

Warning

Override only one of the two execute methods.

This gets called once on every event and is where the bulk of the processing ought to be happening.

Definition at line 314 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

execute() [2/2]

StatusCode EventReco::RunHyPERAlg::execute ( const EventContext & ctx )

overridevirtual

execute this algorithm

Warning

Override only one of the two execute methods.

This gets called once on every event and is where the bulk of the processing ought to be happening.

Reimplemented from EL::AnaAlgorithm.

Definition at line 412 of file RunHyPERAlg.cxx.

                                                       {
  auto invalidRecoParton = []() {
    PtEtaPhiMVector vec;
    vec.SetCoordinates(0.0, 0.0, 0.0, 0.0);
    return vec;
  };
  // Loop over systematics
  for (const auto& sys : m_systematicsList.systematicsVector()) {
    // Check the event selection
    const xAOD::EventInfo* evtInfo = nullptr;
    ANA_CHECK(m_eventInfoHandle.retrieve(evtInfo, sys, ctx));
 
    // If user sets DEBUG the idea is the user will see general things about the
    // code running for all events. If user sets VERBOSE the idea is the user
    // will see very detailed information for one specific event.
    if (m_fullLogEventNumber.value() != 0) {  // User wants to log a particular event.
      if (evtInfo->eventNumber() == m_fullLogEventNumber.value()) {
        this->msg().setLevel(MSG::VERBOSE);
        g_hyper_msg_level = MSG::VERBOSE;
      } else {  // We don't want other events to pollute the log.
        this->msg().setLevel(MSG::INFO);
        g_hyper_msg_level = MSG::INFO;
      }
    }
 
    ANA_MSG_DEBUG("Event number.... : " << evtInfo->eventNumber());
 
    // Every CP::SysWriteDecorHandle must be locked before the output stream
    // flushes, otherwise copyAuxStoreThinned warns about unlocked decorations.
    // Invoked on every path that leaves this systematic iteration.
    auto lockAllDecorations = [&]() {
      if (m_hyperTopology == EventReco::HyPERTopology::TtbarAllHadronic) {
        m_hyper_TtbarAllHadronic_Top1_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_Top1_Score.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_Top2_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_Top2_Score.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_W1_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_W1_Score.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_W2_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarAllHadronic_W2_Score.lock(*evtInfo, sys);
        if (!m_top_b_p4.empty()) m_top_b_p4.lock(*evtInfo, sys);
        if (!m_topbar_bbar_p4.empty()) m_topbar_bbar_p4.lock(*evtInfo, sys);
        if (!m_top_Wplus_decay0_p4.empty()) m_top_Wplus_decay0_p4.lock(*evtInfo, sys);
        if (!m_top_Wplus_decay1_p4.empty()) m_top_Wplus_decay1_p4.lock(*evtInfo, sys);
        if (!m_topbar_Wminus_decay0_p4.empty()) m_topbar_Wminus_decay0_p4.lock(*evtInfo, sys);
        if (!m_topbar_Wminus_decay1_p4.empty()) m_topbar_Wminus_decay1_p4.lock(*evtInfo, sys);
      }
      if (m_hyperTopology == EventReco::HyPERTopology::TtbarLJets) {
        m_hyper_TtbarLJets_Classification_Score.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopHad_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopLep_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_WHad_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_WLep_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopHad_Score.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopLep_Score.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_WHad_Score.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_WLep_Score.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopHad_IDs.lock(*evtInfo, sys);
        m_hyper_TtbarLJets_TopLep_IDs.lock(*evtInfo, sys);
        if (!m_toplep_b_p4.empty()) m_toplep_b_p4.lock(*evtInfo, sys);
        if (!m_toplep_lep_p4.empty()) m_toplep_lep_p4.lock(*evtInfo, sys);
        if (!m_tophad_b_p4.empty()) m_tophad_b_p4.lock(*evtInfo, sys);
        if (!m_tophad_w_decay0_p4.empty()) m_tophad_w_decay0_p4.lock(*evtInfo, sys);
        if (!m_tophad_w_decay1_p4.empty()) m_tophad_w_decay1_p4.lock(*evtInfo, sys);
      }
      if (m_hyperTopology == EventReco::HyPERTopology::TtbarDiLepton) {
        m_hyper_TtbarDiLepton_Classification_Score.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top1_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top2_Indices.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top1_Score.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top2_Score.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top1_IDs.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_Top2_IDs.lock(*evtInfo, sys);
        m_hyper_TtbarDiLepton_HE_Score.lock(*evtInfo, sys);
        if (!m_top_b_p4.empty()) m_top_b_p4.lock(*evtInfo, sys);
        if (!m_topbar_bbar_p4.empty()) m_topbar_bbar_p4.lock(*evtInfo, sys);
        if (!m_top_lep_p4.empty()) m_top_lep_p4.lock(*evtInfo, sys);
        if (!m_topbar_lepbar_p4.empty()) m_topbar_lepbar_p4.lock(*evtInfo, sys);
      }
    };
 
 
    // Default decoration values (topology dependent)
    const HyPERTopology hyperTopology = m_hyperTopology;
    if (hyperTopology == EventReco::HyPERTopology::TtbarAllHadronic) {
      m_hyper_TtbarAllHadronic_Top1_Indices.set(
          *evtInfo, std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarAllHadronic_Top1_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarAllHadronic_Top2_Indices.set(
          *evtInfo, std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarAllHadronic_Top2_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarAllHadronic_W1_Indices.set(
          *evtInfo, std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarAllHadronic_W1_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarAllHadronic_W2_Indices.set(
          *evtInfo, std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarAllHadronic_W2_Score.set(*evtInfo, -1, sys);
      if (!m_top_b_p4.empty())
        m_top_b_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_topbar_bbar_p4.empty())
        m_topbar_bbar_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_top_Wplus_decay0_p4.empty())
        m_top_Wplus_decay0_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_top_Wplus_decay1_p4.empty())
        m_top_Wplus_decay1_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_topbar_Wminus_decay0_p4.empty())
        m_topbar_Wminus_decay0_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_topbar_Wminus_decay1_p4.empty())
        m_topbar_Wminus_decay1_p4.set(*evtInfo, invalidRecoParton(), sys);
    }
    if (hyperTopology == EventReco::HyPERTopology::TtbarLJets) {
      m_hyper_TtbarLJets_Classification_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarLJets_TopHad_Indices.set(*evtInfo,
                                            std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarLJets_TopLep_Indices.set(*evtInfo,
                                            std::vector<int>{-1, -1, -1}, sys);
      m_hyper_TtbarLJets_WHad_Indices.set(*evtInfo, std::vector<int>{-1, -1},
                                          sys);
      m_hyper_TtbarLJets_WLep_Indices.set(*evtInfo, std::vector<int>{-1, -1},
                                          sys);
      m_hyper_TtbarLJets_TopHad_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarLJets_TopLep_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarLJets_WHad_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarLJets_WLep_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarLJets_TopHad_IDs.set(*evtInfo, std::vector<int>{-1, -1, -1},
                                        sys);
      m_hyper_TtbarLJets_TopLep_IDs.set(*evtInfo, std::vector<int>{-1, -1, -1},
                                        sys);
      if (!m_toplep_b_p4.empty())
        m_toplep_b_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_toplep_lep_p4.empty())
        m_toplep_lep_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_tophad_b_p4.empty())
        m_tophad_b_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_tophad_w_decay0_p4.empty())
        m_tophad_w_decay0_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_tophad_w_decay1_p4.empty())
        m_tophad_w_decay1_p4.set(*evtInfo, invalidRecoParton(), sys);
    }
    if (hyperTopology == EventReco::HyPERTopology::TtbarDiLepton) {
      m_hyper_TtbarDiLepton_Classification_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarDiLepton_Top1_Indices.set(*evtInfo, std::vector<int>{-1, -1},
                                             sys);
      m_hyper_TtbarDiLepton_Top2_Indices.set(*evtInfo, std::vector<int>{-1, -1},
                                             sys);
      m_hyper_TtbarDiLepton_Top1_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarDiLepton_Top2_Score.set(*evtInfo, -1, sys);
      m_hyper_TtbarDiLepton_Top1_IDs.set(*evtInfo, std::vector<int>{-1, -1},
                                         sys);
      m_hyper_TtbarDiLepton_Top2_IDs.set(*evtInfo, std::vector<int>{-1, -1},
                                         sys);
      m_hyper_TtbarDiLepton_HE_Score.set(*evtInfo, -1, sys);
      if (!m_top_b_p4.empty())
        m_top_b_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_topbar_bbar_p4.empty())
        m_topbar_bbar_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_top_lep_p4.empty())
        m_top_lep_p4.set(*evtInfo, invalidRecoParton(), sys);
      if (!m_topbar_lepbar_p4.empty())
        m_topbar_lepbar_p4.set(*evtInfo, invalidRecoParton(), sys);
    }
 
    if (m_selection && !m_selection.getBool(*evtInfo, sys)) {
      lockAllDecorations();
      continue;
    }
 
    // Read the containers
    const xAOD::ElectronContainer* electrons = nullptr;
    ANA_CHECK(m_electronsHandle.retrieve(electrons, sys, ctx));
    const xAOD::MuonContainer* muons = nullptr;
    ANA_CHECK(m_muonsHandle.retrieve(muons, sys, ctx));
    const xAOD::JetContainer* jets = nullptr;
    ANA_CHECK(m_jetsHandle.retrieve(jets, sys, ctx));
    const xAOD::MissingETContainer* met = nullptr;
    ANA_CHECK(m_metHandle.retrieve(met, sys, ctx));
 
    // Apply object-wise selection
    ConstDataVector<xAOD::ElectronContainer> selected_electrons(
        SG::VIEW_ELEMENTS);
    ConstDataVector<xAOD::MuonContainer> selected_muons(SG::VIEW_ELEMENTS);
    ConstDataVector<xAOD::JetContainer> selected_jets(SG::VIEW_ELEMENTS);
    std::vector<int> selected_jets_btag;
 
    ANA_MSG_DEBUG("Building particle containers.");
 
    ANA_MSG_DEBUG("Building electrons container.");
    for (const xAOD::Electron* el : *electrons) {
      if (m_electronSelection.getBool(*el, sys))
        selected_electrons.push_back(el);
    }
 
    ANA_MSG_DEBUG("Building muons container.");
    for (const xAOD::Muon* mu : *muons) {
      if (m_muonSelection.getBool(*mu, sys))
        selected_muons.push_back(mu);
    }
 
    ANA_MSG_DEBUG("Building jets container.");
    for (const xAOD::Jet* jet : *jets) {
      if (m_jetSelection.getBool(*jet, sys))
        selected_jets.push_back(jet);
    }
 
    // Build the HyPER graph
    m_hyperInputs.m_electrons = selected_electrons;
    m_hyperInputs.m_muons = selected_muons;
    m_hyperInputs.m_jets = selected_jets;
    m_hyperInputs.m_met = met;
    ANA_MSG_DEBUG("Building graph.");
    ANA_CHECK(this->buildGraph());
    ANA_MSG_DEBUG("Graph building successful.");
 
    if (this->msg().level() == MSG::VERBOSE) {
      ANA_MSG_INFO("Printing the graph...");
      m_hyperGraph->printGraph();
    }
 
    // Parse the inputs to the HyPER algorithm
    ANA_MSG_DEBUG("Building the ONNX inputs.");
    m_hyperParser->buildONNXInputs(*m_hyperGraph, *m_hyperModel);
    ANA_MSG_DEBUG("ONNX inputs building successful.");
 
    // Run the HyPER algorithm
    ANA_MSG_DEBUG("Evaluating model.");
    unsigned int modelToUse;
    // The model TRAINED on even should always be at position [0] in the
    // m_session vector so, m_session[1] should be used for even events
    modelToUse = evtInfo->eventNumber() % 2 == 0 ? 1 : 0;
 
    ANA_MSG_DEBUG("Using model: " << modelToUse);
    ANA_CHECK(m_hyperModel->evaluate(modelToUse));
    ANA_MSG_DEBUG("Model evaluation successful.");
 
    if (this->msg().level() == MSG::VERBOSE) {
      ANA_MSG_INFO("Printing the ONNX inputs:");
      m_hyperModel->printInputInfo(true);
      ANA_MSG_INFO("Printing the ONNX outputs:");
      m_hyperModel->printOutputInfo(true);
    }
 
    // Process the outputs
    ANA_MSG_DEBUG("Extracting outputs from model.");
    m_hyperParser->getONNXOutputs(*m_hyperModel);
    ANA_MSG_DEBUG("Outputs extraction successful.");
 
    ANA_MSG_DEBUG("Performing output reconstruction.");
    m_hyperParser->reconstructOutputs(*m_hyperGraph);
    ANA_MSG_DEBUG("Output reconstruction successful.");
 
    // Print the inputs/outputs for PyTorch/TCT validation
    if (m_fullLogEventNumber.value() != 0 &&
        evtInfo->eventNumber() == m_fullLogEventNumber.value()) {
      m_hyperGraph->printGraphInputsForValidation();
      m_hyperParser->printOutputsForValidation();
    }
 
    // Write the outputs
    ANA_MSG_DEBUG("Writing the outputs.");
 
    if (hyperTopology == EventReco::HyPERTopology::TtbarAllHadronic) {
      std::vector<std::string> recoLabels = m_hyperParser->getLabels();
      std::vector<std::vector<int>> recoIndices = m_hyperParser->getIndices();
      std::vector<float> recoScores = m_hyperParser->getScores();
      // HyPER_Reco_Top1
      std::size_t index = getIndexFromLabel(recoLabels, "HyPER_Reco_Top1");
      std::vector<int> top1Indices(recoIndices[index]);
      m_hyper_TtbarAllHadronic_Top1_Indices.set(*evtInfo, top1Indices, sys);
      m_hyper_TtbarAllHadronic_Top1_Score.set(*evtInfo, recoScores[index], sys);
      // HyPER_Reco_Top2
      index = getIndexFromLabel(recoLabels, "HyPER_Reco_Top2");
      std::vector<int> top2Indices(recoIndices[index]);
      m_hyper_TtbarAllHadronic_Top2_Indices.set(*evtInfo, top2Indices, sys);
      m_hyper_TtbarAllHadronic_Top2_Score.set(*evtInfo, recoScores[index], sys);
      // HyPER_Reco_W1
      index = getIndexFromLabel(recoLabels, "HyPER_Reco_W1");
      std::vector<int> w1Indices(recoIndices[index]);
      m_hyper_TtbarAllHadronic_W1_Indices.set(*evtInfo, w1Indices, sys);
      m_hyper_TtbarAllHadronic_W1_Score.set(*evtInfo, recoScores[index], sys);
      // HyPER_Reco_W2
      index = getIndexFromLabel(recoLabels, "HyPER_Reco_W2");
      std::vector<int> w2Indices(recoIndices[index]);
      m_hyper_TtbarAllHadronic_W2_Indices.set(*evtInfo, w2Indices, sys);
      m_hyper_TtbarAllHadronic_W2_Score.set(*evtInfo, recoScores[index], sys);
      // Build the top 4-vectors
      // Top1
      PtEtaPhiMVector top_b_p4 = invalidRecoParton();
      PtEtaPhiMVector top_Wplus_decay0_p4 = invalidRecoParton();
      PtEtaPhiMVector top_Wplus_decay1_p4 = invalidRecoParton();
      if (!m_top_b_p4.empty() && !m_top_Wplus_decay0_p4.empty() &&
          !m_top_Wplus_decay1_p4.empty()) {
        buildTopP4TtbarAllHadronic(top1Indices, w1Indices, top_b_p4,
                                   top_Wplus_decay0_p4, top_Wplus_decay1_p4);
        m_top_b_p4.set(*evtInfo, top_b_p4, sys);
        m_top_Wplus_decay0_p4.set(*evtInfo, top_Wplus_decay0_p4, sys);
        m_top_Wplus_decay1_p4.set(*evtInfo, top_Wplus_decay1_p4, sys);
      }
      // Top2
      PtEtaPhiMVector topbar_bbar_p4 = invalidRecoParton();
      PtEtaPhiMVector topbar_Wminus_decay0_p4 = invalidRecoParton();
      PtEtaPhiMVector topbar_Wminus_decay1_p4 = invalidRecoParton();
      if (!m_topbar_bbar_p4.empty() && !m_topbar_Wminus_decay0_p4.empty() &&
          !m_topbar_Wminus_decay1_p4.empty()) {
        buildTopP4TtbarAllHadronic(top2Indices, w2Indices, topbar_bbar_p4,
                                   topbar_Wminus_decay0_p4,
                                   topbar_Wminus_decay1_p4);
        m_topbar_bbar_p4.set(*evtInfo, topbar_bbar_p4, sys);
        m_topbar_Wminus_decay0_p4.set(*evtInfo, topbar_Wminus_decay0_p4, sys);
        m_topbar_Wminus_decay1_p4.set(*evtInfo, topbar_Wminus_decay1_p4, sys);
      }
    }
    if (hyperTopology == EventReco::HyPERTopology::TtbarLJets) {
      std::vector<std::string> recoLabels = m_hyperParser->getLabels();
      std::vector<std::vector<int>> recoIndices = m_hyperParser->getIndices();
      std::vector<float> recoScores = m_hyperParser->getScores();
      std::vector<std::vector<int>> recoIDs = m_hyperParser->getIds();
      float class_score = m_hyperParser->getClassificationScore();
      // Classification score
      m_hyper_TtbarLJets_Classification_Score.set(*evtInfo, class_score, sys);
      // HyPER_Reco_TopHad
      std::size_t indexTopHad =
          getIndexFromLabel(recoLabels, "HyPER_Reco_TopHad");
      ANA_MSG_DEBUG("Index of HyPER_Reco_TopHad: " << indexTopHad);
      std::vector<int> topHadIndices = recoIndices[indexTopHad];
      m_hyper_TtbarLJets_TopHad_Indices.set(*evtInfo, topHadIndices, sys);
      m_hyper_TtbarLJets_TopHad_Score.set(*evtInfo, recoScores[indexTopHad],
                                          sys);
      m_hyper_TtbarLJets_TopHad_IDs.set(*evtInfo, recoIDs[indexTopHad], sys);
      // HyPER_Reco_TopLep
      std::size_t indexTopLep =
          getIndexFromLabel(recoLabels, "HyPER_Reco_TopLep");
      ANA_MSG_DEBUG("Index of HyPER_Reco_TopLep: " << indexTopLep);
      std::vector<int> topLepIndices = recoIndices[indexTopLep];
      std::vector<int> topLepIDs = recoIDs[indexTopLep];
      m_hyper_TtbarLJets_TopLep_Indices.set(*evtInfo, topLepIndices, sys);
      m_hyper_TtbarLJets_TopLep_Score.set(*evtInfo, recoScores[indexTopLep],
                                          sys);
      m_hyper_TtbarLJets_TopLep_IDs.set(*evtInfo, topLepIDs, sys);
      // HyPER_Reco_WHad
      std::size_t indexWHad = getIndexFromLabel(recoLabels, "HyPER_Reco_WHad");
      ANA_MSG_DEBUG("Index of HyPER_Reco_WHad: " << indexWHad);
      std::vector<int> wHadIndices = recoIndices[indexWHad];
      m_hyper_TtbarLJets_WHad_Indices.set(*evtInfo, wHadIndices, sys);
      m_hyper_TtbarLJets_WHad_Score.set(*evtInfo, recoScores[indexWHad], sys);
      // HyPER_Reco_WLep
      std::size_t indexWLep = getIndexFromLabel(recoLabels, "HyPER_Reco_WLep");
      ANA_MSG_DEBUG("Index of HyPER_Reco_WLep: " << indexWLep);
      m_hyper_TtbarLJets_WLep_Indices.set(*evtInfo, recoIndices[indexWLep],
                                          sys);
      m_hyper_TtbarLJets_WLep_Score.set(*evtInfo, recoScores[indexWLep], sys);
 
      // Build 4-vectors for TtbarLJets
      PtEtaPhiMVector tophad_b_p4 = invalidRecoParton();
      PtEtaPhiMVector tophad_w_decay0_p4 = invalidRecoParton();
      PtEtaPhiMVector tophad_w_decay1_p4 = invalidRecoParton();
      PtEtaPhiMVector toplep_b_p4 = invalidRecoParton();
      PtEtaPhiMVector toplep_lep_p4 = invalidRecoParton();
 
      buildTopP4TtbarLJets(topHadIndices, wHadIndices, topLepIndices, topLepIDs,
                           tophad_b_p4, tophad_w_decay0_p4, tophad_w_decay1_p4,
                           toplep_b_p4, toplep_lep_p4);
 
      if (!m_tophad_b_p4.empty())
        m_tophad_b_p4.set(*evtInfo, tophad_b_p4, sys);
      if (!m_tophad_w_decay0_p4.empty())
        m_tophad_w_decay0_p4.set(*evtInfo, tophad_w_decay0_p4, sys);
      if (!m_tophad_w_decay1_p4.empty())
        m_tophad_w_decay1_p4.set(*evtInfo, tophad_w_decay1_p4, sys);
      if (!m_toplep_b_p4.empty())
        m_toplep_b_p4.set(*evtInfo, toplep_b_p4, sys);
      if (!m_toplep_lep_p4.empty())
        m_toplep_lep_p4.set(*evtInfo, toplep_lep_p4, sys);
    }
    if (hyperTopology == EventReco::HyPERTopology::TtbarDiLepton) {
      std::vector<std::string> recoLabels = m_hyperParser->getLabels();
      std::vector<std::vector<int>> recoIndices = m_hyperParser->getIndices();
      std::vector<float> recoScores = m_hyperParser->getScores();
      std::vector<std::vector<int>> recoIDs = m_hyperParser->getIds();
      float class_score = m_hyperParser->getClassificationScore();
      PtEtaPhiMVector topBP4 = invalidRecoParton();
      PtEtaPhiMVector topbarBbarP4 = invalidRecoParton();
      PtEtaPhiMVector topLepP4 = invalidRecoParton();
      PtEtaPhiMVector topbarLepbarP4 = invalidRecoParton();
      // Classification score
      m_hyper_TtbarDiLepton_Classification_Score.set(*evtInfo, class_score,
                                                     sys);
      // HyPER_Reco_Top1
      std::size_t index = getIndexFromLabel(recoLabels, "HyPER_Reco_Top1");
      m_hyper_TtbarDiLepton_Top1_Indices.set(*evtInfo, recoIndices[index], sys);
      m_hyper_TtbarDiLepton_Top1_Score.set(*evtInfo, recoScores[index], sys);
      m_hyper_TtbarDiLepton_Top1_IDs.set(*evtInfo, recoIDs[index], sys);
 
      PtEtaPhiMVector candidateBJetP4 = invalidRecoParton();
      PtEtaPhiMVector candidateLeptonP4 = invalidRecoParton();
      float analyserCharge = 0.;
      if (buildDileptonPartialCandidate(recoIndices[index], recoIDs[index],
                                        candidateBJetP4, candidateLeptonP4,
                                        analyserCharge)) {
        if (analyserCharge > 0.) {
          topBP4 = candidateBJetP4;
          topLepP4 = candidateLeptonP4;
        } else if (analyserCharge < 0.) {
          topbarBbarP4 = candidateBJetP4;
          topbarLepbarP4 = candidateLeptonP4;
        }
      }
 
      // HyPER_Reco_Top2
      index = getIndexFromLabel(recoLabels, "HyPER_Reco_Top2");
      m_hyper_TtbarDiLepton_Top2_Indices.set(*evtInfo, recoIndices[index], sys);
      m_hyper_TtbarDiLepton_Top2_Score.set(*evtInfo, recoScores[index], sys);
      m_hyper_TtbarDiLepton_Top2_IDs.set(*evtInfo, recoIDs[index], sys);
 
      candidateBJetP4 = invalidRecoParton();
      candidateLeptonP4 = invalidRecoParton();
      analyserCharge = 0.;
      if (buildDileptonPartialCandidate(recoIndices[index], recoIDs[index],
                                        candidateBJetP4, candidateLeptonP4,
                                        analyserCharge)) {
        if (analyserCharge > 0.) {
          topBP4 = candidateBJetP4;
          topLepP4 = candidateLeptonP4;
        } else if (analyserCharge < 0.) {
          topbarBbarP4 = candidateBJetP4;
          topbarLepbarP4 = candidateLeptonP4;
        }
      }
 
      // HyPER_HE_Score
      index = getIndexFromLabel(recoLabels, "HyPER_Reco_HE");
      m_hyper_TtbarDiLepton_HE_Score.set(*evtInfo, recoScores[index], sys);
 
      if (!m_top_b_p4.empty())
        m_top_b_p4.set(*evtInfo, topBP4, sys);
      if (!m_topbar_bbar_p4.empty())
        m_topbar_bbar_p4.set(*evtInfo, topbarBbarP4, sys);
      if (!m_top_lep_p4.empty())
        m_top_lep_p4.set(*evtInfo, topLepP4, sys);
      if (!m_topbar_lepbar_p4.empty())
        m_topbar_lepbar_p4.set(*evtInfo, topbarLepbarP4, sys);
    }
 
    // Clear the graph and other relevant objects for the next event
    ANA_MSG_DEBUG("Cleaning HyPER objects for next event.");
    m_hyperGraph->clearGraph();
    m_hyperModel->clearInputs();
    m_hyperModel->clearOutputs();
    m_hyperParser->clear();
    m_hyperInputs.clear();
    ANA_MSG_DEBUG("Clean successful.");
 
    lockAllDecorations();
  }
  return StatusCode::SUCCESS;
}

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

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

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 89 of file AthCommonAlgorithm.cxx.

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

fileExecute()

StatusCode EL::AnaAlgorithm::fileExecute ( )

protectedinherited

perform the action exactly once for each file in the dataset

Ideally you don't use this, but instead rely on meta-data tools instead. However, there are enough people asking for it that I decided to implement it anyways.

Warning

To use this you have to call requestFileExecute to use this.

The user should not expect this to be called at any particular point in execution. If a file is split between multiple jobs this will be called in only one of these jobs, and not the others. It usually gets called before the first event in a file, but that is not guaranteed and relying on this is a bug.

The execution order of beginInputFile and fileExecute is currently unspecified.

fileExecute does not work with sub-file splitting in Athena, i.e. processing half the events of a file in one job the other half in another job. this should not normally happen, unless you do crazy things like run AthenaMP or explicitly select sub-file splitting in panda. in that case you are on your own.

Definition at line 345 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

filterPassed()

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

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

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

finalize()

StatusCode EventReco::RunHyPERAlg::finalize ( )

overridevirtual

Definition at line 1308 of file RunHyPERAlg.cxx.

                                 {
  ANA_MSG_INFO("Finalizing RunHyPER");
  return StatusCode::SUCCESS;
}

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 438 of file AthHistogramming.cxx.

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

handle()

void EL::AnaAlgorithm::handle ( const Incident & inc )

inherited

receive the given incident

Guarantee

basic

Failures

incident handling errors

Definition at line 523 of file AnaAlgorithm.cxx.

  {
    if (inc.type() == IncidentType::BeginInputFile)
    {
      if (m_hasBeginInputFile)
        ANA_CHECK_THROW (beginInputFile ());
      if (m_hasFileExecute)
        ANA_CHECK_THROW (fileExecute ());
    } else if (inc.type() == IncidentType::EndInputFile)
    {
      if (m_hasEndInputFile)
        ANA_CHECK_THROW (endInputFile ());
    } else
    {
      ATH_MSG_WARNING( "Unknown incident type received: " << inc.type() );
    }
  }

hash()

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

inlineprivateinherited

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

Definition at line 422 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 182 of file AthHistogramming.cxx.

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

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 363 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 380 of file AthHistogramming.h.

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

histSvc()

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

inlineinherited

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

Definition at line 113 of file AthHistogramAlgorithm.h.

{
  return m_histSvc;
}

initialize()

StatusCode EventReco::RunHyPERAlg::initialize ( )

overridevirtual

Definition at line 39 of file RunHyPERAlg.cxx.

                                   {
  ANA_MSG_INFO("Initializing RunHyPER " << name());
  ANA_MSG_INFO("  --> topology: " << m_topology.value());
  ANA_MSG_INFO("  --> btagger: " << m_btagger.value());
  ANA_MSG_INFO("  --> debug level: " << static_cast<int>(this->msg().level()));
  ANA_MSG_INFO("  --> full log event number: " << m_fullLogEventNumber.value());
 
  // Retrieve the ONNX inference tools, one per cross-validation fold
  ANA_CHECK(m_onnxToolTrainedOnEven.retrieve());
  ANA_CHECK(m_onnxToolTrainedOnOdd.retrieve());
 
  // Load the b-tagging decoration
  m_btagDecorName = "ftag_quantile_" + m_btagger.value();
  m_bTagDecoAcc = std::make_unique<SG::ConstAccessor<int>>(m_btagDecorName);
 
  // Parse topology
  HyPERTopology hyperTopology = strToHyPERTopology(m_topology.value());
  if (hyperTopology == EventReco::HyPERTopology::NotSelected) {
    ANA_MSG_ERROR("Unrecognized HyPER topology: " << m_topology.value());
    return StatusCode::FAILURE;
  }
  m_hyperTopology = hyperTopology;
  m_ljetsUseBTag = (m_topology.value() == "TtbarLJets");
 
  // Initialise object containers
  ANA_CHECK(m_electronsHandle.initialize(m_systematicsList));
  ANA_CHECK(m_muonsHandle.initialize(m_systematicsList));
  ANA_CHECK(m_jetsHandle.initialize(m_systematicsList));
  ANA_CHECK(m_metHandle.initialize(m_systematicsList));
  ANA_CHECK(m_eventInfoHandle.initialize(m_systematicsList));
  ANA_CHECK(m_electronSelection.initialize(m_systematicsList, m_electronsHandle,
                                           SG::AllowEmpty));
  ANA_CHECK(m_muonSelection.initialize(m_systematicsList, m_muonsHandle,
                                       SG::AllowEmpty));
  ANA_CHECK(m_jetSelection.initialize(m_systematicsList, m_jetsHandle,
                                      SG::AllowEmpty));
  // Intialise pre-selection
  ANA_CHECK(m_selection.initialize(m_systematicsList, m_eventInfoHandle,
                                   SG::AllowEmpty));
 
  // Decorations (topology dependent)
  if (hyperTopology == EventReco::HyPERTopology::TtbarAllHadronic) {
    ANA_CHECK(m_hyper_TtbarAllHadronic_Top1_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_Top1_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_Top2_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_Top2_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_W1_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_W1_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_W2_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarAllHadronic_W2_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_top_b_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                    SG::AllowEmpty));
    ANA_CHECK(m_topbar_bbar_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                          SG::AllowEmpty));
    ANA_CHECK(m_top_Wplus_decay0_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_top_Wplus_decay1_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_topbar_Wminus_decay0_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_topbar_Wminus_decay1_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
  }
  if (hyperTopology == EventReco::HyPERTopology::TtbarLJets) {
    ANA_CHECK(m_hyper_TtbarLJets_Classification_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopHad_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopLep_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_WHad_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_WLep_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopHad_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopLep_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_WHad_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_WLep_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopHad_IDs.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarLJets_TopLep_IDs.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_toplep_b_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                       SG::AllowEmpty));
    ANA_CHECK(m_toplep_lep_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                         SG::AllowEmpty));
    ANA_CHECK(m_tophad_b_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                       SG::AllowEmpty));
    ANA_CHECK(m_tophad_w_decay0_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_tophad_w_decay1_p4.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
  }
  if (hyperTopology == EventReco::HyPERTopology::TtbarDiLepton) {
    ANA_CHECK(m_hyper_TtbarDiLepton_Classification_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top1_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top2_Indices.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top1_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top2_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top1_IDs.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_Top2_IDs.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_hyper_TtbarDiLepton_HE_Score.initialize(
        m_systematicsList, m_eventInfoHandle, SG::AllowEmpty));
    ANA_CHECK(m_top_b_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                    SG::AllowEmpty));
    ANA_CHECK(m_topbar_bbar_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                          SG::AllowEmpty));
    ANA_CHECK(m_top_lep_p4.initialize(m_systematicsList, m_eventInfoHandle,
                                      SG::AllowEmpty));
    ANA_CHECK(m_topbar_lepbar_p4.initialize(m_systematicsList,
                                            m_eventInfoHandle, SG::AllowEmpty));
  }
 
  // Initialise systematics
  ANA_CHECK(m_systematicsList.initialize());
 
  // Initialise the correct HyPER model
  if (hyperTopology == EventReco::HyPERTopology::TtbarLJets) {
    ANA_MSG_INFO("Loading HyPER model.");
    m_hyperModel = std::make_unique<EventReco::HyPERTtbarLJetsModel>(
        &(*m_onnxToolTrainedOnEven), &(*m_onnxToolTrainedOnOdd));
    ANA_MSG_INFO("Loaded TtbarLJets HyPER model!");
 
    ANA_MSG_DEBUG("Initialising HyPERParser");
    m_hyperParser = std::make_unique<EventReco::HyPERTtbarLJetsParser>();
    ANA_MSG_DEBUG("Initialised HyPERParserTtbarLJets Parser");
 
  } else if (hyperTopology == EventReco::HyPERTopology::TtbarAllHadronic) {
    ANA_MSG_INFO("Loading HyPER model.");
    m_hyperModel = std::make_unique<EventReco::HyPERTtbarAllHadronicModel>(
        &(*m_onnxToolTrainedOnEven), &(*m_onnxToolTrainedOnOdd));
    ANA_MSG_INFO("Loaded TtbarAllHadronic HyPER model!");
 
    ANA_MSG_DEBUG("Initialising HyPERParser");
    m_hyperParser = std::make_unique<EventReco::HyPERTtbarAllHadronicParser>();
    ANA_MSG_DEBUG("Initialised HyPERParserTtbarAllHadronic Parser");
  } else if (hyperTopology == EventReco::HyPERTopology::TtbarDiLepton) {
    ANA_MSG_INFO("Loading HyPER model.");
    m_hyperModel = std::make_unique<EventReco::HyPERTtbarDiLeptonModel>(
        &(*m_onnxToolTrainedOnEven), &(*m_onnxToolTrainedOnOdd));
    ANA_MSG_INFO("Loaded TtbarDiLepton HyPER model!");
 
    ANA_MSG_DEBUG("Initialising HyPERParser");
    m_hyperParser = std::make_unique<EventReco::HyPERTtbarDiLeptonParser>();
    ANA_MSG_DEBUG("Initialised HyPERTtbarDiLepton Parser");
  }
 
  // Resolve the ONNX node names of the selected topology
  ANA_CHECK(m_hyperModel->initialize());
 
  // Initialisation of the HyPERGraph
  ANA_MSG_DEBUG("Initialising HyPERGraph");
  m_hyperGraph = std::make_unique<EventReco::HyPERGraph>();
  ANA_MSG_DEBUG("Initialised HyPERGraph");
 
  return StatusCode::SUCCESS;
}

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

inputMetaStore() [1/2]

AnaAlgorithm::MetaStorePtr_t EL::AnaAlgorithm::inputMetaStore ( )

inherited

Definition at line 75 of file AnaAlgorithm.cxx.

  {
#ifdef XAOD_STANDALONE
     return &m_inputMetaStore;
#else
     return m_inputMetaStore;
#endif // XAOD_STANDALONE
  }

inputMetaStore() [2/2]

AnaAlgorithm::ConstMetaStorePtr_t EL::AnaAlgorithm::inputMetaStore ( ) const

inherited

Accessor for the input metadata store

Definition at line 66 of file AnaAlgorithm.cxx.

  {
#ifdef XAOD_STANDALONE
     return &m_inputMetaStore;
#else
     return m_inputMetaStore;
#endif // XAOD_STANDALONE
  }

isClonable()

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

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

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

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

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

{ return false; }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

outputMetaStore() [1/2]

AnaAlgorithm::MetaStorePtr_t EL::AnaAlgorithm::outputMetaStore ( )

inherited

Definition at line 95 of file AnaAlgorithm.cxx.

  {
#ifdef XAOD_STANDALONE
     return &m_outputMetaStore;
#else
     return m_outputMetaStore;
#endif // XAOD_STANDALONE
  }

outputMetaStore() [2/2]

AnaAlgorithm::ConstMetaStorePtr_t EL::AnaAlgorithm::outputMetaStore ( ) const

inherited

Accessor for the output metadata store

Definition at line 86 of file AnaAlgorithm.cxx.

  {
#ifdef XAOD_STANDALONE
     return &m_outputMetaStore;
#else
     return m_outputMetaStore;
#endif // XAOD_STANDALONE
  }

print()

void EL::AnaAlgorithm::print ( ) const

protectedvirtualinherited

print the state of the algorithm

This is mostly to allow algorithms to add a little debugging information if they feel like it.

Definition at line 339 of file AnaAlgorithm.cxx.

  {}

renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

requestBeginInputFile()

StatusCode EL::AnaAlgorithm::requestBeginInputFile ( )

inherited

register this algorithm to have an implementation of beginInputFile

Guarantee

strong

Failures

beginInputFile not supported

Definition at line 264 of file AnaAlgorithm.cxx.

  {
    m_hasBeginInputFile = true;
 
#ifndef XAOD_STANDALONE
    // Connect to the IncidentSvc:
    ServiceHandle< IIncidentSvc > incSvc( "IncidentSvc", name() );
    ATH_CHECK( incSvc.retrieve() );
 
    // Set up the right callback, but ensure we don't double-register
    // if we are called twice
    incSvc->removeListener( this, IncidentType::BeginInputFile );
    incSvc->addListener( this, IncidentType::BeginInputFile, 0, true );
#endif
 
    return StatusCode::SUCCESS;
  }

requestEndInputFile()

StatusCode EL::AnaAlgorithm::requestEndInputFile ( )

inherited

register this algorithm to have an implementation of endInputFile

Guarantee

strong

Failures

endInputFile not supported

Definition at line 285 of file AnaAlgorithm.cxx.

  {
    m_hasEndInputFile = true;
 
#ifndef XAOD_STANDALONE
    // Connect to the IncidentSvc:
    ServiceHandle< IIncidentSvc > incSvc( "IncidentSvc", name() );
    ATH_CHECK( incSvc.retrieve() );
 
    // Set up the right callback, but ensure we don't double-register
    // if we are called twice
    incSvc->removeListener( this, IncidentType::EndInputFile );
    incSvc->addListener( this, IncidentType::EndInputFile, 0, true );
#endif
 
    return StatusCode::SUCCESS;
  }

requestFileExecute()

StatusCode EL::AnaAlgorithm::requestFileExecute ( )

inherited

register this algorithm to have an implementation of fileexecute

Guarantee

strong

Failures

fileExecute not supported

Definition at line 243 of file AnaAlgorithm.cxx.

  {
    m_hasFileExecute = true;
 
#ifndef XAOD_STANDALONE
    // Connect to the IncidentSvc:
    ServiceHandle< IIncidentSvc > incSvc( "IncidentSvc", name() );
    ATH_CHECK( incSvc.retrieve() );
 
    // Set up the right callback, but ensure we don't double-register
    // if we are called twice
    incSvc->removeListener( this, IncidentType::BeginInputFile );
    incSvc->addListener( this, IncidentType::BeginInputFile, 0, true );
#endif
 
    return StatusCode::SUCCESS;
  }

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Reimplemented in AthFilterAlgorithm.

Definition at line 99 of file AthCommonAlgorithm.h.

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

sysExecute()

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

overridevirtualinherited

Execute an algorithm.

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

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthCommonAlgorithm< Gaudi::Algorithm >.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

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

sysStart()

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

overridevirtualinherited

Handle START transition.

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

tree()

TTree * AthHistogramming::tree ( const std::string & treeName, const std::string & tDir = "", const std::string & stream = "" )

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 333 of file AthHistogramming.cxx.

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

updateVHKA()

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

inlineinherited

Definition at line 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_bTagDecoAcc

std::unique_ptr<SG::ConstAccessor<int> > EventReco::RunHyPERAlg::m_bTagDecoAcc

private

Definition at line 374 of file RunHyPERAlg.h.

m_btagDecorName

std::string EventReco::RunHyPERAlg::m_btagDecorName

private

Definition at line 126 of file RunHyPERAlg.h.

m_btagger

Gaudi::Property<std::string> EventReco::RunHyPERAlg::m_btagger

private

Initial value:

{
      this, "btagger", "GN2v01_Continuous",
      "Name of the b-tagger and working point for jets. The "
      "'ftag_quantile_' prefix is added internally."}

Definition at line 120 of file RunHyPERAlg.h.

                                    {
      this, "btagger", "GN2v01_Continuous",
      "Name of the b-tagger and working point for jets. The "
      "'ftag_quantile_' prefix is added internally."};

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 202 of file AthHistogramming.h.

m_electronSelection

CP::SysReadSelectionHandle EventReco::RunHyPERAlg::m_electronSelection

private

Initial value:

{
      this, "electronSelection", "", "The selection on the input electrons."}

Definition at line 162 of file RunHyPERAlg.h.

                                              {
      this, "electronSelection", "", "The selection on the input electrons."};

m_electronsHandle

CP::SysReadHandle<xAOD::ElectronContainer> EventReco::RunHyPERAlg::m_electronsHandle

private

Initial value:

{
      this, "electrons", "", "The electron container to use."}

Definition at line 160 of file RunHyPERAlg.h.

                                                          {
      this, "electrons", "", "The electron container to use."};

m_eventInfoHandle

CP::SysReadHandle<xAOD::EventInfo> EventReco::RunHyPERAlg::m_eventInfoHandle

private

Initial value:

{
      this, "eventInfo", "EventInfo",
      "The EventInfo container to read selection decisions from."}

Definition at line 178 of file RunHyPERAlg.h.

                                                  {
      this, "eventInfo", "EventInfo",
      "The EventInfo container to read selection decisions from."};

m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_fullLogEventNumber

Gaudi::Property<long unsigned int> EventReco::RunHyPERAlg::m_fullLogEventNumber

private

Initial value:

{
      this, "fullLogEventNumber", 0,
      "Number of the event to log in full detail"}

Definition at line 146 of file RunHyPERAlg.h.

                                                       {
      this, "fullLogEventNumber", 0,
      "Number of the event to log in full detail"};

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 216 of file AthHistogramming.h.

m_hasBeginInputFile

bool EL::AnaAlgorithm::m_hasBeginInputFile {false}

privateinherited

the value of hasBeginInputFile

Definition at line 608 of file AnaAlgorithm.h.

{false};

m_hasEndInputFile

bool EL::AnaAlgorithm::m_hasEndInputFile {false}

privateinherited

the value of hasEndInputFile

Definition at line 612 of file AnaAlgorithm.h.

{false};

m_hasFileExecute

bool EL::AnaAlgorithm::m_hasFileExecute {false}

privateinherited

the value of hasFileExecute

Definition at line 604 of file AnaAlgorithm.h.

{false};

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 195 of file AthHistogramming.h.

m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix

privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix

privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc

privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix

privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix

privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

m_hyper_TtbarAllHadronic_Top1_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_Top1_Indices

private

Initial value:

{
          this, "TtbarAllHadronic_HyPER_Top1_Indices",
          "TtbarAllHadronic_HyPER_Top1_Indices_%SYS%",
          "Indices of the reconstructed top1 in the ttbar all-hadronic "
          "topology"}

Definition at line 191 of file RunHyPERAlg.h.

                                           {
          this, "TtbarAllHadronic_HyPER_Top1_Indices",
          "TtbarAllHadronic_HyPER_Top1_Indices_%SYS%",
          "Indices of the reconstructed top1 in the ttbar all-hadronic "
          "topology"};

m_hyper_TtbarAllHadronic_Top1_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_Top1_Score

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_Top1_Score",
      "TtbarAllHadronic_HyPER_Top1_Score_%SYS%",
      "Score of the reconstructed top1 in the ttbar all-hadronic topology"}

Definition at line 211 of file RunHyPERAlg.h.

                                                                  {
      this, "TtbarAllHadronic_HyPER_Top1_Score",
      "TtbarAllHadronic_HyPER_Top1_Score_%SYS%",
      "Score of the reconstructed top1 in the ttbar all-hadronic topology"};

m_hyper_TtbarAllHadronic_Top2_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_Top2_Indices

private

Initial value:

{
          this, "TtbarAllHadronic_HyPER_Top2_Indices",
          "TtbarAllHadronic_HyPER_Top2_Indices_%SYS%",
          "Indices of the reconstructed top2 in the ttbar all-hadronic "
          "topology"}

Definition at line 197 of file RunHyPERAlg.h.

                                           {
          this, "TtbarAllHadronic_HyPER_Top2_Indices",
          "TtbarAllHadronic_HyPER_Top2_Indices_%SYS%",
          "Indices of the reconstructed top2 in the ttbar all-hadronic "
          "topology"};

m_hyper_TtbarAllHadronic_Top2_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_Top2_Score

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_Top2_Score",
      "TtbarAllHadronic_HyPER_Top2_Score_%SYS%",
      "Score of the reconstructed top2 in the ttbar all-hadronic topology"}

Definition at line 215 of file RunHyPERAlg.h.

                                                                  {
      this, "TtbarAllHadronic_HyPER_Top2_Score",
      "TtbarAllHadronic_HyPER_Top2_Score_%SYS%",
      "Score of the reconstructed top2 in the ttbar all-hadronic topology"};

m_hyper_TtbarAllHadronic_W1_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_W1_Indices

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_W1_Indices",
      "TtbarAllHadronic_HyPER_W1_Indices_%SYS%",
      "Indices of the reconstructed W1 in the ttbar all-hadronic topology"}

Definition at line 202 of file RunHyPERAlg.h.

                                                                           {
      this, "TtbarAllHadronic_HyPER_W1_Indices",
      "TtbarAllHadronic_HyPER_W1_Indices_%SYS%",
      "Indices of the reconstructed W1 in the ttbar all-hadronic topology"};

m_hyper_TtbarAllHadronic_W1_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_W1_Score

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_W1_Score",
      "TtbarAllHadronic_HyPER_W1_Score_%SYS%",
      "Score of the reconstructed W1 in the ttbar all-hadronic topology"}

Definition at line 219 of file RunHyPERAlg.h.

                                                                {
      this, "TtbarAllHadronic_HyPER_W1_Score",
      "TtbarAllHadronic_HyPER_W1_Score_%SYS%",
      "Score of the reconstructed W1 in the ttbar all-hadronic topology"};

m_hyper_TtbarAllHadronic_W2_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_W2_Indices

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_W2_Indices",
      "TtbarAllHadronic_HyPER_W2_Indices_%SYS%",
      "Indices of the reconstructed W2 in the ttbar all-hadronic topology"}

Definition at line 206 of file RunHyPERAlg.h.

                                                                           {
      this, "TtbarAllHadronic_HyPER_W2_Indices",
      "TtbarAllHadronic_HyPER_W2_Indices_%SYS%",
      "Indices of the reconstructed W2 in the ttbar all-hadronic topology"};

m_hyper_TtbarAllHadronic_W2_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarAllHadronic_W2_Score

private

Initial value:

{
      this, "TtbarAllHadronic_HyPER_W2_Score",
      "TtbarAllHadronic_HyPER_W2_Score_%SYS%",
      "Score of the reconstructed W2 in the ttbar all-hadronic topology"}

Definition at line 223 of file RunHyPERAlg.h.

                                                                {
      this, "TtbarAllHadronic_HyPER_W2_Score",
      "TtbarAllHadronic_HyPER_W2_Score_%SYS%",
      "Score of the reconstructed W2 in the ttbar all-hadronic topology"};

m_hyper_TtbarDiLepton_Classification_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Classification_Score

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Classification_Score",
      "TtbarDiLepton_HyPER_Classification_Score_%SYS%",
      "Classification score of the ttbar di-lepton topology"}

Definition at line 320 of file RunHyPERAlg.h.

                                                                         {
      this, "TtbarDiLepton_HyPER_Classification_Score",
      "TtbarDiLepton_HyPER_Classification_Score_%SYS%",
      "Classification score of the ttbar di-lepton topology"};

m_hyper_TtbarDiLepton_HE_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_HE_Score

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_HE_Score",
      "TtbarDiLepton_HyPER_HE_Score_%SYS%",
      "HE score of the ttbar di-lepton topology"}

Definition at line 354 of file RunHyPERAlg.h.

                                                             {
      this, "TtbarDiLepton_HyPER_HE_Score",
      "TtbarDiLepton_HyPER_HE_Score_%SYS%",
      "HE score of the ttbar di-lepton topology"};

m_hyper_TtbarDiLepton_Top1_IDs

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top1_IDs

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top1_IDs",
      "TtbarDiLepton_HyPER_Top1_IDs_%SYS%",
      "IDs of the reconstructed top1 in the ttbar di-lepton topology"}

Definition at line 345 of file RunHyPERAlg.h.

                                                                      {
      this, "TtbarDiLepton_HyPER_Top1_IDs",
      "TtbarDiLepton_HyPER_Top1_IDs_%SYS%",
      "IDs of the reconstructed top1 in the ttbar di-lepton topology"};

m_hyper_TtbarDiLepton_Top1_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top1_Indices

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top1_Indices",
      "TtbarDiLepton_HyPER_Top1_Indices_%SYS%",
      "Indices of the reconstructed top1 in the ttbar di-lepton "
      "topology"}

Definition at line 325 of file RunHyPERAlg.h.

                                                                          {
      this, "TtbarDiLepton_HyPER_Top1_Indices",
      "TtbarDiLepton_HyPER_Top1_Indices_%SYS%",
      "Indices of the reconstructed top1 in the ttbar di-lepton "
      "topology"};

m_hyper_TtbarDiLepton_Top1_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top1_Score

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top1_Score",
      "TtbarDiLepton_HyPER_Top1_Score_%SYS%",
      "Score of the reconstructed top1 in the ttbar di-lepton topology"}

Definition at line 336 of file RunHyPERAlg.h.

                                                               {
      this, "TtbarDiLepton_HyPER_Top1_Score",
      "TtbarDiLepton_HyPER_Top1_Score_%SYS%",
      "Score of the reconstructed top1 in the ttbar di-lepton topology"};

m_hyper_TtbarDiLepton_Top2_IDs

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top2_IDs

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top2_IDs",
      "TtbarDiLepton_HyPER_Top2_IDs_%SYS%",
      "IDs of the reconstructed top2 in the ttbar di-lepton topology"}

Definition at line 349 of file RunHyPERAlg.h.

                                                                      {
      this, "TtbarDiLepton_HyPER_Top2_IDs",
      "TtbarDiLepton_HyPER_Top2_IDs_%SYS%",
      "IDs of the reconstructed top2 in the ttbar di-lepton topology"};

m_hyper_TtbarDiLepton_Top2_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top2_Indices

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top2_Indices",
      "TtbarDiLepton_HyPER_Top2_Indices_%SYS%",
      "Indices of the reconstructed top2 in the ttbar di-lepton "
      "topology"}

Definition at line 330 of file RunHyPERAlg.h.

                                                                          {
      this, "TtbarDiLepton_HyPER_Top2_Indices",
      "TtbarDiLepton_HyPER_Top2_Indices_%SYS%",
      "Indices of the reconstructed top2 in the ttbar di-lepton "
      "topology"};

m_hyper_TtbarDiLepton_Top2_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarDiLepton_Top2_Score

private

Initial value:

{
      this, "TtbarDiLepton_HyPER_Top2_Score",
      "TtbarDiLepton_HyPER_Top2_Score_%SYS%",
      "Score of the reconstructed top2 in the ttbar di-lepton topology"}

Definition at line 340 of file RunHyPERAlg.h.

                                                               {
      this, "TtbarDiLepton_HyPER_Top2_Score",
      "TtbarDiLepton_HyPER_Top2_Score_%SYS%",
      "Score of the reconstructed top2 in the ttbar di-lepton topology"};

m_hyper_TtbarLJets_Classification_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarLJets_Classification_Score

private

Initial value:

{
      this, "TtbarLJets_HyPER_Classification_Score",
      "TtbarLJets_HyPER_Classification_Score_%SYS%",
      "Classification score of the ttbar single lepton topology"}

Definition at line 248 of file RunHyPERAlg.h.

                                                                      {
      this, "TtbarLJets_HyPER_Classification_Score",
      "TtbarLJets_HyPER_Classification_Score_%SYS%",
      "Classification score of the ttbar single lepton topology"};

m_hyper_TtbarLJets_TopHad_IDs

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopHad_IDs

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopHad_IDs", "TtbarLJets_HyPER_TopHad_IDs_%SYS%",
      "IDs of the reconstructed hadronic top in the ttbar single lepton "
      "topology"}

Definition at line 293 of file RunHyPERAlg.h.

                                                                     {
      this, "TtbarLJets_HyPER_TopHad_IDs", "TtbarLJets_HyPER_TopHad_IDs_%SYS%",
      "IDs of the reconstructed hadronic top in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_TopHad_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopHad_Indices

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopHad_Indices",
      "TtbarLJets_HyPER_TopHad_Indices_%SYS%",
      "Indices of the reconstructed hadronic top in the ttbar single "
      "lepton topology"}

Definition at line 253 of file RunHyPERAlg.h.

                                                                         {
      this, "TtbarLJets_HyPER_TopHad_Indices",
      "TtbarLJets_HyPER_TopHad_Indices_%SYS%",
      "Indices of the reconstructed hadronic top in the ttbar single "
      "lepton topology"};

m_hyper_TtbarLJets_TopHad_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopHad_Score

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopHad_Score",
      "TtbarLJets_HyPER_TopHad_Score_%SYS%",
      "Score of the reconstructed hadronic top in the ttbar single lepton "
      "topology"}

Definition at line 274 of file RunHyPERAlg.h.

                                                              {
      this, "TtbarLJets_HyPER_TopHad_Score",
      "TtbarLJets_HyPER_TopHad_Score_%SYS%",
      "Score of the reconstructed hadronic top in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_TopLep_IDs

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopLep_IDs

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopLep_IDs", "TtbarLJets_HyPER_TopLep_IDs_%SYS%",
      "IDs of the reconstructed leptonic top in the ttbar single lepton "
      "topology"}

Definition at line 297 of file RunHyPERAlg.h.

                                                                     {
      this, "TtbarLJets_HyPER_TopLep_IDs", "TtbarLJets_HyPER_TopLep_IDs_%SYS%",
      "IDs of the reconstructed leptonic top in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_TopLep_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopLep_Indices

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopLep_Indices",
      "TtbarLJets_HyPER_TopLep_Indices_%SYS%",
      "Indices of the reconstructed leptonic top in the ttbar single "
      "lepton topology"}

Definition at line 258 of file RunHyPERAlg.h.

                                                                         {
      this, "TtbarLJets_HyPER_TopLep_Indices",
      "TtbarLJets_HyPER_TopLep_Indices_%SYS%",
      "Indices of the reconstructed leptonic top in the ttbar single "
      "lepton topology"};

m_hyper_TtbarLJets_TopLep_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarLJets_TopLep_Score

private

Initial value:

{
      this, "TtbarLJets_HyPER_TopLep_Score",
      "TtbarLJets_HyPER_TopLep_Score_%SYS%",
      "Score of the reconstructed leptonic top in the ttbar single lepton "
      "topology"}

Definition at line 279 of file RunHyPERAlg.h.

                                                              {
      this, "TtbarLJets_HyPER_TopLep_Score",
      "TtbarLJets_HyPER_TopLep_Score_%SYS%",
      "Score of the reconstructed leptonic top in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_WHad_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_WHad_Indices

private

Initial value:

{
      this, "TtbarLJets_HyPER_WHad_Indices",
      "TtbarLJets_HyPER_WHad_Indices_%SYS%",
      "Indices of the reconstructed hadronic W in the ttbar single lepton "
      "topology"}

Definition at line 263 of file RunHyPERAlg.h.

                                                                       {
      this, "TtbarLJets_HyPER_WHad_Indices",
      "TtbarLJets_HyPER_WHad_Indices_%SYS%",
      "Indices of the reconstructed hadronic W in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_WHad_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarLJets_WHad_Score

private

Initial value:

{
      this, "TtbarLJets_HyPER_WHad_Score", "TtbarLJets_HyPER_WHad_Score_%SYS%",
      "Score of the reconstructed hadronic W in the ttbar single lepton "
      "topology"}

Definition at line 284 of file RunHyPERAlg.h.

                                                            {
      this, "TtbarLJets_HyPER_WHad_Score", "TtbarLJets_HyPER_WHad_Score_%SYS%",
      "Score of the reconstructed hadronic W in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_WLep_Indices

CP::SysWriteDecorHandle<std::vector<int> > EventReco::RunHyPERAlg::m_hyper_TtbarLJets_WLep_Indices

private

Initial value:

{
      this, "TtbarLJets_HyPER_WLep_Indices",
      "TtbarLJets_HyPER_WLep_Indices_%SYS%",
      "Indices of the reconstructed leptonic W in the ttbar single lepton "
      "topology"}

Definition at line 268 of file RunHyPERAlg.h.

                                                                       {
      this, "TtbarLJets_HyPER_WLep_Indices",
      "TtbarLJets_HyPER_WLep_Indices_%SYS%",
      "Indices of the reconstructed leptonic W in the ttbar single lepton "
      "topology"};

m_hyper_TtbarLJets_WLep_Score

CP::SysWriteDecorHandle<float> EventReco::RunHyPERAlg::m_hyper_TtbarLJets_WLep_Score

private

Initial value:

{
      this, "TtbarLJets_HyPER_WLep_Score", "TtbarLJets_HyPER_WLep_Score_%SYS%",
      "Score of the reconstructed leptonic W in the ttbar single lepton "
      "topology"}

Definition at line 288 of file RunHyPERAlg.h.

                                                            {
      this, "TtbarLJets_HyPER_WLep_Score", "TtbarLJets_HyPER_WLep_Score_%SYS%",
      "Score of the reconstructed leptonic W in the ttbar single lepton "
      "topology"};

m_hyperGraph

std::unique_ptr<HyPERGraph> EventReco::RunHyPERAlg::m_hyperGraph

private

Definition at line 140 of file RunHyPERAlg.h.

m_hyperInputs

InputsPack EventReco::RunHyPERAlg::m_hyperInputs {}

private

Definition at line 142 of file RunHyPERAlg.h.

{};

m_hyperModel

std::unique_ptr<HyPERModel> EventReco::RunHyPERAlg::m_hyperModel

private

Definition at line 138 of file RunHyPERAlg.h.

m_hyperParser

std::unique_ptr<HyPERParser> EventReco::RunHyPERAlg::m_hyperParser

private

Definition at line 144 of file RunHyPERAlg.h.

m_hyperTopology

HyPERTopology EventReco::RunHyPERAlg::m_hyperTopology {HyPERTopology::NotSelected}

private

Definition at line 151 of file RunHyPERAlg.h.

{HyPERTopology::NotSelected};

m_inputMetaStore

MetaStore_t EL::AnaAlgorithm::m_inputMetaStore

privateinherited

Object accessing the input metadata store.

Definition at line 569 of file AnaAlgorithm.h.

m_jetSelection

CP::SysReadSelectionHandle EventReco::RunHyPERAlg::m_jetSelection

private

Initial value:

{this, "jetSelection", "",
                                            "The selection on the input jets."}

Definition at line 172 of file RunHyPERAlg.h.

                                         {this, "jetSelection", "",
                                            "The selection on the input jets."};

m_jetsHandle

CP::SysReadHandle<xAOD::JetContainer> EventReco::RunHyPERAlg::m_jetsHandle

private

Initial value:

{
      this, "jets", "", "The jet container to use."}

Definition at line 170 of file RunHyPERAlg.h.

                                                {
      this, "jets", "", "The jet container to use."};

m_ljetsUseBTag

bool EventReco::RunHyPERAlg::m_ljetsUseBTag {false}

private

Definition at line 153 of file RunHyPERAlg.h.

{false};

m_metHandle

CP::SysReadHandle<xAOD::MissingETContainer> EventReco::RunHyPERAlg::m_metHandle

private

Initial value:

{
      this, "met", "", "The MET container to use."}

Definition at line 175 of file RunHyPERAlg.h.

                                                     {
      this, "met", "", "The MET container to use."};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 242 of file AthHistogramming.h.

m_muonSelection

CP::SysReadSelectionHandle EventReco::RunHyPERAlg::m_muonSelection

private

Initial value:

{
      this, "muonSelection", "", "The selection on the input muons."}

Definition at line 167 of file RunHyPERAlg.h.

                                          {
      this, "muonSelection", "", "The selection on the input muons."};

m_muonsHandle

CP::SysReadHandle<xAOD::MuonContainer> EventReco::RunHyPERAlg::m_muonsHandle

private

Initial value:

{
      this, "muons", "", "The muon container to use."}

Definition at line 165 of file RunHyPERAlg.h.

                                                  {
      this, "muons", "", "The muon container to use."};

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 239 of file AthHistogramming.h.

m_onnxToolTrainedOnEven

ToolHandle<AthOnnx::IOnnxRuntimeInferenceTool> EventReco::RunHyPERAlg::m_onnxToolTrainedOnEven

private

Initial value:

{
      this, "onnxToolTrainedOnEven", "",
      "ONNX inference tool holding the model trained on even-numbered events"}

Definition at line 130 of file RunHyPERAlg.h.

                                                                      {
      this, "onnxToolTrainedOnEven", "",
      "ONNX inference tool holding the model trained on even-numbered events"};

m_onnxToolTrainedOnOdd

ToolHandle<AthOnnx::IOnnxRuntimeInferenceTool> EventReco::RunHyPERAlg::m_onnxToolTrainedOnOdd

private

Initial value:

{
      this, "onnxToolTrainedOnOdd", "",
      "ONNX inference tool holding the model trained on odd-numbered events"}

Definition at line 133 of file RunHyPERAlg.h.

                                                                     {
      this, "onnxToolTrainedOnOdd", "",
      "ONNX inference tool holding the model trained on odd-numbered events"};

m_outputMetaStore

MetaStore_t EL::AnaAlgorithm::m_outputMetaStore

privateinherited

Object accessing the output metadata store.

Definition at line 573 of file AnaAlgorithm.h.

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_selection

CP::SysReadSelectionHandle EventReco::RunHyPERAlg::m_selection

private

Initial value:

{
      this, "eventSelection", "",
      "Name of the selection on which this HyPER instance is allowed to run."}

Definition at line 182 of file RunHyPERAlg.h.

                                      {
      this, "eventSelection", "",
      "Name of the selection on which this HyPER instance is allowed to run."};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 220 of file AthHistogramming.h.

m_systematicsList

CP::SysListHandle EventReco::RunHyPERAlg::m_systematicsList {this}

private

Definition at line 156 of file RunHyPERAlg.h.

{this};

m_top_b_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_top_b_p4

private

Initial value:

{
      this, "top_b_p4", "",
      "Visible top b-jet four-vector for the positive-charge lepton branch"}

Definition at line 359 of file RunHyPERAlg.h.

                                                   {
      this, "top_b_p4", "",
      "Visible top b-jet four-vector for the positive-charge lepton branch"};

m_top_lep_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_top_lep_p4

private

Initial value:

{
      this, "top_lep_p4", "",
      "Top lepton four-vector for the positive-charge lepton branch"}

Definition at line 366 of file RunHyPERAlg.h.

                                                     {
      this, "top_lep_p4", "",
      "Top lepton four-vector for the positive-charge lepton branch"};

m_top_Wplus_decay0_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_top_Wplus_decay0_p4

private

Initial value:

{
      this, "top_Wplus_decay0_p4", "",
      "Visible top W+ leading decay product four-vector associated to the top "
      "quark"}

Definition at line 229 of file RunHyPERAlg.h.

                                                              {
      this, "top_Wplus_decay0_p4", "",
      "Visible top W+ leading decay product four-vector associated to the top "
      "quark"};

m_top_Wplus_decay1_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_top_Wplus_decay1_p4

private

Initial value:

{
      this, "top_Wplus_decay1_p4", "",
      "Visible top W+ subleading decay product four-vector associated to the "
      "top quark"}

Definition at line 233 of file RunHyPERAlg.h.

                                                              {
      this, "top_Wplus_decay1_p4", "",
      "Visible top W+ subleading decay product four-vector associated to the "
      "top quark"};

m_topbar_bbar_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_topbar_bbar_p4

private

Initial value:

{
      this, "topbar_bbar_p4", "",
      "Visible anti-top bbar-jet four-vector for the negative-charge lepton "
      "branch"}

Definition at line 362 of file RunHyPERAlg.h.

                                                         {
      this, "topbar_bbar_p4", "",
      "Visible anti-top bbar-jet four-vector for the negative-charge lepton "
      "branch"};

m_topbar_lepbar_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_topbar_lepbar_p4

private

Initial value:

{
      this, "topbar_lepbar_p4", "",
      "Anti-top lepton four-vector for the negative-charge lepton branch"}

Definition at line 369 of file RunHyPERAlg.h.

                                                           {
      this, "topbar_lepbar_p4", "",
      "Anti-top lepton four-vector for the negative-charge lepton branch"};

m_topbar_Wminus_decay0_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_topbar_Wminus_decay0_p4

private

Initial value:

{
      this, "topbar_Wminus_decay0_p4", "",
      "Visible anti-top W- leading decay product four-vector associated to the "
      "anti-top quark"}

Definition at line 237 of file RunHyPERAlg.h.

                                                                  {
      this, "topbar_Wminus_decay0_p4", "",
      "Visible anti-top W- leading decay product four-vector associated to the "
      "anti-top quark"};

m_topbar_Wminus_decay1_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_topbar_Wminus_decay1_p4

private

Initial value:

{
      this, "topbar_Wminus_decay1_p4", "",
      "Visible anti-top W- subleading decay product four-vector associated to "
      "the anti-top quark"}

Definition at line 241 of file RunHyPERAlg.h.

                                                                  {
      this, "topbar_Wminus_decay1_p4", "",
      "Visible anti-top W- subleading decay product four-vector associated to "
      "the anti-top quark"};

m_tophad_b_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_tophad_b_p4

private

Initial value:

{
      this, "tophad_b_p4", "",
      "Visible tophad b-jet four-vector associated to the hadronic top quark"}

Definition at line 308 of file RunHyPERAlg.h.

                                                      {
      this, "tophad_b_p4", "",
      "Visible tophad b-jet four-vector associated to the hadronic top quark"};

m_tophad_w_decay0_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_tophad_w_decay0_p4

private

Initial value:

{
      this, "tophad_w_decay0_p4", "",
      "Visible hadronic top W leading decay product four-vector"}

Definition at line 311 of file RunHyPERAlg.h.

                                                             {
      this, "tophad_w_decay0_p4", "",
      "Visible hadronic top W leading decay product four-vector"};

m_tophad_w_decay1_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_tophad_w_decay1_p4

private

Initial value:

{
      this, "tophad_w_decay1_p4", "",
      "Visible hadronic top W subleading decay product four-vector"}

Definition at line 314 of file RunHyPERAlg.h.

                                                             {
      this, "tophad_w_decay1_p4", "",
      "Visible hadronic top W subleading decay product four-vector"};

m_toplep_b_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_toplep_b_p4

private

Initial value:

{
      this, "toplep_b_p4", "",
      "Visible toplep b-jet four-vector associated to the leptonic top quark"}

Definition at line 302 of file RunHyPERAlg.h.

                                                      {
      this, "toplep_b_p4", "",
      "Visible toplep b-jet four-vector associated to the leptonic top quark"};

m_toplep_lep_p4

CP::SysWriteDecorHandle<PtEtaPhiMVector> EventReco::RunHyPERAlg::m_toplep_lep_p4

private

Initial value:

{
      this, "toplep_lep_p4", "",
      "Lepton four-vector associated to the leptonic top quark"}

Definition at line 305 of file RunHyPERAlg.h.

                                                        {
      this, "toplep_lep_p4", "",
      "Lepton four-vector associated to the leptonic top quark"};

m_topology

Gaudi::Property<std::string> EventReco::RunHyPERAlg::m_topology

private

Initial value:

{
      this, "topology", "",
      "HyPER topology. Choose between: 'TtbarLJets', 'TtbarLJetsNoBTag', "
      "'TtbarAllHadronic' and 'TtbarDiLepton'."}

Definition at line 116 of file RunHyPERAlg.h.

                                     {
      this, "topology", "",
      "HyPER topology. Choose between: 'TtbarLJets', 'TtbarLJetsNoBTag', "
      "'TtbarAllHadronic' and 'TtbarDiLepton'."};

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 209 of file AthHistogramming.h.

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• RunHyPERAlg.h
• RunHyPERAlg.cxx