LArRDOAnalysis Class Reference

#include <LArRDOAnalysis.h>

Inheritance diagram for LArRDOAnalysis:

Collaboration diagram for LArRDOAnalysis:

Public Member Functions
	~LArRDOAnalysis ()=default
virtual StatusCode	initialize () override final
virtual StatusCode	execute (const EventContext &ctx) override final
	Execute method.
	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 (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered histograms of any type.
TH2 *	hist2d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 2-d histograms.
TH3 *	hist3d (const std::string &histName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered 3-d histograms.
TTree *	tree (const std::string &treeName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TTrees.
TGraph *	graph (const std::string &graphName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TGraphs.
TEfficiency *	efficiency (const std::string &effName, const std::string &tDir="", const std::string &stream="")
	Simplify the retrieval of registered TEfficiency.

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

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

Private Attributes
SG::ReadHandleKey< LArRawChannelContainer >	m_inputRawChannelKey {this, "InputRawChannelKey", "LArRawChannels"}
SG::ReadHandleKey< LArTTL1Container >	m_inputTTL1HADKey {this, "InputTTL1HADKey", "LArTTL1HAD"}
SG::ReadHandleKey< LArTTL1Container >	m_inputTTL1EMKey {this, "InputTTL1EMKey", "LArTTL1EM"}
SG::ReadHandleKey< LArDigitContainer >	m_inputDigitKey {this, "InputDigitKey", "LArDigitContainer_MC_Thinned"}
BooleanProperty	m_presampling {this, "PreSampling", false}
Gaudi::Property< bool >	m_doNtuple {this , "doNtuple" , true}
Gaudi::Property< std::string >	m_ntupleFileName {this , "NtupleFileName" , "/ntuples/file1"}
Gaudi::Property< std::string >	m_ntupleDirName {this , "NtupleDirectoryName" , "/LArRDOAnalysis/"}
Gaudi::Property< std::string >	m_ntupleTreeName {this , "NtupleTreeName" , "LArRDOAna"}
Gaudi::Property< std::string >	m_path {this , "HistPath" , "/LArRDOAnalysis/"}
std::vector< unsigned long long > *	m_larID {nullptr}
std::vector< int > *	m_energy {nullptr}
std::vector< int > *	m_time {nullptr}
std::vector< uint16_t > *	m_qual {nullptr}
std::vector< uint16_t > *	m_prov {nullptr}
std::vector< int > *	m_gain {nullptr}
std::vector< unsigned long long > *	m_hadOnID {nullptr}
std::vector< unsigned long long > *	m_hadOffID {nullptr}
std::vector< float > *	m_hadSamples {nullptr}
std::vector< unsigned long long > *	m_emOnID {nullptr}
std::vector< unsigned long long > *	m_emOffID {nullptr}
std::vector< float > *	m_emSamples {nullptr}
std::vector< unsigned long long > *	m_digiID {nullptr}
std::vector< int > *	m_digiGain {nullptr}
std::vector< short > *	m_digiSamples {nullptr}
TH1 *	m_h_larID {nullptr}
TH1 *	m_h_energy {nullptr}
TH1 *	m_h_time {nullptr}
TH1 *	m_h_qual {nullptr}
TH1 *	m_h_prov {nullptr}
TH1 *	m_h_gain {nullptr}
TH1 *	m_h_hadOnID {nullptr}
TH1 *	m_h_hadOffID {nullptr}
TH1 *	m_h_hadSamples {nullptr}
TH1 *	m_h_emOnID {nullptr}
TH1 *	m_h_emOffID {nullptr}
TH1 *	m_h_emSamples {nullptr}
TH1 *	m_h_digiID {nullptr}
TH1 *	m_h_digiGain {nullptr}
TH1 *	m_h_digiSamples {nullptr}
TTree *	m_tree {nullptr}
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 21 of file LArRDOAnalysis.h.

Member Typedef Documentation

EffMap_t

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

privateinherited

Typedef for convenience.

Definition at line 207 of file AthHistogramming.h.

GraphMap_t

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

privateinherited

Typedef for convenience.

Definition at line 221 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 200 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 214 of file AthHistogramming.h.

Constructor & Destructor Documentation

~LArRDOAnalysis()

LArRDOAnalysis::~LArRDOAnalysis ( )

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 337 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 305 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 405 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 358 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 348 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 326 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 316 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 283 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 388 of file AthHistogramming.cxx.

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

bookGetPointer() [3/8]

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

inlineprotectedinherited

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

Definition at line 262 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 273 of file AthHistogramming.cxx.

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

bookGetPointer() [5/8]

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

protectedinherited

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

Definition at line 123 of file AthHistogramming.cxx.

{
  std::string effName(effRef.GetName());
  const std::string effTitle(effRef.GetTitle());
  std::string bookingString;
  this->buildBookingString(bookingString, 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 295 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;
 
  this->buildBookingString(bookingString, 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 274 of file AthHistogramming.h.

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

buildBookingString()

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

privateinherited

Method to build individual booking string.

Definition at line 521 of file AthHistogramming.cxx.

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

configAthHistogramming()

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

protectedinherited

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

Definition at line 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 211 of file AthHistogramming.cxx.

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

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 LArRDOAnalysis::execute ( const EventContext & ctx )

finaloverridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 107 of file LArRDOAnalysis.cxx.

                                                          {
  ATH_MSG_DEBUG( "In LArRDOAnalysis::execute()" );
  
  if(m_tree){
    m_larID->clear();
    m_energy->clear();
    m_time->clear();
    m_qual->clear();
    m_prov->clear();
    m_gain->clear();
    m_hadOnID->clear();
    m_hadOffID->clear();
    m_hadSamples->clear();
    m_emOnID->clear();
    m_emOffID->clear();
    m_emSamples->clear();
    m_digiID->clear();
    m_digiGain->clear();
    m_digiSamples->clear();
  }
 
  const LArRawChannelContainer* p_larRawCont{nullptr};
  ATH_CHECK(SG::get(p_larRawCont, m_inputRawChannelKey, ctx));
 
  const LArTTL1Container* p_larTTL1Cont_had{nullptr};
  ATH_CHECK(SG::get(p_larTTL1Cont_had, m_inputTTL1HADKey, ctx));
 
  const LArTTL1Container* p_larTTL1Cont_em{nullptr};
  ATH_CHECK(SG::get(p_larTTL1Cont_em, m_inputTTL1EMKey, ctx));
 
  const LArDigitContainer* p_larDigiCont{nullptr};
  ATH_CHECK(SG::get(p_larDigiCont, m_inputDigitKey, ctx));
  
 
  if (p_larRawCont) {
      // loop over LAr raw channels container
      LArRawChannelContainer::const_iterator lar_itr(p_larRawCont->begin());
      const LArRawChannelContainer::const_iterator lar_end(p_larRawCont->end());
      for ( ; lar_itr != lar_end; ++lar_itr ) {
          const HWIdentifier larID(lar_itr->identify());
          const int rawEnergy(lar_itr->energy());
          const int rawTime(lar_itr->time());
          const uint16_t rawQual(lar_itr->quality());
          const uint16_t rawProv(lar_itr->provenance());
          CaloGain::CaloGain larGain(lar_itr->gain());
 
          const unsigned long long larID_int = larID.get_identifier32().get_compact();
          const int larGain_int = (int)larGain;
          if(m_tree){
            m_larID->push_back(larID_int);
            m_energy->push_back(rawEnergy);
            m_time->push_back(rawTime);
            m_qual->push_back(rawQual);
            m_prov->push_back(rawProv);
            m_gain->push_back(larGain_int);
          }
 
          m_h_larID->Fill(larID_int);
          m_h_energy->Fill(rawEnergy);
          m_h_time->Fill(rawTime);
          m_h_qual->Fill(rawQual);
          m_h_prov->Fill(rawProv);
          m_h_gain->Fill(larGain_int);
      }
  }
  if (p_larTTL1Cont_had) {
    LArTTL1Container::const_iterator ttl1Had_itr(p_larTTL1Cont_had->begin());
    const LArTTL1Container::const_iterator ttl1Had_end(p_larTTL1Cont_had->end());
    for ( ; ttl1Had_itr != ttl1Had_end; ++ttl1Had_itr ) {
          const HWIdentifier& hadOnID((*ttl1Had_itr)->ttOnlineID());
          const Identifier& hadOffID((*ttl1Had_itr)->ttOfflineID());
          const std::vector<float>& hadSamples = (*ttl1Had_itr)->samples();
 
          const unsigned long long hadOnID_int = hadOnID.get_compact();
          const unsigned long long hadOffID_int = hadOffID.get_compact();
          if(m_tree) m_hadOnID->push_back(hadOnID_int);
          if(m_tree) m_hadOffID->push_back(hadOffID_int);
          for (std::vector<float>::size_type i = 0; i != hadSamples.size(); ++i) {
            if(m_tree) m_hadSamples->push_back(hadSamples.at(i));
            m_h_hadSamples->Fill(hadSamples.at(i));
          }
 
          m_h_hadOnID->Fill(hadOnID_int);
          m_h_hadOffID->Fill(hadOffID_int);
    }
  }
 
  if (p_larTTL1Cont_em) {
        LArTTL1Container::const_iterator ttl1EM_itr(p_larTTL1Cont_em->begin());
        const LArTTL1Container::const_iterator ttl1EM_end(p_larTTL1Cont_em->end());
        for ( ; ttl1EM_itr != ttl1EM_end; ++ttl1EM_itr ) {
          const HWIdentifier& emOnID((*ttl1EM_itr)->ttOnlineID());
          const Identifier& emOffID((*ttl1EM_itr)->ttOfflineID());
          const std::vector<float>& emSamples((*ttl1EM_itr)->samples());
 
          const unsigned long long emOnID_int = emOnID.get_compact();
          const unsigned long long emOffID_int = emOffID.get_compact();
          if(m_tree) m_emOnID->push_back(emOnID_int);
          if(m_tree) m_emOffID->push_back(emOffID_int);
          for (std::vector<float>::size_type j = 0; j != emSamples.size(); ++j) {
            if(m_tree) m_emSamples->push_back(emSamples.at(j));
            m_h_emSamples->Fill(emSamples.at(j));
          }
 
          m_h_emOnID->Fill(emOnID_int);
          m_h_emOffID->Fill(emOffID_int);
        }
  }
 
 
  // LAr Digits
  if (p_larDigiCont) {
    LArDigitContainer::const_iterator digi_itr(p_larDigiCont->begin());
    const LArDigitContainer::const_iterator digi_end(p_larDigiCont->end());
    for ( ; digi_itr != digi_end; ++digi_itr ) {
      const HWIdentifier& digiID((*digi_itr)->hardwareID());
      CaloGain::CaloGain digiGain((*digi_itr)->gain());
      const std::vector<short>& digiSamples = (*digi_itr)->samples();
 
      const unsigned long long digiID_int = digiID.get_compact();
      const int digiGain_int = (int)digiGain;
      if(m_tree) m_digiID->push_back(digiID_int);
      if(m_tree) m_digiGain->push_back(digiGain_int);
      for (std::vector<short>::size_type k = 0; k != digiSamples.size(); ++k) {
        if(m_tree) m_digiSamples->push_back(digiSamples.at(k));
        m_h_digiSamples->Fill(digiSamples.at(k));
      }
 
      m_h_digiID->Fill(digiID_int);
      m_h_digiGain->Fill(digiGain_int);
   }
 }
  
 
 if(m_tree and m_doNtuple){ 
  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 453 of file AthHistogramming.cxx.

{
  // Build a 32 bit hash out of the name
  const hash_t graphHash = this->hash(graphName);
 
  // See if this entry exists in the map
  GraphMap_t::const_iterator it = m_graphMap.find( graphHash );
  if ( it == m_graphMap.end() ) // It doesn't exist!
    { // Let's see into the THistSvc if somebody else has registered the TGraph...
 
      // Need to copy the strings as we will massage them from here on
      std::string graphNameCopy = graphName;
      std::string tDirCopy      = tDir;
      std::string streamCopy    = stream;
 
      // Massage the final string to book things
      std::string bookingString("");
      this->buildBookingString( bookingString, graphNameCopy, tDirCopy, streamCopy, false);
 
      TGraph* graphPointer(nullptr);
      if ( !((histSvc()->getGraph(bookingString, graphPointer)).isSuccess()) )
        {
          // Massage the final string to book things
          std::string bookingString("");
          this->buildBookingString( bookingString, 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 430 of file AthHistogramming.h.

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

hist()

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

protectedinherited

Simplify the retrieval of registered histograms of any type.

Definition at line 164 of file AthHistogramming.cxx.

{
  std::string histNameCopy = histName;
  std::string tDirCopy     = tDir;
  std::string streamCopy   = stream;
 
  std::string bookingString;
  this->buildBookingString(bookingString, 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;
      this->buildBookingString(prefixedBookingString,
                               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 ( const std::string & histName, const std::string & tDir = "", const std::string & stream = "" )

inlineprotectedinherited

Simplify the retrieval of registered 2-d histograms.

Definition at line 371 of file AthHistogramming.h.

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

hist3d()

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

inlineprotectedinherited

Simplify the retrieval of registered 3-d histograms.

Definition at line 388 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 LArRDOAnalysis::initialize ( )

finaloverridevirtual

Definition at line 12 of file LArRDOAnalysis.cxx.

                                      {
  ATH_MSG_DEBUG( "Initializing LArRDOAnalysis" );
 
  // This will check that the properties were initialized
  // properly by job configuration.
  ATH_CHECK( m_inputRawChannelKey.initialize(SG::AllowEmpty) );
  ATH_CHECK( m_inputTTL1HADKey.initialize(SG::AllowEmpty) );
  ATH_CHECK( m_inputTTL1EMKey.initialize(SG::AllowEmpty) );
  ATH_CHECK( m_inputDigitKey.initialize(SG::AllowEmpty) );
 
  if(m_doNtuple){
    m_tree = new TTree(m_ntupleTreeName.value().c_str(), "LArRDOAna");
    std::string fullNtupleName =std::format("{}{}{}",m_ntupleFileName.value(), m_ntupleDirName.value(), 
                                                    m_ntupleTreeName.value());
    ATH_CHECK(histSvc()->regTree(fullNtupleName, m_tree));
    m_tree->Branch("larID", &m_larID);
    m_tree->Branch("energy", &m_energy);
    m_tree->Branch("time", &m_time);
    m_tree->Branch("qual", &m_qual);
    m_tree->Branch("prov", &m_prov);
    m_tree->Branch("gain", &m_gain);
    m_tree->Branch("hadOnID", &m_hadOnID);
    m_tree->Branch("hadOffID", &m_hadOffID);
    m_tree->Branch("hadSamples", &m_hadSamples);
    m_tree->Branch("emOnID", &m_emOnID);
    m_tree->Branch("emOffID", &m_emOffID);
    m_tree->Branch("emSamples", &m_emSamples);
    m_tree->Branch("digiID", &m_digiID);
    m_tree->Branch("digiGain", &m_digiGain);
    m_tree->Branch("digiSamples", &m_digiSamples);
  }
  
  m_h_larID = new TH1F("h_larID", "LAr ID", 100, 0, 5e18);
  m_h_larID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_larID->GetName(), m_h_larID));
 
  m_h_energy = new TH1F("h_energy", "LAr energy", 100, -1e5, 5e5);
  m_h_energy->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_energy->GetName(), m_h_energy));
 
  m_h_time = new TH1F("h_time", "LAr time", 100, -1e7, 1e7);
  m_h_time->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_time->GetName(), m_h_time));
 
  m_h_qual = new TH1F("h_qual", "LAr quality", 100, 0, 70000);
  m_h_qual->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_qual->GetName(), m_h_qual));
 
  m_h_prov = new TH1F("h_prov", "LAr provenance", 100, 0, 9000);
  m_h_prov->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_prov->GetName(), m_h_prov));
 
  m_h_gain = new TH1F("h_gain", "LAr gain", 100, 0, 5);
  m_h_gain->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_gain->GetName(), m_h_gain));
 
  m_h_hadOnID = new TH1F("h_hadOnID", "Had LAr TTL1 online ID", 100, 0, 3e19);
  m_h_hadOnID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_hadOnID->GetName(), m_h_hadOnID));
 
  m_h_hadOffID = new TH1F("h_hadOffID", "Had LAr TTL1 offline ID", 100, 0, 3e19);
  m_h_hadOffID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_hadOffID->GetName(), m_h_hadOffID));
 
  m_h_hadSamples = new TH1F("h_hadSamples", "Had LAr TTL1 sample values", 100, -15000, 35000);
  m_h_hadSamples->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_hadSamples->GetName(), m_h_hadSamples));
 
  m_h_emOnID = new TH1F("h_emOnID", "EM LAr TTL1 online ID", 100, 0, 3e19);
  m_h_emOnID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_emOnID->GetName(), m_h_emOnID));
 
  m_h_emOffID = new TH1F("h_emOffID", "EM LAr TTL1 offline ID", 100, 0, 3e19);
  m_h_emOffID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_emOffID->GetName(), m_h_emOffID));
 
  m_h_emSamples = new TH1F("h_emSamples", "EM LAr TTL1 sample values", 100, -1e5, 3.5e5);
  m_h_emSamples->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_emSamples->GetName(), m_h_emSamples));
 
  m_h_digiID = new TH1F("h_digiID", "LAr digit ID", 100, 0, 5e18);
  m_h_digiID->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_digiID->GetName(), m_h_digiID));
 
  m_h_digiGain = new TH1F("h_digiGain", "LAr digit gain", 100, 0, 5);
  m_h_digiGain->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_digiGain->GetName(), m_h_digiGain));
 
  m_h_digiSamples = new TH1F("h_digiSamples", "LAr digit sample values", 100, 0, 5000);
  m_h_digiSamples->StatOverflows();
  ATH_CHECK(histSvc()->regHist(m_path + m_h_digiSamples->GetName(), m_h_digiSamples));
 
  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 551 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 339 of file AthHistogramming.cxx.

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

