TruthHitAnalysis Class Reference

#include <TruthHitAnalysis.h>

Inheritance diagram for TruthHitAnalysis:

Collaboration diagram for TruthHitAnalysis:

Public Member Functions
	~TruthHitAnalysis ()=default
virtual StatusCode	execute (const EventContext &ctx) override final
	Execute method.
virtual StatusCode	initialize () override final
	AthHistogramAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
	Constructor with parameters:
virtual StatusCode	sysInitialize ()
	Initialization method invoked by the framework.
const ServiceHandle< ITHistSvc > &	histSvc () const
	The standard THistSvc (for writing histograms and TTrees and more to a root file) Returns (kind of) a pointer to the THistSvc.
virtual 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

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

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

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

Private Attributes
TH1 *	m_h_n_vert {nullptr}
	Some variables.
TH1 *	m_h_n_part {nullptr}
TH1 *	m_h_n_vert_prim {nullptr}
TH1 *	m_h_n_part_prim {nullptr}
TH1 *	m_h_n_vert_sec {nullptr}
TH1 *	m_h_n_part_sec {nullptr}
TH1 *	m_h_vtx_x {nullptr}
TH1 *	m_h_vtx_y {nullptr}
TH1 *	m_h_vtx_z {nullptr}
TH1 *	m_h_vtx_r {nullptr}
TH1 *	m_h_vtx_proc_x {nullptr}
TH1 *	m_h_vtx_proc_y {nullptr}
TH1 *	m_h_vtx_proc_z {nullptr}
TH1 *	m_h_vtx_proc_r {nullptr}
TH1 *	m_h_vtx_prim_x {nullptr}
TH1 *	m_h_vtx_prim_y {nullptr}
TH1 *	m_h_vtx_prim_z {nullptr}
TH1 *	m_h_vtx_prim_r {nullptr}
TH2 *	m_h_vtx_prim_xy {nullptr}
TH2 *	m_h_vtx_prim_zr {nullptr}
TH2 *	m_h_vtx_sec_xy {nullptr}
TH2 *	m_h_vtx_sec_zr {nullptr}
TH1 *	m_h_n_generations {nullptr}
TH1 *	m_h_truth_px {nullptr}
TH1 *	m_h_truth_py {nullptr}
TH1 *	m_h_truth_pz {nullptr}
TH1 *	m_h_truth_pt {nullptr}
TH1 *	m_h_truth_eta {nullptr}
TH1 *	m_h_truth_phi {nullptr}
TH1 *	m_h_barcode {nullptr}
TH1 *	m_h_part_status {nullptr}
TH1 *	m_h_part_pdgid {nullptr}
TH1 *	m_h_part_pdgid_sec {nullptr}
TH1 *	m_h_part_eta {nullptr}
TH1 *	m_h_part_phi {nullptr}
TH1 *	m_h_part_p {nullptr}
std::vector< float > *	m_vtx_x {nullptr}
std::vector< float > *	m_vtx_y {nullptr}
std::vector< float > *	m_vtx_z {nullptr}
std::vector< float > *	m_vtx_r {nullptr}
std::vector< float > *	m_vtx_barcode {nullptr}
std::vector< float > *	m_vtx_proc_x {nullptr}
std::vector< float > *	m_vtx_proc_y {nullptr}
std::vector< float > *	m_vtx_proc_z {nullptr}
std::vector< float > *	m_vtx_proc_r {nullptr}
std::vector< float > *	m_vtx_proc_barcode {nullptr}
std::vector< float > *	m_vtx_prim_x {nullptr}
std::vector< float > *	m_vtx_prim_y {nullptr}
std::vector< float > *	m_vtx_prim_z {nullptr}
std::vector< float > *	m_vtx_prim_r {nullptr}
std::vector< float > *	m_vtx_prim_barcode {nullptr}
std::vector< float > *	m_truth_px {nullptr}
std::vector< float > *	m_truth_py {nullptr}
std::vector< float > *	m_truth_pz {nullptr}
std::vector< float > *	m_truth_pt {nullptr}
std::vector< float > *	m_truth_eta {nullptr}
std::vector< float > *	m_truth_phi {nullptr}
std::vector< float > *	m_barcode {nullptr}
std::vector< float > *	m_status {nullptr}
std::vector< float > *	m_pdgid {nullptr}
TTree *	m_tree {nullptr}
Gaudi::Property< std::string >	m_path {this, "HistPath","/TruthHitAnalysis/"}
Gaudi::Property< std::string >	m_ntupleFileName {this, "NtupleFileName","/TruthHitAnalysis/"}
SG::ReadHandleKey< McEventCollection >	m_readKey {this, "InputKey", "TruthEvent"}
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

