#include <TileRawCorrelatedNoise.h>

Inheritance diagram for TileRawCorrelatedNoise:

Collaboration diagram for TileRawCorrelatedNoise:

Classes
struct	AlphaMatrix

Public Member Functions
	TileRawCorrelatedNoise (const std::string &name, ISvcLocator *pSvcLocator)
virtual	~TileRawCorrelatedNoise ()
virtual StatusCode	initialize ()
virtual StatusCode	execute ()
virtual StatusCode	finalize ()
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
SG::ReadHandleKey< TileDigitsContainer >	m_inputDigitsContainerKey
SG::WriteHandleKey< TileDigitsContainer >	m_outputDigitsContainerKey
float	m_nRMS_threshold
std::string	m_alphaMatrixFilePrefix
std::string	m_sample3RMSFilePrefix
std::string	m_meanFilePrefix
std::unique_ptr< AlphaMatrix >	m_alphaMatrix
float	m_meanSamples [4][64][48][7] {}
float	m_sample3RMS [4][64][48] {}
bool	m_useMeanFiles
bool	m_pmtOrder
ToolHandle< TileCondToolNoiseSample >	m_tileToolNoiseSample
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

Definition at line 32 of file TileRawCorrelatedNoise.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

◆ TileRawCorrelatedNoise()

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

Definition at line 23 of file TileRawCorrelatedNoise.cxx.

  : AthAlgorithm(name, pSvcLocator)
{
// #############################################################################
 
  declareProperty("nRMSThreshold", m_nRMS_threshold = 2.);
  declareProperty("AlphaMatrixFilePrefix", m_alphaMatrixFilePrefix  = "AlphaMatrix");
  declareProperty("MeanFilePrefix", m_meanFilePrefix  = "Mean");
  declareProperty("Sample3RMSFilePrefix", m_sample3RMSFilePrefix  = "RMS");
  declareProperty("UseMeanFiles", m_useMeanFiles = true);
  declareProperty("PMTOrder", m_pmtOrder = false);
}

◆ ~TileRawCorrelatedNoise()

TileRawCorrelatedNoise::~TileRawCorrelatedNoise ( )

virtual

Definition at line 37 of file TileRawCorrelatedNoise.cxx.

                                                {
// #############################################################################
 
}

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

StatusCode TileRawCorrelatedNoise::execute ( )

virtual