updateVHKA()

void AthCommonDataStore< AthCommonMsg< 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_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_digiGain

std::vector<int>* LArRDOAnalysis::m_digiGain {nullptr}

private

Definition at line 61 of file LArRDOAnalysis.h.

{nullptr};

m_digiID

std::vector<unsigned long long>* LArRDOAnalysis::m_digiID {nullptr}

private

Definition at line 60 of file LArRDOAnalysis.h.

{nullptr};

m_digiSamples

std::vector<short>* LArRDOAnalysis::m_digiSamples {nullptr}

private

Definition at line 62 of file LArRDOAnalysis.h.

{nullptr};

m_doNtuple

Gaudi::Property<bool> LArRDOAnalysis::m_doNtuple {this , "doNtuple" , true}

private

Definition at line 38 of file LArRDOAnalysis.h.

{this , "doNtuple" , true};

m_effMap

EffMap_t AthHistogramming::m_effMap

privateinherited

The map of histogram names to their pointers.

Definition at line 210 of file AthHistogramming.h.

m_emOffID

std::vector<unsigned long long>* LArRDOAnalysis::m_emOffID {nullptr}

private

Definition at line 57 of file LArRDOAnalysis.h.

{nullptr};

m_emOnID

std::vector<unsigned long long>* LArRDOAnalysis::m_emOnID {nullptr}

