User avatar admin

Translation uploaded
Thus container-wide iteration is turned into traversing the non-empty bucket groups (an operation with constant time complexity) which reduces the time complexity back to `O(size())`. In total, a bucket group is only 4 words in size and it views `sizeof(std::size_t) * CHAR_BIT` buckets meaning that for all common implementations, there's only 4 bits of space overhead per bucket introduced by the bucket groups.
Thus container-wide iteration is turned into traversing the non-empty bucket groups (an operation with constant time complexity) which reduces the time complexity back to `O(size())`. In total, a bucket group is only 4 words in size and it views `sizeof(std::size_t) * CHAR_BIT` buckets meaning that for all common implementations, there's only 4 bits of space overhead per bucket introduced by the bucket groups.因此，容器范围内的迭代转变为遍历非空的桶组（这是一个具有常数时间复杂度的操作），从而将时间复杂度降回 `O(size())`。总体而言，一个桶组的大小仅为 4 个字，它覆盖 `sizeof(std::size_t) * CHAR_BIT` 个桶，这意味着在所有常见实现中，每个桶由桶组引入的空间开销仅为 4 位。
06/05/2026
User avatar admin

Translation uploaded
image::fca.png[align=center]
image::fca.png[align=center]
06/05/2026
User avatar admin

Translation uploaded
In practice, the extra indirection can have a dramatic performance impact to common operations such as `insert`, `find` and `erase`. But to keep iteration of the container fast, Boost.Unordered introduces a novel data structure, a "bucket group". A bucket group is a fixed-width view of a subsection of the buckets array. It contains a bitmask (a `std::size_t`) which it uses to track occupancy of buckets and contains two pointers so that it can form a doubly-linked list with non-empty groups. An example diagram is below:
In practice, the extra indirection can have a dramatic performance impact to common operations such as在实际使用中，额外的间接层会对 `insert`, 、`find` and和 `erase`. But to keep iteration of the container fast, Boost.Unordered introduces a novel data structure, a "bucket group". A bucket group is a fixed-width view of a subsection of the buckets array. It contains a bitmask (a `std::size_t`) which it uses to track occupancy of buckets and contains two pointers so that it can form a doubly-linked list with non-empty groups. An example diagram is below: 等常见操作的性能产生显著影响。但为了保持容器的迭代速度，Boost.Unordered 引入了一种新颖的数据结构——“桶组”。桶组是桶数组的一个固定宽度的子区间视图。它包含一个位掩码（类型为 `std::size_t`），用于跟踪桶的占用情况，并包含两个指针，以便与非空组形成双向链表。下面是一个示例图：
06/05/2026
User avatar admin

Translation uploaded
With a simple bucket group layout, this is all that must be done: ```c++ auto const idx = get_bucket_idx(hash_function(key)); node* n = buckets[idx]; // first load if (n) { value_type const& v = *n; // second load // ... } ```
With a simple bucket group layout, this is all that must be done: 使用简单的桶组布局，只需执行以下操作：```c++ auto const idx = get_bucket_idx(hash_function(key)); node* n = buckets[idx]; // first load 第一次加载if (n) { value_type const& v = *n; // second load第二次加载 // ... } }```
06/05/2026
User avatar admin

Translation uploaded
```c++ auto const idx = get_bucket_idx(hash_function(key)); node* p = buckets[idx]; // first load node* n = p->next; // second load if (n && is_in_bucket(n, idx)) { value_type const& v = *n; // third load // ... } ```
```c++ auto const idx = get_bucket_idx(hash_function(key)); node* p = buckets[idx]; // first load node* n = p->>next; // second load if (n &&& is_in_bucket(n, idx)) { value_type const& v = *n; // third load // ... } ```
06/05/2026
User avatar admin

Translation uploaded
This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done:
This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done:这种非常规数据结构通过将所有节点连成单向链表来实现高效全局迭代。需注意：桶指向其元素起始节点的__前驱节点__，这样设计的目的是在保持高效元素删除的同时，无需引入双向链表。但这种数据结构不可避免地带来了额外的间接访问开销。例如，要访问某个桶的第一个元素，必须执行类似以下操作：
06/05/2026
User avatar admin

