This algorithm allows to read wave forms from ntuples and builds a LArPhysWaveContainer containing the corresponding PhysWave. More...

#include <LArShapeFromStdNtuple.h>

Inheritance diagram for LArShapeFromStdNtuple:

Collaboration diagram for LArShapeFromStdNtuple:

Public Member Functions
	LArShapeFromStdNtuple (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~LArShapeFromStdNtuple ()
virtual StatusCode	initialize () override
	implements IAlgorithm::initialize()
virtual StatusCode	execute () override
	implements IAlgorithm::execute() : Does nothing
virtual StatusCode	finalize () override
virtual StatusCode	stop () override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual const DataObjIDColl &	extraOutputDeps () const override
	Return the list of extra output dependencies.
ServiceHandle< StoreGateSvc > &	evtStore ()
	The standard `StoreGateSvc` (event store) Returns (kind of) a pointer to the `StoreGateSvc`.
const ServiceHandle< StoreGateSvc > &	detStore () const
	The standard `StoreGateSvc/DetectorStore` Returns (kind of) a pointer to the `StoreGateSvc`.
virtual StatusCode	sysStart () override
	Handle START transition.
virtual std::vector< Gaudi::DataHandle * >	inputHandles () const override
	Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * >	outputHandles () const override
	Return this algorithm's output handles.
Gaudi::Details::PropertyBase &	declareProperty (Gaudi::Property< T, V, H > &t)
void	updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream &	msg () const
bool	msgLvl (const MSG::Level lvl) const

Protected Member Functions
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.

Private Types
typedef ServiceHandle< StoreGateSvc >	StoreGateSvc_t

Private Member Functions
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
unsigned int	m_skipPoints
	the first m_skipPoints points of the waveform in the ntuple are skipped
unsigned int	m_prefixPoints
	make a Shape with the first m_prefixPoints as zeros
std::vector< std::string >	m_root_file_names
	list of input ntuple file names
std::string	m_ntuple_name
	ntuple name
std::string	m_store_key
	key of the LArShape collection in Storegate
std::string	m_groupingType
	Grouping type.
bool	m_isComplete
	Shape type.
bool	m_done
SG::ReadCondHandleKey< LArMCSym >	m_mcSymKey {this, "MCSymKey", "LArMCSym", "SG Key of LArMCSym object"}
DataObjIDColl	m_extendedExtraObjects
StoreGateSvc_t	m_evtStore
	Pointer to StoreGate (event store by default)
StoreGateSvc_t	m_detStore
	Pointer to StoreGate (detector store by default)
std::vector< SG::VarHandleKeyArray * >	m_vhka
bool	m_varHandleArraysDeclared

Detailed Description

This algorithm allows to read wave forms from ntuples and builds a LArPhysWaveContainer containing the corresponding PhysWave.

Version for standard Ntuple, produced by LArCalibTools algos....

Definition at line 22 of file LArShapeFromStdNtuple.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ LArShapeFromStdNtuple()

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

Definition at line 26 of file LArShapeFromStdNtuple.cxx.

                                                                                             : AthAlgorithm(name, pSvcLocator)
{  
  declareProperty("SkipPoints", m_skipPoints = 0);
  declareProperty("PrefixPoints", m_prefixPoints = 0);
  declareProperty("FileNames", m_root_file_names);
  declareProperty("NtupleName", m_ntuple_name="SHAPE");
  declareProperty("StoreKey", m_store_key="FromStdNtuple");
  declareProperty("GroupingType", m_groupingType="ExtendedSubDetector");
  declareProperty("isComplete",   m_isComplete=false);
 
  m_done=false;
}

◆ ~LArShapeFromStdNtuple()

LArShapeFromStdNtuple::~LArShapeFromStdNtuple ( )

virtualdefault

Member Function Documentation

◆ declareGaudiProperty()

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

inlineprivateinherited

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

Definition at line 156 of file AthCommonDataStore.h.

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

◆ declareProperty()

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

inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

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

◆ detStore()

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

inlineinherited

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

Definition at line 95 of file AthCommonDataStore.h.

95{ return m_detStore; }

AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

◆ evtStore()

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

inlineinherited

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

Definition at line 85 of file AthCommonDataStore.h.

85{ return m_evtStore; }

AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

virtual StatusCode LArShapeFromStdNtuple::execute ( )

inlineoverridevirtual

implements IAlgorithm::execute() : Does nothing

Definition at line 34 of file LArShapeFromStdNtuple.h.

34{return StatusCode::SUCCESS;}

◆ extraDeps_update_handler()

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

protectedinherited

Add StoreName to extra input/output deps as needed.

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

◆ extraOutputDeps()

const DataObjIDColl & AthAlgorithm::extraOutputDeps ( ) const

overridevirtualinherited

Return the list of extra output dependencies.

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

Definition at line 50 of file AthAlgorithm.cxx.

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

◆ finalize()

virtual StatusCode LArShapeFromStdNtuple::finalize ( )

inlineoverridevirtual

Definition at line 36 of file LArShapeFromStdNtuple.h.

36{return StatusCode::SUCCESS;}

◆ initialize()

StatusCode LArShapeFromStdNtuple::initialize ( )

overridevirtual

implements IAlgorithm::initialize()

Definition at line 42 of file LArShapeFromStdNtuple.cxx.

{
  ATH_CHECK ( m_mcSymKey.initialize() ); 
  return StatusCode::SUCCESS ;
}

◆ inputHandles()

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

overridevirtualinherited

Return this algorithm's input handles.

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

◆ msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

◆ msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

◆ outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

◆ renounce()

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

inlineprotectedinherited

Definition at line 380 of file AthCommonDataStore.h.

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

◆ renounceArray()

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

inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 364 of file AthCommonDataStore.h.

                                                          {
    handlesArray.renounce();
  }

◆ stop()

StatusCode LArShapeFromStdNtuple::stop ( )

overridevirtual

Definition at line 49 of file LArShapeFromStdNtuple.cxx.

{
  if(m_done) return StatusCode::SUCCESS;
 
  ATH_MSG_INFO ( "... in stop()" );
 
  const EventContext& ctx = Gaudi::Hive::currentContext();
  SG::ReadCondHandle<LArMCSym> mcsym (m_mcSymKey, ctx);
  
  // get LArOnlineID helper
  const LArOnlineID* onlineHelper = nullptr;
  ATH_CHECK( detStore()->retrieve(onlineHelper, "LArOnlineID") );
 
  TChain* outfit = new TChain(m_ntuple_name.c_str());
  for (const std::string& s : m_root_file_names) {
    outfit->Add(s.c_str());
  }
 
 
  Int_t           phase=0;
  Int_t           det=0;
  Float_t         phaseTime=0;
  Float_t         timeOffset=0;
  Int_t           channelId=0;
  Int_t           FT=0, slot=0, channel=0;
 
  Float_t         Shape[2000]; // The function
  Float_t         ShapeDer[2000]; // The function
  Int_t           gain = 0; // LARHIGHGAIN = 0, LARMEDIUMGAIN = 1,  LARLOWGAIN = 2,
  Int_t           nsamples=0;
 
  outfit->SetBranchAddress("channelId", &channelId);
  outfit->SetBranchAddress("FT", &FT);
  outfit->SetBranchAddress("slot", &slot);
  outfit->SetBranchAddress("channel", &channel);
  outfit->SetBranchAddress("detector", &det);
  if(m_isComplete) {
    outfit->SetBranchAddress("PhaseTime", &phaseTime);
    outfit->SetBranchAddress("Phase", &phase);
    outfit->SetBranchAddress("timeOffset", &timeOffset);
  }
  outfit->SetBranchAddress("nSamples", &nsamples);
  outfit->SetBranchAddress("Gain", &gain);
  outfit->SetBranchAddress("Shape", Shape);
  outfit->SetBranchAddress("ShapeDer", ShapeDer);
 
  Float_t timeBinWidth=-1, prevTime=-1, timeOff=-1;
  Int_t prevPhase=-1;
 
  // Create new LArShapeContainer
  std::unique_ptr<LArShapeComplete> larShapeComplete;
  std::unique_ptr<LArShape32MC> larShapeMC;
 
  if(m_isComplete) {
    larShapeComplete = std::make_unique<LArShapeComplete>();
    ATH_CHECK( larShapeComplete->setGroupingType(m_groupingType, msg()) );
    ATH_CHECK( larShapeComplete->initialize() );
  } else {
    larShapeMC = std::make_unique<LArShape32MC>();
    ATH_CHECK( larShapeMC->setGroupingType(m_groupingType, msg()) );
    ATH_CHECK( larShapeMC->initialize() );
  } 
 
  std::vector<float> shapemc;
  std::vector<float> shape_dermc;
  typedef std::vector<std::vector<float> > wave2d;
  std::map<std::pair<unsigned int,int>, wave2d> shape;
  std::map<std::pair<unsigned int,int>, wave2d> shape_der;
  unsigned int hwid;
  // loop over entries in the Tuple, one entry = one channel
  Long64_t nentries = outfit->GetEntries();
  for ( Long64_t iev = 0; iev < nentries; ++iev )
  {
    outfit->GetEvent(iev);
    ATH_MSG_INFO ( " Chan " <<  std::hex << channelId << " det. "<< det << std::dec );
 
    hwid = channelId;
    //if (det != 4) hwid = (channelId<<4);
    HWIdentifier id(hwid);
    
    /*
    if(FT != onlineHelper->feedthrough(id) || slot != onlineHelper->slot(id) || channel != onlineHelper->channel(id)) {
      ATH_MSG_ERROR ( "Inconsistency in decoding HWID !!!!" );
      ATH_MSG_INFO  ( "Trying to fix..." );
      hwid = (channelId<<4);
      id=HWIdentifier(hwid);
    */
      if(FT != onlineHelper->feedthrough(id) || slot != onlineHelper->slot(id) || channel != onlineHelper->channel(id)) {
        ATH_MSG_ERROR ( "Inconsistency in decoding HWID !!!!" );
        ATH_MSG_ERROR ( FT << " - " << onlineHelper->feedthrough(id) );
        ATH_MSG_ERROR ( slot << " - " << onlineHelper->slot(id) );
        ATH_MSG_ERROR ( channel << " - " << onlineHelper->channel(id) );
        //if(det == 4) {
        //   ATH_MSG_ERROR ( "Ignoring for sFcal" );
        //} else {   
        //   ATH_MSG_ERROR ( "Not creating Shape !!!!" );
        //   continue;
        // }
        continue;
     /* }
      ATH_MSG_INFO  ( "Fixed....." );
     */ 
    }
 
    // Catch potential array index out of range error.
    if ( nsamples >= 2000 ) {
      ATH_MSG_ERROR ( " Too many points specified vs the expected content of the ntuple ! " );
      ATH_MSG_ERROR ( "Not creating Shape !!!!" );
      continue;
    } else {
      ATH_MSG_DEBUG ( "Working with " << nsamples << " samples" ); 
    }
    if(timeBinWidth < 0) {
       if(prevTime < 0) {
          prevTime=phaseTime;
          prevPhase=phase;
       } else {
          if(abs(phase-prevPhase) == 1) {
            timeBinWidth=std::fabs(phaseTime - prevTime);
          }
       }
    }
 
    if(timeOff < 0) timeOff=timeOffset;
 
    if(m_isComplete) { 
       if(shape[std::make_pair(hwid,gain)].empty()) shape[std::make_pair(hwid,gain)].reserve(50);
       if(shape_der[std::make_pair(hwid,gain)].empty()) shape_der[std::make_pair(hwid,gain)].reserve(50);
       shape[std::make_pair(hwid,gain)][phase].reserve(nsamples);
       shape_der[std::make_pair(hwid,gain)][phase].reserve(nsamples);
       for(int i=0;i<nsamples; ++i) {shape[std::make_pair(hwid,gain)][phase][i]=0.;
                                 shape_der[std::make_pair(hwid,gain)][phase][i]=0.;}
    } else {
       shapemc.resize(nsamples);
       shape_dermc.resize(nsamples);
       for(int i=0;i<nsamples; ++i) {shapemc[i]=0.; shape_dermc[i]=0.;}
    }
    unsigned int skipped = 0;
    unsigned int limit = nsamples;
    if ( m_skipPoints < m_prefixPoints ) limit = nsamples+m_skipPoints-m_prefixPoints;
    for ( unsigned int i = 0; i < limit; i++ ) {
      if ( skipped >= m_skipPoints ) {
       if(m_isComplete) { // accumulate into map
    shape[std::make_pair(hwid,gain)][phase][i-m_skipPoints+m_prefixPoints]=Shape[i];
    shape_der[std::make_pair(hwid,gain)][phase][i-m_skipPoints+m_prefixPoints]=ShapeDer[i];
 
       } else {
    shapemc[i-m_skipPoints+m_prefixPoints]=Shape[i];
    shape_dermc[i-m_skipPoints+m_prefixPoints]=ShapeDer[i];
       }
      } else skipped++;
    }
 
    if(!m_isComplete) {
       if (id != mcsym->ZPhiSymOnl(id) ) {
           ATH_MSG_INFO( "Symmetrized, not stored" );
       } else {
 
           ATH_MSG_INFO( "Storing shape with length: " << shapemc.size() );
 
           //LArShapeP1 t(shapemc,shape_dermc);
 
           //larShapeMC->setPdata(id, LArShapeP1(shapemc,shape_dermc),gain);
           larShapeMC->set(id, gain, shapemc, shape_dermc);
           ATH_MSG_INFO( larShapeMC->Shape(id,gain).size() << " " << larShapeMC->ShapeDer(id,gain).size() );
           ATH_MSG_INFO( "Shape[2] =" << larShapeMC->Shape(id,gain)[2] << "shapemc[2] =" << shapemc[2] );
       }
    }
 
  }
  // for complete, could fill only now
  if(m_isComplete){
      std::map<std::pair<unsigned int,int>, wave2d>::iterator ibeg = shape.begin();
      std::map<std::pair<unsigned int,int>, wave2d>::iterator iend = shape.end();
      for(;ibeg != iend; ++ibeg) {
        larShapeComplete->set(HWIdentifier((ibeg->first).first),(ibeg->first).second,
                              ibeg->second, shape_der[std::make_pair((ibeg->first).first, (ibeg->first).second)],
                              timeOff,timeBinWidth);
      }
  }
 
  if(m_isComplete) {
     ATH_CHECK( detStore()->record(std::move(larShapeComplete),m_store_key) );
  } else {
     ATH_CHECK( detStore()->record(std::move(larShapeMC),m_store_key) );
  }
  return StatusCode::SUCCESS;
}

◆ sysInitialize()

StatusCode AthAlgorithm::sysInitialize ( )

overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Algorithm > >.

Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, and PyAthena::Alg.

Definition at line 66 of file AthAlgorithm.cxx.

                                       {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<Algorithm>>::sysInitialize();
 
  if (sc.isFailure()) {
    return sc;
  }
  ServiceHandle<ICondSvc> cs("CondSvc",name());
  for (auto h : outputHandles()) {
    if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
      // do this inside the loop so we don't create the CondSvc until needed
      if ( cs.retrieve().isFailure() ) {
        ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
        return StatusCode::SUCCESS;
      }
      if (cs->regHandle(this,*h).isFailure()) {
        sc = StatusCode::FAILURE;
        ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
                      << " with CondSvc");
      }
    }
  }
  return sc;
}