private

Definition at line 56 of file LArRDOAnalysis.h.

{nullptr};

m_emSamples

std::vector<float>* LArRDOAnalysis::m_emSamples {nullptr}

private

Definition at line 58 of file LArRDOAnalysis.h.

{nullptr};

m_energy

std::vector<int>* LArRDOAnalysis::m_energy {nullptr}

private

Definition at line 47 of file LArRDOAnalysis.h.

{nullptr};

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_gain

std::vector<int>* LArRDOAnalysis::m_gain {nullptr}

private

Definition at line 51 of file LArRDOAnalysis.h.

{nullptr};

m_graphMap

GraphMap_t AthHistogramming::m_graphMap

privateinherited

The map of TGraph names to their pointers.

Definition at line 224 of file AthHistogramming.h.

m_h_digiGain

TH1* LArRDOAnalysis::m_h_digiGain {nullptr}

private

Definition at line 78 of file LArRDOAnalysis.h.

{nullptr};

m_h_digiID

TH1* LArRDOAnalysis::m_h_digiID {nullptr}

private

Definition at line 77 of file LArRDOAnalysis.h.

{nullptr};

m_h_digiSamples

TH1* LArRDOAnalysis::m_h_digiSamples {nullptr}

private

Definition at line 79 of file LArRDOAnalysis.h.

