User avatar admin

Translation uploaded
There are two popular methods for choosing the number of buckets in a hash table. One is to have a prime number of buckets, another is to use a power of 2.
There are two popular methods for choosing the number of buckets in a hash table. One is to have a prime number of buckets, another is to use a power of 2.选择哈希表桶数量有两种主流方法：一种是采用质数作为桶的数量，另一种则是使用2的幂次方。
06/05/2026
User avatar admin

Translation uploaded
Number of Buckets
Number of Buckets桶数量
06/05/2026
User avatar admin

Translation uploaded
So closed addressing is used.
So closed addressing is used.因此采用闭寻址方式。
06/05/2026
User avatar admin

Translation uploaded
addressing, users will be surprised if the performance doesn't reflect that.
addressing, users will be surprised if the performance doesn't reflect that.若性能表现不符预期，将会引发用户的困惑。
06/05/2026
User avatar admin

Translation uploaded
And since the standard is written with a eye towards closed
And since the standard is written with a eye towards closed由于该标准的制定主要着眼于闭寻址方案，
06/05/2026
User avatar admin

Translation uploaded
open addressing degrades badly when there are a high number of collisions the restrictions could prevent a rehash when it's really needed. The maximum load factor could be set to a fairly low value to work around this - but the standard requires that it is initially set to 1.0.
open addressing degrades badly when there are a high number of collisions the restrictions could prevent a rehash when it's really needed. The maximum load factor could be set to a fairly low value to work around this - but the standard requires that it is initially set to开放寻址法在发生大量冲突时性能会急剧下降，这些限制可能会阻止必要的重新哈希操作。虽然可以通过设置较低的最大负载因子来规避此问题——但标准要求该值初始必须设为 1.0.。
06/05/2026
User avatar admin

Translation uploaded
There are also the restrictions on when iterators can be invalidated. Since
There are also the restrictions on when iterators can be invalidated. Since此外，标准对迭代器失效的时机也存在限制。由于
06/05/2026
User avatar admin

Translation uploaded
meet the complexity requirements.
meet the complexity requirements.满足复杂度要求。
06/05/2026
User avatar admin

Translation uploaded
Local iterators would be very inefficient and may not be able to
Local iterators would be very inefficient and may not be able to局部迭代器的实现将极为低效，且可能无法
06/05/2026
User avatar admin

Translation uploaded
the elements can't be stored in one array, but will need a layer of indirection instead - losing the efficiency and most of the memory gain, the main advantages of open addressing.
the elements can't be stored in one array, but will need a layer of indirection instead - losing the efficiency and most of the memory gain, the main advantages of open addressing.元素无法存储在一个连续的数组中，而需要增加一层间接寻址——这将损失开放定址法的主要优势，即效率和大部分内存收益。
06/05/2026
User avatar admin

Translation uploaded
The standard requires that pointers to elements aren't invalidated, so
The standard requires that pointers to elements aren't invalidated, so该标准要求指向元素的指针不得失效，因此
06/05/2026
User avatar admin

Translation uploaded
It would be conceivable to write a hash table that uses another method. For example, it could use open addressing, and use the lookup chain to act as a bucket but there are some serious problems with this:
It would be conceivable to write a hash table that uses another method. For example, it could use open addressing, and use the lookup chain to act as a bucket but there are some serious problems with this:理论上完全可以设计采用其他实现方式的哈希表。例如，采用开放寻址法，利用查找链来模拟桶的行为，但这种做法会带来一些严重问题：
06/05/2026
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

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

Search