Definition at line 14 of file TruthHitAnalysis.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 206 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

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

StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

TreeMap_t

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

privateinherited

Typedef for convenience.

Definition at line 213 of file AthHistogramming.h.

Constructor & Destructor Documentation

~TruthHitAnalysis()

TruthHitAnalysis::~TruthHitAnalysis ( )

default

Member Function Documentation

AthHistogramAlgorithm()

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

Constructor with parameters:

Definition at line 40 of file AthHistogramAlgorithm.cxx.

                                                                         : 
  ::AthAlgorithm( name, pSvcLocator ),
  ::AthHistogramming( name ),
  m_histSvc ( "THistSvc/THistSvc", name )
{
  //
  // Property declaration
  // 
  // The histogram service
  declareProperty("THistSvc",
                  m_histSvc = ServiceHandle<ITHistSvc>("THistSvc/THistSvc", name),
                  "Handle to a THistSvc instance: it will be used to write "
                  "ROOT objects to ROOT files" );
  //  declareProperty("THistService",      m_histSvc, "The THistSvc" );
  
  declareProperty("RootStreamName",    m_prefix  = "/ANALYSIS", "Name of the output ROOT stream (file) that the THistSvc uses");
  declareProperty("RootDirName",       m_rootDir = "",
                  "Name of the ROOT directory inside the ROOT file where the histograms will go");
 
  declareProperty( "HistNamePrefix",   m_histNamePrefix  = "", "The prefix for the histogram THx name" );
  declareProperty( "HistNamePostfix",  m_histNamePostfix = "",      "The postfix for the histogram THx name" );
 
  declareProperty( "HistTitlePrefix",  m_histTitlePrefix  = "", "The prefix for the histogram THx title" );
  declareProperty( "HistTitlePostfix", m_histTitlePostfix = "", "The postfix for the histogram THx title" );
}

book() [1/8]

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

inlineprotectedinherited

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

Definition at line 336 of file AthHistogramming.h.

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

book() [2/8]

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

inlineprotectedinherited

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

book() [3/8]

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

inlineprotectedinherited

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

Definition at line 304 of file AthHistogramming.h.

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

book() [4/8]

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

inlineprotectedinherited

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

Definition at line 404 of file AthHistogramming.h.

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

book() [5/8]

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

inlineprotectedinherited

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

Definition at line 357 of file AthHistogramming.h.

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

book() [6/8]

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

inlineprotectedinherited

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

Definition at line 347 of file AthHistogramming.h.

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

book() [7/8]

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

inlineprotectedinherited

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

Definition at line 325 of file AthHistogramming.h.

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

book() [8/8]

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

inlineprotectedinherited

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

Definition at line 315 of file AthHistogramming.h.

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

bookGetPointer() [1/8]

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

inlineprotectedinherited

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

Definition at line 282 of file AthHistogramming.h.

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

bookGetPointer() [2/8]

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

protectedinherited

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

Definition at line 378 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 261 of file AthHistogramming.h.

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

bookGetPointer() [4/8]

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

protectedinherited

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

Definition at line 265 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 tDir = "", std::string stream = "" )

protectedinherited

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

Definition at line 121 of file AthHistogramming.cxx.

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

bookGetPointer() [6/8]

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

inlineprotectedinherited

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

Definition at line 294 of file AthHistogramming.h.

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

bookGetPointer() [7/8]

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

protectedinherited

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

Definition at line 83 of file AthHistogramming.cxx.

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

bookGetPointer() [8/8]

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

inlineprotectedinherited

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

Definition at line 273 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 & histName, std::string & tDir, std::string & stream, bool usePrefixPostfix = false )

privateinherited

Method to build individual booking string.

Definition at line 509 of file AthHistogramming.cxx.

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

Definition at line 51 of file AthHistogramming.cxx.

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

declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

{ return m_detStore; }

efficiency()

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

protectedinherited

Simplify the retrieval of registered TEfficiency.

Definition at line 205 of file AthHistogramming.cxx.

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

evtStore()

ServiceHandle< StoreGateSvc > & AthCommonDataStore< AthCommonMsg< 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()

StatusCode TruthHitAnalysis::execute ( const EventContext & ctx )

finaloverridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 198 of file TruthHitAnalysis.cxx.

                                                            {
  ATH_MSG_DEBUG( "In TruthHitAnalysis::execute()" );
 
  m_vtx_x->clear();
  m_vtx_y->clear();
  m_vtx_z->clear();
  m_vtx_r->clear();
  m_vtx_barcode->clear();
  m_vtx_proc_x->clear();
  m_vtx_proc_y->clear();
  m_vtx_proc_z->clear();
  m_vtx_proc_r->clear();
  m_vtx_proc_barcode->clear();
  m_vtx_prim_x->clear();
  m_vtx_prim_y->clear();
  m_vtx_prim_z->clear();
  m_vtx_prim_r->clear();
  m_vtx_prim_barcode->clear();
  m_truth_px->clear();
  m_truth_py->clear();
  m_truth_pz->clear();
  m_truth_pt->clear();
  m_truth_eta->clear();
  m_truth_phi->clear();
  m_barcode->clear();
  m_status->clear();
  m_pdgid->clear();
  
  const McEventCollection* mcCollection{nullptr};
  ATH_CHECK(SG::get(mcCollection, m_readKey, ctx));
  
 
  McEventCollection::const_iterator currentGenEventIter = mcCollection->begin(); 
    if (currentGenEventIter != mcCollection->end()) {
      int nvtx = 0;
      int nvtx_sec=0;
 
      const auto &procVtx = HepMC::signal_process_vertex(*currentGenEventIter);
    const auto &barcodes = (*currentGenEventIter)->attribute<HepMC::GenEventBarcodes> (HepMCStr::barcodes);
    std::map<int,int> id_to_barcode_map;
    if (barcodes) id_to_barcode_map = barcodes->id_to_barcode_map();
    for (const auto& vtx: (*currentGenEventIter)->vertices()) {
    int bcode = id_to_barcode_map[vtx->id()];
    double x = vtx->position().x();
    double y = vtx->position().y();
    double z = vtx->position().z();
    double r = std::sqrt(x*x+y*y);
    m_h_vtx_x->Fill(x);
    m_h_vtx_y->Fill(y);
    m_h_vtx_r->Fill(r);
    m_h_vtx_z->Fill(z);
 
    m_vtx_x->push_back(x);
    m_vtx_y->push_back(y);
    m_vtx_r->push_back(r);
    m_vtx_z->push_back(z);
    m_vtx_barcode->push_back(bcode);
 
  if (vtx == procVtx) {
    m_h_vtx_proc_x->Fill(x);
      m_h_vtx_proc_y->Fill(y);
      m_h_vtx_proc_r->Fill(r);
      m_h_vtx_proc_z->Fill(z);
 
    m_vtx_proc_x->push_back(x);
    m_vtx_proc_y->push_back(y);
    m_vtx_proc_r->push_back(r);
    m_vtx_proc_z->push_back(z);
    m_vtx_proc_barcode->push_back(bcode);
  }
 
    if (!HepMC::is_simulation_vertex(vtx)) {
    m_h_vtx_prim_x->Fill(x);
      m_h_vtx_prim_y->Fill(y);
      m_h_vtx_prim_r->Fill(r);
      m_h_vtx_prim_z->Fill(z);
      m_h_vtx_prim_xy->Fill(x,y);
      m_h_vtx_prim_zr->Fill(z,r);
 
    m_vtx_prim_x->push_back(x);
    m_vtx_prim_y->push_back(y);
    m_vtx_prim_r->push_back(r);
    m_vtx_prim_z->push_back(z);
    m_vtx_prim_barcode->push_back(bcode);
      ++nvtx;
    }
    else {
      m_h_vtx_sec_xy->Fill(x,y);
      m_h_vtx_sec_zr->Fill(z,r);
      ++nvtx_sec; 
    }
      } //End iteration over vertices
 
      m_h_n_vert->Fill(nvtx+nvtx_sec);
      m_h_n_vert_prim->Fill(nvtx);
      m_h_n_vert_sec->Fill(nvtx_sec);
 
      int npart_prim=0; 
      int npart_sec=0;
 
      for (auto currentGenParticle: *(*currentGenEventIter)) {
    const HepMC::FourVector mom = currentGenParticle->momentum();
    int currentGenParticlebarcode = id_to_barcode_map[currentGenParticle->id()];
    m_h_truth_px->Fill(mom.x());
    m_h_truth_py->Fill(mom.y());
    m_h_truth_pz->Fill(mom.z());
    m_h_truth_pt->Fill(mom.perp());
    m_h_truth_eta->Fill(mom.eta());
    m_h_truth_phi->Fill(mom.phi());
    m_h_barcode->Fill(currentGenParticlebarcode);
    m_h_part_status->Fill(currentGenParticle->status());
    m_truth_px->push_back(mom.x());
    m_truth_py->push_back(mom.y());
    m_truth_pz->push_back(mom.z());
    m_truth_pt->push_back(mom.perp());
    m_truth_eta->push_back(mom.eta());
    m_truth_phi->push_back(mom.phi());
    m_barcode->push_back(currentGenParticlebarcode);        
    m_status->push_back(currentGenParticle->status());
    
    int pdg = currentGenParticle->pdg_id();
    m_pdgid->push_back(pdg);
    
    if (!HepMC::is_simulation_particle(currentGenParticle)) {
      m_h_part_pdgid->Fill(pdg);
      m_h_part_p->Fill(std::sqrt(mom.x()*mom.x()+mom.y()*mom.y()+mom.z()*mom.z()));
      m_h_part_eta->Fill(mom.eta());
      m_h_part_phi->Fill(mom.phi());
      ++npart_prim; 
      m_h_n_generations->Fill(1);
/* The conditions don't make any sense.
      if (currentGenParticlebarcode < HepMC::PHOTOSMIN) {
        m_h_n_generations->Fill(0);
      }
      else {
        m_h_n_generations->Fill(1);
      }
*/
    } //End simulation particle
    else {
      m_h_part_pdgid_sec->Fill(pdg);
      ++npart_sec;
      const int gen = HepMC::generations(currentGenParticle) + 2; 
      m_h_n_generations->Fill(gen);  
    }
      } // End iteration over particles
 
      m_h_n_part_prim->Fill(npart_prim);
      m_h_n_part_sec->Fill(npart_sec);
      m_h_n_part->Fill(npart_prim+npart_sec);   
    } // End mcCollection 
 
  m_tree->Fill();
 
  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();
}

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

