From f493603f5cd2bd090be440cacfcaa95f2566059b Mon Sep 17 00:00:00 2001 From: joaquintides Date: Fri, 1 Dec 2023 12:22:48 +0100 Subject: [PATCH] [skip ci] editorial --- doc/unordered/hash_traits.adoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/unordered/hash_traits.adoc b/doc/unordered/hash_traits.adoc index b5e0c11c..ae2ca67e 100644 --- a/doc/unordered/hash_traits.adoc +++ b/doc/unordered/hash_traits.adoc @@ -38,7 +38,7 @@ Users can then declare a hash function `Hash` as avalanching either by embedding into the definition of `Hash`, or directly by specializing `hash_is_avalanching` to a class with an embedded compile-time constant `value` set to `true`. -xref:unordered_flat_set[`boost::unordered_flat_set`] and xref:unordered_flat_map[`boost::unordered_flat_map`] +Open-addressing and concurrent containers use the provided hash function `Hash` as-is if `hash_is_avalanching::value` is `true`; otherwise, they implement a bit-mixing post-processing stage to increase the quality of hashing at the expense of extra computational cost.