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

Select topo-clusters to be used in egamma reconstruction. More...

#include <egammaTopoClusterCopier.h>

Inheritance diagram for egammaTopoClusterCopier:
Collaboration diagram for egammaTopoClusterCopier:

Public Member Functions

 egammaTopoClusterCopier (const std::string &name, ISvcLocator *pSvcLocator)
virtual StatusCode initialize () override final
virtual StatusCode execute (const EventContext &ctx) const override final
virtual StatusCode finalize () override final
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

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::CaloClusterContainerm_inputTopoCollection
SG::WriteHandleKey< xAOD::CaloClusterContainerm_outputTopoCollectionShallow
SG::WriteHandleKey< ConstDataVector< xAOD::CaloClusterContainer > > m_outputTopoCollection
SG::WriteHandleKey< ConstDataVector< xAOD::CaloClusterContainer > > m_outputFwdTopoCollection
Gaudi::Property< float > m_etaCut
Gaudi::Property< double > m_fwdEtaCut
Gaudi::Property< float > m_ECut
Gaudi::Property< double > m_fwdETCut
Gaudi::Property< float > m_EMFracCut
Gaudi::Property< bool > m_hasITk
 Private member flag to do the track matching.
bool m_doForwardClusters = false
 Private member flag to copy forward clusters.
Gaudi::Accumulators::Counter m_AllClusters {}
Gaudi::Accumulators::Counter m_CentralPassPreSelection {}
Gaudi::Accumulators::Counter m_CentralPassSelection {}
Gaudi::Accumulators::Counter m_FwdPassPreSelection {}
Gaudi::Accumulators::Counter m_FwdPassSelection {}
Gaudi::Accumulators::Counter m_SharedPassPreSelection {}
Gaudi::Accumulators::Counter m_SharedPassSelection {}
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

Select topo-clusters to be used in egamma reconstruction.

This algorithm is the first step in egamma reconstruction. It selects topoclusters and decorate them with the EM fraction. The input and output containers are collections of xAOD::CaloCluster.

  • Input container: input clusters
  • Output container: view of decorated selected clusters
  • Output container: shallow copy of decorated clusters of the input container

The algorithm computes a custom version of the EM fraction defined as the sum of the energy of the presampler, three accordion layers and the energy in the tile-gap divided by the total energy of the cluster. The computation is done only for cluster passing the preselection (|eta| and minimum EM energy). Otherwise a value of 0 is used. The value is used to decorate the clusters with "EMFraction" decoration.

The selection is based on:

  • maximum |eta| of selected clusters
  • minimum EM energy of selected clusters
  • mimimum EM fraction of selected clusters

Definition at line 42 of file egammaTopoClusterCopier.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

◆ egammaTopoClusterCopier()

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

Definition at line 89 of file egammaTopoClusterCopier.cxx.

90 :
91 AthReentrantAlgorithm(name, pSvcLocator)
92{ }

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.

62{
63 return 0;
64}

◆ 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 egammaTopoClusterCopier::execute ( const EventContext & ctx) const
finaloverridevirtual

Definition at line 125 of file egammaTopoClusterCopier.cxx.