◆ sysStart()

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

overridevirtualinherited

Handle START transition.

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

◆ updateVHKA()

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

inlineinherited

Definition at line 308 of file AthCommonDataStore.h.

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

Member Data Documentation

◆ m_detStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_detStore

privateinherited

Pointer to StoreGate (detector store by default)

Definition at line 393 of file AthCommonDataStore.h.

◆ m_done

bool LArShapeFromStdNtuple::m_done

private

Definition at line 55 of file LArShapeFromStdNtuple.h.

◆ m_evtStore

StoreGateSvc_t AthCommonDataStore< AthCommonMsg< Algorithm > >::m_evtStore

privateinherited

Pointer to StoreGate (event store by default)

Definition at line 390 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthAlgorithm::m_extendedExtraObjects

privateinherited

Definition at line 79 of file AthAlgorithm.h.

◆ m_groupingType

std::string LArShapeFromStdNtuple::m_groupingType

private

Grouping type.

Definition at line 51 of file LArShapeFromStdNtuple.h.

◆ m_isComplete

bool LArShapeFromStdNtuple::m_isComplete

private

Shape type.

Definition at line 53 of file LArShapeFromStdNtuple.h.

◆ m_mcSymKey

SG::ReadCondHandleKey<LArMCSym> LArShapeFromStdNtuple::m_mcSymKey {this, "MCSymKey", "LArMCSym", "SG Key of LArMCSym object"}

