/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/VectorSoAContainer.h: 231 - 271
--------------------------------------------------------------------------------

231:   inline const AoSElement_t operator[](size_t i) const { return AoSElement_t(myData + i, nGhosts); }
[...]
243:       for (size_t i = 0; i < D; ++i)
244:         *(_base + M * i) = rhs[i];
[...]
263:   inline Accessor operator()(size_t i) { return Accessor(myData + i, nGhosts); }
[...]
271:   inline T* restrict data(size_t i) { return myData + i * nGhosts; }
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Utilities/NewTimer.h: 242 - 249
--------------------------------------------------------------------------------

242:   ScopeGuard(TIMER& t) : timer(t) { timer.start(); }
[...]
249:   ~ScopeGuard() { timer.stop(); }
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/TinyVector.h: 145 - 182
--------------------------------------------------------------------------------

145:       X[i] = base[i * offset];
[...]
182:       inverse[d] = -X[d];
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_algo.h: 731 - 757
--------------------------------------------------------------------------------

731:     { return std::copy(__first, __first + __n, __result); }
[...]
757:       if (__n2 <= 0)
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Numerics/OhmmsPETE/OhmmsVector.h: 223 - 248
--------------------------------------------------------------------------------

223:     return X[i];
[...]
248:   inline pointer data() { return X; }
/beegfs/hackathon/users/eoseret/qaas_runs/170-855-3059/intel/miniqmc/build/miniqmc/src/Particle/SoaDistanceTableAAOMPTarget.h: 429 - 445
--------------------------------------------------------------------------------

429:   inline void update(IndexType iat) override
430:   {
431:     ScopedTimer local_timer(update_timer_);
432:     //update [0, iat) columns
433:     const int nupdate = iat;
434:     //copy row
435:     assert(nupdate <= temp_r_.size());
436:     std::copy_n(temp_r_.data(), nupdate, distances_[iat].data());
437:     for (int idim = 0; idim < D; ++idim)
438:       std::copy_n(temp_dr_.data(idim), nupdate, displacements_[iat].data(idim));
439:     //copy column
440:     for (size_t i = iat + 1; i < num_targets_; ++i)
441:     {
442:       distances_[i][iat]     = temp_r_[i];
443:       displacements_[i](iat) = -temp_dr_[i];
444:     }
445:   }
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_vector.h: 1126 - 1126
--------------------------------------------------------------------------------

1126: 	return *(this->_M_impl._M_start + __n);
/cluster/comp/gcc/13.2.0/include/c++/13.2.0/bits/stl_algobase.h: 398 - 437
--------------------------------------------------------------------------------

398: 	{ *__to = *__from; }
[...]
436: 	  if (__builtin_expect(_Num > 1, true))
437: 	    __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