graph()

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

protectedinherited

Simplify the retrieval of registered TGraphs.

Definition at line 442 of file AthHistogramming.cxx.

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

hash()

AthHistogramming::hash_t AthHistogramming::hash ( const std::string & histName ) const

inlineprivateinherited

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

Definition at line 429 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 161 of file AthHistogramming.cxx.

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

hist2d()

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

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 370 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 387 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 TruthHitAnalysis::initialize ( )

finaloverridevirtual

histograms declaration

now add branches and leaves to the tree

Definition at line 13 of file TruthHitAnalysis.cxx.

                                        {
  ATH_MSG_DEBUG( "Initializing TruthHitAnalysis" );
 
  // Grab the Ntuple and histogramming service for the tree
  ATH_CHECK(m_readKey.initialize());

  m_h_n_vert = new TH1D("h_n_vert","n_vert", 100,200, 1500);
  m_h_n_vert->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_vert->GetName(), m_h_n_vert));
 
  m_h_n_part = new TH1D("h_n_part","n_part", 100,1000, 10000);
  m_h_n_part->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_part->GetName(), m_h_n_part));
 
  m_h_n_vert_prim = new TH1D("h_n_vert_prim","n_vert prim", 100,0, 1000);
  m_h_n_vert_prim->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_vert_prim->GetName(), m_h_n_vert_prim));
 
  m_h_n_part_prim = new TH1D("h_n_part_prim","n_part prim", 100,200, 1500);
  m_h_n_part_prim->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_part_prim->GetName(), m_h_n_part_prim));
 
  m_h_n_vert_sec = new TH1D("h_n_vert_sec","n_vert sec", 100,0, 1000);
  m_h_n_vert_sec->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_vert_sec->GetName(), m_h_n_vert_sec));
 
  m_h_n_part_sec = new TH1D("h_n_part_sec","n_part sec", 100,0, 5000);
  m_h_n_part_sec->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_part_sec->GetName(), m_h_n_part_sec));
 
  m_h_vtx_x = new TH1D("h_vtx_x","vtx_x", 100,-1300, 1300);
  m_h_vtx_x->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_x->GetName(), m_h_vtx_x));
 
  m_h_vtx_y = new TH1D("h_vtx_y","vtx_y", 100,-1200, 1200);
  m_h_vtx_y->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_y->GetName(), m_h_vtx_y));
 
  m_h_vtx_z = new TH1D("h_vtx_z","vtx_z", 100,-5000, 5000);
  m_h_vtx_z->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_z->GetName(), m_h_vtx_z));
 
  m_h_vtx_r = new TH1D("h_vtx_r","vtx_r", 100,0, 1160);
  m_h_vtx_r->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_r->GetName(), m_h_vtx_r));
 
  m_h_vtx_proc_x = new TH1D("h_vtx_proc_x","vtx_proc_x", 100,-1300, 1300);
  m_h_vtx_proc_x->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_proc_x->GetName(), m_h_vtx_proc_x));
 
  m_h_vtx_proc_y = new TH1D("h_vtx_proc_y","vtx_proc_y", 100,-1200, 1200);
  m_h_vtx_proc_y->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_proc_y->GetName(), m_h_vtx_proc_y));
 
  m_h_vtx_proc_z = new TH1D("h_vtx_proc_z","vtx_proc_z", 100,-5000, 5000);
  m_h_vtx_proc_z->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_proc_z->GetName(), m_h_vtx_proc_z));
 
  m_h_vtx_proc_r = new TH1D("h_vtx_proc_r","vtx_proc_r", 100,0, 1160);
  m_h_vtx_proc_r->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_proc_r->GetName(), m_h_vtx_proc_r));
 
  m_h_vtx_prim_x = new TH1D("h_vtx_prim_x","vtx_prim_x", 100,-1300, 1300);
  m_h_vtx_prim_x->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_x->GetName(), m_h_vtx_prim_x));
 
  m_h_vtx_prim_y = new TH1D("h_vtx_prim_y","vtx_prim_y", 100,-1200, 1200);
  m_h_vtx_prim_y->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_y->GetName(), m_h_vtx_prim_y));
 
  m_h_vtx_prim_z = new TH1D("h_vtx_prim_z","vtx_prim_z", 100,-5000, 5000);
  m_h_vtx_prim_z->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_z->GetName(), m_h_vtx_prim_z));
 
  m_h_vtx_prim_r = new TH1D("h_vtx_prim_r","vtx_prim_r", 100,0, 1160);
  m_h_vtx_prim_r->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_r->GetName(), m_h_vtx_prim_r));
 
  m_h_vtx_prim_xy = new TH2D("h_vtx_prim_xy","vtx_prim_xy", 100,-100, 100, 100,-100, 100);
  m_h_vtx_prim_xy->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_xy->GetName(), m_h_vtx_prim_xy));
 
  m_h_vtx_prim_zr = new TH2D("h_vtx_prim_zr","vtx_prim_zr", 100,-1500, 1500, 100,0, 150);
  m_h_vtx_prim_zr->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_prim_zr->GetName(), m_h_vtx_prim_zr));
 
  m_h_vtx_sec_xy = new TH2D("h_vtx_sec_xy","vtx_sec_xy", 100,-1200, 1200, 100,-1200, 1200);
  m_h_vtx_sec_xy->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_sec_xy->GetName(), m_h_vtx_sec_xy));
 
  m_h_vtx_sec_zr = new TH2D("h_vtx_sec_zr","vtx_sec_zr", 100,-6000, 6000, 100,0, 1160);
  m_h_vtx_sec_zr->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_vtx_sec_zr->GetName(), m_h_vtx_sec_zr));
 
  m_h_n_generations = new TH1D("h_n_generations","h_generations", 100,0, 25);
  m_h_n_generations->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_n_generations->GetName(), m_h_n_generations));
 
  m_h_truth_px = new TH1D("h_truth_px","truth_px", 100,0, 4000);
  m_h_truth_px->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_px->GetName(), m_h_truth_px));
 
  m_h_truth_py = new TH1D("h_truth_py","truth_py", 100,0, 4000);
  m_h_truth_py->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_py->GetName(), m_h_truth_py));
 
  m_h_truth_pz = new TH1D("h_truth_pz","truth_pz", 100,0, 4000);
  m_h_truth_pz->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_pz->GetName(), m_h_truth_pz));
 
  m_h_truth_pt = new TH1D("h_truth_pt","truth_pt", 100,0, 4000);
  m_h_truth_pt->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_pt->GetName(), m_h_truth_pt));
 
  m_h_truth_eta = new TH1D("h_truth_eta","truth_eta", 50,-10, 10);
  m_h_truth_eta->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_eta->GetName(), m_h_truth_eta));
 
  m_h_truth_phi = new TH1D("h_truth_phi","truth_phi", 25,-3.1416, 3.1416);
  m_h_truth_phi->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_truth_phi->GetName(), m_h_truth_phi));
 
  m_h_barcode = new TH1D("h_truth_barcode","truth_barcode", 100,0, 300000);
  m_h_barcode->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_barcode->GetName(), m_h_barcode));
 
  m_h_part_status = new TH1D("h_part_status","part status", 100,0,50);
  m_h_part_status->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_status->GetName(), m_h_part_status));
 
  m_h_part_pdgid = new TH1D("h_part_pdgid","part pdgid", 100,-5000, 5000);
  m_h_part_pdgid->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_pdgid->GetName(), m_h_part_pdgid));
 
  m_h_part_pdgid_sec = new TH1D("h_part_pdgid_sec","part pdgid sec", 100,-5000, 5000);
  m_h_part_pdgid_sec->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_pdgid_sec->GetName(), m_h_part_pdgid_sec));
 
  m_h_part_eta = new TH1D("h_part_eta","part eta", 100,-10, 10);
  m_h_part_eta->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_eta->GetName(), m_h_part_eta));
 
  m_h_part_phi = new TH1D("h_part_phi","part phi", 100,-3.2, 3.2);
  m_h_part_phi->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_phi->GetName(), m_h_part_phi));
 
  m_h_part_p = new TH1D("h_part_p","part p", 100,0, 5000);
  m_h_part_p->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_part_p->GetName(), m_h_part_p));

  m_tree = new TTree("Truth", "Truth");
  std::string fullNtupleName =  "/" + m_ntupleFileName + "/";
  ATH_CHECK(histSvc()->regTree(fullNtupleName,m_tree));
  
  m_tree->Branch("vtx_x", &m_vtx_x);
  m_tree->Branch("vtx_y", &m_vtx_y);
  m_tree->Branch("vtx_z", &m_vtx_z);
  m_tree->Branch("vtx_r", &m_vtx_r);
  m_tree->Branch("vtx_barcode", &m_vtx_barcode);
  m_tree->Branch("vtx_proc_x", &m_vtx_proc_x);
  m_tree->Branch("vtx_proc_y", &m_vtx_proc_y);
  m_tree->Branch("vtx_proc_z", &m_vtx_proc_z);
  m_tree->Branch("vtx_proc_r", &m_vtx_proc_r);
  m_tree->Branch("vtx_proc_barcode", &m_vtx_proc_barcode);
  m_tree->Branch("vtx_prim_x", &m_vtx_prim_x);
  m_tree->Branch("vtx_prim_y", &m_vtx_prim_y);
  m_tree->Branch("vtx_prim_z", &m_vtx_prim_z);
  m_tree->Branch("vtx_prim_r", &m_vtx_prim_r);
  m_tree->Branch("vtx_prim_barcode", &m_vtx_prim_barcode);
  m_tree->Branch("truth_px", &m_truth_px);
  m_tree->Branch("truth_py", &m_truth_py);
  m_tree->Branch("truth_pz", &m_truth_pz);
  m_tree->Branch("truth_pt", &m_truth_pt);
  m_tree->Branch("truth_eta", &m_truth_eta);
  m_tree->Branch("truth_phi", &m_truth_phi);
  m_tree->Branch("barcode", &m_barcode);
  m_tree->Branch("status", &m_status);
  m_tree->Branch("pdg_id", &m_pdgid); 
 
  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.

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

