User avatar admin

Repository rebased
Repository rebased

Original revision: 6bd7d6f788522d8144d9647edaf6701b3569cb66
New revision: 6bd7d6f788522d8144d9647edaf6701b3569cb66 06/05/2026
User avatar admin

Component created
Component created (boost_endpoint) 06/05/2026
User avatar admin

Project created
Project created 06/05/2026
User avatar admin

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

Translation uploaded
For more information on implementation rationale, read the xref:rationale.adoc#rationale_concurrent_containers[corresponding section].
如需了解实现原理的更多内容，请参阅 xref:rationale.adoc#rationale_concurrent_containers [对应章节]。
06/05/2026
User avatar admin

Translation uploaded
This algorithm has very low contention both at the lookup and actual insertion phases in exchange for the possibility that computations have to be started over if some other thread interferes in the process by performing a succesful insertion beginning at the same group. In practice, the start-over frequency is extremely small, measured in the range of parts per million for some of our benchmarks.
For more information on implementation rationale, read the xref:rationale.adoc#rationale_concurrent_containers[corresponding section].该算法在查找和实际插入阶段都具有非常低的争用，代价是如果其他线程在同一个组上成功执行了插入操作，则当前计算可能需要重新开始。在实际应用中，重新开始的频率极低，根据我们的一些基准测试，其量级在百万分之一以内。
06/05/2026
User avatar admin

Translation uploaded
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.
This algorithm has very low contention both at the lookup and actual insertion phases in exchange for the possibility that computations have to be started over if some other thread interferes in the process by performing a succesful insertion beginning at the same group. In practice, the start-over frequency is extremely small, measured in the range of parts per million for some of our benchmarks.缩减哈希值被设置），并且插入计数器被原子地递增：如果在整个操作过程中没有其他线程递增该计数器（通过与 `c0` 比较来检查），则插入操作可以顺利完成，否则将回滚并重新开始。
06/05/2026
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

Search