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 commit in Weblate Update translation files b408603
Weblate authored 06/05/2026
Weblate repository https://insights.cppalliance.org/weblate/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/05/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 0 changes 0 changes 0 changes
JunJulAugSepOctNovDecJanFebMarAprMay

Quick numbers

0
Hosted words
0
Hosted strings
0%
Translated
0
Contributors
0
Components
0
Languages
0
Translations
0
Screenshots
and previous 30 days

Trends of last 30 days

—
Hosted words
—
—
Hosted strings
—
—
Translated
—
—
Contributors
—
User avatar None

Alert triggered
Repository has changes. 06/06/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
Browse all component changes