2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Changes (adoc)
4. English
5. Zen

19 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ({github-pr-url}/277[PR#277^]). 31/10000 · 31
20 :35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allowed non-copyable callables to be passed to the `std::initializer_list` overloads of `insert_{and|or}_[c]visit` for concurrent containers, by internally passing a `std::reference_wrapper` of the callable to the iterator-pair overloads. 238/10000 · 238
21 :38
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.86.0 14/10000 · 14
22 :40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added container `pmr` aliases when header `<memory_resource>` is available. The alias `boost::unordered::pmr::[container]` refers to `boost::unordered::[container]` with a `std::pmr::polymorphic_allocator` allocator type. 221/10000 · 221
23 :41
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equipped open-addressing and concurrent containers to internally calculate and provide statistical metrics affected by the quality of the hash function. This functionality is enabled by the global macro `BOOST_UNORDERED_ENABLE_STATS`. 234/10000 · 234
24 :42
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Avalanching hash functions must now be marked via an `is_avalanching` typedef with an embedded `value` constant set to `true` (typically, defining `is_avalanching` as `std::true_type`). `using is_avalanching = void` is deprecated but allowed for backwards compatibility. 270/10000 · 270
25 :43
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added Visual Studio Natvis framework custom visualizations for containers and iterators. This works for all containers with an allocator using raw pointers. In this release, containers and iterators are not supported if their allocator uses fancy pointers. This may be addressed in later releases. 297/10000 · 297
26 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.85.0 14/10000 · 14
27 :47
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Optimized `emplace()` for a `value_type` or `init_type` (if applicable) argument to bypass creating an intermediate object. The argument is already the same type as the would-be intermediate object. 198/10000 · 198
28 :48
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Optimized `emplace()` for `k,v` arguments on map containers to delay constructing the object until it is certain that an element should be inserted. This optimization happens when the map's `key_type` is move constructible or when the `k` argument is a `key_type`. 264/10000 · 264
29 :49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fixed support for allocators with `explicit` copy constructors ({github-pr-url}/234[PR#234^]). 94/10000 · 94
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
31 :52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.84.0 - Major update 29/10000 · 29
32 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added `boost::concurrent_flat_set`. 35/10000 · 35
33 :55
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added `[c]visit_while` operations to concurrent containers, 59/10000 · 59
34 :56
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — with serial and parallel variants. 34/10000 · 34
35 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added efficient move construction of `boost::unordered_flat_(map|set)` from 75/10000 · 75
36 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::concurrent_flat_(map|set)` and vice versa. 50/10000 · 50
37 :59
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added bulk visitation to concurrent containers for increased lookup performance. 80/10000 · 80
38 :60
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added debug-mode mechanisms for detecting illegal reentrancies into 67/10000 · 67