#include <Egamma1_LArStrip_Fex_RowAware.h>

Inheritance diagram for GlobalSim::Egamma1_LArStrip_Fex_RowAware:

Collaboration diagram for GlobalSim::Egamma1_LArStrip_Fex_RowAware:

Public Member Functions
	Egamma1_LArStrip_Fex_RowAware (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &) const 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
StatusCode	findNeighborhoods_RowAware (const std::vector< const xAOD::eFexEMRoI * > &, const std::vector< const CaloCell * > &, IOBitwise::eEmNbhoodTOBContainer &, std::vector< int > &) const
StatusCode	findNeighborhood_RowAware (const xAOD::eFexEMRoI , const std::vector< const CaloCell > &, IOBitwise::eEmNbhoodTOBContainer &, std::vector< int > &) const
StatusCode	findClosestCellToRoI (const xAOD::eFexEMRoI , const std::vector< const CaloCell > &, const CaloCell *&) 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< xAOD::EventInfo >	m_eventInfoKey
ToolHandle< ICaloCellsProducer >	m_cellProducer
ToolHandle< eFexRoIAlgTool >	m_roiAlgTool
Gaudi::Property< bool >	m_dump
Gaudi::Property< bool >	m_dumpTerse
SG::WriteHandleKey< IOBitwise::eEmNbhoodTOBContainer >	m_neighKey
SG::WriteHandleKey< std::vector< int > >	m_phimaxKey
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 Egamma1_LArStrip_Fex_RowAware.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

privateinherited

Definition at line 388 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ Egamma1_LArStrip_Fex_RowAware()

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

Definition at line 46 of file Egamma1_LArStrip_Fex_RowAware.cxx.

                                                                                                               : 
    AthReentrantAlgorithm(name, pSvcLocator){
  }

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.

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

overridevirtual

Definition at line 64 of file Egamma1_LArStrip_Fex_RowAware.cxx.

                                                                                 {
    // Read in a CaloCell container. Ask producers to create
    // vectors of CaloCells to be examined.
 
    ATH_MSG_DEBUG ("Executing");
    
    SG::ReadHandle<xAOD::EventInfo> eventInfo(m_eventInfoKey, ctx);
    if(!eventInfo.isValid()) {
      ATH_MSG_ERROR ("Error obtaining EventInfo object");
      return StatusCode::FAILURE;
    }
    
    std::vector<const CaloCell*> cells;
    CHECK(m_cellProducer->cells(cells, ctx));
    ATH_MSG_DEBUG(cells.size() <<"Cells read in");
 
    std::vector<const xAOD::eFexEMRoI*> rois;
    CHECK(m_roiAlgTool->RoIs(rois, ctx));
    ATH_MSG_DEBUG(rois.size() << " RoI(s) read in");
 
    // find cells in the neighborhood of RoIs.
    // A neighborhood is a collection of CellData objects which
    // contain cell eta, phi and Et.
    
    auto neighborhoodTOBs = std::make_unique<IOBitwise::eEmNbhoodTOBContainer>();
    auto phimax = std::make_unique<std::vector<int>>();
    
    CHECK(findNeighborhoods_RowAware(rois, cells, *neighborhoodTOBs, *phimax));
    
    SG::WriteHandle<GlobalSim::IOBitwise::eEmNbhoodTOBContainer> h_neighborhoodTOBs(m_neighKey, ctx);
    SG::WriteHandle<std::vector<int> > h_phimax(m_phimaxKey, ctx);
 
    auto dumper = GlobalSim::LArStripNeighborhoodDumper();
    if(m_dump || m_dumpTerse){
      if (m_dump) {
    CHECK(dumper.dump(name(), *eventInfo, *neighborhoodTOBs));
      }
      
      if (m_dumpTerse) {
    CHECK(dumper.dumpTerse(name(), *eventInfo, *neighborhoodTOBs));
      }
    }
    
    CHECK(h_neighborhoodTOBs.record(std::move(neighborhoodTOBs)));
    CHECK(h_phimax.record(std::move(phimax)));
    
    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();
  }

◆ findClosestCellToRoI()

StatusCode GlobalSim::Egamma1_LArStrip_Fex_RowAware::findClosestCellToRoI	(	const xAOD::eFexEMRoI *	,
		const std::vector< const CaloCell * > &	,
		const CaloCell *&	) const

private

◆ findNeighborhood_RowAware()

StatusCode GlobalSim::Egamma1_LArStrip_Fex_RowAware::findNeighborhood_RowAware	(	const xAOD::eFexEMRoI *	roi,
		const std::vector< const CaloCell * > &	cells,
		IOBitwise::eEmNbhoodTOBContainer &	neighborhoodTOBs,
		std::vector< int > &	phimax ) const

private

Definition at line 128 of file Egamma1_LArStrip_Fex_RowAware.cxx.

                                                             {
    
    // this member function constructs an LArStripNeighborhood.
    // 
    // A neighourhood is constructed from StripData objects constructed
    // from CalCells (strips) in the vicinity of an EM RoI the following manner:
    //
    // - the cell in the vicinity of the RoI is identified. The neighboorhood
    // strips are the strups centered on the maximum energy strip.
    //
    // In more detail:
    // A rectangular eta-phi subset of all strips is made.
    // This subset constains the cells needed for the maximum energy search
    // and for any subsequent neigborhood strip selection.
    //
    // The eta window for the initial selection ismade with half-width of
    // 0.05 + 8.5* DeltaEta where DeltaEta = 0.003125, the nominal strip width
    // in eta. A cut-oof off eta = +-1.4 is applied in the selection.
    // 
    // Phi selection consists of calculating a phi index for the the RoI,
    // then requiring selected strips to be have a phi indix within +=1 of
    // the RoI phi index.
    //
    // The strips used to identigy the max energy strip the are within +-1 of the 
    // as the phi index of the RoI, and eta that lies within 0.1 in eta to the RoI.
    //
     // The strips selected for the Neighborhood have eta  within +- 8.5 DeltaEta
    // of the max energy strip, and +- 1 of the max RoI strip phi Index.
 
    auto cells_near_roi = std::vector<const CaloCell*>();
 
    ATH_MSG_DEBUG("roi eta " << roi->eta() << " phi " << roi->phi());
    
    // lambda function to calculate the phi index of a eta-phi point
    auto phi_ind = [](const auto& c) {
      constexpr double dphi = std::numbers::pi/32;
      std::size_t iphi = 32 + int(std::floor(c->phi()/dphi));
      return iphi > 63 ?
    std::optional<std::size_t>() : std::make_optional(iphi);
    };
 
    const std::optional<std::size_t> roi_phi_index_opt = phi_ind(roi);
    if (not roi_phi_index_opt.has_value()) {
      return StatusCode::FAILURE; 
    }
    const std::size_t roi_phi_index = *roi_phi_index_opt;
    
    // obtain adjacent phi indices
    auto roi_phi_indices = *wrap5(roi_phi_index);
 
    // container for strips close to RoI in eta
    auto close = std::deque<std::vector<const CaloCell*>>(5);
    for (auto& v :close) {v.reserve(100);}
    
    //One ROI is 0.1 wide in eta, this is the half width
    constexpr double half_deta_roi{0.05};
    //One cell in the barrel is 0.003125, this is the half width of the 17 cell window
    constexpr double half_deta_neigh{8.5*0.003125};
    //To define the ±eta limit of our window, we need to sum the above
    constexpr double half_deta_fid{half_deta_roi + half_deta_neigh};
    
    
    double etalim_low = std::max(roi->eta()-half_deta_fid, -1.4);
    double etalim_high = std::min(roi->eta()+half_deta_fid, 1.4);
 
 
    // double loop. outer: all strips. inner: adjacent roi indices.
    for (const auto& cell : cells) {
      auto icell = *phi_ind(cell);
      std::size_t pos{0};
      for(const auto& iroi : roi_phi_indices) {
    auto c_eta = cell->eta();
    if (iroi == icell and c_eta >= etalim_low and c_eta < etalim_high) {
      close[pos].push_back(cell);
      break;
    }
    ++pos;
      }
    }
    
    // select the cells within a a tower width of the RoI. Then find the
    // cell in this selction with the highest energy
    auto roi_cells = std::deque<std::vector<const CaloCell*>>(5);
    auto roi_max_it = std::vector<std::vector<const CaloCell*>::iterator>();
    
    for (std::size_t i{0ul}; i != close.size(); ++i) {
      roi_cells[i].reserve(close[i].size());
      std::copy_if(std::begin(close[i]),
           std::end(close[i]),
           std::back_inserter(roi_cells[i]),
           [&roi](const auto& c) {
             return std::abs(c->eta() - roi->eta()) < half_deta_roi;
           });
      //Work out where the max is in the central block.
      if(i > 0 && i < 4){
    auto it = std::max_element(std::begin(roi_cells[i]),
                   std::end(roi_cells[i]),
                   [](const auto& l,const auto& r) {
                     return l->e() < r->e();
                   });
    ATH_MSG_DEBUG("max cell row "
              << i << " position " 
              << std::distance(std::begin(roi_cells[i]), it)
              << " :" << **it);
    roi_max_it.push_back(it);
      }
    }
    
    auto max_row = std::max_element(std::begin(roi_max_it),
                    std::end(roi_max_it),
                    [](const auto& l,const auto& r) {
                      return (*l)->e() < (*r)->e();
                    });
 
    int max_row_pos = std::distance( roi_max_it.begin(), max_row );
 
    phimax.push_back(max_row_pos);
    
    ATH_MSG_DEBUG("max cell row "
          << ' ' << std::distance( roi_max_it.begin(), max_row )+1);
 
    //If the maximum is not in the centre row, we need to re-seed    
    switch(max_row_pos)
    {
      case 0: 
        {
      close.pop_back();
      close.pop_back();
      break;
    }
      case 1:
    {
      close.pop_front();
      close.pop_back();
      break;
    }
      case 2:
    {
      close.pop_front();
      close.pop_front();
      break;
    }
    }
 
    ATH_MSG_DEBUG("popped ");
    
    // set up Cell containers for the neighborhood. One container
    // per adjacent RoI phi indices.
    auto neigh_cells = std::vector<std::vector<const CaloCell*>>(3);
 
    const CaloCell* max_cell{*(*max_row)};
    const auto  max_cell_eta = max_cell->eta();
 
    ATH_MSG_DEBUG("Got the max cell");
    
    for (std::size_t iv{0ul}; iv != close.size(); ++iv) {
      std::copy_if(std::begin(close[iv]),
           std::end(close[iv]),
           std::back_inserter(neigh_cells[iv]),
           [&max_cell_eta, &half_deta_neigh](const auto& c){
             return abs(c->eta()-max_cell_eta) < half_deta_neigh;
           });
    }
 
    ATH_MSG_DEBUG("Made our neighbourhood");
    
    auto max_neigh_cell_it = std::find(std::begin(neigh_cells[1]),
                  std::end(neigh_cells[1]),
                  max_cell);
    if (max_neigh_cell_it == std::end(neigh_cells[1])){
      ATH_MSG_ERROR("Lost the max cell");
      return StatusCode::FAILURE;
    }
 
    auto max_neigh_cell_pos{std::distance(std::begin(neigh_cells[1]),
                      max_neigh_cell_it)};
 
    ATH_MSG_DEBUG("Rediscovered our neighbourhood max");
    
    auto toStripData = [](const auto& fromCells){
      auto stripdata = std::vector<StripData>();
      stripdata.reserve(fromCells.size());
      std::transform(std::begin(fromCells),
             std::end(fromCells),
             back_inserter(stripdata),
             [](const auto& c) {
               return StripData(c->eta(),
                    c->phi(),
                    c->e());});
      return stripdata;
    };     
 
    auto low = toStripData(neigh_cells[0]);
    auto center = toStripData(neigh_cells[1]);
    auto high = toStripData(neigh_cells[2]);
 
    Coords roi_c{roi->eta(), roi->phi()};
    Coords cell_c{max_cell->eta(), max_cell->phi()};
    
    ATH_MSG_DEBUG("Fill with strip data");
 
    LArStripNeighborhood neighborhood = LArStripNeighborhood(low, center, high, roi_c, cell_c, max_neigh_cell_pos);
    
    neighborhoodTOBs.push_back(std::make_unique<IOBitwise::eEmNbhoodTOB>(*roi, neighborhood));
    
    return StatusCode::SUCCESS;
  }

