CP::SecVertexTruthMatchAlg Class Reference

Algorithm to perform truth matching on secondary vertices. More...

#include <SecVertexTruthMatchAlg.h>

Inheritance diagram for CP::SecVertexTruthMatchAlg:

Collaboration diagram for CP::SecVertexTruthMatchAlg:

Classes
struct	RecoVertexHists
	cached pointers to the histograms of one reco vertex category More...

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

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

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

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

Private Member Functions
void	fillRecoHistograms (const xAOD::Vertex *secVtx, const std::vector< const RecoVertexHists * > &categories)
void	fillTruthHistograms (const xAOD::TruthVertex *truthVtx, const std::string &truthType)
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>
std::string	buildBookingString (std::string_view histName, std::string_view tDir, std::string_view stream, bool usePrefixPostfix=false) const
	Method to build individual booking string.
hash_t	hash (std::string_view histName) const
	Method to calculate a 32-bit hash from a string.

Private Attributes
SG::ReadHandleKey< xAOD::VertexContainer >	m_secVtxContainerKey
SG::ReadHandleKey< xAOD::TruthVertexContainer >	m_truthVtxContainerKey
SG::ReadHandleKey< xAOD::TrackParticleContainer >	m_trackParticleContainerKey
Gaudi::Property< std::vector< int > >	m_targetPDGIDs {this, "TargetPDGIDs", {}, "List of PDGIDs to select for matching"}
Gaudi::Property< bool >	m_writeHistograms {this, "WriteHistograms", true, "Write histograms"}
ToolHandle< IInDetSecVtxTruthMatchTool >	m_matchTool {this, "MatchTool", "InDetSecVtxTruthMatchTool"}
Gaudi::Property< bool >	m_doMuSA {this, "doMuSA", false, "MuSA mode for wider histogram ranges"}
Gaudi::Property< bool >	m_doSMOrigin {this, "doSMOrigin", false, "Enable SM origin categorization"}
std::unordered_map< std::string, RecoVertexHists >	m_recoHists
MetaStore_t	m_inputMetaStore
	Object accessing the input metadata store.
MetaStore_t	m_outputMetaStore
	Object accessing the output metadata store.
bool	m_hasFileExecute {false}
	the value of hasFileExecute
bool	m_hasBeginInputFile {false}
	the value of hasBeginInputFile
bool	m_hasEndInputFile {false}
	the value of hasEndInputFile
ServiceHandle< ITHistSvc >	m_histSvc
	Default constructor: AthHistogramAlgorithm();.
std::string	m_prefix
	Name of the ROOT output stream (file).
std::string	m_rootDir
	Name of the ROOT directory.
std::string	m_histNamePrefix
	The prefix for the histogram THx name.
std::string	m_histNamePostfix
	The postfix for the histogram THx name.
std::string	m_histTitlePrefix
	The prefix for the histogram THx title.
std::string	m_histTitlePostfix
	The postfix for the histogram THx title.
DataObjIDColl	m_extendedExtraObjects
	Extra output dependency collection, extended by AthAlgorithmDHUpdate to add symlinks.
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default).
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default).
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared
HistMap_t	m_histMap
	The map of histogram names to their pointers.
EffMap_t	m_effMap
	The map of histogram names to their pointers.
TreeMap_t	m_treeMap
	The map of TTree names to their pointers.
GraphMap_t	m_graphMap
	The map of TGraph names to their pointers.
std::string	m_streamName
	Name of the ROOT output stream (file).
std::string	m_name
	Instance name.
MsgStream	m_msg
	Cached Message Stream.

Detailed Description

Algorithm to perform truth matching on secondary vertices.

Author

Jackson Burzynski jacks.nosp@m.on.c.nosp@m.arl.b.nosp@m.urzy.nosp@m.nski@.nosp@m.cern.nosp@m..ch

Definition at line 37 of file SecVertexTruthMatchAlg.h.

Member Typedef Documentation

ConstMetaStorePtr_t

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

inherited

Definition at line 112 of file AnaAlgorithm.h.

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 199 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 213 of file AthHistogramming.h.

hash_t

typedef uint32_t AthHistogramming::hash_t

privateinherited

typedef for the internal hash

Definition at line 171 of file AthHistogramming.h.

HistMap_t

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

privateinherited

Typedef for convenience.

Definition at line 192 of file AthHistogramming.h.

MetaStore_t

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

inherited

Type of the metadata store variable in Athena.

Definition at line 564 of file AnaAlgorithm.h.

MetaStorePtr_t

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

inherited

Type of the metadata store pointer in Athena.

Definition at line 111 of file AnaAlgorithm.h.

StoreGateSvc_t

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

privateinherited

Definition at line 376 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 206 of file AthHistogramming.h.

Constructor & Destructor Documentation

SecVertexTruthMatchAlg()

CP::SecVertexTruthMatchAlg::SecVertexTruthMatchAlg	(	const std::string &	name,
		ISvcLocator *	svcLoc )

Regular Algorithm constructor.

Definition at line 22 of file SecVertexTruthMatchAlg.cxx.

    : EL::AnaAlgorithm( name, svcLoc ) {}

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.

Warning

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

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

The execution order of beginInputFile and fileExecute is currently unspecified.

Definition at line 353 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

book() [1/8]

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

inlineprotectedinherited

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

Definition at line 329 of file AthHistogramming.h.

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

book() [2/8]

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

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 297 of file AthHistogramming.h.

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

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 397 of file AthHistogramming.h.

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

book() [5/8]

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

inlineprotectedinherited

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

Definition at line 350 of file AthHistogramming.h.

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

book() [6/8]

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

inlineprotectedinherited

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

Definition at line 340 of file AthHistogramming.h.

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

book() [7/8]

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

inlineprotectedinherited

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

Definition at line 318 of file AthHistogramming.h.

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

book() [8/8]

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

inlineprotectedinherited

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

