2. Boost Unordered Translation (zh_Hans)
3. English
4. Zen

23 :23
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/hash_traits.adoc[Hash Traits] 44/10000 · 44
23 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructors have optional extra parameters for the comparison object. 70/10000 · 70
23 :66
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Since release 1.79.0, https://en.wikipedia.org/wiki/Hash_function#Fibonacci_hashing[Fibonacci hashing] is used instead. With this implementation, the bucket number is determined by using `(h * m) >> (w - k)`, where `h` is the hash value, `m` is `2^w` divided by the golden ratio, `w` is the word size (32 or 64), and `2^k` is the number of buckets. This provides a good compromise between speed and distribution. 412/10000 · 412
23 :108
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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: 191/10000 · 191
:64 :64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|non-duplicate elements h|duplicate elements h|duplicate elements, + max load factor 5 87/10000 · 87
23 :219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Suppose you have an `std::array` of keys you want to look up for in a concurrent map: 85/10000 · 85
23 :66
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 1.6+|Return begin and end iterators for bucket `n`. 51/10000 · 51
23 :91
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There is currently no specification in the C++ standard for this or any other type of concurrent data structure. The APIs of `boost::concurrent_flat_set`/`boost::concurrent_node_set` and `boost::concurrent_flat_map`/`boost::concurrent_node_map` are modelled after `std::unordered_flat_set` and `std::unordered_flat_map`, respectively, with the crucial difference that iterators are not provided due to their inherent problems in concurrent scenarios (high contention, prone to deadlocking): so, Boost.Unordered concurrent containers are technically not models of https://en.cppreference.com/w/cpp/named_req/Container[Container^], although they meet all the requirements of https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] containers (including https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointer^] support) except those implying iterators. 906/10000 · 906
23 :91
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — - 0 if the corresponding bucket is empty. - 1 to encode a special empty bucket called a _sentinel_, which is used internally to stop iteration when the container has been fully traversed. - If the bucket is occupied, a _reduced hash value_ obtained from the hash value of the element. 284/10000 · 284
23 :50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```plaintext (gdb) source [/path/to/boost]/libs/unordered/extra/boost_unordered_printers.py ``` 95/10000 · 95
23 :25
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_node_set_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_node_set_fwd.hpp>+++</code>+++ Synopsis] 153/10000 · 153
23 :41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equipped open-addressing and concurrent containers to internally calculate and provide statistical metrics affected by the quality of the hash function. This functionality is enabled by the global macro `BOOST_UNORDERED_ENABLE_STATS`. 234/10000 · 234
23 :315
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to support loading of ``unordered_map``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84. 151/10000 · 151
:281 :281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A constant iterator whose value type is `value_type`. 53/10000 · 53
23 :273
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298
23 :384
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298
23 :367
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298
23 :314
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298
23 :282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to support loading of ``unordered_multimap``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84. 156/10000 · 156
23 :331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost. 298/10000 · 298