125 {
126 SG::ReadHandle<xAOD::CaloClusterContainer> inputTopoclusters(m_inputTopoCollection, ctx);
127 SG::WriteHandle<xAOD::CaloClusterContainer> outputTopoclustersShallow(m_outputTopoCollectionShallow, ctx);
128 SG::WriteHandle<ConstDataVector<xAOD::CaloClusterContainer>> outputTopoclusters(m_outputTopoCollection, ctx);
129
130 // Create a shallow copy, the elements of this can be modified, but no need to
131 // recreate the cluster.
133 xAOD::shallowCopy(*inputTopoclusters, ctx);
134
135 ATH_CHECK(outputTopoclustersShallow.record(
136 std::move(inputShallowcopy.first),
137 std::move(inputShallowcopy.second)
138 ));
139
140 // Here it just needs to be a view copy, i.e the collection we create does not
141 // really own its elements.
142 auto viewCopy = std::make_unique<ConstDataVector<xAOD::CaloClusterContainer>>(SG::VIEW_ELEMENTS);
143
144 // Declare and conditionally initialise forward cluster objects.
145 SG::WriteHandle<ConstDataVector<xAOD::CaloClusterContainer>> outputFwdTopoclusters;
146 std::unique_ptr<ConstDataVector<xAOD::CaloClusterContainer>> fwdViewCopy;
147
149 outputFwdTopoclusters = SG::WriteHandle<ConstDataVector<xAOD::CaloClusterContainer>>(
151 ctx
152 );
153
154 fwdViewCopy = std::make_unique<ConstDataVector<xAOD::CaloClusterContainer>>(SG::VIEW_ELEMENTS);
155 }
156
157 auto buff_AllClusters = m_AllClusters.buffer();
158 auto buff_CentralPassPreSelection = m_CentralPassPreSelection.buffer();
159 auto buff_CentralPassSelection = m_CentralPassSelection.buffer();
160 auto buff_FwdPassPreSelection = m_FwdPassPreSelection.buffer();
161 auto buff_FwdPassSelection = m_FwdPassSelection.buffer();
162 auto buff_SharedPassPreSelection = m_SharedPassPreSelection.buffer();
163 auto buff_SharedPassSelection = m_SharedPassSelection.buffer();
164
165 // Loop over the output shallow copy.
166 for (xAOD::CaloCluster* clus : *outputTopoclustersShallow) {
168 "->CHECKING Cluster at eta,phi,et " <<
169 clus->eta() << " , " <<
170 clus->phi() << " , " <<
171 clus->et()
172 );
173
174 ++buff_AllClusters;
175 s_acc_emfraction(*clus) = 0.0; // Always decorate
176
177 const double clusterE = clus->e();
178 const double aeta = std::abs(clus->eta());
179
180 const bool valid_for_central = checkIfValidForCentral(aeta, m_etaCut, clusterE, m_ECut);
181 const bool valid_for_fwd = checkIfValidForFwd(aeta, m_fwdEtaCut, m_fwdETCut, clus, m_doForwardClusters, m_hasITk);
182 if (valid_for_central) {
183 ++buff_CentralPassPreSelection;
184 } else if (valid_for_fwd) {
185 ++buff_FwdPassPreSelection;
186 } else {
187 continue;
188 }
189
190 const bool valid_for_both = valid_for_central && valid_for_fwd;
191 if (valid_for_both) {
192 ++buff_FwdPassPreSelection; // since we count them only in the else above
193 ++buff_SharedPassPreSelection;
194 }
195
196 if (!m_hasITk && m_doForwardClusters && valid_for_fwd) {
197 fwdViewCopy->push_back(clus->getSisterCluster());
198 ++buff_FwdPassSelection;
199 }
200
201 // Add the relevant TileGap3/E4 cells.
202 double eg_tilegap = 0;
203 if (valid_for_central) {
204 if (aeta > 1.35 && aeta < 1.65 && clusterE > 0) {
205 eg_tilegap += addTileGapCellsEnergy(clus);
206 }
207 }
208
209 const double emfrac= (clus->energyBE(0) + clus->energyBE(1) +
210 clus->energyBE(2) + clus->energyBE(3) + eg_tilegap) / clusterE;
211
212 s_acc_emfraction(*clus) = emfrac;
213 if ((emfrac > m_EMFracCut && (clusterE * emfrac) > m_ECut) || xAOD::EgammaHelpers::isFCAL(clus)) {
215 "-->Selected Cluster at eta,phi,et,EMFraction " << clus->eta() <<
216 " , " << clus->phi() <<
217 " , " << clus->et() <<
218 " , " << emfrac
219 );
220
221 if (valid_for_central) {
222 viewCopy->push_back(clus);
223 ++buff_CentralPassSelection;
224 }
225
226 if (m_hasITk && valid_for_fwd) {
227 fwdViewCopy->push_back(clus);
228 ++buff_FwdPassSelection;
229 }
230
231 if (valid_for_both) {
232 ++buff_SharedPassSelection;
233 }
234 }
235 } // End loop on clusters.
236
237 // Sort in descenting em energy.
238 std::sort(viewCopy->begin(), viewCopy->end(), greater);
239
241 "Cloned container has size: " << viewCopy->size() <<
242 " selected out of : " << inputTopoclusters->size()
243 );
244
245 ATH_CHECK(outputTopoclusters.record(std::move(viewCopy)));
246
248 if (m_hasITk) {
249 std::sort(fwdViewCopy->begin(), fwdViewCopy->end(), greater);
250 }
251
253 "Cloned fwd container has size: " << fwdViewCopy->size() <<
254 " selected out of : " << inputTopoclusters->size()
255 );
256
257 ATH_CHECK(outputFwdTopoclusters.record(std::move(fwdViewCopy)));
258 }
259
260 return StatusCode::SUCCESS;
261}
#define ATH_CHECK
Evaluate an expression and check for errors.
#define ATH_MSG_DEBUG(x)
Gaudi::Accumulators::Counter m_FwdPassPreSelection
SG::WriteHandleKey< ConstDataVector< xAOD::CaloClusterContainer > > m_outputFwdTopoCollection
Gaudi::Accumulators::Counter m_AllClusters
Gaudi::Property< float > m_etaCut
Gaudi::Accumulators::Counter m_SharedPassSelection
SG::ReadHandleKey< xAOD::CaloClusterContainer > m_inputTopoCollection
bool m_doForwardClusters
Private member flag to copy forward clusters.
Gaudi::Property< double > m_fwdETCut
Gaudi::Accumulators::Counter m_SharedPassPreSelection
Gaudi::Property< bool > m_hasITk
Private member flag to do the track matching.
SG::WriteHandleKey< xAOD::CaloClusterContainer > m_outputTopoCollectionShallow
Gaudi::Accumulators::Counter m_CentralPassPreSelection
Gaudi::Accumulators::Counter m_FwdPassSelection
SG::WriteHandleKey< ConstDataVector< xAOD::CaloClusterContainer > > m_outputTopoCollection
Gaudi::Property< double > m_fwdEtaCut
Gaudi::Accumulators::Counter m_CentralPassSelection
Gaudi::Property< float > m_ECut
Gaudi::Property< float > m_EMFracCut
@ VIEW_ELEMENTS
this data object is a view, it does not own its elmts
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.
bool isFCAL(const xAOD::CaloCluster *cluster)
return true if the cluster (or the majority of its energy) is in the FCAL0
typename ShallowCopyResult< T >::type ShallowCopyResult_t
Return type of xAOD::shallowCopy.
Definition ShallowCopy.h:68
CaloCluster_v1 CaloCluster
Define the latest version of the calorimeter cluster class.
ShallowCopyResult_t< T > shallowCopy(const T &cont, const EventContext &ctx)
Create a shallow copy of an existing container.

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