Definition at line 308 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 275 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 374 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 254 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 268 of file AthHistogramming.cxx.

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

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 139 of file AthHistogramming.cxx.

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

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 287 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 97 of file AthHistogramming.cxx.

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

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 266 of file AthHistogramming.h.

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

buildBookingString()

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

privateinherited

Method to build individual booking string.

Definition at line 500 of file AthHistogramming.cxx.

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

configAthHistogramming()

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

protectedinherited

To be called to fill the internal configuration.

Definition at line 64 of file AthHistogramming.cxx.

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

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 214 of file AthHistogramming.cxx.

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

endInputFile()

StatusCode EL::AnaAlgorithm::endInputFile ( )

protectedinherited

perform the action for the end of an input file

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

Warning

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

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

The execution order of endInputFile and fileExecute is currently unspecified.

Definition at line 361 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

{ return m_evtStore; }

execute() [1/2]

StatusCode CP::SecVertexTruthMatchAlg::execute ( const EventContext & ctx )

overridevirtual

execute this algorithm

Warning

Override only one of the two execute methods.

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

Reimplemented from EL::AnaAlgorithm.

Definition at line 179 of file SecVertexTruthMatchAlg.cxx.

                                                                    {
 
    //Retrieve the vertices:
    SG::ReadHandle<xAOD::VertexContainer> recoVertexContainer(m_secVtxContainerKey, ctx);
    if (!recoVertexContainer.isValid()) {
      ATH_MSG_ERROR("Failed to retrieve secondary vertex container " << m_secVtxContainerKey.key());
      return StatusCode::FAILURE;
    }
    SG::ReadHandle<xAOD::TruthVertexContainer> truthVertexContainer(m_truthVtxContainerKey, ctx);
    if (!truthVertexContainer.isValid()) {
      ATH_MSG_ERROR("Failed to retrieve truth vertex container " << m_truthVtxContainerKey.key());
      return StatusCode::FAILURE;
    }
    SG::ReadHandle<xAOD::TrackParticleContainer> trackParticleContainer(m_trackParticleContainerKey, ctx);
    if (!trackParticleContainer.isValid()) {
      ATH_MSG_ERROR("Failed to retrieve track particle container " << m_trackParticleContainerKey.key());
      return StatusCode::FAILURE;
    }
 
    std::vector<const xAOD::Vertex*> recoVerticesToMatch;
    std::vector<const xAOD::TruthVertex*> truthVerticesToMatch;
 
    for(const auto *recoVertex : *recoVertexContainer) {
      if(recoVertex->vertexType() != xAOD::VxType::SecVtx ){
        ATH_MSG_DEBUG("Vertex not labeled as secondary");
        continue;
      }
      recoVerticesToMatch.push_back(recoVertex);
    }
 
    for(const auto *truthVertex : *truthVertexContainer) {
      if(truthVertex->nIncomingParticles() != 1) {
        continue;
      }
      const xAOD::TruthParticle* truthPart = truthVertex->incomingParticle(0);
      if(not truthPart) {
        continue;
      }
      if(!std::ranges::contains(m_targetPDGIDs.value(), std::abs(truthPart->pdgId()))) {
        continue;
      }
      if(truthVertex->nOutgoingParticles() < 2) {
        continue;
      }
      truthVerticesToMatch.push_back(truthVertex);
    }
 
    //pass to the tool for decoration:
    ATH_CHECK( m_matchTool->matchVertices( recoVerticesToMatch, truthVerticesToMatch, trackParticleContainer.cptr() ) );
 
    if(m_writeHistograms) {
      static const xAOD::Vertex::ConstAccessor<int> matchTypeAcc("vertexMatchType");
      static const xAOD::Vertex::ConstAccessor<int> originTypeAcc("vertexMatchOriginType");
 
      static const std::map<InDetSecVtxTruthMatchUtils::VertexMatchOriginType, std::string> originTypeMap = {
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::FakeOrigin, "FakeOrigin"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::Pileup, "Pileup"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::KshortDecay, "KshortDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::StrangeMesonDecay, "StrangeMesonDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::LambdaDecay, "LambdaDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::StrangeBaryonDecay, "StrangeBaryonDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::TauDecay, "TauDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::GammaConversion, "GammaConversion"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::OtherDecay, "OtherDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::HadronicInteraction, "HadronicInteraction"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::OtherSecondary, "OtherSecondary"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::BHadronDecay, "BHadronDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::DHadronDecay, "DHadronDecay"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::Fragmentation, "Fragmentation"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::OtherOrigin, "OtherOrigin"},
        {InDetSecVtxTruthMatchUtils::VertexMatchOriginType::Signal, "Signal"},
      };
      //initialise references before loop
      const auto& matchedHists = m_recoHists.at("Matched");
      const auto& mergedHists  = m_recoHists.at("Merged");
      const auto& fakeHists    = m_recoHists.at("Fake");
      const auto& splitHists   = m_recoHists.at("Split");
      const auto& otherHists   = m_recoHists.at("Other");
      const auto& allHists     = m_recoHists.at("All");
      //
      std::vector<const RecoVertexHists*> categories;
      //assuming the match types are mutually exclusive, but a reasonable guess in any case
      categories.reserve(8);
      //
      for(const auto * secVtx : recoVerticesToMatch) {
        categories.clear();
        const int matchTypeBitset = matchTypeAcc(*secVtx);
        hist("RecoVertex/matchType")->Fill(matchTypeBitset);
 
        if(InDetSecVtxTruthMatchUtils::isMatched(matchTypeBitset)) {
          categories.push_back(&matchedHists);
        }
        if(InDetSecVtxTruthMatchUtils::isMerged(matchTypeBitset)) {
          categories.push_back(&mergedHists);
        }
        if(InDetSecVtxTruthMatchUtils::isFake(matchTypeBitset)) {
          categories.push_back(&fakeHists);
        }
        if(InDetSecVtxTruthMatchUtils::isSplit(matchTypeBitset)) {
          categories.push_back(&splitHists);
        }
        if(InDetSecVtxTruthMatchUtils::isOther(matchTypeBitset)) {
          categories.push_back(&otherHists);
        }
        categories.push_back(&allHists);
 
        if (m_doSMOrigin) {
          const int smOriginTypeBitset = originTypeAcc(*secVtx);
          hist("RecoVertex/smOriginType")->Fill(smOriginTypeBitset);
 
          for(const auto& [originType, name] : originTypeMap) {
            if(InDetSecVtxTruthMatchUtils::isOriginType(smOriginTypeBitset, originType)) {
              categories.push_back(&m_recoHists.at(name));
            }
          }
        }
 
        fillRecoHistograms(secVtx, categories);
      }
 
      static const xAOD::TruthVertex::ConstAccessor<int> truthTypeAcc("truthVertexMatchType");
      for(const auto * truthVtx : truthVerticesToMatch) {
        const int truthTypeBitset = truthTypeAcc(*truthVtx);
        if(InDetSecVtxTruthMatchUtils::isReconstructable(truthTypeBitset)) {
          fillTruthHistograms(truthVtx, "Reconstructable");
 
          // fill efficiencies
          efficiency("Acceptance")->Fill(InDetSecVtxTruthMatchUtils::isAccepted(truthTypeBitset), truthVtx->perp());
          efficiency("eff_total")->Fill(InDetSecVtxTruthMatchUtils::isReconstructed(truthTypeBitset), truthVtx->perp());
        }
        if(InDetSecVtxTruthMatchUtils::isAccepted(truthTypeBitset)) {
          fillTruthHistograms(truthVtx, "Accepted");
          efficiency("eff_seed")->Fill(InDetSecVtxTruthMatchUtils::isSeeded(truthTypeBitset), truthVtx->perp());
        }
        if(InDetSecVtxTruthMatchUtils::isSeeded(truthTypeBitset)) {
          fillTruthHistograms(truthVtx, "Seeded");
          efficiency("eff_core")->Fill(InDetSecVtxTruthMatchUtils::isReconstructed(truthTypeBitset), truthVtx->perp());
        }
        if(InDetSecVtxTruthMatchUtils::isReconstructed(truthTypeBitset)) {
          fillTruthHistograms(truthVtx, "Reconstructed");
        }
        if(InDetSecVtxTruthMatchUtils::isReconstructedSplit(truthTypeBitset)) {
          fillTruthHistograms(truthVtx, "ReconstructedSplit");
        }
        fillTruthHistograms(truthVtx, "Inclusive");
 
      }
      
    }
 
    return StatusCode::SUCCESS;
 
  }

