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

Add erase_key_equiv_impl() member function

Browse Source
This commit is contained in:
Christian Mazakas
2021-12-21 09:20:40 -08:00
parent 854a5aa3c3
commit 85cb09ae6d
1 changed files with 10 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
include/boost/unordered/detail/implementation.hpp
View File

@ -3800,14 +3800,16 @@ namespace boost {
// //
// no throw // no throw
std::size_t erase_key_equiv(const_key_type& k) template <class KeyEqual, class Key>
std::size_t erase_key_equiv_impl(KeyEqual const& key_eq, Key const& k)
{ {
if (!this->size_) if (!this->size_)
return 0; return 0;
std::size_t key_hash = this->hash(k); std::size_t key_hash = policy::apply_hash(this->hash_function(), k);
std::size_t bucket_index = this->hash_to_bucket(key_hash); std::size_t bucket_index = this->hash_to_bucket(key_hash);
link_pointer prev = this->find_previous_node(k, bucket_index); link_pointer prev =
this->find_previous_node_impl(key_eq, k, bucket_index);
if (!prev) if (!prev)
return 0; return 0;
@ -3825,6 +3827,11 @@ namespace boost {
return deleted_count; return deleted_count;
} }
std::size_t erase_key_equiv(const_key_type& k)
{
return this->erase_key_equiv_impl(this->key_eq(), k);
}
link_pointer erase_nodes_equiv(node_pointer i, node_pointer j) link_pointer erase_nodes_equiv(node_pointer i, node_pointer j)
{ {
std::size_t bucket_index = this->node_bucket(i); std::size_t bucket_index = this->node_bucket(i);