#include <algorithm>
#include <array>
#include <benchmark/benchmark.h>
#include <deque>
#include <numeric>
#include <ranges>
#include <vector>

const std::size_t N = 1'000'000;

template<typename Container, std::size_t S>
class container : public Container
{
public:
    explicit container() : Container(S) {}
};

template<typename T> static void test(benchmark::State &state)
{
    for (auto _ : state)
    {
        T t;
#if __cplusplus < 202002L
        std::iota(std::begin(t), std::end(t), 0);
        benchmark::DoNotOptimize(
            std::accumulate(std::begin(t), std::end(t), 0));
#else
        std::ranges::iota(t, 0);
        benchmark::DoNotOptimize(
            std::ranges::fold_left(t, 0, std::plus<>()));
#endif
    }
    state.SetItemsProcessed(state.iterations());
}

BENCHMARK(test<std::array<int, N>>);
BENCHMARK(test<container<std::vector<int>, N>>);
BENCHMARK(test<container<std::deque<int>, N>>);

BENCHMARK_MAIN();