ATLAS Offline Software
Loading...
Searching...
No Matches
GepCellTowerAlg Class Reference

#include <GepCellTowerAlg.h>

Inheritance diagram for GepCellTowerAlg:
Collaboration diagram for GepCellTowerAlg:

Public Member Functions

 GepCellTowerAlg (const std::string &name, ISvcLocator *pSvcLocator)
virtual ~GepCellTowerAlg ()
virtual StatusCode initialize ()
virtual StatusCode execute (const EventContext &) const
virtual StatusCode finalize ()
virtual StatusCode sysInitialize () override
 Override sysInitialize.
virtual bool isClonable () const override
 Specify if the algorithm is clonable.
virtual StatusCode sysExecute (const EventContext &ctx) override
 Execute an algorithm.
virtual const DataObjIDColl & extraOutputDeps () const override
 Return the list of extra output dependencies.
virtual bool filterPassed (const EventContext &ctx) const
 Get filter decision:
virtual void setFilterPassed (bool state, const EventContext &ctx) const
 Set filter decision:
ServiceHandle< StoreGateSvc > & evtStore ()
 The standard StoreGateSvc (event store) Returns (kind of) a pointer to the StoreGateSvc.
const ServiceHandle< StoreGateSvc > & detStore () const
 The standard StoreGateSvc/DetectorStore Returns (kind of) a pointer to the StoreGateSvc.
virtual StatusCode sysStart () override
 Handle START transition.
virtual std::vector< Gaudi::DataHandle * > inputHandles () const override
 Return this algorithm's input handles.
virtual std::vector< Gaudi::DataHandle * > outputHandles () const override
 Return this algorithm's output handles.
Gaudi::Details::PropertyBase & declareProperty (Gaudi::Property< T, V, H > &t)
void updateVHKA (Gaudi::Details::PropertyBase &)
MsgStream & msg () const
bool msgLvl (const MSG::Level lvl) const

Protected Member Functions

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::WriteHandleKey< xAOD::CaloClusterContainer > m_outputCellTowerKey
SG::ReadHandleKey< Gep::GepCellMap > m_gepCellsKey
float m_minEt
int m_doNNFilter
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 15 of file GepCellTowerAlg.h.

Member Typedef Documentation

◆ StoreGateSvc_t

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

Definition at line 376 of file AthCommonDataStore.h.

Constructor & Destructor Documentation

◆ GepCellTowerAlg()

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

Definition at line 12 of file GepCellTowerAlg.cxx.

12 :
13 AthReentrantAlgorithm( name, pSvcLocator ),
14 m_minEt(0.),
16{
17 declareProperty("minEt", m_minEt);
18 declareProperty("doNNFilter", m_doNNFilter);
19}
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

◆ ~GepCellTowerAlg()

GepCellTowerAlg::~GepCellTowerAlg ( )
virtual

Definition at line 22 of file GepCellTowerAlg.cxx.

22{}

Member Function Documentation

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

158 {
160 hndl.value(),
161 hndl.documentation());
162
163 }

◆ declareProperty()

Gaudi::Details::PropertyBase & AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::declareProperty ( Gaudi::Property< T, V, H > & t)
inlineinherited

Definition at line 145 of file AthCommonDataStore.h.

