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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
// Copyright (C) 2012-2015 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-std=gnu++11" }
#include <testsuite_performance.h>
#include <random>
#include <sstream>
#include <tr1/unordered_set>
#include <unordered_set>
#define USE_MY_FOO 1
struct Foo
{
#if USE_MY_FOO
typedef std::random_device::result_type _Type;
_Type bar;
_Type baz;
_Type meh;
void
init(std::random_device& randev)
{
bar = randev();
baz = randev();
meh = randev();
}
#else
int bar;
int baz;
int meh;
Foo()
{ bar = random(); baz = random(); meh = random(); }
Foo(const Foo&) = default;
#endif
std::size_t
hash() const noexcept
{ return std::size_t(bar ^ baz ^ meh); }
inline bool
operator==(const Foo& other) const
{ return other.bar == bar && other.baz == baz && other.meh == meh; }
};
struct HashFunction
{
template<typename T>
std::size_t operator()(const T& t) const noexcept
{ return t.hash(); }
};
const int sz = 300000;
template<typename _ContType>
void
bench(const char* container_desc, const typename _ContType::value_type* foos)
{
using namespace __gnu_test;
_ContType s;
time_counter time;
resource_counter resource;
start_counters(time, resource);
for (int i = 0; i != sz ; ++i)
s.insert(foos[i]);
stop_counters(time, resource);
std::ostringstream ostr;
ostr << container_desc << sz << " insertion attempts, "
<< s.size() << " inserted";
report_performance(__FILE__, ostr.str().c_str(), time, resource);
// Try to insert again to check performance of collision detection
const int nb_loop = 10;
start_counters(time, resource);
for (int j = 0; j != nb_loop; ++j)
for (int i = 0; i != sz; ++i)
s.insert(foos[i]);
stop_counters(time, resource);
ostr.str("");
ostr << container_desc << nb_loop << " times insertion of "
<< sz << " elements";
report_performance(__FILE__, ostr.str().c_str(), time, resource);
}
template<bool cache>
using __tr1_uset = std::tr1::__unordered_set<Foo, HashFunction,
std::equal_to<Foo>,
std::allocator<Foo>,
cache>;
template<bool cache>
using __tr1_umset = std::tr1::__unordered_multiset<Foo, HashFunction,
std::equal_to<Foo>,
std::allocator<Foo>,
cache>;
template<bool cache>
using __uset = std::__uset_hashtable<Foo, HashFunction,
std::equal_to<Foo>,
std::allocator<Foo>,
std::__uset_traits<cache>>;
template<bool cache>
using __umset = std::__umset_hashtable<Foo, HashFunction,
std::equal_to<Foo>,
std::allocator<Foo>,
std::__uset_traits<cache>>;
int main()
{
using namespace __gnu_test;
{
int bars[sz];
for (int i = 0; i != sz; ++i)
bars[i] = i;
bench<std::tr1::unordered_set<int>>(
"std::tr1::unordered_set<int> ", bars);
bench<std::unordered_set<int>>(
"std::unordered_set<int> ", bars);
}
Foo foos[sz];
#if USE_MY_FOO
{
std::random_device randev;
for (int i = 0; i != sz; ++i)
foos[i].init(randev);
}
#endif
time_counter time;
resource_counter resource;
start_counters(time, resource);
bench<__tr1_uset<false>>(
"std::tr1::unordered_set without hash code cached ", foos);
bench<__tr1_uset<true>>(
"std::tr1::unordered_set with hash code cached ", foos);
bench<__tr1_umset<false>>(
"std::tr1::unordered_multiset without hash code cached ", foos);
bench<__tr1_umset<true>>(
"std::tr1::unordered_multiset with hash code cached ", foos);
stop_counters(time, resource);
report_performance(__FILE__, "tr1 benches", time, resource);
start_counters(time, resource);
bench<__uset<false>>(
"std::unordered_set without hash code cached ", foos);
bench<__uset<true>>(
"std::unordered_set with hash code cached ", foos);
bench<__umset<false>>(
"std::unordered_multiset without hash code cached ", foos);
bench<__umset<true>>(
"std::unordered_multiset with hash code cached ", foos);
stop_counters(time, resource);
report_performance(__FILE__, "std benches", time, resource);
bench<std::unordered_set<Foo, HashFunction>>(
"std::unordered_set default cache ", foos);
bench<std::unordered_multiset<Foo, HashFunction>>(
"std::unordered_multiset default cache ", foos);
}
|
