mirror of
https://github.com/boostorg/unordered.git
synced 2025-07-31 20:04:29 +02:00
Expand calls to generic_find_node
This commit is contained in:
@@ -3230,13 +3230,6 @@ struct table : boost::unordered::detail::functions<typename Types::hasher,
|
|||||||
|
|
||||||
// Find Node
|
// Find Node
|
||||||
|
|
||||||
template <typename Key, typename Hash, typename Pred>
|
|
||||||
node_pointer generic_find_node(
|
|
||||||
Key const& k, Hash const& hf, Pred const& eq) const
|
|
||||||
{
|
|
||||||
return this->find_node_impl(policy::apply_hash(hf, k), k, eq);
|
|
||||||
}
|
|
||||||
|
|
||||||
node_pointer find_node(std::size_t key_hash, const_key_type& k) const
|
node_pointer find_node(std::size_t key_hash, const_key_type& k) const
|
||||||
{
|
{
|
||||||
return this->find_node_impl(key_hash, k, this->key_eq());
|
return this->find_node_impl(key_hash, k, this->key_eq());
|
||||||
|
@@ -1647,7 +1647,8 @@ typename unordered_map<K, T, H, P, A>::iterator
|
|||||||
unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
|
unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq)
|
CompatibleHash const& hash, CompatiblePredicate const& eq)
|
||||||
{
|
{
|
||||||
return iterator(table_.generic_find_node(k, hash, eq));
|
return iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class K, class T, class H, class P, class A>
|
template <class K, class T, class H, class P, class A>
|
||||||
@@ -1656,7 +1657,8 @@ typename unordered_map<K, T, H, P, A>::const_iterator
|
|||||||
unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
|
unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
||||||
{
|
{
|
||||||
return const_iterator(table_.generic_find_node(k, hash, eq));
|
return const_iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class K, class T, class H, class P, class A>
|
template <class K, class T, class H, class P, class A>
|
||||||
@@ -2096,7 +2098,8 @@ typename unordered_multimap<K, T, H, P, A>::iterator
|
|||||||
unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
|
unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq)
|
CompatibleHash const& hash, CompatiblePredicate const& eq)
|
||||||
{
|
{
|
||||||
return iterator(table_.generic_find_node(k, hash, eq));
|
return iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class K, class T, class H, class P, class A>
|
template <class K, class T, class H, class P, class A>
|
||||||
@@ -2105,7 +2108,8 @@ typename unordered_multimap<K, T, H, P, A>::const_iterator
|
|||||||
unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
|
unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
||||||
{
|
{
|
||||||
return const_iterator(table_.generic_find_node(k, hash, eq));
|
return const_iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class K, class T, class H, class P, class A>
|
template <class K, class T, class H, class P, class A>
|
||||||
|
@@ -1328,7 +1328,8 @@ typename unordered_set<T, H, P, A>::const_iterator
|
|||||||
unordered_set<T, H, P, A>::find(CompatibleKey const& k,
|
unordered_set<T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
||||||
{
|
{
|
||||||
return const_iterator(table_.generic_find_node(k, hash, eq));
|
return const_iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class T, class H, class P, class A>
|
template <class T, class H, class P, class A>
|
||||||
@@ -1716,7 +1717,8 @@ typename unordered_multiset<T, H, P, A>::const_iterator
|
|||||||
unordered_multiset<T, H, P, A>::find(CompatibleKey const& k,
|
unordered_multiset<T, H, P, A>::find(CompatibleKey const& k,
|
||||||
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
CompatibleHash const& hash, CompatiblePredicate const& eq) const
|
||||||
{
|
{
|
||||||
return const_iterator(table_.generic_find_node(k, hash, eq));
|
return const_iterator(
|
||||||
|
table_.find_node_impl(table::policy::apply_hash(hash, k), k, eq));
|
||||||
}
|
}
|
||||||
|
|
||||||
template <class T, class H, class P, class A>
|
template <class T, class H, class P, class A>
|
||||||
|
Reference in New Issue
Block a user