92a873c746
* introduce offset for faster linearization of non-growing axes * added traits::is_inclusive and constexpr bool inclusive() methods for builtin axes * bug fixes for fill method when weight array is used with non-inclusive axis and when growing axes are used * bug fix of axis::options::test(...) * coverage tested with gcc-8, updated CONTRIBUTING.md with coverage info
177 lines
7.4 KiB
C++
177 lines
7.4 KiB
C++
// Copyright 2015-2019 Hans Dembinski
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0.
|
|
// (See accompanying file LICENSE_1_0.txt
|
|
// or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
|
|
#include <benchmark/benchmark.h>
|
|
#include <boost/histogram/axis/regular.hpp>
|
|
#include <boost/histogram/storage_adaptor.hpp>
|
|
#include <memory>
|
|
#include "../test/throw_exception.hpp"
|
|
#include "../test/utility_histogram.hpp"
|
|
#include "generator.hpp"
|
|
|
|
#include <boost/assert.hpp>
|
|
struct assert_check {
|
|
assert_check() {
|
|
BOOST_ASSERT(false); // don't run with asserts enabled
|
|
}
|
|
} _;
|
|
|
|
using SStore = std::vector<double>;
|
|
|
|
// make benchmark compatible with older versions of the library
|
|
#if __has_include(<boost/histogram/unlimited_storage.hpp>)
|
|
#include <boost/histogram/unlimited_storage.hpp>
|
|
using DStore = boost::histogram::unlimited_storage<>;
|
|
#else
|
|
#include <boost/histogram/adaptive_storage.hpp>
|
|
using DStore = boost::histogram::adaptive_storage<>;
|
|
#endif
|
|
|
|
using namespace boost::histogram;
|
|
using reg = axis::regular<>;
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_1d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
for (auto _ : state) benchmark::DoNotOptimize(h(gen()));
|
|
state.SetItemsProcessed(state.iterations());
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_n_1d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
for (auto _ : state) h.fill(gen);
|
|
state.SetItemsProcessed(state.iterations() * gen.size());
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_2d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
for (auto _ : state) benchmark::DoNotOptimize(h(gen(), gen()));
|
|
state.SetItemsProcessed(state.iterations() * 2);
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_n_2d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
auto v = {gen, gen};
|
|
for (auto _ : state) h.fill(v);
|
|
state.SetItemsProcessed(state.iterations() * 2 * gen.size());
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_3d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1), reg(100, 0, 1), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
for (auto _ : state) benchmark::DoNotOptimize(h(gen(), gen(), gen()));
|
|
state.SetItemsProcessed(state.iterations() * 3);
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_n_3d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(100, 0, 1), reg(100, 0, 1), reg(100, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
auto v = {gen, gen, gen};
|
|
for (auto _ : state) h.fill(v);
|
|
state.SetItemsProcessed(state.iterations() * 3 * gen.size());
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_6d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(10, 0, 1), reg(10, 0, 1), reg(10, 0, 1),
|
|
reg(10, 0, 1), reg(10, 0, 1), reg(10, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
for (auto _ : state)
|
|
benchmark::DoNotOptimize(h(gen(), gen(), gen(), gen(), gen(), gen()));
|
|
state.SetItemsProcessed(state.iterations() * 6);
|
|
}
|
|
|
|
template <class Distribution, class Tag, class Storage = SStore>
|
|
static void fill_n_6d(benchmark::State& state) {
|
|
auto h = make_s(Tag(), Storage(), reg(10, 0, 1), reg(10, 0, 1), reg(10, 0, 1),
|
|
reg(10, 0, 1), reg(10, 0, 1), reg(10, 0, 1));
|
|
auto gen = generator<Distribution>();
|
|
auto v = {gen, gen, gen, gen, gen, gen};
|
|
for (auto _ : state) h.fill(v);
|
|
state.SetItemsProcessed(state.iterations() * 6 * gen.size());
|
|
}
|
|
|
|
BENCHMARK_TEMPLATE(fill_1d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_1d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_1d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_1d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_1d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_1d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_1d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_1d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_n_1d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_1d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_1d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_1d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_1d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_1d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_1d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_1d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_2d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_2d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_2d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_2d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_2d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_2d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_2d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_2d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_n_2d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_2d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_2d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_2d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_2d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_2d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_2d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_2d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_3d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_3d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_3d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_3d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_3d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_3d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_3d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_3d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_n_3d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_3d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_3d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_3d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_3d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_3d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_3d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_3d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_6d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_6d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_6d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_6d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_6d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_6d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_6d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_6d, normal, dynamic_tag, DStore);
|
|
|
|
BENCHMARK_TEMPLATE(fill_n_6d, uniform, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_6d, uniform, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_6d, normal, static_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_6d, normal, static_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_6d, uniform, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_6d, uniform, dynamic_tag, DStore);
|
|
BENCHMARK_TEMPLATE(fill_n_6d, normal, dynamic_tag);
|
|
// BENCHMARK_TEMPLATE(fill_n_6d, normal, dynamic_tag, DStore);
|