/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-5599/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/Jastrow/BsplineFunctor.h: 236 - 260
--------------------------------------------------------------------------------

236:   for (int jat = 0; jat < iLimit; jat++)
237:   {
238:     real_type r = distArray[jat];
239:     // pick the distances smaller than the cutoff and avoid the reference atom
240:     if (r < cutoff_radius && iStart + jat != iat)
241:       distArrayCompressed[iCount++] = distArray[jat];
242:   }
243: 
244:   real_type d = 0.0;
245:   //#pragma omp simd reduction(+:d)
246:   for (int jat = 0; jat < iCount; jat++)
247:   {
248:     real_type r = distArrayCompressed[jat];
249:     r *= DeltaRInv;
250:     int i         = (int)r;
251:     real_type t   = r - real_type(i);
252:     real_type tp0 = t * t * t;
253:     real_type tp1 = t * t;
254:     real_type tp2 = t;
255: 
256:     real_type d1 = SplineCoefs[i + 0] * (A[0] * tp0 + A[1] * tp1 + A[2] * tp2 + A[3]);
257:     real_type d2 = SplineCoefs[i + 1] * (A[4] * tp0 + A[5] * tp1 + A[6] * tp2 + A[7]);
258:     real_type d3 = SplineCoefs[i + 2] * (A[8] * tp0 + A[9] * tp1 + A[10] * tp2 + A[11]);
259:     real_type d4 = SplineCoefs[i + 3] * (A[12] * tp0 + A[13] * tp1 + A[14] * tp2 + A[15]);
260:     d += (d1 + d2 + d3 + d4);
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/shared_ptr_base.h: 1296 - 1296
--------------------------------------------------------------------------------

/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_vector.h: 1064 - 1064
--------------------------------------------------------------------------------

/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-5599/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 223 - 223
--------------------------------------------------------------------------------

223:     return X[i];
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-5599/intel/miniqmc/build/miniqmc/src/Particle/ParticleSet.h: 313 - 316
--------------------------------------------------------------------------------

313:   inline int first(int igroup) const { return (*group_offsets_)[igroup]; }
314: 
315:   ///return the last index of a group i
316:   inline int last(int igroup) const { return (*group_offsets_)[igroup + 1]; }
/beegfs/hackathon/users/eoseret/qaas_runs_test/178-654-5599/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/Jastrow/TwoBodyJastrowRef.h: 107 - 132
--------------------------------------------------------------------------------

107:     for (int k = 0; k < ratios.size(); ++k)
[...]
127:     for (int jg = 0; jg < NumGroups; ++jg)
128:     {
129:       const FuncType& f2(*F[igt + jg]);
130:       int iStart = P.first(jg);
131:       int iEnd   = P.last(jg);
132:       curUat += f2.evaluateV(iat, iStart, iEnd, dist, DistCompressed.data());
