/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DelayedUpdate.h: 60 - 62
--------------------------------------------------------------------------------

60:   inline void resize(int norb, int delay)
61:   {
62:     V.resize(delay, norb);
/usr/include/c++/11/bits/stl_uninitialized.h: 602 - 1011
--------------------------------------------------------------------------------

602: 	      ++__first;
[...]
1009:       ptrdiff_t __count = __last - __first;
1010:       if (__count > 0)
1011: 	__builtin_memmove(__result, __first, __count * sizeof(_Tp));
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsMatrix.h: 101 - 103
--------------------------------------------------------------------------------

101:     D1      = n;
102:     D2      = m;
103:     TotSize = n * m;
/usr/include/c++/11/bits/stl_algobase.h: 911 - 1120
--------------------------------------------------------------------------------

911:       for (; __first != __last; ++__first)
912: 	*__first = __value;
[...]
923:       for (; __first != __last; ++__first)
924: 	*__first = __tmp;
[...]
1115:       if (__n <= 0)
1116: 	return __first;
1117: 
1118:       __glibcxx_requires_can_increment(__first, __n);
1119: 
1120:       std::__fill_a(__first, __first + __n, __value);
/usr/include/c++/11/bits/alloc_traits.h: 496 - 496
--------------------------------------------------------------------------------

496:       { __a.deallocate(__p, __n); }
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/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: }
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/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;
/usr/include/c++/11/bits/stl_vector.h: 346 - 1798
--------------------------------------------------------------------------------

346: 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
[...]
353: 	if (__p)
[...]
919:       { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }
[...]
939: 	if (__new_size > size())
940: 	  _M_default_append(__new_size - size());
941: 	else if (__new_size < size())
942: 	  _M_erase_at_end(this->_M_impl._M_start + __new_size);
[...]
1758: 	if (max_size() - size() < __n)
1759: 	  __throw_length_error(__N(__s));
[...]
1794: 	if (size_type __n = this->_M_impl._M_finish - __pos)
1795: 	  {
1796: 	    std::_Destroy(__pos, this->_M_impl._M_finish,
1797: 			  _M_get_Tp_allocator());
1798: 	    this->_M_impl._M_finish = __pos;
/usr/include/c++/11/ext/new_allocator.h: 111 - 145
--------------------------------------------------------------------------------

111: 	if (__builtin_expect(__n > this->_M_max_size(), false))
112: 	  {
113: 	    // _GLIBCXX_RESOLVE_LIB_DEFECTS
114: 	    // 3190. allocator::allocate sometimes returns too little storage
115: 	    if (__n > (std::size_t(-1) / sizeof(_Tp)))
116: 	      std::__throw_bad_array_new_length();
117: 	    std::__throw_bad_alloc();
[...]
127: 	return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
[...]
145: 	::operator delete(__p
/usr/include/c++/11/bits/vector.tcc: 618 - 680
--------------------------------------------------------------------------------

618: 					 - this->_M_impl._M_finish);
619: 
620: 	  if (__size > max_size() || __navail > max_size() - __size)
621: 	    __builtin_unreachable();
622: 
623: 	  if (__navail >= __n)
624: 	    {
625: 	      _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
626: 	      this->_M_impl._M_finish =
[...]
640: 		      std::__uninitialized_default_n_a(__new_start + __size,
[...]
648: 		  _S_relocate(this->_M_impl._M_start, this->_M_impl._M_finish,
[...]
677: 			    - this->_M_impl._M_start);
678: 	      this->_M_impl._M_start = __new_start;
679: 	      this->_M_impl._M_finish = __new_start + __size + __n;
680: 	      this->_M_impl._M_end_of_storage = __new_start + __len;
