/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 242 - 249
--------------------------------------------------------------------------------

242:   ScopeGuard(TIMER& t) : timer(t) { timer.start(); }
[...]
249:   ~ScopeGuard() { timer.stop(); }
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/refwrap.h: 347 - 347
--------------------------------------------------------------------------------

347:       { return *_M_data; }
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/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: }
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_construct.h: 119 - 119
--------------------------------------------------------------------------------

119:       ::new((void*)__p) _Tp(std::forward<_Args>(__args)...);
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_vector.h: 100 - 1907
--------------------------------------------------------------------------------

100: 	: _M_start(), _M_finish(), _M_end_of_storage()
[...]
367: 		      _M_impl._M_end_of_storage - _M_impl._M_start);
[...]
378: 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
[...]
386: 	if (__p)
[...]
395: 	this->_M_impl._M_start = this->_M_allocate(__n);
396: 	this->_M_impl._M_finish = this->_M_impl._M_start;
397: 	this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
[...]
989:       size() const _GLIBCXX_NOEXCEPT
990:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
1126: 	return *(this->_M_impl._M_start + __n);
[...]
1714: 	this->_M_impl._M_finish =
[...]
1906: 	if (__n > _S_max_size(_Tp_alloc_type(__a)))
1907: 	  __throw_length_error(
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_uninitialized.h: 667 - 667
--------------------------------------------------------------------------------

667: 	      ++__first;
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_algobase.h: 930 - 1124
--------------------------------------------------------------------------------

930:       for (; __first != __last; ++__first)
931: 	*__first = __tmp;
[...]
1123:       if (__n <= 0)
1124: 	return __first;
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/new_allocator.h: 147 - 168
--------------------------------------------------------------------------------

147: 	return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp)));
[...]
168: 	_GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n));
