Function FindBestImplementation

src/node/minisketchwrapper.cpp:24–58

static constexpr uint32_t BITS = 32;

uint32_t FindBestImplementation()
{
    std::optional<std::pair<int64_t, uint32_t>> best;

    uint32_t max_impl = Minisketch::MaxImplementation();
    for (uint32_t impl = 0; impl <= max_impl; ++impl) {
        std::vector<int64_t> benches;
        uint64_t offset = 0;
        /* Run a little benchmark with capacity 32, adding 184 entries, and decoding 11 of them once. */
        for (int b = 0; b < 11; ++b) {
            if (!Minisketch::ImplementationSupported(BITS, impl)) break;
            Minisketch sketch(BITS, impl, 32);
            auto start = GetTimeMicros();
            for (uint64_t e = 0; e < 100; ++e) {
                sketch.Add(e*1337 + b*13337 + offset);
            }
            for (uint64_t e = 0; e < 84; ++e) {
                sketch.Add(e*1337 + b*13337 + offset);
            }
            offset += (*sketch.Decode(32))[0];
            auto stop = GetTimeMicros();
            benches.push_back(stop - start);
        }
        /* Remember which implementation has the best median benchmark time. */
        if (!benches.empty()) {
            std::sort(benches.begin(), benches.end());
            if (!best || best->first > benches[5]) {
                best = std::make_pair(benches[5], impl);
            }
        }
    }
    assert(best.has_value());
    LogPrintf("Using Minisketch implementation number %i\n", best->second);
    return best->second;
}

uint32_t Minisketch32Implementation()
{