User avatar admin

Translation uploaded
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.
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.维基百科哈希表条目] 。
06/05/2026
User avatar admin

Translation uploaded
`boost::unordered_[multi]set` and `boost::unordered_[multi]map` adhere to the standard requirements for unordered associative containers, so the interface was fixed. But there are still some implementation decisions to make. The priorities are conformance to the standard and portability.
`boost::unordered_[multi]++_[++multi++]++set` and与 `boost::unordered_[multi]map` adhere to the standard requirements for unordered associative containers, so the interface was fixed. But there are still some implementation decisions to make. The priorities are conformance to the standard and portability.++_[++multi++]++map` 遵循无序关联容器的标准规范，因此其接口是确定的。但在实现层面仍需做出一些决策，其首要考量是标准符合性与跨平台移植性。
06/05/2026
User avatar admin

Translation uploaded
Closed-addressing Containers
Closed-addressing Containers闭寻址容器
06/05/2026
User avatar admin

Translation uploaded
= Implementation Rationale
= Implementation Rationale实现设计依据
06/05/2026
User avatar admin

Translation uploaded
:idprefix: rationale_
:idprefix: rationale_
06/05/2026
User avatar admin

File uploaded
Processed 17 strings from the uploaded files (skipped: 0, not found: 0, updated: 17).
File upload mode: Add as translation 06/05/2026
User avatar admin

Translation uploaded
Storing an object in an unordered associative container requires both a key equality function and a hash function. The default function objects in the standard containers support a few basic types including integer types, floating point types, pointer types, and the standard strings. Since Boost.Unordered uses link:../../../../container_hash/index.html[boost::hash^] it also supports some other types, including standard containers. To use any types not supported by these methods you have to extend Boost.Hash to support the type or use your own custom equality predicates and hash functions. See the xref:hash_equality.adoc#hash_equality[Equality Predicates and Hash Functions], section for more details.
Storing an object in an unordered associative container requires both a key equality function and a hash function. The default function objects in the standard containers support a few basic types including integer types, floating point types, pointer types, and the standard strings. Since在无序关联容器中存储对象需要同时提供键相等函数和哈希函数。标准容器中的默认函数对象支持若干基本类型，包括整数类型、浮点类型、指针类型以及标准字符串。由于 Boost.Unordered uses使用 link:../../../../container_hash/index.html[boost::hash^] it also supports some other types, including standard containers. To use any types not supported by these methods you have to extend Boost.Hash to support the type or use your own custom equality predicates and hash functions. See the xref:hash_equality.adoc#hash_equality[Equality Predicates and Hash Functions], section for more details.，它还支持其他一些类型，包括标准容器。要使用这些方法不支持的任意类型，用户必须扩展 Boost.Hash 以支持该类型，或者使用自定义的相等谓词和哈希函数。更多详情请参见 xref:hash_equality.adoc#hash_equality[相等谓词与哈希函数] 一节。
06/05/2026
User avatar admin

Translation uploaded
All sets and maps in Boost.Unordered are instantiatied similarly as `std::unordered_set` and `std::unordered_map`, respectively:
All sets and maps in Boost.Unordered are instantiatied similarly asBoost.Unordered 中的所有 set 和 map 分别与 `std::unordered_set` and和 `std::unordered_map`, respectively: 类似的方式进行实例化：
06/05/2026
User avatar admin

Translation uploaded
multithreaded scenarios. Their interface is radically different from that of regular C++ containers. Flat and node-based variants are provided.
multithreaded scenarios. Their interface is radically different from that of regular C++ containers. Flat and node-based variants are provided.其接口与常规C{plus}{plus}容器存在根本性差异。该系列同时提供扁平与基于节点两种变体。
06/05/2026
User avatar admin

Translation uploaded
Finally, **concurrent containers** are designed and implemented to be used in high-performance
Finally, **concurrent containers** are designed and implemented to be used in high-performance最后，**并发容器**专为高性能多线程场景设计与实现，
06/05/2026
User avatar admin

Translation uploaded
(more than 2 times faster in typical scenarios) while slightly diverging from the standard interface to accommodate the implementation. There are two variants: **flat** (the fastest) and **node-based**, which provide pointer stability under rehashing at the expense of being slower.
(more than 2 times faster in typical scenarios) while slightly diverging from the standard interface to accommodate the implementation. There are two variants: **flat** (the fastest) and **node-based**, which provide pointer stability under rehashing at the expense of being slower.（典型场景下性能提升2倍以上），同时为了适配实现方案而对标准接口做了细微调整。该类容器包含两种变体：*扁平式*（最快）与**基于节点式**，后者在重新哈希时能保持指针稳定性，但性能会有所下降。
06/05/2026
User avatar admin

Translation uploaded
**Open-addressing containers** rely on much faster data structures and algorithms
**Open-addressing containers** rely on much faster data structures and algorithms开放寻址容器**采用了更高效的数据结构与算法
06/05/2026
User avatar admin

Translation uploaded
for unordered associative containers and feature one of the fastest implementations in the market within the technical constraints imposed by the required standard interface.
for unordered associative containers and feature one of the fastest implementations in the market within the technical constraints imposed by the required standard interface.并在标准接口的技术约束范围内提供了业界领先的运行性能。
06/05/2026
User avatar admin

Translation uploaded
**Closed-addressing containers** are fully compliant with the C++ specification
**Closed-addressing containers** are fully compliant with the C++ specification闭寻址容器**完全符合C{plus}{plus}无序关联容器规范，
06/05/2026
User avatar admin

Translation uploaded
^.^h|*Concurrent* ^| `boost::concurrent_node_set` + `boost::concurrent_node_map` ^| `boost::concurrent_flat_set` + `boost::concurrent_flat_map`
^.^h|*Concurrent并发* ^| `boost::concurrent_node_set` + `boost::concurrent_node_map` ^| `boost::concurrent_flat_set` + `boost::concurrent_flat_map`
06/05/2026
User avatar admin

Translation uploaded
^.^h|*Open addressing* ^m| boost::unordered_node_set + boost::unordered_node_map ^m| boost::unordered_flat_set + boost::unordered_flat_map
^.^h|*Open addressing开放寻址法* ^m| boost::unordered_node_set + boost::unordered_node_map ^m| boost::unordered_flat_set + boost::unordered_flat_map
06/05/2026
User avatar admin

Translation uploaded
^.^h|*Closed addressing* ^m| boost::unordered_set + boost::unordered_map + boost::unordered_multiset + boost::unordered_multimap ^|
^.^h|*Closed addressing* ^m| boost::unordered_set + boost::unordered_map + boost::unordered_multiset + boost::unordered_multimap ^|
06/05/2026
User avatar admin

Translation uploaded
^h| ^h|*Node-based* ^h|*Flat*
^h| ^h|*Node-based基于节点* ^h|*Flat扁平*
06/05/2026
User avatar admin

Translation uploaded
Boost.Unordered offers a catalog of hash containers with different standards compliance levels, performances and intented usage scenarios:
Boost.Unordered offers a catalog of hash containers with different standards compliance levels, performances and intented usage scenarios:提供了一系列哈希容器，它们在标准符合性、性能表现和设计应用场景上各有不同：
06/05/2026
User avatar admin

Translation uploaded
{cpp} introduced __unordered associative containers__ `std::unordered_set`, `std::unordered_map`, `std::unordered_multiset` and `std::unordered_multimap` in {cpp}11, but research on hash tables hasn't stopped since: advances in CPU architectures such as more powerful caches, link:https://en.wikipedia.org/wiki/Single_instruction,_multiple_data[SIMD] operations and increasingly available link:https://en.wikipedia.org/wiki/Multi-core_processor[multicore processors] open up possibilities for improved hash-based data structures and new use cases that are simply beyond reach of unordered associative containers as specified in 2011.
{cpp} introduced __unordered associative containersC{plus}{plus}11 标准引入了__无序关联容器__ `std::unordered_++_++set`, 、 `std::unordered_++_++map`, 、 `std::unordered_++_++multiset` and和 `std::unordered_++_++multimap` in {cpp}11, but research on hash tables hasn't stopped since: advances in CPU architectures such as more powerful caches, link:，但针对哈希表的研究并未止步：CPU架构的进步（如更强大的缓存、 https://en.wikipedia.org/wiki/Single_instruction,_multiple_data[SIMD] operations and increasingly available link:指令集以及日益普及的 https://en.wikipedia.org/wiki/Multi-core_processor[multicore processors] open up possibilities for improved hash-based data structures and new use cases that are simply beyond reach of unordered associative containers as specified in 2011.多核处理器]）为改进基于哈希的数据结构创造了新的可能，这些新应用场景已远超 2011 年标准所定义的无序关联容器的能力范围。
06/05/2026

Search