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

12 :358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — into the table 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 table. 161/10000 · 161
12 :340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::pair<const Key, T>` must be https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the table 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 table. 283/10000 · 283
12 :286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container 108/10000 · 108
12 :254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Hash_ 6/10000 · 6
12 :61
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Provides statistics on insertion, successful and unsuccessful lookups performed by a container. If the supplied hash function has good quality, then: 149/10000 · 149
12 :303
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container 108/10000 · 108
12 :293
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
12 :242
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
12 :245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Pred_ 6/10000 · 6
12 :289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
13 :13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_map_fwd.adoc[`<boost/unordered/unordered_map_fwd.hpp>`] 87/10000 · 87
13 :80
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `reserve(n)` reserves space for at least `n` elements, allocating enough buckets 80/10000 · 80
13 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — (more than 2 times faster in typical scenarios) while slightly diverging from the standard interface to accommodate the implementation. There are two variants: **flat** (the fastest) and **node-based**, which provide pointer stability under rehashing at the expense of being slower. 282/10000 · 282
13 :33
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are also the restrictions on when iterators can be invalidated. Since 75/10000 · 75
13 :62
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Which you can then use in a case insensitive dictionary: ```cpp boost::unordered_map<std::string, int, ihash, iequal_to> idictionary; ``` 137/10000 · 137
13 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique 5.png,window=_blank] 180/10000 · 180
13 :128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note that in this last example the visitation function could actually _modify_ the element: as a general rule, operations on a concurrent map `m` will grant visitation functions const/non-const access to the element depending on whether `m` is const/non-const. Const access can be always be explicitly requested by using `cvisit` overloads (for instance, `insert_or_cvisit`) and may result in higher parallelization. For concurrent sets, on the other hand, visitation is always const access. 492/10000 · 492
13 :115
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Average probe lengths should be close to 1.0. 45/10000 · 45
13 :51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `size_type bucket_count() const` 32/10000 · 32
13 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When swapping, `Pred` and `Hash` are not currently swapped by calling `swap`, their copy constructors are used. As a consequence, when swapping an exception may be thrown from their copy constructor. 199/10000 · 199