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

Merge pull request #72 from cmazakas/multiset-heterogeneous-count

Browse Source 
Multiset Heterogeneous `count()`
This commit is contained in:
Peter Dimov
2022-01-04 21:40:31 +02:00
committed by GitHub
parent 2dfdaca3eb d5e5c08b87
commit 7a177d6ac0
2 changed files with 16 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
include/boost/unordered/unordered_set.hpp
View File

@ -1092,6 +1092,18 @@ namespace boost {
size_type count(const key_type&) const;
template <class Key>
typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
size_type>::type
count(const Key& k) const
{
node_pointer n = table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
return n ? table_.group_count(n) : 0;
}
std::pair<const_iterator, const_iterator> equal_range(
const key_type&) const;

4
test/unordered/transparent_tests.cpp
View File

@ -1605,6 +1605,7 @@ void test_unordered_multiset()
transparent_key_equal>
unordered_set;
test_set_transparent_count<unordered_set>();
test_set_transparent_find<unordered_set>();
test_set_transparent_erase<unordered_set>();
test_set_transparent_equal_range<unordered_set>();
@ -1615,6 +1616,7 @@ void test_unordered_multiset()
//
typedef boost::unordered_multiset<key, hasher, key_equal> unordered_set;
test_set_non_transparent_count<unordered_set>();
test_set_non_transparent_find<unordered_set>();
test_set_non_transparent_erase<unordered_set>();
test_set_non_transparent_equal_range<unordered_set>();
@ -1626,6 +1628,7 @@ void test_unordered_multiset()
typedef boost::unordered_multiset<key, transparent_hasher, key_equal>
unordered_set;
test_set_non_transparent_count<unordered_set>();
test_set_non_transparent_find<unordered_set>();
test_set_non_transparent_erase<unordered_set>();
test_set_non_transparent_equal_range<unordered_set>();
@ -1637,6 +1640,7 @@ void test_unordered_multiset()
typedef boost::unordered_multiset<key, hasher, transparent_key_equal>
unordered_set;
test_set_non_transparent_count<unordered_set>();
test_set_non_transparent_find<unordered_set>();
test_set_non_transparent_erase<unordered_set>();
test_set_non_transparent_equal_range<unordered_set>();