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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
|
// Copyright 2017-2019, 2024 Peter Dimov.
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#define _CRT_SECURE_NO_WARNINGS
#include <boost/hash2/fnv1a.hpp>
#include <boost/hash2/siphash.hpp>
#include <boost/hash2/xxhash.hpp>
#include <boost/hash2/xxh3.hpp>
#include <boost/hash2/md5.hpp>
#include <boost/hash2/hash_append.hpp>
#include <boost/hash2/get_integral_result.hpp>
#include <boost/unordered/unordered_flat_set.hpp>
#include <boost/core/type_name.hpp>
#include <cstdint>
#include <random>
#include <chrono>
#include <typeinfo>
#include <cstddef>
#include <cstdio>
#include <string>
#include <vector>
#include <type_traits>
namespace detail
{
template<class Hash, class T> inline void compute_hash_value_impl( Hash& h, T const& v, std::false_type )
{
boost::hash2::hash_append( h, {}, v );
}
template<class Hash, class T> inline void compute_hash_value_impl( Hash& h, T const& v, std::true_type )
{
boost::hash2::hash_append_range( h, {}, v.data(), v.data() + v.size() );
}
template<class Hash, class T> inline std::size_t compute_hash_value( Hash& h, T const& v )
{
detail::compute_hash_value_impl( h, v, boost::container_hash::is_contiguous_range<T>() );
return boost::hash2::get_integral_result<std::size_t>( h );
}
} // namespace detail
template<class T, class H> class hash_without_seed
{
public:
using is_avalanching = std::true_type;
std::size_t operator()( T const& v ) const
{
H h;
return detail::compute_hash_value( h, v );
}
};
template<class T, class H> class hash_with_uint64_seed
{
private:
std::uint64_t seed_;
public:
using is_avalanching = std::true_type;
explicit hash_with_uint64_seed( std::uint64_t seed ): seed_( seed )
{
}
std::size_t operator()( T const& v ) const
{
H h( seed_ );
return detail::compute_hash_value( h, v );
}
};
template<class T, class H> class hash_with_byte_seed
{
private:
H h_;
public:
using is_avalanching = std::true_type;
hash_with_byte_seed( unsigned char const* seed, std::size_t n ): h_( seed, n )
{
}
std::size_t operator()( T const& v ) const
{
H h( h_ );
return detail::compute_hash_value( h, v );
}
};
template<class V, class S> BOOST_NOINLINE void test4( int N, V const& v, char const * hash, S s )
{
typedef std::chrono::steady_clock clock_type;
clock_type::time_point t1 = clock_type::now();
for( int i = 0; i < N; ++i )
{
s.insert( v[ i * 16 ] );
}
clock_type::time_point t2 = clock_type::now();
std::size_t q = 0;
for( int i = 0; i < 16 * N; ++i )
{
q += s.count( v[ i ] );
}
clock_type::time_point t3 = clock_type::now();
long long ms1 = std::chrono::duration_cast<std::chrono::milliseconds>( t2 - t1 ).count();
long long ms2 = std::chrono::duration_cast<std::chrono::milliseconds>( t3 - t2 ).count();
std::size_t n = s.bucket_count();
std::printf( "%s: n=%zu, q=%zu, %lld + %lld = %lld ms\n", hash, n, q, ms1, ms2, ms1 + ms2 );
}
template<class K, class H, class V> void test2( int N, V const& v )
{
{
std::string name = boost::core::type_name<H>() + " without seed";
using hash = hash_without_seed<K, H>;
boost::unordered_flat_set<K, hash> s( 0, hash() );
test4( N, v, name.c_str(), s );
}
{
constexpr std::uint64_t seed = 0x0102030405060708ull;
std::string name = boost::core::type_name<H>() + " with uint64 seed";
using hash = hash_with_uint64_seed<K, H>;
boost::unordered_flat_set<K, hash> s( 0, hash( seed ) );
test4( N, v, name.c_str(), s );
}
{
static constexpr unsigned char seed[ 16 ] = { 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10 };
std::string name = boost::core::type_name<H>() + " with byte seed";
using hash = hash_with_byte_seed<K, H>;
boost::unordered_flat_set<K, hash> s( 0, hash( seed, sizeof(seed) ) );
test4( N, v, name.c_str(), s );
}
std::puts( "" );
}
int main()
{
int const N = 1048576;
std::vector<std::string> v;
{
v.reserve( N * 16 );
std::mt19937_64 rnd;
for( int i = 0; i < 16 * N; ++i )
{
char buffer[ 64 ];
unsigned long long k = rnd();
if( k & 1 )
{
std::snprintf( buffer, sizeof( buffer ), "prefix_%llu_suffix", k );
}
else
{
std::snprintf( buffer, sizeof( buffer ), "{%u}", static_cast<unsigned>( k ) );
}
v.push_back( buffer );
}
}
typedef std::string K;
{
boost::unordered_flat_set<K> s;
test4( N, v, "default boost::hash without seed", s );
std::puts( "" );
}
test2<K, boost::hash2::fnv1a_32>( N, v );
test2<K, boost::hash2::fnv1a_64>( N, v );
test2<K, boost::hash2::xxhash_32>( N, v );
test2<K, boost::hash2::xxhash_64>( N, v );
test2<K, boost::hash2::xxh3_128>( N, v );
test2<K, boost::hash2::siphash_32>( N, v );
test2<K, boost::hash2::siphash_64>( N, v );
test2<K, boost::hash2::md5_128>( N, v );
}
|