execute() [2/2]

StatusCode EL::AnaAlgorithm::execute ( )

protectedinherited

execute this algorithm

Deprecated

Prefer method with EventContext.

Warning

Override only one of the two execute methods.

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

Definition at line 314 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

extraOutputDeps()

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

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 89 of file AthCommonAlgorithm.cxx.

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

fileExecute()

StatusCode EL::AnaAlgorithm::fileExecute ( )

protectedinherited

perform the action exactly once for each file in the dataset

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

Warning

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

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

The execution order of beginInputFile and fileExecute is currently unspecified.

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

Definition at line 345 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

fillRecoHistograms()

void CP::SecVertexTruthMatchAlg::fillRecoHistograms ( const xAOD::Vertex * secVtx, const std::vector< const RecoVertexHists * > & categories )

private

Definition at line 332 of file SecVertexTruthMatchAlg.cxx.

                                                                                                                               {
 
    // set of accessors for tracks and truth matching info
    xAOD::Vertex::ConstAccessor<xAOD::Vertex::TrackParticleLinks_t> trkAcc("trackParticleLinks");
    const xAOD::Vertex::ConstAccessor<std::vector<InDetSecVtxTruthMatchUtils::VertexTruthMatchInfo> > matchInfoAcc("truthVertexMatchingInfos");
 
    TVector3 reco_pos(secVtx->x(), secVtx->y(), secVtx->z());
    float Lxy = reco_pos.Perp();
 
    size_t ntracks;
    const xAOD::Vertex::TrackParticleLinks_t & trkParts = trkAcc( *secVtx );
    ntracks = trkParts.size();
 
    TLorentzVector sumP4(0,0,0,0);
    double H = 0.0;
    double HT = 0.0;
    int charge = 0;
    // NOTE: minOpAng/maxOpAng hold the cosines of the minimum/maximum opening
    // angle between two tracks, i.e. minOpAng is the largest cosine
    double minOpAng = -1.0* 1.e10;
    double maxOpAng =  1.0* 1.e10;
    double minD0 = 1.0* 1.e10;
    double maxD0 = 0.0;
    double maxDR = 0.0;
    size_t nValidTracks = 0;
 
    ATH_MSG_DEBUG("Loop over tracks");
    for(size_t t = 0; t < ntracks; t++){
      if(!trkParts[t].isValid()){
        ATH_MSG_DEBUG("Track " << t << " is bad!");
        continue;
      }
      const xAOD::TrackParticle & trk = **trkParts[t];
      ++nValidTracks;
 
      double trk_d0 = std::abs(trk.definingParameters()[0]);
      double trk_z0 = std::abs(trk.definingParameters()[1]);
 
      if(trk_d0 < minD0){ minD0 = trk_d0; }
      if(trk_d0 > maxD0){ maxD0 = trk_d0; }
 
      TLorentzVector vv;
      // TODO: use values computed w.r.t SV
      vv.SetPtEtaPhiM(trk.pt(),trk.eta(), trk.phi0(), trk.m());
      sumP4 += vv;
      H += vv.Vect().Mag();
      HT += vv.Pt();
 
      TLorentzVector v_minus_iv(0,0,0,0);
      for(size_t j = 0; j < ntracks; j++){
        if (j == t){ continue; }
        if(!trkParts[j].isValid()){
          ATH_MSG_DEBUG("Track " << j << " is bad!");
          continue;
        }
 
        const xAOD::TrackParticle & trk_2 = **trkParts[j];
 
        TLorentzVector tmp;
        // TODO: use values computed w.r.t. SV
        tmp.SetPtEtaPhiM(trk_2.pt(),trk_2.eta(), trk_2.phi0(), trk_2.m());
        v_minus_iv += tmp;
 
        if( j > t ) {
          double tm = vv * tmp / ( vv.Mag() * tmp.Mag() );
          if( minOpAng < tm ) minOpAng = tm;
          if( maxOpAng > tm ) maxOpAng = tm;
        }
      }
      double DR = vv.DeltaR(v_minus_iv);
      if( DR > maxDR ){ maxDR = DR;}
 
      charge += trk.charge();
      //coverity[UNNECESSARY_STRING_COPY]
      static const SG::ConstAccessor<float> Trk_Chi2("chiSquared");
      //coverity[UNNECESSARY_STRING_COPY]
      static const SG::ConstAccessor<float> Trk_nDoF("numberDoF");
 
      const bool hasChi2 = Trk_Chi2(trk) >0. && Trk_nDoF(trk) >0.;
      const auto& covDiag = trk.definingParametersCovMatrixDiagVec();
 
      for (const RecoVertexHists* h : categories) {
        if ( hasChi2 )  {
          h->Trk_Chi2->Fill(Trk_Chi2(trk) / Trk_nDoF(trk));
          h->Trk_nDoF->Fill(Trk_nDoF(trk));
        }
        h->Trk_D0->Fill(trk_d0);
        h->Trk_Z0->Fill(trk_z0);
        h->Trk_theta->Fill(trk.definingParameters()[3]);
        h->Trk_qOverP->Fill(trk.definingParameters()[4]);
        h->Trk_Eta->Fill(trk.eta());
        h->Trk_Phi->Fill(trk.phi0());
        h->Trk_E->Fill(trk.e() / GeV);
        h->Trk_M->Fill(trk.m() / GeV);
        h->Trk_Pt->Fill(trk.pt() / GeV);
        h->Trk_Px->Fill(trk.p4().Px() / GeV);
        h->Trk_Py->Fill(trk.p4().Py() / GeV);
        h->Trk_Pz->Fill(trk.p4().Pz() / GeV);
        h->Trk_charge->Fill(trk.charge());
        if (covDiag.size() > 1) {
          h->Trk_errD0->Fill(std::sqrt(covDiag[0]));
          h->Trk_errZ0->Fill(std::sqrt(covDiag[1]));
        }
      }
 
    } // end loop over tracks
 
    const double sumP3Mag = sumP4.Vect().Mag();
    const double recoPosMag = reco_pos.Mag();
 
    xAOD::Vertex::ConstAccessor<float> Chi2("chiSquared");
    xAOD::Vertex::ConstAccessor<float> nDoF("numberDoF");
 
    for (const RecoVertexHists* h : categories) {
      h->x->Fill(secVtx->x());
      h->y->Fill(secVtx->y());
      h->z->Fill(secVtx->z());
      h->Lxy->Fill(Lxy);
      h->ntrk->Fill(ntracks);
      h->pT->Fill(sumP4.Pt() / GeV);
      h->eta->Fill(sumP4.Eta());
      h->phi->Fill(sumP4.Phi());
      h->mass->Fill(sumP4.M() / GeV);
      if (maxDR > 0) {
        h->mu->Fill(sumP4.M() / maxDR / GeV);
      }
      h->chi2->Fill(Chi2(*secVtx)/nDoF(*secVtx));
      if (sumP3Mag > 0 && recoPosMag > 0) {
        h->dir->Fill(sumP4.Vect().Dot( reco_pos ) / sumP3Mag / recoPosMag);
      }
      h->charge->Fill(charge);
      h->H->Fill(H / GeV);
      h->HT->Fill(HT / GeV);
      if (nValidTracks > 1) {
        h->minOpAng->Fill(minOpAng);
        h->maxOpAng->Fill(maxOpAng);
      }
      if (nValidTracks > 0) {
        h->mind0->Fill(minD0);
        h->maxd0->Fill(maxD0);
      }
      h->maxdR->Fill(maxDR);
 
      // This includes all matched vertices, including splits
      if (h->matchScore_weight) {
        const auto& truthmatchinfo = matchInfoAcc(*secVtx);
        if(not truthmatchinfo.empty()){
          float matchScore_weight = std::get<1>(truthmatchinfo.at(0));
          float matchScore_pt     = std::get<2>(truthmatchinfo.at(0));
 
          ATH_MSG_DEBUG("Match Score and probability: " << matchScore_weight << " " << matchScore_pt/0.01);
 
          const ElementLink<xAOD::TruthVertexContainer>& truthVertexLink = std::get<0>(truthmatchinfo.at(0));
          const xAOD::TruthVertex& truthVtx = **truthVertexLink ;
 
          h->positionRes_R->Fill(Lxy - truthVtx.perp());
          h->positionRes_Z->Fill(secVtx->z() - truthVtx.z());
          h->matchScore_weight->Fill(matchScore_weight);
          h->matchScore_pt->Fill(matchScore_pt);
        }
      }
    }
  }

