Function verify_full

examples/sort/bench_stable_sort.cpp:206–219

template <typename T>
bool verify_full(const std::vector<T> & out, const std::vector<T> & in) {
    size_t n = out.size();
    if (in.size() != n) return false;
    std::vector<char> seen(n, 0);
    for (size_t i = 0; i < n; i++) {
        int32_t ix = idx_of(out[i]);
        if (ix < 0 || size_t(ix) >= n || seen[ix]) return false;                          // permutation
        seen[ix] = 1;
        if (key_of(out[i]) != key_of(in[size_t(ix)])) return false;                        // element integrity
        if (i && key_of(out[i]) < key_of(out[i-1])) return false;                          // sorted
        if (i && key_of(out[i]) == key_of(out[i-1]) && idx_of(out[i]) < idx_of(out[i-1])) return false; // stable
    }
    return true;
}

// ============================================================================
// Input patterns. idx is always the original position (0..n-1).