GepEtaSoftKillerAlg Class Reference

#include <GepEtaSoftKillerAlg.h>

Inheritance diagram for GepEtaSoftKillerAlg:

Collaboration diagram for GepEtaSoftKillerAlg:

Public Member Functions
	GepEtaSoftKillerAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode	initialize () override
virtual StatusCode	execute (const EventContext &ctx) 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
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::CaloClusterContainer >	m_inputClustersKey
SG::WriteHandleKey< xAOD::CaloClusterContainer >	m_outputClustersKey
Gaudi::Property< double >	m_gridEtaSize
Gaudi::Property< double >	m_gridPhiSize
Gaudi::Property< double >	m_etaMax
Gaudi::Property< int >	m_etaBandWidth
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 11 of file GepEtaSoftKillerAlg.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

GepEtaSoftKillerAlg()

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

Definition at line 13 of file GepEtaSoftKillerAlg.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.

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

overridevirtual

Definition at line 26 of file GepEtaSoftKillerAlg.cxx.

                                                                     {
    ATH_MSG_DEBUG("Executing " << name() << "...");
 
    auto h_input = SG::makeHandle(m_inputClustersKey, ctx);
    ATH_CHECK(h_input.isValid());
    const auto& inputClusters = *h_input;
 
    ATH_MSG_DEBUG("Read in " << inputClusters.size() << " input clusters/towers");
 
    // Build the eta-phi grid
    const double minEta = -m_etaMax;
    const double maxEta =  m_etaMax;
    const double twopi  = 2.0 * M_PI;
 
    int neta = std::max(static_cast<int>((maxEta - minEta) / m_gridEtaSize + 0.5), 1);
    double deta = (maxEta - minEta) / neta;
 
    int nphi = static_cast<int>(twopi / m_gridPhiSize + 0.5);
    double dphi = twopi / nphi;
 
    std::vector<double> eta_bins(neta + 1);
    const double minPhi = -M_PI;
    std::vector<double> phi_bins(nphi + 1);
 
    for (int i = 0; i <= neta; ++i) {
        eta_bins[i] = minEta + i * deta;
    }
    for (int i = 0; i <= nphi; ++i) {
        phi_bins[i] = minPhi + i * dphi;
    }
 
    // Grid: each cell holds pointers to its clusters
    std::vector<std::vector<std::vector<const xAOD::CaloCluster*>>>
        grid(neta, std::vector<std::vector<const xAOD::CaloCluster*>>(nphi));
 
    for (const auto* cluster : inputClusters) {
        double eta = cluster->eta();
        double phi = cluster->phi();
 
        int eta_bin = static_cast<int>(
            std::distance(eta_bins.begin(),
                          std::upper_bound(eta_bins.begin(), eta_bins.end(), eta))) - 1;
        int phi_bin = static_cast<int>(
            std::distance(phi_bins.begin(),
                          std::upper_bound(phi_bins.begin(), phi_bins.end(), phi))) - 1;
 
        if (eta_bin >= 0 && eta_bin < neta && phi_bin >= 0 && phi_bin < nphi) {
            grid[eta_bin][phi_bin].push_back(cluster);
        }
    }
 
    // Compute the median of max-pT values per eta-band
    // Empty grid cells contribute 0.0 (consistent with FastJet SoftKiller)
    const int bandWidth = m_etaBandWidth;
    int nBands = (neta + bandWidth - 1) / bandWidth;
    std::vector<double> medianPerBand(nBands, 0.0);
 
    for (int band = 0; band < nBands; ++band) {
        std::vector<double> maxPtValues;
        int etaStart = band * bandWidth;
        int etaEnd   = std::min(etaStart + bandWidth, neta);
 
        for (int j = 0; j < nphi; ++j) {
            for (int i = etaStart; i < etaEnd; ++i) {
                const auto& cell = grid[i][j];
                if (!cell.empty()) {
                    double maxPt = (*std::max_element(
                        cell.begin(), cell.end(),
                        [](const xAOD::CaloCluster* a,
                           const xAOD::CaloCluster* b) {
                            return a->pt() < b->pt();
                        }))->pt();
                    maxPtValues.push_back(maxPt);
                } else {
                    maxPtValues.push_back(0.0);
                }
            }
        }
 
        if (!maxPtValues.empty()) {
            std::sort(maxPtValues.begin(), maxPtValues.end());
            size_t mid = maxPtValues.size() / 2;
            if (maxPtValues.size() % 2 == 0) {
                medianPerBand[band] =
                    (maxPtValues[mid - 1] + maxPtValues[mid]) / 2.0;
            } else {
                medianPerBand[band] = maxPtValues[mid];
            }
        }
 
        ATH_MSG_DEBUG("Eta band " << band
                      << " [" << eta_bins[etaStart] << ", "
                      << eta_bins[etaEnd] << ")"
                      << ": median pT threshold = " << medianPerBand[band]);
    }
 
    // Create output container
    SG::WriteHandle<xAOD::CaloClusterContainer> h_output =
        SG::makeHandle(m_outputClustersKey, ctx);
    ATH_CHECK(h_output.record(
        std::make_unique<xAOD::CaloClusterContainer>(),
        std::make_unique<xAOD::CaloClusterAuxContainer>()));
 
    // Apply eta-dependent pT threshold:
    //   weight = 1.0 if cluster pT > band median, else 0.0
    for (int i = 0; i < neta; ++i) {
        int band = i / bandWidth;
        double threshold = medianPerBand[band];
 
        for (int j = 0; j < nphi; ++j) {
            for (const auto* cluster : grid[i][j]) {
                double weight = (cluster->pt() > threshold) ? 1.0 : 0.0;
 
                auto* out = h_output->push_back(
                    std::make_unique<xAOD::CaloCluster>());
                out->setE(cluster->e() * weight);
                out->setEta(cluster->eta());
                out->setPhi(cluster->phi());
                out->setM(cluster->m());
            }
        }
    }
 
    ATH_MSG_DEBUG("Output " << h_output->size()
                  << " clusters after EtaSoftKiller");
 
    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();
  }