myReplace()

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

privateinherited

Helper method to replace sub-string.

Definition at line 537 of file AthHistogramming.cxx.

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

outputHandles()

virtual std::vector< Gaudi::DataHandle * > AthCommonDataStore< AthCommonMsg< 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.

renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

setFilterPassed()

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

inlinevirtualinherited

Set filter decision:

Reimplemented in AthFilterAlgorithm.

Definition at line 99 of file AthCommonAlgorithm.h.

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

sysExecute()

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

overridevirtualinherited

Execute an algorithm.

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

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthHistogramAlgorithm::sysInitialize ( )

virtualinherited

Initialization method invoked by the framework.

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

Reimplemented from AthCommonAlgorithm< Gaudi::Algorithm >.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 75 of file AthHistogramAlgorithm.cxx.

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

sysStart()

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

overridevirtualinherited

Handle START transition.

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

tree()

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

protectedinherited

Simplify the retrieval of registered TTrees.

Definition at line 330 of file AthHistogramming.cxx.

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

updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

m_barcode

std::vector<float>* TruthHitAnalysis::m_barcode {nullptr}

private

Definition at line 84 of file TruthHitAnalysis.h.

{nullptr};

m_detStore

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

privateinherited

Pointer to StoreGate (detector store by default).

Definition at line 393 of file AthCommonDataStore.h.

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 209 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 390 of file AthCommonDataStore.h.

m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 223 of file AthHistogramming.h.

m_h_barcode

TH1* TruthHitAnalysis::m_h_barcode {nullptr}

private

Definition at line 55 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_generations

TH1* TruthHitAnalysis::m_h_n_generations {nullptr}

private

Definition at line 48 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_part

TH1* TruthHitAnalysis::m_h_n_part {nullptr}

private

Definition at line 27 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_part_prim

TH1* TruthHitAnalysis::m_h_n_part_prim {nullptr}

private

Definition at line 29 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_part_sec

TH1* TruthHitAnalysis::m_h_n_part_sec {nullptr}

private

Definition at line 31 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_vert

TH1* TruthHitAnalysis::m_h_n_vert {nullptr}

private

Some variables.

Definition at line 26 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_vert_prim

TH1* TruthHitAnalysis::m_h_n_vert_prim {nullptr}

private

Definition at line 28 of file TruthHitAnalysis.h.

{nullptr};

m_h_n_vert_sec

TH1* TruthHitAnalysis::m_h_n_vert_sec {nullptr}

private

Definition at line 30 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_eta

TH1* TruthHitAnalysis::m_h_part_eta {nullptr}

private

Definition at line 59 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_p

TH1* TruthHitAnalysis::m_h_part_p {nullptr}

private

Definition at line 61 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_pdgid

