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

Add transparent test support for set's find()

Browse Source
This commit is contained in:
Christian Mazakas
2021-12-22 15:03:59 -08:00
parent b39b6b7635
commit 1b009da4d0
1 changed files with 149 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

149
test/unordered/transparent_tests.cpp
View File

@ -253,6 +253,118 @@ template <class UnorderedMap> void test_map_non_transparent_find()
}
}
template <class UnorderedSet> void test_set_transparent_find()
{
count_reset();
typedef typename UnorderedSet::const_iterator set_iterator;
UnorderedSet set;
int n = 5;
for (int i = 0; i < n; ++i) {
set.insert(i);
}
int const expected_key_count = key::count_;
// explicitly test `find()` and `find() const` separately
//
{
UnorderedSet& m = set;
for (int i = 0; i < n; ++i) {
set_iterator pos = m.find(i);
BOOST_TEST(pos != m.end());
BOOST_TEST_EQ(*pos, i);
}
BOOST_TEST_EQ(key::count_, expected_key_count);
set_iterator pos = m.find(1337);
BOOST_TEST(pos == m.end());
BOOST_TEST_EQ(key::count_, expected_key_count);
}
{
UnorderedSet const& m = set;
for (int i = 0; i < n; ++i) {
set_iterator pos = m.find(i);
BOOST_TEST(pos != m.end());
BOOST_TEST_EQ(*pos, i);
}
BOOST_TEST_EQ(key::count_, expected_key_count);
set_iterator pos = m.find(1337);
BOOST_TEST(pos == m.end());
BOOST_TEST_EQ(key::count_, expected_key_count);
}
}
template <class UnorderedSet> void test_set_non_transparent_find()
{
count_reset();
typedef typename UnorderedSet::const_iterator set_iterator;
UnorderedSet set;
int n = 5;
for (int i = 0; i < n; ++i) {
set.insert(i);
}
int key_count = key::count_;
// explicitly test `find()` and `find() const` separately
//
{
UnorderedSet& m = set;
for (int i = 0; i < n; ++i) {
set_iterator pos = m.find(i);
++key_count;
BOOST_TEST(pos != m.end());
BOOST_TEST_EQ(*pos, i);
}
BOOST_TEST_EQ(key::count_, key_count);
set_iterator pos = m.find(1337);
++key_count;
BOOST_TEST(pos == m.end());
BOOST_TEST_EQ(key::count_, key_count);
}
{
UnorderedSet const& m = set;
for (int i = 0; i < n; ++i) {
set_iterator pos = m.find(i);
++key_count;
BOOST_TEST(pos != m.end());
BOOST_TEST_EQ(*pos, i);
}
BOOST_TEST_EQ(key::count_, key_count);
set_iterator pos = m.find(1337);
++key_count;
BOOST_TEST(pos == m.end());
BOOST_TEST_EQ(key::count_, key_count);
}
}
template <class UnorderedMap> void test_transparent_equal_range()
{
count_reset();
@ -869,9 +981,46 @@ void test_unordered_multimap()
}
}
void test_unordered_set()
{
{
typedef boost::unordered_set<key, transparent_hasher, transparent_key_equal>
unordered_set;
test_set_transparent_find<unordered_set>();
}
{
// non-transparent Hash, non-transparent KeyEqual
//
typedef boost::unordered_set<key, hasher, key_equal> unordered_set;
test_set_non_transparent_find<unordered_set>();
}
{
// transparent Hash, non-transparent KeyEqual
//
typedef boost::unordered_set<key, transparent_hasher, key_equal>
unordered_set;
test_set_non_transparent_find<unordered_set>();
}
{
// non-transparent Hash, transparent KeyEqual
//
typedef boost::unordered_set<key, hasher, transparent_key_equal>
unordered_set;
test_set_non_transparent_find<unordered_set>();
}
}
UNORDERED_AUTO_TEST (transparent_ops) {
test_unordered_map();
test_unordered_multimap();
test_unordered_set();
}
RUN_TESTS()