diff --git a/doc/unordered/unordered_map.adoc b/doc/unordered/unordered_map.adoc
index ad9d71ca..91ab2a6e 100644
--- a/doc/unordered/unordered_map.adoc
+++ b/doc/unordered/unordered_map.adoc
@@ -154,12 +154,12 @@ namespace boost {
     bool             xref:#unordered_map_contains[contains](const key_type& k) const;
     template<class K>
       bool           xref:#unordered_map_contains[contains](const K& k) const;
-    pair<iterator, iterator>               xref:#unordered_map_equal_range[equal_range](const key_type& k);
-    pair<const_iterator, const_iterator>   xref:#unordered_map_equal_range[equal_range](const key_type& k) const;
+    std::pair<iterator, iterator>               xref:#unordered_map_equal_range[equal_range](const key_type& k);
+    std::pair<const_iterator, const_iterator>   xref:#unordered_map_equal_range[equal_range](const key_type& k) const;
     template<class K>
-      pair<iterator, iterator>             xref:#unordered_map_equal_range[equal_range](const K& k);
+      std::pair<iterator, iterator>             xref:#unordered_map_equal_range[equal_range](const K& k);
     template<class K>
-      pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const K& k) const;
+      std::pair<const_iterator, const_iterator> xref:#unordered_map_equal_range[equal_range](const K& k) const;
 
     // element access
     mapped_type& xref:#unordered_map_operator[operator[+]+](const key_type& k);
@@ -1205,12 +1205,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
 
 ==== equal_range
 ```c++
-pair<iterator, iterator>               equal_range(const key_type& k);
-pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
+std::pair<iterator, iterator>               equal_range(const key_type& k);
+std::pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
 template<class K>
-  pair<iterator, iterator>             equal_range(const K& k);
+  std::pair<iterator, iterator>             equal_range(const K& k);
 template<class K>
-  pair<const_iterator, const_iterator> equal_range(const K& k) const;
+  std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
 ```
 
 [horizontal]
diff --git a/doc/unordered/unordered_multimap.adoc b/doc/unordered/unordered_multimap.adoc
index be204074..edcade63 100644
--- a/doc/unordered/unordered_multimap.adoc
+++ b/doc/unordered/unordered_multimap.adoc
@@ -155,12 +155,12 @@ namespace boost {
     bool             xref:#unordered_multimap_contains[contains](const key_type& k) const;
     template<class K>
       bool           xref:#unordered_multimap_contains[contains](const K& k) const;
-    pair<iterator, iterator>               xref:#unordered_multimap_equal_range[equal_range](const key_type& k);
-    pair<const_iterator, const_iterator>   xref:#unordered_multimap_equal_range[equal_range](const key_type& k) const;
+    std::pair<iterator, iterator>               xref:#unordered_multimap_equal_range[equal_range](const key_type& k);
+    std::pair<const_iterator, const_iterator>   xref:#unordered_multimap_equal_range[equal_range](const key_type& k) const;
     template<class K>
-      pair<iterator, iterator>             xref:#unordered_multimap_equal_range[equal_range](const K& k);
+      std::pair<iterator, iterator>             xref:#unordered_multimap_equal_range[equal_range](const K& k);
     template<class K>
-      pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k) const;
+      std::pair<const_iterator, const_iterator> xref:#unordered_multimap_equal_range[equal_range](const K& k) const;
 
     // bucket interface
     size_type xref:#unordered_multimap_bucket_count[bucket_count]() const noexcept;
@@ -1173,12 +1173,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
 
 ==== equal_range
 ```c++
-pair<iterator, iterator>               equal_range(const key_type& k);
-pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
+std::pair<iterator, iterator>               equal_range(const key_type& k);
+std::pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
 template<class K>
-  pair<iterator, iterator>             equal_range(const K& k);
+  std::pair<iterator, iterator>             equal_range(const K& k);
 template<class K>
-  pair<const_iterator, const_iterator> equal_range(const K& k) const;
+  std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
 ```
 
 [horizontal]
diff --git a/doc/unordered/unordered_set.adoc b/doc/unordered/unordered_set.adoc
index 01b6b612..e47754cc 100644
--- a/doc/unordered/unordered_set.adoc
+++ b/doc/unordered/unordered_set.adoc
@@ -150,12 +150,12 @@ namespace boost {
     bool             xref:#unordered_set_contains[contains](const key_type& k) const;
     template<class K>
       bool           xref:#unordered_set_contains[contains](const K& k) const;
-    pair<iterator, iterator>               xref:#unordered_set_equal_range[equal_range](const key_type& k);
-    pair<const_iterator, const_iterator>   xref:#unordered_set_equal_range[equal_range](const key_type& k) const;
+    std::pair<iterator, iterator>               xref:#unordered_set_equal_range[equal_range](const key_type& k);
+    std::pair<const_iterator, const_iterator>   xref:#unordered_set_equal_range[equal_range](const key_type& k) const;
     template<class K>
-      pair<iterator, iterator>             xref:#unordered_set_equal_range[equal_range](const K& k);
+      std::pair<iterator, iterator>             xref:#unordered_set_equal_range[equal_range](const K& k);
     template<class K>
-      pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const K& k) const;
+      std::pair<const_iterator, const_iterator> xref:#unordered_set_equal_range[equal_range](const K& k) const;
 
     // bucket interface
     size_type xref:#unordered_set_bucket_count[bucket_count]() const noexcept;
@@ -660,7 +660,7 @@ Returns:;; `size()` of the largest possible container.
 
 ==== emplace
 ```c++
-template<class... Args> pair<iterator, bool> emplace(Args&&... args);
+template<class... Args> std::pair<iterator, bool> emplace(Args&&... args);
 ```
 
 Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent value.
@@ -1156,12 +1156,12 @@ Notes:;; The `template <typename K>` overload only participates in overload reso
 
 ==== equal_range
 ```c++
-pair<iterator, iterator>               equal_range(const key_type& k);
-pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
+std::pair<iterator, iterator>               equal_range(const key_type& k);
+std::pair<const_iterator, const_iterator>   equal_range(const key_type& k) const;
 template<class K>
-  pair<iterator, iterator>             equal_range(const K& k);
+  std::pair<iterator, iterator>             equal_range(const K& k);
 template<class K>
-  pair<const_iterator, const_iterator> equal_range(const K& k) const;
+  std::pair<const_iterator, const_iterator> equal_range(const K& k) const;
 ```
 
 [horizontal]