TH1* TruthHitAnalysis::m_h_part_pdgid {nullptr}

private

Definition at line 57 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_pdgid_sec

TH1* TruthHitAnalysis::m_h_part_pdgid_sec {nullptr}

private

Definition at line 58 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_phi

TH1* TruthHitAnalysis::m_h_part_phi {nullptr}

private

Definition at line 60 of file TruthHitAnalysis.h.

{nullptr};

m_h_part_status

TH1* TruthHitAnalysis::m_h_part_status {nullptr}

private

Definition at line 56 of file TruthHitAnalysis.h.

{nullptr};

m_h_truth_eta

TH1* TruthHitAnalysis::m_h_truth_eta {nullptr}

private

Definition at line 53 of file TruthHitAnalysis.h.

{nullptr};

m_h_truth_phi

TH1* TruthHitAnalysis::m_h_truth_phi {nullptr}

private

Definition at line 54 of file TruthHitAnalysis.h.

{nullptr}; 

m_h_truth_pt

TH1* TruthHitAnalysis::m_h_truth_pt {nullptr}

private

Definition at line 52 of file TruthHitAnalysis.h.

{nullptr};

m_h_truth_px

TH1* TruthHitAnalysis::m_h_truth_px {nullptr}

private

Definition at line 49 of file TruthHitAnalysis.h.

{nullptr};

m_h_truth_py

TH1* TruthHitAnalysis::m_h_truth_py {nullptr}

private

Definition at line 50 of file TruthHitAnalysis.h.

{nullptr}; 

m_h_truth_pz

TH1* TruthHitAnalysis::m_h_truth_pz {nullptr}

private

Definition at line 51 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_r

TH1* TruthHitAnalysis::m_h_vtx_prim_r {nullptr}

private

Definition at line 43 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_x

TH1* TruthHitAnalysis::m_h_vtx_prim_x {nullptr}

private

Definition at line 40 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_xy

TH2* TruthHitAnalysis::m_h_vtx_prim_xy {nullptr}

private

Definition at line 44 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_y

TH1* TruthHitAnalysis::m_h_vtx_prim_y {nullptr}

private

Definition at line 41 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_z

TH1* TruthHitAnalysis::m_h_vtx_prim_z {nullptr}

private

Definition at line 42 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_prim_zr

TH2* TruthHitAnalysis::m_h_vtx_prim_zr {nullptr}

private

Definition at line 45 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_proc_r

TH1* TruthHitAnalysis::m_h_vtx_proc_r {nullptr}

private

Definition at line 39 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_proc_x

TH1* TruthHitAnalysis::m_h_vtx_proc_x {nullptr}

private

Definition at line 36 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_proc_y

TH1* TruthHitAnalysis::m_h_vtx_proc_y {nullptr}

private

Definition at line 37 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_proc_z

TH1* TruthHitAnalysis::m_h_vtx_proc_z {nullptr}

private

Definition at line 38 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_r

TH1* TruthHitAnalysis::m_h_vtx_r {nullptr}

private

Definition at line 35 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_sec_xy

TH2* TruthHitAnalysis::m_h_vtx_sec_xy {nullptr}

private

Definition at line 46 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_sec_zr

TH2* TruthHitAnalysis::m_h_vtx_sec_zr {nullptr}

private

Definition at line 47 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_x

TH1* TruthHitAnalysis::m_h_vtx_x {nullptr}

private

Definition at line 32 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_y

TH1* TruthHitAnalysis::m_h_vtx_y {nullptr}

private

Definition at line 33 of file TruthHitAnalysis.h.

{nullptr};

m_h_vtx_z

TH1* TruthHitAnalysis::m_h_vtx_z {nullptr}

private

Definition at line 34 of file TruthHitAnalysis.h.

{nullptr};

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 202 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_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 249 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 246 of file AthHistogramming.h.

m_ntupleFileName

Gaudi::Property<std::string> TruthHitAnalysis::m_ntupleFileName {this, "NtupleFileName","/TruthHitAnalysis/"}

