passenger 5.1.4 → 5.1.5

data/src/cxx_supportlib/vendor-modified/boost/unordered/unordered_map_fwd.hpp

@@ -11,55 +11,51 @@
 #pragma once
 #endif
 
-#include <memory>
-#include <functional>
 #include <boost/functional/hash_fwd.hpp>
 #include <boost/unordered/detail/fwd.hpp>
+#include <functional>
+#include <memory>
 
-namespace boost
-{
-    namespace unordered
-    {
-        template <class K,
-            class T,
-            class H = boost::hash<K>,
-            class P = std::equal_to<K>,
-            class A = std::allocator<std::pair<const K, T> > >
-        class unordered_map;
-
-        template <class K, class T, class H, class P, class A>
-        inline bool operator==(unordered_map<K, T, H, P, A> const&,
-            unordered_map<K, T, H, P, A> const&);
-        template <class K, class T, class H, class P, class A>
-        inline bool operator!=(unordered_map<K, T, H, P, A> const&,
-            unordered_map<K, T, H, P, A> const&);
-        template <class K, class T, class H, class P, class A>
-        inline void swap(unordered_map<K, T, H, P, A>&,
-                unordered_map<K, T, H, P, A>&);
-
-        template <class K,
-            class T,
-            class H = boost::hash<K>,
-            class P = std::equal_to<K>,
-            class A = std::allocator<std::pair<const K, T> > >
-        class unordered_multimap;
-
-        template <class K, class T, class H, class P, class A>
-        inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
-            unordered_multimap<K, T, H, P, A> const&);
-        template <class K, class T, class H, class P, class A>
-        inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
-            unordered_multimap<K, T, H, P, A> const&);
-        template <class K, class T, class H, class P, class A>
-        inline void swap(unordered_multimap<K, T, H, P, A>&,
-                unordered_multimap<K, T, H, P, A>&);
-    }
+namespace boost {
+namespace unordered {
+template <class K, class T, class H = boost::hash<K>,
+    class P = std::equal_to<K>,
+    class A = std::allocator<std::pair<const K, T> > >
+class unordered_map;
+
+template <class K, class T, class H, class P, class A>
+inline bool operator==(
+    unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
+template <class K, class T, class H, class P, class A>
+inline bool operator!=(
+    unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
+template <class K, class T, class H, class P, class A>
+inline void swap(unordered_map<K, T, H, P, A>&, unordered_map<K, T, H, P, A>&);
+
+template <class K, class T, class H = boost::hash<K>,
+    class P = std::equal_to<K>,
+    class A = std::allocator<std::pair<const K, T> > >
+class unordered_multimap;
+
+template <class K, class T, class H, class P, class A>
+inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
+    unordered_multimap<K, T, H, P, A> const&);
+template <class K, class T, class H, class P, class A>
+inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
+    unordered_multimap<K, T, H, P, A> const&);
+template <class K, class T, class H, class P, class A>
+inline void swap(
+    unordered_multimap<K, T, H, P, A>&, unordered_multimap<K, T, H, P, A>&);
+
+template <class N, class K, class T, class A> class node_handle_map;
+template <class N, class K, class T, class A> struct insert_return_type_map;
+}
 
-    using boost::unordered::unordered_map;
-    using boost::unordered::unordered_multimap;
-    using boost::unordered::swap;
-    using boost::unordered::operator==;
-    using boost::unordered::operator!=;
+using boost::unordered::unordered_map;
+using boost::unordered::unordered_multimap;
+using boost::unordered::swap;
+using boost::unordered::operator==;
+using boost::unordered::operator!=;
 }
 
 #endif

data/src/cxx_supportlib/vendor-modified/boost/unordered/unordered_set.hpp

@@ -14,12 +14,10 @@
 #pragma once
 #endif
 
-#include <boost/unordered/unordered_set_fwd.hpp>
-#include <boost/unordered/detail/equivalent.hpp>
-#include <boost/unordered/detail/unique.hpp>
-#include <boost/unordered/detail/util.hpp>
+#include <boost/core/explicit_operator_bool.hpp>
 #include <boost/functional/hash.hpp>
 #include <boost/move/move.hpp>
+#include <boost/unordered/detail/set.hpp>
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 #include <initializer_list>
@@ -28,1522 +26,1861 @@
 #if defined(BOOST_MSVC)
 #pragma warning(push)
 #if BOOST_MSVC >= 1400
-#pragma warning(disable:4396) //the inline specifier cannot be used when a
-                              // friend declaration refers to a specialization
-                              // of a function template
+#pragma warning(disable : 4396) // the inline specifier cannot be used when a
+// friend declaration refers to a specialization
+// of a function template
 #endif
 #endif
 
-namespace boost
+namespace boost {
+namespace unordered {
+template <class T, class H, class P, class A> class unordered_set
 {
-namespace unordered
-{
-    template <class T, class H, class P, class A>
-    class unordered_set
-    {
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        BOOST_COPYABLE_AND_MOVABLE(unordered_set)
+    BOOST_COPYABLE_AND_MOVABLE(unordered_set)
 #endif
-    public:
+    template <typename, typename, typename, typename>
+    friend class unordered_multiset;
 
-        typedef T key_type;
-        typedef T value_type;
-        typedef H hasher;
-        typedef P key_equal;
-        typedef A allocator_type;
+  public:
+    typedef T key_type;
+    typedef T value_type;
+    typedef H hasher;
+    typedef P key_equal;
+    typedef A allocator_type;
 
-    private:
+  private:
+    typedef boost::unordered::detail::set<A, T, H, P> types;
+    typedef typename types::value_allocator_traits value_allocator_traits;
+    typedef typename types::table table;
 
-        typedef boost::unordered::detail::set<A, T, H, P> types;
-        typedef typename types::traits allocator_traits;
-        typedef typename types::table table;
+  public:
+    typedef typename value_allocator_traits::pointer pointer;
+    typedef typename value_allocator_traits::const_pointer const_pointer;
 
-    public:
+    typedef value_type& reference;
+    typedef value_type const& const_reference;
 
-        typedef typename allocator_traits::pointer pointer;
-        typedef typename allocator_traits::const_pointer const_pointer;
+    typedef std::size_t size_type;
+    typedef std::ptrdiff_t difference_type;
 
-        typedef value_type& reference;
-        typedef value_type const& const_reference;
+    typedef typename table::cl_iterator const_local_iterator;
+    typedef typename table::l_iterator local_iterator;
+    typedef typename table::c_iterator const_iterator;
+    typedef typename table::iterator iterator;
+    typedef typename types::node_type node_type;
+    typedef typename types::insert_return_type insert_return_type;
 
-        typedef std::size_t size_type;
-        typedef std::ptrdiff_t difference_type;
+  private:
+    table table_;
 
-        typedef typename table::cl_iterator const_local_iterator;
-        typedef typename table::cl_iterator local_iterator;
-        typedef typename table::c_iterator const_iterator;
-        typedef typename table::c_iterator iterator;
+  public:
+    // constructors
 
-    private:
+    unordered_set();
 
-        table table_;
+    explicit unordered_set(size_type, const hasher& = hasher(),
+        const key_equal& = key_equal(),
+        const allocator_type& = allocator_type());
 
-    public:
+    explicit unordered_set(size_type, const allocator_type&);
 
-        // constructors
+    explicit unordered_set(size_type, const hasher&, const allocator_type&);
 
-        explicit unordered_set(
-                size_type = boost::unordered::detail::default_bucket_count,
-                const hasher& = hasher(),
-                const key_equal& = key_equal(),
-                const allocator_type& = allocator_type());
+    explicit unordered_set(allocator_type const&);
 
-        explicit unordered_set(allocator_type const&);
+    template <class InputIt> unordered_set(InputIt, InputIt);
+
+    template <class InputIt>
+    unordered_set(InputIt, InputIt, size_type, const hasher& = hasher(),
+        const key_equal& = key_equal());
 
-        template <class InputIt>
-        unordered_set(InputIt, InputIt);
+    template <class InputIt>
+    unordered_set(InputIt, InputIt, size_type, const hasher&, const key_equal&,
+        const allocator_type&);
 
-        template <class InputIt>
-        unordered_set(
-                InputIt, InputIt,
-                size_type,
-                const hasher& = hasher(),
-                const key_equal& = key_equal());
+    template <class InputIt>
+    unordered_set(
+        InputIt, InputIt, size_type, const hasher&, const allocator_type&);
 
-        template <class InputIt>
-        unordered_set(
-                InputIt, InputIt,
-                size_type,
-                const hasher&,
-                const key_equal&,
-                const allocator_type&);
+    template <class InputIt>
+    unordered_set(InputIt, InputIt, size_type, const allocator_type&);
 
-        // copy/move constructors
+    // copy/move constructors
 
-        unordered_set(unordered_set const&);
+    unordered_set(unordered_set const&);
 
-        unordered_set(unordered_set const&, allocator_type const&);
+    unordered_set(unordered_set const&, allocator_type const&);
+    unordered_set(BOOST_RV_REF(unordered_set), allocator_type const&);
 
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        unordered_set(BOOST_RV_REF(unordered_set) other)
-                BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
-            : table_(other.table_, boost::unordered::detail::move_tag())
-        {
-        }
+    unordered_set(BOOST_RV_REF(unordered_set) other)
+        BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
+        : table_(other.table_, boost::unordered::detail::move_tag())
+    {
+    }
 #elif !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_set(unordered_set&& other)
-                BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
-            : table_(other.table_, boost::unordered::detail::move_tag())
-        {
-        }
-#endif
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_set(unordered_set&&, allocator_type const&);
+    unordered_set(unordered_set&& other)
+        BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
+        : table_(other.table_, boost::unordered::detail::move_tag())
+    {
+    }
 #endif
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        unordered_set(
-                std::initializer_list<value_type>,
-                size_type = boost::unordered::detail::default_bucket_count,
-                const hasher& = hasher(),
-                const key_equal&l = key_equal(),
-                const allocator_type& = allocator_type());
+    unordered_set(std::initializer_list<value_type>,
+        size_type = boost::unordered::detail::default_bucket_count,
+        const hasher& = hasher(), const key_equal& l = key_equal(),
+        const allocator_type& = allocator_type());
+    unordered_set(std::initializer_list<value_type>, size_type, const hasher&,
+        const allocator_type&);
+    unordered_set(
+        std::initializer_list<value_type>, size_type, const allocator_type&);
 #endif
 
-        // Destructor
+    // Destructor
 
-        ~unordered_set() BOOST_NOEXCEPT;
+    ~unordered_set() BOOST_NOEXCEPT;
 
-        // Assign
+// Assign
 
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        unordered_set& operator=(BOOST_COPY_ASSIGN_REF(unordered_set) x)
-        {
-            table_.assign(x.table_);
-            return *this;
-        }
+    unordered_set& operator=(BOOST_COPY_ASSIGN_REF(unordered_set) x)
+    {
+        table_.assign(x.table_);
+        return *this;
+    }
 
-        unordered_set& operator=(BOOST_RV_REF(unordered_set) x)
-        {
-            table_.move_assign(x.table_);
-            return *this;
-        }
+    unordered_set& operator=(BOOST_RV_REF(unordered_set) x)
+    {
+        table_.move_assign(x.table_);
+        return *this;
+    }
 #else
-        unordered_set& operator=(unordered_set const& x)
-        {
-            table_.assign(x.table_);
-            return *this;
-        }
+    unordered_set& operator=(unordered_set const& x)
+    {
+        table_.assign(x.table_);
+        return *this;
+    }
 
 #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_set& operator=(unordered_set&& x)
-        {
-            table_.move_assign(x.table_);
-            return *this;
-        }
+    unordered_set& operator=(unordered_set&& x)
+    {
+        table_.move_assign(x.table_);
+        return *this;
+    }
 #endif
 #endif
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        unordered_set& operator=(std::initializer_list<value_type>);
+    unordered_set& operator=(std::initializer_list<value_type>);
 #endif
 
-        allocator_type get_allocator() const BOOST_NOEXCEPT
-        {
-            return table_.node_alloc();
-        }
+    allocator_type get_allocator() const BOOST_NOEXCEPT
+    {
+        return table_.node_alloc();
+    }
 
-        // size and capacity
+    // size and capacity
 
-        bool empty() const BOOST_NOEXCEPT
-        {
-            return table_.size_ == 0;
-        }
+    bool empty() const BOOST_NOEXCEPT { return table_.size_ == 0; }
 
-        size_type size() const BOOST_NOEXCEPT
-        {
-            return table_.size_;
-        }
+    size_type size() const BOOST_NOEXCEPT { return table_.size_; }
 
-        size_type max_size() const BOOST_NOEXCEPT;
+    size_type max_size() const BOOST_NOEXCEPT;
 
-        // iterators
+    // iterators
 
-        iterator begin() BOOST_NOEXCEPT
-        {
-            return table_.begin();
-        }
+    iterator begin() BOOST_NOEXCEPT { return iterator(table_.begin()); }
 
-        const_iterator begin() const BOOST_NOEXCEPT
-        {
-            return table_.begin();
-        }
+    const_iterator begin() const BOOST_NOEXCEPT
+    {
+        return const_iterator(table_.begin());
+    }
 
-        iterator end() BOOST_NOEXCEPT
-        {
-            return iterator();
-        }
+    iterator end() BOOST_NOEXCEPT { return iterator(); }
 
-        const_iterator end() const BOOST_NOEXCEPT
-        {
-            return const_iterator();
-        }
+    const_iterator end() const BOOST_NOEXCEPT { return const_iterator(); }
 
-        const_iterator cbegin() const BOOST_NOEXCEPT
-        {
-            return table_.begin();
-        }
+    const_iterator cbegin() const BOOST_NOEXCEPT
+    {
+        return const_iterator(table_.begin());
+    }
 
-        const_iterator cend() const BOOST_NOEXCEPT
-        {
-            return const_iterator();
-        }
+    const_iterator cend() const BOOST_NOEXCEPT { return const_iterator(); }
 
-        // emplace
+    // extract
+
+    node_type extract(const_iterator position)
+    {
+        return node_type(
+            table_.extract_by_iterator(position), table_.node_alloc());
+    }
+
+    node_type extract(const key_type& k)
+    {
+        return node_type(table_.extract_by_key(k), table_.node_alloc());
+    }
+
+// emplace
 
 #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-        template <class... Args>
-        std::pair<iterator, bool> emplace(BOOST_FWD_REF(Args)... args)
-        {
-            return table_.emplace(boost::forward<Args>(args)...);
-        }
+    template <class... Args>
+    std::pair<iterator, bool> emplace(BOOST_FWD_REF(Args)... args)
+    {
+        return table_.emplace(boost::forward<Args>(args)...);
+    }
 
-        template <class... Args>
-        iterator emplace_hint(const_iterator, BOOST_FWD_REF(Args)... args)
-        {
-            return table_.emplace(boost::forward<Args>(args)...).first;
-        }
+    template <class... Args>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
+    {
+        return table_.emplace_hint(hint, boost::forward<Args>(args)...);
+    }
 #else
 
 #if !BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x5100))
 
-        // 0 argument emplace requires special treatment in case
-        // the container is instantiated with a value type that
-        // doesn't have a default constructor.
+    // 0 argument emplace requires special treatment in case
+    // the container is instantiated with a value type that
+    // doesn't have a default constructor.
 
-        std::pair<iterator, bool> emplace(
-                boost::unordered::detail::empty_emplace
-                    = boost::unordered::detail::empty_emplace(),
-                value_type v = value_type())
-        {
-            return this->emplace(boost::move(v));
-        }
+    std::pair<iterator, bool> emplace(
+        boost::unordered::detail::empty_emplace =
+            boost::unordered::detail::empty_emplace(),
+        value_type v = value_type())
+    {
+        return this->emplace(boost::move(v));
+    }
 
-        iterator emplace_hint(const_iterator hint,
-                boost::unordered::detail::empty_emplace
-                    = boost::unordered::detail::empty_emplace(),
-                value_type v = value_type()
-            )
-        {
-            return this->emplace_hint(hint, boost::move(v));
-        }
+    iterator emplace_hint(const_iterator hint,
+        boost::unordered::detail::empty_emplace =
+            boost::unordered::detail::empty_emplace(),
+        value_type v = value_type())
+    {
+        return this->emplace_hint(hint, boost::move(v));
+    }
 
 #endif
 
-        template <typename A0>
-        std::pair<iterator, bool> emplace(BOOST_FWD_REF(A0) a0)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0))
-            );
-        }
+    template <typename A0>
+    std::pair<iterator, bool> emplace(BOOST_FWD_REF(A0) a0)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0)));
+    }
 
