Language Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
English 100% 2
Chinese (Simplified Han script) 100% 13
Please sign in to see the alerts.

Summary

Project website www.boost.org
Instructions for translators

Please translate the Boost.Unordered documentation. Maintain technical accuracy and follow exact formatting conventions.
Translation process
  • Translations can be made directly.
  • Translation suggestions can be made.
  • Any authenticated user can contribute.
  • The translation uses monolingual files.
  • The translation base language can not be edited.
Source code repository git@github.com:CppDigest/unordered.git
Repository branch local-zh_Hans
Last remote commit Add create-tag workflow 9156679
Boost-Translation-CI-Bot authored 06/05/2026
Last commit in Weblate Translated using Weblate (Chinese (Simplified Han script)) 800b876
User avatar zmy2001 authored 05/28/2026
Weblate repository https://boost-weblate.cloud/git/boost-unordered-documentation-zh_Hans/doc-modules-root-nav-adoc/
File mask doc/modules/ROOT/pages/structures_*.adoc
Monolingual base language file doc/modules/ROOT/pages/structures.adoc
06/28/2026

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 94 2,398 17,512
Source 47 1,199 8,756
Translated 100% 94 100% 2,398 100% 17,512
Needs editing 0% 0 0% 0 0% 0
Read-only 50% 47 50% 1,199 50% 8,756
Failing checks 15% 15 10% 256 9% 1,725
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 0% 0 0% 0 0% 0
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 149 changes 0 changes 0 changes
JulAugSepOctNovDecJanFebMarAprMayJun

Quick numbers

2,398
Hosted words
94
Hosted strings
100%
Translated
2
Contributors
0
Components
2
Languages
2
Translations
0
Screenshots
and previous 30 days

Trends of last 30 days

—
Hosted words
+100%
—
Hosted strings
+100%
—
Translated
+100%
—
Contributors
+100%
User avatar weblate:commit

Changes committed
Changes committed 05/27/2026
User avatar zmy2001

Translation changed
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.
该算法在查找和实际插入阶段的竞争冲突极低，但存在一种情况：若都具有非常低的争用，代价是如果其他线程从同一分组开始成功插入数据造成干扰，在同一个组上成功执行了插入操作，则当前计算流程就可能需要重新执行。实际测试中，流程重启的概率极低，部分基准测试中仅为百万分比级别开始。在实际应用中，重新开始的频率极低，根据我们的一些基准测试，其量级在百万分之一以内。
05/27/2026
User avatar zmy2001

Translation changed
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.
（已设置缩减哈希值），并以原子方式递增插入计数器：若整个操作期间无其他线程递增该计数器（通过与c0比对校验），则正常完成插入；否则执行被设置），并且插入计数器被原子地递增：如果在整个操作过程中没有其他线程递增该计数器（通过与 `c0` 比较来检查），则插入操作可以顺利完成，否则将回滚并重新开始。
05/27/2026
User avatar zmy2001

Translation changed
When an available slot is located, it is preemptively occupied (its
当定位到可用插槽时， 会抢先占用该插槽（设置其缩减哈希值）并原子地递增插入计数器： 若在整个操作期间没有其他线程递增过该计数器 （通过与 `c0` 比对确认）， 则操作成功并完成插入； 否则回滚并重新开始。一个可用槽位时，该槽位会被预先占用（其
05/27/2026
User avatar zmy2001

Translation changed
search for an available slot for insertion successively locks/unlocks each group in the probing sequence.
按探测顺序依次查找可用插入位，并对各个分组执行加锁 / 解锁操作则会依次对探测序列中的每个组进行加锁/解锁，以搜索可用于插入的空槽位。
05/27/2026
User avatar zmy2001

Translation changed
Lookup is as described above. If lookup finds no equivalent element,
查找操作按上述方式执行。 若查找未发现相等元素， 则会在探查序列中依次锁定/解锁各个分组来搜索可用插槽。过程如上所述。如果查找未找到等效元素，
05/27/2026
User avatar zmy2001

Translation changed
sequence is locally recorded (let's call this value `c0`).
如需了解有关实现原理的更多信息，请阅读 xref:rationale.adoc#rationale_concurrent_containers[相关说明章节] 序列会被本地记录（我们称此值为 `c0`）。
05/27/2026
User avatar zmy2001

Translation changed
The value of the insertion counter for the initial group in the probe
在探查序列的初始组中， 插入计数器的值会被本地记录（我们称此值为 `c0` ）。探测起始组的插入计数器值
05/27/2026
User avatar zmy2001

Translation changed
Insertion uses the following _optimistic algorithm_:
该算法在查找和实际插入阶段都具有极低的争用， 其代价是：当其他线程从同一初始组开始执行插入操作并成功时， 当前线程的计算可能需要重新执行。 实际应用中， 重启频率极低（ 部分基准测试中为百万分之一量级）.插入操作使用以下 _乐观算法_：
05/27/2026
User avatar zmy2001

Translation changed
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.
插入操作采用如下__乐观算法__：通过使用原子操作访问组元数据，查找操作在（组级别）上是无锁的，直到需要与实际进行 SIMD 匹配的元素进行比较时才会使用组的自旋锁。
05/27/2026
Browse all component changes