56 lines
1.2 KiB
C++
56 lines
1.2 KiB
C++
|
//
|
||
|
|
// immer: immutable data structures for C++
|
||
|
|
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
|
||
|
|
//
|
||
|
|
// This software is distributed under the Boost Software License, Version 1.0.
|
||
|
|
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
|
||
|
|
//
|
||
|
|
|
||
|
|
#pragma once
|
||
|
|
|
||
|
|
#include "benchmark/config.hpp"
|
||
|
|
|
||
|
|
#include <immer/set.hpp>
|
||
|
|
#include <hash_trie.hpp> // Phil Nash
|
||
|
|
#include <boost/container/flat_set.hpp>
|
||
|
|
#include <set>
|
||
|
|
#include <unordered_set>
|
||
|
|
|
||
|
|
namespace {
|
||
|
|
|
||
|
|
template <typename Generator, typename Set>
|
||
|
|
auto benchmark_insert_mut_std()
|
||
|
|
{
|
||
|
|
return [] (nonius::chronometer meter)
|
||
|
|
{
|
||
|
|
auto n = meter.param<N>();
|
||
|
|
auto g = Generator{}(n);
|
||
|
|
|
||
|
|
measure(meter, [&] {
|
||
|
|
auto v = Set{};
|
||
|
|
for (auto i = 0u; i < n; ++i)
|
||
|
|
v.insert(g[i]);
|
||
|
|
return v;
|
||
|
|
});
|
||
|
|
};
|
||
|
|
}
|
||
|
|
|
||
|
|
template <typename Generator, typename Set>
|
||
|
|
auto benchmark_insert()
|
||
|
|
{
|
||
|
|
return [] (nonius::chronometer meter)
|
||
|
|
{
|
||
|
|
auto n = meter.param<N>();
|
||
|
|
auto g = Generator{}(n);
|
||
|
|
|
||
|
|
measure(meter, [&] {
|
||
|
|
auto v = Set{};
|
||
|
|
for (auto i = 0u; i < n; ++i)
|
||
|
|
v = v.insert(g[i]);
|
||
|
|
return v;
|
||
|
|
});
|
||
|
|
};
|
||
|
|
}
|
||
|
|
|
||
|
|
} // namespace
|