-        template <typename A0>
-        iterator emplace_hint(const_iterator, BOOST_FWD_REF(A0) a0)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0))
-            ).first;
-        }
+    template <typename A0>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(A0) a0)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0)));
+    }
 
-        template <typename A0, typename A1>
-        std::pair<iterator, bool> emplace(
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1))
-            );
-        }
+    template <typename A0, typename A1>
+    std::pair<iterator, bool> emplace(
+        BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0), boost::forward<A1>(a1)));
+    }
 
-        template <typename A0, typename A1>
-        iterator emplace_hint(const_iterator,
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1))
-            ).first;
-        }
+    template <typename A0, typename A1>
+    iterator emplace_hint(
+        const_iterator hint, BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0), boost::forward<A1>(a1)));
+    }
 
-        template <typename A0, typename A1, typename A2>
-        std::pair<iterator, bool> emplace(
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1,
-            BOOST_FWD_REF(A2) a2)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1),
-                    boost::forward<A2>(a2))
-            );
-        }
+    template <typename A0, typename A1, typename A2>
+    std::pair<iterator, bool> emplace(
+        BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1, BOOST_FWD_REF(A2) a2)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0), boost::forward<A1>(a1),
+            boost::forward<A2>(a2)));
+    }
 
-        template <typename A0, typename A1, typename A2>
-        iterator emplace_hint(const_iterator,
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1,
-            BOOST_FWD_REF(A2) a2)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1),
-                    boost::forward<A2>(a2))
-            ).first;
-        }
+    template <typename A0, typename A1, typename A2>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(A0) a0,
+        BOOST_FWD_REF(A1) a1, BOOST_FWD_REF(A2) a2)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0), boost::forward<A1>(a1),
+                      boost::forward<A2>(a2)));
+    }
 
-#define BOOST_UNORDERED_EMPLACE(z, n, _)                                    \
-            template <                                                      \
-                BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)                    \
-            >                                                               \
-            std::pair<iterator, bool> emplace(                              \
-                    BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a)      \
-            )                                                               \
-            {                                                               \
-                return table_.emplace(                                      \
-                    boost::unordered::detail::create_emplace_args(          \
-                        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD,  \
-                            a)                                              \
-                ));                                                         \
-            }                                                               \
-                                                                            \
-            template <                                                      \
-                BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)                    \
-            >                                                               \
-            iterator emplace_hint(                                          \
-                    const_iterator,                                         \
-                    BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a)      \
-            )                                                               \
-            {                                                               \
-                return table_.emplace(                                      \
-                    boost::unordered::detail::create_emplace_args(          \
-                        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD,  \
-                            a)                                              \
-                )).first;                                                   \
-            }
+#define BOOST_UNORDERED_EMPLACE(z, n, _)                                       \
+    template <BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)>                        \
+    std::pair<iterator, bool> emplace(                                         \
+        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a))                    \
+    {                                                                          \
+        return table_.emplace(boost::unordered::detail::create_emplace_args(   \
+            BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD, a)));           \
+    }                                                                          \
+                                                                               \
+    template <BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)>                        \
+    iterator emplace_hint(const_iterator hint,                                 \
+        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a))                    \
+    {                                                                          \
+        return table_.emplace_hint(                                            \
+            hint, boost::unordered::detail::create_emplace_args(               \
+                      BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD, a))); \
+    }
 
-        BOOST_PP_REPEAT_FROM_TO(4, BOOST_UNORDERED_EMPLACE_LIMIT,
-            BOOST_UNORDERED_EMPLACE, _)
+    BOOST_PP_REPEAT_FROM_TO(
+        4, BOOST_UNORDERED_EMPLACE_LIMIT, BOOST_UNORDERED_EMPLACE, _)
 
 #undef BOOST_UNORDERED_EMPLACE
 
 #endif
 
-        std::pair<iterator, bool> insert(value_type const& x)
-        {
-            return this->emplace(x);
-        }
+    std::pair<iterator, bool> insert(value_type const& x)
+    {
+        return this->emplace(x);
+    }
 
-        std::pair<iterator, bool> insert(BOOST_UNORDERED_RV_REF(value_type) x)
-        {
-            return this->emplace(boost::move(x));
-        }
+    std::pair<iterator, bool> insert(BOOST_UNORDERED_RV_REF(value_type) x)
+    {
+        return this->emplace(boost::move(x));
+    }
 
-        iterator insert(const_iterator hint, value_type const& x)
-        {
-            return this->emplace_hint(hint, x);
-        }
+    iterator insert(const_iterator hint, value_type const& x)
+    {
+        return this->emplace_hint(hint, x);
+    }
 
