EventReco::RunKLFitterAlg Class Reference

#include <RunKLFitterAlg.h>

Inheritance diagram for EventReco::RunKLFitterAlg:

Collaboration diagram for EventReco::RunKLFitterAlg:

Public Types
typedef ServiceHandle< StoreGateSvc > &	MetaStorePtr_t
	Type of the metadata store pointer in standalone mode. More...
typedef const ServiceHandle< StoreGateSvc > &	ConstMetaStorePtr_t
typedef ServiceHandle< StoreGateSvc >	MetaStore_t
	Type of the metadata store variable in Athena. More...

Public Member Functions
virtual StatusCode	initialize () final
virtual StatusCode	execute () final
::StatusCode	requestFileExecute ()
	register this algorithm to have an implementation of fileexecute More...
::StatusCode	requestBeginInputFile ()
	register this algorithm to have an implementation of beginInputFile More...
::StatusCode	requestEndInputFile ()
	register this algorithm to have an implementation of endInputFile More...
void	handle (const Incident &inc)
	receive the given incident More...
virtual StatusCode	sysInitialize ()
	Initialization method invoked by the framework. More...
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. More...
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies. More...
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc. More...
const ServiceHandle< StoreGateSvc > &	evtStore () const
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc. More...
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc. More...
virtual StatusCode	sysStart () override
	Handle START transition. More...
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles. More...
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles. More...
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T > &t)
Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKey &hndl, const std::string &doc, const SG::VarHandleKeyType &)
	Declare a new Gaudi property. More...
Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleBase &hndl, const std::string &doc, const SG::VarHandleType &)
	Declare a new Gaudi property. More...
Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, SG::VarHandleKeyArray &hndArr, const std::string &doc, const SG::VarHandleKeyArrayType &)
Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc, const SG::NotHandleType &)
	Declare a new Gaudi property. More...
Gaudi::Details::PropertyBase *	declareProperty (const std::string &name, T &property, const std::string &doc="none")
	Declare a new Gaudi property. More...
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
MsgStream &	msg (const MSG::Level lvl) const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
virtual ::StatusCode	finalize ()
	finalize this algorithm More...
virtual void	print () const
	print the state of the algorithm More...
virtual ::StatusCode	fileExecute ()
	perform the action exactly once for each file in the dataset More...
virtual ::StatusCode	beginInputFile ()
	perform the action for the beginning of an input file More...
virtual ::StatusCode	endInputFile ()
	perform the action for the end of an input file More...
