ATLAS Offline Software
Loading...
Searching...
No Matches
GlobalSim::Egamma1_LArStrip_Fex_RowAware Class Reference

#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< StoreGateSvcStoreGateSvc_t

Private Member Functions

StatusCode findNeighborhoods_RowAware (const std::vector< const xAOD::eFexEMRoI * > &, const std::vector< const CaloCell * > &, IOBitwise::eEmNbhoodTOBContainer &, const CaloNoise &) const
StatusCode findNeighborhood_RowAware (const xAOD::eFexEMRoI *, const std::vector< const CaloCell * > &, IOBitwise::eEmNbhoodTOBContainer &, const CaloNoise &) 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::EventInfom_eventInfoKey
ToolHandle< ICaloCellsProducerm_cellProducer
ToolHandle< eFexRoIAlgToolm_roiAlgTool
SG::ReadCondHandleKey< CaloNoisem_totalNoiseKey
 Key to the total noise used for each CaloCell.
Gaudi::Property< bool > m_dump
Gaudi::Property< bool > m_dumpTerse
SG::WriteHandleKey< IOBitwise::eEmNbhoodTOBContainerm_neighKey
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 30 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.

46 :
47 AthReentrantAlgorithm(name, pSvcLocator){
48 }

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.

64{
65 return 0;
66}

◆ 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 }
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)

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

Definition at line 64 of file Egamma1_LArStrip_Fex_RowAware.cxx.

64 {
65 // Read in a CaloCell container. Ask producers to create
66 // vectors of CaloCells to be examined.
67
68 ATH_MSG_DEBUG ("Executing");
69
70 SG::ReadHandle<xAOD::EventInfo> eventInfo(m_eventInfoKey, ctx);
71 if(!eventInfo.isValid()) {
72 ATH_MSG_ERROR ("Error obtaining EventInfo object");
73 return StatusCode::FAILURE;
74 }
75
76 SG::ReadCondHandle<CaloNoise> totalNoiseHdl{m_totalNoiseKey, ctx};
77 if (!totalNoiseHdl.isValid()) {return StatusCode::FAILURE;}
78 const CaloNoise* totalNoiseCDO = *totalNoiseHdl;
79
80 std::vector<const CaloCell*> cells;
81 CHECK(m_cellProducer->cells(cells, ctx));
82 ATH_MSG_DEBUG(cells.size() <<"Cells read in");
83
84 std::vector<const xAOD::eFexEMRoI*> rois;
85 CHECK(m_roiAlgTool->RoIs(rois, ctx));
86 ATH_MSG_DEBUG(rois.size() << " RoI(s) read in");
87
88 // find cells in the neighborhood of RoIs.
89 // A neighborhood is a collection of CellData objects which
90 // contain cell eta, phi and Et.
91
92 auto neighborhoodTOBs = std::make_unique<IOBitwise::eEmNbhoodTOBContainer>();
93
94 CHECK(findNeighborhoods_RowAware(rois, cells, *neighborhoodTOBs, *totalNoiseCDO));
95
96 SG::WriteHandle<GlobalSim::IOBitwise::eEmNbhoodTOBContainer> h_neighborhoodTOBs(m_neighKey, ctx);
97
98 auto dumper = GlobalSim::LArStripNeighborhoodDumper();
99 if(m_dump || m_dumpTerse){
100 if (m_dump) {
101 CHECK(dumper.dump(name(), *eventInfo, *neighborhoodTOBs));
102 }
103
104 if (m_dumpTerse) {
105 CHECK(dumper.dumpTerse(name(), *eventInfo, *neighborhoodTOBs));
106 }
107 }
108
109 CHECK(h_neighborhoodTOBs.record(std::move(neighborhoodTOBs)));
110
111 return StatusCode::SUCCESS;
112 }
#define ATH_MSG_ERROR(x)
#define ATH_MSG_DEBUG(x)
#define CHECK(...)
Evaluate an expression and check for errors.
SG::ReadCondHandleKey< CaloNoise > m_totalNoiseKey
Key to the total noise used for each CaloCell.
SG::WriteHandleKey< IOBitwise::eEmNbhoodTOBContainer > m_neighKey
StatusCode findNeighborhoods_RowAware(const std::vector< const xAOD::eFexEMRoI * > &, const std::vector< const CaloCell * > &, IOBitwise::eEmNbhoodTOBContainer &, const CaloNoise &) const
SG::ReadHandleKey< xAOD::EventInfo > m_eventInfoKey

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

