vectors.cpp

// Copyright 2020 The Division Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//      https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Author dietoad@gmail.com && firedtoad@gmail.com

#include <benchmark/benchmark.h>
#include <iostream>
#include <llvm/ADT/SmallVector.h>
#include <llvm/ADT/DenseSet.h>
#include <absl/container/inlined_vector.h>
#include <boost/container/small_vector.hpp>
//#include <container/vector.hpp>
#include <container/SmallVector.h>
#include <list>
#include <numeric>
#include <vector>

template <typename V> static void BenchInsert(benchmark::State &state)
{
    for (auto _ : state)
    {
        V v{};
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back(i);
        }
    }
}

BENCHMARK_TEMPLATE(BenchInsert, std::vector<int>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchInsert, llvm::SmallVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchInsert, absl::InlinedVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchInsert, llvm_vecsmall::SmallVector<int, 1024>)->Range(128, 1024);

template <typename V> static void BenchReserve(benchmark::State &state)
{
    for (auto _ : state)
    {
        V v{};
        v.reserve(state.range(0));
        for (auto i = 0; i < state.range(0); i++)
        {
            v.push_back(i);
        }
    }
}

BENCHMARK_TEMPLATE(BenchReserve, std::vector<int>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchReserve, llvm::SmallVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchReserve, absl::InlinedVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchReserve, llvm_vecsmall::SmallVector<int, 1024>)->Range(128, 1024);

template <typename V> static void BenchAccumulate(benchmark::State &state)
{
    V v;
    v.reserve(state.range(0));
    for (auto i = 0; i < state.range(0); i++)
    {
        v.push_back(i);
    }
    for (auto _ : state)
    {
        auto r = std::accumulate(v.begin(), v.end(), 0);
        benchmark::DoNotOptimize(r);
    }
}

BENCHMARK_TEMPLATE(BenchAccumulate, std::vector<int>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchAccumulate, llvm::SmallVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchAccumulate, absl::InlinedVector<int, 1024>)->Range(128, 1024);
BENCHMARK_TEMPLATE(BenchAccumulate, llvm_vecsmall::SmallVector<int, 1024>)->Range(128, 1024);


int main(int argc, char **argv)
{
    std::cout << std::numeric_limits<double>::max_digits10 << '\n';
    std::cout<<sizeof(std::pair<std::vector<std::string>::value_type,int64_t>)<<'\n';
    llvm::SmallVector<std::pair<std::vector<std::string>::value_type,int64_t>, 1024> v;

    for (auto i = 0; i < 1024; i++)
    {
        v.push_back({});
    }
    {
        llvm_vecsmall::SmallVector<int, 1024> v;
        for (auto i = 0; i < 1024; i++)
        {
            v.push_back({});
        }

    }

    benchmark::Initialize(&argc, argv);
    benchmark::RunSpecifiedBenchmarks();

    return 0;
}