From b031b61b9454a15caeed5c4a712ad0f018d74cd3 Mon Sep 17 00:00:00 2001 From: Christian Mazakas Date: Thu, 7 Sep 2023 13:00:40 -0700 Subject: [PATCH] Update docs on rehashing behavior in face of fancy pointer changes --- doc/unordered/unordered_flat_map.adoc | 2 +- doc/unordered/unordered_flat_set.adoc | 2 +- doc/unordered/unordered_node_map.adoc | 2 +- doc/unordered/unordered_node_set.adoc | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/doc/unordered/unordered_flat_map.adoc b/doc/unordered/unordered_flat_map.adoc index 0ddd006b..c8fc50bc 100644 --- a/doc/unordered/unordered_flat_map.adoc +++ b/doc/unordered/unordered_flat_map.adoc @@ -1324,7 +1324,7 @@ void rehash(size_type n); Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container. -When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. +When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. Invalidates iterators, pointers and references, and changes the order of elements. diff --git a/doc/unordered/unordered_flat_set.adoc b/doc/unordered/unordered_flat_set.adoc index e015c826..e11336ca 100644 --- a/doc/unordered/unordered_flat_set.adoc +++ b/doc/unordered/unordered_flat_set.adoc @@ -1086,7 +1086,7 @@ void rehash(size_type n); Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container. -When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. +When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. Invalidates iterators, pointers and references, and changes the order of elements. diff --git a/doc/unordered/unordered_node_map.adoc b/doc/unordered/unordered_node_map.adoc index e9ca0f5d..27346570 100644 --- a/doc/unordered/unordered_node_map.adoc +++ b/doc/unordered/unordered_node_map.adoc @@ -1405,7 +1405,7 @@ void rehash(size_type n); Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container. -When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. +When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. Invalidates iterators and changes the order of elements. diff --git a/doc/unordered/unordered_node_set.adoc b/doc/unordered/unordered_node_set.adoc index 3daa293f..11886eca 100644 --- a/doc/unordered/unordered_node_set.adoc +++ b/doc/unordered/unordered_node_set.adoc @@ -1187,7 +1187,7 @@ void rehash(size_type n); Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container. -When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. +When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed. Invalidates iterators and changes the order of elements.