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

4 :8
	English The performance of `boost::unordered_flat_set` is much better than that of `boost::unordered_set` or other implementations of `std::unordered_set`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_set` are held directly in the bucket array, and insertions into an already occupied bucket are diverted to available buckets in the vicinity of the original position. This type of data layout is known as _open addressing_.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `boost::unordered_flat_set` 的性能远优于 `boost::unordered_set` 或 `std::unordered_set` 的其他实现。与基于节点的标准无序关联容器不同，`boost::unordered_flat_set` 的元素直接保存在桶数组中，当插入位置已被占用时，会转移到原始位置附近可用的桶中。这种数据布局称为**开放定址**。 189/4830 · 483 Needs editing
4 :8
	English Synopsis
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 概要 2/100 · 8 Needs editing
4 :8
	English The performance of `boost::unordered_flat_map` is much better than that of `boost::unordered_map` or other implementations of `std::unordered_map`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_map` are held directly in the bucket array, and insertions into an already occupied bucket are diverted to available buckets in the vicinity of the original position. This type of data layout is known as _open addressing_.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `boost::unordered++_++flat++_++map` 的性能远优于 `boost::unordered++_++map` 或其他 `std::unordered++_++map` 的实现。与基于节点的标准无序关联容器不同， `boost::unordered++_++flat++_++map` 的元素直接存储在桶数组中，且当元素被插入到已被占用的桶时，会将其重定向到原始位置附近的可用桶。这种数据布局类型称为__开放寻址法__。 224/4830 · 483 Needs editing
4 :8
	English Synopsis
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 概要 2/100 · 8 Needs editing
4 :9
	English Synopsis
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 概要 2/100 · 8 Needs editing
5 :5
	English xref:concurrent.adoc[]
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — xref:concurrent.adoc[] 22/220 · 22 Needs editing
5 :21
	English The hash function comes first as you might want to change the hash function but not the equality predicate. For example, if you wanted to use the https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a hash^] you could write:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 哈希函数放在首位，因为你可能只想更改哈希函数而不想更改相等谓词。例如，如果你想使用 https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a 哈希^]，可以这样写： 147/2630 · 263 Needs editing
5 :21
	English Boost.Unordered offers a catalog of hash containers with different standards compliance levels, performances and intented usage scenarios:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — Boost.Unordered 提供了一系列哈希容器，它们在标准符合性、性能表现和设计应用场景上各有不同： 53/1380 · 138 Needs editing
5 :10
	English `boost::unordered_[multi]set` and `boost::unordered_[multi]map` provide a conformant implementation for {cpp}11 (or later) compilers of the latest standard revision of {cpp} unordered associative containers, with very minor deviations as noted. The containers are fully https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^].
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `boost::unordered_[multi]set` 和 `boost::unordered_[multi]map` 为支持 {cpp}11 或更高版本的编译器提供了符合最新标准修订版中 {cpp} 无序关联容器规范的实现，仅有极少量的已知偏差。这些容器完全遵循 https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[分配器感知^] ，并支持 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[花式指针^]。 292/4530 · 453 Needs editing
5 :20
	English The rest of this section applies only to open-addressing and concurrent containers.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 本节剩余的内容仅适用于开放寻址容器与并发容器。 23/830 · 83 Needs editing
5 :32
	English But since the elements aren't ordered, the output of:
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 但由于元素不按顺序存储，以下代码的输出结果： 22/530 · 53 Needs editing
5 :12
	English `boost::hash_is_avalanching` in `<boost/container_hash/hash_is_avalanching.hpp>`. Use that header directly instead. `<boost/unordered/hash_traits.hpp>` will be removed in the future.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 在 <boost container_hash="" hash_is_avalanching.hpp=""> 中对 boost::hash_is_avalanching 的使用声明。请直接使用该头文件代替。<boost unordered="" hash_traits.hpp=""> 将在未来被移除。</boost></boost> 167/1820 · 182 Needs editing
:10 :10
	English Using in your project
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 在项目中使用 6/210 · 21 Needs editing
5 :10
	English Copyright (C) 2005-2008 Daniel James
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 版权所有 © 2005-2008 丹尼尔·詹姆斯(Daniel James) 38/360 · 36 Needs editing
5 :9
	English _Wikipedia_. https://en.wikipedia.org/wiki/Hash_table[Hash table^]. +
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — __维基百科__中的 https://en.wikipedia.org/wiki/Hash_table[哈希表^] 。 + 61/690 · 69 Needs editing
5 :45
	English Visitation-based API
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 基于访问的 API 9/200 · 20 Needs editing
5 :10
	English Even though it acts as a container, `boost::concurrent_flat_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_flat_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 尽管 `boost::concurrent++_++flat++_++set` 具备容器特性，但它并不符合 C{plus}{plus}标准中的 https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念。具体而言，该容器未提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素访问通过用户提供的__访问函数__实现，这些函数被传递至 `concurrent++_++flat++_++set` 操作中，并在其内部以受控方式执行。这种基于访问机制的 API 设计能够有效支持低争用的并发应用场景。 285/5230 · 523 Needs editing
5 :10
	English The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 插入基准测试会插入 `n` 个随机值，其中 `n` 的范围在10,000至300万之间。在重复值测试场景中，同一组随机值会平均重复插入 5 次。 72/1830 · 183 Needs editing
5 :15
	English The http://en.wikipedia.org/wiki/Hash_table[Wikipedia article on hash tables^] has a good summary of the implementation issues for hash tables in general.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 关于哈希表的通用实现问题的详细综述，可参阅 http://en.wikipedia.org/wiki/Hash_table[维基百科哈希表条目] 。 74/1540 · 154 Needs editing
:239 :239
	English ---
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — --- 3/100 · 3 Needs editing