This algorithm allows to read wave forms from ntuples and builds a LArCaliWaveContainer containg the corresponding CaliWave. More...

#include <LArCaliWaveFromTuple.h>

Inheritance diagram for LArCaliWaveFromTuple:

Collaboration diagram for LArCaliWaveFromTuple:

Public Member Functions
StatusCode	execute (const EventContext &) override final
	Execute method.
StatusCode	stop () override
	AthAlgorithm (const std::string &name, ISvcLocator *pSvcLocator)
	Constructor.
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
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.

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
Gaudi::Property< unsigned int >	m_NPoints {this, "NPoints", 32, "number of points per measurement"}
	max number of points of the waveform in the ntuple
Gaudi::Property< unsigned int >	m_skipPoints {this, "SkipPoints", 0, "How many points to skip"}
	the first m_skipPoints points of the waveform in the ntuple are skipped
Gaudi::Property< unsigned int >	m_prefixPoints {this, "PrefixPoints", 0, "How many points to add on front"}
	make a PhysWave with the first m_prefixPoints as zeros
Gaudi::Property< unsigned int >	m_flag {this, "LArWaveFlag", 20, "Flag to store with CaliWave"}
	flag for the PhysWave container
Gaudi::Property< std::string >	m_root_file_name {this, "FileName", "", "which file to open"}
	input file name
Gaudi::Property< std::string >	m_ntuple_name {this, "NtupleName", "CALIWAVE", "which ntuple to read"}
	ntuple name
Gaudi::Property< std::string >	m_store_key {this, "StoreKey", "FROMTUPLE", "SG key of created container"}
	key of the PhysWave collection in Storegate
Gaudi::Property< std::string >	m_groupingType {this, "GroupingType", "ExtendedFeedThrough", "container grouping type"}
	Grouping type. Default is Feedthrough.
Gaudi::Property< bool >	m_isSC {this, "isSC", false, "Running for SuperCells ?"}
Gaudi::Property< float >	m_dt {this, "DelayStep", 25./24., "what is the delay step in ns ?"}
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

Detailed Description

This algorithm allows to read wave forms from ntuples and builds a LArCaliWaveContainer containg the corresponding CaliWave.

The root tree should contain the following branches :

Definition at line 20 of file LArCaliWaveFromTuple.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Member Function Documentation

◆ AthAlgorithm()

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

Constructor.

Definition at line 31 of file AthAlgorithm.cxx.

                                                       :
  AthCommonAlgorithm<Gaudi::Algorithm>( name, pSvcLocator )
{
  // default cardinality for non-reentrant algorithms
  setProperty( "Cardinality", 1 ).orThrow("Unable to set property 'Cardinality'", name);
}

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

95{ return m_detStore; }

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

StoreGateSvc_t m_detStore

Definition AthCommonDataStore.h:393

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

85{ return m_evtStore; }

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

StoreGateSvc_t m_evtStore

Definition AthCommonDataStore.h:390

◆ execute()

StatusCode LArCaliWaveFromTuple::execute ( const EventContext & ctx )

inlinefinaloverridevirtual

Execute method.

Implements AthAlgorithm.

Definition at line 25 of file LArCaliWaveFromTuple.h.

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

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

47{ return false; }

◆ msg()

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

inlineinherited

Definition at line 24 of file AthCommonMsg.h.

                                {
    return this->msgStream();
  }

◆ msgLvl()

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

inlineinherited

Definition at line 30 of file AthCommonMsg.h.

                                               {
    return this->msgLevel(lvl);
  }

◆ outputHandles()

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

overridevirtualinherited

Return this algorithm's output handles.

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

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

◆ stop()

StatusCode LArCaliWaveFromTuple::stop ( )

override

Definition at line 27 of file LArCaliWaveFromTuple.cxx.