◆ findNeighborhoods_RowAware()

StatusCode GlobalSim::Egamma1_LArStrip_Fex_RowAware::findNeighborhoods_RowAware	(	const std::vector< const xAOD::eFexEMRoI * > &	rois,
		const std::vector< const CaloCell * > &	cells,
		IOBitwise::eEmNbhoodTOBContainer &	neighborhoodTOBs,
		std::vector< int > &	phimax ) const

private

Definition at line 114 of file Egamma1_LArStrip_Fex_RowAware.cxx.

                                                             {
    
    for (const auto& roi : rois) {
      CHECK(findNeighborhood_RowAware(roi, cells, neighborhoodTOBs, phimax));
    }
    
    return StatusCode::SUCCESS;
  }

◆ initialize()

StatusCode GlobalSim::Egamma1_LArStrip_Fex_RowAware::initialize ( )

overridevirtual

Definition at line 51 of file Egamma1_LArStrip_Fex_RowAware.cxx.

                                                       {
    ATH_MSG_INFO ("Initializing " << name());
 
    CHECK(m_cellProducer.retrieve());
    CHECK(m_roiAlgTool.retrieve());
    CHECK(m_neighKey.initialize());
    CHECK(m_phimaxKey.initialize());
    CHECK(m_eventInfoKey.initialize());
  
    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.

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

ToolHandle<ICaloCellsProducer> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_cellProducer

private

Initial value:

{this,
    "caloCellProducer",
    "EMB1CellFromCaloCells",
    "AlgTool to provide a vector of CaloCells"
    }

Definition at line 47 of file Egamma1_LArStrip_Fex_RowAware.h.

                                                 {this,
    "caloCellProducer",
    "EMB1CellFromCaloCells",
    "AlgTool to provide a vector of CaloCells"
    };

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

Gaudi::Property<bool> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_dump

private

Initial value:

{
      this,
      "dump",
      false,
      "flag to enable dumps"}

Definition at line 60 of file Egamma1_LArStrip_Fex_RowAware.h.

                               {
      this,
      "dump",
      false,
      "flag to enable dumps"};

◆ m_dumpTerse

Gaudi::Property<bool> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_dumpTerse

private

Initial value:

{
      this,
      "dumpTerse",
      false,
      "flag to enable terse dumps"}

Definition at line 66 of file Egamma1_LArStrip_Fex_RowAware.h.

                                    {
      this,
      "dumpTerse",
      false,
      "flag to enable terse dumps"};

◆ m_eventInfoKey

SG::ReadHandleKey<xAOD::EventInfo> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_eventInfoKey

private

Initial value:

{
      this,
    "EventInfo",
    "EventInfo",
    "EventInfo name"}

Definition at line 40 of file Egamma1_LArStrip_Fex_RowAware.h.

                                                 {
      this,
    "EventInfo",
    "EventInfo",
    "EventInfo name"};

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

SG::WriteHandleKey<IOBitwise::eEmNbhoodTOBContainer> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_neighKey

private

Initial value:

{
      this,
      "stripNeighborhoodTOBKey",
      "stripNeighborhoodTOBContainer",
      "location to write strip neighborhoods of EFex RoIs, with the associated TOBs"}

Definition at line 73 of file Egamma1_LArStrip_Fex_RowAware.h.

               {
      this,
      "stripNeighborhoodTOBKey",
      "stripNeighborhoodTOBContainer",
      "location to write strip neighborhoods of EFex RoIs, with the associated TOBs"};

◆ m_phimaxKey

SG::WriteHandleKey<std::vector<int> > GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_phimaxKey

private

Initial value:

{
      this,
      "phimaxKey",
      "phimax"}

Definition at line 80 of file Egamma1_LArStrip_Fex_RowAware.h.

                {
      this,
      "phimaxKey",
      "phimax"};

◆ m_roiAlgTool

ToolHandle<eFexRoIAlgTool> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_roiAlgTool

private

Initial value:

{this,
         "roiAlgTool",
         "EMB1CellFromCaloCells",
         "AlgTool to provide a vector<const xAOD::eFexEMRoI*>"}

Definition at line 55 of file Egamma1_LArStrip_Fex_RowAware.h.

                {this,
         "roiAlgTool",
         "EMB1CellFromCaloCells",
         "AlgTool to provide a vector<const xAOD::eFexEMRoI*>"};

◆ 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

Constructor & Destructor Documentation

◆ Egamma1_LArStrip_Fex_RowAware()

Member Function Documentation

◆ cardinality()

◆ declareGaudiProperty()

◆ declareProperty()

◆ detStore()

◆ evtStore()

◆ execute()

◆ extraDeps_update_handler()

◆ extraOutputDeps()

◆ filterPassed()

◆ findClosestCellToRoI()

◆ findNeighborhood_RowAware()

◆ findNeighborhoods_RowAware()

◆ initialize()

◆ inputHandles()

◆ isClonable()

◆ msg()

◆ msgLvl()

◆ outputHandles()

◆ renounce()

◆ renounceArray()

◆ setFilterPassed()

◆ sysExecute()

◆ sysInitialize()

◆ sysStart()

◆ updateVHKA()

Member Data Documentation

◆ m_cellProducer

◆ m_detStore

◆ m_dump

◆ m_dumpTerse

◆ m_eventInfoKey

◆ m_evtStore

◆ m_extendedExtraObjects

◆ m_neighKey

◆ m_phimaxKey

◆ m_roiAlgTool

◆ m_varHandleArraysDeclared

◆ m_vhka