/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Platforms/CPU/BLAS.hpp: 187 - 447
--------------------------------------------------------------------------------

187:     dgemv(trans_in, n, m, alpha, amat, lda, x, incx, beta, y, incy);
[...]
447:     dger(&m, &n, &alpha, x, &incx, y, &incy, a, &lda);
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsMatrix.h: 77 - 217
--------------------------------------------------------------------------------

77:   inline size_type rows() const { return D1; }
78:   inline size_type cols() const { return D2; }
[...]
217:   inline Type_t* operator[](size_type i) { return X.data() + i * D2; }
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_algo.h: 709 - 709
--------------------------------------------------------------------------------

709:       if (__n2 <= 0)
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 223 - 249
--------------------------------------------------------------------------------

223:     return X[i];
[...]
248:   inline pointer data() { return X; }
249:   inline const_pointer data() const { return X; }
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_vector.h: 1131 - 1131
--------------------------------------------------------------------------------

1131: 	return *(this->_M_impl._M_start + __n);
/usr/lib/gcc/aarch64-amazon-linux/14/../../../../include/c++/14/bits/stl_algobase.h: 413 - 452
--------------------------------------------------------------------------------

413: 	{ *__to = *__from; }
[...]
450: 	  const ptrdiff_t _Num = __last - __first;
451: 	  if (__builtin_expect(_Num > 1, true))
452: 	    __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DelayedUpdate.h: 125 - 153
--------------------------------------------------------------------------------

125:   {
126:     const T cminusone(-1);
127:     const T czero(0);
128:     const int norb     = Ainv.rows();
129:     const int lda_Binv = Binv.cols();
130:     std::copy_n(Ainv[rowchanged], norb, V[delay_count]);
131:     std::copy_n(psiV.data(), norb, U[delay_count]);
132:     delay_list[delay_count] = rowchanged;
133:     // the new Binv is [[X Y] [Z x]]
134:     BLAS::gemv('T', norb, delay_count + 1, cminusone, V.data(), norb, psiV.data(), 1, czero, p.data(), 1);
135:     // x
136:     T y = -p[delay_count];
137:     for (int i = 0; i < delay_count; i++)
138:       y += Binv[delay_count][i] * p[i];
139:     Binv[delay_count][delay_count] = y = T(1) / y;
140:     // Y
141:     BLAS::gemv('T', delay_count, delay_count, y, Binv.data(), lda_Binv, p.data(), 1, czero, Binv.data() + delay_count,
142:                lda_Binv);
143:     // X
144:     BLAS::ger(delay_count, delay_count, cminusone, Binv[delay_count], 1, Binv.data() + delay_count, lda_Binv,
145:               Binv.data(), lda_Binv);
146:     // Z
147:     for (int i = 0; i < delay_count; i++)
148:       Binv[delay_count][i] *= -y;
149:     delay_count++;
150:     // update Ainv when maximal delay is reached
151:     if (delay_count == lda_Binv)
152:       updateInvMat(Ainv);
153:   }
