From 19a45e028af268d51bae2ab4150dce199733c9e1 Mon Sep 17 00:00:00 2001
From: Daniel James <daniel@calamity.org.uk>
Date: Sun, 23 Apr 2017 10:09:18 +0100
Subject: [PATCH] Expand calls to generic_find_node

---
 include/boost/unordered/detail/implementation.hpp |  7 -------
 include/boost/unordered/unordered_map.hpp         | 12 ++++++++----
 include/boost/unordered/unordered_set.hpp         |  6 ++++--
 3 files changed, 12 insertions(+), 13 deletions(-)

diff --git a/include/boost/unordered/detail/implementation.hpp b/include/boost/unordered/detail/implementation.hpp
index f680283c..b7f18498 100644
--- a/include/boost/unordered/detail/implementation.hpp
+++ b/include/boost/unordered/detail/implementation.hpp
@@ -3230,13 +3230,6 @@ struct table : boost::unordered::detail::functions<typename Types::hasher,
 
     // 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
     {
         return this->find_node_impl(key_hash, k, this->key_eq());
diff --git a/include/boost/unordered/unordered_map.hpp b/include/boost/unordered/unordered_map.hpp
index b0e7055d..d5c45f3e 100644
--- a/include/boost/unordered/unordered_map.hpp
+++ b/include/boost/unordered/unordered_map.hpp
@@ -1647,7 +1647,8 @@ typename unordered_map<K, T, H, P, A>::iterator
 unordered_map<K, T, H, P, A>::find(CompatibleKey const& k,
     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>
@@ -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,
     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>
@@ -2096,7 +2098,8 @@ typename unordered_multimap<K, T, H, P, A>::iterator
 unordered_multimap<K, T, H, P, A>::find(CompatibleKey const& k,
     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>
@@ -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,
     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>
diff --git a/include/boost/unordered/unordered_set.hpp b/include/boost/unordered/unordered_set.hpp
index 86f553c4..cda04175 100644
--- a/include/boost/unordered/unordered_set.hpp
+++ b/include/boost/unordered/unordered_set.hpp
@@ -1328,7 +1328,8 @@ typename unordered_set<T, H, P, A>::const_iterator
 unordered_set<T, H, P, A>::find(CompatibleKey const& k,
     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>
@@ -1716,7 +1717,8 @@ typename unordered_multiset<T, H, P, A>::const_iterator
 unordered_multiset<T, H, P, A>::find(CompatibleKey const& k,
     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>