User avatar admin

Translation uploaded
The rest of this section applies only to open-addressing and concurrent containers.
The rest of this section applies only to open-addressing and concurrent containers.本节剩余的内容仅适用于开放寻址容器与并发容器。
06/05/2026
User avatar admin

Translation uploaded
Closed-addressing containers in Boost.Unordered are fairly robust against hash functions with less-than-ideal quality, but open-addressing and concurrent containers are much more sensitive to this factor, and their performance can degrade dramatically if the hash function is not appropriate. In general, if you're using functions provided by or generated with link:../../../../container_hash/index.html[Boost.Hash^], the quality will be adequate, but you have to be careful when using alternative hash algorithms.
Closed-addressing containers in Boost.Unordered are fairly robust against hash functions with less-than-ideal quality, but open-addressing and concurrent containers are much more sensitive to this factor, and their performance can degrade dramatically if the hash function is not appropriate. In general, if you're using functions provided by or generated with link:../../../../container_hash/index.html[Boost.Hash^], the quality will be adequate, but you have to be careful when using alternative hash algorithms.Boost.Unordered 中的闭寻址容器对质量不理想的哈希函数具有较好的鲁棒性，但开放寻址和并发容器对此因素更为敏感。如果哈希函数选择不当，其性能会出现显著下降。通常，使用由 link:../../../../container_hash/index.html[Boost.Hash] 提供或生成的函数可确保质量达标，但在使用其他哈希算法时则需要特别谨慎。
06/05/2026
User avatar admin

Translation uploaded
In order to work properly, hash tables require that the supplied hash function be of __good quality__, roughly meaning that it uses its `std::size_t` output space as uniformly as possible, much like a random number generator would do —except, of course, that the value of a hash function is not random but strictly determined by its input argument.
In order to work properly, hash tables require that the supplied hash function be of __good quality__, roughly meaning that it uses its `std::size_t` output space as uniformly as possible, much like a random number generator would do —except, of course, that the value of a hash function is not random but strictly determined by its input argument.为了正常工作，哈希表要求提供的哈希函数具有__高质量__，这大致意味着它应尽可能均匀地使用其 `std::size++_++t` 输出空间，就像随机数生成器那样——当然，不同之处在于哈希函数的值并非随机，而是由其输入参数严格决定。
06/05/2026
User avatar admin

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

Translation uploaded
[#hash_quality] = Hash Quality
[#hash_quality] = Hash Quality哈希质量
06/05/2026
User avatar admin

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

Translation uploaded
Returns the container's key equality function..
Returns the container's key equality function..返回容器的键相等性函数。
06/05/2026
User avatar admin

Translation uploaded
`key_equal key_eq() const`
`key_equal key_eq() const`
06/05/2026
User avatar admin

Translation uploaded
Returns the container's hash function.
Returns the container's hash function.返回容器的哈希函数。
06/05/2026
User avatar admin

Translation uploaded
`hasher hash_function() const`
`hasher hash_function() const`
06/05/2026
User avatar admin

Translation uploaded
Description
Description描述
06/05/2026
User avatar admin

Translation uploaded
Method
Method方法
06/05/2026
User avatar admin

Translation uploaded
See the link:../../../../container_hash/index.html[Boost.Hash documentation^] for more detail on how to do this. Remember that it relies on extensions to the standard - so it won't work for other implementations of the unordered associative containers, you'll need to explicitly use Boost.Hash.
See the有关如何执行此操作的更多详细信息，请参阅 link:../../../../container_hash/index.html[Boost.Hash documentation^] for more detail on how to do this. Remember that it relies on extensions to the standard - so it won't work for other implementations of the unordered associative containers, you'll need to explicitly use文档^]。请记住，它依赖于标准扩展—因此它不适用于无序关联容器的其他实现，你需要显式使用 Boost.Hash.。
06/05/2026
User avatar admin

Translation uploaded
boost::unordered_multiset<point> points; ```
boost::unordered_multiset<point> points; ```</point>
06/05/2026
User avatar admin

Translation uploaded
std::size_t hash_value(point const& p) { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; }
std::size_t hash_value(point const&amp; p) { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; }
06/05/2026
User avatar admin

Translation uploaded
bool operator==(point const& p1, point const& p2) { return p1.x == p2.x && p1.y == p2.y; }
bool operator==(point const&amp; p1, point const&amp; p2) { return p1.x == p2.x &&amp;&amp; p1.y == p2.y; }
:117
06/05/2026
User avatar admin

Translation uploaded
```cpp struct point { int x; int y; };
```cpp struct point { int x; int y; };
:111
06/05/2026
User avatar admin

Translation uploaded
Since the default hash function is link:../../../../container_hash/index.html[Boost.Hash^], we can extend it to support the type so that the hash function doesn't need to be explicitly given:
Since the default hash function is由于默认哈希函数是 link:../../../../container_hash/index.html[Boost.Hash^], we can extend it to support the type so that the hash function doesn't need to be explicitly given:，我们可以扩展它以支持该类型，从而无需显式给出哈希函数：
06/05/2026
User avatar admin

Translation uploaded
boost::unordered_multiset<point, point_hash> points; ```
boost::unordered_multiset<point, point_hash=""> points; ```</point,>
06/05/2026
User avatar admin

Translation uploaded
struct point_hash { std::size_t operator()(point const& p) const { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; } };
struct point_hash { std::size_t operator()(point const&amp; p) const { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; } };
06/05/2026

Search