{
  ATH_MSG_INFO ( "... in stop()" );
  
  const std::vector<int> FEBs={0x39000000, 0x39010000, 0x39018000, 0x39020000, 0x39028000, 0x39030000, 0x39038000, 0x39040000, 0x39048000, 0x39050000, 0x39058000, 0x39060000, 0x39068000};
 
  TChain* outfit = new TChain(m_ntuple_name.value().c_str());
  outfit->Add(m_root_file_name.value().c_str());
 
  // This algorithm assumes the input NTuple in contains less than 32 
  // points.  If the NTuple contains less than 32 points, the 
  // remaining points are automatically initialized to 0.
  // Catch potential array index out of range error.
  if ( m_NPoints > 32 ) {
    ATH_MSG_WARNING ( " Too many points specified vs the expected content of the ntuple ! " );
    ATH_MSG_WARNING ( " Only 32 will be used !");
    m_NPoints = 32;
  }
 
  // loop over delay branch and find number of existing delays
  Int_t           delay; 
  Int_t           febid; 
  outfit->SetBranchAddress("delay", &delay);
  outfit->SetBranchAddress("febId", &febid);
  Long64_t nentries = outfit->GetEntries();
  std::map<int,int> tmpmap;
  std::vector<int> febvec;
  for(Long64_t i = 0; i < nentries; ++i ){
      outfit->GetEntry(i);
      tmpmap[delay]=delay;
      if(std::find(febvec.begin(), febvec.end(), febid) == febvec.end()) febvec.push_back(febid);
  }
  unsigned ndelays = tmpmap.size();
  if(febvec.size() > 13) {
     ATH_MSG_ERROR("Too many FEBs in the ntuple, fix the code");
     return StatusCode::FAILURE;
  }     
 
  // variable names as in the Ntuple
  Int_t           febchannel; 
  Int_t           gain; 
  Int_t           dac; 
  std::vector<int>    *Amplitude = nullptr; 
  outfit->SetBranchAddress("febChannel", &febchannel);
  outfit->SetBranchAddress("gain", &gain);
  outfit->SetBranchAddress("dac", &dac);
  outfit->SetBranchAddress("ADC", &Amplitude);
 
  // Create new LArCaliWaveContainer
  auto larCaliWaveContainerNew = std::make_unique<LArCaliWaveContainer>();
  ATH_CHECK ( larCaliWaveContainerNew->setGroupingType(m_groupingType, msg()) );
  ATH_CHECK ( larCaliWaveContainerNew->initialize() );
 
  // loop over entries in the Tuple, fill the waves sum and sum2
  typedef std::map<HWIdentifier,std::map<std::pair<short, int> , std::vector<long int> > > Wavesmap_t;
  Wavesmap_t wavesum;
  Wavesmap_t wavesum2;
  Wavesmap_t wavensum;
  for ( Long64_t iev = 0; iev < nentries; ++iev ) {
    outfit->GetEvent(iev);
    //check gain validity
    if(gain < CaloGain::LARHIGHGAIN || gain >= CaloGain::LARNGAINR4) continue; // bad gain value
    // hack until real febId in ntuple:
    auto it = std::find(febvec.begin(), febvec.end(), febid);
    unsigned int index= it - febvec.begin();
    HWIdentifier id( FEBs[index] | ((febchannel&0x7F)<<8) );
    ATH_MSG_DEBUG ( "onlineid created " << std::hex << id << std::dec);
    std::pair<short, int>  idpair=std::make_pair(gain,dac);
    // check if we have this HWid and gain.dac pair already
    if(  ! wavesum.count(id) || ! wavesum[id].count(idpair)) { // we have new combination
        wavesum[id][idpair].reserve((m_NPoints + m_prefixPoints) * ndelays);
        wavesum2[id][idpair].reserve((m_NPoints + m_prefixPoints) * ndelays);
        wavensum[id][idpair].reserve((m_NPoints + m_prefixPoints) * ndelays);
        for ( unsigned int i = 0; i < (m_NPoints + m_prefixPoints) * ndelays; ++i ){
          wavesum[id][idpair][i]=0;
          wavesum2[id][idpair][i]=0;
          wavensum[id][idpair][i]=0;
        }
    }
    unsigned upper = m_NPoints.value() > Amplitude->size() ? Amplitude->size() : m_NPoints.value();
    for ( unsigned int i = 0; i < upper; ++i) {
       if ( m_skipPoints > 0 && m_skipPoints <= i+1 ) continue; 
       wavesum[id][idpair][(m_prefixPoints+delay)*ndelays*m_NPoints + i] += Amplitude->at(i);
       wavesum2[id][idpair][(m_prefixPoints+delay)*ndelays*m_NPoints + i] += Amplitude->at(i)*Amplitude->at(i);
       wavensum[id][idpair][(m_prefixPoints+delay)*ndelays*m_NPoints + i] += 1;
    }
 
  }// loop over ntuple
  ATH_MSG_INFO("Loop done");
 
  // compute the average and fill LArCaliWaveVec
  double dt=m_dt.value();
  for(auto  & [hwid, wmap] : wavesum) {
    std::vector<LArCaliWaveVec> waveVec(CaloGain::LARNGAINR4);
    for(auto dgkey : std::views::keys(wavesum[hwid])) { 
       auto dac = dgkey.second;
       auto gain = dgkey.first;
       std::vector<double> amp((m_NPoints + m_prefixPoints) * ndelays, 0.);
       std::vector<double> err((m_NPoints + m_prefixPoints) * ndelays, 0.);
       std::vector<int> ntrig((m_NPoints + m_prefixPoints) * ndelays, 0);
       for(unsigned int i=0; i< (m_NPoints + m_prefixPoints) * ndelays; ++i) {
          if(wavensum[hwid][dgkey][i] > 0) {
             amp[i] = (double)wavesum[hwid][dgkey][i] / wavensum[hwid][dgkey][i];
             err[i] = std::sqrt((double)wavesum2[hwid][dgkey][i] / wavensum[hwid][dgkey][i] - amp[i]*amp[i]);
             ntrig[i] = wavensum[hwid][dgkey][i];
          }
       }
       waveVec[gain].push_back(LArCaliWave(amp, err, ntrig, dt, dac,1, LArWave::meas));
    }
    // Add waveVec to container
    for(unsigned ig = CaloGain::LARHIGHGAIN; ig < CaloGain::LARNGAINR4; ++ ig) {
       larCaliWaveContainerNew->setPdata(hwid, waveVec[ig], (CaloGain::CaloGain)ig);
    }
  } 
      
 
  ATH_CHECK( detStore()->record(std::move(larCaliWaveContainerNew),m_store_key) );
  ATH_MSG_INFO ( "LArCaliWaveFromTuple finalized!" );
  return StatusCode::SUCCESS;
}

