Function run_cmp_counts

examples/sort/bench_stable_sort.cpp:398–416

template <typename T>
void run_cmp_counts(const char * type_name) {
    const size_t n = 100000;
    const Pattern pats[] = { Pattern::Random, Pattern::Sorted, Pattern::Reverse, Pattern::Dups, Pattern::AllEqual };
    std::printf("\n## comparator-call counts — %s, N=%zu (why the adaptive cells are real)\n\n", type_name, n);
    std::printf("| pattern    | std::stable | #3 byte   | #3 typed  | #1 merge  | #4 index  |\n");
    std::printf("|------------|------------:|----------:|----------:|----------:|----------:|\n");
    for (Pattern p : pats) {
        auto in = make_pattern<T>(p, n, 0xC0FFEEu);
        auto count = [&](auto fn) -> uint64_t { auto a = in; g_cmp = 0; fn(a); return g_cmp; };
        uint64_t cs = count([](std::vector<T> & a) { std::stable_sort(a.begin(), a.end(), CountingLess<T>()); });
        uint64_t cb = count([](std::vector<T> & a) { das_stable_sort_r(a.data(), a.size(), sizeof(T), key_less_counted); });
        uint64_t ct = count([](std::vector<T> & a) { das_stable_sort(a.data(), a.data() + a.size(), CountingLess<T>()); });
        uint64_t cm = count([](std::vector<T> & a) { das_stable_merge_r(a.data(), a.size(), sizeof(T), key_less_counted); });
        uint64_t ci = count([](std::vector<T> & a) { das_stable_index_r(a.data(), a.size(), sizeof(T), key_less_counted); });
        std::printf("| %-10s | %11llu | %9llu | %9llu | %9llu | %9llu |\n", pattern_name(p),
                    (unsigned long long)cs, (unsigned long long)cb, (unsigned long long)ct,
                    (unsigned long long)cm, (unsigned long long)ci);
    }
}

} // anonymous