90{
91 // If we didn't find any symlinks to add, just return the collection
92 // from the base class. Otherwise, return the extended collection.
93 if (!m_extendedExtraObjects.empty()) {
95 }
97}
An algorithm that can be simultaneously executed in multiple threads.

◆ filterPassed()

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

Definition at line 96 of file AthCommonReentrantAlgorithm.h.

96 {
97 return execState( ctx ).filterPassed();
98 }
virtual bool filterPassed(const EventContext &ctx) const

◆ 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,
const CaloNoise & noise ) const
private

Definition at line 132 of file Egamma1_LArStrip_Fex_RowAware.cxx.

135 {
136
137 // this member function constructs an LArStripNeighborhood.
138 //
139 // A neighourhood is constructed from StripData objects constructed
140 // from CalCells (strips) in the vicinity of an EM RoI the following manner:
141 //
142 // - the cell in the vicinity of the RoI is identified. The neighboorhood
143 // strips are the strups centered on the maximum energy strip.
144 //
145 // In more detail:
146 // A rectangular eta-phi subset of all strips is made.
147 // This subset constains the cells needed for the maximum energy search
148 // and for any subsequent neigborhood strip selection.
149 //
150 // The eta window for the initial selection ismade with half-width of
151 // 0.05 + 8.5* DeltaEta where DeltaEta = 0.003125, the nominal strip width
152 // in eta. A cut-oof off eta = +-1.4 is applied in the selection.
153 //
154 // Phi selection consists of calculating a phi index for the the RoI,
155 // then requiring selected strips to be have a phi indix within +=1 of
156 // the RoI phi index.
157 //
158 // The strips used to identigy the max energy strip the are within +-1 of the
159 // as the phi index of the RoI, and eta that lies within 0.1 in eta to the RoI.
160 //
161 // The strips selected for the Neighborhood have eta within +- 8.5 DeltaEta
162 // of the max energy strip, and +- 1 of the max RoI strip phi Index.
163
164 auto cells_near_roi = std::vector<const CaloCell*>();
165
166 ATH_MSG_DEBUG("roi eta " << roi->eta() << " phi " << roi->phi());
167
168 // lambda function to calculate the phi index of a eta-phi point
169 auto phi_ind = [](const auto& c) {
170 constexpr double dphi = std::numbers::pi/32;
171 std::size_t iphi = 32 + int(std::floor(c->phi()/dphi));
172 return iphi > 63 ?
173 std::optional<std::size_t>() : std::make_optional(iphi);
174 };
175
176 const std::optional<std::size_t> roi_phi_index_opt = phi_ind(roi);
177 if (not roi_phi_index_opt.has_value()) {
178 return StatusCode::FAILURE;
179 }
180 const std::size_t roi_phi_index = *roi_phi_index_opt;
181
182 // obtain adjacent phi indices
183 auto roi_phi_indices = *wrap5(roi_phi_index);
184
185 // container for strips close to RoI in eta
186 auto close = std::deque<std::vector<const CaloCell*>>(5);
187 for (auto& v :close) {v.reserve(100);}
188
189 //One ROI is 0.1 wide in eta, this is the half width
190 constexpr double half_deta_roi{0.05};
191 //One cell in the barrel is 0.003125, this is the half width of the 17 cell window
192 constexpr double half_deta_neigh{8.5*0.003125};
193 //To define the ±eta limit of our window, we need to sum the above
194 constexpr double half_deta_fid{half_deta_roi + half_deta_neigh};
195
196
197 double etalim_low = std::max(roi->eta()-half_deta_fid, -1.4);
198 double etalim_high = std::min(roi->eta()+half_deta_fid, 1.4);
199
200
201 // double loop. outer: all strips. inner: adjacent roi indices.
202 for (const auto& cell : cells) {
203 auto icell = *phi_ind(cell);
204 std::size_t pos{0};
205 for(const auto& iroi : roi_phi_indices) {
206 auto c_eta = cell->eta();
207 if (iroi == icell and c_eta >= etalim_low and c_eta < etalim_high) {
208 float totalNoise = noise.getNoise(cell->ID(), cell->gain());
209 if(totalNoise <= 0.0) totalNoise = 0.001;
210 float sigma = cell->energy() / totalNoise;
211 if(sigma >= 2){
212 close[pos].push_back(cell);
213 } else {
214 close[pos].push_back(new CaloCell(cell->caloDDE(), 0.0, cell->time(), cell->quality(), cell->provenance(), cell->gain()));
215 }
216 break;
217 }
218 ++pos;
219 }
220 }
221
222 // select the cells within a a tower width of the RoI. Then find the
223 // cell in this selction with the highest energy
224 auto roi_cells = std::deque<std::vector<const CaloCell*>>(5);
225 auto roi_max_it = std::vector<std::vector<const CaloCell*>::iterator>();
226
227 for (std::size_t i{0ul}; i != close.size(); ++i) {
228 roi_cells[i].reserve(close[i].size());
229 std::copy_if(std::begin(close[i]),
230 std::end(close[i]),
231 std::back_inserter(roi_cells[i]),
232 [&roi](const auto& c) {
233 return std::abs(c->eta() - roi->eta()) < half_deta_roi;
234 });
235 //Work out where the max is in the central block.
236 if(i > 0 && i < 4){
237 auto it = std::max_element(std::begin(roi_cells[i]),
238 std::end(roi_cells[i]),
239 [](const auto& l,const auto& r) {
240 return l->e() < r->e();
241 });
242 ATH_MSG_DEBUG("max cell row "
243 << i << " position "
244 << std::distance(std::begin(roi_cells[i]), it)
245 << " :" << **it);
246 roi_max_it.push_back(it);
247 }
248 }
249
250 auto max_row = std::max_element(std::begin(roi_max_it),
251 std::end(roi_max_it),
252 [](const auto& l,const auto& r) {
253 return (*l)->e() < (*r)->e();
254 });
255
256 int max_row_pos = std::distance( roi_max_it.begin(), max_row );
257
258 ATH_MSG_DEBUG("max cell row "
259 << ' ' << std::distance( roi_max_it.begin(), max_row )+1);
260
261 //If the maximum is not in the centre row, we need to re-seed
262 switch(max_row_pos)
263 {
264 case 0:
265 {
266 close.pop_back();
267 close.pop_back();
268 break;
269 }
270 case 1:
271 {
272 close.pop_front();
273 close.pop_back();
274 break;
275 }
276 case 2:
277 {
278 close.pop_front();
279 close.pop_front();
280 break;
281 }
282 }
283
284 ATH_MSG_DEBUG("popped ");
285
286 // set up Cell containers for the neighborhood. One container
287 // per adjacent RoI phi indices.
288 auto neigh_cells = std::vector<std::vector<const CaloCell*>>(3);
289
290 const CaloCell* max_cell{*(*max_row)};
291 const auto max_cell_eta = max_cell->eta();
292
293 ATH_MSG_DEBUG("Got the max cell");
294
295 for (std::size_t iv{0ul}; iv != close.size(); ++iv) {
296 std::copy_if(std::begin(close[iv]),
297 std::end(close[iv]),
298 std::back_inserter(neigh_cells[iv]),
299 [&max_cell_eta, &half_deta_neigh](const auto& c){
300 return abs(c->eta()-max_cell_eta) < half_deta_neigh;
301 });
302 }
303
304 ATH_MSG_DEBUG("Made our neighbourhood");
305
306 auto max_neigh_cell_it = std::find(std::begin(neigh_cells[1]),
307 std::end(neigh_cells[1]),
308 max_cell);
309 if (max_neigh_cell_it == std::end(neigh_cells[1])){
310 ATH_MSG_ERROR("Lost the max cell");
311 return StatusCode::FAILURE;
312 }
313
314 auto max_neigh_cell_pos{std::distance(std::begin(neigh_cells[1]),
315 max_neigh_cell_it)};
316
317 ATH_MSG_DEBUG("Rediscovered our neighbourhood max");
318
319 auto toStripData = [](const auto& fromCells){
320 auto stripdata = std::vector<StripData>();
321 stripdata.reserve(fromCells.size());
322 std::transform(std::begin(fromCells),
323 std::end(fromCells),
324 back_inserter(stripdata),
325 [](const auto& c) {
326 return StripData(c->eta(),
327 c->phi(),
328 c->e());});
329 return stripdata;
330 };
331
332 auto low = toStripData(neigh_cells[0]);
333 auto center = toStripData(neigh_cells[1]);
334 auto high = toStripData(neigh_cells[2]);
335
336 Coords roi_c{roi->eta(), roi->phi()};
337 Coords cell_c{max_cell->eta(), max_cell->phi()};
338
339 ATH_MSG_DEBUG("Fill with strip data");
340
341 LArStripNeighborhood neighborhood = LArStripNeighborhood(low, center, high, roi_c, cell_c, max_neigh_cell_pos);
342
343 neighborhoodTOBs.push_back(std::make_unique<IOBitwise::eEmNbhoodTOB>(*roi, neighborhood));
344
345 return StatusCode::SUCCESS;
346 }
float eta() const
setter for the above
float phi() const
Seed supercell index within central tower (0 -> 3)
int r
Definition globals.cxx:22
std::optional< std::vector< std::size_t > > wrap5(std::size_t center)
std::pair< double, double > Coords
l
Printing final latex table to .tex output file.
unsigned long ul