initialize()

StatusCode GepEtaSoftKillerAlg::initialize ( )

overridevirtual

Definition at line 18 of file GepEtaSoftKillerAlg.cxx.

                                           {
    ATH_MSG_INFO("Initializing " << name() << "...");
    ATH_CHECK(m_inputClustersKey.initialize());
    ATH_CHECK(m_outputClustersKey.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 HiveAlgBase, 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_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_etaBandWidth

Gaudi::Property<int> GepEtaSoftKillerAlg::m_etaBandWidth

private

Initial value:

{this, "etaBandWidth", 2,
        "Number of eta rows per band for median calculation"}

Definition at line 34 of file GepEtaSoftKillerAlg.h.

                                     {this, "etaBandWidth", 2,
        "Number of eta rows per band for median calculation"};

m_etaMax

Gaudi::Property<double> GepEtaSoftKillerAlg::m_etaMax

private

Initial value:

{this, "etaMax", 4.9,
        "Maximum |eta| extent of the grid"}

Definition at line 31 of file GepEtaSoftKillerAlg.h.

                                  {this, "etaMax", 4.9,
        "Maximum |eta| extent of the grid"};

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_gridEtaSize

Gaudi::Property<double> GepEtaSoftKillerAlg::m_gridEtaSize

private

Initial value:

{this, "gridEtaSize", 0.6,
        "Grid cell size in eta"}

Definition at line 25 of file GepEtaSoftKillerAlg.h.

                                       {this, "gridEtaSize", 0.6,
        "Grid cell size in eta"};

m_gridPhiSize

Gaudi::Property<double> GepEtaSoftKillerAlg::m_gridPhiSize

private

Initial value:

{this, "gridPhiSize", 0.6,
        "Grid cell size in phi"}

Definition at line 28 of file GepEtaSoftKillerAlg.h.

                                       {this, "gridPhiSize", 0.6,
        "Grid cell size in phi"};

m_inputClustersKey

SG::ReadHandleKey<xAOD::CaloClusterContainer> GepEtaSoftKillerAlg::m_inputClustersKey

private

Initial value:

{
        this, "inputClustersKey", "", "Input cluster/tower container"}

Definition at line 19 of file GepEtaSoftKillerAlg.h.

                                                                {
        this, "inputClustersKey", "", "Input cluster/tower container"};

m_outputClustersKey

SG::WriteHandleKey<xAOD::CaloClusterContainer> GepEtaSoftKillerAlg::m_outputClustersKey

private

Initial value:

{
        this, "outputClustersKey", "", "Output EtaSK-suppressed cluster container"}

Definition at line 22 of file GepEtaSoftKillerAlg.h.

                                                                  {
        this, "outputClustersKey", "", "Output EtaSK-suppressed cluster container"};

m_varHandleArraysDeclared

bool AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::m_varHandleArraysDeclared

privateinherited

Definition at line 399 of file AthCommonDataStore.h.

m_vhka

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

privateinherited

Definition at line 398 of file AthCommonDataStore.h.

---

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

• GepEtaSoftKillerAlg.h
• GepEtaSoftKillerAlg.cxx