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

30 :82
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As more elements are added to an unordered associative container, the number of collisions will increase causing performance to degrade. To combat this the containers increase the bucket count as elements are inserted. You can also tell the container to change the bucket count (if required) by calling `rehash`. 312/10000 · 312
30 :136
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — of which there are parallelized versions in C++17 compilers with parallel algorithm support. In general, the interface of concurrent containers is derived from that of their non-concurrent counterparts by a fairly straightforward process of replacing iterators with visitation where applicable. If for regular maps `iterator` and `const_iterator` provide mutable and const access to elements, respectively, here visitation is granted mutable or const access depending on the constness of the member function used (there are also `*cvisit` overloads for explicit const visitation); In the case of `boost::concurrent_flat_set`, visitation is always const. 653/10000 · 653
30 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrent Containers 21/10000 · 21
30 :79
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```plaintext (gdb) print example_flat_map.get_stats() $1 = [stats] = {[insertion] = {[count] = 5, [probe_length] = {avg = 1.0, var = 0.0, dev = 0.0}}, [successful_lookup] = {[count] = 0, [probe_length] = {avg = 0.0, var = 0.0, dev = 0.0}, [num_comparisons] = {avg = 0.0, var = 0.0, dev = 0.0}}, [unsuccessful_lookup] = {[count] = 5, [probe_length] = {avg = 1.0, var = 0.0, dev = 0.0}, [num_comparisons] = {avg = 0.0, var = 0.0, dev = 0.0}}} ``` 444/10000 · 444
30 :32
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_concurrent_flat_set.adoc[+++<code style="color: inherit;">+++<boost/unordered/concurrent_flat_set.hpp>+++</code>+++ Synopsis] 147/10000 · 147
30 :50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fixed bug in the `const` version of `unordered_multimap::find(k, hash, eq)` ({github-pr-url}/238[PR#238^]). 107/10000 · 107
:340 :340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
30 :305
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iterator with the same value type, difference type and pointer and reference type as iterator. 97/10000 · 97
:295 :295
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A constant iterator whose value type is `value_type`. 53/10000 · 53
30 :400
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
30 :383
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
30 :330
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
:307 :307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
30 :347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
30 :338
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
30 :284
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
30 :304
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iterator with the same value type, difference type and pointer and reference type as iterator. 97/10000 · 97
30 :335
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
31 :31
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_node_map_fwd.adoc[`<boost/unordered/unordered_node_map_fwd.hpp>`] 97/10000 · 97
31 :120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket. 235/10000 · 235