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

13 :290
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 87/10000 · 87
13 :254
	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
13 :64
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Average probe lenghts should be close to 1.0. 45/10000 · 45
13 :307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 87/10000 · 87
13 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — into the container from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 169/10000 · 169
13 :242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container 108/10000 · 108
13 :245
	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
13 :293
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::pair<const Key, T>` must be https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container. 291/10000 · 291
14 :14
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_map_top.adoc[`<boost/unordered_map.hpp>`] 73/10000 · 73
14 :81
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — so as to not exceed the maximum load factor. + Because the maximum load factor is defined as the number of elements divided by the total number of available buckets, this function is logically equivalent to: + ``` x.rehash(std::ceil(n / x.max_load_factor())) ``` + See the xref:reference/unordered_map.adoc#unordered_map_rehash[reference for more details] on the `rehash` function. 381/10000 · 381
14 :61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Finally, **concurrent containers** are designed and implemented to be used in high-performance 94/10000 · 94
14 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 278/10000 · 278
14 :68
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This is a simplified version of the example at link:../../../examples/case_insensitive.hpp[/libs/unordered/examples/case_insensitive.hpp^] which supports other locales and string types. 185/10000 · 185
14 :30
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|non-duplicate elements h|duplicate elements h|duplicate elements, + max load factor 5 |=== 92/10000 · 92
14 :136
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Although expected to be used much less frequently, concurrent containers also provide insertion operations where an element can be visited right after element creation (in addition to the usual visitation when an equivalent element already exists): 248/10000 · 248
14 :116
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The average number of comparisons per successful lookup should be close to 1.0 (that is, 88/10000 · 88
14 :51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The number of buckets. 22/10000 · 22
14 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Open-addressing Containers 26/10000 · 26
14 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::fca.png[align=center] 28/10000 · 28
14 :28
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — GDB Pretty-Printers 19/10000 · 19