-        iterator insert(const_iterator hint,
-                BOOST_UNORDERED_RV_REF(value_type) x)
-        {
-            return this->emplace_hint(hint, boost::move(x));
-        }
+    iterator insert(const_iterator hint, BOOST_UNORDERED_RV_REF(value_type) x)
+    {
+        return this->emplace_hint(hint, boost::move(x));
+    }
 
-        template <class InputIt> void insert(InputIt, InputIt);
+    template <class InputIt> void insert(InputIt, InputIt);
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        void insert(std::initializer_list<value_type>);
+    void insert(std::initializer_list<value_type>);
 #endif
 
-        iterator erase(const_iterator);
-        size_type erase(const key_type&);
-        iterator erase(const_iterator, const_iterator);
-        void quick_erase(const_iterator it) { erase(it); }
-        void erase_return_void(const_iterator it) { erase(it); }
+    insert_return_type insert(BOOST_RV_REF(node_type) np)
+    {
+        insert_return_type result;
+        table_.move_insert_node_type(np, result);
+        return boost::move(result);
+    }
 
-        void clear();
-        void swap(unordered_set&);
+    iterator insert(const_iterator hint, BOOST_RV_REF(node_type) np)
+    {
+        return table_.move_insert_node_type_with_hint(hint, np);
+    }
 
-        // observers
+#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+  private:
+    // Note: Use r-value node_type to insert.
+    insert_return_type insert(node_type&);
+    iterator insert(const_iterator, node_type& np);
 
-        hasher hash_function() const;
-        key_equal key_eq() const;
+  public:
+#endif
 
-        // lookup
+    iterator erase(const_iterator);
+    size_type erase(const key_type&);
+    iterator erase(const_iterator, const_iterator);
+    void quick_erase(const_iterator it) { erase(it); }
+    void erase_return_void(const_iterator it) { erase(it); }
 
-        const_iterator find(const key_type&) const;
+    void clear();
+    void swap(unordered_set&);
 
-        template <class CompatibleKey, class CompatibleHash,
-            class CompatiblePredicate>
-        const_iterator find(
-                CompatibleKey const&,
-                CompatibleHash const&,
-                CompatiblePredicate const&) const;
+    template <typename H2, typename P2>
+    void merge(boost::unordered_set<T, H2, P2, A>& source);
 
-        size_type count(const key_type&) const;
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+    template <typename H2, typename P2>
+    void merge(boost::unordered_set<T, H2, P2, A>&& source);
+#endif
 
-        std::pair<const_iterator, const_iterator>
-        equal_range(const key_type&) const;
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+    template <typename H2, typename P2>
+    void merge(boost::unordered_multiset<T, H2, P2, A>& source);
 
-        // bucket interface
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+    template <typename H2, typename P2>
+    void merge(boost::unordered_multiset<T, H2, P2, A>&& source);
+#endif
+#endif
 
-        size_type bucket_count() const BOOST_NOEXCEPT
-        {
-            return table_.bucket_count_;
-        }
+    // observers
 
-        size_type max_bucket_count() const BOOST_NOEXCEPT
-        {
-            return table_.max_bucket_count();
-        }
+    hasher hash_function() const;
+    key_equal key_eq() const;
 
-        size_type bucket_size(size_type) const;
+    // lookup
 
-        size_type bucket(const key_type& k) const
-        {
-            return table_.hash_to_bucket(table_.hash(k));
-        }
+    const_iterator find(const key_type&) const;
 
-        local_iterator begin(size_type n)
-        {
-            return local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
+    template <class CompatibleKey, class CompatibleHash,
+        class CompatiblePredicate>
+    const_iterator find(CompatibleKey const&, CompatibleHash const&,
+        CompatiblePredicate const&) const;
 
-        const_local_iterator begin(size_type n) const
-        {
-            return const_local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
+    size_type count(const key_type&) const;
 
-        local_iterator end(size_type)
-        {
-            return local_iterator();
-        }
+    std::pair<const_iterator, const_iterator> equal_range(
+        const key_type&) const;
 
-        const_local_iterator end(size_type) const
-        {
-            return const_local_iterator();
-        }
+    // bucket interface
 
-        const_local_iterator cbegin(size_type n) const
-        {
-            return const_local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
+    size_type bucket_count() const BOOST_NOEXCEPT
+    {
+        return table_.bucket_count_;
+    }
 
-        const_local_iterator cend(size_type) const
-        {
-            return const_local_iterator();
-        }
+    size_type max_bucket_count() const BOOST_NOEXCEPT
+    {
+        return table_.max_bucket_count();
+    }
 
-        // hash policy
+    size_type bucket_size(size_type) const;
 
-        float max_load_factor() const BOOST_NOEXCEPT
-        {
-            return table_.mlf_;
-        }
+    size_type bucket(const key_type& k) const
+    {
+        return table_.hash_to_bucket(table_.hash(k));
+    }
+
+    local_iterator begin(size_type n)
+    {
+        return local_iterator(table_.begin(n), n, table_.bucket_count_);
+    }
+
+    const_local_iterator begin(size_type n) const
+    {
+        return const_local_iterator(table_.begin(n), n, table_.bucket_count_);
+    }
+
+    local_iterator end(size_type) { return local_iterator(); }
+
+    const_local_iterator end(size_type) const { return const_local_iterator(); }
+
+    const_local_iterator cbegin(size_type n) const
+    {
+        return const_local_iterator(table_.begin(n), n, table_.bucket_count_);
+    }
+
+    const_local_iterator cend(size_type) const
+    {
+        return const_local_iterator();
+    }
+
+    // hash policy
+
+    float max_load_factor() const BOOST_NOEXCEPT { return table_.mlf_; }
 
-        float load_factor() const BOOST_NOEXCEPT;
-        void max_load_factor(float) BOOST_NOEXCEPT;
-        void rehash(size_type);
-        void reserve(size_type);
+    float load_factor() const BOOST_NOEXCEPT;
+    void max_load_factor(float) BOOST_NOEXCEPT;
+    void rehash(size_type);
+    void reserve(size_type);
 
 #if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
-        friend bool operator==<T,H,P,A>(
-                unordered_set const&, unordered_set const&);
-        friend bool operator!=<T,H,P,A>(
-                unordered_set const&, unordered_set const&);
+    friend bool operator==
+        <T, H, P, A>(unordered_set const&, unordered_set const&);
+    friend bool operator!=
+        <T, H, P, A>(unordered_set const&, unordered_set const&);
 #endif
-    }; // class template unordered_set
+}; // class template unordered_set
 
-    template <class T, class H, class P, class A>
-    class unordered_multiset
-    {
+template <class T, class H, class P, class A> class unordered_multiset
+{
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        BOOST_COPYABLE_AND_MOVABLE(unordered_multiset)
+    BOOST_COPYABLE_AND_MOVABLE(unordered_multiset)
 #endif
-    public:
+    template <typename, typename, typename, typename>
+    friend class unordered_set;
 
-        typedef T key_type;
-        typedef T value_type;
-        typedef H hasher;
-        typedef P key_equal;
-        typedef A allocator_type;
+  public:
+    typedef T key_type;
+    typedef T value_type;
+    typedef H hasher;
+    typedef P key_equal;
+    typedef A allocator_type;
 
-    private:
+  private:
+    typedef boost::unordered::detail::multiset<A, T, H, P> types;
+    typedef typename types::value_allocator_traits value_allocator_traits;
+    typedef typename types::table table;
 
-        typedef boost::unordered::detail::multiset<A, T, H, P> types;
-        typedef typename types::traits allocator_traits;
-        typedef typename types::table table;
+  public:
+    typedef typename value_allocator_traits::pointer pointer;
+    typedef typename value_allocator_traits::const_pointer const_pointer;
 
-    public:
+    typedef value_type& reference;
+    typedef value_type const& const_reference;
 
-        typedef typename allocator_traits::pointer pointer;
-        typedef typename allocator_traits::const_pointer const_pointer;
+    typedef std::size_t size_type;
+    typedef std::ptrdiff_t difference_type;
 
-        typedef value_type& reference;
-        typedef value_type const& const_reference;
+    typedef typename table::cl_iterator const_local_iterator;
+    typedef typename table::l_iterator local_iterator;
+    typedef typename table::c_iterator const_iterator;
+    typedef typename table::iterator iterator;
+    typedef typename types::node_type node_type;
 
-        typedef std::size_t size_type;
-        typedef std::ptrdiff_t difference_type;
+  private:
+    table table_;
 
-        typedef typename table::cl_iterator const_local_iterator;
-        typedef typename table::cl_iterator local_iterator;
-        typedef typename table::c_iterator const_iterator;
-        typedef typename table::c_iterator iterator;
+  public:
+    // constructors
 
-    private:
+    unordered_multiset();
 
-        table table_;
+    explicit unordered_multiset(size_type, const hasher& = hasher(),
+        const key_equal& = key_equal(),
+        const allocator_type& = allocator_type());
 
-    public:
+    explicit unordered_multiset(size_type, const allocator_type&);
 
-        // constructors
+    explicit unordered_multiset(
+        size_type, const hasher&, const allocator_type&);
 
-        explicit unordered_multiset(
-                size_type = boost::unordered::detail::default_bucket_count,
-                const hasher& = hasher(),
-                const key_equal& = key_equal(),
-                const allocator_type& = allocator_type());
+    explicit unordered_multiset(allocator_type const&);
 
-        explicit unordered_multiset(allocator_type const&);
+    template <class InputIt> unordered_multiset(InputIt, InputIt);
 
-        template <class InputIt>
-        unordered_multiset(InputIt, InputIt);
+    template <class InputIt>
+    unordered_multiset(InputIt, InputIt, size_type, const hasher& = hasher(),
+        const key_equal& = key_equal());
+
+    template <class InputIt>
+    unordered_multiset(InputIt, InputIt, size_type, const hasher&,
+        const key_equal&, const allocator_type&);
 
-        template <class InputIt>
-        unordered_multiset(
-                InputIt, InputIt,
-                size_type,
-                const hasher& = hasher(),
-                const key_equal& = key_equal());
+    template <class InputIt>
+    unordered_multiset(
+        InputIt, InputIt, size_type, const hasher&, const allocator_type&);
 
-        template <class InputIt>
-        unordered_multiset(
-                InputIt, InputIt,
-                size_type,
-                const hasher&,
-                const key_equal&,
-                const allocator_type&);
+    template <class InputIt>
+    unordered_multiset(InputIt, InputIt, size_type, const allocator_type&);
 
-        // copy/move constructors
+    // copy/move constructors
 
-        unordered_multiset(unordered_multiset const&);
+    unordered_multiset(unordered_multiset const&);
 
-        unordered_multiset(unordered_multiset const&, allocator_type const&);
+    unordered_multiset(unordered_multiset const&, allocator_type const&);
+    unordered_multiset(BOOST_RV_REF(unordered_multiset), allocator_type const&);
 
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        unordered_multiset(BOOST_RV_REF(unordered_multiset) other)
-                BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
-            : table_(other.table_, boost::unordered::detail::move_tag())
-        {
-        }
+    unordered_multiset(BOOST_RV_REF(unordered_multiset) other)
+        BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
+        : table_(other.table_, boost::unordered::detail::move_tag())
+    {
+    }
 #elif !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_multiset(unordered_multiset&& other)
-                BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
-            : table_(other.table_, boost::unordered::detail::move_tag())
-        {
-        }
-#endif
-
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_multiset(unordered_multiset&&, allocator_type const&);
+    unordered_multiset(unordered_multiset&& other)
+        BOOST_NOEXCEPT_IF(table::nothrow_move_constructible)
+        : table_(other.table_, boost::unordered::detail::move_tag())
+    {
+    }
 #endif
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        unordered_multiset(
-                std::initializer_list<value_type>,
-                size_type = boost::unordered::detail::default_bucket_count,
-                const hasher& = hasher(),
-                const key_equal&l = key_equal(),
-                const allocator_type& = allocator_type());
+    unordered_multiset(std::initializer_list<value_type>,
+        size_type = boost::unordered::detail::default_bucket_count,
+        const hasher& = hasher(), const key_equal& l = key_equal(),
+        const allocator_type& = allocator_type());
+    unordered_multiset(std::initializer_list<value_type>, size_type,
+        const hasher&, const allocator_type&);
+    unordered_multiset(
+        std::initializer_list<value_type>, size_type, const allocator_type&);
 #endif
 
-        // Destructor
+    // Destructor
 
-        ~unordered_multiset() BOOST_NOEXCEPT;
+    ~unordered_multiset() BOOST_NOEXCEPT;
 
-        // Assign
+// Assign
 
 #if defined(BOOST_UNORDERED_USE_MOVE)
-        unordered_multiset& operator=(
-                BOOST_COPY_ASSIGN_REF(unordered_multiset) x)
-        {
-            table_.assign(x.table_);
-            return *this;
-        }
+    unordered_multiset& operator=(BOOST_COPY_ASSIGN_REF(unordered_multiset) x)
+    {
+        table_.assign(x.table_);
+        return *this;
+    }
 
-        unordered_multiset& operator=(BOOST_RV_REF(unordered_multiset) x)
-        {
-            table_.move_assign(x.table_);
-            return *this;
-        }
+    unordered_multiset& operator=(BOOST_RV_REF(unordered_multiset) x)
+    {
+        table_.move_assign(x.table_);
+        return *this;
+    }
 #else
-        unordered_multiset& operator=(unordered_multiset const& x)
-        {
-            table_.assign(x.table_);
-            return *this;
-        }
+    unordered_multiset& operator=(unordered_multiset const& x)
+    {
+        table_.assign(x.table_);
+        return *this;
+    }
 
 #if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-        unordered_multiset& operator=(unordered_multiset&& x)
-        {
-            table_.move_assign(x.table_);
-            return *this;
-        }
+    unordered_multiset& operator=(unordered_multiset&& x)
+    {
+        table_.move_assign(x.table_);
+        return *this;
+    }
 #endif
 #endif
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        unordered_multiset& operator=(std::initializer_list<value_type>);
+    unordered_multiset& operator=(std::initializer_list<value_type>);
 #endif
 
-        allocator_type get_allocator() const BOOST_NOEXCEPT
-        {
-            return table_.node_alloc();
-        }
+    allocator_type get_allocator() const BOOST_NOEXCEPT
+    {
+        return table_.node_alloc();
+    }
 
-        // size and capacity
+    // size and capacity
 
-        bool empty() const BOOST_NOEXCEPT
-        {
-            return table_.size_ == 0;
-        }
+    bool empty() const BOOST_NOEXCEPT { return table_.size_ == 0; }
 
-        size_type size() const BOOST_NOEXCEPT
-        {
-            return table_.size_;
-        }
+    size_type size() const BOOST_NOEXCEPT { return table_.size_; }
 
-        size_type max_size() const BOOST_NOEXCEPT;
+    size_type max_size() const BOOST_NOEXCEPT;
 
-        // iterators
+    // iterators
 
-        iterator begin() BOOST_NOEXCEPT
-        {
-            return iterator(table_.begin());
-        }
+    iterator begin() BOOST_NOEXCEPT { return iterator(table_.begin()); }
 
-        const_iterator begin() const BOOST_NOEXCEPT
-        {
-            return const_iterator(table_.begin());
-        }
+    const_iterator begin() const BOOST_NOEXCEPT
+    {
+        return const_iterator(table_.begin());
+    }
 
-        iterator end() BOOST_NOEXCEPT
-        {
-            return iterator();
-        }
+    iterator end() BOOST_NOEXCEPT { return iterator(); }
 
-        const_iterator end() const BOOST_NOEXCEPT
-        {
-            return const_iterator();
-        }
+    const_iterator end() const BOOST_NOEXCEPT { return const_iterator(); }
 
-        const_iterator cbegin() const BOOST_NOEXCEPT
-        {
-            return const_iterator(table_.begin());
-        }
+    const_iterator cbegin() const BOOST_NOEXCEPT
+    {
+        return const_iterator(table_.begin());
+    }
 
-        const_iterator cend() const BOOST_NOEXCEPT
-        {
-            return const_iterator();
-        }
+    const_iterator cend() const BOOST_NOEXCEPT { return const_iterator(); }
+
+    // extract
+
+    node_type extract(const_iterator position)
+    {
+        return node_type(
+            table_.extract_by_iterator(position), table_.node_alloc());
+    }
+
+    node_type extract(const key_type& k)
+    {
+        return node_type(table_.extract_by_key(k), table_.node_alloc());
+    }
 
-        // emplace
+// emplace
 
 #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES)
-        template <class... Args>
-        iterator emplace(BOOST_FWD_REF(Args)... args)
-        {
-            return table_.emplace(boost::forward<Args>(args)...);
-        }
+    template <class... Args> iterator emplace(BOOST_FWD_REF(Args)... args)
+    {
+        return table_.emplace(boost::forward<Args>(args)...);
+    }
 
-        template <class... Args>
-        iterator emplace_hint(const_iterator, BOOST_FWD_REF(Args)... args)
-        {
-            return table_.emplace(boost::forward<Args>(args)...);
-        }
+    template <class... Args>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(Args)... args)
+    {
+        return table_.emplace_hint(hint, boost::forward<Args>(args)...);
+    }
 #else
 
 #if !BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x5100))
 
-        // 0 argument emplace requires special treatment in case
-        // the container is instantiated with a value type that
-        // doesn't have a default constructor.
+    // 0 argument emplace requires special treatment in case
+    // the container is instantiated with a value type that
+    // doesn't have a default constructor.
 
-        iterator emplace(
-                boost::unordered::detail::empty_emplace
-                    = boost::unordered::detail::empty_emplace(),
-                value_type v = value_type())
-        {
-            return this->emplace(boost::move(v));
-        }
+    iterator emplace(boost::unordered::detail::empty_emplace =
+                         boost::unordered::detail::empty_emplace(),
+        value_type v = value_type())
+    {
+        return this->emplace(boost::move(v));
+    }
 
-        iterator emplace_hint(const_iterator hint,
-                boost::unordered::detail::empty_emplace
-                    = boost::unordered::detail::empty_emplace(),
-                value_type v = value_type()
-            )
-        {
-            return this->emplace_hint(hint, boost::move(v));
-        }
+    iterator emplace_hint(const_iterator hint,
+        boost::unordered::detail::empty_emplace =
+            boost::unordered::detail::empty_emplace(),
+        value_type v = value_type())
+    {
+        return this->emplace_hint(hint, boost::move(v));
+    }
 
 #endif
 
-        template <typename A0>
-        iterator emplace(BOOST_FWD_REF(A0) a0)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0))
-            );
-        }
+    template <typename A0> iterator emplace(BOOST_FWD_REF(A0) a0)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0)));
+    }
 
-        template <typename A0>
-        iterator emplace_hint(const_iterator, BOOST_FWD_REF(A0) a0)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0))
-            );
-        }
+    template <typename A0>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(A0) a0)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0)));
+    }
 
-        template <typename A0, typename A1>
-        iterator emplace(
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1))
-            );
-        }
+    template <typename A0, typename A1>
+    iterator emplace(BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0), boost::forward<A1>(a1)));
+    }
 
-        template <typename A0, typename A1>
-        iterator emplace_hint(const_iterator,
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1))
-            );
-        }
+    template <typename A0, typename A1>
+    iterator emplace_hint(
+        const_iterator hint, BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0), boost::forward<A1>(a1)));
+    }
 
-        template <typename A0, typename A1, typename A2>
-        iterator emplace(
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1,
-            BOOST_FWD_REF(A2) a2)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1),
-                    boost::forward<A2>(a2))
-            );
-        }
+    template <typename A0, typename A1, typename A2>
+    iterator emplace(
+        BOOST_FWD_REF(A0) a0, BOOST_FWD_REF(A1) a1, BOOST_FWD_REF(A2) a2)
+    {
+        return table_.emplace(boost::unordered::detail::create_emplace_args(
+            boost::forward<A0>(a0), boost::forward<A1>(a1),
+            boost::forward<A2>(a2)));
+    }
 
-        template <typename A0, typename A1, typename A2>
-        iterator emplace_hint(const_iterator,
-            BOOST_FWD_REF(A0) a0,
-            BOOST_FWD_REF(A1) a1,
-            BOOST_FWD_REF(A2) a2)
-        {
-            return table_.emplace(
-                boost::unordered::detail::create_emplace_args(
-                    boost::forward<A0>(a0),
-                    boost::forward<A1>(a1),
-                    boost::forward<A2>(a2))
-            );
-        }
+    template <typename A0, typename A1, typename A2>
+    iterator emplace_hint(const_iterator hint, BOOST_FWD_REF(A0) a0,
+        BOOST_FWD_REF(A1) a1, BOOST_FWD_REF(A2) a2)
+    {
+        return table_.emplace_hint(
+            hint, boost::unordered::detail::create_emplace_args(
+                      boost::forward<A0>(a0), boost::forward<A1>(a1),
+                      boost::forward<A2>(a2)));
+    }
 
-#define BOOST_UNORDERED_EMPLACE(z, n, _)                                    \
-            template <                                                      \
-                BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)                    \
-            >                                                               \
-            iterator emplace(                                               \
-                    BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a)      \
-            )                                                               \
-            {                                                               \
-                return table_.emplace(                                      \
-                    boost::unordered::detail::create_emplace_args(          \
-                        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD,  \
-                            a)                                              \
-                ));                                                         \
-            }                                                               \
-                                                                            \
-            template <                                                      \
-                BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)                    \
-            >                                                               \
-            iterator emplace_hint(                                          \
-                    const_iterator,                                         \
-                    BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a)      \
-            )                                                               \
-            {                                                               \
-                return table_.emplace(                                      \
-                    boost::unordered::detail::create_emplace_args(          \
-                        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD,  \
-                            a)                                              \
-                ));                                                         \
-            }
+#define BOOST_UNORDERED_EMPLACE(z, n, _)                                       \
+    template <BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)>                        \
+    iterator emplace(BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a))       \
+    {                                                                          \
+        return table_.emplace(boost::unordered::detail::create_emplace_args(   \
+            BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD, a)));           \
+    }                                                                          \
+                                                                               \
+    template <BOOST_PP_ENUM_PARAMS_Z(z, n, typename A)>                        \
+    iterator emplace_hint(const_iterator hint,                                 \
+        BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_FWD_PARAM, a))                    \
+    {                                                                          \
+        return table_.emplace_hint(                                            \
+            hint, boost::unordered::detail::create_emplace_args(               \
+                      BOOST_PP_ENUM_##z(n, BOOST_UNORDERED_CALL_FORWARD, a))); \
+    }
 
-        BOOST_PP_REPEAT_FROM_TO(4, BOOST_UNORDERED_EMPLACE_LIMIT,
-            BOOST_UNORDERED_EMPLACE, _)
+    BOOST_PP_REPEAT_FROM_TO(
+        4, BOOST_UNORDERED_EMPLACE_LIMIT, BOOST_UNORDERED_EMPLACE, _)
 
 #undef BOOST_UNORDERED_EMPLACE
 
 #endif
 
-        iterator insert(value_type const& x)
-        {
-            return this->emplace(x);
-        }
+    iterator insert(value_type const& x) { return this->emplace(x); }
 
-        iterator insert(BOOST_UNORDERED_RV_REF(value_type) x)
-        {
-            return this->emplace(boost::move(x));
-        }
+    iterator insert(BOOST_UNORDERED_RV_REF(value_type) x)
+    {
+        return this->emplace(boost::move(x));
+    }
 
-        iterator insert(const_iterator hint, value_type const& x)
-        {
-            return this->emplace_hint(hint, x);
-        }
+    iterator insert(const_iterator hint, value_type const& x)
+    {
+        return this->emplace_hint(hint, x);
+    }
 
-        iterator insert(const_iterator hint,
-                BOOST_UNORDERED_RV_REF(value_type) x)
-        {
-            return this->emplace_hint(hint, boost::move(x));
-        }
+    iterator insert(const_iterator hint, BOOST_UNORDERED_RV_REF(value_type) x)
+    {
+        return this->emplace_hint(hint, boost::move(x));
+    }
 
-        template <class InputIt> void insert(InputIt, InputIt);
+    template <class InputIt> void insert(InputIt, InputIt);
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-        void insert(std::initializer_list<value_type>);
+    void insert(std::initializer_list<value_type>);
 #endif
 
-        iterator erase(const_iterator);
-        size_type erase(const key_type&);
-        iterator erase(const_iterator, const_iterator);
-        void quick_erase(const_iterator it) { erase(it); }
-        void erase_return_void(const_iterator it) { erase(it); }
+    iterator insert(BOOST_RV_REF(node_type) np)
+    {
+        return table_.move_insert_node_type(np);
+    }
 
-        void clear();
-        void swap(unordered_multiset&);
+    iterator insert(const_iterator hint, BOOST_RV_REF(node_type) np)
+    {
+        return table_.move_insert_node_type_with_hint(hint, np);
+    }
 
-        // observers
+#if defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+  private:
+    // Note: Use r-value node_type to insert.
+    iterator insert(node_type&);
+    iterator insert(const_iterator, node_type& np);
 
-        hasher hash_function() const;
-        key_equal key_eq() const;
+  public:
+#endif
 
-        // lookup
+    iterator erase(const_iterator);
+    size_type erase(const key_type&);
+    iterator erase(const_iterator, const_iterator);
+    void quick_erase(const_iterator it) { erase(it); }
+    void erase_return_void(const_iterator it) { erase(it); }
 
-        const_iterator find(const key_type&) const;
+    void clear();
+    void swap(unordered_multiset&);
 
-        template <class CompatibleKey, class CompatibleHash,
-            class CompatiblePredicate>
-        const_iterator find(
-                CompatibleKey const&,
-                CompatibleHash const&,
-                CompatiblePredicate const&) const;
+    template <typename H2, typename P2>
+    void merge(boost::unordered_multiset<T, H2, P2, A>& source);
 
-        size_type count(const key_type&) const;
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+    template <typename H2, typename P2>
+    void merge(boost::unordered_multiset<T, H2, P2, A>&& source);
+#endif
 
-        std::pair<const_iterator, const_iterator>
-        equal_range(const key_type&) const;
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+    template <typename H2, typename P2>
+    void merge(boost::unordered_set<T, H2, P2, A>& source);
 
-        // bucket interface
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+    template <typename H2, typename P2>
+    void merge(boost::unordered_set<T, H2, P2, A>&& source);
+#endif
+#endif
 
-        size_type bucket_count() const BOOST_NOEXCEPT
-        {
-            return table_.bucket_count_;
-        }
+    // observers
 
-        size_type max_bucket_count() const BOOST_NOEXCEPT
-        {
-            return table_.max_bucket_count();
-        }
+    hasher hash_function() const;
+    key_equal key_eq() const;
 
-        size_type bucket_size(size_type) const;
-
-        size_type bucket(const key_type& k) const
-        {
-            return table_.hash_to_bucket(table_.hash(k));
-        }
-
-        local_iterator begin(size_type n)
-        {
-            return local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
-
-        const_local_iterator begin(size_type n) const
-        {
-            return const_local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
-
-        local_iterator end(size_type)
-        {
-            return local_iterator();
-        }
-
-        const_local_iterator end(size_type) const
-        {
-            return const_local_iterator();
-        }
-
-        const_local_iterator cbegin(size_type n) const
-        {
-            return const_local_iterator(
-                table_.begin(n), n, table_.bucket_count_);
-        }
-
-        const_local_iterator cend(size_type) const
-        {
-            return const_local_iterator();
-        }
+    // lookup
 
-        // hash policy
+    const_iterator find(const key_type&) const;
 
-        float max_load_factor() const BOOST_NOEXCEPT
-        {
-            return table_.mlf_;
-        }
+    template <class CompatibleKey, class CompatibleHash,
+        class CompatiblePredicate>
+    const_iterator find(CompatibleKey const&, CompatibleHash const&,
+        CompatiblePredicate const&) const;
 
-        float load_factor() const BOOST_NOEXCEPT;
-        void max_load_factor(float) BOOST_NOEXCEPT;
-        void rehash(size_type);
-        void reserve(size_type);
+    size_type count(const key_type&) const;
 
-#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
-        friend bool operator==<T,H,P,A>(
-                unordered_multiset const&, unordered_multiset const&);
-        friend bool operator!=<T,H,P,A>(
-                unordered_multiset const&, unordered_multiset const&);
-#endif
-    }; // class template unordered_multiset
+    std::pair<const_iterator, const_iterator> equal_range(
+        const key_type&) const;
 
-////////////////////////////////////////////////////////////////////////////////
+    // bucket interface
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(
-            size_type n, const hasher &hf, const key_equal &eql,
-            const allocator_type &a)
-      : table_(n, hf, eql, a)
+    size_type bucket_count() const BOOST_NOEXCEPT
     {
+        return table_.bucket_count_;
     }
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(allocator_type const& a)
-      : table_(boost::unordered::detail::default_bucket_count,
-            hasher(), key_equal(), a)
+    size_type max_bucket_count() const BOOST_NOEXCEPT
     {
+        return table_.max_bucket_count();
     }
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(
-            unordered_set const& other, allocator_type const& a)
-      : table_(other.table_, a)
+    size_type bucket_size(size_type) const;
+
+    size_type bucket(const key_type& k) const
     {
+        return table_.hash_to_bucket(table_.hash(k));
     }
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_set<T,H,P,A>::unordered_set(InputIt f, InputIt l)
-      : table_(boost::unordered::detail::initial_size(f, l),
-        hasher(), key_equal(), allocator_type())
+    local_iterator begin(size_type n)
     {
-        table_.insert_range(f, l);
+        return local_iterator(table_.begin(n), n, table_.bucket_count_);
     }
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_set<T,H,P,A>::unordered_set(
-            InputIt f, InputIt l,
-            size_type n,
-            const hasher &hf,
-            const key_equal &eql)
-      : table_(boost::unordered::detail::initial_size(f, l, n),
-            hf, eql, allocator_type())
-    {
-        table_.insert_range(f, l);
-    }
-    
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_set<T,H,P,A>::unordered_set(
-            InputIt f, InputIt l,
-            size_type n,
-            const hasher &hf,
-            const key_equal &eql,
-            const allocator_type &a)
-      : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
+    const_local_iterator begin(size_type n) const
     {
-        table_.insert_range(f, l);
+        return const_local_iterator(table_.begin(n), n, table_.bucket_count_);
     }
-    
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::~unordered_set() BOOST_NOEXCEPT {}
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(
-            unordered_set const& other)
-      : table_(other.table_)
+    local_iterator end(size_type) { return local_iterator(); }
+
+    const_local_iterator end(size_type) const { return const_local_iterator(); }
+
+    const_local_iterator cbegin(size_type n) const
     {
+        return const_local_iterator(table_.begin(n), n, table_.bucket_count_);
     }
 
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
-
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(
-            unordered_set&& other, allocator_type const& a)
-      : table_(other.table_, a, boost::unordered::detail::move_tag())
+    const_local_iterator cend(size_type) const
     {
+        return const_local_iterator();
     }
 
+    // hash policy
+
+    float max_load_factor() const BOOST_NOEXCEPT { return table_.mlf_; }
+
+    float load_factor() const BOOST_NOEXCEPT;
+    void max_load_factor(float) BOOST_NOEXCEPT;
+    void rehash(size_type);
+    void reserve(size_type);
+
+#if !BOOST_WORKAROUND(__BORLANDC__, < 0x0582)
+    friend bool operator==
+        <T, H, P, A>(unordered_multiset const&, unordered_multiset const&);
+    friend bool operator!=
+        <T, H, P, A>(unordered_multiset const&, unordered_multiset const&);
 #endif
+}; // class template unordered_multiset
+
+////////////////////////////////////////////////////////////////////////////////
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set()
+    : table_(boost::unordered::detail::default_bucket_count, hasher(),
+          key_equal(), allocator_type())
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(size_type n, const hasher& hf,
+    const key_equal& eql, const allocator_type& a)
+    : table_(n, hf, eql, a)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(size_type n, const allocator_type& a)
+    : table_(n, hasher(), key_equal(), a)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(
+    size_type n, const hasher& hf, const allocator_type& a)
+    : table_(n, hf, key_equal(), a)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(allocator_type const& a)
+    : table_(boost::unordered::detail::default_bucket_count, hasher(),
+          key_equal(), a)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(
+    unordered_set const& other, allocator_type const& a)
+    : table_(other.table_, a)
+{
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_set<T, H, P, A>::unordered_set(InputIt f, InputIt l)
+    : table_(boost::unordered::detail::initial_size(f, l), hasher(),
+          key_equal(), allocator_type())
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_set<T, H, P, A>::unordered_set(
+    InputIt f, InputIt l, size_type n, const hasher& hf, const key_equal& eql)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql,
+          allocator_type())
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_set<T, H, P, A>::unordered_set(InputIt f, InputIt l, size_type n,
+    const hasher& hf, const key_equal& eql, const allocator_type& a)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_set<T, H, P, A>::unordered_set(InputIt f, InputIt l, size_type n,
+    const hasher& hf, const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(f, l, n), hf, key_equal(), a)
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_set<T, H, P, A>::unordered_set(
+    InputIt f, InputIt l, size_type n, const allocator_type& a)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hasher(),
+          key_equal(), a)
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::~unordered_set() BOOST_NOEXCEPT
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(unordered_set const& other)
+    : table_(other.table_)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(
+    BOOST_RV_REF(unordered_set) other, allocator_type const& a)
+    : table_(other.table_, a, boost::unordered::detail::move_tag())
+{
+}
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>::unordered_set(
-            std::initializer_list<value_type> list, size_type n,
-            const hasher &hf, const key_equal &eql, const allocator_type &a)
-      : table_(
-            boost::unordered::detail::initial_size(
-                list.begin(), list.end(), n),
-            hf, eql, a)
-    {
-        table_.insert_range(list.begin(), list.end());
-    }
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(std::initializer_list<value_type> list,
+    size_type n, const hasher& hf, const key_equal& eql,
+    const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hf, eql, a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(std::initializer_list<value_type> list,
+    size_type n, const hasher& hf, const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hf, key_equal(), a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
+
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>::unordered_set(std::initializer_list<value_type> list,
+    size_type n, const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hasher(), key_equal(), a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
 
-    template <class T, class H, class P, class A>
-    unordered_set<T,H,P,A>& unordered_set<T,H,P,A>::operator=(
-            std::initializer_list<value_type> list)
-    {
-        table_.clear();
-        table_.insert_range(list.begin(), list.end());
-        return *this;
-    }
+template <class T, class H, class P, class A>
+unordered_set<T, H, P, A>& unordered_set<T, H, P, A>::operator=(
+    std::initializer_list<value_type> list)
+{
+    table_.clear();
+    table_.insert_range(list.begin(), list.end());
+    return *this;
+}
 
 #endif
 
-    // size and capacity
+// size and capacity
 
-    template <class T, class H, class P, class A>
-    std::size_t unordered_set<T,H,P,A>::max_size() const BOOST_NOEXCEPT
-    {
-        return table_.max_size();
-    }
+template <class T, class H, class P, class A>
+std::size_t unordered_set<T, H, P, A>::max_size() const BOOST_NOEXCEPT
+{
+    return table_.max_size();
+}
 
-    // modifiers
+// modifiers
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    void unordered_set<T,H,P,A>::insert(InputIt first, InputIt last)
-    {
-        table_.insert_range(first, last);
-    }
+template <class T, class H, class P, class A>
+template <class InputIt>
+void unordered_set<T, H, P, A>::insert(InputIt first, InputIt last)
+{
+    table_.insert_range(first, last);
+}
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::insert(
-            std::initializer_list<value_type> list)
-    {
-        table_.insert_range(list.begin(), list.end());
-    }
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::insert(std::initializer_list<value_type> list)
+{
+    table_.insert_range(list.begin(), list.end());
+}
 #endif
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::iterator
-        unordered_set<T,H,P,A>::erase(const_iterator position)
-    {
-        return table_.erase(position);
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::iterator unordered_set<T, H, P, A>::erase(
+    const_iterator position)
+{
+    return table_.erase(position);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::size_type
-        unordered_set<T,H,P,A>::erase(const key_type& k)
-    {
-        return table_.erase_key(k);
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::size_type unordered_set<T, H, P, A>::erase(
+    const key_type& k)
+{
+    return table_.erase_key(k);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::iterator
-        unordered_set<T,H,P,A>::erase(
-            const_iterator first, const_iterator last)
-    {
-        return table_.erase_range(first, last);
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::iterator unordered_set<T, H, P, A>::erase(
+    const_iterator first, const_iterator last)
+{
+    return table_.erase_range(first, last);
+}
 
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::clear()
-    {
-        table_.clear();
-    }
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::clear()
+{
+    table_.clear();
+}
 
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::swap(unordered_set& other)
-    {
-        table_.swap(other.table_);
-    }
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::swap(unordered_set& other)
+{
+    table_.swap(other.table_);
+}
 
-    // observers
+// observers
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::hasher
-        unordered_set<T,H,P,A>::hash_function() const
-    {
-        return table_.hash_function();
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::hasher
+unordered_set<T, H, P, A>::hash_function() const
+{
+    return table_.hash_function();
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::key_equal
-        unordered_set<T,H,P,A>::key_eq() const
-    {
-        return table_.key_eq();
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::key_equal
+unordered_set<T, H, P, A>::key_eq() const
+{
+    return table_.key_eq();
+}
 
-    // lookup
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_set<T, H, P, A>::merge(
+    boost::unordered_set<T, H2, P2, A>& source)
+{
+    table_.merge_impl(source.table_);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::const_iterator
-        unordered_set<T,H,P,A>::find(const key_type& k) const
-    {
-        return table_.find_node(k);
-    }
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_set<T, H, P, A>::merge(
+    boost::unordered_set<T, H2, P2, A>&& source)
+{
+    table_.merge_impl(source.table_);
+}
+#endif
 
-    template <class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-    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 table_.generic_find_node(k, hash, eq);
-    }
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_set<T, H, P, A>::merge(
+    boost::unordered_multiset<T, H2, P2, A>& source)
+{
+    table_.merge_impl(source.table_);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::size_type
-        unordered_set<T,H,P,A>::count(const key_type& k) const
-    {
-        return table_.count(k);
-    }
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_set<T, H, P, A>::merge(
+    boost::unordered_multiset<T, H2, P2, A>&& source)
+{
+    table_.merge_impl(source.table_);
+}
+#endif
+#endif
 
-    template <class T, class H, class P, class A>
-    std::pair<
-            typename unordered_set<T,H,P,A>::const_iterator,
-            typename unordered_set<T,H,P,A>::const_iterator>
-        unordered_set<T,H,P,A>::equal_range(const key_type& k) const
-    {
-        return table_.equal_range(k);
-    }
+// lookup
 
-    template <class T, class H, class P, class A>
-    typename unordered_set<T,H,P,A>::size_type
-        unordered_set<T,H,P,A>::bucket_size(size_type n) const
-    {
-        return table_.bucket_size(n);
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::const_iterator
+unordered_set<T, H, P, A>::find(const key_type& k) const
+{
+    return const_iterator(table_.find_node(k));
+}
+
+template <class T, class H, class P, class A>
+template <class CompatibleKey, class CompatibleHash, class CompatiblePredicate>
+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));
+}
 
-    // hash policy
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::size_type unordered_set<T, H, P, A>::count(
+    const key_type& k) const
+{
+    return table_.count(k);
+}
 
-    template <class T, class H, class P, class A>
-    float unordered_set<T,H,P,A>::load_factor() const BOOST_NOEXCEPT
-    {
-        return table_.load_factor();
-    }
+template <class T, class H, class P, class A>
+std::pair<typename unordered_set<T, H, P, A>::const_iterator,
+    typename unordered_set<T, H, P, A>::const_iterator>
+unordered_set<T, H, P, A>::equal_range(const key_type& k) const
+{
+    return table_.equal_range(k);
+}
 
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::max_load_factor(float m) BOOST_NOEXCEPT
-    {
-        table_.max_load_factor(m);
-    }
+template <class T, class H, class P, class A>
+typename unordered_set<T, H, P, A>::size_type
+unordered_set<T, H, P, A>::bucket_size(size_type n) const
+{
+    return table_.bucket_size(n);
+}
 
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::rehash(size_type n)
-    {
-        table_.rehash(n);
-    }
+// hash policy
 
-    template <class T, class H, class P, class A>
-    void unordered_set<T,H,P,A>::reserve(size_type n)
-    {
-        table_.reserve(n);
-    }
+template <class T, class H, class P, class A>
+float unordered_set<T, H, P, A>::load_factor() const BOOST_NOEXCEPT
+{
+    return table_.load_factor();
+}
 
-    template <class T, class H, class P, class A>
-    inline bool operator==(
-            unordered_set<T,H,P,A> const& m1,
-            unordered_set<T,H,P,A> const& m2)
-    {
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::max_load_factor(float m) BOOST_NOEXCEPT
+{
+    table_.max_load_factor(m);
+}
+
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::rehash(size_type n)
+{
+    table_.rehash(n);
+}
+
+template <class T, class H, class P, class A>
+void unordered_set<T, H, P, A>::reserve(size_type n)
+{
+    table_.reserve(n);
+}
+
+template <class T, class H, class P, class A>
+inline bool operator==(
+    unordered_set<T, H, P, A> const& m1, unordered_set<T, H, P, A> const& m2)
+{
 #if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_set<T,H,P,A> x; };
+    struct dummy
+    {
+        unordered_set<T, H, P, A> x;
+    };
 #endif
-        return m1.table_.equals(m2.table_);
-    }
+    return m1.table_.equals(m2.table_);
+}
 
-    template <class T, class H, class P, class A>
-    inline bool operator!=(
-            unordered_set<T,H,P,A> const& m1,
-            unordered_set<T,H,P,A> const& m2)
-    {
+template <class T, class H, class P, class A>
+inline bool operator!=(
+    unordered_set<T, H, P, A> const& m1, unordered_set<T, H, P, A> const& m2)
+{
 #if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_set<T,H,P,A> x; };
+    struct dummy
+    {
+        unordered_set<T, H, P, A> x;
+    };
 #endif
-        return !m1.table_.equals(m2.table_);
-    }
+    return !m1.table_.equals(m2.table_);
+}
 
-    template <class T, class H, class P, class A>
-    inline void swap(
-            unordered_set<T,H,P,A> &m1,
-            unordered_set<T,H,P,A> &m2)
-    {
+template <class T, class H, class P, class A>
+inline void swap(unordered_set<T, H, P, A>& m1, unordered_set<T, H, P, A>& m2)
+{
 #if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_set<T,H,P,A> x; };
+    struct dummy
+    {
+        unordered_set<T, H, P, A> x;
+    };
 #endif
-        m1.swap(m2);
-    }
+    m1.swap(m2);
+}
 
 ////////////////////////////////////////////////////////////////////////////////
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            size_type n, const hasher &hf, const key_equal &eql,
-            const allocator_type &a)
-      : table_(n, hf, eql, a)
-    {
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset()
+    : table_(boost::unordered::detail::default_bucket_count, hasher(),
+          key_equal(), allocator_type())
+{
+}
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(allocator_type const& a)
-      : table_(boost::unordered::detail::default_bucket_count,
-            hasher(), key_equal(), a)
-    {
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(size_type n,
+    const hasher& hf, const key_equal& eql, const allocator_type& a)
+    : table_(n, hf, eql, a)
+{
+}
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            unordered_multiset const& other, allocator_type const& a)
-      : table_(other.table_, a)
-    {
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    size_type n, const allocator_type& a)
+    : table_(n, hasher(), key_equal(), a)
+{
+}
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multiset<T,H,P,A>::unordered_multiset(InputIt f, InputIt l)
-      : table_(boost::unordered::detail::initial_size(f, l),
-        hasher(), key_equal(), allocator_type())
-    {
-        table_.insert_range(f, l);
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    size_type n, const hasher& hf, const allocator_type& a)
+    : table_(n, hf, key_equal(), a)
+{
+}
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            InputIt f, InputIt l,
-            size_type n,
-            const hasher &hf,
-            const key_equal &eql)
-      : table_(boost::unordered::detail::initial_size(f, l, n),
-            hf, eql, allocator_type())
-    {
-        table_.insert_range(f, l);
-    }
-    
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            InputIt f, InputIt l,
-            size_type n,
-            const hasher &hf,
-            const key_equal &eql,
-            const allocator_type &a)
-      : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
-    {
-        table_.insert_range(f, l);
-    }
-    
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::~unordered_multiset() BOOST_NOEXCEPT {}
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(allocator_type const& a)
+    : table_(boost::unordered::detail::default_bucket_count, hasher(),
+          key_equal(), a)
+{
+}
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            unordered_multiset const& other)
-      : table_(other.table_)
-    {
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    unordered_multiset const& other, allocator_type const& a)
+    : table_(other.table_, a)
+{
+}
 
-#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_multiset<T, H, P, A>::unordered_multiset(InputIt f, InputIt l)
+    : table_(boost::unordered::detail::initial_size(f, l), hasher(),
+          key_equal(), allocator_type())
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    InputIt f, InputIt l, size_type n, const hasher& hf, const key_equal& eql)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql,
+          allocator_type())
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_multiset<T, H, P, A>::unordered_multiset(InputIt f, InputIt l,
+    size_type n, const hasher& hf, const key_equal& eql,
+    const allocator_type& a)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hf, eql, a)
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_multiset<T, H, P, A>::unordered_multiset(InputIt f, InputIt l,
+    size_type n, const hasher& hf, const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(f, l, n), hf, key_equal(), a)
+{
+    table_.insert_range(f, l);
+}
+
+template <class T, class H, class P, class A>
+template <class InputIt>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    InputIt f, InputIt l, size_type n, const allocator_type& a)
+    : table_(boost::unordered::detail::initial_size(f, l, n), hasher(),
+          key_equal(), a)
+{
+    table_.insert_range(f, l);
+}
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            unordered_multiset&& other, allocator_type const& a)
-      : table_(other.table_, a, boost::unordered::detail::move_tag())
-    {
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::~unordered_multiset() BOOST_NOEXCEPT
+{
+}
 
-#endif
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    unordered_multiset const& other)
+    : table_(other.table_)
+{
+}
+
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    BOOST_RV_REF(unordered_multiset) other, allocator_type const& a)
+    : table_(other.table_, a, boost::unordered::detail::move_tag())
+{
+}
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>::unordered_multiset(
-            std::initializer_list<value_type> list, size_type n,
-            const hasher &hf, const key_equal &eql, const allocator_type &a)
-      : table_(
-            boost::unordered::detail::initial_size(
-                list.begin(), list.end(), n),
-            hf, eql, a)
-    {
-        table_.insert_range(list.begin(), list.end());
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    std::initializer_list<value_type> list, size_type n, const hasher& hf,
+    const key_equal& eql, const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hf, eql, a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
+
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    std::initializer_list<value_type> list, size_type n, const hasher& hf,
+    const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hf, key_equal(), a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
+
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>::unordered_multiset(
+    std::initializer_list<value_type> list, size_type n,
+    const allocator_type& a)
+    : table_(
+          boost::unordered::detail::initial_size(list.begin(), list.end(), n),
+          hasher(), key_equal(), a)
+{
+    table_.insert_range(list.begin(), list.end());
+}
 
-    template <class T, class H, class P, class A>
-    unordered_multiset<T,H,P,A>& unordered_multiset<T,H,P,A>::operator=(
-            std::initializer_list<value_type> list)
-    {
-        table_.clear();
-        table_.insert_range(list.begin(), list.end());
-        return *this;
-    }
+template <class T, class H, class P, class A>
+unordered_multiset<T, H, P, A>& unordered_multiset<T, H, P, A>::operator=(
+    std::initializer_list<value_type> list)
+{
+    table_.clear();
+    table_.insert_range(list.begin(), list.end());
+    return *this;
+}
 
 #endif
 
-    // size and capacity
+// size and capacity
 
-    template <class T, class H, class P, class A>
-    std::size_t unordered_multiset<T,H,P,A>::max_size() const BOOST_NOEXCEPT
-    {
-        return table_.max_size();
-    }
+template <class T, class H, class P, class A>
+std::size_t unordered_multiset<T, H, P, A>::max_size() const BOOST_NOEXCEPT
+{
+    return table_.max_size();
+}
 
-    // modifiers
+// modifiers
 
-    template <class T, class H, class P, class A>
-    template <class InputIt>
-    void unordered_multiset<T,H,P,A>::insert(InputIt first, InputIt last)
-    {
-        table_.insert_range(first, last);
-    }
+template <class T, class H, class P, class A>
+template <class InputIt>
+void unordered_multiset<T, H, P, A>::insert(InputIt first, InputIt last)
+{
+    table_.insert_range(first, last);
+}
 
 #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST)
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::insert(
-            std::initializer_list<value_type> list)
-    {
-        table_.insert_range(list.begin(), list.end());
-    }
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::insert(
+    std::initializer_list<value_type> list)
+{
+    table_.insert_range(list.begin(), list.end());
+}
 #endif
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::iterator
-        unordered_multiset<T,H,P,A>::erase(const_iterator position)
-    {
-        return table_.erase(position);
-    }
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::iterator
+unordered_multiset<T, H, P, A>::erase(const_iterator position)
+{
+    return table_.erase(position);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::size_type
-        unordered_multiset<T,H,P,A>::erase(const key_type& k)
-    {
-        return table_.erase_key(k);
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::size_type
+unordered_multiset<T, H, P, A>::erase(const key_type& k)
+{
+    return table_.erase_key(k);
+}
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::iterator
+unordered_multiset<T, H, P, A>::erase(const_iterator first, const_iterator last)
+{
+    return table_.erase_range(first, last);
+}
+
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::clear()
+{
+    table_.clear();
+}
+
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::swap(unordered_multiset& other)
+{
+    table_.swap(other.table_);
+}
+
+// observers
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::hasher
+unordered_multiset<T, H, P, A>::hash_function() const
+{
+    return table_.hash_function();
+}
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::key_equal
+unordered_multiset<T, H, P, A>::key_eq() const
+{
+    return table_.key_eq();
+}
+
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_multiset<T, H, P, A>::merge(
+    boost::unordered_multiset<T, H2, P2, A>& source)
+{
+    while (!source.empty()) {
+        insert(source.extract(source.begin()));
     }
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::iterator
-        unordered_multiset<T,H,P,A>::erase(
-                const_iterator first, const_iterator last)
-    {
-        return table_.erase_range(first, last);
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_multiset<T, H, P, A>::merge(
+    boost::unordered_multiset<T, H2, P2, A>&& source)
+{
+    while (!source.empty()) {
+        insert(source.extract(source.begin()));
     }
+}
+#endif
 
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::clear()
-    {
-        table_.clear();
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_multiset<T, H, P, A>::merge(
+    boost::unordered_set<T, H2, P2, A>& source)
+{
+    while (!source.empty()) {
+        insert(source.extract(source.begin()));
     }
+}
 
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::swap(unordered_multiset& other)
-    {
-        table_.swap(other.table_);
+#if !defined(BOOST_NO_CXX11_RVALUE_REFERENCES)
+template <class T, class H, class P, class A>
+template <typename H2, typename P2>
+void unordered_multiset<T, H, P, A>::merge(
+    boost::unordered_set<T, H2, P2, A>&& source)
+{
+    while (!source.empty()) {
+        insert(source.extract(source.begin()));
     }
+}
+#endif
+#endif
 
-    // observers
+// lookup
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::const_iterator
+unordered_multiset<T, H, P, A>::find(const key_type& k) const
+{
+    return const_iterator(table_.find_node(k));
+}
+
+template <class T, class H, class P, class A>
+template <class CompatibleKey, class CompatibleHash, class CompatiblePredicate>
+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));
+}
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::size_type
+unordered_multiset<T, H, P, A>::count(const key_type& k) const
+{
+    return table_.count(k);
+}
+
+template <class T, class H, class P, class A>
+std::pair<typename unordered_multiset<T, H, P, A>::const_iterator,
+    typename unordered_multiset<T, H, P, A>::const_iterator>
+unordered_multiset<T, H, P, A>::equal_range(const key_type& k) const
+{
+    return table_.equal_range(k);
+}
+
+template <class T, class H, class P, class A>
+typename unordered_multiset<T, H, P, A>::size_type
+unordered_multiset<T, H, P, A>::bucket_size(size_type n) const
+{
+    return table_.bucket_size(n);
+}
+
+// hash policy
+
+template <class T, class H, class P, class A>
+float unordered_multiset<T, H, P, A>::load_factor() const BOOST_NOEXCEPT
+{
+    return table_.load_factor();
+}
+
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::max_load_factor(float m) BOOST_NOEXCEPT
+{
+    table_.max_load_factor(m);
+}
+
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::rehash(size_type n)
+{
+    table_.rehash(n);
+}
+
+template <class T, class H, class P, class A>
+void unordered_multiset<T, H, P, A>::reserve(size_type n)
+{
+    table_.reserve(n);
+}
+
+template <class T, class H, class P, class A>
+inline bool operator==(unordered_multiset<T, H, P, A> const& m1,
+    unordered_multiset<T, H, P, A> const& m2)
+{
+#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
+    struct dummy
+    {
+        unordered_multiset<T, H, P, A> x;
+    };
+#endif
+    return m1.table_.equals(m2.table_);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::hasher
-        unordered_multiset<T,H,P,A>::hash_function() const
+template <class T, class H, class P, class A>
+inline bool operator!=(unordered_multiset<T, H, P, A> const& m1,
+    unordered_multiset<T, H, P, A> const& m2)
+{
+#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
+    struct dummy
     {
-        return table_.hash_function();
-    }
+        unordered_multiset<T, H, P, A> x;
+    };
+#endif
+    return !m1.table_.equals(m2.table_);
+}
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::key_equal
-        unordered_multiset<T,H,P,A>::key_eq() const
+template <class T, class H, class P, class A>
+inline void swap(
+    unordered_multiset<T, H, P, A>& m1, unordered_multiset<T, H, P, A>& m2)
+{
+#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
+    struct dummy
     {
-        return table_.key_eq();
-    }
+        unordered_multiset<T, H, P, A> x;
+    };
+#endif
+    m1.swap(m2);
+}
 
-    // lookup
+template <typename N, typename T, typename A> class node_handle_set
+{
+    BOOST_MOVABLE_BUT_NOT_COPYABLE(node_handle_set)
+
+    template <typename Types>
+    friend struct ::boost::unordered::detail::table_impl;
+    template <typename Types>
+    friend struct ::boost::unordered::detail::grouped_table_impl;
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::const_iterator
-        unordered_multiset<T,H,P,A>::find(const key_type& k) const
+    typedef typename boost::unordered::detail::rebind_wrap<A, T>::type
+        value_allocator;
+    typedef boost::unordered::detail::allocator_traits<value_allocator>
+        value_allocator_traits;
+    typedef N node;
+    typedef typename boost::unordered::detail::rebind_wrap<A, node>::type
+        node_allocator;
+    typedef boost::unordered::detail::allocator_traits<node_allocator>
+        node_allocator_traits;
+    typedef typename node_allocator_traits::pointer node_pointer;
+
+  public:
+    typedef T value_type;
+    typedef A allocator_type;
+
+  private:
+    node_pointer ptr_;
+    bool has_alloc_;
+    boost::unordered::detail::value_base<value_allocator> alloc_;
+
+  public:
+    BOOST_CONSTEXPR node_handle_set() BOOST_NOEXCEPT : ptr_(), has_alloc_(false)
     {
-        return table_.find_node(k);
     }
 
-    template <class T, class H, class P, class A>
-    template <class CompatibleKey, class CompatibleHash,
-        class CompatiblePredicate>
-    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
+    /*BOOST_CONSTEXPR */ node_handle_set(
+        node_pointer ptr, allocator_type const& a)
+        : ptr_(ptr), has_alloc_(false)
     {
-        return table_.generic_find_node(k, hash, eq);
+        if (ptr_) {
+            new ((void*)&alloc_) value_allocator(a);
+            has_alloc_ = true;
+        }
     }
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::size_type
-        unordered_multiset<T,H,P,A>::count(const key_type& k) const
+    ~node_handle_set()
     {
-        return table_.count(k);
+        if (has_alloc_ && ptr_) {
+            node_allocator node_alloc(alloc_.value());
+            boost::unordered::detail::node_tmp<node_allocator> tmp(
+                ptr_, node_alloc);
+        }
+        if (has_alloc_) {
+            alloc_.value_ptr()->~value_allocator();
+        }
     }
 
-    template <class T, class H, class P, class A>
-    std::pair<
-            typename unordered_multiset<T,H,P,A>::const_iterator,
-            typename unordered_multiset<T,H,P,A>::const_iterator>
-        unordered_multiset<T,H,P,A>::equal_range(const key_type& k) const
+    node_handle_set(BOOST_RV_REF(node_handle_set) n) BOOST_NOEXCEPT
+        : ptr_(n.ptr_),
+          has_alloc_(false)
     {
-        return table_.equal_range(k);
+        if (n.has_alloc_) {
+            new ((void*)&alloc_) value_allocator(boost::move(n.alloc_.value()));
+            has_alloc_ = true;
+            n.ptr_ = node_pointer();
+            n.alloc_.value_ptr()->~value_allocator();
+            n.has_alloc_ = false;
+        }
     }
 
-    template <class T, class H, class P, class A>
-    typename unordered_multiset<T,H,P,A>::size_type
-        unordered_multiset<T,H,P,A>::bucket_size(size_type n) const
+    node_handle_set& operator=(BOOST_RV_REF(node_handle_set) n)
     {
-        return table_.bucket_size(n);
-    }
+        BOOST_ASSERT(!has_alloc_ ||
+                     value_allocator_traits::
+                         propagate_on_container_move_assignment::value ||
+                     (n.has_alloc_ && alloc_.value() == n.alloc_.value()));
 
-    // hash policy
+        if (ptr_) {
+            node_allocator node_alloc(alloc_.value());
+            boost::unordered::detail::node_tmp<node_allocator> tmp(
+                ptr_, node_alloc);
+            ptr_ = node_pointer();
+        }
 
-    template <class T, class H, class P, class A>
-    float unordered_multiset<T,H,P,A>::load_factor() const BOOST_NOEXCEPT
-    {
-        return table_.load_factor();
-    }
+        if (has_alloc_) {
+            alloc_.value_ptr()->~value_allocator();
+            has_alloc_ = false;
+        }
 
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::max_load_factor(float m) BOOST_NOEXCEPT
-    {
-        table_.max_load_factor(m);
+        if (!has_alloc_ && n.has_alloc_) {
+            move_allocator(n);
+        }
+
+        ptr_ = n.ptr_;
+        n.ptr_ = node_pointer();
+
+        return *this;
     }
 
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::rehash(size_type n)
+    value_type& value() const { return ptr_->value(); }
+
+    allocator_type get_allocator() const { return alloc_.value(); }
+
+    BOOST_EXPLICIT_OPERATOR_BOOL_NOEXCEPT()
+
+    bool operator!() const BOOST_NOEXCEPT { return ptr_ ? 0 : 1; }
+
+    bool empty() const BOOST_NOEXCEPT { return ptr_ ? 0 : 1; }
+
+    void swap(node_handle_set& n) BOOST_NOEXCEPT_IF(
+        value_allocator_traits::propagate_on_container_swap::value
+        /* || value_allocator_traits::is_always_equal::value */)
     {
-        table_.rehash(n);
+        if (!has_alloc_) {
+            if (n.has_alloc_) {
+                move_allocator(n);
+            }
+        } else if (!n.has_alloc_) {
+            n.move_allocator(*this);
+        } else {
+            swap_impl(n, boost::unordered::detail::integral_constant<bool,
+                             value_allocator_traits::
+                                 propagate_on_container_swap::value>());
+        }
+        boost::swap(ptr_, n.ptr_);
     }
 
-    template <class T, class H, class P, class A>
-    void unordered_multiset<T,H,P,A>::reserve(size_type n)
+  private:
+    void move_allocator(node_handle_set& n)
     {
-        table_.reserve(n);
+        new ((void*)&alloc_) value_allocator(boost::move(n.alloc_.value()));
+        n.alloc_.value_ptr()->~value_allocator();
+        has_alloc_ = true;
+        n.has_alloc_ = false;
     }
 
-    template <class T, class H, class P, class A>
-    inline bool operator==(
-            unordered_multiset<T,H,P,A> const& m1,
-            unordered_multiset<T,H,P,A> const& m2)
+    void swap_impl(node_handle_set&, boost::unordered::detail::false_type) {}
+
+    void swap_impl(node_handle_set& n, boost::unordered::detail::true_type)
     {
-#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_multiset<T,H,P,A> x; };
-#endif
-        return m1.table_.equals(m2.table_);
+        boost::swap(alloc_, n.alloc_);
     }
+};
+
+template <typename N, typename T, typename A>
+void swap(node_handle_set<N, T, A>& x, node_handle_set<N, T, A>& y)
+    BOOST_NOEXCEPT_IF(BOOST_NOEXCEPT_EXPR(x.swap(y)))
+{
+    x.swap(y);
+}
+
+template <typename N, typename T, typename A> struct insert_return_type_set
+{
+  private:
+    BOOST_MOVABLE_BUT_NOT_COPYABLE(insert_return_type_set)
+
+    typedef typename boost::unordered::detail::rebind_wrap<A, T>::type
+        value_allocator;
+    typedef N node_;
 
-    template <class T, class H, class P, class A>
-    inline bool operator!=(
-            unordered_multiset<T,H,P,A> const& m1,
-            unordered_multiset<T,H,P,A> const& m2)
+  public:
+    bool inserted;
+    boost::unordered::iterator_detail::c_iterator<node_> position;
+    boost::unordered::node_handle_set<N, T, A> node;
+
+    insert_return_type_set() : inserted(false), position(), node() {}
+
+    insert_return_type_set(BOOST_RV_REF(insert_return_type_set)
+            x) BOOST_NOEXCEPT : inserted(x.inserted),
+                                position(x.position),
+                                node(boost::move(x.node))
     {
-#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_multiset<T,H,P,A> x; };
-#endif
-        return !m1.table_.equals(m2.table_);
     }
 
-    template <class T, class H, class P, class A>
-    inline void swap(
-            unordered_multiset<T,H,P,A> &m1,
-            unordered_multiset<T,H,P,A> &m2)
+    insert_return_type_set& operator=(BOOST_RV_REF(insert_return_type_set) x)
     {
-#if BOOST_WORKAROUND(__CODEGEARC__, BOOST_TESTED_AT(0x0613))
-        struct dummy { unordered_multiset<T,H,P,A> x; };
-#endif
-        m1.swap(m2);
+        inserted = x.inserted;
+        position = x.position;
+        node = boost::move(x.node);
+        return *this;
     }
+};
+
+template <typename N, typename T, typename A>
+void swap(
+    insert_return_type_set<N, T, A>& x, insert_return_type_set<N, T, A>& y)
+{
+    boost::swap(x.node, y.node);
+    boost::swap(x.inserted, y.inserted);
+    boost::swap(x.position, y.position);
+}
 } // namespace unordered
 } // namespace boost