Language Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
English
Chinese (Simplified Han script) 100% 20
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/regular_*.adoc
Monolingual base language file doc/modules/ROOT/pages/regular.adoc
06/27/2026

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 156 1,890 13,864
Source 78 945 6,932
Translated 100% 156 100% 1,890 100% 13,864
Needs editing 0% 0 0% 0 0% 0
Read-only 50% 78 50% 945 50% 6,932
Failing checks 12% 20 13% 246 14% 2,060
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 242 changes 0 changes 0 changes
JulAugSepOctNovDecJanFebMarAprMayJun

Quick numbers

1,890
Hosted words
156
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 completed
Translation completed 05/27/2026
User avatar zmy2001

Translation added
O(_N log N_), O(_N_) if the range is sorted with `value_comp()`
O(_N log N_)，如果区间已按 `value_comp()` 排序则为 O(_N_)
05/27/2026
User avatar zmy2001

Translation added
O(_n_) where _n_ is the minimum number of buckets.
O(_n_)，其中 _n_ 是最小桶数。
05/27/2026
User avatar zmy2001

Translation changed
so as to not exceed the maximum load factor. + Because the maximum load factor is defined as the number of elements divided by the total number of available buckets, this function is logically equivalent to: + ``` x.rehash(std::ceil(n / x.max_load_factor())) ``` + See the xref:reference/unordered_map.adoc#unordered_map_rehash[reference for more details] on the `rehash` function.
以确保证不超出过最大负载因子。由于最大负载因子定义为元素数量除以可用桶的总数，该函数在逻辑上等价于：
```cppx.rehash(std::ceil(n / x.max_load_factor()))有关```
有关 `rehash` 函数的更多详情，请参见细信息，请参阅 xref:reference/unordered_map.adoc#unordered_map_rehash [参考文档]。
05/27/2026
User avatar zmy2001

Translation changed
`reserve(n)` reserves space for at least `n` elements, allocating enough buckets
`reserve(n)` 为至少 `n` 个元素预留空间，通过分配足够的桶数量来确保容器负载不超过最大负载因子。数量的桶，
05/27/2026
User avatar zmy2001

Translation changed
In a similar manner to using `reserve` for ``vector``s, it can be a good idea to call `reserve` before inserting a large number of elements. This will get the expensive rehashing out of the way and let you store iterators, safe in the knowledge that they won't be invalidated. If you are inserting `n` elements into container `x`, you could first call:
类似于对与为 `vector` 使用 `reserve` 的方法类似，在插入大量元素之前先调用 `reserve` 是推荐做法。这将避免昂贵一个好主意。这样可以避免代价高昂的重新哈希操作，并确保迭代器在后续插入中保持有效。若需且让你能够存储迭代器，确信它们不会被失效。如果你要向容器 `x` 插入 `n` 个元素，可以先调用：
05/27/2026
User avatar zmy2001

Translation changed
[#regular] = Regular Containers
[#regular] = 常规容器
05/27/2026
User avatar zmy2001

Translation added
xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
xref:regular.adoc#regular_iterator_invalidation [调用 insert 或 rehash 可能会导致迭代器失效]。
05/27/2026
User avatar zmy2001

Translation changed
so as to not exceed the maximum load factor. + Because the maximum load factor is defined as the number of elements divided by the total number of available buckets, this function is logically equivalent to: + ``` x.rehash(std::ceil(n / x.max_load_factor())) ``` + See the xref:reference/unordered_map.adoc#unordered_map_rehash[reference for more details] on the `rehash` function.
x.reserve(n);以保证不超出最大负载因子。由于最大负载因子定义为元素数量除以可用桶总数，该函数逻辑等价于：x.rehash(std::ceil(n / x.max_load_factor()))有关rehash函数的更多详情，请参见 xref:reference/unordered_map.adoc#unordered_map_rehash [参考文档]。
05/27/2026
Browse all component changes