boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-30 11:27:15 +02:00
Code Issues Packages Projects Releases Wiki Activity

Remove out-of-line defintion for transparent count() to hopefully appease msvc-9.0

Browse Source
This commit is contained in:
LeonineKing1199
2021-11-22 15:43:28 -08:00
parent 93216374ef
commit fd0cab2ab8
1 changed files with 11 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -761,7 +761,17 @@ namespace boost {
typename boost::enable_if_c<detail::is_transparent<Key, H>::value &&
detail::is_transparent<Key, P>::value,
size_type>::type
count(const Key&) const;
count(const Key& k) const
{
std::size_t const key_hash =
table::policy::apply_hash(this->hash_function(), k);
P const& eq = this->key_eq();
node_pointer p = table_.find_node_impl(key_hash, k, eq);
return (p ? 1 : 0);
}
std::pair<iterator, iterator> equal_range(const key_type&);
std::pair<const_iterator, const_iterator> equal_range(
@ -1843,23 +1853,6 @@ namespace boost {
return table_.find_node(k) ? 1 : 0;
}
template <class K, class T, class H, class P, class A>
template <class Key>
typename boost::enable_if_c<detail::is_transparent<Key, H>::value &&
detail::is_transparent<Key, P>::value,
typename unordered_map<K, T, H, P, A>::size_type>::type
unordered_map<K, T, H, P, A>::count(const Key& k) const
{
std::size_t const key_hash =
table::policy::apply_hash(this->hash_function(), k);
P const& eq = this->key_eq();
node_pointer p = table_.find_node_impl(key_hash, k, eq);
return (p ? 1 : 0);
}
template <class K, class T, class H, class P, class A>
std::pair<typename unordered_map<K, T, H, P, A>::iterator,
typename unordered_map<K, T, H, P, A>::iterator>