private

Definition at line 91 of file TruthHitAnalysis.h.

{this, "NtupleFileName","/TruthHitAnalysis/"}; 

m_path

Gaudi::Property<std::string> TruthHitAnalysis::m_path {this, "HistPath","/TruthHitAnalysis/"}

private

Definition at line 90 of file TruthHitAnalysis.h.

{this, "HistPath","/TruthHitAnalysis/"};

m_pdgid

std::vector<float>* TruthHitAnalysis::m_pdgid {nullptr}

private

Definition at line 86 of file TruthHitAnalysis.h.

{nullptr};

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_readKey

SG::ReadHandleKey<McEventCollection> TruthHitAnalysis::m_readKey {this, "InputKey", "TruthEvent"}

private

Definition at line 92 of file TruthHitAnalysis.h.

{this, "InputKey", "TruthEvent"};

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_status

std::vector<float>* TruthHitAnalysis::m_status {nullptr}

private

Definition at line 85 of file TruthHitAnalysis.h.

{nullptr};

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 227 of file AthHistogramming.h.

m_tree

TTree* TruthHitAnalysis::m_tree {nullptr}

private

Definition at line 88 of file TruthHitAnalysis.h.

{nullptr};

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 216 of file AthHistogramming.h.

m_truth_eta

std::vector<float>* TruthHitAnalysis::m_truth_eta {nullptr}

private

Definition at line 82 of file TruthHitAnalysis.h.

{nullptr};

m_truth_phi

std::vector<float>* TruthHitAnalysis::m_truth_phi {nullptr}

private

Definition at line 83 of file TruthHitAnalysis.h.

{nullptr};

m_truth_pt

std::vector<float>* TruthHitAnalysis::m_truth_pt {nullptr}

private

Definition at line 81 of file TruthHitAnalysis.h.

{nullptr};

m_truth_px

std::vector<float>* TruthHitAnalysis::m_truth_px {nullptr}

private

Definition at line 78 of file TruthHitAnalysis.h.

{nullptr};

m_truth_py

std::vector<float>* TruthHitAnalysis::m_truth_py {nullptr}

private

Definition at line 79 of file TruthHitAnalysis.h.

{nullptr};

m_truth_pz

std::vector<float>* TruthHitAnalysis::m_truth_pz {nullptr}

private

Definition at line 80 of file TruthHitAnalysis.h.

{nullptr};

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

m_vtx_barcode

std::vector<float>* TruthHitAnalysis::m_vtx_barcode {nullptr}

private

Definition at line 67 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_prim_barcode

std::vector<float>* TruthHitAnalysis::m_vtx_prim_barcode {nullptr}

private

Definition at line 77 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_prim_r

std::vector<float>* TruthHitAnalysis::m_vtx_prim_r {nullptr}

private

Definition at line 76 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_prim_x

std::vector<float>* TruthHitAnalysis::m_vtx_prim_x {nullptr}

private

Definition at line 73 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_prim_y

std::vector<float>* TruthHitAnalysis::m_vtx_prim_y {nullptr}

private

Definition at line 74 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_prim_z

std::vector<float>* TruthHitAnalysis::m_vtx_prim_z {nullptr}

private

Definition at line 75 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_proc_barcode

std::vector<float>* TruthHitAnalysis::m_vtx_proc_barcode {nullptr}

private

Definition at line 72 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_proc_r

std::vector<float>* TruthHitAnalysis::m_vtx_proc_r {nullptr}

private

Definition at line 71 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_proc_x

std::vector<float>* TruthHitAnalysis::m_vtx_proc_x {nullptr}

private

Definition at line 68 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_proc_y

std::vector<float>* TruthHitAnalysis::m_vtx_proc_y {nullptr}

private

Definition at line 69 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_proc_z

std::vector<float>* TruthHitAnalysis::m_vtx_proc_z {nullptr}

private

Definition at line 70 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_r

std::vector<float>* TruthHitAnalysis::m_vtx_r {nullptr}

private

Definition at line 66 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_x

std::vector<float>* TruthHitAnalysis::m_vtx_x {nullptr}

private

Definition at line 63 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_y

std::vector<float>* TruthHitAnalysis::m_vtx_y {nullptr}

private

Definition at line 64 of file TruthHitAnalysis.h.

{nullptr};

m_vtx_z

std::vector<float>* TruthHitAnalysis::m_vtx_z {nullptr}

private

Definition at line 65 of file TruthHitAnalysis.h.

{nullptr};

---

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

• TruthHitAnalysis.h
• TruthHitAnalysis.cxx