88{
89 // If we didn't find any symlinks to add, just return the collection
90 // from the base class. Otherwise, return the extended collection.
91 if (!m_extendedExtraObjects.empty()) {
93 }
95}
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

◆ finalize()

StatusCode egammaTopoClusterCopier::finalize ( )
finaloverridevirtual

Definition at line 111 of file egammaTopoClusterCopier.cxx.

111 {
112 ATH_MSG_INFO("=====> Selected Topo cluster statistics ===========");
113 ATH_MSG_INFO(" All Clusters " << m_AllClusters );
114 ATH_MSG_INFO(" Central: Pass Preselection Clusters " << m_CentralPassPreSelection );
115 ATH_MSG_INFO(" Fwd: Pass Preselection Clusters " << m_FwdPassPreSelection );
116 ATH_MSG_INFO(" Shared: Pass Preselection Clusters " << m_SharedPassPreSelection );
117 ATH_MSG_INFO(" Central: Pass Selection " << m_CentralPassSelection );
118 ATH_MSG_INFO(" Fwd: Pass Selection " << m_FwdPassSelection );
119 ATH_MSG_INFO(" Shared: Pass Selection " << m_SharedPassSelection );
120 ATH_MSG_INFO("===================================================");
121
122 return StatusCode::SUCCESS;
123}
#define ATH_MSG_INFO(x)

◆ initialize()

StatusCode egammaTopoClusterCopier::initialize ( )
finaloverridevirtual

Definition at line 94 of file egammaTopoClusterCopier.cxx.

94 {
95 ATH_MSG_DEBUG("Initializing " << name() << "...");
96
97 ATH_CHECK(m_inputTopoCollection.initialize());
99
102
105
106 ATH_MSG_DEBUG("Initialization successful");
107
108 return StatusCode::SUCCESS;
109}

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

75{
76 return BaseAlg::sysExecute (ctx);
77}

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

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

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_AllClusters {}
mutableprivate

Definition at line 128 of file egammaTopoClusterCopier.h.

128{};

◆ m_CentralPassPreSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_CentralPassPreSelection {}
mutableprivate

Definition at line 129 of file egammaTopoClusterCopier.h.

129{};

◆ m_CentralPassSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_CentralPassSelection {}
mutableprivate

Definition at line 130 of file egammaTopoClusterCopier.h.

130{};

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

bool egammaTopoClusterCopier::m_doForwardClusters = false
private

Private member flag to copy forward clusters.

Definition at line 126 of file egammaTopoClusterCopier.h.

◆ m_ECut

Gaudi::Property<float> egammaTopoClusterCopier::m_ECut
private
Initial value:
{
this,
"ECut",
700,
"minimum EM energy of selected clusters"
}

Definition at line 96 of file egammaTopoClusterCopier.h.

96 {
97 this,
98 "ECut",
99 700,
100 "minimum EM energy of selected clusters"
101 };

◆ m_EMFracCut

Gaudi::Property<float> egammaTopoClusterCopier::m_EMFracCut
private
Initial value:
{
this,
"EMFracCut",
0.5,
"mimimum EM fraction of selected clusters"
}

