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

Merge pull request #81 from cmazakas/set-contains

Browse Source 
Implement `unordered_set::contains()`
This commit is contained in:
Peter Dimov
2022-01-13 21:27:22 +02:00
committed by GitHub
parent 6700ecaf43 f5d470c531
commit e1c58b4584
2 changed files with 95 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -507,6 +507,23 @@ namespace boost {
const_iterator find(CompatibleKey const&, CompatibleHash const&,
CompatiblePredicate const&) const;
bool contains(key_type const& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
template <class Key>
typename boost::enable_if_c<detail::are_transparent<Key, H, P>::value,
bool>::type
contains(const Key& k) const
{
return table_.find_node_impl(
table::policy::apply_hash(this->hash_function(), k), k,
this->key_eq());
}
size_type count(const key_type&) const;
template <class Key>

78
test/unordered/contains_tests.cpp
View File

@ -169,9 +169,87 @@ void test_multimap()
test_map_non_transparent_contains<non_transparent_multimap3>();
}
template <class UnorderedSet> void test_set_transparent_contains()
{
count_reset();
UnorderedSet set;
bool contains = set.contains(0);
BOOST_TEST(!contains);
BOOST_TEST_EQ(key::count_, 0);
set.insert(0);
set.insert(0);
set.insert(0);
set.insert(1);
int const expected_key_count = key::count_;
contains = set.contains(0);
BOOST_TEST(contains);
contains = set.contains(1);
BOOST_TEST(contains);
contains = set.contains(2);
BOOST_TEST(!contains);
BOOST_TEST_EQ(key::count_, expected_key_count);
}
template <class UnorderedSet> void test_set_non_transparent_contains()
{
count_reset();
UnorderedSet set;
bool contains = set.contains(0);
BOOST_TEST(!contains);
BOOST_TEST_EQ(key::count_, 1);
set.insert(0);
set.insert(0);
set.insert(0);
set.insert(1);
int key_count = key::count_;
contains = set.contains(0);
++key_count;
BOOST_TEST(contains);
contains = set.contains(1);
++key_count;
BOOST_TEST(contains);
contains = set.contains(2);
++key_count;
BOOST_TEST(!contains);
BOOST_TEST_EQ(key::count_, key_count);
}
void test_set()
{
typedef boost::unordered_set<key, transparent_hasher, transparent_key_equal>
transparent_set;
typedef boost::unordered_set<key, transparent_hasher, key_equal>
non_transparent_set1;
typedef boost::unordered_set<key, hasher, transparent_key_equal>
non_transparent_set2;
typedef boost::unordered_set<key, hasher, key_equal> non_transparent_set3;
test_set_transparent_contains<transparent_set>();
test_set_non_transparent_contains<non_transparent_set1>();
test_set_non_transparent_contains<non_transparent_set2>();
test_set_non_transparent_contains<non_transparent_set3>();
}
UNORDERED_AUTO_TEST (contains) {
test_map();
test_multimap();
test_set();
}
RUN_TESTS()