/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 242 - 249
--------------------------------------------------------------------------------

242:   ScopeGuard(TIMER& t) : timer(t) { timer.start(); }
[...]
249:   ~ScopeGuard() { timer.stop(); }
/usr/include/c++/11/bits/stl_uninitialized.h: 602 - 602
--------------------------------------------------------------------------------

602: 	      ++__first;
/usr/include/c++/11/bits/stl_construct.h: 109 - 109
--------------------------------------------------------------------------------

109:     _Construct(_Tp* __p, _Args&&... __args)
/usr/include/c++/11/bits/stl_algobase.h: 923 - 1115
--------------------------------------------------------------------------------

923:       for (; __first != __last; ++__first)
924: 	*__first = __tmp;
[...]
1115:       if (__n <= 0)
/usr/include/c++/11/bits/refwrap.h: 338 - 338
--------------------------------------------------------------------------------

338:       { return *_M_data; }
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/WaveFunction.cpp: 261 - 276
--------------------------------------------------------------------------------

261: {
262:   assert(VP.getTotalNum() == ratios.size());
263:   if (VP.refPtcl < nelup)
264:     Det_up->evaluateRatios(VP, ratios);
265:   else
266:     Det_dn->evaluateRatios(VP, ratios);
267: 
268:   std::vector<valT> t(ratios.size());
269:   for (size_t i = 0; i < Jastrows.size(); i++)
270:   {
271:     ScopedTimer local_timer(jastrow_timers[i]);
272:     Jastrows[i]->evaluateRatios(VP, t);
273:     for (int j = 0; j < ratios.size(); ++j)
274:       ratios[j] *= t[j];
275:   }
276: }
/usr/include/c++/11/bits/stl_vector.h: 98 - 1770
--------------------------------------------------------------------------------

98: 	: _M_start(), _M_finish(), _M_end_of_storage()
[...]
336: 		      _M_impl._M_end_of_storage - _M_impl._M_start);
[...]
346: 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
[...]
353: 	if (__p)
[...]
361: 	this->_M_impl._M_start = this->_M_allocate(__n);
362: 	this->_M_impl._M_finish = this->_M_impl._M_start;
363: 	this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
[...]
680: 	std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
[...]
918:       size() const _GLIBCXX_NOEXCEPT
919:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
1046: 	return *(this->_M_impl._M_start + __n);
[...]
1605: 	this->_M_impl._M_finish =
[...]
1769: 	if (__n > _S_max_size(_Tp_alloc_type(__a)))
1770: 	  __throw_length_error(
/usr/include/c++/11/ext/new_allocator.h: 127 - 145
--------------------------------------------------------------------------------

127: 	return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
[...]
145: 	::operator delete(__p