fillTruthHistograms()

void CP::SecVertexTruthMatchAlg::fillTruthHistograms ( const xAOD::TruthVertex * truthVtx, const std::string & truthType )

private

Definition at line 496 of file SecVertexTruthMatchAlg.cxx.

                                                                                                              {
 
    hist("TruthVertex/" + truthType + "_x")->Fill(truthVtx->x());
    hist("TruthVertex/" + truthType + "_y")->Fill(truthVtx->y());
    hist("TruthVertex/" + truthType + "_z")->Fill(truthVtx->z());
    hist("TruthVertex/" + truthType + "_R")->Fill(truthVtx->perp());
    hist("TruthVertex/" + truthType + "_Eta")->Fill(truthVtx->eta());
    hist("TruthVertex/" + truthType + "_Phi")->Fill(truthVtx->phi());
    hist("TruthVertex/" + truthType + "_Ntrk_out")->Fill(truthVtx->nOutgoingParticles());
 
    ATH_MSG_DEBUG("Plotting truth parent");
    const xAOD::TruthParticle& truthPart = *truthVtx->incomingParticle(0);
 
    hist("TruthVertex/" + truthType + "_Parent_E")->Fill(truthPart.e() / GeV);
    hist("TruthVertex/" + truthType + "_Parent_M")->Fill(truthPart.m() / GeV);
    hist("TruthVertex/" + truthType + "_Parent_Pt")->Fill(truthPart.pt() / GeV);
    hist("TruthVertex/" + truthType + "_Parent_Phi")->Fill(truthPart.phi());
    hist("TruthVertex/" + truthType + "_Parent_Eta")->Fill(truthPart.eta());
    hist("TruthVertex/" + truthType + "_Parent_charge")->Fill(truthPart.charge());
 
    ATH_MSG_DEBUG("Plotting truth prod vtx");
    if(truthPart.hasProdVtx()){
      const xAOD::TruthVertex & vertex = *truthPart.prodVtx();
 
      hist("TruthVertex/" + truthType + "_ParentProdX")->Fill(vertex.x());
      hist("TruthVertex/" + truthType + "_ParentProdY")->Fill(vertex.y());
      hist("TruthVertex/" + truthType + "_ParentProdZ")->Fill(vertex.z());
      hist("TruthVertex/" + truthType + "_ParentProdR")->Fill(vertex.perp());
      hist("TruthVertex/" + truthType + "_ParentProdEta")->Fill(vertex.eta());
      hist("TruthVertex/" + truthType + "_ParentProdPhi")->Fill(vertex.phi());
    }
  }

filterPassed()

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

inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

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

finalize()

StatusCode 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 331 of file AnaAlgorithm.cxx.

  {
    return StatusCode::SUCCESS;
  }

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 438 of file AthHistogramming.cxx.

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

handle()

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

inherited

receive the given incident

Guarantee

basic

Failures

incident handling errors

Definition at line 523 of file AnaAlgorithm.cxx.

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

hash()

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

inlineprivateinherited

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

Definition at line 422 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 182 of file AthHistogramming.cxx.

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

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 363 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 380 of file AthHistogramming.h.

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

histSvc()

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

inlineinherited

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

Definition at line 113 of file AthHistogramAlgorithm.h.

{
  return m_histSvc;
}

initialize()

StatusCode CP::SecVertexTruthMatchAlg::initialize ( )

overridevirtual

Definition at line 25 of file SecVertexTruthMatchAlg.cxx.

                                                {
 
    // Initializing Keys
    ATH_CHECK(m_secVtxContainerKey.initialize());
    ATH_CHECK(m_truthVtxContainerKey.initialize());
    ATH_CHECK(m_trackParticleContainerKey.initialize());
 
    // Retrieving the tool
    ATH_CHECK(m_matchTool.retrieve());
 
    if(m_writeHistograms) {
      std::vector<std::string> recoTypes{"All", "Matched", "Merged", "Fake", "Split", "Other"};
      std::vector<std::string> truthTypes{"Inclusive", "Reconstructable", "Accepted", "Seeded", "Reconstructed", "ReconstructedSplit"};
      // define SM origin categories if SM origin tracking is enabled
      std::vector<std::string> smOriginTypes;
      if(m_doSMOrigin) {
        smOriginTypes = {"FakeOrigin", "Pileup", "KshortDecay", "StrangeMesonDecay", "LambdaDecay", 
                        "StrangeBaryonDecay", "TauDecay", "GammaConversion", "OtherDecay", 
                        "HadronicInteraction", "OtherSecondary", "BHadronDecay", "DHadronDecay", 
                        "Fragmentation", "OtherOrigin", "Signal"};
      }
 
      //determine histogram ranges depending if we are in normal or MuSA mode
      //total bin counts stay the same for simplicity -- MuSA has less precision in general 
      float maxX = m_doMuSA ? 8000 : 500;
      float maxY = m_doMuSA ? 10000 : 500;
      float maxZ = m_doMuSA ? 10000 : 1500;
      float maxLxy = m_doMuSA ? 8000 : 500;
      float maxR = m_doMuSA ? 8000 : 600;
      float mind0 = m_doMuSA ? 2000 : 100;
      float maxd0 = m_doMuSA ? 2000 : 100;
      float maxTrackd0 = m_doMuSA ? 3000 : 300;
      float maxTrackz0 = m_doMuSA ? 5000 : 500;
      float maxErrd0 = m_doMuSA ? 300 : 30;
      float maxErrz0 = m_doMuSA ? 500 : 50;
 
      float maxResR = m_doMuSA ? 2000 : 20;
      float maxResZ = m_doMuSA ? 2000 : 20;
 
      ANA_CHECK (book(TH1F("RecoVertex/matchType", "Vertex Match Type", 65, -0.5, 64.5)));
      if (m_doSMOrigin) {
        ANA_CHECK (book(TH1F("RecoVertex/smOriginType", "Vertex SM Origin Type", 65537, -0.5, 65536.5)));
      }
 
      // book the reco vertex histograms of one category and cache their pointers
      auto bookRecoVertexHistos = [&](const std::string& category, bool withMatchScore) -> StatusCode {
        RecoVertexHists& h = m_recoHists[category];
        auto bookHist = [&](TH1*& target, const std::string& suffix, const char* title,
                            int nbins, double low, double high) -> StatusCode {
          const std::string name = "RecoVertex/" + category + suffix;
          ANA_CHECK (book(TH1F(name.c_str(), title, nbins, low, high)));
          target = hist(name);
          return StatusCode::SUCCESS;
        };
 
        ANA_CHECK (bookHist(h.x, "_x", "Reco vertex x [mm]", 1000, -maxX, maxX));
        ANA_CHECK (bookHist(h.y, "_y", "Reco vertex y [mm]", 1000, -maxY, maxY));
        ANA_CHECK (bookHist(h.z, "_z", "Reco vertex z [mm]", 1000, -maxZ, maxZ));
        ANA_CHECK (bookHist(h.Lxy, "_Lxy", "Reco vertex L_{xy} [mm]", 500, 0, maxLxy));
        ANA_CHECK (bookHist(h.pT, "_pT", "Reco vertex p_{T} [GeV]", 100, 0, 100));
        ANA_CHECK (bookHist(h.eta, "_eta", "Reco vertex #eta", 100, -5, 5));
        ANA_CHECK (bookHist(h.phi, "_phi", "Reco vertex #phi", 100, -std::numbers::pi, std::numbers::pi));
        ANA_CHECK (bookHist(h.mass, "_mass", "Reco vertex mass [GeV]", 500, 0, 100));
        ANA_CHECK (bookHist(h.mu, "_mu", "Reco vertex Red. Mass [GeV]", 500, 0, 100));
        ANA_CHECK (bookHist(h.chi2, "_chi2", "Reco vertex recoChi2", 100, 0, 10));
        ANA_CHECK (bookHist(h.dir, "_dir", "Reco vertex recoDirection", 100, -1, 1));
        ANA_CHECK (bookHist(h.charge, "_charge", "Reco vertex recoCharge", 20, -10, 10));
        ANA_CHECK (bookHist(h.H, "_H", "Reco vertex H [GeV]", 100, 0, 100));
        ANA_CHECK (bookHist(h.HT, "_HT", "Reco vertex Mass [GeV]", 100, 0, 100));
        ANA_CHECK (bookHist(h.minOpAng, "_minOpAng", "Reco vertex minOpAng", 100, -1, 1));
        ANA_CHECK (bookHist(h.maxOpAng, "_maxOpAng", "Reco vertex maxOpAng", 100, -1, 1));
        ANA_CHECK (bookHist(h.maxdR, "_maxdR", "Reco vertex maxDR", 100, 0, 10));
        ANA_CHECK (bookHist(h.mind0, "_mind0", "Reco vertex min d0 [mm]", 100, 0, mind0));
        ANA_CHECK (bookHist(h.maxd0, "_maxd0", "Reco vertex max d0 [mm]", 100, 0, maxd0));
        ANA_CHECK (bookHist(h.ntrk, "_ntrk", "Reco vertex n tracks", 30, 0, 30));
 
        // tracks
        ANA_CHECK (bookHist(h.Trk_qOverP, "_Trk_qOverP", "Reco track qOverP ", 100, 0, .01));
        ANA_CHECK (bookHist(h.Trk_theta, "_Trk_theta", "Reco track theta ", 64, 0, 3.2));
        ANA_CHECK (bookHist(h.Trk_E, "_Trk_E", "Reco track E ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_M, "_Trk_M", "Reco track M ", 100, 0, 10));
        ANA_CHECK (bookHist(h.Trk_Pt, "_Trk_Pt", "Reco track Pt ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_Px, "_Trk_Px", "Reco track Px ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_Py, "_Trk_Py", "Reco track Py ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_Pz, "_Trk_Pz", "Reco track Pz ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_Eta, "_Trk_Eta", "Reco track Eta ", 100, -5, 5));
        ANA_CHECK (bookHist(h.Trk_Phi, "_Trk_Phi", "Reco track Phi ", 63, -3.2, 3.2));
        ANA_CHECK (bookHist(h.Trk_D0, "_Trk_D0", "Reco track D0 ", 300, -maxTrackd0, maxTrackd0));
        ANA_CHECK (bookHist(h.Trk_Z0, "_Trk_Z0", "Reco track Z0 ", 500, -maxTrackz0, maxTrackz0));
        ANA_CHECK (bookHist(h.Trk_errD0, "_Trk_errD0", "Reco track errD0 ", 300, 0, maxErrd0));
        ANA_CHECK (bookHist(h.Trk_errZ0, "_Trk_errZ0", "Reco track errZ0 ", 500, 0, maxErrz0));
        ANA_CHECK (bookHist(h.Trk_Chi2, "_Trk_Chi2", "Reco track Chi2 ", 100, 0, 10));
        ANA_CHECK (bookHist(h.Trk_nDoF, "_Trk_nDoF", "Reco track nDoF ", 100, 0, 100));
        ANA_CHECK (bookHist(h.Trk_charge, "_Trk_charge", "Reco track charge ", 3, -1.5, 1.5));
 
        if (withMatchScore) {
          ANA_CHECK (bookHist(h.positionRes_R, "_positionRes_R", "Position resolution for vertices matched to truth decays", 400, -maxResR, maxResR));
          ANA_CHECK (bookHist(h.positionRes_Z, "_positionRes_Z", "Position resolution for vertices matched to truth decays", 400, -maxResZ, maxResZ));
          ANA_CHECK (bookHist(h.matchScore_weight, "_matchScore_weight", "Vertex Match Score (weight)", 101, 0, 1.01));
          ANA_CHECK (bookHist(h.matchScore_pt, "_matchScore_pt", "Vertex Match Score (pT)", 101, 0, 1.01));
        }
        return StatusCode::SUCCESS;
      };
 
      for(const auto& recoType : recoTypes) {
        // truth matching -- don't book for non-matched vertices
        ANA_CHECK (bookRecoVertexHistos(recoType, recoType != "All" and recoType != "Fake"));
      }
 
      // do reco vertices by SM origin if enabled -- NOTE these types are not exclusive (d decays will also be b decays in a cascade etc)
      for(const auto& smOriginType : smOriginTypes) {
        ANA_CHECK (bookRecoVertexHistos(smOriginType, false));
      }
 
      for(const auto& truthType : truthTypes) {
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_x").c_str(), "Truth vertex x [mm]", 1000, -maxX, maxX)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_y").c_str(), "Truth vertex y [mm]", 500, -maxY, maxY)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_z").c_str(), "Truth vertex z [mm]", 500, -maxZ, maxZ)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_R").c_str(), "Truth vertex r [mm]", 6000, 0, maxR)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Eta").c_str(), "Truth vertex Eta", 100, -5, 5)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Phi").c_str(), "Truth vertex Phi", 64, -3.2, 3.2)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Ntrk_out").c_str(), "Truth vertex n outgoing tracks", 100, 0, 100)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_E").c_str(), "Reco track E", 100, 0, 100)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_M").c_str(), "Reco track M", 500, 0, 500)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_Pt").c_str(), "Reco track Pt", 100, 0, 100)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_Eta").c_str(), "Reco track Eta", 100, -5, 5)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_Phi").c_str(), "Reco track Phi", 63, -3.2, 3.2)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_Parent_charge").c_str(), "Reco track charge", 3, -1, 1)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdX").c_str(), "truthParentProd vertex x [mm]", 500, -500, 500)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdY").c_str(), "truthParentProd vertex y [mm]", 500, -500, 500)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdZ").c_str(), "truthParentProd vertex z [mm]", 500, -500, 500)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdR").c_str(), "truthParentProd vertex r [mm]", 6000, 0, 600)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdEta").c_str(), "truthParentProd vertex Eta", 100, -5, 5)));
        ANA_CHECK (book(TH1F(("TruthVertex/" + truthType + "_ParentProdPhi").c_str(), "truthParentProd vertex Phi", 64, -3.2, 3.2)));
      }
 
      // now add the efficiencies
      // Define two different bin arrays - one for standard mode, one for MuSA
      const std::vector<double> bins = m_doMuSA
        ? std::vector<double>{0.0, 1, 5, 10, 20, 50, 100, 200, 300, 500, 750, 1000, 1500, 2000, 2500, 3000, 4000, 5000, 6000, 7000, 8000}
        : std::vector<double>{0.0, 0.1, 0.2, 0.3, 0.4, 0.5, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 15, 20, 25, 30, 35, 40, 50, 60, 70, 80, 90, 100, 125, 150, 200, 300, 500};
      const int nbins = std::size(bins) - 1;
 
      ANA_CHECK (book(TEfficiency("Acceptance", "Acceptance", nbins, bins.data())));
      ANA_CHECK (book(TEfficiency("eff_seed", "Seed efficiency", nbins, bins.data())));
      ANA_CHECK (book(TEfficiency("eff_core", "Core efficiency", nbins, bins.data())));
      ANA_CHECK (book(TEfficiency("eff_total", "Total efficiency", nbins, bins.data())));
      
    }
 
 
    return StatusCode::SUCCESS;
  }

inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

inputMetaStore() [1/2]

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

inherited

Definition at line 75 of file AnaAlgorithm.cxx.

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

inputMetaStore() [2/2]

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

inherited

Accessor for the input metadata store

Definition at line 66 of file AnaAlgorithm.cxx.

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

isClonable()

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

inlineoverridevirtualinherited

Specify if the algorithm is clonable.

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

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

Definition at line 68 of file AthCommonAlgorithm.h.

                                           {
    return true;
  }

isReEntrant()

virtual bool AthAlgorithm::isReEntrant ( ) const

inlinefinaloverrideprotectedvirtualinherited

Legacy algorithms are not thread-safe.

Definition at line 47 of file AthAlgorithm.h.

{ return false; }

msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

outputMetaStore() [1/2]

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

inherited

Definition at line 95 of file AnaAlgorithm.cxx.

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

outputMetaStore() [2/2]

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

inherited

Accessor for the output metadata store

Definition at line 86 of file AnaAlgorithm.cxx.

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

print()

void EL::AnaAlgorithm::print ( ) const

protectedvirtualinherited

print the state of the algorithm

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

Definition at line 339 of file AnaAlgorithm.cxx.

  {}

renounce()

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

inlineprotectedinherited

Definition at line 368 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 352 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

requestBeginInputFile()