145 {
146 typedef typename SG::HandleClassifier<T>::type htype;
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>

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

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

◆ execute()

StatusCode GepCellTowerAlg::execute ( const EventContext & context) const
virtual

Definition at line 40 of file GepCellTowerAlg.cxx.

40 {
41 ATH_MSG_DEBUG ("Executing " << name() << "...");
42 setFilterPassed(false, context); //optional: start with algorithm not passed
43
44 std::vector<Gep::GepCaloCell> cells;
45
46 auto h_gepCellsMap = SG::makeHandle(m_gepCellsKey, context);
47 CHECK(h_gepCellsMap.isValid());
48 const auto & gepCellsMap = *h_gepCellsMap;
49
50 auto cell_map = gepCellsMap.getCellMap();
51
52 // Loop over all cells
53 for (auto const& cell_itr : *cell_map) {
54 cells.push_back(cell_itr.second);
55 }
56
57 // container for CaloCluster wrappers for Gep Clusters
58 SG::WriteHandle<xAOD::CaloClusterContainer> h_outputCaloClusters =
60 CHECK(h_outputCaloClusters.record(std::make_unique<xAOD::CaloClusterContainer>(),
61 std::make_unique<xAOD::CaloClusterAuxContainer>()));
62
63 // Use the indexing and cell energy accumulation functionality
64 // already implemented in xAOD::CaloTower and xAOD::CaloTowerContainer
65 std::vector<std::vector<unsigned int>> cell_ids;
66 auto customTowers = std::make_unique<xAOD::CaloTowerContainer>();
67 auto aux = std::make_unique<xAOD::CaloTowerAuxContainer>();
68 customTowers->setStore(aux.get());
69
70 // Define tower array (98 eta bins x 64 phi bins)
71 static constexpr int nEta{98};
72 static constexpr int nPhi{64};
73 customTowers->configureGrid(nEta,-4.9,4.9,nPhi);
74
75 int nTowers = customTowers->nTowers();
76 cell_ids.resize(nTowers);
77
78 std::vector<std::vector<float>> layerEnergies;
79 layerEnergies.resize(nTowers);
80 for (int iTower=0; iTower < nTowers; ++iTower) layerEnergies[iTower].resize((int)CaloSampling::Unknown);
81
82 for (int iTower=0; iTower < nTowers; ++iTower) {
83 auto tower = std::make_unique<xAOD::CaloTower>();
84 customTowers->push_back(std::move(tower));
85 customTowers->at(iTower)->reset();
86 }
87
88 // Single loop over cells to accumulate energy into the correct tower
89 for (const auto& cell : cells) {
90 if (cell.isBadCell()) continue;
91
92 int idx = customTowers->index(cell.eta,cell.phi);
93 if (idx < 0) continue;
94
95 //custom code to do the "No neighbours filter"/"Not Ned Flanders"
96 //Three levels of filter have been implemented
97 // 1. Designed to remove a set of cells which are never in 4-2-2 topoclusters.
98 // Rejects cells with significance <4 where there are no neighbours.
99 // 2. Designed to try to replicate the 4-2-2 topoclusters are accurately as possible.
100 // Note that some cell in 4-2-2 topoclusters are rejected and others not in 4-2-2 topoclusters are retained.
101 // i.e. we try to replicate the overall effect but this is not perfect.
102 // As well as those in 1. cells in PreB,EMB1,EMB2,PreE,EME1,EME2 with ET < 4sigma with only 1 neighbour which is not above 4 sigma are removed.
103 // 3. Designed to be stricter than 4-2-2 topoclustering to target the most noisy layers of the calorimeter.
104 // As well as the cells in 1. and 2. PreB,PreE,TileGap3 cells are required to have at least 1 neighbour not in the same layer (even if ET > 4 sigma).
105 if (m_doNNFilter!=0){
106 int countNeighbours=0;
107 int countNeighboursNotInLayer=0;
108 int count4sigNeighbours=0;
109 //loop over the neighbours
110 for (unsigned int i_neighbour = 0; i_neighbour < cell.neighbours.size(); ++i_neighbour) {
111 // Check whether this neighbouring cell was sent to the GEP
112 auto const& nghbr_itr = cell_map->find(cell.neighbours[i_neighbour]);
113 if (nghbr_itr == cell_map->end()) continue;
114 Gep::GepCaloCell neighbour = nghbr_itr->second;
115 if (neighbour.isBadCell()) continue;
116 if (neighbour.et<=0) continue;
117 countNeighbours++;
118 if (neighbour.sigma>=4) count4sigNeighbours++;
119 if (neighbour.sampling!=cell.sampling) countNeighboursNotInLayer++;
120 }
121 //skip cells where no neighbour can be found
122 if (countNeighbours==0 && cell.sigma<4) continue;
123 bool passStrictNNFilter = false;
124 if (cell.sigma>4) passStrictNNFilter=true;
125 if (cell.sampling==0 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;
126 if (cell.sampling==1 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;
127 if (cell.sampling==2 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;
128 if (cell.sampling==4 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;
129 if (cell.sampling==5 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;//maybe we don't want to do this for the EMEC-IW?
130 if (cell.sampling==6 && (countNeighbours>=2 || count4sigNeighbours>=1)) passStrictNNFilter=true;//maybe we don't want to do this for the EMEC-IW?
131 if ((cell.sampling>=6 || cell.sampling==3) && countNeighbours>=1) passStrictNNFilter=true;
132 if (m_doNNFilter>=2 && !passStrictNNFilter) continue;
133 if (m_doNNFilter>=3 && (cell.sampling==0 || cell.sampling==4 || cell.sampling==17) && countNeighboursNotInLayer==0) continue;
134 }
135
136 // Internally, this results in the cell et being added to the energy (i.e. e, not et) of a
137 // 4-vector with the eta and phi set to the center point of the tower
138 // Effectively accumulating the et of the tower's constituent cells
139 customTowers->at(idx)->addEnergy(cell.et);
140 layerEnergies[idx][cell.sampling] += cell.et;
141 cell_ids[idx].push_back(cell.id);
142 }
143
144 // Store the Gep clusters to a CaloClusters, and write out.
145 for(auto tower: *customTowers){
146 auto p4 = tower->p4();
147 // This is equivalent to checking the et of the tower
148 // since e() is the sum of the et of all constituent cells
149 if ( p4.E() <= m_minEt ) continue;
150
151 // store the calCluster to fix up the Aux container:
152 auto *ptr = h_outputCaloClusters->push_back(std::make_unique<xAOD::CaloCluster>());
153
154 // Unlike what was done here, downstream code will assume that e
155 // is the energy and et is the transverse energy,
156 // so we need to "flip" e and et and make a proper 4-vector here
157 // reminder - p4.e() was until now the et of the tower
158 double eta = p4.Eta();
159 double phi = p4.Phi();
160 double e = p4.E() * std::cosh(eta);
161
162 // ptr is a massless pseudo-particle with energy e
163 // representing a tower. The eta,phi coordinates are
164 // the center of the tower.
165 // When downstream code reads its et, it will
166 // get the measured energy in the tower.
167 ptr->setE(e);
168 ptr->setEta(eta);
169 ptr->setPhi(phi);
170 ptr->setTime(0);
171
172 ptr->setRawE(e);
173 ptr->setRawEta(eta);
174 ptr->setRawPhi(phi);
175 ptr->setRawM(0.0);
176
177 // add all the layer energies to the cluster
178 // these are stored alongside a sampling pattern
179 // the tower eta are used to convert the transverse
180 // energies into E per layer.
181 //Set Sampling pattern:
182 uint32_t samplingPattern=0;
183 for(int i=0;i<(int)CaloSampling::Unknown;i++) {
184 if (layerEnergies[tower->index()].at(i)!=0) samplingPattern |= (0x1U<<i);
185 }
186 //Clear sampling data (if there is any)
187 ptr->clearSamplingData();
188 ptr->setSamplingPattern(samplingPattern);
189
190 //fill the actual sampling energies
191 for(int i=0;i<(int)CaloSampling::Unknown;i++) {
192 CaloSampling::CaloSample sampling_i = static_cast<CaloSampling::CaloSample>(i);
193 if (layerEnergies[tower->index()].at(i)!=0) ptr->setEnergy(sampling_i, layerEnergies[tower->index()].at(i) * std::cosh(eta));
194 }
195
196 auto cccl = std::make_unique<CaloClusterCellLink>();
197
198 for (auto cell_id : cell_ids[tower->index()])
199 cccl->addCell(cell_map->at(cell_id).index, 1.0);
200
201 ptr->addCellLink(std::move(cccl));
202 }
203
204 setFilterPassed(true,context); //if got here, assume that means algorithm passed
205 return StatusCode::SUCCESS;
206}
Scalar eta() const
pseudorapidity method
Scalar phi() const
phi method
#define ATH_MSG_DEBUG(x,...)
#define CHECK(...)
Evaluate an expression and check for errors.
virtual void setFilterPassed(bool state, const EventContext &ctx) const
SG::WriteHandleKey< xAOD::CaloClusterContainer > m_outputCellTowerKey
SG::ReadHandleKey< Gep::GepCellMap > m_gepCellsKey
StatusCode record(std::unique_ptr< T > data)
Record a const object to the store.
virtual bool resize(size_t sz) override
Change the size of all aux data vectors.
SG::ReadCondHandle< T > makeHandle(const SG::ReadCondHandleKey< T > &key, const EventContext &ctx=Gaudi::Hive::currentContext())
constexpr int nEta
Default bin number of eta for vertex map.
constexpr int nPhi
Default bin number of phi for vertex map.
void * ptr(T *p)
Definition SGImplSvc.cxx:76
setEventNumber uint32_t
unsigned int sampling
Definition GepCaloCell.h:49
bool isBadCell() const
Definition GepCaloCell.h:59

◆ extraDeps_update_handler()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::extraDeps_update_handler ( Gaudi::Details::PropertyBase & ExtraDeps)
protectedinherited

Add StoreName to extra input/output deps as needed.

use the logic of the VarHandleKey to parse the DataObjID keys supplied via the ExtraInputs and ExtraOuputs Properties to add the StoreName if it's not explicitly given

◆ extraOutputDeps()

const DataObjIDColl & AthCommonAlgorithm< Gaudi::Algorithm >::extraOutputDeps ( ) const
overridevirtualinherited

Return the list of extra output dependencies.

This list is extended to include symlinks implied by inheritance relations.

Definition at line 89 of file AthCommonAlgorithm.cxx.

54{
55 // If we didn't find any symlinks to add, just return the collection
56 // from the base class. Otherwise, return the extended collection.
57 if (!m_extendedExtraObjects.empty()) {
59 }
61}
Common base class for algorithms.

◆ filterPassed()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::filterPassed ( const EventContext & ctx) const
inlinevirtualinherited

Get filter decision:

Definition at line 93 of file AthCommonAlgorithm.h.

93 {
94 return execState( ctx ).filterPassed();
95 }
virtual bool filterPassed(const EventContext &ctx) const
Get filter decision:

◆ finalize()

StatusCode GepCellTowerAlg::finalize ( )
virtual

Definition at line 35 of file GepCellTowerAlg.cxx.

35 {
36 ATH_MSG_DEBUG ("Finalizing " << name() << "...");
37 return StatusCode::SUCCESS;
38}

◆ initialize()

StatusCode GepCellTowerAlg::initialize ( )
virtual

Definition at line 25 of file GepCellTowerAlg.cxx.

25 {
26 ATH_MSG_DEBUG ("Initializing " << name() << "...");
27
28 // Retrieve AlgTools
29 CHECK(m_outputCellTowerKey.initialize());
30 CHECK(m_gepCellsKey.initialize());
31
32 return StatusCode::SUCCESS;
33}

◆ inputHandles()

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

Return this algorithm's input handles.

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

◆ isClonable()

virtual bool AthCommonAlgorithm< Gaudi::Algorithm >::isClonable ( ) const
inlineoverridevirtualinherited

Specify if the algorithm is clonable.

Only relevant for non-reentrant algorithms. Actual number of clones needs to be set via the "Cardinality" property.

Reimplemented in AFP_DigiTop, AlgB, AlgT, BCM_Digitization, CscDigitBuilder, CscDigitToCscRDO, G4AtlasAlg, G4RunAlg, HGTD_Digitization, HiveAlgBase, InDet::GNNSeedingTrackMaker, InDet::SCT_Clusterization, InDet::SiSPGNNTrackMaker, InDet::SiSPSeededTrackFinder, InDet::SiTrackerSpacePointFinder, ISF::SimKernelMT, ITk::StripDigitization, ITkPixelCablingAlg, ITkStripCablingAlg, LArHitEMapMaker, LArTTL1Maker, LUCID_DigiTop, LVL1::L1TopoSimulation, MergeCalibHits, MergeGenericMuonSimHitColl, MergeHijingPars, MergeMcEventCollection, MergeTrackRecordCollection, MergeTruthJets, MergeTruthParticles, MuonDigitizer, PileUpMTAlg, PixelDigitization, RoIBResultToxAOD, SCT_ByteStreamErrorsTestAlg, SCT_CablingCondAlgFromCoraCool, SCT_CablingCondAlgFromText, SCT_ConditionsParameterTestAlg, SCT_ConditionsSummaryTestAlg, SCT_ConfigurationConditionsTestAlg, SCT_Digitization, SCT_FlaggedConditionTestAlg, SCT_LinkMaskingTestAlg, SCT_MajorityConditionsTestAlg, SCT_ModuleVetoTestAlg, SCT_MonitorConditionsTestAlg, SCT_PrepDataToxAOD, SCT_RawDataToxAOD, SCT_ReadCalibChipDataTestAlg, SCT_ReadCalibDataTestAlg, SCT_RODVetoTestAlg, SCT_SensorsTestAlg, SCT_SiliconConditionsTestAlg, SCT_StripVetoTestAlg, SCT_TdaqEnabledTestAlg, SCT_TestCablingAlg, SCTEventFlagWriter, SCTRawDataProvider, SCTSiLorentzAngleTestAlg, SCTSiPropertiesTestAlg, SGInputLoader, Simulation::BeamEffectsAlg, TileHitVecToCnt, TileMuonFitter, TilePulseForTileMuonReceiver, TileRawChannelMaker, TRTDigitization, and ZDC_DigiTop.

Definition at line 68 of file AthCommonAlgorithm.h.

68 {
69 return true;
70 }

◆ msg()

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

Definition at line 24 of file AthCommonMsg.h.

24 {
25 return this->msgStream();
26 }

◆ msgLvl()

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

Definition at line 30 of file AthCommonMsg.h.

30 {
31 return this->msgLevel(lvl);
32 }

◆ 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 368 of file AthCommonDataStore.h.

369 {
370 h.renounce();
372 }
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)

◆ renounceArray()

void AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >::renounceArray ( SG::VarHandleKeyArray & handlesArray)
inlineprotectedinherited

remove all handles from I/O resolution

Definition at line 352 of file AthCommonDataStore.h.

352 {
354 }

◆ setFilterPassed()

virtual void AthCommonAlgorithm< Gaudi::Algorithm >::setFilterPassed ( bool state,
const EventContext & ctx ) const
inlinevirtualinherited

Set filter decision:

Definition at line 99 of file AthCommonAlgorithm.h.

99 {
101 }

◆ sysExecute()

StatusCode AthCommonAlgorithm< Gaudi::Algorithm >::sysExecute ( const EventContext & ctx)
overridevirtualinherited

Execute an algorithm.

We override this in order to work around an issue with the Algorithm base class storing the event context in a member variable that can cause crashes in MT jobs.

Reimplemented in AthAnalysisAlgorithm.

Definition at line 80 of file AthCommonAlgorithm.cxx.

41{
42 return BaseAlg::sysExecute (ctx);
43}

◆ sysInitialize()

StatusCode AthCommonAlgorithm< Gaudi::Algorithm >::sysInitialize ( )
overridevirtualinherited

Override sysInitialize.

Override sysInitialize from the base class.

Loop through all output handles, and if they're WriteCondHandles, automatically register them and this Algorithm with the CondSvc

Scan through all outputHandles, and if they're WriteCondHandles, register them with the CondSvc

Reimplemented from AthCommonDataStore< AthCommonMsg< Gaudi::Algorithm > >.

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

Definition at line 60 of file AthCommonAlgorithm.cxx.

71 {
73
74 if (sc.isFailure()) {
75 return sc;
76 }
77
78 ServiceHandle<ICondSvc> cs("CondSvc",name());
79 for (auto h : outputHandles()) {
80 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
81 // do this inside the loop so we don't create the CondSvc until needed
82 if ( cs.retrieve().isFailure() ) {
83 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
85 }
86 if (cs->regHandle(this,*h).isFailure()) {
88 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
89 << " with CondSvc");
90 }
91 }
92 }
93 return sc;
94}
#define ATH_MSG_ERROR(x,...)
#define ATH_MSG_WARNING(x,...)
virtual StatusCode sysInitialize() override
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override

◆ 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 298 of file AthCommonDataStore.h.

298 {
299 for (auto &a : m_vhka) {
301 for (auto k : keys) {
302 k->setOwner(this);
303 }
304 }
305 }

Member Data Documentation

◆ m_detStore

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

Pointer to StoreGate (detector store by default).

Definition at line 381 of file AthCommonDataStore.h.

◆ m_doNNFilter

int GepCellTowerAlg::m_doNNFilter
private

Definition at line 34 of file GepCellTowerAlg.h.

◆ m_evtStore

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

Pointer to StoreGate (event store by default).

Definition at line 378 of file AthCommonDataStore.h.

◆ m_extendedExtraObjects

DataObjIDColl AthCommonAlgorithm< Gaudi::Algorithm >::m_extendedExtraObjects
privateinherited

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

Empty if no symlinks were found.

Definition at line 108 of file AthCommonAlgorithm.h.

◆ m_gepCellsKey

SG::ReadHandleKey<Gep::GepCellMap> GepCellTowerAlg::m_gepCellsKey
private
Initial value:
{
this, "gepCellMapKey", "GepCells", "Key to get the correct cell map"}

Definition at line 30 of file GepCellTowerAlg.h.

30 {
31 this, "gepCellMapKey", "GepCells", "Key to get the correct cell map"};

◆ m_minEt

float GepCellTowerAlg::m_minEt
private

Definition at line 33 of file GepCellTowerAlg.h.

◆ m_outputCellTowerKey

SG::WriteHandleKey<xAOD::CaloClusterContainer> GepCellTowerAlg::m_outputCellTowerKey
private
Initial value:
{
this, "outputCellTowerKey", "",
"key for CaloCluster wrappers for GepClusters"}

Definition at line 26 of file GepCellTowerAlg.h.

26 {
27 this, "outputCellTowerKey", "",
28 "key for CaloCluster wrappers for GepClusters"};

◆ m_varHandleArraysDeclared

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

Definition at line 387 of file AthCommonDataStore.h.

◆ m_vhka

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

Definition at line 386 of file AthCommonDataStore.h.


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