{nullptr};

m_h_emOffID

TH1* LArRDOAnalysis::m_h_emOffID {nullptr}

private

Definition at line 75 of file LArRDOAnalysis.h.

{nullptr};

m_h_emOnID

TH1* LArRDOAnalysis::m_h_emOnID {nullptr}

private

Definition at line 74 of file LArRDOAnalysis.h.

{nullptr};

m_h_emSamples

TH1* LArRDOAnalysis::m_h_emSamples {nullptr}

private

Definition at line 76 of file LArRDOAnalysis.h.

{nullptr};

m_h_energy

TH1* LArRDOAnalysis::m_h_energy {nullptr}

private

Definition at line 66 of file LArRDOAnalysis.h.

{nullptr};

m_h_gain

TH1* LArRDOAnalysis::m_h_gain {nullptr}

private

Definition at line 70 of file LArRDOAnalysis.h.

{nullptr};

m_h_hadOffID

TH1* LArRDOAnalysis::m_h_hadOffID {nullptr}

private

Definition at line 72 of file LArRDOAnalysis.h.

{nullptr};

m_h_hadOnID

TH1* LArRDOAnalysis::m_h_hadOnID {nullptr}

private

Definition at line 71 of file LArRDOAnalysis.h.

{nullptr};

m_h_hadSamples