Definition at line 110 of file egammaTopoClusterCopier.h.

110 {
111 this,
112 "EMFracCut",
113 0.5,
114 "mimimum EM fraction of selected clusters"
115 };

◆ m_etaCut

Gaudi::Property<float> egammaTopoClusterCopier::m_etaCut
private
Initial value:
{
this,
"EtaCut",
2.6,
"maximum |eta| of selected clusters"
}

Definition at line 82 of file egammaTopoClusterCopier.h.

82 {
83 this,
84 "EtaCut",
85 2.6,
86 "maximum |eta| of selected clusters"
87 };

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

Gaudi::Property<double> egammaTopoClusterCopier::m_fwdEtaCut
private
Initial value:
{
this,
"fwdEtaCut",
2.5,
"minimum |eta| of selected fwd clusters"
}

Definition at line 89 of file egammaTopoClusterCopier.h.

89 {
90 this,
91 "fwdEtaCut",
92 2.5,
93 "minimum |eta| of selected fwd clusters"
94 };

◆ m_fwdETCut

Gaudi::Property<double> egammaTopoClusterCopier::m_fwdETCut
private
Initial value:
{
this,
"fwdETCut",
5. * Gaudi::Units::GeV,
"Fwd ET cut"
}

Definition at line 103 of file egammaTopoClusterCopier.h.

103 {
104 this,
105 "fwdETCut",
106 5. * Gaudi::Units::GeV,
107 "Fwd ET cut"
108 };

◆ m_FwdPassPreSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_FwdPassPreSelection {}
mutableprivate

Definition at line 131 of file egammaTopoClusterCopier.h.

131{};

◆ m_FwdPassSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_FwdPassSelection {}
mutableprivate

Definition at line 132 of file egammaTopoClusterCopier.h.

132{};

◆ m_hasITk

Gaudi::Property<bool> egammaTopoClusterCopier::m_hasITk
private
Initial value:
{
this,
"hasITk",
false,
"Boolean to do track matching"
}

Private member flag to do the track matching.

Definition at line 118 of file egammaTopoClusterCopier.h.

118 {
119 this,
120 "hasITk",
121 false,
122 "Boolean to do track matching"
123 };

◆ m_inputTopoCollection

SG::ReadHandleKey<xAOD::CaloClusterContainer> egammaTopoClusterCopier::m_inputTopoCollection
private
Initial value:
{
this,
"InputTopoCollection",
"CaloTopoClusters",
"input topocluster collection"
}

Definition at line 54 of file egammaTopoClusterCopier.h.

54 {
55 this,
56 "InputTopoCollection",
57 "CaloTopoClusters",
58 "input topocluster collection"
59 };

◆ m_outputFwdTopoCollection

SG::WriteHandleKey<ConstDataVector<xAOD::CaloClusterContainer> > egammaTopoClusterCopier::m_outputFwdTopoCollection
private
Initial value:
{
this,
"OutputFwdTopoCollection",
"",
"View container of selected fwd topoclusters"
}

Definition at line 75 of file egammaTopoClusterCopier.h.

75 {
76 this,
77 "OutputFwdTopoCollection",
78 "",
79 "View container of selected fwd topoclusters"
80 };

◆ m_outputTopoCollection

SG::WriteHandleKey<ConstDataVector<xAOD::CaloClusterContainer> > egammaTopoClusterCopier::m_outputTopoCollection
private
Initial value:
{
this,
"OutputTopoCollection",
"egammaTopoCluster",
"View container of selected topoclusters"
}

Definition at line 68 of file egammaTopoClusterCopier.h.

68 {
69 this,
70 "OutputTopoCollection",
71 "egammaTopoCluster",
72 "View container of selected topoclusters"
73 };

◆ m_outputTopoCollectionShallow

SG::WriteHandleKey<xAOD::CaloClusterContainer> egammaTopoClusterCopier::m_outputTopoCollectionShallow
private
Initial value:
{
this,
"TopoShallow_doNotConfig",
"",
"Shallow copy of input collection that allows properties to be modified"
}

Definition at line 61 of file egammaTopoClusterCopier.h.

61 {
62 this,
63 "TopoShallow_doNotConfig",
64 "",
65 "Shallow copy of input collection that allows properties to be modified"
66 };

◆ m_SharedPassPreSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_SharedPassPreSelection {}
mutableprivate

Definition at line 133 of file egammaTopoClusterCopier.h.

133{};

◆ m_SharedPassSelection

Gaudi::Accumulators::Counter egammaTopoClusterCopier::m_SharedPassSelection {}
mutableprivate

Definition at line 134 of file egammaTopoClusterCopier.h.

134{};

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