boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 19:37:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Extra tests for equality with different hash functions.

Browse Source 
[SVN r49924]
This commit is contained in:
Daniel James
2008-11-24 22:55:14 +00:00
parent f0bb74a530
commit 527a72860d
1 changed files with 24 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
test/unordered/equality_tests.cpp
View File

@ -13,6 +13,10 @@ namespace equality_tests
{ {
struct mod_compare struct mod_compare
{ {
bool alt_hash_;
explicit mod_compare(bool alt_hash = false) : alt_hash_(alt_hash) {}
bool operator()(int x, int y) const bool operator()(int x, int y) const
{ {
return x % 1000 == y % 1000; return x % 1000 == y % 1000;
@ -20,7 +24,7 @@ namespace equality_tests
int operator()(int x) const int operator()(int x) const
{ {
return x % 250; return alt_hash_ ? x % 250 : (x + 5) % 250;
} }
}; };
@ -138,6 +142,25 @@ namespace equality_tests
((1)(2))((1001)(1)), ==, ((1001)(2))((1)(1))); ((1)(2))((1001)(1)), ==, ((1001)(2))((1)(1)));
} }
// Test that equality still works when the two containers have
// different hash functions but the same equality predicate.
UNORDERED_AUTO_TEST(equality_different_hash_test)
{
typedef boost::unordered_set<int, mod_compare, mod_compare> set;
set set1(0, mod_compare(false), mod_compare(false));
set set2(0, mod_compare(true), mod_compare(true));
BOOST_CHECK(set1 == set2);
set1.insert(1); set2.insert(2);
BOOST_CHECK(set1 != set2);
set1.insert(2); set2.insert(1);
BOOST_CHECK(set1 == set2);
set1.insert(10); set2.insert(20);
BOOST_CHECK(set1 != set2);
set1.insert(20); set2.insert(10);
BOOST_CHECK(set1 == set2);
}
} }
RUN_TESTS() RUN_TESTS()