#include <PerfMonTestVectorAlg.h>
|
| Gaudi::Property< int > | m_vectorSize {this, "VectorSize", 1024*1024, "the size of the Hit container"} |
| | Property to setup the size of the Hit container.
|
| Gaudi::Property< int > | m_2bReserved {this, "ToBeReserved", 1024*1024, "the number of elements to be reserved"} |
| | Property to setup the amount of elements to reserve.
|
| Gaudi::Property< bool > | m_mapIt {this, "MapIt", false, "add current hit to a map"} |
| | Property to introduce some fragmentation.
|
| std::map< int, IHit * > | m_mixMap |
| DataObjIDColl | m_extendedExtraObjects |
| 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 |
Definition at line 17 of file PerfMonTestVectorAlg.h.
◆ StoreGateSvc_t
◆ AthAlgorithm()
| AthAlgorithm::AthAlgorithm |
( |
const std::string & | name, |
|
|
ISvcLocator * | pSvcLocator ) |
Standard Gaudi Constructor:
Definition at line 51 of file AthAlgorithm.cxx.
25 :
27{
28
29
30
31 m_updateDataHandles =
32 std::make_unique<AthenaBaseComps::AthAlgorithmDHUpdate>
34 std::move (m_updateDataHandles));
35}
DataObjIDColl m_extendedExtraObjects
AthCommonDataStore(const std::string &name, T... args)
◆ 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 VectorAlg::execute |
( |
| ) |
|
|
overridevirtual |
Definition at line 20 of file PerfMonTestVectorAlg.cxx.
21{
25 int vcap(vhit.capacity());
26 int vold;
27#ifdef DEBUG_ME
30#endif
32 cout << "initial capacity " << vcap << endl;
34 for(
int i(0);
i<size; ++
i) {
35 vold=vcap;
36#ifdef DEBUG_ME
39#endif
40 vhit.push_back(DHit(i,i,i));
41 vcap=vhit.capacity();
44 if (vold != vcap) cout <<
"iteration " <<
i <<
" new capacity " << vcap <<endl;
45#ifdef DEBUG_ME
46 if (((
int)p3-(
int)p2) != ((
int)p2-(
int)p1)) cout <<
"iteration " <<
i <<
" new chunk @" << hex <<
p3 <<
" previous was @" <<
p2 << dec << endl;
47#ifdef REALLY_DEBUG_ME
48 cout <<
"iteration " <<
i <<
" P3 @" << hex <<
p3 <<
" p2 @" <<
p2 <<
" p1 @" <<
p1 << dec <<
' ' << (
int)p3-(
int)
p2 <<
' ' <<(
int)p2-(
int)
p1 <<endl;
49#endif
50#endif
51 }
52
53 return StatusCode::SUCCESS;
54}
vector< DHit > HitContainer
Gaudi::Property< int > m_vectorSize
Property to setup the size of the Hit container.
std::map< int, IHit * > m_mixMap
Gaudi::Property< bool > m_mapIt
Property to introduce some fragmentation.
Gaudi::Property< int > m_2bReserved
Property to setup the amount of elements to reserve.
◆ 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()
| const DataObjIDColl & AthAlgorithm::extraOutputDeps |
( |
| ) |
const |
|
overridevirtualinherited |
Return the list of extra output dependencies.
This list is extended to include symlinks implied by inheritance relations.
Definition at line 50 of file AthAlgorithm.cxx.
51{
52
53
56 }
57 return Algorithm::extraOutputDeps();
58}
◆ 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.
◆ msg()
◆ msgLvl()
| bool AthCommonMsg< 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()
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()
◆ sysInitialize()
| StatusCode AthAlgorithm::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< Algorithm > >.
Reimplemented in AthAnalysisAlgorithm, AthFilterAlgorithm, AthHistogramAlgorithm, and PyAthena::Alg.
Definition at line 66 of file AthAlgorithm.cxx.
66 {
68
71 }
72 ServiceHandle<ICondSvc> cs(
"CondSvc",
name());
74 if (
h->isCondition() &&
h->mode() == Gaudi::DataHandle::Writer) {
75
76 if ( cs.retrieve().isFailure() ) {
78 return StatusCode::SUCCESS;
79 }
80 if (cs->regHandle(this,*h).isFailure()) {
81 sc = StatusCode::FAILURE;
82 ATH_MSG_ERROR(
"unable to register WriteCondHandle " <<
h->fullKey()
83 << " with CondSvc");
84 }
85 }
86 }
88}
#define ATH_MSG_WARNING(x)
virtual StatusCode sysInitialize() override
Override sysInitialize.
virtual std::vector< Gaudi::DataHandle * > outputHandles() const override
::StatusCode StatusCode
StatusCode definition for legacy code.
◆ 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_2bReserved
| Gaudi::Property<int> PerfMonTest::VectorAlg::m_2bReserved {this, "ToBeReserved", 1024*1024, "the number of elements to be reserved"} |
|
private |
Property to setup the amount of elements to reserve.
Definition at line 29 of file PerfMonTestVectorAlg.h.
29{this, "ToBeReserved", 1024*1024, "the number of elements to be reserved"};
◆ m_detStore
◆ m_evtStore
◆ m_extendedExtraObjects
| DataObjIDColl AthAlgorithm::m_extendedExtraObjects |
|
privateinherited |
◆ m_mapIt
| Gaudi::Property<bool> PerfMonTest::VectorAlg::m_mapIt {this, "MapIt", false, "add current hit to a map"} |
|
private |
◆ m_mixMap
| std::map<int,IHit*> PerfMonTest::VectorAlg::m_mixMap |
|
private |
◆ m_varHandleArraysDeclared
◆ m_vectorSize
| Gaudi::Property<int> PerfMonTest::VectorAlg::m_vectorSize {this, "VectorSize", 1024*1024, "the size of the Hit container"} |
|
private |
◆ m_vhka
The documentation for this class was generated from the following files: