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
User avatar admin

Translation uploaded
link:https://en.wikipedia.org/wiki/Hash_table[Hash tables^] are extremely popular computer data structures and can be found under one form or another in virtually any programming language. Whereas other associative structures such as rb-trees (used in {cpp} by `std::set` and `std::map`) have logarithmic-time complexity for insertion and lookup, hash tables, if configured properly, perform these operations in constant time on average, and are generally much faster.
link:https://en.wikipedia.org/wiki/Hash_table[Hash tables^] are extremely popular computer data structures and can be found under one form or another in virtually any programming language. Whereas other associative structures such as rb-trees (used in {cpp} by哈希表] 是一种极其流行的计算机数据结构，几乎在所有编程语言中都能找到其不同形式的存在。红黑树（在 C{plus}{plus} 中被 `std::set` and和 `std::map`) have logarithmic-time complexity for insertion and lookup, hash tables, if configured properly, perform these operations in constant time on average, and are generally much faster. 使用）等其他关联结构在插入和查找操作上具有对数时间复杂度，但哈希表若配置得当，这些操作的平均时间复杂度可达到常数级别，并且通常速度更快。
06/05/2026
User avatar admin

Translation uploaded
:idprefix: intro_ :cpp: C++
:idprefix: intro_ :cpp: C++
06/05/2026
User avatar admin

Translation uploaded
= Introduction
= Introduction引言
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
An link:../../../benchmark/string_stats.cpp[example^] is provided that displays container statistics for `boost::hash<std::string>`, an implementation of the https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a hash^] and two ill-behaved custom hash functions that have been incorrectly marked as avalanching:
An link:提供了一个链接：../../../benchmark/string_stats.cpp[example^] is provided that displays container statistics for `boost::hash<std::string>`, an implementation of the https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a hash^] and two ill-behaved custom hash functions that have been incorrectly marked as avalanching:示例^]，用于展示 `boost::hash<std::string>`、https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a 哈希^] 以及两种行为不当但被错误标记为具有雪崩效应的自定义哈希函数的容器统计信息。</std::string>
06/05/2026
User avatar admin

Translation uploaded
The average number of comparisons per unsuccessful lookup should be close to 0.0.
The average number of comparisons per unsuccessful lookup should be close to每次失败查找的平均比较次数应接近 0.0.。
06/05/2026
User avatar admin

Translation uploaded
just the element found is checked).
just the element found is checked).仅检查找到的那个元素）。
06/05/2026
User avatar admin

Translation uploaded
The average number of comparisons per successful lookup should be close to 1.0 (that is,
The average number of comparisons per successful lookup should be close to 1.0 (that is,每次成功查找的平均比较次数应接近 1.0（即，
06/05/2026
User avatar admin

Translation uploaded
Average probe lengths should be close to 1.0.
Average probe lengths should be close to 1.0.平均探测长度应接近1.0。
06/05/2026
User avatar admin

Translation uploaded
Statistics for three internal operations are maintained: insertions (without considering the previous lookup to determine that the key is not present yet), successful lookups, and unsuccessful lookups (including those issued internally when inserting elements). _Probe length_ is the number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed per operation. If the hash function behaves properly:
Statistics for three internal operations are maintained: insertions (without considering the previous lookup to determine that the key is not present yet), successful lookups, and unsuccessful lookups (including those issued internally when inserting elements). _Probe length_ is the number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed per operation. If the hash function behaves properly:系统维护三类内部操作的统计信息：插入操作（不考虑先前查找键是否存在的操作）、成功查找及未命中查找（包括插入元素时触发的内部查询）。__探测长度__是指每次操作所访问的 xref:structures.adoc#structures_open_addressing_containers[桶组] 数量。若哈希函数表现正常：
06/05/2026
User avatar admin

Translation uploaded
The `stats` object provides the following information:
The `stats` object provides the following information:对象提供以下统计信息：
06/05/2026

Search