/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/PETE/OperatorTags.h: 63 - 94
--------------------------------------------------------------------------------

63:     return (a * b);
[...]
94:     (const_cast<T1&>(a) += b);
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/unique_ptr.h: 193 - 193
--------------------------------------------------------------------------------

193:       pointer    _M_ptr() const noexcept { return std::get<0>(_M_t); }
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/stl_algo.h: 692 - 692
--------------------------------------------------------------------------------

692:       if (__n2 <= 0)
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsMatrix.h: 214 - 217
--------------------------------------------------------------------------------

214:   inline const Type_t* operator[](size_type i) const { return X.data() + i * D2; }
215: 
216:   /// returns a pointer of i-th row, g++ iterator problem
217:   inline Type_t* operator[](size_type i) { return X.data() + i * D2; }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 178 - 248
--------------------------------------------------------------------------------

178:   inline size_t size() const { return nLocal; }
[...]
248:   inline pointer data() { return X; }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DiracDeterminantRef.cpp: 94 - 118
--------------------------------------------------------------------------------

94: typename DiracDeterminantRef<DU_TYPE>::ValueType DiracDeterminantRef<DU_TYPE>::ratioGrad(ParticleSet& P,
95:                                                                                          int iat,
96:                                                                                          GradType& grad_iat)
97: {
98:   SPOVGLTimer->start();
99:   Phi->evaluate(P, iat, psiV, dpsiV, d2psiV);
100:   SPOVGLTimer->stop();
101:   RatioTimer->start();
102:   const int WorkingIndex = iat - FirstIndex;
103:   UpdateMode             = ORB_PBYP_PARTIAL;
[...]
109:   if (invRow_id != WorkingIndex)
110:   {
111:     invRow_id = WorkingIndex;
112:     updateEng.getInvRow(psiM, WorkingIndex, invRow);
113:   }
114:   curRatio = simd::dot(invRow.data(), psiV.data(), invRow.size());
115:   grad_iat += ((RealType)1.0 / curRatio) * simd::dot(invRow.data(), dpsiV.data(), invRow.size());
116:   RatioTimer->stop();
117:   return curRatio;
118: }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Platforms/CPU/BLAS.hpp: 187 - 187
--------------------------------------------------------------------------------

187:     dgemv(trans_in, n, m, alpha, amat, lda, x, incx, beta, y, incy);
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Platforms/CPU/SIMD/inner_product.hpp: 82 - 156
--------------------------------------------------------------------------------

82:   for (int i = 0; i < n; i++)
83:     res += a[i] * b[i];
[...]
155:   for (int i = 0; i < n; i++)
156:     res += a[i] * b[i];
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/TinyVector.h: 62 - 62
--------------------------------------------------------------------------------

62:       X[d] = T(0);
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-6841/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/DelayedUpdate.h: 98 - 113
--------------------------------------------------------------------------------

98:     if (delay_count == 0)
99:     {
100:       // Ainv is fresh, directly access Ainv
101:       std::copy_n(Ainv[rowchanged], invRow.size(), invRow.data());
102:       return;
103:     }
104:     const T cone(1);
105:     const T czero(0);
106:     const int norb     = Ainv.rows();
107:     const int lda_Binv = Binv.cols();
108:     // save Ainv[rowchanged] to invRow
109:     std::copy_n(Ainv[rowchanged], norb, invRow.data());
110:     // multiply V (NxK) Binv(KxK) U(KxN) invRow right to the left
111:     BLAS::gemv('T', norb, delay_count, cone, U.data(), norb, invRow.data(), 1, czero, p.data(), 1);
112:     BLAS::gemv('N', delay_count, delay_count, cone, Binv.data(), lda_Binv, p.data(), 1, czero, Binv[delay_count], 1);
113:     BLAS::gemv('N', norb, delay_count, -cone, V.data(), norb, Binv[delay_count], 1, cone, invRow.data(), 1);
/cluster/comp/gcc/15.1.0/include/c++/15.1.0/bits/stl_algobase.h: 549 - 557
--------------------------------------------------------------------------------

549: 	  if (__builtin_expect(__n > 1, true))
550: 	    {
551: 	      __builtin_memmove(_GLIBCXX_TO_ADDR(__result),
552: 				_GLIBCXX_TO_ADDR(__first),
553: 				__n * sizeof(*__first));
554: 	      _GLIBCXX_ADVANCE(__result, __n);
555: 	    }
556: 	  else if (__n == 1)
557: 	    *__result++ = *__first;
