/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/WaveFunction.cpp: 261 - 276
--------------------------------------------------------------------------------

261: {
262:   assert(VP.getTotalNum() == ratios.size());
263:   if (VP.refPtcl < nelup)
[...]
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/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/new_allocator.h: 151 - 172
--------------------------------------------------------------------------------

151: 	return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp)));
[...]
172: 	_GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n));
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_uninitialized.h: 668 - 668
--------------------------------------------------------------------------------

668: 	      __first = std::fill_n(__first, __n - 1, *__val);
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_construct.h: 119 - 119
--------------------------------------------------------------------------------

119:       ::new((void*)__p) _Tp(std::forward<_Args>(__args)...);
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/refwrap.h: 351 - 351
--------------------------------------------------------------------------------

351:       { return *_M_data; }
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 242 - 249
--------------------------------------------------------------------------------

242:   ScopeGuard(TIMER& t) : timer(t) { timer.start(); }
[...]
249:   ~ScopeGuard() { timer.stop(); }
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_vector.h: 368 - 1920
--------------------------------------------------------------------------------

368: 	_M_deallocate(_M_impl._M_start,
369: 		      _M_impl._M_end_of_storage - _M_impl._M_start);
[...]
380: 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
[...]
388: 	if (__p)
[...]
398: 	this->_M_impl._M_start = this->_M_allocate(__n);
399: 	this->_M_impl._M_finish = this->_M_impl._M_start;
400: 	this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
[...]
993:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
1131: 	return *(this->_M_impl._M_start + __n);
[...]
1719: 	this->_M_impl._M_finish =
[...]
1919: 	if (__n > _S_max_size(_Tp_alloc_type(__a)))
1920: 	  __throw_length_error(
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_algobase.h: 952 - 1151
--------------------------------------------------------------------------------

952: 	*__first = __tmp;
[...]
1146:       if (__n <= 0)
1147: 	return __first;
1148: 
1149:       __glibcxx_requires_can_increment(__first, __n);
1150: 
1151:       std::__fill_a(__first, __first + __n, __value);
