blob: 89443a597e85a021871b8b726d223f6689ae2438 (
plain)
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
|
//===----------------------------------------------------------------------===//
//
// 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 <string>
#include <unordered_set>
#include <utility>
#include "associative_container_benchmarks.h"
#include "benchmark/benchmark.h"
template <class K>
struct support::adapt_operations<std::unordered_set<K>> {
using ValueType = typename std::unordered_set<K>::value_type;
using KeyType = typename std::unordered_set<K>::key_type;
static ValueType value_from_key(KeyType const& k) { return k; }
static KeyType key_from_value(ValueType const& value) { return value; }
using InsertionResult = std::pair<typename std::unordered_set<K>::iterator, bool>;
static auto get_iterator(InsertionResult const& result) { return result.first; }
};
int main(int argc, char** argv) {
support::associative_container_benchmarks<std::unordered_set<int>>("std::unordered_set<int>");
support::associative_container_benchmarks<std::unordered_set<std::string>>("std::unordered_set<std::string>");
benchmark::Initialize(&argc, argv);
benchmark::RunSpecifiedBenchmarks();
benchmark::Shutdown();
return 0;
}
|