TH1* LArRDOAnalysis::m_h_hadSamples {nullptr}

private

Definition at line 73 of file LArRDOAnalysis.h.

{nullptr};

m_h_larID

TH1* LArRDOAnalysis::m_h_larID {nullptr}

private

Definition at line 65 of file LArRDOAnalysis.h.

{nullptr};

m_h_prov

TH1* LArRDOAnalysis::m_h_prov {nullptr}

private

Definition at line 69 of file LArRDOAnalysis.h.

{nullptr};

m_h_qual

TH1* LArRDOAnalysis::m_h_qual {nullptr}

private

Definition at line 68 of file LArRDOAnalysis.h.

{nullptr};

m_h_time

TH1* LArRDOAnalysis::m_h_time {nullptr}

private

Definition at line 67 of file LArRDOAnalysis.h.

{nullptr};

m_hadOffID

std::vector<unsigned long long>* LArRDOAnalysis::m_hadOffID {nullptr}

private

Definition at line 54 of file LArRDOAnalysis.h.

{nullptr};

m_hadOnID

std::vector<unsigned long long>* LArRDOAnalysis::m_hadOnID {nullptr}

private

Definition at line 53 of file LArRDOAnalysis.h.

{nullptr};

m_hadSamples

std::vector<float>* LArRDOAnalysis::m_hadSamples {nullptr}

