#include <LArXTalkWeightCondAlg.h>
Inherits AthCondAlgorithm.
Inherited by LArXTalkWeightCondAlg_2strip, LArXTalkWeightCondAlg_2strip_ec, LArXTalkWeightCondAlg_middle1, LArXTalkWeightCondAlg_middle1_ec, LArXTalkWeightCondAlg_middle2, LArXTalkWeightCondAlg_middle2_ec, LArXTalkWeightCondAlg_middleback, LArXTalkWeightCondAlg_middleback_eciw, LArXTalkWeightCondAlg_middleback_ecow, LArXTalkWeightCondAlg_strip, LArXTalkWeightCondAlg_strip_ec, LArXTalkWeightCondAlg_stripmiddle, and LArXTalkWeightCondAlg_stripmiddle_ec.
|
| | LArXTalkWeightCondAlg (const std::string &name, ISvcLocator *pSvcLocator) |
| virtual | ~LArXTalkWeightCondAlg ()=default |
| virtual StatusCode | initialize () override |
| virtual StatusCode | execute (const EventContext &ctx) const override |
| virtual bool | isReEntrant () const override |
| | Avoid scheduling algorithm multiple times.
|
| 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 |
Definition at line 14 of file LArXTalkWeightCondAlg.h.
◆ StoreGateSvc_t
◆ LArXTalkWeightCondAlg()
| LArXTalkWeightCondAlg::LArXTalkWeightCondAlg |
( |
const std::string & | name, |
|
|
ISvcLocator * | pSvcLocator ) |
◆ ~LArXTalkWeightCondAlg()
| virtual LArXTalkWeightCondAlg::~LArXTalkWeightCondAlg |
( |
| ) |
|
|
virtualdefault |
◆ cardinality()
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.
◆ declareGaudiProperty()
specialization for handling Gaudi::Property<SG::VarHandleKey>
Definition at line 156 of file AthCommonDataStore.h.
158 {
161 hndl.documentation());
162
163 }
Gaudi::Details::PropertyBase & declareProperty(Gaudi::Property< T, V, H > &t)
◆ declareProperty()
Definition at line 145 of file AthCommonDataStore.h.
145 {
148 }
Gaudi::Details::PropertyBase & declareGaudiProperty(Gaudi::Property< T, V, H > &hndl, const SG::VarHandleKeyType &)
specialization for handling Gaudi::Property<SG::VarHandleKey>
◆ detStore()
◆ evtStore()
◆ execute()
| StatusCode LArXTalkWeightCondAlg::execute |
( |
const EventContext & | ctx | ) |
const |
|
overridevirtual |
Definition at line 16 of file LArXTalkWeightCondAlg.cxx.
16 {
17
19
20 SG::WriteCondHandle<LArXTalkWeight> writeHandle{
m_xtalkKey, ctx};
22 ATH_MSG_DEBUG(
"CondHandle " << writeHandle.
fullKey() <<
" is already valid.. In theory this should not be called, but may happen if multiple concurrent events are being processed out of order.");
23 return StatusCode::SUCCESS;
24 }
25
26 std::vector<int> endcap_case_table;
28 endcap_case_table.insert(endcap_case_table.end(),
31 }
34 if(writeHandle.
record(std::move(xtalk)).isFailure()) {
37 <<
" with EventRange " << writeHandle.
getRange()
38 << " into Conditions Store");
39 return StatusCode::FAILURE;
40 }
41
43 << writeHandle.
getRange() <<
" into Conditions Store");
44 return StatusCode::SUCCESS;
45
46}
static EventIDRange infiniteRunLB()
Produces an EventIDRange that is infinite in RunLumi and invalid in Time.
std::vector< float > m_xtalk_to_inject
std::vector< int > m_endcap_case_table
SG::WriteCondHandleKey< LArXTalkWeight > m_xtalkKey
const std::string & key() const
void addDependency(const EventIDRange &range)
const EventIDRange & getRange() const
StatusCode record(const EventIDRange &range, T *t)
record handle, with explicit range DEPRECATED
const DataObjID & fullKey() const
◆ extraDeps_update_handler()
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()
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
92
95 }
97}
An algorithm that can be simultaneously executed in multiple threads.
DataObjIDColl m_extendedExtraObjects
◆ filterPassed()
◆ initialize()
| StatusCode LArXTalkWeightCondAlg::initialize |
( |
| ) |
|
|
overridevirtual |
Definition at line 9 of file LArXTalkWeightCondAlg.cxx.
9 {
12 return StatusCode::SUCCESS;
13}
#define ATH_CHECK
Evaluate an expression and check for errors.
◆ inputHandles()
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()
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.
52{
53
54 return true;
55}
◆ isReEntrant()
| virtual bool AthCondAlgorithm::isReEntrant |
( |
| ) |
const |
|
inlineoverridevirtualinherited |
Avoid scheduling algorithm multiple times.
With multiple concurrent events, conditions objects often expire simultaneously for all slots. To avoid that the scheduler runs the CondAlg in each slot, we declare it as "non-reentrant". This ensures that the conditions objects are only created once.
In case a particular CondAlg should behave differently, it can override this method again and return true.
- See also
- ATEAM-836
Definition at line 39 of file AthCondAlgorithm.h.
◆ msg()
◆ msgLvl()
| bool AthCommonMsg< Gaudi::Algorithm >::msgLvl |
( |
const MSG::Level | lvl | ) |
const |
|
inlineinherited |
◆ outputHandles()
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 {
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()
◆ setFilterPassed()
◆ sysExecute()
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.
◆ sysInitialize()
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()) {
112 }
113
117
118 if (
cs.retrieve().isFailure() ) {
121 }
122 if (
cs->regHandle(
this,*
h).isFailure()) {
124 ATH_MSG_ERROR(
"unable to register WriteCondHandle " <<
h->fullKey()
125 << " with CondSvc");
126 }
127 }
128 }
130}
#define ATH_MSG_WARNING(x)
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override
virtual StatusCode sysInitialize() override
◆ sysStart()
Handle START transition.
We override this in order to make sure that conditions handle keys can cache a pointer to the conditions container.
◆ updateVHKA()
Definition at line 308 of file AthCommonDataStore.h.
308 {
309
310
313 for (
auto k :
keys) {
315 }
316 }
317 }
std::vector< SG::VarHandleKeyArray * > m_vhka
◆ m_detStore
◆ m_endcap_case_table
| std::vector<int> LArXTalkWeightCondAlg::m_endcap_case_table |
|
protected |
◆ m_evtStore
◆ m_extendedExtraObjects
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_varHandleArraysDeclared
◆ m_vhka
◆ m_xtalk_factor
| float LArXTalkWeightCondAlg::m_xtalk_factor = 0.0F |
|
protected |
◆ m_xtalk_to_inject
| std::vector<float> LArXTalkWeightCondAlg::m_xtalk_to_inject |
|
protected |
◆ m_xtalkKey
The documentation for this class was generated from the following files: