feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

Flesh out test suite to cover all permutations of transparent/non-transparent Hash & KeyEqual pairs

Browse Source
This commit is contained in:
LeonineKing1199
2021-11-22 13:30:10 -08:00
parent 8ba710637a
commit 93216374ef
1 changed files with 163 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

186
test/unordered/transparent_tests.cpp
View File

@ -59,37 +59,177 @@ struct transparent_key_equal
bool transparent_key_equal::was_called_;
struct hasher
{
std::size_t operator()(key const& k) const
{
return boost::hash<int>()(k.x_);
}
};
struct key_equal
{
static bool was_called_;
bool operator()(key const& k1, key const& k2) const { return k1.x_ == k2.x_; }
bool operator()(int const x, key const& k1) const
{
was_called_ = true;
return k1.x_ == x;
}
};
bool key_equal::was_called_;
UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
key::count_ = 0;
transparent_key_equal::was_called_ = false;
{
// transparent Hash, transparent KeyEqual
//
boost::unordered_map<key, int, transparent_hasher, transparent_key_equal> map;
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
// 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);
boost::unordered_map<key, int, transparent_hasher, transparent_key_equal>
map;
// now the number of `key` objects created should be a constant and never
// touched again
//
std::size_t count = 0;
count = map.count(0);
// 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);
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 2);
BOOST_TEST(map.key_eq().was_called_);
// now the number of `key` objects created should be a constant and never
// touched again
//
std::size_t count = 0;
count = map.count(0);
count = map.count(1);
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ == 2);
BOOST_TEST(map.key_eq().was_called_);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 2);
count = map.count(1);
count = map.count(key(0));
BOOST_TEST(count == 1);
BOOST_TEST(key::count_ > 2);
BOOST_TEST(count == 0);
BOOST_TEST(key::count_ == 2);
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(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);
}
{
// transparent Hash, non-transparent KeyEqual
//
key::count_ = 0;
transparent_key_equal::was_called_ = false;
key_equal::was_called_ = false;
boost::unordered_map<key, int, transparent_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(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()