2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Buckets (adoc)
4. English
5. Zen

30 :82
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As more elements are added to an unordered associative container, the number of collisions will increase causing performance to degrade. To combat this the containers increase the bucket count as elements are inserted. You can also tell the container to change the bucket count (if required) by calling `rehash`. 312/10000 · 312
31 :88
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The standard leaves a lot of freedom to the implementer to decide how the number of buckets is chosen, but it does make some requirements based on the container's _load factor_, the number of elements divided by the number of buckets. Containers also have a _maximum load factor_ which they should try to keep the load factor below. 332/10000 · 332
32 :94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — You can't control the bucket count directly but there are two ways to influence it: 83/10000 · 83
33 :97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Specify the minimum number of buckets when constructing a container or when calling `rehash`. 93/10000 · 93
34 :98
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Suggest a maximum load factor by calling `max_load_factor`. 59/10000 · 59
35 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `max_load_factor` doesn't let you set the maximum load factor yourself, it just lets you give a _hint_. And even then, the standard doesn't actually require the container to pay much attention to this value. The only time the load factor is _required_ to be less than the maximum is following a call to `rehash`. But most implementations will try to keep the number of elements below the max load factor, and set the maximum load factor to be the same as or close to the hint - unless your hint is unreasonably small or large. 526/10000 · 526
:111 :111
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2+^h| *All containers* h|*Method* h|*Description* 49/10000 · 49
37 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `X(size_type n)` 16/10000 · 16
38 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Construct an empty container with at least `n` buckets (`X` is the container type). 83/10000 · 83
39 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `X(InputIterator i, InputIterator j, size_type n)` 50/10000 · 50
40 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Construct an empty container with at least `n` buckets and insert elements from the range `[i, j)` (`X` is the container type). 127/10000 · 127
41 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `float load_factor() const` 27/10000 · 27
42 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The average number of elements per bucket. 42/10000 · 42
43 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `float max_load_factor() const` 31/10000 · 31
44 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns the current maximum load factor. 40/10000 · 40
45 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `float max_load_factor(float z)` 32/10000 · 32
46 :114
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Changes the container's maximum load factor, using `z` as a hint. + 67/10000 · 67
47 :128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **Open-addressing and concurrent containers:** this function does nothing: users are not allowed to change the maximum load factor. 131/10000 · 131
48 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `void rehash(size_type n)` 26/10000 · 26
49 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Changes the number of buckets so that there at least `n` buckets, and so that the load factor is less than the maximum load factor. 131/10000 · 131