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

11 :70
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In a similar manner to using `reserve` for ``vector``s, it can be a good idea to call `reserve` before inserting a large number of elements. This will get the expensive rehashing out of the way and let you store iterators, safe in the knowledge that they won't be invalidated. If you are inserting `n` elements into container `x`, you could first call: 352/10000 · 352
11 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — for unordered associative containers and feature one of the fastest implementations in the market within the technical constraints imposed by the required standard interface. 174/10000 · 174
11 :31
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Local iterators would be very inefficient and may not be able to 64/10000 · 64
11 :51
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — for(std::string::const_iterator it = x.begin(); it != x.end(); ++it) { boost::hash_combine(seed, std::toupper(*it, locale)); } 126/10000 · 126
11 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/running insertion.xlsx.practice.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice.png,window=_blank] 154/10000 · 154
11 :101
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — But, in general, visitation functions should be as lightweight as possible to reduce contention and increase parallelization. In some cases, moving heavy work outside of visitation may be beneficial: 199/10000 · 199
11 :75
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `stats` object provides the following information: 54/10000 · 54
11 :40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In open-addressing containers, buckets can hold at most one element; if a collision happens (like is the case of `D` in the example), the element uses some other available bucket in the vicinity of the original position. Given this simpler scenario, Boost.Unordered open-addressing containers offer a very limited API for accessing buckets. 340/10000 · 340
11 :47
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — This feature has been retained for backwards compatibility with previous versions of Boost.Unordered: users are encouraged to update their code to use `std::piecewise_construct` and ``std::tuple``s instead. 206/10000 · 206
11 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ auto const idx = get_bucket_idx(hash_function(key)); node* p = buckets[idx]; // first load node* n = p->next; // second load if (n && is_in_bucket(n, idx)) { value_type const& v = *n; // third load // ... } ``` 217/10000 · 217
11 :22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators are displayed similarly to their standard counterparts. An iterator is displayed as though it were the element that it points to. An end iterator is simply displayed as `{ end iterator }`. 198/10000 · 198
11 :13
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_multiset.adoc[Class Template +++<code style="color: inherit;">+++unordered_multiset+++</code>+++] 122/10000 · 122
11 :24
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added concurrent, node-based containers `boost::concurrent_node_map` and `boost::concurrent_node_set`. 102/10000 · 102
11 :287
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it). 136/10000 · 136
11 :246
	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
11 :244
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — *Template Parameters* 21/10000 · 21
11 :354
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
11 :336
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
11 :286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Key_ 5/10000 · 5
11 :254
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it). 136/10000 · 136