/usr/include/c++/14/bits/stl_algobase.h: 238 - 1151
--------------------------------------------------------------------------------

238:       if (__b < __a)
[...]
952: 	*__first = __tmp;
[...]
1146:       if (__n <= 0)
1147: 	return __first;
1148: 
1149:       __glibcxx_requires_can_increment(__first, __n);
1150: 
1151:       std::__fill_a(__first, __first + __n, __value);
/usr/include/c++/14/bits/stl_vector.h: 1147 - 1147
--------------------------------------------------------------------------------

1147:       operator[](size_type __n) const _GLIBCXX_NOEXCEPT
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 223 - 223
--------------------------------------------------------------------------------

223:     return X[i];
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/Jastrow/TwoBodyJastrowRef.h: 254 - 279
--------------------------------------------------------------------------------

254: inline void TwoBodyJastrowRef<FT>::computeU3(const ParticleSet& P,
[...]
262:   const int jelmax = triangle ? iat : N;
[...]
268:   const int igt = P.GroupID[iat] * NumGroups;
269:   for (int jg = 0; jg < NumGroups; ++jg)
270:   {
271:     const FuncType& f2(*F[igt + jg]);
[...]
279: }
/home/eoseret/qaas/qaas_runs/178-212-9071/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]; }
/home/eoseret/qaas/qaas_runs/178-212-9071/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/Jastrow/BsplineFunctor.h: 276 - 336
--------------------------------------------------------------------------------

276:   real_type dSquareDeltaRinv = DeltaRInv * DeltaRInv;
277:   constexpr real_type cOne(1);
278: 
279:   //    START_MARK_FIRST();
280: 
281:   ASSUME_ALIGNED(distIndices);
282:   ASSUME_ALIGNED(distArrayCompressed);
283:   int iCount                 = 0;
284:   int iLimit                 = iEnd - iStart;
[...]
291:   for (int jat = 0; jat < iLimit; jat++)
292:   {
293:     real_type r = distArray[jat];
294:     if (r < cutoff_radius && iStart + jat != iat)
295:     {
296:       distIndices[iCount]         = jat;
297:       distArrayCompressed[iCount] = r;
298:       iCount++;
[...]
305:     real_type r    = distArrayCompressed[j];
306:     int iScatter   = distIndices[j];
307:     real_type rinv = cOne / r;
308:     r *= DeltaRInv;
309:     int iGather   = (int)r;
310:     real_type t   = r - real_type(iGather);
311:     real_type tp0 = t * t * t;
312:     real_type tp1 = t * t;
313:     real_type tp2 = t;
314: 
315:     real_type sCoef0 = SplineCoefs[iGather + 0];
316:     real_type sCoef1 = SplineCoefs[iGather + 1];
317:     real_type sCoef2 = SplineCoefs[iGather + 2];
318:     real_type sCoef3 = SplineCoefs[iGather + 3];
319: 
320:     // clang-format off
321:     laplArray[iScatter] = dSquareDeltaRinv *
322:       (sCoef0*( d2A[ 2]*tp2 + d2A[ 3])+
323:        sCoef1*( d2A[ 6]*tp2 + d2A[ 7])+
324:        sCoef2*( d2A[10]*tp2 + d2A[11])+
325:        sCoef3*( d2A[14]*tp2 + d2A[15]));
326: 
327:     gradArray[iScatter] = DeltaRInv * rinv *
328:       (sCoef0*( dA[ 1]*tp1 + dA[ 2]*tp2 + dA[ 3])+
329:        sCoef1*( dA[ 5]*tp1 + dA[ 6]*tp2 + dA[ 7])+
330:        sCoef2*( dA[ 9]*tp1 + dA[10]*tp2 + dA[11])+
331:        sCoef3*( dA[13]*tp1 + dA[14]*tp2 + dA[15]));
332: 
333:     valArray[iScatter] = (sCoef0*(A[ 0]*tp0 + A[ 1]*tp1 + A[ 2]*tp2 + A[ 3])+
334:         sCoef1*(A[ 4]*tp0 + A[ 5]*tp1 + A[ 6]*tp2 + A[ 7])+
335:         sCoef2*(A[ 8]*tp0 + A[ 9]*tp1 + A[10]*tp2 + A[11])+
336:         sCoef3*(A[12]*tp0 + A[13]*tp1 + A[14]*tp2 + A[15]));
