2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Rationale (adoc)
4. Chinese (Simplified Han script)
5. Zen

25 :77
	English Open-addresing Containers
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 开地址容器 5/250 · 25 Needs editing
26 :79
	English The C++ standard specification of unordered associative containers impose severe limitations on permissible implementations, the most important being that closed addressing is implicitly assumed. Slightly relaxing this specification opens up the possibility of providing container variations taking full advantage of open-addressing techniques.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — C++ 标准中对无序关联容器的规范对允许的实现方式施加了严格的限制，其中最重要的一点是隐式假定使用闭地址法。稍微放宽这一规范，则为提供能够充分利用开放寻址技术的容器变体开辟了可能性。 91/3440 · 344 Needs editing
27 :85
	English The design of `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` has been guided by Peter Dimov's https://pdimov.github.io/articles/unordered_dev_plan.html[Development Plan for Boost.Unordered^]. We discuss here the most relevant principles.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `boost::unordered++_++flat++_++set` / `unordered++_++node++_++set` 及 `boost::unordered++_++flat++_++map` / `unordered++_++node++_++map` 的设计遵循Peter Dimov的 https://pdimov.github.io/articles/unordered_dev_plan.html[Boost.Unordered开发计划] 中提出的指导原则。下文将探讨其中最核心的设计理念。 258/2920 · 292 Needs editing
28 :89
	English Hash Function
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 哈希函数 4/130 · 13 Needs editing
29 :91
	English Given its rich functionality and cross-platform interoperability, `boost::hash` remains the default hash function of open-addressing containers. As it happens, `boost::hash` for integral and other basic types does not possess the statistical properties required by open addressing; to cope with this, we implement a post-mixing stage:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 基于其丰富功能与跨平台互操作性， `boost::hash` 仍是开放寻址容器的默认哈希函数。但由于其对整型等基础类型实现的 boost::hash 缺乏开放寻址所需的统计特性，我们额外增加了后混合处理阶段： 104/3340 · 334 Needs editing
30 :97
	English {nbsp}{nbsp}{nbsp}{nbsp} _a_ <- _h_ *mul* _C_, + {nbsp}{nbsp}{nbsp}{nbsp} _h_ <- *high*(_a_) *xor* *low*(_a_),
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — {nbsp}{nbsp}{nbsp}{nbsp} _a_ &lt;- _h_ *mul* _C_, + {nbsp}{nbsp}{nbsp}{nbsp} _h_ &lt;- *high*(_a_) *xor* *low*(_a_), 116/1100 · 110 Needs editing
31 :100
	English where *mul* is an _extended multiplication_ (128 bits in 64-bit architectures, 64 bits in 32-bit environments), and *high* and *low* are the upper and lower halves of an extended word, respectively. In 64-bit architectures, _C_ is the integer part of 2^64^&#8725;https://en.wikipedia.org/wiki/Golden_ratio[_&phi;_], whereas in 32 bits _C_ = 0xE817FB2Du has been obtained from https://arxiv.org/abs/2001.05304[Steele and Vigna (2021)^].
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 其中 *mul* 是 _扩展乘法_（64 位架构中为 128 位，32 位环境中为 64 位），*high* 和 *low* 分别表示扩展字的高位部分和低位部分。在 64 位架构中，_C_ 是 2^64^∕https://en.wikipedia.org/wiki/Golden_ratio[_φ_] 的整数部分；而在 32 位架构中，_C_ = 0xE817FB2Du 取自 https://arxiv.org/abs/2001.05304[Steele and Vigna (2021)^]。 248/4350 · 435 Needs editing
32 :105
	English When using a hash function directly suitable for open addressing, post-mixing can be opted out of via a dedicated `link:../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]` trait. `boost::hash` specializations for string types are marked as avalanching.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当使用直接适合开放定址的哈希函数时，可以通过专用的 `link:../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanching[hash_is_avalanching]` 特征来退出后混合操作。针对字符串类型的 `boost::hash` 特化已被标记为雪崩式哈希。 171/2960 · 296 Needs editing
33 :109
	English Platform Interoperability
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 平台互操作性 6/250 · 25 Needs editing
34 :111
	English The observable behavior of `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` is deterministically identical across different compilers as long as their ``std::size_t``s are the same size and the user-provided hash function and equality predicate are also interoperable &#8212;this includes elements being ordered in exactly the same way for the same sequence of operations.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 只要不同编译器中的 `std::size_t` 大小相同，并且用户提供的哈希函数和相等谓词也具有互操作性，那么 `boost::unordered_flat_set`/`unordered_node_set` 和 `boost::unordered_flat_map`/`unordered_node_map` 的可观测行为在不同编译器之间是确定相同的——这包括对于相同的操作序列，元素的排列顺序也完全相同。 204/4250 · 425 Needs editing
35 :117
	English Although the implementation internally uses SIMD technologies, such as https://en.wikipedia.org/wiki/SSE2[SSE2^] and https://en.wikipedia.org/wiki/ARM_architecture_family#Advanced_SIMD_(NEON)[Neon^], when available, this does not affect interoperatility. For instance, the behavior is the same for Visual Studio on an x64-mode Intel CPU with SSE2 and for GCC on an IBM s390x without any supported SIMD technology.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 尽管实现内部在可用时会使用 SIMD 技术，例如 https://en.wikipedia.org/wiki/SSE2[SSE2^] 和 https://en.wikipedia.org/wiki/ARM_architecture_family#Advanced_SIMD_(NEON)[Neon^]，但这并不影响互操作性。例如，在带有 SSE2 的 x64 模式 Intel CPU 上使用 Visual Studio 的行为，与在不支持任何 SIMD 技术的 IBM s390x 上使用 GCC 的行为相同。 256/4130 · 413 Needs editing
36 :122
	English Concurrent Containers
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 并发容器 4/210 · 21 Needs editing
37 :124
	English The same data structure used by Boost.Unordered open-addressing containers has been chosen also as the foundation of `boost::concurrent_flat_set`/`boost::concurrent_node_set` and `boost::concurrent_flat_map`/`boost::concurrent_node_map`:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — Boost.Unordered 开放寻址容器所使用的相同数据结构也被选为 `boost::concurrent_flat_set`/`boost::concurrent_node_set` 和 `boost::concurrent_flat_map`/`boost::concurrent_node_map` 的基础： 159/2370 · 237 Needs editing
38 :128
	English Open-addressing is faster than closed-addressing alternatives, both in non-concurrent and
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 无论是在非并发环境还是并发环境下，开放寻址都比闭地址方案更快。 31/890 · 89 Needs editing
39 :129
	English concurrent scenarios.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 并发场景中也是如此。 10/210 · 21 Needs editing
40 :130
	English Open-addressing layouts are eminently suitable for concurrent access and modification
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 开放寻址的内存布局极其适合在最小化锁竞争的条件下进行并发访问与修改。 34/850 · 85 Needs editing
41 :131
	English with minimal locking. In particular, the metadata array can be used for implementations of lookup that are lock-free up to the last step of actual element comparison.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 通过最小化锁定。特别是，元数据数组可用于实现查找操作，该操作在实际元素比较的最后一步之前都是无锁的。 50/1660 · 166 Needs editing
42 :133
	English Layout compatibility with Boost.Unordered flat containers allows for
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 并发容器与 Boost.Unordered 扁平容器具有 28/680 · 68 Needs editing
43 :134
	English xref:concurrent.adoc#concurrent_interoperability_with_non_concurrent_containers[fast transfer] of all elements between a concurrent container and its non-concurrent counterpart, and vice versa.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 内存布局兼容性，支持其与非并发对应容器之间 xref:concurrent.adoc#concurrent_interoperability_with_non_concurrent_containers[快速双向传输] 所有元素。 115/1930 · 193 Needs editing
44 :138
	English Hash Function and Platform Interoperability
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 哈希函数与平台互操作性 11/430 · 43 Needs editing