/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Numerics/Spline2/MultiBsplineEvalHelper.hpp: 45 - 47
--------------------------------------------------------------------------------

45:   T sf = std::floor(x);
46:   T dx2 = x - sf;
47:   int ind2 = std::min(std::max(0, static_cast<int>(sf)), nmax);
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Particle/Lattice/CrystalLattice.h: 170 - 170
--------------------------------------------------------------------------------

170:       if (-std::numeric_limits<T1>::epsilon() < val_dot[i] && val_dot[i] < 0)
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/QMCWaveFunctions/einspline_spo_ref.hpp: 175 - 176
--------------------------------------------------------------------------------

175:     for (int i = 0; i < nBlocks; ++i)
176:       MultiBsplineEvalRef::evaluate_v(einsplines[i], u[0], u[1], u[2], psi[i].data(), nSplinesPerBlock);
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_vector.h: 1169 - 1169
--------------------------------------------------------------------------------

1169:       { return _M_data_ptr(this->_M_impl._M_start); }
/usr/lib/gcc/x86_64-redhat-linux/11/../../../../include/c++/11/bits/stl_algobase.h: 924 - 924
--------------------------------------------------------------------------------

924: 	*__first = __tmp;
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Numerics/Spline2/MultiBsplineData.hpp: 54 - 57
--------------------------------------------------------------------------------

54:     a[0] = ((A00 * tx + A01) * tx + A02) * tx + A03;
55:     a[1] = ((A10 * tx + A11) * tx + A12) * tx + A13;
56:     a[2] = ((A20 * tx + A21) * tx + A22) * tx + A23;
57:     a[3] = ((A30 * tx + A31) * tx + A32) * tx + A33;
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Numerics/Spline2/MultiBsplineRef.hpp: 42 - 71
--------------------------------------------------------------------------------

42:   x -= spline_m->x_grid.start;
43:   y -= spline_m->y_grid.start;
44:   z -= spline_m->z_grid.start;
45:   T tx, ty, tz;
46:   int ix, iy, iz;
47:   spline2::getSplineBound(x * spline_m->x_grid.delta_inv, tx, ix, spline_m->x_grid.num - 1);
48:   spline2::getSplineBound(y * spline_m->y_grid.delta_inv, ty, iy, spline_m->y_grid.num - 1);
49:   spline2::getSplineBound(z * spline_m->z_grid.delta_inv, tz, iz, spline_m->z_grid.num - 1);
[...]
56:   const intptr_t xs = spline_m->x_stride;
57:   const intptr_t ys = spline_m->y_stride;
58:   const intptr_t zs = spline_m->z_stride;
59: 
60:   constexpr T zero(0);
61:   std::fill(vals, vals + num_splines, zero);
62: 
63:   for (size_t i = 0; i < 4; i++)
64:     for (size_t j = 0; j < 4; j++)
65:     {
66:       const T pre00           = a[i] * b[j];
67:       const T* restrict coefs = spline_m->coefs + (ix + i) * xs + (iy + j) * ys + iz * zs;
68:       for (size_t n = 0; n < num_splines; n++)
69:         vals[n] += pre00 *
70:             (c[0] * coefs[n] + c[1] * coefs[n + zs] + c[2] * coefs[n + 2 * zs] +
71:              c[3] * coefs[n + 3 * zs]);
/beegfs/hackathon/users/eoseret/qaas_runs_test/179-075-2076/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/TinyVector.h: 61 - 61
--------------------------------------------------------------------------------

61:     for (size_t d = 0; d < D; ++d)