void	renounceArray (SG::VarHandleKeyArray &handlesArray)
	remove all handles from I/O resolution More...
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. More...
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. More...
TH1 *	bookGetPointer (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
TH1 *	bookGetPointer (TH1 *hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
TH1 *	bookGetPointer (TH1 &histRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
TTree *	bookGetPointer (const TTree &treeRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TTrees. More...
TGraph *	bookGetPointer (const TGraph &graphRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs. More...
TEfficiency *	bookGetPointer (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
TEfficiency *	bookGetPointer (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
TEfficiency *	bookGetPointer (TEfficiency &effRef, std::string tDir="", std::string stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
StatusCode	book (const TH1 &hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
StatusCode	book (TH1 *hist, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
StatusCode	book (TH1 &histRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of histograms. More...
StatusCode	book (const TTree &treeRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TTrees. More...
StatusCode	book (const TGraph &graphRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TGraphs. More...
StatusCode	book (const TEfficiency &eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
StatusCode	book (TEfficiency *eff, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
StatusCode	book (TEfficiency &effRef, const std::string &tDir="", const std::string &stream="")
	Simplify the booking and registering (into THistSvc) of TEfficiency. More...
TH1 *	hist (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered histograms of any type. More...
TH2 *	hist2d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 2-d histograms. More...
TH3 *	hist3d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 3-d histograms. More...
TTree *	tree (const std::string &treeName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TTrees. More...
TGraph *	graph (const std::string &graphName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TGraphs. More...
TEfficiency *	efficiency (const std::string &effName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TEfficiency. More...

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

Private Member Functions
StatusCode	execute_syst (const CP::SystematicSet &sys)
StatusCode	add_leptons (const std::vector< const xAOD::Electron * > &selected_electrons, const std::vector< const xAOD::Muon * > &selected_muons, KLFitter::Particles *myParticles)
StatusCode	add_jets (const std::vector< const xAOD::Jet * > &selected_jets, KLFitter::Particles *myParticles)
StatusCode	setJetskLeadingN (const std::vector< const xAOD::Jet * > &jets, KLFitter::Particles *inputParticles, const size_t njets)
StatusCode	retrieveEfficiencies (const xAOD::Jet *jet, float *eff, float *ineff)
StatusCode	setJetskBtagPriority (const std::vector< const xAOD::Jet * > &jets, KLFitter::Particles *inputParticles, const size_t maxJets)
StatusCode	evaluatePermutations (const CP::SystematicSet &sys, const std::vector< size_t > &electron_indices, const std::vector< size_t > &muon_indices, const std::vector< size_t > &jet_indices)
template<typename T >
std::vector< const T * >	sortPt (const std::vector< const T * > &particles, std::vector< size_t > &indices)
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey> More...
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleKeyArrayType &)
	specialization for handling Gaudi::Property<SG::VarHandleKeyArray> More...
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &hndl, const SG::VarHandleType &)
	specialization for handling Gaudi::Property<SG::VarHandleBase> More...
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T > &t, const SG::NotHandleType &)
	specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray> More...
void	buildBookingString (std::string &bookingString, std::string &histName, std::string &tDir, std::string &stream, bool usePrefixPostfix=false)
	Method to build individual booking string. More...
void	myReplace (std::string &str, const std::string &oldStr, const std::string &newStr)
	Helper method to replace sub-string. More...
hash_t	hash (const std::string &histName) const
	Method to calculate a 32-bit hash from a string. More...

Private Attributes
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::SysWriteHandle< xAOD::KLFitterResultContainer, xAOD::KLFitterResultAuxContainer >	m_outHandle
CP::SysReadSelectionHandle	m_selection
Gaudi::Property< std::string >	m_leptonType
Gaudi::Property< std::string >	m_LHType
Gaudi::Property< std::string >	m_transferFunctionsPath
Gaudi::Property< std::string >	m_jetSelectionMode
Gaudi::Property< std::string >	m_bTaggingMethod
Gaudi::Property< std::string >	m_bTagDecoration
Gaudi::Property< std::string >	m_METterm
Gaudi::Property< float >	m_massTop
Gaudi::Property< bool >	m_fixedTopMass
Gaudi::Property< bool >	m_saveAllPermutations
Gaudi::Property< bool >	m_failOnLessThanXJets
KLFEnums::LeptonType	m_leptonTypeEnum {}
KLFEnums::Likelihood	m_LHTypeEnum {}
KLFEnums::JetSelectionMode	m_jetSelectionModeEnum {}
bool	m_useBtagPriority {false}
size_t	m_njetsRequirement {0}
std::unique_ptr< KLFitter::Fitter >	m_myFitter
std::unique_ptr< KLFitter::DetectorAtlas_8TeV >	m_myDetector
KLFEnums::JetSelectionMode	m_jetSelectionModeKLFitterEnum {}
KLFitter::LikelihoodBase::BtaggingMethod	m_bTaggingMethodEnum {}
KLFitter::LikelihoodTopLeptonJets::LeptonType	m_leptonTypeKLFitterEnum {}
KLFitter::LikelihoodTTHLeptonJets::LeptonType	m_leptonTypeKLFitterEnum_TTH {}
KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType	m_leptonTypeKLFitterEnum_JetAngles {}
KLFitter::LikelihoodTopLeptonJets_Angular::LeptonType	m_leptonTypeKLFitterEnum_Angular {}
KLFitter::LikelihoodTTZTrilepton::LeptonType	m_leptonTypeKLFitterEnum_TTZ {}
KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType	m_leptonTypeKLFitterEnum_BoostedLJets {}
std::unique_ptr< KLFitter::LikelihoodTopLeptonJets >	m_myLikelihood
std::unique_ptr< KLFitter::LikelihoodTTHLeptonJets >	m_myLikelihood_TTH
std::unique_ptr< KLFitter::LikelihoodTopLeptonJets_JetAngles >	m_myLikelihood_JetAngles
std::unique_ptr< KLFitter::LikelihoodTopLeptonJets_Angular >	m_myLikelihood_Angular
std::unique_ptr< KLFitter::LikelihoodTTZTrilepton >	m_myLikelihood_TTZ
std::unique_ptr< KLFitter::LikelihoodTopAllHadronic >	m_myLikelihood_AllHadronic
std::unique_ptr< KLFitter::BoostedLikelihoodTopLeptonJets >	m_myLikelihood_BoostedLJets
ToolHandle< IBTaggingEfficiencyTool >	m_btagging_eff_tool
std::unique_ptr< SG::AuxElement::ConstAccessor< char > >	m_bTagDecoAcc
MetaStore_t	m_inputMetaStore
	Object accessing the input metadata store. More...
MetaStore_t	m_outputMetaStore
	Object accessing the output metadata store. More...
bool	m_hasFileExecute {false}
	the value of hasFileExecute More...
bool	m_hasBeginInputFile {false}
	the value of hasBeginInputFile More...
bool	m_hasEndInputFile {false}
	the value of hasEndInputFile More...
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();. More...
std::string	m_prefix
	Name of the ROOT output stream (file) More...
std::string	m_rootDir
	Name of the ROOT directory. More...
std::string	m_histNamePrefix
	The prefix for the histogram THx name. More...
std::string	m_histNamePostfix
	The postfix for the histogram THx name. More...
std::string	m_histTitlePrefix
	The prefix for the histogram THx title. More...
std::string	m_histTitlePostfix
	The postfix for the histogram THx title. More...
DataObjIDColl	m_extendedExtraObjects
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default) More...
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default) More...
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers. More...
EffMap_t	m_effMap
	The map of histogram names to their pointers. More...
TreeMap_t	m_treeMap
	The map of TTree names to their pointers. More...
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers. More...
std::string	m_streamName
	Name of the ROOT output stream (file) More...
std::string	m_name
	Instance name. More...
MsgStream	m_msg
	Cached Message Stream. More...

Detailed Description

Definition at line 46 of file RunKLFitterAlg.h.

Member Typedef Documentation

ConstMetaStorePtr_t

typedef const ServiceHandle< StoreGateSvc >& EL::AnaAlgorithm::ConstMetaStorePtr_t

inherited

Definition at line 111 of file AnaAlgorithm.h.

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 205 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 219 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 169 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 198 of file AthHistogramming.h.

MetaStore_t

typedef ServiceHandle< StoreGateSvc > EL::AnaAlgorithm::MetaStore_t

inherited

Type of the metadata store variable in Athena.

Definition at line 546 of file AnaAlgorithm.h.

MetaStorePtr_t

typedef ServiceHandle< StoreGateSvc >& EL::AnaAlgorithm::MetaStorePtr_t

inherited

Type of the metadata store pointer in standalone mode.

Definition at line 110 of file AnaAlgorithm.h.

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 212 of file AthHistogramming.h.

Member Function Documentation

add_jets()

StatusCode EventReco::RunKLFitterAlg::add_jets ( const std::vector< const xAOD::Jet * > &  selected_jets, KLFitter::Particles *  myParticles  )

private

Definition at line 483 of file RunKLFitterAlg.cxx.

                                                                    {
  if (m_useBtagPriority) {
    ANA_CHECK(setJetskBtagPriority(jets, myParticles, m_njetsRequirement));
  } else {
    ANA_CHECK(setJetskLeadingN(jets, myParticles, m_njetsRequirement));
  }
  return StatusCode::SUCCESS;
}

add_leptons()

StatusCode EventReco::RunKLFitterAlg::add_leptons ( const std::vector< const xAOD::Electron * > &  selected_electrons, const std::vector< const xAOD::Muon * > &  selected_muons, KLFitter::Particles *  myParticles  )

private

Definition at line 414 of file RunKLFitterAlg.cxx.

                                    {
  // likelihoods with single lepton (either l+jets or ttZ 3lepton mixed lepton
  // flavour)
  if (m_leptonTypeEnum == KLFEnums::LeptonType::kElectron) {
    // for the lep+jets channel, we assume that your leading-pT lepton is the
    // only selected lepton
    TLorentzVector el;
    if (selected_electrons.size() == 0) {
      ANA_MSG_ERROR(
          "For single-lepton kElectron KLFitter likelihoods, at least one "
          "electron is required");
      return StatusCode::FAILURE;
    }
    const xAOD::Electron *xaod_el = selected_electrons.at(0);
    el.SetPtEtaPhiE(xaod_el->pt() / 1.e3, xaod_el->eta(), xaod_el->phi(),
                    xaod_el->e() / 1.e3);
    myParticles->AddParticle(&el, xaod_el->caloCluster()->etaBE(2),
                             KLFitter::Particles::kElectron);
  } else if (m_leptonTypeEnum == KLFEnums::LeptonType::kMuon) {
    TLorentzVector mu;
    if (selected_muons.size() == 0) {
      ANA_MSG_ERROR(
          "For single-lepton kMuon KLFitter likelihoods, at least one muon is "
          "required");
      return StatusCode::FAILURE;
    }
    const xAOD::Muon *xaod_mu = selected_muons.at(0);
    mu.SetPtEtaPhiE(xaod_mu->pt() / 1.e3, xaod_mu->eta(), xaod_mu->phi(),
                    xaod_mu->e() / 1.e3);
    myParticles->AddParticle(&mu, mu.Eta(), KLFitter::Particles::kMuon);
  } else if (m_leptonTypeEnum ==
             KLFEnums::LeptonType::kTriElectron) {  // ttZ trilep
    if (selected_electrons.size() < 3) {
      ANA_MSG_ERROR(
          "For tri-lepton kTriElectron KLFitter likelihoods, at least 3 "
          "electrons are required");
      return StatusCode::FAILURE;
    }
    TLorentzVector el;
    for (size_t i = 0; i < 3; ++i) {
      const xAOD::Electron *electron = selected_electrons.at(i);
      el.SetPtEtaPhiE(electron->pt() / 1.e3, electron->eta(), electron->phi(),
                      electron->e() / 1.e3);
      myParticles->AddParticle(&el, electron->caloCluster()->etaBE(2),
                               KLFitter::Particles::kElectron, "", i);
    }
  } else if (m_leptonTypeEnum ==
             KLFEnums::LeptonType::kTriMuon) {  // ttZ trilep
    if (selected_muons.size() < 3) {
      ANA_MSG_ERROR(
          "For tr-lepton kTriMuons KLFitter likelihoods, at least 3 muons are "
          "required");
      return StatusCode::FAILURE;
    }
    TLorentzVector mu;
    for (size_t i = 0; i < 3; ++i) {
      const xAOD::Muon *muon = selected_muons.at(i);
      mu.SetPtEtaPhiE(muon->pt() / 1.e3, muon->eta(), muon->phi(),
                      muon->e() / 1.e3);
      myParticles->AddParticle(&mu, mu.Eta(), KLFitter::Particles::kMuon, "",
                               i);
    }
  }
  return StatusCode::SUCCESS;
}

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.

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

\warn 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.

\warn The execution order of beginInputFile and fileExecute is currently unspecified.

Definition at line 350 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 335 of file AthHistogramming.h.

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

book() [2/8]

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

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 303 of file AthHistogramming.h.

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

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 403 of file AthHistogramming.h.

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

book() [5/8]

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

inlineprotectedinherited

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

Definition at line 356 of file AthHistogramming.h.

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

book() [6/8]

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

inlineprotectedinherited

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

Definition at line 346 of file AthHistogramming.h.

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

book() [7/8]

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

inlineprotectedinherited

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

Definition at line 324 of file AthHistogramming.h.

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

book() [8/8]

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

inlineprotectedinherited

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

Definition at line 314 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 281 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 427 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 260 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 312 of file AthHistogramming.cxx.

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

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 146 of file AthHistogramming.cxx.

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

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 293 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 98 of file AthHistogramming.cxx.

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

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 272 of file AthHistogramming.h.

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

buildBookingString()

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

privateinherited

Method to build individual booking string.

Definition at line 560 of file AthHistogramming.cxx.

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

configAthHistogramming()

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

protectedinherited

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

Definition at line 66 of file AthHistogramming.cxx.

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

declareGaudiProperty() [1/4]

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

inlineprivateinherited

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

Definition at line 170 of file AthCommonDataStore.h.

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

declareGaudiProperty() [2/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  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());
 
  }

declareGaudiProperty() [3/4]

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

inlineprivateinherited

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

Definition at line 184 of file AthCommonDataStore.h.

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

declareGaudiProperty() [4/4]

Gaudi::Details::PropertyBase& AthCommonDataStore< AthCommonMsg< Algorithm > >::declareGaudiProperty ( Gaudi::Property< T > &  t, const SG::NotHandleType &    )

inlineprivateinherited

specialization for handling everything that's not a Gaudi::Property<SG::VarHandleKey> or a <SG::VarHandleKeyArray>

Definition at line 199 of file AthCommonDataStore.h.

  {
    return PBASE::declareProperty(t);
  }

declareProperty() [1/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name, SG::VarHandleBase &  hndl, const std::string &  doc, const SG::VarHandleType &    )

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleBase. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 245 of file AthCommonDataStore.h.

  {
    this->declare(hndl.vhKey());
    hndl.vhKey().setOwner(this);
 
    return PBASE::declareProperty(name,hndl,doc);
  }

declareProperty() [2/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name, SG::VarHandleKey &  hndl, const std::string &  doc, const SG::VarHandleKeyType &    )

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
hndl	Object holding the property value.
doc	Documentation string for the property.

This is the version for types that derive from SG::VarHandleKey. The property value object is put on the input and output lists as appropriate; then we forward to the base class.

Definition at line 221 of file AthCommonDataStore.h.

  {
    this->declare(hndl);
    hndl.setOwner(this);
 
    return PBASE::declareProperty(name,hndl,doc);
  }

declareProperty() [3/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name, SG::VarHandleKeyArray &  hndArr, const std::string &  doc, const SG::VarHandleKeyArrayType &    )

inlineinherited

Definition at line 259 of file AthCommonDataStore.h.

  {
 
    // std::ostringstream ost;
    // ost << Algorithm::name() << " VHKA declareProp: " << name 
    //     << " size: " << hndArr.keys().size() 
    //     << " mode: " << hndArr.mode() 
    //     << "  vhka size: " << m_vhka.size()
    //     << "\n";
    // debug() << ost.str() << endmsg;
 
    hndArr.setOwner(this);
    m_vhka.push_back(&hndArr);
 
    Gaudi::Details::PropertyBase* p =  PBASE::declareProperty(name, hndArr, doc);
    if (p != 0) {
      p->declareUpdateHandler(&AthCommonDataStore<PBASE>::updateVHKA, this);
    } else {
      ATH_MSG_ERROR("unable to call declareProperty on VarHandleKeyArray " 
                    << name);
    }
 
    return p;
 
  }

declareProperty() [4/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name, T &  property, const std::string &  doc, const SG::NotHandleType &    )

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This is the generic version, for types that do not derive from SG::VarHandleKey. It just forwards to the base class version of declareProperty.

Definition at line 333 of file AthCommonDataStore.h.

  {
    return PBASE::declareProperty(name, property, doc);
  }

declareProperty() [5/6]

Gaudi::Details::PropertyBase* AthCommonDataStore< AthCommonMsg< Algorithm > >::declareProperty ( const std::string &  name, T &  property, const std::string &  doc = "none"  )

inlineinherited

Declare a new Gaudi property.

Parameters

name	Name of the property.
property	Object holding the property value.
doc	Documentation string for the property.

This dispatches to either the generic declareProperty or the one for VarHandle/Key/KeyArray.

Definition at line 352 of file AthCommonDataStore.h.

  {
    typedef typename SG::HandleClassifier<T>::type htype;
    return declareProperty (name, property, doc, htype());
  }

declareProperty() [6/6]

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 250 of file AthHistogramming.cxx.

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

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.

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

\warn 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.

\warn The execution order of endInputFile and fileExecute is currently unspecified.

Definition at line 358 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

evaluatePermutations()

StatusCode EventReco::RunKLFitterAlg::evaluatePermutations ( const CP::SystematicSet &  sys, const std::vector< size_t > &  electron_indices, const std::vector< size_t > &  muon_indices, const std::vector< size_t > &  jet_indices  )

private

Definition at line 648 of file RunKLFitterAlg.cxx.

                                          {
  // create or retrieve (if existent) the xAOD::KLFitterResultContainer
  auto resultAuxContainer =
      std::make_unique<xAOD::KLFitterResultAuxContainer>();
  auto resultContainer = std::make_unique<xAOD::KLFitterResultContainer>();
  resultContainer->setStore(resultAuxContainer.get());
 
  // loop over all permutations
  const int nperm = m_myFitter->Permutations()->NPermutations();
  for (int iperm = 0; iperm < nperm; ++iperm) {
    // Perform the fit
    m_myFitter->Fit(iperm);
    // create a result
    xAOD::KLFitterResult *result = new xAOD::KLFitterResult{};
    resultContainer->push_back(result);
 
    // Set name hash. This is because it seems std::string is not supported by
    // AuxContainers...
    std::hash<std::string> hash_string;
    result->setSelectionCode(hash_string(sys.name()));
 
    unsigned int ConvergenceStatusBitWord = m_myFitter->ConvergenceStatus();
    bool MinuitDidNotConverge =
        (ConvergenceStatusBitWord & m_myFitter->MinuitDidNotConvergeMask) != 0;
    bool FitAbortedDueToNaN =
        (ConvergenceStatusBitWord & m_myFitter->FitAbortedDueToNaNMask) != 0;
    bool AtLeastOneFitParameterAtItsLimit =
        (ConvergenceStatusBitWord &
         m_myFitter->AtLeastOneFitParameterAtItsLimitMask) != 0;
    bool InvalidTransferFunctionAtConvergence =
        (ConvergenceStatusBitWord &
         m_myFitter->InvalidTransferFunctionAtConvergenceMask) != 0;
 
    result->setMinuitDidNotConverge(((MinuitDidNotConverge) ? 1 : 0));
    result->setFitAbortedDueToNaN(((FitAbortedDueToNaN) ? 1 : 0));
    result->setAtLeastOneFitParameterAtItsLimit(
        ((AtLeastOneFitParameterAtItsLimit) ? 1 : 0));
    result->setInvalidTransferFunctionAtConvergence(
        ((InvalidTransferFunctionAtConvergence) ? 1 : 0));
 
    result->setLogLikelihood(m_myFitter->Likelihood()->LogLikelihood(
        m_myFitter->Likelihood()->GetBestFitParameters()));
    result->setEventProbability(
        std::exp(m_myFitter->Likelihood()->LogEventProbability()));
    result->setParameters(m_myFitter->Likelihood()->GetBestFitParameters());
    result->setParameterErrors(
        m_myFitter->Likelihood()->GetBestFitParameterErrors());
 
    KLFitter::Particles *myModelParticles =
        m_myFitter->Likelihood()->ParticlesModel();
    KLFitter::Particles **myPermutedParticles =
        m_myFitter->Likelihood()->PParticlesPermuted();
 
    if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar ||
        m_LHTypeEnum == KLFEnums::Likelihood::ttH ||
        m_LHTypeEnum == KLFEnums::Likelihood::ttbar_JetAngles ||
        m_LHTypeEnum == KLFEnums::Likelihood::ttbar_Angular ||
        m_LHTypeEnum == KLFEnums::Likelihood::ttZTrilepton ||
        m_LHTypeEnum == KLFEnums::Likelihood::ttbar_BoostedLJets) {
      result->setModel_bhad_pt(myModelParticles->Parton(0)->Pt());
      result->setModel_bhad_eta(myModelParticles->Parton(0)->Eta());
      result->setModel_bhad_phi(myModelParticles->Parton(0)->Phi());
      result->setModel_bhad_E(myModelParticles->Parton(0)->E());
      result->setModel_bhad_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(0)));
 
      result->setModel_blep_pt(myModelParticles->Parton(1)->Pt());
      result->setModel_blep_eta(myModelParticles->Parton(1)->Eta());
      result->setModel_blep_phi(myModelParticles->Parton(1)->Phi());
      result->setModel_blep_E(myModelParticles->Parton(1)->E());
      result->setModel_blep_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(1)));
 
      result->setModel_lq1_pt(myModelParticles->Parton(2)->Pt());
      result->setModel_lq1_eta(myModelParticles->Parton(2)->Eta());
      result->setModel_lq1_phi(myModelParticles->Parton(2)->Phi());
      result->setModel_lq1_E(myModelParticles->Parton(2)->E());
      result->setModel_lq1_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(2)));
 
      // boosted likelihood has only one light jet
      if (m_LHTypeEnum != KLFEnums::Likelihood::ttbar_BoostedLJets) {
        result->setModel_lq2_pt(myModelParticles->Parton(3)->Pt());
        result->setModel_lq2_eta(myModelParticles->Parton(3)->Eta());
        result->setModel_lq2_phi(myModelParticles->Parton(3)->Phi());
        result->setModel_lq2_E(myModelParticles->Parton(3)->E());
        result->setModel_lq2_jetIndex(
            jet_indices.at((*myPermutedParticles)->JetIndex(3)));
 
        if (m_LHTypeEnum == KLFEnums::Likelihood::ttH) {
          result->setModel_Higgs_b1_pt(myModelParticles->Parton(4)->Pt());
          result->setModel_Higgs_b1_eta(myModelParticles->Parton(4)->Eta());
          result->setModel_Higgs_b1_phi(myModelParticles->Parton(4)->Phi());
          result->setModel_Higgs_b1_E(myModelParticles->Parton(4)->E());
          result->setModel_Higgs_b1_jetIndex(
              jet_indices.at((*myPermutedParticles)->JetIndex(4)));
 
          result->setModel_Higgs_b2_pt(myModelParticles->Parton(5)->Pt());
          result->setModel_Higgs_b2_eta(myModelParticles->Parton(5)->Eta());
          result->setModel_Higgs_b2_phi(myModelParticles->Parton(5)->Phi());
          result->setModel_Higgs_b2_E(myModelParticles->Parton(5)->E());
          result->setModel_Higgs_b2_jetIndex(
              jet_indices.at((*myPermutedParticles)->JetIndex(5)));
        }
      }
 
      if (m_leptonTypeEnum == KLFEnums::LeptonType::kElectron ||
          m_leptonTypeEnum == KLFEnums::LeptonType::kTriElectron) {
        result->setModel_lep_pt(myModelParticles->Electron(0)->Pt());
        result->setModel_lep_eta(myModelParticles->Electron(0)->Eta());
        result->setModel_lep_phi(myModelParticles->Electron(0)->Phi());
        result->setModel_lep_E(myModelParticles->Electron(0)->E());
 
        if (m_leptonTypeEnum == KLFEnums::LeptonType::kTriElectron) {
          result->setModel_lep_index(
              electron_indices.at((*myPermutedParticles)->ElectronIndex(0)));
 
          result->setModel_lepZ1_pt(myModelParticles->Electron(1)->Pt());
          result->setModel_lepZ1_eta(myModelParticles->Electron(1)->Eta());
          result->setModel_lepZ1_phi(myModelParticles->Electron(1)->Phi());
          result->setModel_lepZ1_E(myModelParticles->Electron(1)->E());
          result->setModel_lepZ1_index(
              electron_indices.at((*myPermutedParticles)->ElectronIndex(1)));
 
          result->setModel_lepZ2_pt(myModelParticles->Electron(2)->Pt());
          result->setModel_lepZ2_eta(myModelParticles->Electron(2)->Eta());
          result->setModel_lepZ2_phi(myModelParticles->Electron(2)->Phi());
          result->setModel_lepZ2_E(myModelParticles->Electron(2)->E());
          result->setModel_lepZ2_index(
              electron_indices.at((*myPermutedParticles)->ElectronIndex(2)));
        }
      }
 
      if (m_leptonTypeEnum == KLFEnums::LeptonType::kMuon ||
          m_leptonTypeEnum == KLFEnums::LeptonType::kTriMuon) {
        result->setModel_lep_pt(myModelParticles->Muon(0)->Pt());
        result->setModel_lep_eta(myModelParticles->Muon(0)->Eta());
        result->setModel_lep_phi(myModelParticles->Muon(0)->Phi());
        result->setModel_lep_E(myModelParticles->Muon(0)->E());
 
        if (m_leptonTypeEnum == KLFEnums::LeptonType::kTriMuon) {
          result->setModel_lep_index(
              muon_indices.at((*myPermutedParticles)->MuonIndex(0)));
 
          result->setModel_lepZ1_pt(myModelParticles->Muon(1)->Pt());
          result->setModel_lepZ1_eta(myModelParticles->Muon(1)->Eta());
          result->setModel_lepZ1_phi(myModelParticles->Muon(1)->Phi());
          result->setModel_lepZ1_E(myModelParticles->Muon(1)->E());
          result->setModel_lepZ1_index(
              muon_indices.at((*myPermutedParticles)->MuonIndex(1)));
 
          result->setModel_lepZ2_pt(myModelParticles->Muon(2)->Pt());
          result->setModel_lepZ2_eta(myModelParticles->Muon(2)->Eta());
          result->setModel_lepZ2_phi(myModelParticles->Muon(2)->Phi());
          result->setModel_lepZ2_E(myModelParticles->Muon(2)->E());
          result->setModel_lepZ2_index(
              muon_indices.at((*myPermutedParticles)->MuonIndex(2)));
        }
      }
 
      result->setModel_nu_pt(myModelParticles->Neutrino(0)->Pt());
      result->setModel_nu_eta(myModelParticles->Neutrino(0)->Eta());
      result->setModel_nu_phi(myModelParticles->Neutrino(0)->Phi());
      result->setModel_nu_E(myModelParticles->Neutrino(0)->E());
    } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_AllHad) {
      result->setModel_b_from_top1_pt(myModelParticles->Parton(0)->Pt());
      result->setModel_b_from_top1_eta(myModelParticles->Parton(0)->Eta());
      result->setModel_b_from_top1_phi(myModelParticles->Parton(0)->Phi());
      result->setModel_b_from_top1_E(myModelParticles->Parton(0)->E());
      result->setModel_b_from_top1_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(0)));
 
      result->setModel_b_from_top2_pt(myModelParticles->Parton(1)->Pt());
      result->setModel_b_from_top2_eta(myModelParticles->Parton(1)->Eta());
      result->setModel_b_from_top2_phi(myModelParticles->Parton(1)->Phi());
      result->setModel_b_from_top2_E(myModelParticles->Parton(1)->E());
      result->setModel_b_from_top2_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(1)));
 
      result->setModel_lj1_from_top1_pt(myModelParticles->Parton(2)->Pt());
      result->setModel_lj1_from_top1_eta(myModelParticles->Parton(2)->Eta());
      result->setModel_lj1_from_top1_phi(myModelParticles->Parton(2)->Phi());
      result->setModel_lj1_from_top1_E(myModelParticles->Parton(2)->E());
      result->setModel_lj1_from_top1_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(2)));
 
      result->setModel_lj2_from_top1_pt(myModelParticles->Parton(3)->Pt());
      result->setModel_lj2_from_top1_eta(myModelParticles->Parton(3)->Eta());
      result->setModel_lj2_from_top1_phi(myModelParticles->Parton(3)->Phi());
      result->setModel_lj2_from_top1_E(myModelParticles->Parton(3)->E());
      result->setModel_lj2_from_top1_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(3)));
 
      result->setModel_lj1_from_top2_pt(myModelParticles->Parton(4)->Pt());
      result->setModel_lj1_from_top2_eta(myModelParticles->Parton(4)->Eta());
      result->setModel_lj1_from_top2_phi(myModelParticles->Parton(4)->Phi());
      result->setModel_lj1_from_top2_E(myModelParticles->Parton(4)->E());
      result->setModel_lj1_from_top2_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(4)));
 
      result->setModel_lj2_from_top2_pt(myModelParticles->Parton(5)->Pt());
      result->setModel_lj2_from_top2_eta(myModelParticles->Parton(5)->Eta());
      result->setModel_lj2_from_top2_phi(myModelParticles->Parton(5)->Phi());
      result->setModel_lj2_from_top2_E(myModelParticles->Parton(5)->E());
      result->setModel_lj2_from_top2_jetIndex(
          jet_indices.at((*myPermutedParticles)->JetIndex(5)));
    }
  }  // Loop over permutations
 
  // Normalize event probability to unity
  // work out best permutation
  float sumEventProbability(0.), bestEventProbability(0.);
  size_t bestPermutation(999), iPerm(0);
 
  // First loop
  for (auto x : *resultContainer) {
    float prob = x->eventProbability();
    short minuitDidNotConverge = x->minuitDidNotConverge();
    short fitAbortedDueToNaN = x->fitAbortedDueToNaN();
    short atLeastOneFitParameterAtItsLimit =
        x->atLeastOneFitParameterAtItsLimit();
    short invalidTransferFunctionAtConvergence =
        x->invalidTransferFunctionAtConvergence();
    sumEventProbability += prob;
    ++iPerm;
 
    // check if the best value has the highest event probability AND converged
    if (minuitDidNotConverge)
      continue;
    if (fitAbortedDueToNaN)
      continue;
    if (atLeastOneFitParameterAtItsLimit)
      continue;
    if (invalidTransferFunctionAtConvergence)
      continue;
 
    if (prob > bestEventProbability) {
      bestEventProbability = prob;
      // Using iPerm -1 because it has already been incremented before
      bestPermutation = iPerm - 1;
    }
  }
 
  // Second loop
  iPerm = 0;
  for (auto x : *resultContainer) {
    x->setEventProbability(x->eventProbability() / sumEventProbability);
    if (iPerm == bestPermutation) {
      x->setBestPermutation(1);
    } else {
      x->setBestPermutation(0);
    }
    ++iPerm;
  }
 
  // Save all permutations
  if (m_saveAllPermutations) {
    ANA_CHECK(m_outHandle.record(std::move(resultContainer),
                                 std::move(resultAuxContainer), sys));
  } else {  // Save only the best permutation
    // create or retrieve the xAOD::KLFitterResultContainer
    auto bestContainer = std::make_unique<xAOD::KLFitterResultContainer>();
    auto bestAuxContainer =
        std::make_unique<xAOD::KLFitterResultAuxContainer>();
    bestContainer->setStore(bestAuxContainer.get());
 
    for (auto x : *resultContainer) {
      if (x->bestPermutation() == 1) {
        xAOD::KLFitterResult *result = new xAOD::KLFitterResult{};
        result->makePrivateStore(*x);
        bestContainer->push_back(result);
      }
    }
    ANA_CHECK(m_outHandle.record(std::move(bestContainer),
                                 std::move(bestAuxContainer), sys));
  }
 
  return StatusCode::SUCCESS;
}