private

Definition at line 55 of file LArRDOAnalysis.h.

{nullptr};

m_histMap

HistMap_t AthHistogramming::m_histMap

privateinherited

The map of histogram names to their pointers.

Definition at line 203 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_inputDigitKey

SG::ReadHandleKey<LArDigitContainer> LArRDOAnalysis::m_inputDigitKey {this, "InputDigitKey", "LArDigitContainer_MC_Thinned"}

private

Definition at line 35 of file LArRDOAnalysis.h.

{this, "InputDigitKey", "LArDigitContainer_MC_Thinned"};

m_inputRawChannelKey

SG::ReadHandleKey<LArRawChannelContainer> LArRDOAnalysis::m_inputRawChannelKey {this, "InputRawChannelKey", "LArRawChannels"}

private

Definition at line 32 of file LArRDOAnalysis.h.

{this, "InputRawChannelKey", "LArRawChannels"};

m_inputTTL1EMKey

SG::ReadHandleKey<LArTTL1Container> LArRDOAnalysis::m_inputTTL1EMKey {this, "InputTTL1EMKey", "LArTTL1EM"}

private

Definition at line 34 of file LArRDOAnalysis.h.

{this, "InputTTL1EMKey", "LArTTL1EM"};

m_inputTTL1HADKey

SG::ReadHandleKey<LArTTL1Container> LArRDOAnalysis::m_inputTTL1HADKey {this, "InputTTL1HADKey", "LArTTL1HAD"}

