CP::SSVWeightsAlg Class Reference

#include <SSVWeightsAlg.h>

Inheritance diagram for CP::SSVWeightsAlg:

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

Public Member Functions
	SSVWeightsAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute () override
::StatusCode	requestFileExecute ()
	register this algorithm to have an implementation of fileexecute
::StatusCode	requestBeginInputFile ()
	register this algorithm to have an implementation of beginInputFile
::StatusCode	requestEndInputFile ()
	register this algorithm to have an implementation of endInputFile
void	handle (const Incident &inc)
	receive the given incident
virtual StatusCode	sysInitialize ()
	Initialization method invoked by the framework.
const ServiceHandle< ITHistSvc > &	histSvc () const
	The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const
ConstMetaStorePtr_t	inputMetaStore () const
MetaStorePtr_t	inputMetaStore ()
ConstMetaStorePtr_t	outputMetaStore () const
MetaStorePtr_t	outputMetaStore ()

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

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

Private Member Functions
std::vector< const xAOD::Vertex * >	create_good_SSVs (const std::vector< const xAOD::Jet * > &jets, const std::vector< const xAOD::Electron * > &electrons, const std::vector< const xAOD::Muon * > &muons, const std::vector< const xAOD::Vertex * > &SSVs) const
std::vector< const xAOD::TruthParticle * >	create_accepted_truthBhs (const std::vector< const xAOD::TruthParticle * > &truthBhs, const std::vector< const xAOD::Jet * > &jets) const
int	count_number_of_fake_SSVs (const std::vector< const xAOD::TruthParticle * > &truthBhs, const std::vector< const xAOD::Vertex * > &SSVs) const
std::vector< bool >	truthBh_to_SSV_matching (const std::vector< const xAOD::TruthParticle * > &truthBhs, const std::vector< const xAOD::Vertex * > &SSVs) const
const std::vector< const xAOD::TruthParticle * >	construct_not_matched_vectors (const std::vector< const xAOD::TruthParticle * > &truthBhs, const std::vector< bool > &matched_vector) const
double	compute_DeltaR_between_SSV_and_particle (const xAOD::Vertex *vtx, const xAOD::IParticle *part) const
double	poisson_pmf (const int k, const double lambda) const
int	count_matched_objects (const std::vector< bool > &matching_vector) const
int	count_not_matched_objects (const std::vector< bool > &matching_vector) const
bool	isHFHadronFinalState (const xAOD::TruthParticle *part, const int type) const
double	calculate_P_ineff_Bhadron_pt_eta_based (const std::vector< const xAOD::TruthParticle * > &accepted_truthBh, const std::vector< bool > &truthBh_to_SSV_matched, double SF_eff) const
double	calculate_P_ineff_bjet_based (const int b_jet_count, const int N_missed, const double SF_eff) const
double	calculate_P_fake_pileup_bjet_based (const double muactual, const int b_jet_count, const int N_fake, const double SF_fake_low, const double SF_fake_high) const
double	calculate_P_fake_pileup_based_linearfit (const double muactual, const int N_fake) const
double	calculate_P_fake_pileup_based_binned (const double muactual, const int N_fake, const double SF_fake_low, const double SF_fake_high) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>
void	buildBookingString (std::string &bookingString, std::string &histName, std::string &tDir, std::string &stream, bool usePrefixPostfix=false)
	Method to build individual booking string.
void	myReplace (std::string &str, const std::string &oldStr, const std::string &newStr)
	Helper method to replace sub-string.
hash_t	hash (const std::string &histName) const
	Method to calculate a 32-bit hash from a string.

