mirror of
https://github.com/boostorg/container_hash.git
synced 2025-08-02 05:54:37 +02:00
Add hash_multiset_test
This commit is contained in:
@@ -86,3 +86,5 @@ run hash_vector_test2.cpp ;
|
||||
|
||||
run hash_string_test3.cpp ;
|
||||
run hash_string_test4.cpp ;
|
||||
|
||||
run hash_multiset_test.cpp ;
|
||||
|
46
test/hash_multiset_test.cpp
Normal file
46
test/hash_multiset_test.cpp
Normal file
@@ -0,0 +1,46 @@
|
||||
// Copyright 2021, 2022 Peter Dimov.
|
||||
// Distributed under the Boost Software License, Version 1.0.
|
||||
// https://www.boost.org/LICENSE_1_0.txt
|
||||
|
||||
#if defined(__GNUC__) && __GNUC__ == 8
|
||||
# pragma GCC diagnostic ignored "-Wsign-conversion"
|
||||
#endif
|
||||
|
||||
#include <boost/container_hash/hash.hpp>
|
||||
#include <boost/core/lightweight_test.hpp>
|
||||
#include <set>
|
||||
|
||||
template<class T> void test()
|
||||
{
|
||||
typedef std::multiset<T> set;
|
||||
typedef boost::hash<set> hash;
|
||||
|
||||
int const N = 32;
|
||||
|
||||
std::size_t h[ N ];
|
||||
|
||||
set v;
|
||||
|
||||
for( int i = 0; i < N; ++i )
|
||||
{
|
||||
h[ i ] = hash()( v );
|
||||
|
||||
BOOST_TEST_EQ( h[ i ], hash()( v ) );
|
||||
|
||||
for( int j = 0; j < i; ++j )
|
||||
{
|
||||
BOOST_TEST_NE( h[ j ], h[ i ] );
|
||||
}
|
||||
|
||||
v.insert( T() );
|
||||
}
|
||||
}
|
||||
|
||||
int main()
|
||||
{
|
||||
test<int>();
|
||||
test<float>();
|
||||
test<double>();
|
||||
|
||||
return boost::report_errors();
|
||||
}
|
Reference in New Issue
Block a user