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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// <unordered_map>
// template <class Key, class T, class Hash, class Pred, class Alloc>
// bool
// operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
// const unordered_map<Key, T, Hash, Pred, Alloc>& y);
//
// template <class Key, class T, class Hash, class Pred, class Alloc>
// bool
// operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x,
// const unordered_map<Key, T, Hash, Pred, Alloc>& y);
// Implements paper: http://wg21.link/p0809
#include <unordered_map>
#include <cstddef>
#include <limits>
#include <cassert>
#include <functional>
template <class T>
std::size_t hash_identity(T val) {
return val;
}
template <class T>
std::size_t hash_neg(T val) {
return std::numeric_limits<T>::max() - val;
}
template <class T>
std::size_t hash_scale(T val) {
return static_cast<std::size_t>(val << 1);
}
template <class T>
std::size_t hash_even(T val) {
return val & 1 ? 1 : 0;
}
template <class T>
std::size_t hash_same(T /*val*/) {
return 1;
}
template <class T>
std::size_t hash_identity(T* val) {
return *val;
}
template <class T>
std::size_t hash_neg(T* val) {
return std::numeric_limits<T>::max() - *val;
}
template <class T>
std::size_t hash_scale(T* val) {
return static_cast<std::size_t>(*val << 1);
}
template <class T>
std::size_t hash_even(T* val) {
return *val & 1 ? 1 : 0;
}
template <class Map, class Ittr>
void populate(Map& m, Ittr start, Ittr end) {
for (auto *p1 = start, *p2 = end - 1; p1 != end; ++p1, --p2) {
m.insert(std::make_pair(*p1, *p2));
}
}
template <class T, std::size_t N>
void test(T (&vals)[N]) {
using Hash = std::size_t (*)(T);
using C = std::unordered_map<T, T, Hash, std::equal_to<T> >;
C c1(0, hash_identity);
C c2(0, hash_neg);
C c3(0, hash_scale);
C c4(0, hash_even);
C c5(0, hash_same);
populate(c1, std::begin(vals), std::end(vals));
populate(c2, std::begin(vals), std::end(vals));
populate(c3, std::begin(vals), std::end(vals));
populate(c4, std::begin(vals), std::end(vals));
populate(c5, std::begin(vals), std::end(vals));
assert(c1 == c1);
assert(c1 == c2);
assert(c1 == c3);
assert(c1 == c4);
assert(c1 == c5);
assert(c2 == c1);
assert(c2 == c2);
assert(c2 == c3);
assert(c2 == c4);
assert(c2 == c5);
assert(c3 == c1);
assert(c3 == c2);
assert(c3 == c3);
assert(c3 == c4);
assert(c3 == c5);
assert(c4 == c1);
assert(c4 == c2);
assert(c4 == c3);
assert(c4 == c4);
assert(c4 == c5);
assert(c5 == c1);
assert(c5 == c2);
assert(c5 == c3);
assert(c5 == c4);
assert(c5 == c5);
}
int main(int, char**) {
{
std::size_t vals[] = {
// clang-format off
1,
2, 2,
3, 3, 3,
4, 4, 4, 4,
5, 5, 5, 5, 5,
6, 6, 6, 6, 6, 6,
7, 7, 7, 7, 7, 7, 7,
8, 8, 8, 8, 8, 8, 8, 8,
9, 9, 9, 9, 9, 9, 9, 9, 9,
10
// clang-format on
};
test(vals);
}
{
bool vals[] = {true, false};
test(vals);
}
{
char* vals[] = {(char*)("a"), (char*)("b"), (char*)("cde")};
test(vals);
}
return 0;
}
|
