boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 20:04:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

Hervé Brönnimann's improved explanation of the formula for avoiding

Browse Source 
invalidating iterators.


[SVN r41994]
This commit is contained in:
Daniel James
2007-12-13 00:26:05 +00:00
parent 4e235a1610
commit 1b0910add2
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
doc/buckets.qbk
View File

@@ -97,9 +97,10 @@ elements into container `x`, you could first call:
x.rehash((x.size() + n) / x.max_load_factor() + 1); x.rehash((x.size() + n) / x.max_load_factor() + 1);
[blurb Note: `rehash`'s argument is the number of buckets, not the number of [blurb Note: `rehash`'s argument is the number of buckets, not the number of
elements, which is why the new size is divided by the maximum load factor. The elements, which is why the new size is divided by the maximum load factor. The
`+ 1` is required because the container is allowed to resize when the load + 1 guarantees there is no invalidation; without it, reallocation could occur
factor is equal to the maximum load factor.] if the number of bucket exactly divides the target size, since the container is
allowed to rehash when the load factor is equal to the maximum load factor.]
[table Methods for Controlling Bucket Size [table Methods for Controlling Bucket Size
[[Method] [Description]] [[Method] [Description]]