private

Definition at line 33 of file LArRDOAnalysis.h.

{this, "InputTTL1HADKey", "LArTTL1HAD"};

m_larID

std::vector<unsigned long long>* LArRDOAnalysis::m_larID {nullptr}

private

Definition at line 46 of file LArRDOAnalysis.h.

{nullptr};

m_msg

MsgStream AthHistogramming::m_msg

privateinherited

Cached Message Stream.

Definition at line 250 of file AthHistogramming.h.

m_name

std::string AthHistogramming::m_name

privateinherited

Instance name.

Definition at line 247 of file AthHistogramming.h.

m_ntupleDirName

Gaudi::Property<std::string> LArRDOAnalysis::m_ntupleDirName {this , "NtupleDirectoryName" , "/LArRDOAnalysis/"}

private

Definition at line 40 of file LArRDOAnalysis.h.

{this , "NtupleDirectoryName" , "/LArRDOAnalysis/"};

m_ntupleFileName

Gaudi::Property<std::string> LArRDOAnalysis::m_ntupleFileName {this , "NtupleFileName" , "/ntuples/file1"}

private

Definition at line 39 of file LArRDOAnalysis.h.

{this , "NtupleFileName" , "/ntuples/file1"};

m_ntupleTreeName

Gaudi::Property<std::string> LArRDOAnalysis::m_ntupleTreeName {this , "NtupleTreeName" , "LArRDOAna"}

private

Definition at line 41 of file LArRDOAnalysis.h.

{this , "NtupleTreeName" , "LArRDOAna"};

m_path

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

private

Definition at line 42 of file LArRDOAnalysis.h.

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

m_prefix

std::string AthHistogramAlgorithm::m_prefix

privateinherited

Name of the ROOT output stream (file).

Definition at line 88 of file AthHistogramAlgorithm.h.

m_presampling

BooleanProperty LArRDOAnalysis::m_presampling {this, "PreSampling", false}

private

Definition at line 36 of file LArRDOAnalysis.h.

{this, "PreSampling", false};

m_prov

std::vector<uint16_t>* LArRDOAnalysis::m_prov {nullptr}

private

Definition at line 50 of file LArRDOAnalysis.h.

{nullptr};

m_qual

std::vector<uint16_t>* LArRDOAnalysis::m_qual {nullptr}

private

Definition at line 49 of file LArRDOAnalysis.h.

{nullptr};

m_rootDir

std::string AthHistogramAlgorithm::m_rootDir

privateinherited

Name of the ROOT directory.

Definition at line 91 of file AthHistogramAlgorithm.h.

m_streamName

std::string AthHistogramming::m_streamName

privateinherited

Name of the ROOT output stream (file).

Definition at line 228 of file AthHistogramming.h.

m_time

std::vector<int>* LArRDOAnalysis::m_time {nullptr}

private

Definition at line 48 of file LArRDOAnalysis.h.

{nullptr};

m_tree

TTree* LArRDOAnalysis::m_tree {nullptr}

private

Definition at line 81 of file LArRDOAnalysis.h.

{nullptr};

m_treeMap

TreeMap_t AthHistogramming::m_treeMap

privateinherited

The map of TTree names to their pointers.

Definition at line 217 of file AthHistogramming.h.

m_varHandleArraysDeclared

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

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• LArRDOAnalysis.h
• LArRDOAnalysis.cxx