evtStore() [1/2]

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

evtStore() [2/2]

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

inlineinherited

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

Definition at line 90 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode EventReco::RunKLFitterAlg::execute ( )

finalvirtual

Definition at line 299 of file RunKLFitterAlg.cxx.

                                   {
  for (const auto &sys : m_systematicsList.systematicsVector()) {
    ANA_CHECK(execute_syst(sys));
  }
  return StatusCode::SUCCESS;
}

execute_syst()

StatusCode EventReco::RunKLFitterAlg::execute_syst ( const CP::SystematicSet &  sys )

private

Definition at line 306 of file RunKLFitterAlg.cxx.

                                                                  {
  // run KLFitter
  // create an instance of the particles class filled with the particles to be
  // fitted; here, you need to make sure that
  // - the particles are in the range allowed by the transfer functions (eta and
  // pt)
  // - the energies and momenta are in GeV
  // - be aware that *all* particles you're adding are considered in the fit
  //   (many particles lead to many permutations to be considered and hence a
  //   long running time and not necessarily good fitting results due to the
  //   many available permutations)
  // the arguments taken py AddParticle() are
  // - TLorentzVector of the physics 4-momentum
  // - detector eta for the evaluation of the transfer functions (for muons:
  // just use the physics eta)
  // - type of particle
  // - an optional name of the particle (pass empty string in case you don't
  // want to give your particle a name)
  // - index of the particle in your original collection (for convenience)
  // - for jets:
  //   * bool isBtagged : mandatory only if you want to use b-tagging in the fit
 
  // first figure out if this event even passes the selection in which we are to
  // run this KLFitter instance
  const xAOD::EventInfo *evtInfo = nullptr;
  ANA_CHECK(m_eventInfoHandle.retrieve(evtInfo, sys));
 
  if (!m_selection.getBool(*evtInfo, sys))
    return StatusCode::SUCCESS;
 
  const xAOD::ElectronContainer *electrons = nullptr;
  ANA_CHECK(m_electronsHandle.retrieve(electrons, sys));
  const xAOD::MuonContainer *muons = nullptr;
  ANA_CHECK(m_muonsHandle.retrieve(muons, sys));
  const xAOD::JetContainer *jets = nullptr;
  ANA_CHECK(m_jetsHandle.retrieve(jets, sys));
  const xAOD::MissingETContainer *met = nullptr;
  ANA_CHECK(m_metHandle.retrieve(met, sys));
 
  // perform selection of objects
  KLFitter::Particles *myParticles = new KLFitter::Particles{};
 
  std::vector<const xAOD::Electron *> selected_electrons;
  std::vector<const xAOD::Muon *> selected_muons;
  std::vector<const xAOD::Jet *> selected_jets;
 
  // select particles
  for (const xAOD::Electron *el : *electrons) {
    if (m_electronSelection.getBool(*el, sys))
      selected_electrons.push_back(el);
  }
 
  for (const xAOD::Muon *mu : *muons) {
    if (m_muonSelection.getBool(*mu, sys))
      selected_muons.push_back(mu);
  }
 
  for (const xAOD::Jet *jet : *jets) {
    if (m_jetSelection.getBool(*jet, sys))
      selected_jets.push_back(jet);
  }
 
  std::vector<size_t> electron_indices;
  const std::vector<const xAOD::Electron *> selected_sorted_electrons =
      sortPt(selected_electrons, electron_indices);
  std::vector<size_t> muon_indices;
  const std::vector<const xAOD::Muon *> selected_sorted_muons =
      sortPt(selected_muons, muon_indices);
  std::vector<size_t> jet_indices;
  const std::vector<const xAOD::Jet *> selected_sorted_jets =
      sortPt(selected_jets, jet_indices);
 
  // add leptons to KLFitter particles (not for ttbar all hadronic)
  if (m_LHTypeEnum != KLFEnums::Likelihood::ttbar_AllHad)
    ANA_CHECK(add_leptons(selected_sorted_electrons, selected_sorted_muons,
                          myParticles));
 
  // add jets to KLFitter particles
  ANA_CHECK(add_jets(selected_sorted_jets, myParticles));
 
  // add the particles to the fitter itself
  if (!m_myFitter->SetParticles(myParticles)) {
    ANA_MSG_ERROR("Error adding particles to KLFitter");
    return StatusCode::FAILURE;
  }
 
  // add MET
  auto *met_finalTrk = (*met)[m_METterm.value()];
  if (!met_finalTrk) {
    ANA_MSG_ERROR("RunKLFitterAlg: Error retrieving MET term "
                  << m_METterm.value());
    return StatusCode::FAILURE;
  }
  if (!m_myFitter->SetET_miss_XY_SumET(met_finalTrk->mpx() / 1.e3,
                                       met_finalTrk->mpy() / 1.e3,
                                       met_finalTrk->sumet())) {
    ANA_MSG_ERROR("Error adding MET term to KLFitter");
    return StatusCode::FAILURE;
  }
 
  ANA_CHECK(
      evaluatePermutations(sys, electron_indices, muon_indices, jet_indices));
 
  delete myParticles;
 
  return StatusCode::SUCCESS;
}

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 50 of file AthAlgorithm.cxx.

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

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.

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

