User avatar admin

Translation uploaded
An upper bound on the number of buckets.
An upper bound on the number of buckets.桶数量的上限。
06/05/2026
User avatar admin

Translation uploaded
`size_type max_bucket_count() const`
`size_type max_bucket_count() const`
06/05/2026
User avatar admin

Translation uploaded
2+^h| *Closed-addressing containers only* h|*Method* h|*Description*
2+^h| *Closed-addressing containers only* h|*Method* h|*Description仅限闭寻址容器* h|*方法* h|*描述*
06/05/2026
User avatar admin

Translation uploaded
The number of buckets.
The number of buckets.桶的数量。
06/05/2026
User avatar admin

Translation uploaded
`size_type bucket_count() const`
`size_type bucket_count() const`
06/05/2026
User avatar admin

Translation uploaded
2+^h| *All containers* h|*Method* h|*Description*
2+^h| *All containers* h|*Method* h|*Description所有容器* h|*方法* h|*描述*
:48
06/05/2026
User avatar admin

Translation uploaded
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 the vicinity of the original position. Given this simpler scenario, Boost.Unordered open-addressing containers offer a very limited API for accessing buckets.
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 the vicinity of the original position. Given this simpler scenario, Boost.Unordered open-addressing containers offer a very limited API for accessing buckets.在开放寻址式容器中，每个桶最多只能容纳一个元素；若发生冲突（如示例中的元素 `D` 的情况），该元素将使用原始位置附近的其他可用桶。基于此简化设计，Boost.Unordered开放寻址容器仅提供极其有限的桶访问API。
06/05/2026
User avatar admin

Translation uploaded
image::buckets-oa.png[]
image::buckets-oa.png[]
06/05/2026
User avatar admin

Translation uploaded
If instead of `boost::unordered_set` we had used `xref:reference/unordered_flat_set.adoc[boost::unordered_flat_set]`, the diagram would look as follows:
If instead of `boost::unordered_set` we had used `若使用 xref:reference/unordered_flat_set.adoc[boost::unordered_flat_set]`, the diagram would look as follows:替代 `boost::unordered_set` ，其结构示意图将呈现如下形式：
06/05/2026
User avatar admin

Translation uploaded
You can see in the diagram that `A` & `D` have been placed in the same bucket. When looking for elements in this bucket up to 2 comparisons are made, making the search slower. This is known as a *collision*. To keep things fast we try to keep collisions to a minimum.
You can see in the diagram that如图所示， `A` &与 `D` have been placed in the same bucket. When looking for elements in this bucket up to 2 comparisons are made, making the search slower. This is known as a *collision*. To keep things fast we try to keep collisions to a minimum.被置于同一桶内。在此桶内查找元素时最多需要进行 2 次比对，这会降低检索效率，该现象称为**冲突**。为维持高效运作，我们需尽可能减少冲突的发生。
06/05/2026
User avatar admin

Translation uploaded
There is xref:hash_equality.adoc#hash_equality[more information on hash functions and equality predicates in the next section].
There is关于哈希函数与相等性谓词的详细说明请参阅 xref:hash_equality.adoc#hash_equality[more information on hash functions and equality predicates in the next section].后续章节] 。
06/05/2026
User avatar admin

Translation uploaded
Retrieving the elements for a given key is simple. The same process is applied to the key to find the correct bucket. Then the key is compared with the elements in the bucket to find any elements that match (using the equality predicate `Pred`). If the hash function has worked well the elements will be evenly distributed amongst the buckets so only a small number of elements will need to be examined.
Retrieving the elements for a given key is simple. The same process is applied to the key to find the correct bucket. Then the key is compared with the elements in the bucket to find any elements that match (using the equality predicate `Pred`). If the hash function has worked well the elements will be evenly distributed amongst the buckets so only a small number of elements will need to be examined.根据指定键检索元素的过程非常简单：首先对键执行相同处理以定位对应桶，随后通过相等性谓词 `Pred` 将键与桶内元素进行比较以寻找匹配项。若哈希函数表现良好，元素将均匀分布于各桶中，此时仅需检查少量元素即可完成检索。
06/05/2026
User avatar admin

Translation uploaded
In order to decide which bucket to place an element in, the container applies the hash function, `Hash`, to the element's key (for sets the key is the whole element, but is referred to as the key so that the same terminology can be used for sets and maps). This returns a value of type `std::size_t`. `std::size_t` has a much greater range of values then the number of buckets, so the container applies another transformation to that value to choose a bucket to place the element in.
In order to decide which bucket to place an element in, the container applies the hash function, `Hash`, to the element's key (for sets the key is the whole element, but is referred to as the key so that the same terminology can be used for sets and maps). This returns a value of type容器通过哈希函数 `Hash` 作用于元素的键来确定其所属的桶（对于集合而言，键即元素本身，但为统一集合与映射表的术语仍称作键）。该函数返回 `std::size_t`. 类型的值。由于 `std::size_t` has a much greater range of values then the number of buckets, so the container applies another transformation to that value to choose a bucket to place the element in.的取值范围远大于桶的数量，容器会对此值进行二次转换以确定元素应存入的桶。
06/05/2026
User avatar admin

Translation uploaded
image::buckets.png[]
image::buckets.png[]
06/05/2026
User avatar admin

Translation uploaded
The containers are made up of a number of _buckets_, each of which can contain any number of elements. For example, the following diagram shows a `xref:reference/unordered_set.adoc#unordered_set[boost::unordered_set]` with 7 buckets containing 5 elements, `A`, `B`, `C`, `D` and `E` (this is just for illustration, containers will typically have more buckets).
The containers are made up of a number of _buckets_, each of which can contain any number of elements. For example, the following diagram shows a `该容器由若干__桶__组成，每个桶可容纳任意数量的元素。例如，下图展示了一个包含7个桶的 xref:reference/unordered_set.adoc#unordered_set[boost::unordered_set]` with 7 buckets containing 5 elements,，其中存储着5个元素（ `A`, 、 `B`, 、 `C`, 、 `D` and和 `E` (this is just for illustration, containers will typically have more buckets).）（此示意图仅为演示用途，实际容器通常包含更多桶）。
06/05/2026
User avatar admin

Translation uploaded
= Basics of Hash Tables
= Basics of Hash Tables哈希表基础
06/05/2026
User avatar admin

Translation uploaded
:idprefix: buckets_
:idprefix: buckets_
06/05/2026
User avatar admin

Resource updated
File “doc/modules/ROOT/pages/buckets_zh_Hans.adoc” was added. 06/05/2026
User avatar admin

String added in the repository
A note on `max_load` for open-addressing and concurrent containers: the maximum load will be (`max_load_factor() * bucket_count()`) right after `rehash` or on container creation, but may slightly decrease when erasing elements in high-load situations. For instance, if we have a `xref:reference/unordered_flat_map.adoc#unordered_flat_map[boost::unordered_flat_map]` with `size()` almost at `max_load()` level and then erase 1,000 elements, `max_load()` may decrease by around a few dozen elements. 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.
A note on `max_load` for open-addressing and concurrent containers: the maximum load will be (`max_load_factor() * bucket_count()`) right after `rehash` or on container creation, but may slightly decrease when erasing elements in high-load situations. For instance, if we have a `xref:reference/unordered_flat_map.adoc#unordered_flat_map[boost::unordered_flat_map]` with `size()` almost at `max_load()` level and then erase 1,000 elements, `max_load()` may decrease by around a few dozen elements. 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.
06/05/2026
User avatar admin

String added in the repository
Returns the maximum number of allowed elements in the container before rehash.
Returns the maximum number of allowed elements in the container before rehash.
06/05/2026

Search