◆ 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 AthCommonAlgorithm< Gaudi::Algorithm >::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< Gaudi::Algorithm > >.

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

Definition at line 60 of file AthCommonAlgorithm.cxx.

                                                      {
  StatusCode sc=AthCommonDataStore<AthCommonMsg<BaseAlg>>::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< 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.

◆ 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_dt

Gaudi::Property< float > LArCaliWaveFromTuple::m_dt {this, "DelayStep", 25./24., "what is the delay step in ns ?"}

private

Definition at line 47 of file LArCaliWaveFromTuple.h.

47{this, "DelayStep", 25./24., "what is the delay step in ns ?"};

◆ 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_flag

Gaudi::Property<unsigned int> LArCaliWaveFromTuple::m_flag {this, "LArWaveFlag", 20, "Flag to store with CaliWave"}

private

flag for the PhysWave container

Definition at line 37 of file LArCaliWaveFromTuple.h.

37{this, "LArWaveFlag", 20, "Flag to store with CaliWave"};

◆ m_groupingType

Gaudi::Property<std::string> LArCaliWaveFromTuple::m_groupingType {this, "GroupingType", "ExtendedFeedThrough", "container grouping type"}

private

Grouping type. Default is Feedthrough.

Definition at line 45 of file LArCaliWaveFromTuple.h.

45{this, "GroupingType", "ExtendedFeedThrough", "container grouping type"};

◆ m_isSC

Gaudi::Property< bool > LArCaliWaveFromTuple::m_isSC {this, "isSC", false, "Running for SuperCells ?"}

private

Definition at line 46 of file LArCaliWaveFromTuple.h.

46{this, "isSC", false, "Running for SuperCells ?"};

◆ m_NPoints

Gaudi::Property<unsigned int> LArCaliWaveFromTuple::m_NPoints {this, "NPoints", 32, "number of points per measurement"}

private

max number of points of the waveform in the ntuple

Definition at line 31 of file LArCaliWaveFromTuple.h.

31{this, "NPoints", 32, "number of points per measurement"};

◆ m_ntuple_name

Gaudi::Property<std::string> LArCaliWaveFromTuple::m_ntuple_name {this, "NtupleName", "CALIWAVE", "which ntuple to read"}

private

ntuple name

Definition at line 41 of file LArCaliWaveFromTuple.h.

41{this, "NtupleName", "CALIWAVE", "which ntuple to read"};

◆ m_prefixPoints

Gaudi::Property<unsigned int> LArCaliWaveFromTuple::m_prefixPoints {this, "PrefixPoints", 0, "How many points to add on front"}

private

make a PhysWave with the first m_prefixPoints as zeros

Definition at line 35 of file LArCaliWaveFromTuple.h.

35{this, "PrefixPoints", 0, "How many points to add on front"};

◆ m_root_file_name

Gaudi::Property<std::string> LArCaliWaveFromTuple::m_root_file_name {this, "FileName", "", "which file to open"}

private

input file name

Definition at line 39 of file LArCaliWaveFromTuple.h.

39{this, "FileName", "", "which file to open"};

◆ m_skipPoints

Gaudi::Property<unsigned int> LArCaliWaveFromTuple::m_skipPoints {this, "SkipPoints", 0, "How many points to skip"}

private

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

Definition at line 33 of file LArCaliWaveFromTuple.h.

33{this, "SkipPoints", 0, "How many points to skip"};

◆ m_store_key

Gaudi::Property<std::string> LArCaliWaveFromTuple::m_store_key {this, "StoreKey", "FROMTUPLE", "SG key of created container"}

private

key of the PhysWave collection in Storegate

Definition at line 43 of file LArCaliWaveFromTuple.h.

43{this, "StoreKey", "FROMTUPLE", "SG key of created container"};

◆ 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:

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Member Function Documentation

◆ AthAlgorithm()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ inputHandles()

◆ isClonable()

◆ isReEntrant()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ stop()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_detStore

◆ m_dt

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_flag

◆ m_groupingType

◆ m_isSC

◆ m_NPoints

◆ m_ntuple_name

◆ m_prefixPoints

◆ m_root_file_name

◆ m_skipPoints

◆ m_store_key

◆ m_varHandleArraysDeclared

◆ m_vhka