\warn 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.

\warn The execution order of beginInputFile and fileExecute is currently unspecified.

\warn 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 342 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

finalize()

StatusCode EL::AnaAlgorithm::finalize ( )

protectedinherited

finalize this algorithm

This gets called after event processing has finished. The last event may no longer be in memory, and the code should not try to access it.

Definition at line 328 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 492 of file AthHistogramming.cxx.

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

handle()

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

inherited

receive the given incident

Guarantee

basic

Failures

incident handling errors

Definition at line 520 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 ( const std::string &  histName ) const

inlineprivateinherited

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

Definition at line 428 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 198 of file AthHistogramming.cxx.

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

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 369 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 386 of file AthHistogramming.h.

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

histSvc()

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

inlineinherited

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

Definition at line 113 of file AthHistogramAlgorithm.h.

{
  return m_histSvc;
}

initialize()

StatusCode EventReco::RunKLFitterAlg::initialize ( )

finalvirtual

Definition at line 15 of file RunKLFitterAlg.cxx.

                                      {
  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));
 
  ANA_CHECK(m_selection.initialize(m_systematicsList, m_eventInfoHandle));
 
  ANA_CHECK(m_outHandle.initialize(m_systematicsList));
 
  ANA_CHECK(m_systematicsList.initialize());
 
  // parse likelihood type
  try {
    m_LHTypeEnum = KLFEnums::strToLikelihood.at(m_LHType.value());
  } catch (std::out_of_range &) {
    ANA_MSG_ERROR("Unrecognized KLFitter likelihood: "
                  << m_LHType.value() << ". Available options: "
                  << KLFEnums::printEnumOptions(KLFEnums::strToLikelihood));
    return StatusCode::FAILURE;
  }
 
  if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_JetAngles) {
    ANA_MSG_ERROR("The ttbar_JetAngles likelihood is currently not supported!");
    return StatusCode::FAILURE;
  }
 
  // parse lepton type
  try {
    m_leptonTypeEnum = KLFEnums::strToLeptonType.at(m_leptonType.value());
    if (m_leptonTypeEnum != KLFEnums::LeptonType::kNoLepton &&
        m_LHTypeEnum == KLFEnums::Likelihood::ttbar_AllHad) {
      ANA_MSG_ERROR(
          "If using ttbar_AllHad likelihood, please use leptonType = "
          "kNoLepton.");
      return StatusCode::FAILURE;
    }
  } catch (std::out_of_range &) {
    ANA_MSG_ERROR("Unrecognized KLFitter leptonType: "
                  << m_leptonType.value() << ". Available options: "
                  << KLFEnums::printEnumOptions(KLFEnums::strToLeptonType));
    return StatusCode::FAILURE;
  }
 
  // parse jet selection
  try {
    m_jetSelectionModeEnum =
        KLFEnums::strToJetSelection.at(m_jetSelectionMode.value());
  } catch (std::out_of_range &) {
    ANA_MSG_ERROR("Unrecognized KLFitter JetSelectionMode: "
                  << m_jetSelectionMode.value() << ". Available options: "
                  << KLFEnums::printEnumOptions(KLFEnums::strToJetSelection));
    return StatusCode::FAILURE;
  }
 
  if (m_jetSelectionModeEnum > KLFEnums::JetSelectionMode::kLeadingEight)
    m_useBtagPriority = true;
  try {
    m_njetsRequirement = KLFEnums::jetSelToNumber.at(m_jetSelectionModeEnum);
  } catch (std::out_of_range &) {
    ANA_MSG_ERROR(
        "Could not parse the number of required jets from KLFitter jet "
        "selection mode: "
        << m_jetSelectionMode.value());
    return StatusCode::FAILURE;
  }
 
  // parse b-tagging method
  try {
    m_bTaggingMethodEnum =
        KLFEnums::strToBtagMethod.at(m_bTaggingMethod.value());
  } catch (std::out_of_range &) {
    ANA_MSG_ERROR("Unrecognized KLFitter BTaggingMethod: "
                  << m_bTaggingMethod.value() << ". Available options: "
                  << KLFEnums::printEnumOptions(KLFEnums::strToBtagMethod));
    return StatusCode::FAILURE;
  }
 
  // setup the KLFitter::Fitter instance
  m_myFitter = std::make_unique<KLFitter::Fitter>();
  const std::string transferFunctionAbsPath =
      PathResolverFindCalibDirectory(m_transferFunctionsPath.value());
  m_myDetector =
      std::make_unique<KLFitter::DetectorAtlas_8TeV>(transferFunctionAbsPath);
  if (!m_myFitter->SetDetector(m_myDetector.get())) {
    ANA_MSG_ERROR(
        "Failed to set KLFitter::Detector for KLFitter::Fitter instance.");
    return StatusCode::FAILURE;
  }
 
  // create the likelihoods
  m_myLikelihood = std::make_unique<KLFitter::LikelihoodTopLeptonJets>();
  m_myLikelihood_TTH = std::make_unique<KLFitter::LikelihoodTTHLeptonJets>();
  m_myLikelihood_JetAngles =
      std::make_unique<KLFitter::LikelihoodTopLeptonJets_JetAngles>();
  m_myLikelihood_Angular =
      std::make_unique<KLFitter::LikelihoodTopLeptonJets_Angular>();
  m_myLikelihood_TTZ = std::make_unique<KLFitter::LikelihoodTTZTrilepton>();
  m_myLikelihood_AllHadronic =
      std::make_unique<KLFitter::LikelihoodTopAllHadronic>();
  m_myLikelihood_BoostedLJets =
      std::make_unique<KLFitter::BoostedLikelihoodTopLeptonJets>();
 
  // SetleptonType
  if (m_LHTypeEnum != KLFEnums::Likelihood::ttbar_AllHad) {
    if (m_leptonTypeEnum == KLFEnums::LeptonType::kElectron) {
      m_leptonTypeKLFitterEnum =
          KLFitter::LikelihoodTopLeptonJets::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_TTH =
          KLFitter::LikelihoodTTHLeptonJets::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_JetAngles =
          KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_Angular =
          KLFitter::LikelihoodTopLeptonJets_Angular::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_TTZ =
          KLFitter::LikelihoodTTZTrilepton::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_BoostedLJets =
          KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType::kElectron;
    } else if (m_leptonTypeEnum == KLFEnums::LeptonType::kMuon) {
      m_leptonTypeKLFitterEnum =
          KLFitter::LikelihoodTopLeptonJets::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_TTH =
          KLFitter::LikelihoodTTHLeptonJets::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_JetAngles =
          KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_Angular =
          KLFitter::LikelihoodTopLeptonJets_Angular::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_TTZ =
          KLFitter::LikelihoodTTZTrilepton::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_BoostedLJets =
          KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType::kMuon;
    } else if (m_leptonTypeEnum == KLFEnums::LeptonType::kTriElectron) {
      if (m_LHType.value() != KLFEnums::Likelihood::ttZTrilepton) {
        ANA_MSG_ERROR(
            " LeptonType kTriElectron is only defined for the ttZTrilepton "
            "likelihood");
        return StatusCode::FAILURE;
      }
      m_leptonTypeKLFitterEnum =
          KLFitter::LikelihoodTopLeptonJets::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_TTH =
          KLFitter::LikelihoodTTHLeptonJets::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_JetAngles =
          KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_TTZ =
          KLFitter::LikelihoodTTZTrilepton::LeptonType::kElectron;
      m_leptonTypeKLFitterEnum_BoostedLJets =
          KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType::kElectron;
    } else if (m_leptonTypeEnum == KLFEnums::LeptonType::kTriMuon) {
      if (m_LHType.value() != KLFEnums::Likelihood::ttZTrilepton) {
        ANA_MSG_ERROR(
            " LeptonType kTriMuon is only defined for the ttZTrilepton "
            "likelihood");
        return StatusCode::FAILURE;
      }
      m_leptonTypeKLFitterEnum =
          KLFitter::LikelihoodTopLeptonJets::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_TTH =
          KLFitter::LikelihoodTTHLeptonJets::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_JetAngles =
          KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_TTZ =
          KLFitter::LikelihoodTTZTrilepton::LeptonType::kMuon;
      m_leptonTypeKLFitterEnum_BoostedLJets =
          KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType::kMuon;
    } else {
      ANA_MSG_ERROR(" Please supply a valid LeptonType : kElectron or kMuon");
      return StatusCode::FAILURE;
    }
 
    m_myLikelihood->SetLeptonType(m_leptonTypeKLFitterEnum);
    m_myLikelihood_TTH->SetLeptonType(m_leptonTypeKLFitterEnum_TTH);
    m_myLikelihood_JetAngles->SetLeptonType(m_leptonTypeKLFitterEnum_JetAngles);
    m_myLikelihood_Angular->SetLeptonType(m_leptonTypeKLFitterEnum_Angular);
    m_myLikelihood_TTZ->SetLeptonType(m_leptonTypeKLFitterEnum_TTZ);
    m_myLikelihood_BoostedLJets->SetLeptonType(
        m_leptonTypeKLFitterEnum_BoostedLJets);
  }
 
  m_myLikelihood->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_TTH->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_JetAngles->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_Angular->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_TTZ->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_AllHadronic->SetBTagging(m_bTaggingMethodEnum);
  m_myLikelihood_BoostedLJets->SetBTagging(m_bTaggingMethodEnum);
  // set top mass
  m_myLikelihood->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_TTH->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_JetAngles->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_Angular->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_TTZ->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_AllHadronic->PhysicsConstants()->SetMassTop(m_massTop);
  m_myLikelihood_BoostedLJets->PhysicsConstants()->SetMassTop(m_massTop);
 
  // whether the top mass is fixed to the constant in likelihood or not
  m_myLikelihood->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_TTH->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_JetAngles->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_Angular->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_TTZ->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_AllHadronic->SetFlagTopMassFixed(m_fixedTopMass);
  m_myLikelihood_BoostedLJets->SetFlagTopMassFixed(m_fixedTopMass);
 
  // configure which likelihood to use in the fitter
  int klfitter_returncode = 0;
  if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar) {
    klfitter_returncode = m_myFitter->SetLikelihood(m_myLikelihood.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttH) {
    klfitter_returncode = m_myFitter->SetLikelihood(m_myLikelihood_TTH.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_JetAngles) {
    klfitter_returncode =
        m_myFitter->SetLikelihood(m_myLikelihood_JetAngles.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_Angular) {
    klfitter_returncode =
        m_myFitter->SetLikelihood(m_myLikelihood_Angular.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttZTrilepton &&
             (m_leptonTypeEnum == KLFEnums::LeptonType::kTriElectron ||
              m_leptonTypeEnum == KLFEnums::LeptonType::kTriMuon)) {
    // For ttZ->trilepton, we can have difficult combinations of leptons in the
    // final state (3x same flavour, or mixed case). The latter is trivial, for
    // which we can default back to the ljets likelihood. So we distinguish
    // here:
    //  - kTriMuon, kTriElectron: dedicated TTZ->trilepton likelihood,
    //  - kMuon, kElectron: standard ttbar->l+jets likelihood.
    klfitter_returncode = m_myFitter->SetLikelihood(m_myLikelihood_TTZ.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttZTrilepton) {
    klfitter_returncode = m_myFitter->SetLikelihood(m_myLikelihood.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_AllHad) {
    klfitter_returncode =
        m_myFitter->SetLikelihood(m_myLikelihood_AllHadronic.get());
  } else if (m_LHTypeEnum == KLFEnums::Likelihood::ttbar_BoostedLJets) {
    klfitter_returncode =
        m_myFitter->SetLikelihood(m_myLikelihood_BoostedLJets.get());
  } else {
    ANA_MSG_ERROR("Unrecognized KLFitter likelihood: " << m_LHType.value());
    return StatusCode::FAILURE;
  }
 
  if (!klfitter_returncode) {
    ANA_MSG_ERROR("Failed to SetLikelihood for likelihood "
                  << m_LHType.value());
    return StatusCode::FAILURE;
  }
 
  if (m_bTagDecoration.value().find("Continuous") != std::string::npos) {
    ANA_MSG_ERROR("KLFitter cannot run using Continuous b-tag working point!");
    return StatusCode::FAILURE;
  }
  m_bTagDecoAcc = std::make_unique<SG::AuxElement::ConstAccessor<char>>(
      m_bTagDecoration.value());
 
  if (m_bTaggingMethodEnum ==
      KLFitter::LikelihoodBase::BtaggingMethod::kWorkingPoint) {
    ANA_CHECK(m_btagging_eff_tool.retrieve());
  }
 
  ANA_MSG_INFO("++++++++++++++++++++++++++++++");
  ANA_MSG_INFO("Configured KLFitter with name " << name());
  ANA_MSG_INFO("  Using " << m_btagging_eff_tool);
  ANA_MSG_INFO("  Using transfer functions with full path "
               << transferFunctionAbsPath);
  ANA_MSG_INFO("  Using Lepton \t\t" << m_leptonType.value());
  ANA_MSG_INFO("  Using JetSelectionMode \t" << m_jetSelectionMode.value());
  ANA_MSG_INFO("  Using BTaggingMethod \t" << m_bTaggingMethod.value());
  ANA_MSG_INFO("  Using TopMassFixed \t" << m_fixedTopMass);
 
  if (m_saveAllPermutations)
    ANA_MSG_INFO("  Saving All permutations");
  else
    ANA_MSG_INFO(
        "  Saving only the permutation with the highest event probability");
  ANA_MSG_INFO("++++++++++++++++++++++++++++++");
 
  return StatusCode::SUCCESS;
}

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

inputMetaStore() [1/2]

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

inherited

Definition at line 81 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 72 of file AnaAlgorithm.cxx.

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

msg() [1/2]

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msg() [2/2]

MsgStream& AthCommonMsg< Algorithm >::msg ( const MSG::Level  lvl ) const

inlineinherited

Definition at line 27 of file AthCommonMsg.h.

                                                  {
    return this->msgStream(lvl);
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

myReplace()

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

privateinherited

Helper method to replace sub-string.

Definition at line 590 of file AthHistogramming.cxx.

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

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

outputMetaStore() [1/2]

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

inherited

Definition at line 101 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 92 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 336 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< Algorithm > >::renounce ( T &  h )

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

requestBeginInputFile()

StatusCode EL::AnaAlgorithm::requestBeginInputFile ( )

inherited

register this algorithm to have an implementation of beginInputFile

Guarantee

strong

Failures

beginInputFile not supported

Definition at line 270 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 291 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 249 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;
  }

retrieveEfficiencies()

StatusCode EventReco::RunKLFitterAlg::retrieveEfficiencies ( const xAOD::Jet *  jet, float *  eff, float *  ineff  )

private

Definition at line 543 of file RunKLFitterAlg.cxx.

                                                                          {
  // need to make a copy of the jet, so that we can manipulate its flavour to
  // get the various efficiencies
  xAOD::JetContainer jets;
  xAOD::JetAuxContainer jetsAux;
  jets.setStore(&jetsAux);
  xAOD::Jet *jet_copy = new xAOD::Jet();
  jets.push_back(jet_copy);
  *jet_copy = *jet;
  jet_copy->setJetP4(jet->jetP4());
  // treat jet as b-tagged
  jet_copy->setAttribute("HadronConeExclTruthLabelID", 5);
  ANA_CHECK(m_btagging_eff_tool->getMCEfficiency(*jet_copy, *eff));
  // treat jet as light
  jet_copy->setAttribute("HadronConeExclTruthLabelID", 0);
  ANA_CHECK(m_btagging_eff_tool->getMCEfficiency(*jet_copy, *ineff));
  return StatusCode::SUCCESS;
}

setJetskBtagPriority()

StatusCode EventReco::RunKLFitterAlg::setJetskBtagPriority ( const std::vector< const xAOD::Jet * > &  jets, KLFitter::Particles *  inputParticles, const size_t  maxJets  )

private

Definition at line 563 of file RunKLFitterAlg.cxx.

                                                             {
  // kBtagPriority mode first adds the b jets, then the light jets
  // If your 6th or 7th jet is a b jet, then you probably want this option
 
  // If container has less jets than required, raise error
  if (m_failOnLessThanXJets) {
    if (jets.size() < maxJets) {
      ANA_MSG_ERROR("KLFitterTool::setJetskBtagPriority: You required "
                    << maxJets << " jets. Event has " << jets.size()
                    << " jets!");
      return StatusCode::FAILURE;
    }
  }
 
  unsigned int totalJets(0);
 
  // First find the b-jets
  unsigned int index(0);
  for (const xAOD::Jet *jet : jets) {
    if (totalJets >= maxJets)
      break;
 
    if (!m_bTagDecoAcc->isAvailable(*jet)) {
      ANA_MSG_ERROR("RunKLFitterAlg::setJetskLeadingX: jet does not have "
                    << m_bTagDecoration.value() << " aux variable!");
      return StatusCode::FAILURE;
    }
 
    if ((*m_bTagDecoAcc)(*jet)) {
      TLorentzVector jet_p4;
      jet_p4.SetPtEtaPhiE(jet->pt() / 1.e3, jet->eta(), jet->phi(),
                          jet->e() / 1.e3);
 
      if (m_bTaggingMethodEnum ==
          KLFitter::LikelihoodBase::BtaggingMethod::kWorkingPoint) {
        float eff(0), ineff(0);
        ANA_CHECK(retrieveEfficiencies(jet, &eff, &ineff));
 
        inputParticles->AddParticle(
            &jet_p4, jet_p4.Eta(), KLFitter::Particles::kParton, "", index,
            true, eff, 1. / ineff, KLFitter::Particles::kNone);
      } else {
        inputParticles->AddParticle(&jet_p4, jet_p4.Eta(),
                                    KLFitter::Particles::kParton, "", index,
                                    true);
      }
      ++totalJets;
    }  // is b-tagged
 
    ++index;
  }  // for (jet)
 
  // Second, find the light jets
  index = 0;
  for (const xAOD::Jet *jet : jets) {
    if (totalJets >= maxJets)
      break;
    if (!(*m_bTagDecoAcc)(*jet)) {
      TLorentzVector jet_p4;
      jet_p4.SetPtEtaPhiE(jet->pt() / 1.e3, jet->eta(), jet->phi(),
                          jet->e() / 1.e3);
 
      if (m_bTaggingMethodEnum ==
          KLFitter::LikelihoodBase::BtaggingMethod::kWorkingPoint) {
        float eff(0), ineff(0);
        ANA_CHECK(retrieveEfficiencies(jet, &eff, &ineff));
 
        inputParticles->AddParticle(
            &jet_p4, jet_p4.Eta(), KLFitter::Particles::kParton, "", index,
            false, eff, 1. / ineff, KLFitter::Particles::kNone);
      } else {
        inputParticles->AddParticle(&jet_p4, jet_p4.Eta(),
                                    KLFitter::Particles::kParton, "", index,
                                    false);
      }
      ++totalJets;
    }  // not-btagged jet
 
    ++index;
  }  // for (jet)
  return StatusCode::SUCCESS;
}

setJetskLeadingN()

StatusCode EventReco::RunKLFitterAlg::setJetskLeadingN ( const std::vector< const xAOD::Jet * > &  jets, KLFitter::Particles *  inputParticles, const size_t  njets  )

private

Definition at line 493 of file RunKLFitterAlg.cxx.

                                                     {
 
  // If container has less jets than required, raise error
  if (m_failOnLessThanXJets) {
    if (jets.size() < njets) {
      ANA_MSG_ERROR("KLFitterTool::setJetskLeadingX: You required "
                    << njets << " jets. Event has " << jets.size() << " jets!");
      return StatusCode::FAILURE;
    }
  }
 
  size_t index(0);
 
  for (const xAOD::Jet *jet : jets) {
    if (index > njets - 1)
      break;
 
    TLorentzVector jet_p4;
    jet_p4.SetPtEtaPhiE(jet->pt() / 1.e3, jet->eta(), jet->phi(),
                        jet->e() / 1.e3);
 
    float eff(0), ineff(0);
 
    if (!m_bTagDecoAcc->isAvailable(*jet)) {
      ANA_MSG_ERROR("RunKLFitterAlg::setJetskLeadingX: jet does not have "
                    << m_bTagDecoration.value() << " aux variable!");
      return StatusCode::FAILURE;
    }
 
    const bool isTagged = (*m_bTagDecoAcc)(*jet);
 
    if (m_bTaggingMethodEnum ==
        KLFitter::LikelihoodBase::BtaggingMethod::kWorkingPoint) {
      ANA_CHECK(retrieveEfficiencies(jet, &eff, &ineff))
 
      inputParticles->AddParticle(
          &jet_p4, jet_p4.Eta(), KLFitter::Particles::kParton, "", index,
          isTagged, eff, 1. / ineff, KLFitter::Particles::kNone);
    } else {
      inputParticles->AddParticle(&jet_p4, jet_p4.Eta(),
                                  KLFitter::Particles::kParton, "", index,
                                  isTagged);
    }
    ++index;
  }
  return StatusCode::SUCCESS;
}

sortPt()

template<typename T >

std::vector<const T *> EventReco::RunKLFitterAlg::sortPt ( const std::vector< const T * > &  particles, std::vector< size_t > &  indices  )

inlineprivate

Definition at line 80 of file RunKLFitterAlg.h.

                                                            {
    std::vector<std::pair<const T *, size_t>> particle_index(particles.size());
    size_t indx{0};
    for (const T *const p : particles) {
      particle_index[indx] = {p, indx};
      ++indx;
    }
    std::sort(
        particle_index.begin(), particle_index.end(),
        [](std::pair<const T *, size_t> &x, std::pair<const T *, size_t> &y) {
          return x.first->pt() > y.first->pt();
        });
    std::vector<const T *> sorted_particles(particles.size());
    indx = 0;
    indices.resize(particles.size());
    for (auto &elem : particle_index) {
      sorted_particles[indx] = elem.first;
      indices[indx] = elem.second;
      ++indx;
    }
    return sorted_particles;
  }

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthAlgorithm.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

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

sysStart()

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

overridevirtualinherited

Handle START transition.

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

tree()

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

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 378 of file AthHistogramming.cxx.

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

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

m_bTagDecoAcc

std::unique_ptr<SG::AuxElement::ConstAccessor<char> > EventReco::RunKLFitterAlg::m_bTagDecoAcc

private

Definition at line 214 of file RunKLFitterAlg.h.

m_bTagDecoration

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_bTagDecoration

private

Initial value:

{
      this, "BTaggingDecoration", "",
      "Name of the btag decision decoration for jets"}

Definition at line 155 of file RunKLFitterAlg.h.

m_btagging_eff_tool

ToolHandle<IBTaggingEfficiencyTool> EventReco::RunKLFitterAlg::m_btagging_eff_tool

private

Initial value:

{
      this, "btagEffTool", "", "the b-tagging efficiency tool"}

Definition at line 211 of file RunKLFitterAlg.h.

m_bTaggingMethod

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_bTaggingMethod

private

Initial value:

{
      this, "BTaggingMethod", "kNotag",
      "Method for accounting b-tagging information"}

Definition at line 152 of file RunKLFitterAlg.h.

m_bTaggingMethodEnum

KLFitter::LikelihoodBase::BtaggingMethod EventReco::RunKLFitterAlg::m_bTaggingMethodEnum {}

private

Definition at line 187 of file RunKLFitterAlg.h.

m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 208 of file AthHistogramming.h.

m_electronSelection

CP::SysReadSelectionHandle EventReco::RunKLFitterAlg::m_electronSelection

private

Initial value:

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

Definition at line 110 of file RunKLFitterAlg.h.

m_electronsHandle

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

private

Initial value:

{
      this, "electrons", "", "the electron container to use"}

Definition at line 108 of file RunKLFitterAlg.h.

m_eventInfoHandle

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

private

Initial value:

{
      this, "eventInfo", "EventInfo",
      "the EventInfo container to read selection deciosions from"}

Definition at line 126 of file RunKLFitterAlg.h.

m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 79 of file AthAlgorithm.h.

m_failOnLessThanXJets

Gaudi::Property<bool> EventReco::RunKLFitterAlg::m_failOnLessThanXJets

private

Initial value:

{
      this, "FailOnLessThanXJets", false,
      "Fail if kLeadingX or kBtagPriorityXJets is set and the number of jets "
      "in the event is less than X"}

Definition at line 172 of file RunKLFitterAlg.h.

m_fixedTopMass

Gaudi::Property<bool> EventReco::RunKLFitterAlg::m_fixedTopMass

private

Initial value:

{
      this, "TopMassFixed", true,
      "If the top quark mass is fixed in the likelihood to the value of "
      "TopMass parameter"}

Definition at line 164 of file RunKLFitterAlg.h.

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 222 of file AthHistogramming.h.

m_hasBeginInputFile

bool EL::AnaAlgorithm::m_hasBeginInputFile {false}

privateinherited

the value of hasBeginInputFile

Definition at line 590 of file AnaAlgorithm.h.

m_hasEndInputFile

bool EL::AnaAlgorithm::m_hasEndInputFile {false}

privateinherited

the value of hasEndInputFile

Definition at line 594 of file AnaAlgorithm.h.

m_hasFileExecute

bool EL::AnaAlgorithm::m_hasFileExecute {false}

privateinherited

the value of hasFileExecute

Definition at line 586 of file AnaAlgorithm.h.

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 201 of file AthHistogramming.h.

m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix

privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix

privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc

privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix

privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix

privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

m_inputMetaStore

MetaStore_t EL::AnaAlgorithm::m_inputMetaStore

privateinherited

Object accessing the input metadata store.

Definition at line 551 of file AnaAlgorithm.h.

m_jetSelection

CP::SysReadSelectionHandle EventReco::RunKLFitterAlg::m_jetSelection

private

Initial value:

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

Definition at line 120 of file RunKLFitterAlg.h.

m_jetSelectionMode

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_jetSelectionMode

private

Initial value:

{
      this, "JetSelectionMode", "kBtagPriorityFourJets",
      "Define the behavior for selecting jets"}

Definition at line 149 of file RunKLFitterAlg.h.

m_jetSelectionModeEnum

KLFEnums::JetSelectionMode EventReco::RunKLFitterAlg::m_jetSelectionModeEnum {}

private

Definition at line 179 of file RunKLFitterAlg.h.

m_jetSelectionModeKLFitterEnum

KLFEnums::JetSelectionMode EventReco::RunKLFitterAlg::m_jetSelectionModeKLFitterEnum {}

private

Definition at line 186 of file RunKLFitterAlg.h.

m_jetsHandle

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

private

Initial value:

{
      this, "jets", "", "the jet container to use"}

Definition at line 118 of file RunKLFitterAlg.h.

m_leptonType

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_leptonType

private

Initial value:

{this, "LeptonType", "kUndefined",
                                            "Define the lepton type"}

Definition at line 141 of file RunKLFitterAlg.h.

m_leptonTypeEnum

KLFEnums::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeEnum {}

private

Definition at line 177 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum

KLFitter::LikelihoodTopLeptonJets::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum {}

private

Definition at line 189 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum_Angular

KLFitter::LikelihoodTopLeptonJets_Angular::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum_Angular {}

private

Definition at line 194 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum_BoostedLJets

KLFitter::BoostedLikelihoodTopLeptonJets::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum_BoostedLJets {}

private

Definition at line 197 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum_JetAngles

KLFitter::LikelihoodTopLeptonJets_JetAngles::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum_JetAngles {}

private

Definition at line 192 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum_TTH

KLFitter::LikelihoodTTHLeptonJets::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum_TTH {}

private

Definition at line 190 of file RunKLFitterAlg.h.

m_leptonTypeKLFitterEnum_TTZ

KLFitter::LikelihoodTTZTrilepton::LeptonType EventReco::RunKLFitterAlg::m_leptonTypeKLFitterEnum_TTZ {}

private

Definition at line 195 of file RunKLFitterAlg.h.

m_LHType

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_LHType

private

Initial value:

{this, "LHType", "kUndefined",
                                        "Define the Likelihood type"}

Definition at line 143 of file RunKLFitterAlg.h.

m_LHTypeEnum

KLFEnums::Likelihood EventReco::RunKLFitterAlg::m_LHTypeEnum {}

private

Definition at line 178 of file RunKLFitterAlg.h.

m_massTop

Gaudi::Property<float> EventReco::RunKLFitterAlg::m_massTop

private

Initial value:

{
      this, "TopMass", 172.5,
      "The mass of top quark used in KLFitter likelihood (assuming the fixed "
      "m_top mode is used)"}

Definition at line 160 of file RunKLFitterAlg.h.

m_metHandle

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

private

Initial value:

{
      this, "met", "", "the MET container to use"}

Definition at line 123 of file RunKLFitterAlg.h.

m_METterm

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_METterm

private

Initial value:

{this, "METterm", "Final",
                                         "Which MET term should be used"}

Definition at line 158 of file RunKLFitterAlg.h.

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 248 of file AthHistogramming.h.

m_muonSelection

CP::SysReadSelectionHandle EventReco::RunKLFitterAlg::m_muonSelection

private

Initial value:

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

Definition at line 115 of file RunKLFitterAlg.h.

m_muonsHandle

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

private

Initial value:

{
      this, "muons", "", "the muon container to use"}

Definition at line 113 of file RunKLFitterAlg.h.

m_myDetector

std::unique_ptr<KLFitter::DetectorAtlas_8TeV> EventReco::RunKLFitterAlg::m_myDetector

private

Definition at line 185 of file RunKLFitterAlg.h.

m_myFitter

std::unique_ptr<KLFitter::Fitter> EventReco::RunKLFitterAlg::m_myFitter

private

Definition at line 184 of file RunKLFitterAlg.h.

m_myLikelihood

std::unique_ptr<KLFitter::LikelihoodTopLeptonJets> EventReco::RunKLFitterAlg::m_myLikelihood

private

Definition at line 199 of file RunKLFitterAlg.h.

m_myLikelihood_AllHadronic

std::unique_ptr<KLFitter::LikelihoodTopAllHadronic> EventReco::RunKLFitterAlg::m_myLikelihood_AllHadronic

private

Definition at line 207 of file RunKLFitterAlg.h.

m_myLikelihood_Angular

std::unique_ptr<KLFitter::LikelihoodTopLeptonJets_Angular> EventReco::RunKLFitterAlg::m_myLikelihood_Angular

private

Definition at line 204 of file RunKLFitterAlg.h.

m_myLikelihood_BoostedLJets

std::unique_ptr<KLFitter::BoostedLikelihoodTopLeptonJets> EventReco::RunKLFitterAlg::m_myLikelihood_BoostedLJets

private

Definition at line 209 of file RunKLFitterAlg.h.

m_myLikelihood_JetAngles

std::unique_ptr<KLFitter::LikelihoodTopLeptonJets_JetAngles> EventReco::RunKLFitterAlg::m_myLikelihood_JetAngles

private

Definition at line 202 of file RunKLFitterAlg.h.

m_myLikelihood_TTH

std::unique_ptr<KLFitter::LikelihoodTTHLeptonJets> EventReco::RunKLFitterAlg::m_myLikelihood_TTH

private

Definition at line 200 of file RunKLFitterAlg.h.

m_myLikelihood_TTZ

std::unique_ptr<KLFitter::LikelihoodTTZTrilepton> EventReco::RunKLFitterAlg::m_myLikelihood_TTZ

private

Definition at line 205 of file RunKLFitterAlg.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 245 of file AthHistogramming.h.

m_njetsRequirement

size_t EventReco::RunKLFitterAlg::m_njetsRequirement {0}

private

Definition at line 182 of file RunKLFitterAlg.h.

m_outHandle

CP::SysWriteHandle<xAOD::KLFitterResultContainer, xAOD::KLFitterResultAuxContainer> EventReco::RunKLFitterAlg::m_outHandle

private

Initial value:

{this, "result", "KLFitterResult_%SYS%",
                  "the output KLFitterResultContainer"}

Definition at line 133 of file RunKLFitterAlg.h.

m_outputMetaStore

MetaStore_t EL::AnaAlgorithm::m_outputMetaStore

privateinherited

Object accessing the output metadata store.

Definition at line 555 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_saveAllPermutations

Gaudi::Property<bool> EventReco::RunKLFitterAlg::m_saveAllPermutations

private

Initial value:

{
      this, "SaveAllPermutations", false,
      "Whether to store only the permutation with highest KLFitter event "
      "probability, or all"}

Definition at line 168 of file RunKLFitterAlg.h.

m_selection

CP::SysReadSelectionHandle EventReco::RunKLFitterAlg::m_selection

private

Initial value:

{this, "selectionDecorationName", "",
                                         "Name of the selection on which this "
                                         "KLFitter instance is allowed to run"}

Definition at line 136 of file RunKLFitterAlg.h.

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file)

Definition at line 226 of file AthHistogramming.h.

m_systematicsList

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

private

Definition at line 105 of file RunKLFitterAlg.h.

m_transferFunctionsPath

Gaudi::Property<std::string> EventReco::RunKLFitterAlg::m_transferFunctionsPath

private

Initial value:

{
      this, "TransferFunctionsPath",
      "dev/AnalysisTop/KLFitterTFs/mc12a/akt4_LCtopo_PP6/",
      "Path to transfer functions"}

Definition at line 145 of file RunKLFitterAlg.h.

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 215 of file AthHistogramming.h.

m_useBtagPriority

bool EventReco::RunKLFitterAlg::m_useBtagPriority {false}

private

Definition at line 181 of file RunKLFitterAlg.h.

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• RunKLFitterAlg.h
• RunKLFitterAlg.cxx