2. Boost Unordered Translation (zh_Hans)
3. Chinese (Simplified Han script)
4. Zen

23 :25
	English xref:reference/header_unordered_node_set_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_node_set_fwd.hpp>+++</code>+++ Synopsis]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — xref:reference/header_unordered_node_set_fwd.adoc[+++<code style="color: inherit;">+++<boost unordered="" unordered_node_set_fwd.hpp="">+++</boost></code>+++ 概要] 161/1530 · 153 Needs editing
23 :273
	English If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 如果 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanching[hash_is_avalanching]<hash>::value` 为 `true`，则哈希函数将按原样使用；否则，会增加一个位混合后处理阶段，以牺牲额外的计算成本为代价来提高哈希质量。</hash> 183/2980 · 298 Needs editing
23 :318
	English The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the container (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 桶数组的大小可以通过调用 `insert`/`emplace` 自动增加，或者作为调用 `rehash`/`reserve` 的结果。容器的 _负载因子_（元素数量除以桶数量）永远不会大于 `max_load_factor()`，但在容器规模较小时，实现可能会允许更高的负载。 138/3610 · 361 Needs editing
23 :331
	English If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 若 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<hash>::value` 为 `true`，则直接使用原哈希函数；否则会添加一个位混合后置处理阶段，以额外计算开销为代价提升哈希质量。</hash> 181/2980 · 298 Needs editing
23 :367
	English If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 若 link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[`hash++_++is++_++avalanching`]`++&lt;++Hash++&gt;++::value` 为 `true` ，则直接使用哈希函数；否则，会添加一个位混合后处理阶段以提高哈希质量，但会牺牲额外的计算成本。 200/2980 · 298 Needs editing
23 :264
	English The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the container (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 桶数组的大小可以通过调用 `insert`/`emplace` 自动增加，或者作为调用 `rehash`/`reserve` 的结果而增加。容器的**负载因子**（元素个数除以桶数量）永远不会大于 `max_load_factor()`，但在容量较小的情况下，实现可能会允许更高的负载。 143/3610 · 361 Needs editing
:280 :280
	English A constant iterator whose value type is `value_type`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 一个常量迭代器，其值类型为 `value_type`。 27/530 · 53 Needs editing
23 :315
	English The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the container (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 桶数组的大小可通过调用 `insert` / `emplace` 自动增加，也可通过调用 `rehash` / `reserve` 来调整。容器的__负载因子__（元素数量与桶数量的比值）始终不会超过 `max++_++load++_++factor()` ，但在小规模数据情况下，实现可能允许更高的负载因子。 155/3610 · 361 Needs editing
23 :315
	English Globally define this macro to support loading of ``unordered_map``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 全局定义此宏以支持加载由 Boost 1.84 之前版本的 Boost 保存到 Boost.Serialization 归档中的 `unordered_map`。 81/1510 · 151 Needs editing
24 :24
	English xref:reference/stats.adoc[Statistics]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — xref:reference/stats.adoc[统计信息] 31/370 · 37 Needs editing
:111 :111
	English ```cpp struct point { int x; int y; };
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — ```cpp struct point { int x; int y; }; 38/380 · 38 Needs editing
24 :104
	English In a non-concurrent unordered container, iterators serve two main purposes:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 在非并发无序容器中，迭代器主要有两项核心功能： 23/750 · 75 Needs editing
24 :100
	English Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 构造函数包含可选的额外参数，用于指定初始最小哈希桶数量、哈希函数以及相等性判断对象。 42/1260 · 126 Needs editing
24 :42
	English Avalanching hash functions must now be marked via an `is_avalanching` typedef with an embedded `value` constant set to `true` (typically, defining `is_avalanching` as `std::true_type`). `using is_avalanching = void` is deprecated but allowed for backwards compatibility.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 雪崩哈希函数现在必须通过内嵌 `value` 常量设为 `true` 的 `is_avalanching` typedef 来标记（通常将 `is_avalanching` 定义为 `std::true_type`）。 `using is_avalanching = void` 已被弃用，但为了向后兼容性仍予保留。 158/2700 · 270 Needs editing
:54 :54
	English Visualization structure
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 可视化结构 5/230 · 23 Needs editing
24 :230
	English _Bulk visitation_ allows us to pass all the keys in one operation:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — __批量访问__允许用户通过单次操作传入所有键： 24/660 · 66 Needs editing
:318 :318
	English ---
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — --- 3/100 · 3 Needs editing
24 :69
	English image::benchmarks-set/gcc/scattered erasure by key.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure by key.xlsx.practice non-unique.png,window=_blank]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — image::benchmarks-set/gcc/scattered erasure by key.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure by key.xlsx.practice non-unique.png,window=_blank] 190/1900 · 190 Needs editing
24 :73
	English Since release 1.80.0, prime numbers are chosen for the number of buckets in tandem with sophisticated modulo arithmetic. This removes the need for "mixing" the result of the user's hash function as was used for release 1.79.0.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 自1.80.0版起，结合精密取模运算选用质数桶量，无需1.79.0版所用的用户哈希函数结果"混合"处理。 52/2260 · 226 Needs editing
:283 :283
	English The iterator category is at least a forward iterator.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 迭代器类别至少为前向迭代器。 14/530 · 53 Needs editing