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

21 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns the index of the bucket which would contain `k`. 56/10000 · 56
22 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `local_iterator begin(size_type n)` 35/10000 · 35
23 :66
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1.6+|Return begin and end iterators for bucket `n`. 51/10000 · 51
24 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `local_iterator end(size_type n)` 33/10000 · 33
25 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `const_local_iterator begin(size_type n) const` 47/10000 · 47
26 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `const_local_iterator end(size_type n) const` 45/10000 · 45
27 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `const_local_iterator cbegin(size_type n) const` 48/10000 · 48
28 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `const_local_iterator cend(size_type n) const` 46/10000 · 46
29 :80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Controlling the Number of Buckets 33/10000 · 33
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