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

Merge pull request #53 from LeonineKing1199/heterogeneous-equal-range

Browse Source 
Implement heterogeneous `equal_range()` for `unordered_map`
This commit is contained in:
Peter Dimov
2021-12-02 21:19:28 +02:00
committed by GitHub
parent 3646a7143e a97483b928
commit a98a719546
2 changed files with 275 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

28
include/boost/unordered/unordered_map.hpp
View File

@ -799,6 +799,34 @@ namespace boost {
std::pair<const_iterator, const_iterator> equal_range(
const key_type&) const;
template <class Key>
typename boost::enable_if_c<detail::is_transparent<Key, H>::value &&
detail::is_transparent<Key, P>::value,
std::pair<iterator, iterator> >::type
equal_range(const Key& key)
{
node_pointer p = table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), key), key,
this->key_eq());
return std::make_pair(
iterator(p), iterator(p ? table::next_node(p) : p));
}
template <class Key>
typename boost::enable_if_c<detail::is_transparent<Key, H>::value &&
detail::is_transparent<Key, P>::value,
std::pair<const_iterator, const_iterator> >::type
equal_range(const Key& key) const
{
node_pointer p = table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), key), key,
this->key_eq());
return std::make_pair(
const_iterator(p), const_iterator(p ? table::next_node(p) : p));
}
mapped_type& operator[](const key_type&);
mapped_type& operator[](BOOST_RV_REF(key_type));
mapped_type& at(const key_type&);

247
test/unordered/transparent_tests.cpp
View File

@ -272,6 +272,249 @@ template <class UnorderedMap> void test_non_transparent_find()
}
}
template <class UnorderedMap> void test_transparent_equal_range()
{
count_reset();
UnorderedMap unordered_map;
// empty tests
//
// explicitly test `equal_range()` vs `equal_range() const`
//
{
typedef typename UnorderedMap::iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap& map = unordered_map;
BOOST_TEST(map.empty());
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
}
{
typedef typename UnorderedMap::const_iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap const& map = unordered_map;
BOOST_TEST(map.empty());
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
}
BOOST_TEST(key::count_ == 0);
unordered_map[key(0)] = 1337;
unordered_map[key(1)] = 1338;
unordered_map[key(2)] = 1339;
int const expected_key_count = 6;
BOOST_TEST(key::count_ == expected_key_count);
typedef typename UnorderedMap::value_type value_type;
// explicitly test `equal_range()` vs `equal_range() const`
//
{
typedef typename UnorderedMap::iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap& map = unordered_map;
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin != end);
BOOST_TEST(begin != map.end());
BOOST_TEST(std::distance(begin, end) == 1);
value_type const& val = *begin;
BOOST_TEST(val.first.x_ == 0);
BOOST_TEST(val.second == 1337);
iters = map.equal_range(1337);
begin = iters.first;
end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
BOOST_TEST(key::count_ == expected_key_count);
}
{
typedef typename UnorderedMap::const_iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap const& map = unordered_map;
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin != end);
BOOST_TEST(begin != map.end());
BOOST_TEST(std::distance(begin, end) == 1);
value_type const& val = *begin;
BOOST_TEST(val.first.x_ == 0);
BOOST_TEST(val.second == 1337);
iters = map.equal_range(1337);
begin = iters.first;
end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
BOOST_TEST(key::count_ == expected_key_count);
}
}
template <class UnorderedMap> void test_non_transparent_equal_range()
{
count_reset();
UnorderedMap unordered_map;
// empty tests
//
// explicitly test `equal_range()` vs `equal_range() const`
//
{
typedef typename UnorderedMap::iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap& map = unordered_map;
BOOST_TEST(map.empty());
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
}
{
typedef typename UnorderedMap::const_iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap const& map = unordered_map;
BOOST_TEST(map.empty());
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
}
BOOST_TEST(key::count_ == 2);
unordered_map[key(0)] = 1337;
unordered_map[key(1)] = 1338;
unordered_map[key(2)] = 1339;
int key_count = 8;
BOOST_TEST(key::count_ == key_count);
typedef typename UnorderedMap::value_type value_type;
// explicitly test `equal_range()` vs `equal_range() const`
//
{
typedef typename UnorderedMap::iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap& map = unordered_map;
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin != end);
BOOST_TEST(begin != map.end());
BOOST_TEST(std::distance(begin, end) == 1);
value_type const& val = *begin;
BOOST_TEST(val.first.x_ == 0);
BOOST_TEST(val.second == 1337);
iters = map.equal_range(1337);
begin = iters.first;
end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
BOOST_TEST(key::count_ == 2 + key_count);
key_count += 2;
}
{
typedef typename UnorderedMap::const_iterator iterator;
typedef std::pair<iterator, iterator> iterator_pair;
UnorderedMap const& map = unordered_map;
iterator_pair iters = map.equal_range(0);
iterator begin = iters.first;
iterator end = iters.second;
BOOST_TEST(begin != end);
BOOST_TEST(begin != map.end());
BOOST_TEST(std::distance(begin, end) == 1);
value_type const& val = *begin;
BOOST_TEST(val.first.x_ == 0);
BOOST_TEST(val.second == 1337);
iters = map.equal_range(1337);
begin = iters.first;
end = iters.second;
BOOST_TEST(begin == end);
BOOST_TEST(begin == map.end());
BOOST_TEST(std::distance(begin, end) == 0);
BOOST_TEST(key::count_ == 2 + key_count);
}
}
UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
{
typedef boost::unordered_map<key, int, transparent_hasher,
@ -280,6 +523,7 @@ UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
test_transparent_count<unordered_map>();
test_transparent_find<unordered_map>();
test_transparent_equal_range<unordered_map>();
}
{
@ -289,6 +533,7 @@ UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
test_non_transparent_count<unordered_map>();
test_non_transparent_find<unordered_map>();
test_non_transparent_equal_range<unordered_map>();
}
{
@ -299,6 +544,7 @@ UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
test_non_transparent_count<unordered_map>();
test_non_transparent_find<unordered_map>();
test_non_transparent_equal_range<unordered_map>();
}
{
@ -309,6 +555,7 @@ UNORDERED_AUTO_TEST (unordered_map_transparent_count) {
test_non_transparent_count<unordered_map>();
test_non_transparent_find<unordered_map>();
test_non_transparent_equal_range<unordered_map>();
}
}