Squashed 'third_party/immer/' content from commit ad3e3556d
git-subtree-dir: third_party/immer git-subtree-split: ad3e3556d38bb75966dd24c61a774970a7c7957e
This commit is contained in:
commit
7f19d64164
311 changed files with 74223 additions and 0 deletions
111
benchmark/set/iter.hpp
Normal file
111
benchmark/set/iter.hpp
Normal file
|
|
@ -0,0 +1,111 @@
|
|||
//
|
||||
// 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 <immer/box.hpp>
|
||||
#include <immer/algorithm.hpp>
|
||||
#include <hash_trie.hpp> // Phil Nash
|
||||
#include <boost/container/flat_set.hpp>
|
||||
#include <set>
|
||||
#include <unordered_set>
|
||||
#include <numeric>
|
||||
|
||||
namespace {
|
||||
|
||||
template <typename T>
|
||||
struct iter_step
|
||||
{
|
||||
unsigned operator() (unsigned x, const T& y) const
|
||||
{
|
||||
return x + y;
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct iter_step<std::string>
|
||||
{
|
||||
unsigned operator() (unsigned x, const std::string& y) const
|
||||
{
|
||||
return x + (unsigned) y.size();
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct iter_step<immer::box<std::string>>
|
||||
{
|
||||
unsigned operator() (unsigned x, const immer::box<std::string>& y) const
|
||||
{
|
||||
return x + (unsigned) y->size();
|
||||
}
|
||||
};
|
||||
|
||||
template <typename Generator, typename Set>
|
||||
auto benchmark_access_std_iter()
|
||||
{
|
||||
return [] (nonius::chronometer meter)
|
||||
{
|
||||
auto n = meter.param<N>();
|
||||
auto g1 = Generator{}(n);
|
||||
|
||||
auto v = Set{};
|
||||
for (auto i = 0u; i < n; ++i)
|
||||
v.insert(g1[i]);
|
||||
|
||||
using step_t = iter_step<typename decltype(g1)::value_type>;
|
||||
measure(meter, [&] {
|
||||
volatile auto c = std::accumulate(v.begin(), v.end(), 0u, step_t{});
|
||||
return c;
|
||||
});
|
||||
};
|
||||
}
|
||||
|
||||
template <typename Generator, typename Set>
|
||||
auto benchmark_access_reduce()
|
||||
{
|
||||
return [] (nonius::chronometer meter)
|
||||
{
|
||||
auto n = meter.param<N>();
|
||||
auto g1 = Generator{}(n);
|
||||
|
||||
auto v = Set{};
|
||||
for (auto i = 0u; i < n; ++i)
|
||||
v = v.insert(g1[i]);
|
||||
|
||||
using step_t = iter_step<typename decltype(g1)::value_type>;
|
||||
measure(meter, [&] {
|
||||
volatile auto c = immer::accumulate(v, 0u, step_t{});
|
||||
return c;
|
||||
});
|
||||
};
|
||||
}
|
||||
|
||||
template <typename Generator, typename Set>
|
||||
auto benchmark_access_iter()
|
||||
{
|
||||
return [] (nonius::chronometer meter)
|
||||
{
|
||||
auto n = meter.param<N>();
|
||||
auto g1 = Generator{}(n);
|
||||
|
||||
auto v = Set{};
|
||||
for (auto i = 0u; i < n; ++i)
|
||||
v = v.insert(g1[i]);
|
||||
|
||||
using step_t = iter_step<typename decltype(g1)::value_type>;
|
||||
measure(meter, [&] {
|
||||
volatile auto c = std::accumulate(v.begin(), v.end(), 0u, step_t{});
|
||||
return c;
|
||||
});
|
||||
};
|
||||
}
|
||||
|
||||
} // namespace
|
||||
Loading…
Add table
Add a link
Reference in a new issue