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

Clean up tests to be a bit more readable

Browse Source
This commit is contained in:
LeonineKing1199
2021-11-23 12:15:53 -08:00
parent bc9eca70d0
commit 3f1e4a703a
1 changed files with 53 additions and 112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

165
test/unordered/transparent_tests.cpp
View File

@@ -74,14 +74,51 @@ struct key_equal
bool key_equal::was_called_; bool key_equal::was_called_;
void count_reset()
{
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
}
template <class UnorderedMap> void test_non_transparent_count()
{
count_reset();
UnorderedMap map;
// initial `key(0)` expression increases the count
// then copying into the `unordered_map` increments the count again thus we
// have 2
//
map[key(0)] = 1337;
BOOST_TEST(key::count_ == 2);
// rely on the implicit constructor here to spawn a new object which
// increases the count
//
std::size_t count = 0;
count = map.count(0);
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 3);
BOOST_TEST(!map.key_eq().was_called_);
count = map.count(1);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 4);
count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 5);
}
UNORDERED_AUTO_TEST (unordered_map_transparent_count) { UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
{ {
// transparent Hash, transparent KeyEqual // transparent Hash, transparent KeyEqual
// //
count_reset();
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
boost::unordered_map<key, int, transparent_hasher, transparent_key_equal> boost::unordered_map<key, int, transparent_hasher, transparent_key_equal>
map; map;
@@ -109,120 +146,24 @@ UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
BOOST_TEST(key::count_ == 2); BOOST_TEST(key::count_ == 2);
count = map.count(key(0)); count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ > 2);
}
{
// non-transparent Hash, non-transparent KeyEqual
//
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
boost::unordered_map<key, int, hasher, key_equal> map;
// initial `key(0)` expression increases the count
// then copying into the `unordered_map` increments the count again thus we
// have 2
//
map[key(0)] = 1337;
BOOST_TEST(key::count_ == 2);
// rely on the implicit constructor here to spawn a new object which
// increases the count
//
std::size_t count = 0;
count = map.count(0);
BOOST_TEST(count == 1); BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 3); BOOST_TEST(key::count_ == 3);
BOOST_TEST(!map.key_eq().was_called_);
count = map.count(1);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 4);
count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 5);
} }
{ // non-transparent Hash, non-transparent KeyEqual
// transparent Hash, non-transparent KeyEqual //
// test_non_transparent_count<
boost::unordered_map<key, int, hasher, key_equal> >();
key::count_ = 0; // transparent Hash, non-transparent KeyEqual
transparent_key_equal::was_called_ = false; //
key_equal::was_called_ = false; test_non_transparent_count<
boost::unordered_map<key, int, transparent_hasher, key_equal> >();
boost::unordered_map<key, int, transparent_hasher, key_equal> map; // non-transparent Hash, transparent KeyEqual
//
// initial `key(0)` expression increases the count test_non_transparent_count<
// then copying into the `unordered_map` increments the count again thus we boost::unordered_map<key, int, hasher, transparent_key_equal> >();
// have 2
//
map[key(0)] = 1337;
BOOST_TEST(key::count_ == 2);
// rely on the implicit constructor here to spawn a new object which
// increases the count
//
std::size_t count = 0;
count = map.count(0);
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 3);
BOOST_TEST(!map.key_eq().was_called_);
count = map.count(1);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 4);
count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 5);
}
{
// non-transparent Hash, transparent KeyEqual
//
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
boost::unordered_map<key, int, hasher, transparent_key_equal> map;
// initial `key(0)` expression increases the count
// then copying into the `unordered_map` increments the count again thus we
// have 2
//
map[key(0)] = 1337;
BOOST_TEST(key::count_ == 2);
// rely on the implicit constructor here to spawn a new object which
// increases the count
//
std::size_t count = 0;
count = map.count(0);
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 3);
BOOST_TEST(!map.key_eq().was_called_);
count = map.count(1);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 4);
count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 5);
}
} }
RUN_TESTS() RUN_TESTS()