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

15 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`. 151/10000 · 151
15 :254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool. 247/10000 · 247
15 :66
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — For unsuccessful lookups, the average number of element comparisons should be close to 0.0. 91/10000 · 91
15 :309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`. 151/10000 · 151
15 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
15 :248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
15 :245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
15 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
16 :16
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_map.adoc[`unordered_map`] 50/10000 · 50
16 :96
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Comparison with Associative Containers 38/10000 · 38
16 :65
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — All sets and maps in Boost.Unordered are instantiatied similarly as `std::unordered_set` and `std::unordered_map`, respectively: 128/10000 · 128
16 :39
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — addressing, users will be surprised if the performance doesn't reflect that. 76/10000 · 76
16 :72
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — predicates, especially if you're using a function pointer. If you compare two containers with different equality predicates then the result is undefined. For most stateless function objects this is impossible - since you can only compare objects with the same equality predicate you know the equality predicates must be equal. But if you're using function pointers or a stateful equality predicate (e.g. `boost::function`) then you can get into trouble. 453/10000 · 453
16 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png,window=_blank] 194/10000 · 194
16 :159
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Whole-Table Visitation 22/10000 · 22
16 :118
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The average number of comparisons per unsuccessful lookup should be close to 0.0. 81/10000 · 81
16 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `size_type max_bucket_count() const` 36/10000 · 36
16 :67
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Open-addressing containers provided by Boost.Unordered only work with reasonably compliant C++11 (or later) compilers. Language-level features such as move semantics and variadic template parameters are then not emulated. The containers are fully https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^]. 430/10000 · 430
16 :62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A more detailed description of Boost.Unordered's closed-addressing implementation is given in an https://bannalia.blogspot.com/2022/06/advancing-state-of-art-for.html[external article]. For more information on implementation rationale, read the xref:rationale.adoc#rationale_closed_addressing_containers[corresponding section]. 327/10000 · 327
:32 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Using in your project 21/10000 · 21