◆ 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,
const CaloNoise & noise ) const
private

Definition at line 115 of file Egamma1_LArStrip_Fex_RowAware.cxx.

118 {
119
120 for (const auto& roi : rois) {
121 //kill low energy RoIs
122 if(roi->et() > 5000){ // MeV
123 CHECK(findNeighborhood_RowAware(roi, cells, neighborhoodTOBs, noise));
124 }
125 }
126
127 return StatusCode::SUCCESS;
128 }
StatusCode findNeighborhood_RowAware(const xAOD::eFexEMRoI *, const std::vector< const CaloCell * > &, IOBitwise::eEmNbhoodTOBContainer &, const CaloNoise &) const

◆ initialize()

StatusCode GlobalSim::Egamma1_LArStrip_Fex_RowAware::initialize ( )
overridevirtual

Definition at line 51 of file Egamma1_LArStrip_Fex_RowAware.cxx.

51 {
52 ATH_MSG_INFO ("Initializing " << name());
53
54 CHECK(m_cellProducer.retrieve());
55 CHECK(m_roiAlgTool.retrieve());
56 CHECK(m_totalNoiseKey.initialize());
57 CHECK(m_neighKey.initialize());
58 CHECK(m_eventInfoKey.initialize());
59
60 return StatusCode::SUCCESS;
61 }
#define ATH_MSG_INFO(x)

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

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

