15#ifdef NUMERICS_HAS_OMP
19 #pragma omp parallel for reduction(+ : s) schedule(static)
20 for (
idx i = 0; i < n; ++i) {
34#ifdef NUMERICS_HAS_OMP
38 #pragma omp parallel for reduction(max : mx) schedule(static)
39 for (
idx i = 0; i < n; ++i) {
40 const real v = std::abs(xd[i]);
56#ifdef NUMERICS_HAS_OMP
60 #pragma omp parallel for reduction(+ : s) schedule(static)
61 for (
idx i = 0; i < n; ++i) {
constexpr idx size() const noexcept
NUM_K_AINLINE T sum(const T *NUM_K_RESTRICT x, idx n) noexcept
Scalar sum: return sum x[i].
NUM_K_AINLINE T linf_norm(const T *NUM_K_RESTRICT x, idx n) noexcept
L-infinity norm: max |x[i]|.
NUM_K_AINLINE T l1_norm(const T *NUM_K_RESTRICT x, idx n) noexcept
L1 norm: sum |x[i]|.
real l1_norm(const Vector &x, seq_t) noexcept
Sequential l1 norm.
real sum(const Vector &x, seq_t) noexcept
Sequential sum.
real linf_norm(const Vector &x, seq_t) noexcept
Sequential infinity norm.
Tier-1 kernel: raw-pointer, inline, zero-overhead inner loops.
Scalar reduction kernels (namespace num::kernel::reduce)
Parallel execution policy tag.
Sequential execution policy tag.