Private Attributes
std::string	m_jsonConfigPath_SSVWeightsAlg
std::string	m_BTagging_WP
nlohmann::json	m_jsonConfig_SSVWeightsAlg
std::string	m_OverlapRemoval
std::string	m_Jvt
std::string	m_efficiency_Method
std::string	m_nF_Method
std::string	m_OutputVariable_Size
const double	m_lowMuHighMuThreshold = 42.93
CP::SysListHandle	m_systematicsList {this}
CP::SysReadHandle< xAOD::EventInfo >	m_eventInfoHandle
CP::SysReadHandle< xAOD::TruthParticleContainer >	m_truthParticlesHandle
CP::SysReadHandle< xAOD::JetContainer >	m_jetsHandle
CP::SysReadHandle< xAOD::ElectronContainer >	m_electronsHandle
CP::SysReadHandle< xAOD::MuonContainer >	m_muonsHandle
CP::SysReadHandle< xAOD::VertexContainer >	m_ssvHandle
CP::SysWriteDecorHandle< float >	m_SSV_weight_decor {this, "SSV_weight", "SSV_weight_%SYS%", "SSV weight defined as a product of the correction factors: SSV_weight = P_eff * P_ineff * P_fake"}
CP::SysWriteDecorHandle< float >	m_N_matched_decor {this, "N_matched", "N_matched_%SYS%", "number of matched b-hadrons in an event; so number of b-hadrons in acceptance that satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}
CP::SysWriteDecorHandle< float >	m_N_missed_decor {this, "N_missed", "N_missed_%SYS%", "number of missed b-hadrons in an event; so number of b-hadrons that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}
CP::SysWriteDecorHandle< float >	m_N_fake_decor {this, "N_fake", "N_fake_%SYS%", "number of fake SSVs in an event; so number of good SSVs in acceptance that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}
CP::SysWriteDecorHandle< float >	m_P_eff_decor {this, "P_eff", "P_eff_%SYS%", "efficiency correction factor"}
CP::SysWriteDecorHandle< float >	m_P_ineff_decor {this, "P_ineff", "P_ineff_%SYS%", "inefficiency correction factor"}
CP::SysWriteDecorHandle< float >	m_P_fake_decor {this, "P_fake", "P_fake_%SYS%", "fake correction factor"}
CP::SysWriteDecorHandle< float >	m_number_of_bjets_decor {this, "number_of_bjets", "number_of_bjets_%SYS%", "number of b-jets in an event"}
CP::SysWriteDecorHandle< float >	m_number_of_accepted_Bhadrons_decor {this, "number_of_accepted_Bhadrons", "number_of_accepted_Bhadrons_%SYS%", "number of b-hadrons in acceptance in an event"}
CP::SysWriteDecorHandle< float >	m_number_of_good_SSVs_decor {this, "number_of_good_SSVs", "number_of_good_SSVs_%SYS%", "number of good SSVs in an event"}
CP::SysWriteDecorHandle< float >	m_P_ineff_bjet_based_decor {this, "P_ineff_bjet_based", "P_ineff_bjet_based_%SYS%", "inefficiency correction factor calculated according to the 'bjet_based' efficiency_Method"}
CP::SysWriteDecorHandle< float >	m_P_ineff_pt_eta_based_decor {this, "P_ineff_pt_eta_based", "P_ineff_pt_eta_based_%SYS%", "inefficiency correction factor calculated according to the 'Bhadron_pT_eta_based' efficiency_Method"}
CP::SysWriteDecorHandle< float >	m_P_fake_pileup_bjet_based_decor {this, "P_fake_pileup_bjet_based", "P_fake_pileup_bjet_based_%SYS%", "fake correction factor calculated according to the 'pileup_bjet_based' nF_Method"}
CP::SysWriteDecorHandle< float >	m_P_fake_pileup_based_linearfit_decor {this, "P_fake_pileup_based_linearfit", "P_fake_pileup_based_linearfit_%SYS%", "fake correction factor calculated according to the 'pileup_based_linearfit' nF_Method"}
CP::SysWriteDecorHandle< float >	m_P_fake_pileup_based_binned_decor {this, "P_fake_pileup_based_binned", "P_fake_pileup_based_binned_%SYS%", "fake correction factor calculated accoring to the 'pileup_based_binned' nF_Method"}
MetaStore_t	m_inputMetaStore
	Object accessing the input metadata store.
MetaStore_t	m_outputMetaStore
	Object accessing the output metadata store.
bool	m_hasFileExecute {false}
	the value of hasFileExecute
bool	m_hasBeginInputFile {false}
	the value of hasBeginInputFile
bool	m_hasEndInputFile {false}
	the value of hasEndInputFile
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();.
std::string	m_prefix
	Name of the ROOT output stream (file)
std::string	m_rootDir
	Name of the ROOT directory.
std::string	m_histNamePrefix
	The prefix for the histogram THx name.
std::string	m_histNamePostfix
	The postfix for the histogram THx name.
std::string	m_histTitlePrefix
	The prefix for the histogram THx title.
std::string	m_histTitlePostfix
	The postfix for the histogram THx title.
DataObjIDColl	m_extendedExtraObjects
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers.
EffMap_t	m_effMap
	The map of histogram names to their pointers.
TreeMap_t	m_treeMap
	The map of TTree names to their pointers.
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers.
std::string	m_streamName
	Name of the ROOT output stream (file)
std::string	m_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Static Private Attributes
static const SG::AuxElement::ConstAccessor< float >	m_ssv_pt_accessor
static const SG::AuxElement::ConstAccessor< float >	m_ssv_m_accessor
static const SG::AuxElement::ConstAccessor< float >	m_ssv_eta_accessor
static const SG::AuxElement::ConstAccessor< float >	m_ssv_phi_accessor

Detailed Description

Definition at line 33 of file SSVWeightsAlg.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.

Constructor & Destructor Documentation

SSVWeightsAlg()

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

Definition at line 15 of file SSVWeightsAlg.cxx.

    : EL::AnaAlgorithm(name, pSvcLocator){
    declareProperty("JsonConfigFile_SSVWeightsAlg",m_jsonConfigPath_SSVWeightsAlg, "Path to the JSON config file that contains the SSV calibration results which are needed to calculate the SSV weights");
    declareProperty("BTagging_WP", m_BTagging_WP, "b-tagging working point that is used to count the number of b-jets in the event for b-jet based SSV weight calculation");
    declareProperty("OverlapRemoval", m_OverlapRemoval, "string that will be used in the overlap removal accessor for jets, electrons and muons; empty string means no overlap removal will be applied");
    declareProperty("Jvt", m_Jvt, "string that will be used in the jvt accessor for jets; empty string means no jvt selection will be applied");
    declareProperty("efficiency_Method", m_efficiency_Method, "efficiency definition that will be used to calculate the SSV weights, string can be 'Bhadron_pT_eta_based' or 'bjet_based'");
    declareProperty("nF_Method", m_nF_Method, "average number of fake SSV definition that will be used to calculate the SSV weights, string can be 'pileup_bjet_based','pileup_based_linearfit' or 'pileup_based_binned'");  
    declareProperty("OutputVariable_Size", m_OutputVariable_Size, "number of variables that will be saved to the output, string can be 'standard','extended','additional' or 'all'"); 
  }

Member Function Documentation

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

calculate_P_fake_pileup_based_binned()

double CP::SSVWeightsAlg::calculate_P_fake_pileup_based_binned ( const double muactual, const int N_fake, const double SF_fake_low, const double SF_fake_high ) const

private

Definition at line 626 of file SSVWeightsAlg.cxx.

                                    {
    // Extract bin edges and values from the JSON configuration
    std::vector<double> muactualbins = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_binned"]["muactual_bins"].get<std::vector<double>>();
    std::vector<double> nFbins = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_binned"]["values"].get<std::vector<double>>();
 
    double nF = 0;
    double P_fake3 = 1;
 
    // Find the correct bin for muactual
    for (size_t j = 0; j < muactualbins.size() - 1; ++j) {
      if (muactual >= muactualbins[j] && muactual < muactualbins[j + 1]) {
        nF = nFbins[j];
        if (muactual < m_lowMuHighMuThreshold) {
          P_fake3 = poisson_pmf(N_fake, SF_fake_low * nF) / poisson_pmf(N_fake, nF);
        } else {
          P_fake3 = poisson_pmf(N_fake, SF_fake_high * nF) / poisson_pmf(N_fake, nF);
        }
        break; // Bin found, no need to continue loop
      }
    }
    return P_fake3;
  }

calculate_P_fake_pileup_based_linearfit()

double CP::SSVWeightsAlg::calculate_P_fake_pileup_based_linearfit ( const double muactual, const int N_fake ) const

private

Definition at line 605 of file SSVWeightsAlg.cxx.

                           {
    // Extract slopes and intercepts from JSON
    double slope_unscaled = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_linearfit"]["unscaled"]["slope"];
    double intercept_unscaled = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_linearfit"]["unscaled"]["intercept"];
 
    double slope_scaled = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_linearfit"]["scaled"]["slope"];
    double intercept_scaled = m_jsonConfig_SSVWeightsAlg["nF_pileup_based_linearfit"]["scaled"]["intercept"];
 
    // Calculate expected counts
    double n_F = slope_unscaled * muactual + intercept_unscaled;
    double n_F_scaled = slope_scaled * muactual + intercept_scaled;
 
    // Calculate P_fake
    double P_fake2 = poisson_pmf(N_fake, n_F_scaled) / poisson_pmf(N_fake, n_F);
 
    return P_fake2;
  }

calculate_P_fake_pileup_bjet_based()

double CP::SSVWeightsAlg::calculate_P_fake_pileup_bjet_based ( const double muactual, const int b_jet_count, const int N_fake, const double SF_fake_low, const double SF_fake_high ) const

private

Definition at line 567 of file SSVWeightsAlg.cxx.

                                    {
 
    double P_fake = 1;  
    // 2D map muactual and Nbjets
    std::string mu_key = (muactual >= m_lowMuHighMuThreshold) ? "high_muactual" : "low_muactual";
 
    // Build the bjets key string
    std::string bjets_key = std::to_string(b_jet_count) + "_bjets";
    // Get the value
 
    double n_F_value = 0;
 
    if (b_jet_count<5 && b_jet_count>0){
      n_F_value = m_jsonConfig_SSVWeightsAlg["nF_pileup_bjet_based"][mu_key][bjets_key];
    }
    if (b_jet_count>4){
      n_F_value = m_jsonConfig_SSVWeightsAlg["nF_pileup_bjet_based"][mu_key]["4_bjets"];
    }
    if (b_jet_count<1){
      n_F_value = m_jsonConfig_SSVWeightsAlg["nF_pileup_bjet_based"][mu_key]["1_bjets"];
    }
 
    if (muactual >= m_lowMuHighMuThreshold){
      P_fake = (poisson_pmf(N_fake, SF_fake_high*n_F_value))/poisson_pmf(N_fake, n_F_value);
    }
    else {
      P_fake = (poisson_pmf(N_fake, SF_fake_low*n_F_value))/poisson_pmf(N_fake, n_F_value);
    }
 
    return P_fake;
  }

calculate_P_ineff_Bhadron_pt_eta_based()

double CP::SSVWeightsAlg::calculate_P_ineff_Bhadron_pt_eta_based ( const std::vector< const xAOD::TruthParticle * > & accepted_truthBh, const std::vector< bool > & truthBh_to_SSV_matched, double SF_eff ) const

private

Definition at line 486 of file SSVWeightsAlg.cxx.

                        {
    //construct missed truthBhs
    const std::vector<const xAOD::TruthParticle*> missed_truthBhs = construct_not_matched_vectors(accepted_truthBhs, truthBh_to_SSV_matched);
 
    //read off pt bins from JSON file
    const std::vector<double> &ptbins = m_jsonConfig_SSVWeightsAlg["Efficiency_pt_eta_based"]["pt_bins"];
 
    double P_ineff2 = 1;
    for (size_t i = 0; i < missed_truthBhs.size(); ++i) { 
      //retrieve pt,eta of missed truthBh
      double pt = missed_truthBhs[i]->pt();
      double eta = std::abs(missed_truthBhs[i]->eta());
      std::string pt_bin_of_truthBh = "";
      // iterate pt bins to find appropriate efficiency bin for the truthBh pT
      for (size_t j = 0; j < ptbins.size() - 1; ++j) {
        if (pt >= ptbins[j] && pt < ptbins[j+1]) {
          //construct pt bin name
          pt_bin_of_truthBh = "pt_bin_" + std::to_string((int)ptbins[j]) + "_" + std::to_string((int)ptbins[j+1]);
        }
        if (pt > 100000){
          pt_bin_of_truthBh = "pt_bin_43500_100000";
        }
      }
      if (pt_bin_of_truthBh == ""){
        //no pt bin found or no missed truthBh"
        continue;
      }
      //retrieve eta and efficiency bins for the pT bin
      const std::vector<double>& eta_bins = m_jsonConfig_SSVWeightsAlg["Efficiency_pt_eta_based"][pt_bin_of_truthBh]["eta"];
      const std::vector<double>& efficiencies = m_jsonConfig_SSVWeightsAlg["Efficiency_pt_eta_based"][pt_bin_of_truthBh]["efficiency"];
    
      double efficiency = 1;
 
      //iterate eta bins to find appropriate eta bin for truthBh eta
      for (size_t k = 0; k < eta_bins.size() - 1; ++k) {
        double eta_low = eta_bins[k];
        double eta_up = eta_bins[k+1];
        if (eta >= eta_low && eta < eta_up) {
          //eta bin found -> read off corresponding efficiency
          efficiency = efficiencies[k];
        }
      }
      //calculate P_ineff using the found efficiency
      P_ineff2 = P_ineff2*(1-SF_eff*efficiency)/(1-efficiency);
    }
    return P_ineff2;
  }

calculate_P_ineff_bjet_based()

double CP::SSVWeightsAlg::calculate_P_ineff_bjet_based ( const int b_jet_count, const int N_missed, const double SF_eff ) const

private

Definition at line 538 of file SSVWeightsAlg.cxx.

                              {
 
    double P_ineff = 1;  
    // Build the bjets key string
    std::string bjets_key = std::to_string(b_jet_count) + "_bjets";
    // Get the value
 
    double epsilon = 1;
 
    //retrieve efficiency and average number of fake SSV depending on number of jets in event
    if (b_jet_count<5 && b_jet_count>0){
      epsilon = m_jsonConfig_SSVWeightsAlg["Efficiency_bjet_based"][bjets_key];
    }
    if (b_jet_count > 4){
      epsilon = m_jsonConfig_SSVWeightsAlg["Efficiency_bjet_based"]["4_bjets"];      
    }
    if (b_jet_count < 1){
      epsilon = m_jsonConfig_SSVWeightsAlg["Efficiency_bjet_based"]["1_bjets"];      
    }
 
    P_ineff = std::pow((1-SF_eff*epsilon)/(1-epsilon), N_missed);
 
    return P_ineff;
  }

compute_DeltaR_between_SSV_and_particle()

double CP::SSVWeightsAlg::compute_DeltaR_between_SSV_and_particle ( const xAOD::Vertex * vtx, const xAOD::IParticle * part ) const

private

Definition at line 395 of file SSVWeightsAlg.cxx.

                                      {
 
    static const SG::AuxElement::ConstAccessor<float> ssv_eta_accessor("bvrtEta");      
    static const SG::AuxElement::ConstAccessor<float> ssv_phi_accessor("bvrtPhi");      
    // Compute delta eta between vertex and particle 
    double eta_diff = ssv_eta_accessor(*vtx) - part->eta() ;
 
    // Compute delta phi between vertex and particle 
    // See TLorentzVector::DeltaR function 
    double phi_diff = TVector2::Phi_mpi_pi(ssv_phi_accessor(*vtx) - part->phi() );
 
    // Compute deltaR between vertex and particle
    return std::sqrt( eta_diff*eta_diff + phi_diff*phi_diff );
  }

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

construct_not_matched_vectors()

const std::vector< const xAOD::TruthParticle * > CP::SSVWeightsAlg::construct_not_matched_vectors ( const std::vector< const xAOD::TruthParticle * > & truthBhs, const std::vector< bool > & matched_vector ) const

private

Definition at line 429 of file SSVWeightsAlg.cxx.

                                                 {
 
    std::vector<const xAOD::TruthParticle*> missed_vector;
    for (size_t i = 0; i < truthBhs.size(); ++i){
      if (matched_vector[i] == false){
        missed_vector.push_back(truthBhs[i]);
      }
    }
    return missed_vector;
  };

count_matched_objects()

int CP::SSVWeightsAlg::count_matched_objects ( const std::vector< bool > & matching_vector ) const

private

Definition at line 414 of file SSVWeightsAlg.cxx.

                                                  {
 
    // Count the number of times true appears in the vector  
    return std::count(matching_vector.begin(), matching_vector.end(), true);
  }

count_not_matched_objects()

int CP::SSVWeightsAlg::count_not_matched_objects ( const std::vector< bool > & matching_vector ) const

private

Definition at line 423 of file SSVWeightsAlg.cxx.

                                                  {
 
    return matching_vector.size() - count_matched_objects(matching_vector);
  }

count_number_of_fake_SSVs()

int CP::SSVWeightsAlg::count_number_of_fake_SSVs ( const std::vector< const xAOD::TruthParticle * > & truthBhs, const std::vector< const xAOD::Vertex * > & SSVs ) const

private

Definition at line 347 of file SSVWeightsAlg.cxx.

                                                    {
    
    int N_fake_SSV = 0;
    for (const xAOD::Vertex* SSV : SSVs){      
      bool foundMatch = false;
      for (const xAOD::TruthParticle* truthBh : truthBhs){
        double DeltaR = compute_DeltaR_between_SSV_and_particle(SSV, truthBh);
        if (DeltaR < 0.3){
          foundMatch = true;
          break;
        }
      }
      if (!foundMatch){
        // In this case no match was found between the current SSV and any truth particle 
        // Hence it is a fake SSV 
        // Increase the number of fake SSV counter 
        N_fake_SSV = N_fake_SSV + 1;
      }
    }
    return N_fake_SSV;
  }

create_accepted_truthBhs()

std::vector< const xAOD::TruthParticle * > CP::SSVWeightsAlg::create_accepted_truthBhs ( const std::vector< const xAOD::TruthParticle * > & truthBhs, const std::vector< const xAOD::Jet * > & jets ) const

private

Definition at line 316 of file SSVWeightsAlg.cxx.

                                                 {
 
    std::vector<const xAOD::TruthParticle*> accepted_truthBhs;
  
    for (const xAOD::TruthParticle* truthBh : truthBhs) {
      // Check if truthBh fails truthBh in acceptance definition
      if (truthBh->pt() < 2000 || (std::abs(truthBh->eta()) > 2.8)){
        continue;
      }
 
      // check if truthBh overlaps with jet
      bool overlaps = false;
      for (const xAOD::Jet* jet : jets) {
        double  DeltaR = truthBh->p4().DeltaR(jet->p4());
        if (DeltaR<0.6){
          overlaps = true;
          break;
        }
      }
      
      if (overlaps == true){
        continue;
      }
 
      accepted_truthBhs.push_back(truthBh);
    }
    return accepted_truthBhs;
  };

create_good_SSVs()

std::vector< const xAOD::Vertex * > CP::SSVWeightsAlg::create_good_SSVs ( const std::vector< const xAOD::Jet * > & jets, const std::vector< const xAOD::Electron * > & electrons, const std::vector< const xAOD::Muon * > & muons, const std::vector< const xAOD::Vertex * > & SSVs ) const

private

Definition at line 253 of file SSVWeightsAlg.cxx.

                                                    {
 
    static const SG::AuxElement::ConstAccessor<float> ssv_pt_accessor(("bvrtPt"));
    static const SG::AuxElement::ConstAccessor<float> ssv_m_accessor("bvrtM");
    static const SG::AuxElement::ConstAccessor<float> ssv_eta_accessor("bvrtEta");
 
    std::vector<const xAOD::Vertex*> good_SSVs;
 
    for (const xAOD::Vertex* SSV : SSVs) {
      bool overlaps = false;
 
      //check if SSV fails good SSV definition
      if ( (ssv_pt_accessor(*SSV) < 3000) || (ssv_m_accessor(*SSV) < 600) || (std::abs(ssv_eta_accessor(*SSV)) > 2.5) ){
        continue;
      }
 
      //check if SSV overlaps with jet
      for (const xAOD::Jet* jet : jets) {
        double DeltaR_jet = compute_DeltaR_between_SSV_and_particle( SSV , jet );
        if (DeltaR_jet < 0.6){
          overlaps = true;
          break;
        }
      }
 
      if (overlaps == true){
        continue;
      }
      //check if SSV overlaps with electron
      for (const xAOD::Electron* electron : electrons) {
        double DeltaR_el = compute_DeltaR_between_SSV_and_particle( SSV , electron );
        if (DeltaR_el < 0.2){
          overlaps = true;
          break;
        }
      }
 
      if (overlaps == true){
        continue;
      }
 
      //check if SSV overlaps with muon
      for (const xAOD::Muon* muon : muons) {
        double DeltaR_mu = compute_DeltaR_between_SSV_and_particle( SSV , muon );
        if (DeltaR_mu < 0.2){
          overlaps = true;
          break;
        }
      }
 
      if (overlaps == true){
        continue;
      }
      good_SSVs.push_back(SSV);
    }
    return good_SSVs;
  };

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 250 of file AthHistogramming.cxx.

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

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

evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute()

StatusCode CP::SSVWeightsAlg::execute ( )

overridevirtual

Definition at line 73 of file SSVWeightsAlg.cxx.

                                    {
  
    for (const auto &sys : m_systematicsList.systematicsVector()){ 
      const xAOD::EventInfo *evtInfo = nullptr;
      ANA_CHECK(m_eventInfoHandle.retrieve(evtInfo, sys));
 
      const xAOD::VertexContainer* vertices = nullptr;
      ANA_CHECK(m_ssvHandle.retrieve(vertices, sys));
 
      // create SSVs
      std::vector<const xAOD::Vertex*> SSVs;
      for(const xAOD::Vertex* ssvvtx : *vertices){
        SSVs.push_back(ssvvtx);
      }
 
      //create jets
      const xAOD::JetContainer *jets = nullptr;
      ANA_CHECK(m_jetsHandle.retrieve(jets, sys));
 
      std::vector<const xAOD::Jet*> jets_PassedORJvt;
 
      int b_jet_count=0;
 
      static const SG::AuxElement::ConstAccessor<char> jet_btag_accessor(m_BTagging_WP);
 
      bool useOR = !m_OverlapRemoval.empty(); 
      static const SG::AuxElement::ConstAccessor<char> particle_passesOR_accessor(useOR ? m_OverlapRemoval : "passesOR");  // placeholder string (will never be used if !useOR)
 
      bool useJvt = !m_Jvt.empty(); 
      static const SG::AuxElement::ConstAccessor<char> jet_jvt_selection_accessor(useJvt ? m_Jvt : "jvt_selection");  // placeholder string (will never be used if !useJvt)
 
      //create jets that pass overlap removal and jvt
      for(const xAOD::Jet* jet : *jets){
        char jet_passesOR_char = useOR ? particle_passesOR_accessor(*jet) : 1; // fallback: always true
        char jet_jvt_selection_char = useJvt ? jet_jvt_selection_accessor(*jet) : 1; // fallback: always true
 
        if (jet_passesOR_char && jet_jvt_selection_char){
          jets_PassedORJvt.push_back(jet);
          
          // Count number of bjets
          if (jet_btag_accessor(*jet)){
            b_jet_count = b_jet_count+1;
          }
        }
      }
 
      // create electrons
      const xAOD::ElectronContainer *electrons = nullptr;
      ANA_CHECK(m_electronsHandle.retrieve(electrons, sys));
      
      std::vector<const xAOD::Electron*> electrons_PassedOR;
 
      //create electrons that pass overlap removal
      for(const xAOD::Electron* electron : *electrons){
        char electron_passesOR_char = useOR ? particle_passesOR_accessor(*electron) : 1; // fallback: always true
        if (electron_passesOR_char){
          electrons_PassedOR.push_back (electron);
        }
      }
 
      //create muons
      const xAOD::MuonContainer *muons = nullptr;
      ANA_CHECK(m_muonsHandle.retrieve(muons, sys));
      std::vector<const xAOD::Muon*> muons_PassedOR;
 
      //create muons that pass overlap removal
      for(const xAOD::Muon* muon : *muons){
        char muon_passesOR_char = useOR ? particle_passesOR_accessor(*muon) : 1; // fallback: always true
        if (muon_passesOR_char){
          muons_PassedOR.push_back( muon );
        }
      }
 
      // create good SSVs
      std::vector<const xAOD::Vertex*> good_SSVs = create_good_SSVs(jets_PassedORJvt, electrons_PassedOR, muons_PassedOR, SSVs);
 
      //create truth b-hadrons (truthBhs)
      std::vector<const xAOD::TruthParticle*> truthBhs;
 
      const xAOD::TruthParticleContainer *particles = nullptr;
      ANA_CHECK(m_truthParticlesHandle.retrieve(particles, sys));
 
      for (const xAOD::TruthParticle *part : *particles){
        if ( part->isBottomHadron() && isHFHadronFinalState(part, 5) ){ 
          truthBhs.push_back(part);
        }
      }
 
 
      //create truthBhs in acceptance
      std::vector<const xAOD::TruthParticle*> accepted_truthBhs = create_accepted_truthBhs(truthBhs, jets_PassedORJvt);
 
      //do the DeltaR matching between truthBh and SSV
      std::vector<bool> truthBh_to_SSV_matched = truthBh_to_SSV_matching(accepted_truthBhs, good_SSVs);
 
      //count matched truthBh,missed truthBh (not matched truthBh) and number of fake SSV (not matched SSV)
      int N_matched = count_matched_objects(truthBh_to_SSV_matched);
      int N_missed = count_not_matched_objects(truthBh_to_SSV_matched);
      int N_fake = count_number_of_fake_SSVs(accepted_truthBhs, good_SSVs);
 
      // retrieve scale factors and pileup
      double SF_eff = m_jsonConfig_SSVWeightsAlg["CalibrationScaleFactors"]["SF_eff"];
      double SF_fake_low = m_jsonConfig_SSVWeightsAlg["CalibrationScaleFactors"]["SF_fake"]["mu_low"];
      double SF_fake_high = m_jsonConfig_SSVWeightsAlg["CalibrationScaleFactors"]["SF_fake"]["mu_high"];
 
      double muactual = evtInfo->actualInteractionsPerCrossing();
 
      // calculate P_eff
      double P_eff = std::pow(SF_eff, N_matched);
 
      //calculate P_ineff
      double P_ineff = 1;
      if (m_efficiency_Method == "bjet_based"){
        P_ineff = calculate_P_ineff_bjet_based(b_jet_count, N_missed,SF_eff);
      }
      else if (m_efficiency_Method == "Bhadron_pT_eta_based"){
        P_ineff = calculate_P_ineff_Bhadron_pt_eta_based(accepted_truthBhs, truthBh_to_SSV_matched, SF_eff);
      }
      else {
        ATH_MSG_ERROR("No efficiency computation defined for method=" << m_efficiency_Method); 
        return StatusCode::FAILURE;
      } 
 
 
      // calculate P_fake
      double P_fake = 1;
      if (m_nF_Method == "pileup_bjet_based"){
        P_fake = calculate_P_fake_pileup_bjet_based(muactual, b_jet_count, N_fake,SF_fake_low, SF_fake_high);
      }
      else if (m_nF_Method == "pileup_based_linearfit"){
        P_fake = calculate_P_fake_pileup_based_linearfit(muactual, N_fake);
      }
      else if (m_nF_Method == "pileup_based_binned"){
        P_fake = calculate_P_fake_pileup_based_binned(muactual, N_fake, SF_fake_low, SF_fake_high);
      }
      else { 
        ATH_MSG_ERROR("No fake computation defined for method=" << m_nF_Method); 
        return StatusCode::FAILURE;
      }
 
 
      //calculate SSV_weight
      double SSV_weight = P_eff * P_ineff * P_fake;
 
      // decorate SSV weight
      m_SSV_weight_decor.set(*evtInfo, SSV_weight, sys);
 
      // decorate P factors 
      m_P_eff_decor.set(*evtInfo, P_eff, sys);
      m_P_ineff_decor.set(*evtInfo, P_ineff, sys);
      m_P_fake_decor.set(*evtInfo, P_fake, sys);
 
      //decorate additional information
      m_N_matched_decor.set(*evtInfo, N_matched, sys);
      m_N_missed_decor.set(*evtInfo, N_missed, sys);
      m_N_fake_decor.set(*evtInfo, N_fake, sys);
 
      m_number_of_bjets_decor.set(*evtInfo, b_jet_count, sys);
      m_number_of_accepted_Bhadrons_decor.set(*evtInfo, accepted_truthBhs.size(), sys);
      m_number_of_good_SSVs_decor.set(*evtInfo, good_SSVs.size(), sys);
 
      //decorate all possible P factors
      if (m_OutputVariable_Size == "all"){
        double P_ineff_bjet_based = calculate_P_ineff_bjet_based(b_jet_count, N_missed,SF_eff);
        double P_ineff_pt_eta_based = calculate_P_ineff_Bhadron_pt_eta_based(accepted_truthBhs, truthBh_to_SSV_matched, SF_eff);
        double P_fake_pileup_bjet_based = calculate_P_fake_pileup_bjet_based(muactual, b_jet_count, N_fake, SF_fake_low, SF_fake_high);
        double P_fake_pileup_based_linearfit = calculate_P_fake_pileup_based_linearfit(muactual, N_fake);
        double P_fake_pileup_based_binned = calculate_P_fake_pileup_based_binned(muactual, N_fake, SF_fake_low, SF_fake_high);
 
        m_P_ineff_bjet_based_decor.set(*evtInfo, P_ineff_bjet_based, sys);
        m_P_ineff_pt_eta_based_decor.set(*evtInfo, P_ineff_pt_eta_based, sys);
        m_P_fake_pileup_bjet_based_decor.set(*evtInfo, P_fake_pileup_bjet_based, sys);
        m_P_fake_pileup_based_linearfit_decor.set(*evtInfo, P_fake_pileup_based_linearfit, sys);
        m_P_fake_pileup_based_binned_decor.set(*evtInfo, P_fake_pileup_based_binned, sys);
      }
    }
    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 CP::SSVWeightsAlg::initialize ( )

overridevirtual

Definition at line 26 of file SSVWeightsAlg.cxx.

                                       {
 
    ANA_MSG_INFO("Initialising SSVWeightsAlg");
    ANA_MSG_INFO("WARNING: The Run3 SSV calibration has not been performed yet -> the scale factors are not usable yet");
 
    ANA_CHECK(m_jetsHandle.initialize(m_systematicsList));
    ANA_CHECK(m_electronsHandle.initialize(m_systematicsList));
    ANA_CHECK(m_muonsHandle.initialize(m_systematicsList));
    ANA_CHECK(m_eventInfoHandle.initialize(m_systematicsList));
    ANA_CHECK(m_truthParticlesHandle.initialize(m_systematicsList));
    ANA_CHECK(m_SSV_weight_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_ssvHandle.initialize(m_systematicsList));
 
    ANA_CHECK(m_N_matched_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_N_missed_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_N_fake_decor.initialize(m_systematicsList, m_eventInfoHandle));
 
    ANA_CHECK(m_P_eff_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_ineff_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_fake_decor.initialize(m_systematicsList, m_eventInfoHandle));
 
    ANA_CHECK(m_number_of_bjets_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_number_of_accepted_Bhadrons_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_number_of_good_SSVs_decor.initialize(m_systematicsList, m_eventInfoHandle));
 
    ANA_CHECK(m_P_ineff_bjet_based_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_ineff_pt_eta_based_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_fake_pileup_bjet_based_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_fake_pileup_based_linearfit_decor.initialize(m_systematicsList, m_eventInfoHandle));
    ANA_CHECK(m_P_fake_pileup_based_binned_decor.initialize(m_systematicsList, m_eventInfoHandle));
 
    ANA_CHECK(m_systematicsList.initialize());
 
    //retrieve the JSON file
    std::string json_file_SSVWeightsAlg=PathResolver::find_file(m_jsonConfigPath_SSVWeightsAlg, "DATAPATH");
    std::ifstream jsonFile_SSVWeightsAlg(json_file_SSVWeightsAlg);
    if (!jsonFile_SSVWeightsAlg.is_open()) {
      ANA_MSG_ERROR("Could not open JSON file: " << m_jsonConfigPath_SSVWeightsAlg);
      return StatusCode::FAILURE;
    }
 
    m_jsonConfig_SSVWeightsAlg = json::parse(jsonFile_SSVWeightsAlg);
    jsonFile_SSVWeightsAlg.close();
 
    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
  }

isHFHadronFinalState()

bool CP::SSVWeightsAlg::isHFHadronFinalState ( const xAOD::TruthParticle * part, const int type ) const

private

Definition at line 443 of file SSVWeightsAlg.cxx.

                          {
 
    for (unsigned int i = 0; i < part->nChildren(); ++i){
      const xAOD::TruthParticle *child = part->child(i);
      if (!child){
        continue;
      }
      if (type == 5){
        if (child->isBottomHadron()){
          return false;
        }
        if (child->isGenStable()){
          if (!isHFHadronFinalState(child, type)){
            return false;
          }
        }
      }
    
      if (type == 4){
        if (child->isCharmHadron()){
          return false;
        }
        if (child->isGenStable()){
          if (!isHFHadronFinalState(child, type)){
            return false;
          }
        }
      }
    }
    return true;
  }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

myReplace()

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

privateinherited

Helper method to replace sub-string.

Definition at line 590 of file AthHistogramming.cxx.

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

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

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
  }

poisson_pmf()

double CP::SSVWeightsAlg::poisson_pmf ( const int k, const double lambda ) const

private

Definition at line 477 of file SSVWeightsAlg.cxx.

                               {
    // Returns $P(k;\lambda) = \frac{e^{-\lambda}\lambda^k}{k!}$ 
    boost::math::poisson distrib(lambda);
    return boost::math::pdf(distrib, k);
  }

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

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

truthBh_to_SSV_matching()

std::vector< bool > CP::SSVWeightsAlg::truthBh_to_SSV_matching ( const std::vector< const xAOD::TruthParticle * > & truthBhs, const std::vector< const xAOD::Vertex * > & SSVs ) const

private

Definition at line 375 of file SSVWeightsAlg.cxx.

                                                    {
  
    std::vector<bool> matched_vector(truthBhs.size(), false);
    for (size_t i = 0; i < truthBhs.size(); ++i){
      const xAOD::TruthParticle* truthBh = truthBhs[i];
      for (size_t j = 0; j < SSVs.size(); ++j){
        const xAOD::Vertex* SSV = SSVs[j];  
        double DeltaR = compute_DeltaR_between_SSV_and_particle(SSV, truthBh);
        if (DeltaR < 0.3){
          matched_vector[i] = true;
          break;
        }
      }
    }
    return matched_vector;
  };

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_BTagging_WP

std::string CP::SSVWeightsAlg::m_BTagging_WP

private

Definition at line 42 of file SSVWeightsAlg.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_efficiency_Method

std::string CP::SSVWeightsAlg::m_efficiency_Method

private

Definition at line 46 of file SSVWeightsAlg.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_electronsHandle

CP::SysReadHandle<xAOD::ElectronContainer> CP::SSVWeightsAlg::m_electronsHandle

private

Initial value:

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

Definition at line 129 of file SSVWeightsAlg.h.

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

m_eventInfoHandle

CP::SysReadHandle<xAOD::EventInfo> CP::SSVWeightsAlg::m_eventInfoHandle

private

Initial value:

{
      this, "eventInfo", "EventInfo", "the EventInfo container"}

Definition at line 119 of file SSVWeightsAlg.h.

                                                    {
      this, "eventInfo", "EventInfo", "the EventInfo container"};

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_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.

{false};

m_hasEndInputFile

bool EL::AnaAlgorithm::m_hasEndInputFile {false}

privateinherited

the value of hasEndInputFile

Definition at line 594 of file AnaAlgorithm.h.

{false};

m_hasFileExecute

bool EL::AnaAlgorithm::m_hasFileExecute {false}

privateinherited

the value of hasFileExecute

Definition at line 586 of file AnaAlgorithm.h.

{false};

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_jetsHandle

CP::SysReadHandle<xAOD::JetContainer> CP::SSVWeightsAlg::m_jetsHandle

private

Initial value:

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

Definition at line 125 of file SSVWeightsAlg.h.

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

m_jsonConfig_SSVWeightsAlg

nlohmann::json CP::SSVWeightsAlg::m_jsonConfig_SSVWeightsAlg

private

Definition at line 43 of file SSVWeightsAlg.h.

m_jsonConfigPath_SSVWeightsAlg

std::string CP::SSVWeightsAlg::m_jsonConfigPath_SSVWeightsAlg

private

Definition at line 41 of file SSVWeightsAlg.h.

m_Jvt

std::string CP::SSVWeightsAlg::m_Jvt

private

Definition at line 45 of file SSVWeightsAlg.h.

m_lowMuHighMuThreshold

const double CP::SSVWeightsAlg::m_lowMuHighMuThreshold = 42.93

private

Definition at line 49 of file SSVWeightsAlg.h.

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 248 of file AthHistogramming.h.

m_muonsHandle

CP::SysReadHandle<xAOD::MuonContainer> CP::SSVWeightsAlg::m_muonsHandle

private

Initial value:

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

Definition at line 132 of file SSVWeightsAlg.h.

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

m_N_fake_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_N_fake_decor {this, "N_fake", "N_fake_%SYS%", "number of fake SSVs in an event; so number of good SSVs in acceptance that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}

private

Definition at line 148 of file SSVWeightsAlg.h.

{this, "N_fake", "N_fake_%SYS%", "number of fake SSVs in an event; so number of good SSVs in acceptance that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"};

m_N_matched_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_N_matched_decor {this, "N_matched", "N_matched_%SYS%", "number of matched b-hadrons in an event; so number of b-hadrons in acceptance that satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}

private

Definition at line 146 of file SSVWeightsAlg.h.

{this, "N_matched", "N_matched_%SYS%", "number of matched b-hadrons in an event; so number of b-hadrons in acceptance that satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"};

m_N_missed_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_N_missed_decor {this, "N_missed", "N_missed_%SYS%", "number of missed b-hadrons in an event; so number of b-hadrons that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"}

private

Definition at line 147 of file SSVWeightsAlg.h.

{this, "N_missed", "N_missed_%SYS%", "number of missed b-hadrons in an event; so number of b-hadrons that do not satisfy ΔR(b-hadron in acceptance, good SSV)<0.3"};

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 245 of file AthHistogramming.h.

m_nF_Method

std::string CP::SSVWeightsAlg::m_nF_Method

private

Definition at line 47 of file SSVWeightsAlg.h.

m_number_of_accepted_Bhadrons_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_number_of_accepted_Bhadrons_decor {this, "number_of_accepted_Bhadrons", "number_of_accepted_Bhadrons_%SYS%", "number of b-hadrons in acceptance in an event"}

private

Definition at line 155 of file SSVWeightsAlg.h.

{this, "number_of_accepted_Bhadrons", "number_of_accepted_Bhadrons_%SYS%", "number of b-hadrons in acceptance in an event"};

m_number_of_bjets_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_number_of_bjets_decor {this, "number_of_bjets", "number_of_bjets_%SYS%", "number of b-jets in an event"}

private

Definition at line 154 of file SSVWeightsAlg.h.

{this, "number_of_bjets", "number_of_bjets_%SYS%", "number of b-jets in an event"};

m_number_of_good_SSVs_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_number_of_good_SSVs_decor {this, "number_of_good_SSVs", "number_of_good_SSVs_%SYS%", "number of good SSVs in an event"}

private

Definition at line 156 of file SSVWeightsAlg.h.

{this, "number_of_good_SSVs", "number_of_good_SSVs_%SYS%", "number of good SSVs in an event"};

m_outputMetaStore

MetaStore_t EL::AnaAlgorithm::m_outputMetaStore

privateinherited

Object accessing the output metadata store.

Definition at line 555 of file AnaAlgorithm.h.

m_OutputVariable_Size

std::string CP::SSVWeightsAlg::m_OutputVariable_Size

private

Definition at line 48 of file SSVWeightsAlg.h.

m_OverlapRemoval

std::string CP::SSVWeightsAlg::m_OverlapRemoval

private

Definition at line 44 of file SSVWeightsAlg.h.

m_P_eff_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_eff_decor {this, "P_eff", "P_eff_%SYS%", "efficiency correction factor"}

private

Definition at line 150 of file SSVWeightsAlg.h.

{this, "P_eff", "P_eff_%SYS%", "efficiency correction factor"};

m_P_fake_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_fake_decor {this, "P_fake", "P_fake_%SYS%", "fake correction factor"}

private

Definition at line 152 of file SSVWeightsAlg.h.

{this, "P_fake", "P_fake_%SYS%", "fake correction factor"};

m_P_fake_pileup_based_binned_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_fake_pileup_based_binned_decor {this, "P_fake_pileup_based_binned", "P_fake_pileup_based_binned_%SYS%", "fake correction factor calculated accoring to the 'pileup_based_binned' nF_Method"}

private

Definition at line 162 of file SSVWeightsAlg.h.

{this, "P_fake_pileup_based_binned", "P_fake_pileup_based_binned_%SYS%", "fake correction factor calculated accoring to the 'pileup_based_binned' nF_Method"};

m_P_fake_pileup_based_linearfit_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_fake_pileup_based_linearfit_decor {this, "P_fake_pileup_based_linearfit", "P_fake_pileup_based_linearfit_%SYS%", "fake correction factor calculated according to the 'pileup_based_linearfit' nF_Method"}

private

Definition at line 161 of file SSVWeightsAlg.h.

{this, "P_fake_pileup_based_linearfit", "P_fake_pileup_based_linearfit_%SYS%", "fake correction factor calculated according to the 'pileup_based_linearfit' nF_Method"};

m_P_fake_pileup_bjet_based_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_fake_pileup_bjet_based_decor {this, "P_fake_pileup_bjet_based", "P_fake_pileup_bjet_based_%SYS%", "fake correction factor calculated according to the 'pileup_bjet_based' nF_Method"}

private

Definition at line 160 of file SSVWeightsAlg.h.

{this, "P_fake_pileup_bjet_based", "P_fake_pileup_bjet_based_%SYS%", "fake correction factor calculated according to the 'pileup_bjet_based' nF_Method"};

m_P_ineff_bjet_based_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_ineff_bjet_based_decor {this, "P_ineff_bjet_based", "P_ineff_bjet_based_%SYS%", "inefficiency correction factor calculated according to the 'bjet_based' efficiency_Method"}

private

Definition at line 158 of file SSVWeightsAlg.h.

{this, "P_ineff_bjet_based", "P_ineff_bjet_based_%SYS%", "inefficiency correction factor calculated according to the 'bjet_based' efficiency_Method"};

m_P_ineff_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_ineff_decor {this, "P_ineff", "P_ineff_%SYS%", "inefficiency correction factor"}

private

Definition at line 151 of file SSVWeightsAlg.h.

{this, "P_ineff", "P_ineff_%SYS%", "inefficiency correction factor"};

m_P_ineff_pt_eta_based_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_P_ineff_pt_eta_based_decor {this, "P_ineff_pt_eta_based", "P_ineff_pt_eta_based_%SYS%", "inefficiency correction factor calculated according to the 'Bhadron_pT_eta_based' efficiency_Method"}

private

Definition at line 159 of file SSVWeightsAlg.h.

{this, "P_ineff_pt_eta_based", "P_ineff_pt_eta_based_%SYS%", "inefficiency correction factor calculated according to the 'Bhadron_pT_eta_based' efficiency_Method"};

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_ssv_eta_accessor

const SG::AuxElement::ConstAccessor<float> CP::SSVWeightsAlg::m_ssv_eta_accessor

staticprivate

Definition at line 141 of file SSVWeightsAlg.h.

m_ssv_m_accessor

const SG::AuxElement::ConstAccessor<float> CP::SSVWeightsAlg::m_ssv_m_accessor

staticprivate

Definition at line 140 of file SSVWeightsAlg.h.

m_ssv_phi_accessor

const SG::AuxElement::ConstAccessor<float> CP::SSVWeightsAlg::m_ssv_phi_accessor

staticprivate

Definition at line 142 of file SSVWeightsAlg.h.

m_ssv_pt_accessor

const SG::AuxElement::ConstAccessor<float> CP::SSVWeightsAlg::m_ssv_pt_accessor

staticprivate

Definition at line 139 of file SSVWeightsAlg.h.

m_SSV_weight_decor

CP::SysWriteDecorHandle<float> CP::SSVWeightsAlg::m_SSV_weight_decor {this, "SSV_weight", "SSV_weight_%SYS%", "SSV weight defined as a product of the correction factors: SSV_weight = P_eff * P_ineff * P_fake"}

private

Definition at line 144 of file SSVWeightsAlg.h.

{this, "SSV_weight", "SSV_weight_%SYS%", "SSV weight defined as a product of the correction factors: SSV_weight = P_eff * P_ineff * P_fake"};

m_ssvHandle

CP::SysReadHandle<xAOD::VertexContainer> CP::SSVWeightsAlg::m_ssvHandle

private

Initial value:

{
      this, "NVSI_WP", "", "The NewVrtSecInclusiveTool output container to use (NewVrtSecInclusiveTool = algorithm that constructs the soft secondary vertices (SSVs))"}

Definition at line 136 of file SSVWeightsAlg.h.

                                                    {
      this, "NVSI_WP", "", "The NewVrtSecInclusiveTool output container to use (NewVrtSecInclusiveTool = algorithm that constructs the soft secondary vertices (SSVs))"};

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 CP::SSVWeightsAlg::m_systematicsList {this}

private

Definition at line 118 of file SSVWeightsAlg.h.

{this};

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_truthParticlesHandle

CP::SysReadHandle<xAOD::TruthParticleContainer> CP::SSVWeightsAlg::m_truthParticlesHandle

private

Initial value:

{
      this, "TruthParticleContainer", "TruthParticles", "input TruthParticles container"}

Definition at line 122 of file SSVWeightsAlg.h.

                                                                      {
      this, "TruthParticleContainer", "TruthParticles", "input TruthParticles container"};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• SSVWeightsAlg.h
• SSVWeightsAlg.cxx