Translation uploaded
It's worth noting that this approach is only used by pass:[libc++] and pass:[libstdc++]; the MSVC Dinkumware implementation uses a different one. A more detailed analysis of the standard containers can be found http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered.html[here].
It's worth noting that this approach is only used by值得注意的是，这种方法仅被 pass:[libc++] and和 pass:[libstdc++]; the 所采用；MSVC 的 Dinkumware implementation uses a different one. A more detailed analysis of the standard containers can be found实现则使用了不同的方法。关于标准容器的更详细分析可参见 http://bannalia.blogspot.com/2013/10/implementation-of-c-unordered.html[here].此处]。
06/05/2026
User avatar admin

Translation uploaded
image::singly-linked.png[align=center,link=_images/singly-linked.png,window=_blank]
image::singly-linked.png[align=center,link=_images/singly-linked.png,window=_blank]
06/05/2026
User avatar admin

Translation uploaded
Canonical standard implementations will wind up looking like the diagram below:
Canonical standard implementations will wind up looking like the diagram below:典型的标准库实现最终会形成如下图所示的结构：
06/05/2026
User avatar admin

Translation uploaded
An array of "buckets" is allocated and each bucket in turn points to its own individual linked list. This makes meeting the standard requirements of bucket iteration straight-forward. Unfortunately, iteration of the entire container is often times slow using this layout as each bucket must be examined for occupancy, yielding a time complexity of `O(bucket_count() + size())` when the standard requires complexity to be `O(size())`.
An array of "buckets" is allocated and each bucket in turn points to its own individual linked list. This makes meeting the standard requirements of bucket iteration straight-forward. Unfortunately, iteration of the entire container is often times slow using this layout as each bucket must be examined for occupancy, yielding a time complexity of系统分配一个"桶"数组，其中每个桶分别指向其专属的链表。这种结构使得桶迭代能直接满足标准要求。但采用此布局进行整体容器迭代通常较慢，因为需检查每个桶的占用状态，其时间复杂度为 `O(bucket_++_++count() +{plus} size())` when the standard requires complexity to be，而标准要求复杂度应为 `O(size())`. 。
06/05/2026
User avatar admin

Translation uploaded
image::bucket-groups.png[align=center]
image::bucket-groups.png[align=center]
06/05/2026
User avatar admin

Translation uploaded
Boost.Unordered sports one of the fastest implementations of closed addressing, also commonly known as https://en.wikipedia.org/wiki/Hash_table#Separate_chaining[separate chaining]. An example figure representing the data structure is below:
Boost.Unordered sports one of the fastest implementations of closed addressing, also commonly known as https://en.wikipedia.org/wiki/Hash_table#Separate_chaining[separate chaining]. An example figure representing the data structure is below:提供了速度最快的闭寻址实现之一，该结构通常被称为 https://en.wikipedia.org/wiki/Hash_table#Separate_chaining[分离链接法] 。其数据结构示例如下：
06/05/2026
User avatar admin

Translation uploaded
Closed-addressing Containers
Closed-addressing Containers闭寻址容器
06/05/2026
User avatar admin

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

Translation uploaded
[#structures] = Data Structures
[#structures] = Data Structures数据结构
06/05/2026
User avatar admin

File uploaded
Processed 78 strings from the uploaded files (skipped: 0, not found: 0, updated: 78).
File upload mode: Add as translation 06/05/2026
User avatar admin

Translation uploaded
n/a
n/a
06/05/2026
User avatar admin

Translation uploaded
`lower_bound`,`upper_bound`
`lower_bound`,`upper_bound`
06/05/2026
User avatar admin

Translation uploaded
`equal_range(k)`
`equal_range(k)`
06/05/2026
User avatar admin

Translation uploaded
Count
Count计数
06/05/2026

Search