User avatar admin

Translation uploaded
When an available slot is located, it is preemptively occupied (its
Lookup is as described above. If lookup finds no equivalent element,当定位到一个可用槽位时，该槽位会被预先占用（其
06/05/2026
User avatar admin

Translation uploaded
search for an available slot for insertion successively locks/unlocks each group in the probing sequence.
reduced hash value is set) and the insertion counter is atomically incremented: if no other thread has incremented the counter during the whole operation (which is checked by comparing with `c0`), then we're good to go and complete the insertion, otherwise we roll back and start over.则会依次对探测序列中的每个组进行加锁/解锁，以搜索可用于插入的空槽位。
06/05/2026
User avatar admin

Translation uploaded
Lookup is as described above. If lookup finds no equivalent element,
The value of the insertion counter for the initial group in the probe查找过程如上所述。如果查找未找到等效元素，
06/05/2026
User avatar admin

Translation uploaded
sequence is locally recorded (let's call this value `c0`).
search for an available slot for insertion successively locks/unlocks each group in the probing sequence.序列会被本地记录（我们称此值为 `c0`）。
06/05/2026
User avatar admin

Translation uploaded
The value of the insertion counter for the initial group in the probe
A read-write spinlock for synchronized access to any element in the group. ** An atomic _insertion counter_ used for optimistic insertion as described below.探测起始组的插入计数器值
06/05/2026
User avatar admin

Translation uploaded
Insertion uses the following _optimistic algorithm_:
sequence is locally recorded (let's call this value `c0`).插入操作使用以下 _乐观算法_：
06/05/2026
User avatar admin

Translation uploaded
By using atomic operations to access the group metadata, lookup is (group-level) lock-free up to the point where an actual comparison needs to be done with an element that has been previously SIMD-matched: only then is the group's spinlock used.
Insertion uses the following _optimistic algorithm_:通过使用原子操作访问组元数据，查找操作在（组级别）上是无锁的，直到需要与实际进行 SIMD 匹配的元素进行比较时才会使用组的自旋锁。
06/05/2026
User avatar admin

Translation uploaded
** A read-write spinlock for synchronized access to any element in the group. ** An atomic _insertion counter_ used for optimistic insertion as described below.
By using atomic operations to access the group metadata, lookup is (group-level) lock-free up to the point where an actual comparison needs to be done with an element that has been previously SIMD-matched: only then is the group's spinlock used.- 一个读写自旋锁，用于同步对组内任何元素的访问。
- 一个原子 _插入计数器_，用于下文所述的乐观插入。
06/05/2026
User avatar admin

Translation uploaded
Group level: Each 15-slot group is equipped with an 8-byte word containing:
Group level: Each 15-slot group is equipped with an 8-byte word containing:组级：每个包含15个槽位的组都配备一个8字节的字，其中包含：
06/05/2026
User avatar admin

Translation uploaded
to the container. Typically, such access is in read mode (that is, concurrent) even for modifying operations, so for most practical purposes there is no thread contention at this level. Access is only in write mode (blocking) when rehashing or performing container-wide operations such as swapping or assignment.
to the container. Typically, such access is in read mode (that is, concurrent) even for modifying operations, so for most practical purposes there is no thread contention at this level. Access is only in write mode (blocking) when rehashing or performing container-wide operations such as swapping or assignment.对容器的访问。通常情况下，即使是修改操作，此类访问也处于读模式（即并发的），因此在实际使用中，此层面几乎不会发生线程争用。仅在重哈希或执行交换、赋值等容器级操作时，访问才会处于写模式（阻塞）。
06/05/2026
User avatar admin

Translation uploaded
Container level: A read-write mutex is used to control access from any operation
Container level: A read-write mutex is used to control access from any operation容器层面：使用读写互斥锁来控制来自任何操作的访问。
06/05/2026
User avatar admin

Translation uploaded
Two levels of synchronization are used:
Two levels of synchronization are used:采用两级同步机制：
06/05/2026
User avatar admin

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

Translation uploaded
`boost::concurrent_flat_set`/`boost::concurrent_node_set` and `boost::concurrent_flat_map`/`boost::concurrent_node_map` use the basic xref:structures.adoc#structures_open_addressing_containers[open-addressing layout] described above augmented with synchronization mechanisms.
`boost::concurrent_flat_set`/`boost::concurrent_node_set` and和 `boost::concurrent_flat_map`/`boost::concurrent_node_map` use the basic使用了上述基本的 xref:structures.adoc#structures_open_addressing_containers[open-addressing layout] described above augmented with synchronization mechanisms.开放寻址布局]，并增加了同步机制。
06/05/2026
User avatar admin

Translation uploaded
Concurrent Containers
Concurrent Containers并发容器
06/05/2026
User avatar admin

Translation uploaded
A more detailed description of Boost.Unordered's open-addressing implementation is given in an https://bannalia.blogspot.com/2022/11/inside-boostunorderedflatmap.html[external article]. For more information on implementation rationale, read the xref:rationale.adoc#rationale_open_addresing_containers[corresponding section].
A more detailed description of Boost.Unordered's open-addressing implementation is given in an https://bannalia.blogspot.com/2022/11/inside-boostunorderedflatmap.html[external article]. For more information on implementation rationale, read the关于 Boost.Unordered 开放寻址实现的更详细描述，请参阅 https://bannalia.blogspot.com/2022/11/inside-boostunorderedflatmap.html[外部文章]。有关实现原理的更多信息，请阅读 xref:rationale.adoc#rationale_open_addresing_containers[corresponding section].相应章节]。
06/05/2026
User avatar admin

Translation uploaded
image::foa-metadata-interleaving.png[align=center]
image::foa-metadata-interleaving.png[align=center]
06/05/2026
User avatar admin

Translation uploaded
In architectures without SIMD support, the logical layout stays the same, but the metadata word is codified using a technique we call _bit interleaving_: this layout allows us to emulate SIMD with reasonably good performance using only standard arithmetic and logical operations.
In architectures without SIMD support, the logical layout stays the same, but the metadata word is codified using a technique we call _bit interleaving_: this layout allows us to emulate SIMD with reasonably good performance using only standard arithmetic and logical operations.在不支持 SIMD 的架构中，逻辑布局保持不变，但元数据字采用一种称为 _位交错_ 的技术进行编码：这种布局允许我们仅使用标准算术和逻辑运算，以相当不错的性能来模拟 SIMD。
06/05/2026
User avatar admin

Translation uploaded
Insertion is algorithmically similar: empty buckets are located using SIMD, and when going past a full group its corresponding overflow bit is set to 1.
Insertion is algorithmically similar: empty buckets are located using SIMD, and when going past a full group its corresponding overflow bit is set to 1.插入操作的算法逻辑类似：通过 SIMD 技术定位空桶，当遍历到已满的组时，会将其对应的溢出位设置为 1。
06/05/2026
User avatar admin

Translation uploaded
- If the bit in the position _h_ mod 8 is zero, lookup terminates (and the element is not present). - If the bit is set to 1 (the group has been _overflowed_), further groups are checked using https://en.wikipedia.org/wiki/Quadratic_probing[_quadratic probing_], and the process is repeated.
- If the bit in the position _h_ mod 8 is zero, lookup terminates (and the element is not present). - If the bit is set to 1 (the group has been _overflowed_), further groups are checked using若位置 _h_ mod 8 的比特位为零，则查找终止（确认元素不存在）。 元素不存在）。 - 若该比特位为1（表示该组已__溢出__），则通过 https://en.wikipedia.org/wiki/Quadratic_probing[_quadratic probing_], and the process is repeated.二次探查法_] 检查后续组，并重复此过程。
06/05/2026

Search