Definition at line 294 of file TileRawCorrelatedNoise.cxx.

                                           {
// #############################################################################
 
  const EventContext &ctx = Gaudi::Hive::currentContext();
 
  // get named TileDigitsContaner from TES
  SG::ReadHandle<TileDigitsContainer> inputDigitsContainer(m_inputDigitsContainerKey, ctx);
 
  ATH_MSG_DEBUG( "Got TileDigitsContainer '" << m_inputDigitsContainerKey.key() << "'" );
 
  const TileHWID* tileHWID;
  CHECK( detStore()->retrieve(tileHWID, "TileHWID") );
  //coverity[STACK_USE]
  const TileDigits* OriginalDigits[4][64][48];
 
  // go through ALL TileDigits in container
  SelectAllObject<TileDigitsContainer> selAll(inputDigitsContainer.cptr());
  SelectAllObject<TileDigitsContainer>::const_iterator digItr = selAll.begin();
  SelectAllObject<TileDigitsContainer>::const_iterator lastDig = selAll.end();
 
  // read digits
  for (; digItr != lastDig; ++digItr) {
    const HWIdentifier adc_HWID = (*digItr)->adc_HWID();
    int Ros = tileHWID->ros(adc_HWID);
    int Drawer = tileHWID->drawer(adc_HWID);
    int Channel = tileHWID->channel(adc_HWID);
    OriginalDigits[Ros - 1][Drawer][Channel] = (*digItr);
 
    if (!m_useMeanFiles) {
      // read pedestal value and use it as mean
      unsigned int drawerIdx = TileCalibUtils::getDrawerIdx(Ros, Drawer);
      int adc = tileHWID->adc(adc_HWID);
      double ped = m_tileToolNoiseSample->getPed(drawerIdx, Channel, adc, TileRawChannelUnit::ADCcounts, ctx);
      int nSamples = 7;
      for (int Sample = 0; Sample < nSamples; ++Sample) {
        m_meanSamples[Ros - 1][Drawer][Channel][Sample] = ped;
      }
    }
  }
 
  // prepare new samples
  const int nSamples = 7;
  struct Arrays {
    float NewSamples[4][64][48][nSamples];
  };
  auto a = std::make_unique<Arrays>();
  for (int Ros = 1; Ros < 5; ++Ros) {
    for (int Drawer = 0; Drawer < 64; ++Drawer) {
      for (int Channel = 0; Channel < 48; ++Channel) {
        for (int Sample = 0; Sample < nSamples; ++Sample) {
          a->NewSamples[Ros - 1][Drawer][Channel][Sample] =
              ((OriginalDigits[Ros - 1][Drawer][Channel])->samples())[Sample];
        }
      }
    }
  }
 
  // apply method
  for (int Ros = 1; Ros < 5; ++Ros) {
    for (int Drawer = 0; Drawer < 64; ++Drawer) {
      for (int Channel = 0; Channel < 48; ++Channel) {
        if (OriginalDigits[Ros - 1][Drawer][Channel]) {
          int nSamples = (OriginalDigits[Ros - 1][Drawer][Channel])->nsamples();
          std::vector<float> digits(nSamples);
          for (int jCh = 0; jCh < 48; ++jCh) {
            if (OriginalDigits[Ros - 1][Drawer][jCh]) {
              if (Channel != jCh
                  && fabs(((OriginalDigits[Ros - 1][Drawer][jCh])->samples())[3]
                          - m_meanSamples[Ros - 1][Drawer][jCh][3])
                      < m_nRMS_threshold * m_sample3RMS[Ros - 1][Drawer][jCh]) {
 
                for (int Sample = 0; Sample < nSamples; ++Sample)
                  a->NewSamples[Ros - 1][Drawer][Channel][Sample] =
                      a->NewSamples[Ros - 1][Drawer][Channel][Sample]
                           - m_alphaMatrix->m[Ros - 1][Drawer][Channel][jCh]
                              * (((OriginalDigits[Ros - 1][Drawer][jCh])->samples())[Sample]
                                  - m_meanSamples[Ros - 1][Drawer][jCh][Sample]);
              }
            }
          }
        }
      }
    }
  }
 
  // create new container
 
  auto outputDigitsContainer = std::make_unique<TileMutableDigitsContainer>();
  ATH_CHECK( outputDigitsContainer->status() );
 
  // fill new container
  for (int Ros = 1; Ros < 5; ++Ros) {
    for (int Drawer = 0; Drawer < 64; ++Drawer) {
      for (int Channel = 0; Channel < 48; ++Channel) {
        if (OriginalDigits[Ros - 1][Drawer][Channel]) {
          int nSamples = (OriginalDigits[Ros - 1][Drawer][Channel])->nsamples();
          std::vector<float> digits(nSamples);
          for (int Sample = 0; Sample < nSamples; ++Sample) {
            digits[Sample] = a->NewSamples[Ros - 1][Drawer][Channel][Sample];
          }
          TileDigits* NewDigits = new TileDigits(
              (OriginalDigits[Ros - 1][Drawer][Channel])->adc_HWID(), digits);
          ATH_CHECK( outputDigitsContainer->push_back(NewDigits) );
        }
      }
    }
  }
 
  SG::WriteHandle<TileDigitsContainer> outputDigitsCnt(m_outputDigitsContainerKey, ctx);
  ATH_CHECK( outputDigitsCnt.record(std::move(outputDigitsContainer)) );
 
 
  ATH_MSG_DEBUG( "execute completed successfully" );
 
  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()

StatusCode TileRawCorrelatedNoise::finalize ( )

virtual

Definition at line 412 of file TileRawCorrelatedNoise.cxx.

                                            {
// #############################################################################
 
  ATH_MSG_INFO( " finalize completed successfully" );
 
  return StatusCode::SUCCESS;
}

◆ initialize()

StatusCode TileRawCorrelatedNoise::initialize ( )

virtual

Definition at line 43 of file TileRawCorrelatedNoise.cxx.

                                              {
// #############################################################################
 
  static constexpr int PmtToChannelBarrel[48] = {
   1,  2,  3,  4,  5,  6,  7,  8,
   9, 10, 11, 12, 13, 14, 15, 16,
  17, 18, 19, 20, 21, 22, 23, 24,
  27, 26, 25, 30, 29, 28, 33, 32,
  31, 36, 35, 34, 39, 38, 37, 42,
  41, 40, 45, 44, 43, 48, 47, 46 };
 
  static constexpr int PmtToChannelExtendedBarrel[48] = {
   1,  2,  3,  4,  5,  6,  7,  8,
   9, 10, 11, 12, 13, 14, 15, 16,
  17, 18, 19, 20, 21, 22, 23, 24,
  27, 26, 25, 31, 32, 28, 33, 29,
  30, 36, 35, 34, 44, 38, 37, 43,
  42, 41, 45, 39, 40, 48, 47, 46 };
 
  m_alphaMatrix = std::make_unique<AlphaMatrix>();
 
  // read alpha matrix
  FILE* AlphaMatrixFile[4][64]{};
  char Rosstr[10];
  char buff[1000];
  // Cycle over 4 partitions and 64 modules
  for (int Ros = 1; Ros < 5; ++Ros) {
    for (int Drawer = 0; Drawer < 64; ++Drawer) {
      // open file which corresponds to AlphaMatrix[Ros][Drawer]
      if (Ros == 1) sprintf(Rosstr, "LBA");
      else if (Ros == 2) sprintf(Rosstr, "LBC");
      else if (Ros == 3) sprintf(Rosstr, "EBA");
      else sprintf(Rosstr, "EBC");
 
      sprintf(buff, "%s%s%02d.txt", m_alphaMatrixFilePrefix.c_str(), Rosstr, Drawer + 1);
      std::string filestr(buff);
      std::string file = PathResolver::find_file(buff, "DATAPATH");
//      ATH_MSG_INFO( "  buff=" << buff
//                   << " filestr=" << filestr.c_str()
//                   << " file=" << file.c_str() );
      if (file.size() == 0) {
        ATH_MSG_WARNING( "Could not find input file " << buff );
      } else {
        ATH_MSG_INFO( "Reading file  " << file );
        AlphaMatrixFile[Ros - 1][Drawer] = fopen(file.c_str(), "r");
      }
      if (AlphaMatrixFile[Ros - 1][Drawer] == NULL) {
        ATH_MSG_ERROR( "Can't read input Alpha Matrix files." );
        return StatusCode::FAILURE;
      }
      ATH_MSG_DEBUG( " **** Start of Alpha Matrix Read Out" );
      FILE* alpha_file = AlphaMatrixFile[Ros - 1][Drawer];
//      if(fgets(buff, sizeof(buff), alpha_file) != NULL) {
//        ATH_MSG_DEBUG( "Matrix is being loaded: " << buff );
//      }
      // load tokens to be searched for in a string
      const char* TOKENS = { " \t\n" };
      // read Matrix
      int dima = 48;
      char* saveptr = nullptr;
      for (int line = 0; line < dima; line++) {
        if (fgets(buff, sizeof(buff), alpha_file) != NULL) {
          ATH_MSG_DEBUG( "line " << line << " is " << buff );
          for (int column = 0; column < dima; column++) {
            // Check for comment lines
            if (*buff == '!' || *buff == '*') continue;
            // read value
            double pippo = 0;
            if (const char* word = strtok_r(column==0 ? buff : nullptr, TOKENS, &saveptr))
            {
              pippo = atof(word);
            }
 
            ATH_MSG_VERBOSE ( "elem " << column << " is " << pippo );
            int chline = line;
            int chcolumn = column;
            // read alpha matrix in pmt order but save it in channel order if m_pmtOrder is true
            if (m_pmtOrder) {
              if (Ros < 3) {
                chline = PmtToChannelBarrel[line] - 1;
                chcolumn = PmtToChannelBarrel[column] - 1;
              } else {
                chline = PmtToChannelExtendedBarrel[line] - 1;
                chcolumn = PmtToChannelExtendedBarrel[column] - 1;
              }
            }
            m_alphaMatrix->m[Ros - 1][Drawer][chline][chcolumn] = pippo;
          }
        }
      }
      fclose(alpha_file);
    }
  }
 
  if (m_useMeanFiles) {
    // read mean
    int nSamples = 7;
    FILE* MeanFile[4][64];
    // cicle over 4 partitions and 64 modules
    for (int Ros = 1; Ros < 5; ++Ros) {
      for (int Drawer = 0; Drawer < 64; ++Drawer) {
        // open file which corresponds to Mean[Ros][Drawer]
        if (Ros == 1)
          sprintf(Rosstr, "LBA");
        else if (Ros == 2)
          sprintf(Rosstr, "LBC");
        else if (Ros == 3)
          sprintf(Rosstr, "EBA");
        else
          sprintf(Rosstr, "EBC");
        sprintf(buff, "%s%s%02d.txt", m_meanFilePrefix.c_str(), Rosstr, Drawer + 1);
        std::string filestr(buff);
        std::string file = PathResolver::find_file(buff, "DATAPATH");
        if (file.size() == 0) {
          ATH_MSG_VERBOSE ( "Could not find input file " << buff );
        } else {
          ATH_MSG_INFO( "Reading file  " << file );
          MeanFile[Ros - 1][Drawer] = fopen(file.c_str(), "r");
        }
        if (MeanFile[Ros - 1][Drawer] == NULL) {
          ATH_MSG_ERROR( "Can't read input Mean files." );
          return StatusCode::FAILURE;
        }
 
        ATH_MSG_DEBUG( " **** Start of Means Read Out" );
        FILE* mean_file = MeanFile[Ros - 1][Drawer];
        //if(fgets(buff, sizeof(buff), mean_file) != NULL) {
        //  if (lDebug)
        //    log << MSG::DEBUG << "Vector is being loaded: "<< buff << endmsg;
        //}
        // load tokens to be searched for in a string
        const char* TOKENS = { " \t\n" };
        // read Vector
        int dima = 48;
        char* saveptr = nullptr;
        for (int line = 0; line < dima; line++) {
          if (fgets(buff, sizeof(buff), mean_file) != NULL) {
            ATH_MSG_DEBUG( "line " << line << " is " << buff );
            for (int Sample = 0; Sample < nSamples; Sample++) {
              // Check for comment lines
              if (*buff == '!' || *buff == '*') continue;
              // read value
              double pippo = 0;
              if (const char* word = strtok_r(Sample==0 ? buff : nullptr, TOKENS, &saveptr))
              {
                pippo = atof(word);
              }
 
              ATH_MSG_VERBOSE ( "elem " << Sample << " is " << pippo );
              int chline = line;
              // read lines of mean matrix in pmt order but save it in channel order if m_pmtOrder is true
              if (m_pmtOrder) {
                if (Ros < 3) chline = PmtToChannelBarrel[line] - 1;
                else chline = PmtToChannelExtendedBarrel[line] - 1;
              }
              m_meanSamples[Ros - 1][Drawer][chline][Sample] = pippo;
            }
          }
        }
        fclose(mean_file);
      }
    }
  } else {
    // Initialize mean
    int nSamples = 7;
    for (int Ros = 1; Ros < 5; ++Ros) {
      for (int Drawer = 0; Drawer < 64; ++Drawer) {
        for (int Channel = 0; Channel < 48; ++Channel) {
          for (int Sample = 0; Sample < nSamples; ++Sample) {
            //MeanSamples[Ros-1][Drawer][Channel][Sample]=50.;
            m_meanSamples[Ros - 1][Drawer][Channel][Sample] = -1.;
          }
        }
      }
    }
  }
 
  // read sample 3 RMS
  FILE* Sample3RMSFile[4][64];
  // cicle over 4 partitions and 64 modules
  for (int Ros = 1; Ros < 5; ++Ros) {
    for (int Drawer = 0; Drawer < 64; ++Drawer) {
      // open file which corresponds to Sample3RMS[Ros][Drawer]
      if (Ros == 1) sprintf(Rosstr, "LBA");
      else if (Ros == 2) sprintf(Rosstr, "LBC");
      else if (Ros == 3) sprintf(Rosstr, "EBA");
      else sprintf(Rosstr, "EBC");
 
      sprintf(buff, "%s%s%02d.txt", m_sample3RMSFilePrefix.c_str(), Rosstr, Drawer + 1);
      std::string filestr(buff);
      std::string file = PathResolver::find_file(buff, "DATAPATH");
      if (file.size() == 0) {
        ATH_MSG_VERBOSE ( "Could not find input file " << buff );
      } else {
        ATH_MSG_INFO( "Reading file  " << file );
        Sample3RMSFile[Ros - 1][Drawer] = fopen(file.c_str(), "r");
      }
      if (Sample3RMSFile[Ros - 1][Drawer] == NULL) {
        ATH_MSG_ERROR( "Can't read input sample 3 RMS files." );
        return StatusCode::FAILURE;
      }
 
      ATH_MSG_DEBUG( " **** Start of sample 3 RMS Read Out" );
      FILE* rms_file = Sample3RMSFile[Ros - 1][Drawer];
      //if(fgets(buff, sizeof(buff), rms_file) != NULL) {
      //  if (lDebug)
      //    log << MSG::DEBUG << "Vector is being loaded: "<< buff << endmsg;
      //}
      // load tokens to be searched for in a string
      char* word;
      const char* TOKENS = { " \t\n" };
      // read Vector
      int dima = 48;
      for (int line = 0; line < dima; line++) {
        if (fgets(buff, sizeof(buff), rms_file) != NULL) {
          ATH_MSG_DEBUG(  "line " << line << " is " << buff );
          // Check for comment lines
          if (*buff == '!' || *buff == '*') continue;
          // read value
          double pippo;
          char* saveptr = nullptr;
          if ((word = strtok_r(buff, TOKENS, &saveptr)) == NULL) pippo = 0;
          else pippo = atof(word);
          // read value
          ATH_MSG_VERBOSE ( "elem is " << pippo );
          int chline = line;
          // read rms vector in pmt order but save it in channel order if m_pmtOrder is true
          if (m_pmtOrder) {
            if (Ros < 3) chline = PmtToChannelBarrel[line] - 1;
            else chline = PmtToChannelExtendedBarrel[line] - 1;
          }
          m_sample3RMS[Ros - 1][Drawer][chline] = pippo;
        }
      }
      fclose(rms_file);
    }
  }
 
  ATH_CHECK( m_inputDigitsContainerKey.initialize() );
  ATH_CHECK( m_outputDigitsContainerKey.initialize() );
 
  if (!m_useMeanFiles) {
    ATH_CHECK( m_tileToolNoiseSample.retrieve() );
  }
 
  ATH_MSG_INFO( "Initialization completed successfully" );
 
  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();
  }

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

std::unique_ptr<AlphaMatrix> TileRawCorrelatedNoise::m_alphaMatrix

private

Definition at line 66 of file TileRawCorrelatedNoise.h.

◆ m_alphaMatrixFilePrefix

std::string TileRawCorrelatedNoise::m_alphaMatrixFilePrefix

private

Definition at line 58 of file TileRawCorrelatedNoise.h.

◆ 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_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_inputDigitsContainerKey

SG::ReadHandleKey<TileDigitsContainer> TileRawCorrelatedNoise::m_inputDigitsContainerKey

private

Initial value:

{this, "TileDigitsContainer", 
                                                                    "TileDigitsCnt", 
                                                                    "Input Tile digits container key"}

Definition at line 46 of file TileRawCorrelatedNoise.h.

                                                                  {this, "TileDigitsContainer", 
                                                                    "TileDigitsCnt", 
                                                                    "Input Tile digits container key"};

◆ m_meanFilePrefix

std::string TileRawCorrelatedNoise::m_meanFilePrefix

private

Definition at line 60 of file TileRawCorrelatedNoise.h.

◆ m_meanSamples

float TileRawCorrelatedNoise::m_meanSamples[4][64][48][7] {}

private

Definition at line 67 of file TileRawCorrelatedNoise.h.

67{};

◆ m_nRMS_threshold

float TileRawCorrelatedNoise::m_nRMS_threshold

private

Definition at line 55 of file TileRawCorrelatedNoise.h.

◆ m_outputDigitsContainerKey

SG::WriteHandleKey<TileDigitsContainer> TileRawCorrelatedNoise::m_outputDigitsContainerKey

private

Initial value:

{this, "OutputTileDigitsContainer", 
                                                                      "NewDigitsContainer", 
                                                                      "Output Tile digits container key"}

Definition at line 50 of file TileRawCorrelatedNoise.h.

                                                                    {this, "OutputTileDigitsContainer", 
                                                                      "NewDigitsContainer", 
                                                                      "Output Tile digits container key"};

◆ m_pmtOrder

bool TileRawCorrelatedNoise::m_pmtOrder

private

Definition at line 71 of file TileRawCorrelatedNoise.h.

◆ m_sample3RMS

float TileRawCorrelatedNoise::m_sample3RMS[4][64][48] {}

private

Definition at line 68 of file TileRawCorrelatedNoise.h.

68{};

◆ m_sample3RMSFilePrefix

std::string TileRawCorrelatedNoise::m_sample3RMSFilePrefix

private

Definition at line 59 of file TileRawCorrelatedNoise.h.

◆ m_tileToolNoiseSample

ToolHandle<TileCondToolNoiseSample> TileRawCorrelatedNoise::m_tileToolNoiseSample

private

Initial value:

{this,

"TileCondToolNoiseSample", "TileCondToolNoiseSample", "Tile sample noise tool"}

Definition at line 73 of file TileRawCorrelatedNoise.h.

73 {this,

74 "TileCondToolNoiseSample", "TileCondToolNoiseSample", "Tile sample noise tool"};

◆ m_useMeanFiles

bool TileRawCorrelatedNoise::m_useMeanFiles

private

Definition at line 70 of file TileRawCorrelatedNoise.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:

Classes

Public Member Functions

Protected Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ StoreGateSvc_t

Constructor & Destructor Documentation

◆ TileRawCorrelatedNoise()

◆ ~TileRawCorrelatedNoise()

Member Function Documentation

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ finalize()

◆ initialize()

◆ inputHandles()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_alphaMatrix

◆ m_alphaMatrixFilePrefix

◆ m_detStore

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_inputDigitsContainerKey

◆ m_meanFilePrefix

◆ m_meanSamples

◆ m_nRMS_threshold

◆ m_outputDigitsContainerKey

◆ m_pmtOrder

◆ m_sample3RMS

◆ m_sample3RMSFilePrefix

◆ m_tileToolNoiseSample

◆ m_useMeanFiles

◆ m_varHandleArraysDeclared

◆ m_vhka