diff --git a/doc/changes.qbk b/doc/changes.qbk
index 023d18cd..3a294bb2 100644
--- a/doc/changes.qbk
+++ b/doc/changes.qbk
@@ -306,6 +306,10 @@ C++11 support has resulted in some breaking changes:
[h2 Boost 1.64.0]
* Initial support for new C++17 member functions:
`insert_or_assign` and `try_emplace` in `unordered_map`,
- `merge` and `extract` in all containers.
+* Initial support for `merge` and `extract`.
+ Does not include transfering nodes between
+ `unordered_map` and `unordered_multimap` or between `unordered_set` and
+ `unordered_multiset` yet. That will hopefully be in the next version of
+ Boost.
[endsect]
diff --git a/doc/ref.php b/doc/ref.php
index abdb9a17..efbca895 100644
--- a/doc/ref.php
+++ b/doc/ref.php
@@ -925,6 +925,12 @@ EOL;
A node_type
owning the element.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible
,
+ but that is not supported yet.
+
+
@@ -940,6 +946,12 @@ EOL;
Only throws an exception if it is thrown by hasher
or key_equal
.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible
,
+ but that is not supported yet.
+
+
@@ -984,6 +996,8 @@ EOL;
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
,
+ but that is not supported yet.
@@ -1028,6 +1042,8 @@ EOL;
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same .
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
,
+ but that is not supported yet.
@@ -1175,6 +1191,9 @@ EOL;
<Value, H2, P2, Alloc>&
+
+ Does not support merging with a compatible
yet.
+
@@ -1190,6 +1209,9 @@ EOL;
<Value, H2, P2, Alloc>&&
+
+ Does not support merging with a compatible
yet.
+
@@ -1650,13 +1672,20 @@ function echo_node_handle_docs($map)
unordered_multi, that
can then be inserted into a compatible container type.
-
+
The name and template parameters of this type is implementation
defined, and should be obtained using the node_type
member typedef from the appropriate container.
-
+
+ In this version of Boost, node_type
is different
+ for unordered_map and unordered_multimap
,' :
+ 'unordered_set
and unordered_multiset
,';
+ ?> this will be fixed in a future version of Boost.
+
+
diff --git a/doc/ref.xml b/doc/ref.xml
index 755721ca..68bfa02c 100644
--- a/doc/ref.xml
+++ b/doc/ref.xml
@@ -812,6 +812,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
A node_type
owning the element.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_multiset
,
+ but that is not supported yet.
+
+
@@ -827,6 +833,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Only throws an exception if it is thrown by hasher
or key_equal
.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_multiset
,
+ but that is not supported yet.
+
+
@@ -862,6 +874,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
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_multiset
,
+ but that is not supported yet.
@@ -895,6 +909,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value.
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_multiset
,
+ but that is not supported yet.
@@ -1038,6 +1054,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_set<Value, H2, P2, Alloc>&
+
+ Does not support merging with a compatible unordered_multiset
yet.
+
@@ -1049,6 +1068,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_set<Value, H2, P2, Alloc>&&
+
+ Does not support merging with a compatible unordered_multiset
yet.
+
@@ -2204,6 +2226,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
A node_type
owning the element.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_set
,
+ but that is not supported yet.
+
+
@@ -2219,6 +2247,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Only throws an exception if it is thrown by hasher
or key_equal
.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_set
,
+ but that is not supported yet.
+
+
@@ -2242,6 +2276,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
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.
@@ -2271,6 +2307,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value.
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.
@@ -2414,6 +2452,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multiset<Value, H2, P2, Alloc>&
+
+ Does not support merging with a compatible unordered_set
yet.
+
@@ -2425,6 +2466,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multiset<Value, H2, P2, Alloc>&&
+
+ Does not support merging with a compatible unordered_set
yet.
+
@@ -2796,13 +2840,17 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multiset, that
can then be inserted into a compatible container type.
-
+
The name and template parameters of this type is implementation
defined, and should be obtained using the node_type
member typedef from the appropriate container.
-
+
+ In this version of Boost, node_type
is different
+ for unordered_set
and unordered_multiset
, this will be fixed in a future version of Boost.
+
+
typename Container::value_type>
@@ -3687,6 +3735,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
A node_type
owning the element.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_multimap
,
+ but that is not supported yet.
+
+
@@ -3702,6 +3756,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Only throws an exception if it is thrown by hasher
or key_equal
.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_multimap
,
+ but that is not supported yet.
+
+
@@ -3737,6 +3797,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
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_multimap
,
+ but that is not supported yet.
@@ -3770,6 +3832,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key.
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_multimap
,
+ but that is not supported yet.
@@ -3913,6 +3977,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_map<Key, Mapped, H2, P2, Alloc>&
+
+ Does not support merging with a compatible unordered_multimap
yet.
+
@@ -3924,6 +3991,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_map<Key, Mapped, H2, P2, Alloc>&&
+
+ Does not support merging with a compatible unordered_multimap
yet.
+
@@ -5126,6 +5196,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
A node_type
owning the element.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_map
,
+ but that is not supported yet.
+
+
@@ -5141,6 +5217,12 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Only throws an exception if it is thrown by hasher
or key_equal
.
+
+
+ In C++17 a node extracted using this method can be inserted into a compatible unordered_map
,
+ but that is not supported yet.
+
+
@@ -5164,6 +5246,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
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_map
,
+ but that is not supported yet.
@@ -5193,6 +5277,8 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key.
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_map
,
+ but that is not supported yet.
@@ -5336,6 +5422,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multimap<Key, Mapped, H2, P2, Alloc>&
+
+ Does not support merging with a compatible unordered_map
yet.
+
@@ -5347,6 +5436,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multimap<Key, Mapped, H2, P2, Alloc>&&
+
+ Does not support merging with a compatible unordered_map
yet.
+
@@ -5724,13 +5816,17 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
unordered_multimap, that
can then be inserted into a compatible container type.
-
+
The name and template parameters of this type is implementation
defined, and should be obtained using the node_type
member typedef from the appropriate container.
-
+
+ In this version of Boost, node_type
is different
+ for unordered_map
and unordered_multimap
, this will be fixed in a future version of Boost.
+
+
typename Container::key_type