25 int vcap(vhit.capacity());
32 cout <<
"initial capacity " << vcap << endl;
34 for(
int i(0); i<size; ++i) {
40 vhit.push_back(
DHit(i,i,i));
44 if (vold != vcap) cout <<
"iteration " << i <<
" new capacity " << vcap <<endl;
46 if (((
int)p3-(
int)p2) != ((
int)p2-(
int)p1)) cout <<
"iteration " << i <<
" new chunk @" << hex << p3 <<
" previous was @" << p2 << dec << endl;
48 cout <<
"iteration " << i <<
" P3 @" << hex << p3 <<
" p2 @" << p2 <<
" p1 @" << p1 << dec <<
' ' << (int)p3-(
int)p2 <<
' ' <<(int)p2-(
int)p1 <<endl;
53 return StatusCode::SUCCESS;
vector< DHit > HitContainer
Gaudi::Property< int > m_vectorSize
Property to setup the size of the Hit container.
virtual StatusCode execute() override
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.
PerfMonTestPolyVectorAlg.h Example for the memory optimization tutorial.