uploaded current status

This commit is contained in:
joaquintides committed 2022-10-31 19:27:35 +01:00
1 parent 2068cf8d5b
commit 300f5554e5
87 files changed
+1359 -112

No files matched your search

+4 -4
View File
@@ -37,7 +37,7 @@ keep collisions to a minimum.
If instead of `boost::unordered_set` we had used <<unordered_flat_set,`boost::unordered_flat_set`>>, the
diagram would look as follows:
image::buckets oa.png[]
image::buckets-oa.png[]
In open-addressing containers, buckets can hold at most one element; if a collision happens
(like is the case of `D` in the example), the element uses some other available bucket in
@@ -144,9 +144,9 @@ h|*Method* h|*Description*
A note on `max_load` for open-addressing containers: the maximum load will naturally decrease when
new insertions are performed, but _won't_ increase at the same rate when erasing: for instance,
adding 1,000 elements to a <<unordered_flat_map,`boost::unordered_flat_map`>> and then
erasing those 1,000 elements will typically reduce the maximum load by around 160 rather
than restoring it to its original value. This is done internally by Boost.Unordered in order
adding 1,000 elements to a <<unordered_flat_map,`boost::unordered_flat_map`>> under high load
conditions and then erasing 1,000 elements will typically reduce the maximum load by around
a few dozen elements rather than restoring it to its original value. This is done internally by Boost.Unordered in order
to keep its performance stable, and must be taken into account when planning for rehash-free insertions.
The maximum load will be reset to its theoretical maximum
(`max_load_factor() * bucket_count()`) right after `rehash`.