StatusCode EL::AnaAlgorithm::requestBeginInputFile ( )

inherited

register this algorithm to have an implementation of beginInputFile

Guarantee

strong

Failures

beginInputFile not supported

Definition at line 264 of file AnaAlgorithm.cxx.

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

requestEndInputFile()

StatusCode EL::AnaAlgorithm::requestEndInputFile ( )

inherited

register this algorithm to have an implementation of endInputFile

Guarantee

strong

Failures

endInputFile not supported

Definition at line 285 of file AnaAlgorithm.cxx.

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

requestFileExecute()

StatusCode EL::AnaAlgorithm::requestFileExecute ( )

inherited

register this algorithm to have an implementation of fileexecute

Guarantee

strong

Failures

fileExecute not supported

Definition at line 243 of file AnaAlgorithm.cxx.

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

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Definition at line 99 of file AthCommonAlgorithm.h.

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

sysExecute()

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

overridevirtualinherited

Execute an algorithm.

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

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthCommonAlgorithm< Gaudi::Algorithm >.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

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

sysStart()

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

overridevirtualinherited

Handle START transition.

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

tree()

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

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 333 of file AthHistogramming.cxx.

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

updateVHKA()

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

inlineinherited

Definition at line 298 of file AthCommonDataStore.h.

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

Member Data Documentation

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 381 of file AthCommonDataStore.h.

m_doMuSA

Gaudi::Property<bool> CP::SecVertexTruthMatchAlg::m_doMuSA {this, "doMuSA", false, "MuSA mode for wider histogram ranges"}

private

