1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17
#include <algorithm>
#include <array>
#include <cstddef>
#include <deque>
#include <string>
#include <vector>
#include "benchmark/benchmark.h"
#include "common.h"
int main(int argc, char** argv) {
auto std_partial_sort = [](auto first, auto mid, auto last) { return std::partial_sort(first, mid, last); };
// Benchmark {std,ranges}::partial_sort on various types of data. We always partially sort only
// half of the full range.
//
// We perform this benchmark in a batch because we need to restore the
// state of the container after the operation.
//
// Also note that we intentionally don't benchmark the predicated version of the algorithm
// because that makes the benchmark run too slowly.
{
auto bm = []<class Container>(std::string name, auto partial_sort, auto generate_data) {
benchmark::RegisterBenchmark(
name,
[partial_sort, generate_data](auto& st) {
std::size_t const size = st.range(0);
constexpr std::size_t BatchSize = 32;
using ValueType = typename Container::value_type;
std::vector<ValueType> data = generate_data(size);
std::array<Container, BatchSize> c;
std::fill_n(c.begin(), BatchSize, Container(data.begin(), data.end()));
std::size_t const half = size / 2;
while (st.KeepRunningBatch(BatchSize)) {
for (std::size_t i = 0; i != BatchSize; ++i) {
benchmark::DoNotOptimize(c[i]);
partial_sort(c[i].begin(), c[i].begin() + half, c[i].end());
benchmark::DoNotOptimize(c[i]);
}
st.PauseTiming();
for (std::size_t i = 0; i != BatchSize; ++i) {
std::copy(data.begin(), data.end(), c[i].begin());
}
st.ResumeTiming();
}
})
->Arg(8)
->Arg(1024)
->Arg(8192);
};
auto register_bm = [&](auto generate, std::string variant) {
auto gen2 = [generate](auto size) {
std::vector<int> data = generate(size);
std::vector<support::NonIntegral> real_data(data.begin(), data.end());
return real_data;
};
auto name = [variant](std::string op) { return op + " (" + variant + ")"; };
bm.operator()<std::vector<int>>(name("std::partial_sort(vector<int>)"), std_partial_sort, generate);
bm.operator()<std::vector<support::NonIntegral>>(
name("std::partial_sort(vector<NonIntegral>)"), std_partial_sort, gen2);
bm.operator()<std::deque<int>>(name("std::partial_sort(deque<int>)"), std_partial_sort, generate);
bm.operator()<std::vector<int>>(name("rng::partial_sort(vector<int>)"), std::ranges::partial_sort, generate);
bm.operator()<std::vector<support::NonIntegral>>(
name("rng::partial_sort(vector<NonIntegral>)"), std::ranges::partial_sort, gen2);
bm.operator()<std::deque<int>>(name("rng::partial_sort(deque<int>)"), std::ranges::partial_sort, generate);
};
register_bm(support::quicksort_adversarial_data<int>, "qsort adversarial");
register_bm(support::ascending_sorted_data<int>, "ascending");
register_bm(support::descending_sorted_data<int>, "descending");
register_bm(support::pipe_organ_data<int>, "pipe-organ");
register_bm(support::heap_data<int>, "heap");
register_bm(support::shuffled_data<int>, "shuffled");
register_bm(support::single_element_data<int>, "repeated");
}
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
benchmark::Shutdown();
return 0;
}
|