private

Definition at line 57 of file LArShapeFromStdNtuple.h.

58{this, "MCSymKey", "LArMCSym", "SG Key of LArMCSym object"};

◆ m_ntuple_name

std::string LArShapeFromStdNtuple::m_ntuple_name

private

ntuple name

Definition at line 47 of file LArShapeFromStdNtuple.h.

◆ m_prefixPoints

unsigned int LArShapeFromStdNtuple::m_prefixPoints

private

make a Shape with the first m_prefixPoints as zeros

Definition at line 43 of file LArShapeFromStdNtuple.h.

◆ m_root_file_names

std::vector<std::string> LArShapeFromStdNtuple::m_root_file_names

private

list of input ntuple file names

Definition at line 45 of file LArShapeFromStdNtuple.h.

◆ m_skipPoints

unsigned int LArShapeFromStdNtuple::m_skipPoints

private

the first m_skipPoints points of the waveform in the ntuple are skipped

Definition at line 41 of file LArShapeFromStdNtuple.h.

◆ m_store_key

std::string LArShapeFromStdNtuple::m_store_key

private

key of the LArShape collection in Storegate

Definition at line 49 of file LArShapeFromStdNtuple.h.

◆ m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

◆ m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

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

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ LArShapeFromStdNtuple()

◆ ~LArShapeFromStdNtuple()

Member Function Documentation

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ stop()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_done

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_groupingType

◆ m_isComplete

◆ m_mcSymKey

◆ m_ntuple_name

◆ m_prefixPoints

◆ m_root_file_names

◆ m_skipPoints

◆ m_store_key

◆ m_varHandleArraysDeclared

◆ m_vhka