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
|
// Copyright 2021, 2022 Peter Dimov.
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt
#include <boost/container_hash/hash.hpp>
#include <boost/core/lightweight_test.hpp>
#include <algorithm>
#include <vector>
int main()
{
int const N = 16;
std::vector<int> v;
for( int i = 0; i < N; ++i )
{
v.push_back( i );
}
std::size_t h0 = boost::hash_unordered_range( v.begin(), v.end() );
int const M = 256;
for( int i = 0; i < M; ++i )
{
std::next_permutation( v.begin(), v.end() );
std::size_t h1 = boost::hash_unordered_range( v.begin(), v.end() );
BOOST_TEST_EQ( h0, h1 );
}
return boost::report_errors();
}
|
