interpolate_linear()

void MayaFlux::Kinesis::Discrete::interpolate_linear ( std::span< const double >  src, std::span< double >  dst  )

noexcept

Linear interpolation from src into dst (caller sizes dst) Branchless inner loop with precomputed step; dst may be larger or smaller than src.

The final index is clamped via std::min rather than a conditional branch, permitting auto-vectorisation.

Parameters

src	Source span (read-only)
dst	Destination span (written in-place)

Definition at line 156 of file Transform.cpp.

{
    const size_t dst_n = dst.size();
    const size_t src_n = src.size();
 
    if (dst_n == 0 || src_n == 0)
        return;
 
    if (dst_n == 1 || src_n == 1) {
        std::ranges::fill(dst, src[0]);
        return;
    }
 
    const double step = static_cast<double>(src_n - 1) / static_cast<double>(dst_n - 1);
 
    Parallel::for_each(Parallel::par_unseq,
        std::views::iota(size_t { 0 }, dst_n).begin(),
        std::views::iota(size_t { 0 }, dst_n).end(),
        [&src, &dst, step, src_n](size_t i) {
            const double pos = static_cast<double>(i) * step;
            const auto idx = static_cast<size_t>(pos);
            const size_t idx1 = std::min(idx + 1, src_n - 1);
            const double frac = pos - static_cast<double>(idx);
            dst[i] = src[idx] + frac * (src[idx1] - src[idx]);
        });
}

Referenced by time_stretch().

Here is the caller graph for this function: