//-----------------------------------------------------------------------------

#include "fibonacci.h"

#include <benchmark/benchmark.h>
#include <random>

//-----------------------------------------------------------------------------

template<auto f> static void test(benchmark::State &state)
{
    using type = decltype(f(0));
    assert(f(fibonacci::limits<type>::x) == fibonacci::limits<type>::y);

    static auto seed = std::random_device()();
    std::mt19937_64 engine;
    std::uniform_int_distribution<type> distribution(0, fibonacci::limits<type>::x);
    auto rng = [&] { return distribution(engine); };

    for (auto _ : state)
    {
        engine.seed(seed);
        for (type i = 0; i < fibonacci::limits<type>::x; ++i)
            benchmark::DoNotOptimize(f(rng()));
    }
}

//-----------------------------------------------------------------------------

// BENCHMARK(test<fib1<uint64_t>>); // too slow
BENCHMARK(test<fib2<uint64_t>>);
BENCHMARK(test<fib3<uint64_t>>);
BENCHMARK(test<fib4<uint64_t>>);
BENCHMARK(test<fib5<uint64_t>>);
BENCHMARK(test<fib6<uint64_t>>);

//-----------------------------------------------------------------------------

BENCHMARK_MAIN();

//-----------------------------------------------------------------------------