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
|
// Copyright 2017, 2018 Peter Dimov.
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/hash2/hash_append.hpp>
#include <boost/hash2/fnv1a.hpp>
#include <boost/core/lightweight_test.hpp>
#include <set>
#include <unordered_set>
template<class Hash, class Flavor, class Set, class R> void test( R r )
{
{
Set s;
for( int i = 0; i < 64; ++i )
{
s.insert( i );
}
Hash h;
Flavor f;
hash_append( h, f, s );
BOOST_TEST_EQ( h.result(), r );
}
{
Set s;
for( int i = 0; i < 64; ++i )
{
s.insert( 63 - i );
}
Hash h;
Flavor f;
hash_append( h, f, s );
BOOST_TEST_EQ( h.result(), r );
}
{
Set s;
for( int i = 0; i < 64; ++i )
{
s.insert( ( i * 17 ) % 64 );
}
Hash h;
Flavor f;
hash_append( h, f, s );
BOOST_TEST_EQ( h.result(), r );
}
}
int main()
{
using namespace boost::hash2;
test< fnv1a_32, little_endian_flavor, std::set<int> >( 2078558933ul );
test< fnv1a_64, little_endian_flavor, std::set<int> >( 6271229243378528309ull );
test< fnv1a_32, little_endian_flavor, std::multiset<int> >( 2078558933ul );
test< fnv1a_64, little_endian_flavor, std::multiset<int> >( 6271229243378528309ull );
test< fnv1a_32, little_endian_flavor, std::unordered_set<int> >( 396645525ul );
test< fnv1a_64, little_endian_flavor, std::unordered_set<int> >( 2830007867253608057ull );
test< fnv1a_32, little_endian_flavor, std::unordered_multiset<int> >( 396645525ul );
test< fnv1a_64, little_endian_flavor, std::unordered_multiset<int> >( 2830007867253608057ull );
return boost::report_errors();
}
|