381 {
382 h.renounce();
384 }
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 364 of file AthCommonDataStore.h.

364 {
366 }

◆ setFilterPassed()

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

Definition at line 100 of file AthCommonReentrantAlgorithm.h.

100 {
102 }
virtual void setFilterPassed(bool state, const EventContext &ctx) const

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

77{
78 return BaseAlg::sysExecute (ctx);
79}

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

107 {
109
110 if (sc.isFailure()) {
111 return sc;
112 }
113
114 ServiceHandle<ICondSvc> cs("CondSvc",name());
115 for (auto h : outputHandles()) {
116 if (h->isCondition() && h->mode() == Gaudi::DataHandle::Writer) {
117 // do this inside the loop so we don't create the CondSvc until needed
118 if ( cs.retrieve().isFailure() ) {
119 ATH_MSG_WARNING("no CondSvc found: won't autoreg WriteCondHandles");
120 return StatusCode::SUCCESS;
121 }
122 if (cs->regHandle(this,*h).isFailure()) {
124 ATH_MSG_ERROR("unable to register WriteCondHandle " << h->fullKey()
125 << " with CondSvc");
126 }
127 }
128 }
129 return sc;
130}
#define ATH_MSG_WARNING(x)
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 308 of file AthCommonDataStore.h.

308 {
309 // debug() << "updateVHKA for property " << p.name() << " " << p.toString()
310 // << " size: " << m_vhka.size() << endmsg;
311 for (auto &a : m_vhka) {
313 for (auto k : keys) {
314 k->setOwner(this);
315 }
316 }
317 }

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 48 of file Egamma1_LArStrip_Fex_RowAware.h.

48 {this,
49 "caloCellProducer",
50 "EMB1CellFromCaloCells",
51 "AlgTool to provide a vector of CaloCells"
52 };

◆ 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 69 of file Egamma1_LArStrip_Fex_RowAware.h.

69 {
70 this,
71 "dump",
72 false,
73 "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 75 of file Egamma1_LArStrip_Fex_RowAware.h.

75 {
76 this,
77 "dumpTerse",
78 false,
79 "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 41 of file Egamma1_LArStrip_Fex_RowAware.h.

41 {
42 this,
43 "EventInfo",
44 "EventInfo",
45 "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 82 of file Egamma1_LArStrip_Fex_RowAware.h.

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

◆ 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 56 of file Egamma1_LArStrip_Fex_RowAware.h.

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

◆ m_totalNoiseKey

SG::ReadCondHandleKey<CaloNoise> GlobalSim::Egamma1_LArStrip_Fex_RowAware::m_totalNoiseKey
private
Initial value:
{
this,
"totalNoiseKey",
"totalNoise",
"SG Key of CaloNoise data object"}

Key to the total noise used for each CaloCell.

Definition at line 63 of file Egamma1_LArStrip_Fex_RowAware.h.

63 {
64 this,
65 "totalNoiseKey",
66 "totalNoise",
67 "SG Key of CaloNoise data object"};

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