LArRawChannelBuilderIterAlg Class Reference

#include <LArRawChannelBuilderIterAlg.h>

Inheritance diagram for LArRawChannelBuilderIterAlg:

Public Member Functions
StatusCode	initialize () override
StatusCode	execute (const EventContext &ctx) const override
StatusCode	finalize () override
virtual StatusCode	sysInitialize () override
	Override sysInitialize.
virtual bool	isClonable () const override
	Specify if the algorithm is clonable.
virtual unsigned int	cardinality () const override
	Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.
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
virtual void	setFilterPassed (bool state, const EventContext &ctx) const
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
LArOFIterResults	peak (const std::vector< float > &samples, const HWIdentifier chID, const CaloGain::CaloGain gain, const float delayIn, const ILArOFC *ofcs, const ILArShape *shapes, const unsigned nIter=0, const unsigned npeak=2, unsigned peak_low=2, unsigned peak_high=2) const
Gaudi::Details::PropertyBase &	declareGaudiProperty (Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
	specialization for handling Gaudi::Property<SG::VarHandleKey>

Private Attributes
SG::ReadHandleKey< LArDigitContainer >	m_digitKey
SG::WriteHandleKey< LArRawChannelContainer >	m_rawChannelKey
SG::ReadCondHandleKey< ILArPedestal >	m_pedestalKey {this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"}
SG::ReadCondHandleKey< LArADC2MeV >	m_adc2MeVKey {this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"}
SG::ReadCondHandleKey< ILArOFC >	m_ofcKey {this,"OFCKey","LArOFC","SG Key of OFC conditions object"}
SG::ReadCondHandleKey< ILArShape >	m_shapeKey {this,"ShapeKey","LArShape","SG Key of Shape conditions object"}
SG::ReadCondHandleKey< LArOnOffIdMapping >	m_cablingKey {this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"}
SG::ReadCondHandleKey< LArDSPThresholdsComplete >	m_run1DSPThresholdsKey {this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"}
SG::ReadCondHandleKey< AthenaAttributeList >	m_run2DSPThresholdsKey {this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"}
Gaudi::Property< float >	m_eCutFortQ {this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"}
Gaudi::Property< bool >	m_absECutFortQ {this,"absECut",true,"Cut on fabs(E) for Q and t computation"}
Gaudi::Property< bool >	m_useShapeDer {this,"useShapeDer",true,"Use shape derivative in Q-factor computation"}
Gaudi::Property< bool >	m_useDBFortQ {this,"useDB",true,"Use DB for cut on t,Q"}
Gaudi::Property< int >	m_firstSample {this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"}
Gaudi::Property< unsigned short >	m_AdcMax {this, "ADCMax", 4095, "Saturation cut"}
Gaudi::Property< bool >	m_skipSaturatedCells {this, "Skip", false, "reconstruct saturated cells"}
Gaudi::Property< float >	m_defaultPhase {this, "defaultPhase", 0, "starting phase for iterations"}
Gaudi::Property< unsigned short >	m_minADCforIter {this, "minADCforIter", 30}
Gaudi::Property< float >	m_minADCforIterInSigma {this, "minADCforIterInSigma", -1}
Gaudi::Property< unsigned short >	m_minSample {this, "minSample", 0}
Gaudi::Property< unsigned short >	m_maxSample {this, "maxSample",31}
Gaudi::Property< unsigned short >	m_nIterProp {"nIterations", 10}
Gaudi::Property< int >	m_defaultShiftTimeSamples {this, "DefaultShiftTimeSample", 0}
Gaudi::Property< bool >	m_forceHighGain {this, "forceHighGain", false, "Force use of high gain for all shapes and OFC (default=false)"}
SG::WriteHandleKey< LArOFIterResultsContainer >	m_timingContKey {this, "TimingContainerKey", "", "Key of the LArOFIterResultsContainer in StoreGate"}
const LArOnlineID *	m_onlineId = nullptr
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

Definition at line 29 of file LArRawChannelBuilderIterAlg.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

cardinality()

unsigned int AthCommonReentrantAlgorithm< Gaudi::Algorithm >::cardinality ( ) const

overridevirtualinherited

Cardinality (Maximum number of clones that can exist) special value 0 means that algorithm is reentrant.

Override this to return 0 for reentrant algorithms.

Definition at line 75 of file AthCommonReentrantAlgorithm.cxx.

{
  return 0;
}

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

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

override

Definition at line 54 of file LArRawChannelBuilderIterAlg.cxx.

                                                                             {
 
  //Get event inputs from read handles:
  SG::ReadHandle<LArDigitContainer> inputContainer(m_digitKey,ctx);
 
  //Write output via write handle
  SG::WriteHandle<LArRawChannelContainer>outputContainer(m_rawChannelKey,ctx);
  ATH_CHECK(outputContainer.record(std::make_unique<LArRawChannelContainer>()));
        
  //Should we store iter results ?
  LArOFIterResultsContainer* outputTimingContainer{nullptr};
  if(!m_timingContKey.empty()) {
    SG::WriteHandle<LArOFIterResultsContainer> timingContHandle(m_timingContKey,ctx);
    ATH_CHECK(timingContHandle.record(std::make_unique<LArOFIterResultsContainer>()));
    outputTimingContainer = timingContHandle.ptr();
  }
  //Get Conditions input
  SG::ReadCondHandle<ILArPedestal> pedHdl(m_pedestalKey,ctx);
  const ILArPedestal* peds=*pedHdl;
 
  SG::ReadCondHandle<LArADC2MeV> adc2mevHdl(m_adc2MeVKey,ctx);
  const LArADC2MeV* adc2MeVs=*adc2mevHdl;
 
  SG::ReadCondHandle<ILArOFC> ofcHdl(m_ofcKey,ctx);
  const ILArOFC* ofcs=*ofcHdl;
 
  SG::ReadCondHandle<ILArShape> shapeHdl(m_shapeKey,ctx);
  const ILArShape* shapes=*shapeHdl;
 
  SG::ReadCondHandle<LArOnOffIdMapping> cabling(m_cablingKey,ctx);
  
  std::unique_ptr<LArDSPThresholdsFlat> run2DSPThresh;
  const LArDSPThresholdsComplete* run1DSPThresh = nullptr;
  if (m_useDBFortQ) {
    if (!m_run2DSPThresholdsKey.empty()) {
      SG::ReadCondHandle<AthenaAttributeList> dspThrshAttr (m_run2DSPThresholdsKey, ctx);
      run2DSPThresh = std::make_unique<LArDSPThresholdsFlat>(*dspThrshAttr);
      if (ATH_UNLIKELY(!run2DSPThresh->good())) {
        ATH_MSG_ERROR( "Failed to initialize LArDSPThresholdFlat from attribute list loaded from " << m_run2DSPThresholdsKey.key()
                       << ". Aborting." ); 
        return StatusCode::FAILURE;
      }
    }
    else if (!m_run1DSPThresholdsKey.empty()) {
      SG::ReadCondHandle<LArDSPThresholdsComplete> dspThresh (m_run1DSPThresholdsKey, ctx);
      run1DSPThresh = dspThresh.cptr();
    }
    else {
      ATH_MSG_ERROR( "No DSP threshold configured.");
      return StatusCode::FAILURE;
    }
  }
 
  std::vector<float> signal; //Pedestal-subtracted
 
  const float fMAXINT = static_cast<float>(MAXINT);
  const float fMAXINT2 = static_cast<float>(MAXINT2);
 
  //Loop over digits:
  for (const LArDigit* digit : *inputContainer) {
 
    const HWIdentifier id=digit->hardwareID();
    const bool connected=(*cabling)->isOnlineConnected(id);
 
    ATH_MSG_VERBOSE("Working on channel " << m_onlineId->channel_name(id));
 
    const std::vector<short>& samples=digit->samples();
    auto gain=digit->gain();
    const float p=peds->pedestal(id,gain);
 
 
    //The following autos will resolve either into vectors or vector-proxies
    const auto& adc2mev=adc2MeVs->ADC2MEV(id,gain);
    
    if (ATH_UNLIKELY(p==ILArPedestal::ERRORCODE)) {
      if (!connected) continue; //No conditions for disconencted channel, who cares?
      ATH_MSG_ERROR("No valid pedestal for connected channel " << m_onlineId->channel_name(id) 
            << " gain " << gain);
      return StatusCode::FAILURE;
    }
 
    if(ATH_UNLIKELY(adc2mev.size()<2)) {
      if (!connected) continue; //No conditions for disconencted channel, who cares?
      ATH_MSG_ERROR("No valid ADC2MeV for connected channel " << m_onlineId->channel_name(id) 
            << " gain " << gain);
      return StatusCode::FAILURE;
    }
 
    uint16_t prov=0; 
 
    float peakval = -999.;
    unsigned short ipeak = 0;
    float currval = 0.;
    const unsigned int sampsize = (unsigned int) samples.size();
 
    signal.resize(sampsize);
    for (unsigned int ii = 0; ii < sampsize; ++ii) {
       if (samples[ii]==0 || samples[ii]>=m_AdcMax) { //Check for saturation
          ATH_MSG_DEBUG("Saturation on channel 0x" << 
                        MSG::hex << id.get_compact() << MSG::dec << " ADC=" << samples[ii]);
          if ( m_skipSaturatedCells ) {
             ATH_MSG_DEBUG(" Skipping channel...");
             continue;
          }
          prov|=0x0400;
       }
       currval = (float)(samples[ii] - p);
       signal[ii]=currval;      
       if ((ii >= m_minSample)&&(ii <= m_maxSample)&&(currval > peakval)) { 
          ipeak = ii; peakval = currval; 
       }
    }
    ATH_MSG_DEBUG("Peak value: " << peakval << ", peak sample:" << ipeak);
 
    int nIteration = m_nIterProp;
    bool doIter=false;
    if (m_minADCforIterInSigma>0) {//threshold given in terms of pedestal-rms, get pedestal
       float vRMS=peds->pedestalRMS(id,gain);
       if (vRMS >= (1.0+LArElecCalib::ERRORCODE)) { 
       if (peakval > (vRMS*m_minADCforIterInSigma)) doIter=true;//enough signal...
         }
         else { //no pedestal found, use adc threshold
       if (peakval > m_minADCforIter) doIter=true;//enough signal...
         }
    } else {
      if (peakval >= m_minADCforIter) doIter=true;//enough signal...
    }
 
    if (!doIter) {//No iteration, insufficient signal
       nIteration=1;
       ipeak = m_defaultShiftTimeSamples + 2 ; 
    }
 
    if (ipeak > sampsize - 3) ipeak = sampsize - 3 ; 
    if (ipeak < 2) ipeak = 2;
 
    unsigned int peak_min = ipeak - 1 ; 
    unsigned int peak_max = ipeak + 1 ;
 
    float ADCPeak=0;
    float time=0.;
 
    const LArOFIterResults results = peak(signal, id, gain, m_defaultPhase, ofcs, shapes, 
                      nIteration, ipeak,peak_min, peak_max );
    if(outputTimingContainer) {
       outputTimingContainer->push_back(results);
    }
    if (results.getValid()) {
       ADCPeak = results.getAmplitude();
       // this should be ~0 if the peak is at curr_shiftTimeSamples
       // FIXME: this time definition still misses the tstart from the OFC to be absolutely computed
       time = (25.*((int)(results.getPeakSample_final())
              -2-m_defaultShiftTimeSamples)
              -(results.getDelay_final()-results.getTau()));
 
       ATH_MSG_DEBUG("Peak and time properly retrieved with OFPeakRecoTool: ADCPeak = " 
                     << ADCPeak <<", time = "<< time);
    } else {
       ATH_MSG_DEBUG(". OFC iteration not valid for channel 0x"<< MSG::hex << 
                     id.get_compact() << MSG::dec << " Gain = " << gain << 
                     ". Skipping channel.");
       continue;
    }
 
    //Apply Ramp
    float E=adc2mev[0]+ADCPeak*adc2mev[1];
 
    if (E>fMAXINT) E=fMAXINT;
    if (E<fMAXINT2) E=fMAXINT2;
    
    if (results.getConverged()) prov |= 0x0100;
    prov = prov & 0x3FFF;
 
    uint16_t iquaShort=0;
    float tau=0;
 
 
    //uint16_t prov=0xa5; //Means all constants from DB
 
    const float E1=m_absECutFortQ.value() ? std::fabs(E) : E;
    float ecut(0.);
    if (m_useDBFortQ) {
      if (run2DSPThresh) {
        ecut = run2DSPThresh->tQThr(id);
      }
      else if (run1DSPThresh) {
        ecut = run1DSPThresh->tQThr(id);
      }
      else {
        ATH_MSG_ERROR ("DSP threshold problem");
        return StatusCode::FAILURE;
      }
    }
    else {
      ecut = m_eCutFortQ;
    }
 
    if (E1 > ecut) { // fill also time and quality
      ATH_MSG_VERBOSE("Channel " << m_onlineId->channel_name(id) << " gain " << 
                      gain << " above threshold for tQ computation");
      prov|=0x2000; //  fill bit in provenance that time+quality information are available
 
      tau=time*(Gaudi::Units::nanosecond/Gaudi::Units::picosecond); //Convert time to ps
      if (tau>fMAXINT) tau=fMAXINT;
      if (tau<fMAXINT2) tau=fMAXINT2;
 
      //Get Q-factor
 
      int iqua = (int)(results.getQuality());
      if (iqua > 0xFFFF) iqua=0xFFFF;
      iquaShort = static_cast<uint16_t>(iqua & 0xFFFF);
 
    }//end if above cut
 
   
    outputContainer->emplace_back(id,static_cast<int>(std::floor(E+0.5)),
                  static_cast<int>(std::floor(tau+0.5)),
                  iquaShort,prov,(CaloGain::CaloGain)gain);
  }
 
  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 & AthCommonReentrantAlgorithm< 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 94 of file AthCommonReentrantAlgorithm.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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

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

finalize()

StatusCode LArRawChannelBuilderIterAlg::finalize ( )

override

Definition at line 50 of file LArRawChannelBuilderIterAlg.cxx.

                                                 {
  return StatusCode::SUCCESS;
} 

initialize()

StatusCode LArRawChannelBuilderIterAlg::initialize ( )

override

Definition at line 20 of file LArRawChannelBuilderIterAlg.cxx.

                                                   {
  ATH_CHECK(m_digitKey.initialize());     
  ATH_CHECK(m_rawChannelKey.initialize());
  ATH_CHECK(m_pedestalKey.initialize());   
  ATH_CHECK(m_adc2MeVKey.initialize());     
  ATH_CHECK(m_ofcKey.initialize());     
  ATH_CHECK(m_shapeKey.initialize());
  ATH_CHECK(m_cablingKey.initialize() );
  ATH_CHECK(m_run1DSPThresholdsKey.initialize(SG::AllowEmpty) );
  ATH_CHECK(m_run2DSPThresholdsKey.initialize(SG::AllowEmpty) );
  if (m_useDBFortQ) {
    if (m_run1DSPThresholdsKey.empty() && m_run2DSPThresholdsKey.empty()) {
      ATH_MSG_ERROR ("useDB requested but neither Run1DSPThresholdsKey nor Run2DSPThresholdsKey initialized.");
      return StatusCode::FAILURE;
    }
  }
 
  ATH_CHECK(detStore()->retrieve(m_onlineId,"LArOnlineID"));
 
  const std::string cutmsg = m_absECutFortQ.value() ? " fabs(E) < " : " E < "; 
  ATH_MSG_INFO("Energy cut for time and quality computation: " << cutmsg << 
               " taken from COOL folder "<<
               m_run1DSPThresholdsKey.key() << " (run1) " <<
               m_run2DSPThresholdsKey.key() << " (run2) ");
 
  ATH_CHECK(m_timingContKey.initialize(SG::AllowEmpty));
 
  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()

bool AthCommonReentrantAlgorithm< Gaudi::Algorithm >::isClonable ( ) const

overridevirtualinherited

Specify if the algorithm is clonable.

Reentrant algorithms are clonable.

Reimplemented in InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ITkPixelCablingAlg, ITkStripCablingAlg, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, 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, and Simulation::BeamEffectsAlg.

Definition at line 68 of file AthCommonReentrantAlgorithm.cxx.

{
  // Reentrant algorithms are clonable.
  return true;
}

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.

peak()

LArOFIterResults LArRawChannelBuilderIterAlg::peak ( const std::vector< float > & samples, const HWIdentifier chID, const CaloGain::CaloGain gain, const float delayIn, const ILArOFC * ofcs, const ILArShape * shapes, const unsigned nIter = 0, const unsigned npeak = 2, unsigned peak_low = 2, unsigned peak_high = 2 ) const

private

Definition at line 277 of file LArRawChannelBuilderIterAlg.cxx.

{
  const float epsilon=0.001;
  const double samplingPeriod=1./(40.08*Gaudi::Units::megahertz);
  LArOFIterResults result;
 
  //Fill m_result with default/input values, 
  //calculation will be done with this object
  result.m_valid=false;
  result.m_converged=false;
  result.m_amplitude= 0;
  result.m_tau     =  0;
  result.m_quality =  0;
  result.m_delay_final      = delayIn;
  result.m_peakSample_init  =  npeak; 
  result.m_peakSample_final =  npeak; //Assumed index of highest sample (may change in the process)
  result.m_chid = chID;
 
  //Set some reference to improve readablity of the code:
  unsigned& kMax =  result.m_peakSample_final; //Make reference just to have code more readable 
  float& delay = result.m_delay_final;
  float& q=result.m_quality;
  unsigned& delayIdx=result.m_ofcIndex;
  //Quantities used during iteration
  unsigned kIter=0;
  //Computation is done as double
  double At=0;
  double A=0;
 
  //Tying to avoid doing all checks for every event/channel/iteation step by assuming that
  //the number of OFC samples is the same for all delays of a certain cell/gain. 
  //Code will segfault if not the case. 
 
  const unsigned nSamples=samples.size();
  // force uses of high gain if required for OFC and shape
  CaloGain::CaloGain usedGain = gain;
  if (m_forceHighGain) {
      if (m_onlineId->isHECchannel(chID)) usedGain = CaloGain::LARMEDIUMGAIN;
      else                                 usedGain = CaloGain::LARHIGHGAIN;
  }
 
  // Quantities depending on this cell
  const unsigned nOFCPhase=ofcs->nTimeBins(chID,usedGain);
  float timeOffset = ofcs->timeOffset(chID,usedGain);
 
  // convert delay to internal OFC delay (from 0 to Nphases*timeBinWidth)
  delay = delay-timeOffset;
 
  float timeBinWidth;
  float timeMax;
  if (nOFCPhase<2) { //Only one time bin
    delayIdx=0;
    timeBinWidth=25.; //ns
    timeMax=(nOFCPhase-1)*timeBinWidth;
  } else { //Have more than one OFC bin
    timeBinWidth=ofcs->timeBinWidth(chID,usedGain);
    timeMax =  (nOFCPhase-1)*timeBinWidth;
    if (timeBinWidth==0.) {
      ATH_MSG_ERROR( "timeBinWidth is zero for channel " << m_onlineId->channel_name(chID)  );
      return result;
    }
    //Check if initial delay isn't too big
    if (delay>timeMax) delay=timeMax-epsilon;
    if (delay<0.) delay=0.;
    //Index of the in in the vector according to the delay
    delayIdx=(unsigned)floor(0.5+delay/timeBinWidth);
  }
 
  //Get first set of OFC's
  ILArOFC::OFCRef_t this_OFC_a = ofcs->OFC_a(chID,(int)usedGain,delayIdx);
  ILArOFC::OFCRef_t this_OFC_b = ofcs->OFC_b(chID,(int)usedGain,delayIdx);
  const unsigned ofcSize=this_OFC_a.size(); //Assumed to be the same of all delay-indices
 
  //some sanity check on the OFCs
  if ( ofcSize == 0 || this_OFC_b.size() == 0 ) {
    ATH_MSG_DEBUG("OFC not found for channel " << m_onlineId->channel_name(chID));
    return result;
  }
 
  if ( this_OFC_a.size() != this_OFC_b.size() ) {
    ATH_MSG_ERROR( "OFC a (" << this_OFC_a.size() << 
                   ")and b (" << this_OFC_b.size() << ") are not the same size for channel 0x" 
                   << std::hex << chID.get_compact() << std::dec  );
    return result;
  }
 
  //Coerce kmax, peak_high and peak_low to someting that can work
  if (peak_low<2) peak_low=2; //By convention we expect at least 2 samples before the peak
  if (peak_high>(nSamples+2-ofcSize)) peak_high=(nSamples+2-ofcSize);
  if (peak_high<peak_low) {
    ATH_MSG_WARNING( "Channel 0x"  << std::hex << chID.get_compact() << std::dec 
                     << "Not enough ADC samples (" << nSamples << ") to apply " << ofcSize << " OFCs."  );
    return result;
  }
  if(kMax<peak_low)  kMax=peak_low; 
  if(kMax>peak_high) kMax=peak_high; 
 
  float amplitude_save=0.;
  float tau_save= 99999.;
  unsigned int kMax_save=0;
  float delay_save=0.;
  unsigned int delayIdx_save=0;
 
  unsigned int mynIter = nIter;
 
  do {
    
    // Uncomment the following if you suspect that the ofc are corrupt for some phases:
    /*  
    if ( this_OFC_a.size() == 0 || this_OFC_b.size() == 0 ) {
      ATH_MSG_DEBUG( "OFC not found for channel 0x"  << std::hex << chID.get_compact() << std::dec  );
      std::cout << "OFC not found for channel 0x"  << std::hex << chID.get_compact() << std::dec << std::endl;
      return result;
    }
 
    if ( this_OFC_a.size() != this_OFC_b.size() ) {
      ATH_MSG_ERROR( "OFC a (" << this_OFC_a.size() << 
    ")and b (" << this_OFC_b.size() << ") are not the same size for channel 0x" 
      << std::hex << chID.get_compact() << std::dec  );
      return result;
    }
    */
    
        
    //Apply Optimal Filtering coefficients
    A = At = 0 ;
    for ( unsigned k=0 ; (k<ofcSize); k++ ) {
      //for ( unsigned k=0 ; (k<ofcSize) && (kMax-2+k<nSamples); k++ ) {
      const float& this_sample = samples[kMax-2+k];
      A  += this_OFC_a.at(k) * this_sample ;
      At += this_OFC_b.at(k) * this_sample ;
    }
    //Validate the result
    result.m_valid = true; //Doesn't mean that the result is really good, but we have something
    if ( A == 0 ) {
      ATH_MSG_DEBUG("Null amplitude: " << A << "  for channel" << m_onlineId->channel_name(chID));
      result.m_amplitude=0;
      result.m_tau=0;
      return result;
    }
    result.m_amplitude=A; 
    result.m_tau = At / A ;
 
    //First iteration done, break loop if possible.... 
    if (mynIter<=1) {
        delay = delayIdx*timeBinWidth;
        break; //No iteration requested
    }
 
    // Nsamples=OFCsize and only one phase available, no point to iterate
    if (samples.size() == ofcSize && nOFCPhase<2) {
        delay = delayIdx*timeBinWidth;
        break;
    }
 
    // if we are within +-0.5*Dt of time bin, we have converged for sure
    if (std::fabs(result.m_tau) <= (0.5*timeBinWidth)) { 
      result.m_converged=true;
      delay = delayIdx*timeBinWidth;
      break;
    }
 
    if (kIter>=mynIter) { //Max. number of iterations reached
      delay = delayIdx*timeBinWidth;
      if (result.m_converged) {
        if (std::fabs(tau_save) < std::fabs(result.m_tau)) {
            result.m_amplitude = amplitude_save;
            result.m_tau       = tau_save;
            kMax                 = kMax_save;
            delay                = delay_save;
            delayIdx             = delayIdx_save;
        }
      }
      if (std::fabs(result.m_tau) <= timeBinWidth) result.m_converged=true;
      break;
    }
 
    // if we are within +-Dt of time bin, we consider that we have converged but we allow for one more
    // iteration to see if we can find a smaller tau, if not we keep the previous one
    if (std::fabs(result.m_tau) <= timeBinWidth) {
       result.m_converged = true;
       mynIter = kIter+1;    // allow only for more iteration
       amplitude_save = result.m_amplitude;
       tau_save       = result.m_tau;
       kMax_save      = kMax;
       delay_save     =  delayIdx*timeBinWidth;
       delayIdx_save  = delayIdx;
    }
 
    delay = delay - result.m_tau;  // moved this line up so first iteration delay results treated like subsequent
 
    if(delay<(-0.5*timeBinWidth)) { 
      if(kMax<peak_high){ 
    kMax = kMax+1 ; 
    delay=delay+samplingPeriod;
    if( delay < 0 ) delay = 0;
        if (delay > timeMax ) delay = timeMax-epsilon;
      } else { // don't shift sample
    delay = 0 ; 
      } 
    }//else if delay<0
    else
      if( delay>(timeMax+0.5*timeBinWidth) ) {
    if(kMax>peak_low){
      kMax = kMax-1 ; 
      delay=delay-samplingPeriod;
          if (delay < 0 ) delay=0.;
      if( delay > timeMax ) delay = timeMax-epsilon;
    } else { 
      // don't shift sample
      delay = timeMax-epsilon;
    }   
      }//end if delay>nOFCPhase
    //Prepare next iteration step:
    kIter++;
    delayIdx=(unsigned)floor(0.5+delay/timeBinWidth);
    if (delayIdx>=nOFCPhase) delayIdx = nOFCPhase-1;
    //Get next set of OFC's
    this_OFC_a = ofcs->OFC_a(chID,(int)usedGain,delayIdx);
    this_OFC_b = ofcs->OFC_b(chID,(int)usedGain,delayIdx);
  }
  while(1);  // end for iteration loop 
 
  // go back to overal time
  delay = delay + timeOffset;  // sign to check
 
  q = 0.; 
  ILArShape::ShapeRef_t thisShape    = shapes->Shape(chID,(int)usedGain,delayIdx) ;
  ILArShape::ShapeRef_t thisShapeDer;
  if (m_useShapeDer) thisShapeDer = shapes->ShapeDer(chID,(int)usedGain,delayIdx) ;
  if( thisShape.size() >= ofcSize ) {
    for ( unsigned k=0 ; k<ofcSize ; k++ ) {
      const float& this_sample = samples[kMax-2+k];
       if (m_useShapeDer && thisShapeDer.size() >= ofcSize) 
          q += std::pow((result.m_amplitude*(thisShape[k]-result.m_tau*thisShapeDer[k]) - this_sample),2); 
      else
          q += std::pow((result.m_amplitude*thisShape[k] - this_sample),2);
    }
  }
  else {
    ATH_MSG_DEBUG("No shape for this channel");
  } 
 
  result.m_nIterPerf = kIter;
  result.m_valid    =    true;
   return result;
 
}

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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state, const EventContext & ctx ) const

inlinevirtualinherited

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

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

sysExecute()

StatusCode AthCommonReentrantAlgorithm< 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.

Definition at line 85 of file AthCommonReentrantAlgorithm.cxx.

{
  return BaseAlg::sysExecute (ctx);
}

sysInitialize()

StatusCode AthCommonReentrantAlgorithm< 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 HypoBase, and InputMakerBase.

Definition at line 61 of file AthCommonReentrantAlgorithm.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_absECutFortQ

Gaudi::Property<bool> LArRawChannelBuilderIterAlg::m_absECutFortQ {this,"absECut",true,"Cut on fabs(E) for Q and t computation"}

private

Definition at line 62 of file LArRawChannelBuilderIterAlg.h.

{this,"absECut",true,"Cut on fabs(E) for Q and t computation"};

m_adc2MeVKey

SG::ReadCondHandleKey<LArADC2MeV> LArRawChannelBuilderIterAlg::m_adc2MeVKey {this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"}

private

Definition at line 49 of file LArRawChannelBuilderIterAlg.h.

{this,"ADC2MeVKey","LArADC2MeV","SG Key of ADC2MeV conditions object"};

m_AdcMax

Gaudi::Property<unsigned short> LArRawChannelBuilderIterAlg::m_AdcMax {this, "ADCMax", 4095, "Saturation cut"}

private

Definition at line 71 of file LArRawChannelBuilderIterAlg.h.

{this, "ADCMax", 4095, "Saturation cut"};

m_cablingKey

SG::ReadCondHandleKey<LArOnOffIdMapping> LArRawChannelBuilderIterAlg::m_cablingKey {this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"}

private

Definition at line 54 of file LArRawChannelBuilderIterAlg.h.

{this,"CablingKey","LArOnOffIdMap","SG Key of LArOnOffIdMapping object"};

m_defaultPhase

Gaudi::Property<float> LArRawChannelBuilderIterAlg::m_defaultPhase {this, "defaultPhase", 0, "starting phase for iterations"}

private

Definition at line 73 of file LArRawChannelBuilderIterAlg.h.

{this, "defaultPhase", 0, "starting phase for iterations"};

m_defaultShiftTimeSamples

Gaudi::Property<int> LArRawChannelBuilderIterAlg::m_defaultShiftTimeSamples {this, "DefaultShiftTimeSample", 0}

private

Definition at line 79 of file LArRawChannelBuilderIterAlg.h.

{this, "DefaultShiftTimeSample", 0};

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_digitKey

SG::ReadHandleKey<LArDigitContainer> LArRawChannelBuilderIterAlg::m_digitKey

private

Initial value:

{this, "LArDigitKey","FREE",
      "SG Key of LArDigitContaiiner"}

Definition at line 41 of file LArRawChannelBuilderIterAlg.h.

                                               {this, "LArDigitKey","FREE",
      "SG Key of LArDigitContaiiner"};

m_eCutFortQ

Gaudi::Property<float> LArRawChannelBuilderIterAlg::m_eCutFortQ {this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"}

private

Definition at line 60 of file LArRawChannelBuilderIterAlg.h.

{this,"ECutFortQ",256.0,"Time and Quality will be computed only for channels with E above this value"};

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 AthCommonReentrantAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects

privateinherited

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

Empty if no symlinks were found.

Definition at line 114 of file AthCommonReentrantAlgorithm.h.

m_firstSample

Gaudi::Property<int> LArRawChannelBuilderIterAlg::m_firstSample {this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"}

private

Definition at line 68 of file LArRawChannelBuilderIterAlg.h.

{this,"firstSample",0,"first of the 32 sampels of the MC shape to be used"};

m_forceHighGain

Gaudi::Property<bool> LArRawChannelBuilderIterAlg::m_forceHighGain {this, "forceHighGain", false, "Force use of high gain for all shapes and OFC (default=false)"}

private

Definition at line 80 of file LArRawChannelBuilderIterAlg.h.

{this, "forceHighGain", false, "Force use of high gain for all shapes and OFC (default=false)"};

m_maxSample

Gaudi::Property<unsigned short> LArRawChannelBuilderIterAlg::m_maxSample {this, "maxSample",31}

private

Definition at line 77 of file LArRawChannelBuilderIterAlg.h.

{this, "maxSample",31};

m_minADCforIter

Gaudi::Property<unsigned short> LArRawChannelBuilderIterAlg::m_minADCforIter {this, "minADCforIter", 30}

private

Definition at line 74 of file LArRawChannelBuilderIterAlg.h.

{this, "minADCforIter", 30}; 

m_minADCforIterInSigma

Gaudi::Property<float> LArRawChannelBuilderIterAlg::m_minADCforIterInSigma {this, "minADCforIterInSigma", -1}

private

Definition at line 75 of file LArRawChannelBuilderIterAlg.h.

{this, "minADCforIterInSigma", -1};

m_minSample

Gaudi::Property<unsigned short> LArRawChannelBuilderIterAlg::m_minSample {this, "minSample", 0}

private

Definition at line 76 of file LArRawChannelBuilderIterAlg.h.

{this, "minSample", 0};

m_nIterProp

Gaudi::Property<unsigned short> LArRawChannelBuilderIterAlg::m_nIterProp {"nIterations", 10}

private

Definition at line 78 of file LArRawChannelBuilderIterAlg.h.

{"nIterations", 10};

m_ofcKey

SG::ReadCondHandleKey<ILArOFC> LArRawChannelBuilderIterAlg::m_ofcKey {this,"OFCKey","LArOFC","SG Key of OFC conditions object"}

private

Definition at line 50 of file LArRawChannelBuilderIterAlg.h.

{this,"OFCKey","LArOFC","SG Key of OFC conditions object"};

m_onlineId

const LArOnlineID* LArRawChannelBuilderIterAlg::m_onlineId = nullptr

private

Definition at line 85 of file LArRawChannelBuilderIterAlg.h.

m_pedestalKey

SG::ReadCondHandleKey<ILArPedestal> LArRawChannelBuilderIterAlg::m_pedestalKey {this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"}

private

Definition at line 48 of file LArRawChannelBuilderIterAlg.h.

{this,"PedestalKey","LArPedestal","SG Key of Pedestal conditions object"};

m_rawChannelKey

SG::WriteHandleKey<LArRawChannelContainer> LArRawChannelBuilderIterAlg::m_rawChannelKey

private

Initial value:

{this,"LArRawChannelKey","LArRawChannels",
      "SG key of the LArRawChannelContainer"}

Definition at line 44 of file LArRawChannelBuilderIterAlg.h.

                                                          {this,"LArRawChannelKey","LArRawChannels",
      "SG key of the LArRawChannelContainer"};

m_run1DSPThresholdsKey

SG::ReadCondHandleKey<LArDSPThresholdsComplete> LArRawChannelBuilderIterAlg::m_run1DSPThresholdsKey {this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"}

private

Definition at line 55 of file LArRawChannelBuilderIterAlg.h.

{this, "Run1DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 1"};

m_run2DSPThresholdsKey

SG::ReadCondHandleKey<AthenaAttributeList> LArRawChannelBuilderIterAlg::m_run2DSPThresholdsKey {this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"}

private

Definition at line 56 of file LArRawChannelBuilderIterAlg.h.

{this, "Run2DSPThresholdsKey","", "SG Key for thresholds to compute time and quality, run 2"};

m_shapeKey

SG::ReadCondHandleKey<ILArShape> LArRawChannelBuilderIterAlg::m_shapeKey {this,"ShapeKey","LArShape","SG Key of Shape conditions object"}

private

Definition at line 51 of file LArRawChannelBuilderIterAlg.h.

{this,"ShapeKey","LArShape","SG Key of Shape conditions object"};

m_skipSaturatedCells

Gaudi::Property<bool> LArRawChannelBuilderIterAlg::m_skipSaturatedCells {this, "Skip", false, "reconstruct saturated cells"}

private

Definition at line 72 of file LArRawChannelBuilderIterAlg.h.

{this, "Skip", false, "reconstruct saturated cells"};

m_timingContKey

SG::WriteHandleKey<LArOFIterResultsContainer> LArRawChannelBuilderIterAlg::m_timingContKey {this, "TimingContainerKey", "", "Key of the LArOFIterResultsContainer in StoreGate"}

private

Definition at line 82 of file LArRawChannelBuilderIterAlg.h.

{this, "TimingContainerKey", "", "Key of the LArOFIterResultsContainer in StoreGate"};

m_useDBFortQ

Gaudi::Property<bool> LArRawChannelBuilderIterAlg::m_useDBFortQ {this,"useDB",true,"Use DB for cut on t,Q"}

private

Definition at line 65 of file LArRawChannelBuilderIterAlg.h.

{this,"useDB",true,"Use DB for cut on t,Q"};

m_useShapeDer

Gaudi::Property<bool> LArRawChannelBuilderIterAlg::m_useShapeDer {this,"useShapeDer",true,"Use shape derivative in Q-factor computation"}

private

Definition at line 63 of file LArRawChannelBuilderIterAlg.h.

{this,"useShapeDer",true,"Use shape derivative in Q-factor computation"};

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:

• LArRawChannelBuilderIterAlg.h
• LArRawChannelBuilderIterAlg.cxx