Language Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
English 100% 2
Chinese (Simplified Han script) 100% 4
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 0502087
Boost-Translation-CI-Bot authored 04/23/2026
Last commit in Weblate Translated using Weblate (Chinese (Simplified Han script)) 9c34645
User avatar admin authored 04/23/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
05/02/2026

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 114 2,462 17,690
Source 57 1,231 8,845
Translated 100% 114 100% 2,462 100% 17,690
Needs editing 0% 0 0% 0 0% 0
Read-only 50% 57 50% 1,231 50% 8,845
Failing checks 5% 6 8% 204 7% 1,240
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 180 changes
MayJunJulAugSepOctNovDecJanFebMarApr

Quick numbers

2,462
Hosted words
114
Hosted strings
100%
Translated
1
Contributors
0
Components
2
Languages
2
Translations
0
Screenshots
and previous 30 days

Trends of last 30 days

+100%
Hosted words
—
+100%
Hosted strings
—
+100%
Translated
—
+100%
Contributors
—
User avatar None

Alert triggered
Repository has changes. 04/24/2026
User avatar admin

Changes committed
Changes committed 04/23/2026
User avatar admin

Translation completed
Translation completed 04/23/2026
User avatar admin

Translation added
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].
关于 Boost.Unordered 开放寻址实现的更详细说明请参阅 https://bannalia.blogspot.com/2022/11/inside-boostunorderedflatmap.html[外部文章] 。 若需了解实现原理的更多信息，请参阅 xref:rationale.adoc#rationale_open_addresing_containers[相关说明章节] 。
04/23/2026
User avatar admin

Translation added
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 比特。
04/23/2026
User avatar admin

Translation added
Data Structures
数据结构
04/23/2026
User avatar admin

Translation added
Concurrent Containers
并发容器
04/23/2026
User avatar admin

Translation added
The canonical standard approach
典型标准库实现结构
04/23/2026
User avatar admin

Translation added
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.
若该比特位为1（表示该组已__溢出__），则通过 https://en.wikipedia.org/wiki/Quadratic_probing[_二次探查法_] 检查后续组，并重复此过程。
04/23/2026
User avatar admin

Translation added
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.
该算法在查找和实际插入阶段都具有极低的争用， 其代价是：当其他线程从同一初始组开始执行插入操作并成功时， 当前线程的计算可能需要重新执行。 实际应用中， 重启频率极低（ 部分基准测试中为百万分之一量级）.
04/23/2026
Browse all component changes