/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsMatrix.h: 101 - 103
--------------------------------------------------------------------------------

101:     D1      = n;
102:     D2      = m;
103:     TotSize = n * m;
/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/vector.tcc: 641 - 707
--------------------------------------------------------------------------------

641: 					 - this->_M_impl._M_finish);
642: 
643: 	  if (__size > max_size() || __navail > max_size() - __size)
644: 	    __builtin_unreachable();
645: 
646: 	  if (__navail >= __n)
647: 	    {
648: 	      _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
649: 	      this->_M_impl._M_finish =
[...]
668: 		      std::__uninitialized_default_n_a(__new_start + __size,
[...]
704: 			    this->_M_impl._M_end_of_storage - __old_start);
705: 	      this->_M_impl._M_start = __new_start;
706: 	      this->_M_impl._M_finish = __new_start + __size + __n;
707: 	      this->_M_impl._M_end_of_storage = __new_start + __len;
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 181 - 301
--------------------------------------------------------------------------------

181:   inline void resize(size_t n, Type_t val = Type_t())
182:   {
183:     static_assert(std::is_same<value_type, typename Alloc::value_type>::value,
184:                   "Vector and Alloc data types must agree!");
185:     if (nLocal > nAllocated)
186:       throw std::runtime_error("Resize not allowed on Vector constructed by initialized memory.");
187: 
188:     if (n > nAllocated)
[...]
195:       if (n > nLocal)
196:         qmc_allocator_traits<Alloc>::fill_n(X + nLocal, n - nLocal, val);
197:       nLocal = n;
[...]
296:     if (nAllocated)
297:     {
298:       mAllocator.deallocate(X, nAllocated);
299:     }
300:     X          = mAllocator.allocate(n);
301:     nLocal     = n;
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_vector.h: 386 - 1936
--------------------------------------------------------------------------------

386: 	if (__p)
[...]
990:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
1012: 	if (__new_size > size())
1013: 	  _M_default_append(__new_size - size());
1014: 	else if (__new_size < size())
1015: 	  _M_erase_at_end(this->_M_impl._M_start + __new_size);
[...]
1895: 	if (max_size() - size() < __n)
1896: 	  __throw_length_error(__N(__s));
[...]
1932: 	if (size_type __n = this->_M_impl._M_finish - __pos)
1933: 	  {
1934: 	    std::_Destroy(__pos, this->_M_impl._M_finish,
1935: 			  _M_get_Tp_allocator());
1936: 	    this->_M_impl._M_finish = __pos;
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_uninitialized.h: 667 - 1132
--------------------------------------------------------------------------------

667: 	      ++__first;
668: 	      __first = std::fill_n(__first, __n - 1, *__val);
[...]
1115:     __relocate_a_1(_Tp* __first, _Tp* __last,
1116: 		   _Tp* __result,
1117: 		   [[__maybe_unused__]] allocator<_Up>& __alloc) noexcept
1118:     {
1119:       ptrdiff_t __count = __last - __first;
1120:       if (__count > 0)
[...]
1132: 	  __builtin_memmove(__result, __first, __count * sizeof(_Tp));
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_algobase.h: 262 - 1129
--------------------------------------------------------------------------------

262:       if (__a < __b)
[...]
918:       for (; __first != __last; ++__first)
919: 	*__first = __value;
[...]
930:       for (; __first != __last; ++__first)
931: 	*__first = __tmp;
[...]
1123:       if (__n <= 0)
1124: 	return __first;
1125: 
1126:       __glibcxx_requires_can_increment(__first, __n);
1127: 
1128:       std::__fill_a(__first, __first + __n, __value);
1129:       return __first + __n;
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DelayedUpdate.h: 60 - 62
--------------------------------------------------------------------------------

60:   inline void resize(int norb, int delay)
61:   {
62:     V.resize(delay, norb);
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DiracDeterminantRef.cpp: 61 - 79
--------------------------------------------------------------------------------

61: void DiracDeterminantRef<DU_TYPE>::resize(int nel, int morb)
62: {
63:   int norb = morb;
64:   if (norb <= 0)
65:     norb = nel; // for morb == -1 (default)
66:   updateEng.resize(norb, ndelay);
67:   psiM.resize(nel, norb);
[...]
73:   LastIndex   = FirstIndex + nel;
74:   NumPtcls    = nel;
75:   NumOrbitals = norb;
76: 
77:   dpsiV.resize(NumOrbitals);
78:   d2psiV.resize(NumOrbitals);
79: }
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/new_allocator.h: 122 - 168
--------------------------------------------------------------------------------

122:       allocate(size_type __n, const void* = static_cast<const void*>(0))
[...]
130: 	if (__builtin_expect(__n > this->_M_max_size(), false))
131: 	  {
132: 	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
133: 	    // 3190. allocator::allocate sometimes returns too little storage
134: 	    if (__n > (std::size_t(-1) / sizeof(_Tp)))
135: 	      std::__throw_bad_array_new_length();
136: 	    std::__throw_bad_alloc();
[...]
147: 	return static_cast<_Tp*>(_GLIBCXX_OPERATOR_NEW(__n * sizeof(_Tp)));
[...]
168: 	_GLIBCXX_OPERATOR_DELETE(_GLIBCXX_SIZED_DEALLOC(__p, __n));
