Update documentation on extract/insert to no longer say that transferring nodes between the corresponding multi- container is not supported

doc/unordered/unordered_map.adoc

@@ -871,7 +871,7 @@ Removes the element pointed to by `position`.
 
 [horizontal]
 Returns:;; A `node_type` owning the element.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multimap`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.
 
 ---
 
@@ -885,7 +885,7 @@ Removes an element with key equivalent to `k`.
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multimap`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.
 
 ---
 
@@ -901,7 +901,7 @@ This overload only participates in overload resolution if `Hash::is_transparent`
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multimap`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.
 
 ---
 
@@ -926,7 +926,7 @@ Notes:;; Can invalidate iterators, but only if the insert causes the load factor
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_multimap`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_multimap`.
 
 ---
 
@@ -957,7 +957,7 @@ Can invalidate iterators, but only if the insert causes the load factor to be gr
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_multimap`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_multimap`.
 
 ---
 

doc/unordered/unordered_multimap.adoc

@@ -846,7 +846,7 @@ Removes the element pointed to by `position`.
 
 [horizontal]
 Returns:;; A `node_type` owning the element.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_map`.
 
 ---
 
@@ -860,7 +860,7 @@ Removes an element with key equivalent to `k`.
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_map`.
 
 ---
 
@@ -876,7 +876,7 @@ This overload only participates in overload resolution if `Hash::is_transparent`
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_map`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_map`.
 
 ---
 
@@ -899,7 +899,7 @@ Notes:;; Can invalidate iterators, but only if the insert causes the load factor
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_map`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_map`.
 
 ---
 
@@ -926,7 +926,7 @@ Can invalidate iterators, but only if the insert causes the load factor to be gr
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_map`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_map`.
 
 ---
 

doc/unordered/unordered_multiset.adoc

@@ -806,7 +806,7 @@ Removes the element pointed to by `position`.
 
 [horizontal]
 Returns:;; A `node_type` owning the element.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_set`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`.
 
 ---
 
@@ -820,7 +820,7 @@ Removes an element with key equivalent to `k`.
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_set`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`.
 
 ---
 
@@ -836,7 +836,7 @@ This overload only participates in overload resolution if `Hash::is_transparent`
 [horizontal]
 Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`.
 Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`.[horizontal]
-Notes:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_set`, but that is not supported yet.
+Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`.
 
 ---
 
@@ -857,7 +857,9 @@ Otherwise returns an iterator pointing to the newly inserted element.
 Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect.
 Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. +
 +
-Pointers and references to elements are never invalidated. In C++17 this can be used to insert a node extracted from a compatible `unordered_set`, but that is not supported yet.
+Pointers and references to elements are never invalidated. +
++
+This can be used to insert a node extracted from a compatible `unordered_set`.
 
 ---
 
@@ -884,7 +886,7 @@ Can invalidate iterators, but only if the insert causes the load factor to be gr
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_set`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_set`.
 
 ---
 

doc/unordered/unordered_set.adoc

@@ -908,7 +908,7 @@ Can invalidate iterators, but only if the insert causes the load factor to be gr
 +
 Pointers and references to elements are never invalidated. +
 +
-In C++17 this can be used to insert a node extracted from a compatible `unordered_multiset`, but that is not supported yet.
+This can be used to insert a node extracted from a compatible `unordered_multiset`.
 
 ---