User avatar admin

Translation uploaded
By specifying an interface for accessing the buckets of the container the standard pretty much requires that the hash table uses closed addressing.
By specifying an interface for accessing the buckets of the container the standard pretty much requires that the hash table uses closed addressing.通过制定用于访问容器桶的接口，该标准实质上要求哈希表必须采用闭寻址方案。
06/05/2026
User avatar admin

Translation uploaded
Data Structure
Data Structure数据结构
06/05/2026
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

Resource updated
File “doc/modules/ROOT/pages/rationale_zh_Hans.adoc” was added. 06/05/2026
User avatar admin

String added in the repository
Concurrent containers make the same decisions and provide the same guarantees as Boost.Unordered open-addressing containers with regards to xref:#rationale_hash_function[hash function defaults] and xref:#rationale_platform_interoperability[platform interoperability].
Concurrent containers make the same decisions and provide the same guarantees as Boost.Unordered open-addressing containers with regards to xref:#rationale_hash_function[hash function defaults] and xref:#rationale_platform_interoperability[platform interoperability].
06/05/2026
User avatar admin

String added in the repository
Hash Function and Platform Interoperability
Hash Function and Platform Interoperability
06/05/2026
User avatar admin

String added in the repository
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.
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.
06/05/2026
User avatar admin

String added in the repository
Layout compatibility with Boost.Unordered flat containers allows for
Layout compatibility with Boost.Unordered flat containers allows for
06/05/2026
User avatar admin

String added in the repository
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.
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.
06/05/2026
User avatar admin

String added in the repository
Open-addressing layouts are eminently suitable for concurrent access and modification
Open-addressing layouts are eminently suitable for concurrent access and modification
06/05/2026
User avatar admin

String added in the repository
concurrent scenarios.
concurrent scenarios.
06/05/2026
User avatar admin

String added in the repository
Open-addressing is faster than closed-addressing alternatives, both in non-concurrent and
Open-addressing is faster than closed-addressing alternatives, both in non-concurrent and
06/05/2026
User avatar admin

String added in the repository
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`:
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`:
06/05/2026
User avatar admin

String added in the repository
Concurrent Containers
Concurrent Containers
06/05/2026
User avatar admin

String added in the repository
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.
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.
06/05/2026
User avatar admin

String added in the repository
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 —this includes elements being ordered in exactly the same way for the same sequence of operations.
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 —this includes elements being ordered in exactly the same way for the same sequence of operations.
06/05/2026

Search