Definition at line 61 of file SecVertexTruthMatchAlg.h.

{this, "doMuSA", false, "MuSA mode for wider histogram ranges"};

m_doSMOrigin

Gaudi::Property<bool> CP::SecVertexTruthMatchAlg::m_doSMOrigin {this, "doSMOrigin", false, "Enable SM origin categorization"}

private

Definition at line 62 of file SecVertexTruthMatchAlg.h.

{this, "doSMOrigin", false, "Enable SM origin categorization"};

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 202 of file AthHistogramming.h.

m_evtStore

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

privateinherited

Pointer to StoreGate (event store by default).

Definition at line 378 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 216 of file AthHistogramming.h.

m_hasBeginInputFile

bool EL::AnaAlgorithm::m_hasBeginInputFile {false}

privateinherited

the value of hasBeginInputFile

Definition at line 608 of file AnaAlgorithm.h.

{false};

m_hasEndInputFile

bool EL::AnaAlgorithm::m_hasEndInputFile {false}

privateinherited

the value of hasEndInputFile

Definition at line 612 of file AnaAlgorithm.h.

{false};

m_hasFileExecute

bool EL::AnaAlgorithm::m_hasFileExecute {false}

privateinherited

the value of hasFileExecute

Definition at line 604 of file AnaAlgorithm.h.

{false};

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 195 of file AthHistogramming.h.

m_histNamePostfix

std::string AthHistogramAlgorithm::m_histNamePostfix

privateinherited

The postfix for the histogram THx name.

Definition at line 97 of file AthHistogramAlgorithm.h.

m_histNamePrefix

std::string AthHistogramAlgorithm::m_histNamePrefix

privateinherited

The prefix for the histogram THx name.

Definition at line 94 of file AthHistogramAlgorithm.h.

m_histSvc

ServiceHandle<ITHistSvc> AthHistogramAlgorithm::m_histSvc

privateinherited

Default constructor: AthHistogramAlgorithm();.

a handle on the Hist/TTree registration service

Definition at line 83 of file AthHistogramAlgorithm.h.

m_histTitlePostfix

std::string AthHistogramAlgorithm::m_histTitlePostfix

privateinherited

The postfix for the histogram THx title.

Definition at line 103 of file AthHistogramAlgorithm.h.

m_histTitlePrefix

std::string AthHistogramAlgorithm::m_histTitlePrefix

privateinherited

The prefix for the histogram THx title.

Definition at line 100 of file AthHistogramAlgorithm.h.

m_inputMetaStore

MetaStore_t EL::AnaAlgorithm::m_inputMetaStore

privateinherited

Object accessing the input metadata store.

Definition at line 569 of file AnaAlgorithm.h.

m_matchTool

ToolHandle<IInDetSecVtxTruthMatchTool> CP::SecVertexTruthMatchAlg::m_matchTool {this, "MatchTool", "InDetSecVtxTruthMatchTool"}

private

Definition at line 60 of file SecVertexTruthMatchAlg.h.

{this, "MatchTool", "InDetSecVtxTruthMatchTool"};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 242 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 239 of file AthHistogramming.h.

m_outputMetaStore

MetaStore_t EL::AnaAlgorithm::m_outputMetaStore

privateinherited

Object accessing the output metadata store.

Definition at line 573 of file AnaAlgorithm.h.

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_recoHists

std::unordered_map<std::string, RecoVertexHists> CP::SecVertexTruthMatchAlg::m_recoHists

private

Definition at line 77 of file SecVertexTruthMatchAlg.h.

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_secVtxContainerKey

SG::ReadHandleKey<xAOD::VertexContainer> CP::SecVertexTruthMatchAlg::m_secVtxContainerKey

private

Initial value:

{this, "SecondaryVertexContainer", "VrtSecInclusive_SecondaryVertices",
                                                                "Secondary vertex container"}

Definition at line 47 of file SecVertexTruthMatchAlg.h.

                                                             {this, "SecondaryVertexContainer", "VrtSecInclusive_SecondaryVertices",
                                                                "Secondary vertex container"};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 220 of file AthHistogramming.h.

m_targetPDGIDs

Gaudi::Property<std::vector<int> > CP::SecVertexTruthMatchAlg::m_targetPDGIDs {this, "TargetPDGIDs", {}, "List of PDGIDs to select for matching"}

private

Definition at line 56 of file SecVertexTruthMatchAlg.h.

{this, "TargetPDGIDs", {}, "List of PDGIDs to select for matching"};

m_trackParticleContainerKey

SG::ReadHandleKey<xAOD::TrackParticleContainer> CP::SecVertexTruthMatchAlg::m_trackParticleContainerKey

private

Initial value:

{this, "TrackParticleContainer", "InDetTrackParticles",
                                                                "Track container"}

Definition at line 53 of file SecVertexTruthMatchAlg.h.

                                                                           {this, "TrackParticleContainer", "InDetTrackParticles",
                                                                "Track container"};

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 209 of file AthHistogramming.h.

m_truthVtxContainerKey

SG::ReadHandleKey<xAOD::TruthVertexContainer> CP::SecVertexTruthMatchAlg::m_truthVtxContainerKey

private

Initial value:

{this, "TruthVertexContainer", "TruthVertices",
                                                                        "Truth vertex container"}

Definition at line 50 of file SecVertexTruthMatchAlg.h.

                                                                    {this, "TruthVertexContainer", "TruthVertices",
                                                                        "Truth vertex container"};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 387 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 386 of file AthCommonDataStore.h.

m_writeHistograms

Gaudi::Property<bool> CP::SecVertexTruthMatchAlg::m_writeHistograms {this, "WriteHistograms", true, "Write histograms"}

private

Definition at line 58 of file SecVertexTruthMatchAlg.h.

{this, "WriteHistograms", true, "Write histograms"};

---

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

• SecVertexTruthMatchAlg.h
• SecVertexTruthMatchAlg.cxx