Exit Zen
11
:24
English
Added concurrent, node-based containers `boost::concurrent_node_map` and `boost::concurrent_node_set`.
73/1020 · 102
12
:25
English
Added `insert_and_visit(x, f1, f2)` and similar operations to concurrent containers, which
48/900 · 90
13
:26
English
allow for visitation of an element right after insertion (by contrast, `insert_or_visit(x, f)` only visits the element if insertion did _not_ take place).
58/1540 · 154
14
:28
English
Made visitation exclusive-locked within certain
46/470 · 47
15
:29
English
`boost::concurrent_flat_set` operations to allow for safe mutable modification of elements ({github-pr-url}/265[PR#265^]).
72/1220 · 122
16
:31
English
In Visual Studio Natvis, supported any container with an allocator that uses fancy pointers. This applies to any fancy pointer type, as long as the proper Natvis customization point "Intrinsic" functions are written for the fancy pointer type.
98/2430 · 243
17
:32
English
Added GDB pretty-printers for all containers and iterators. For a container with an allocator that uses fancy pointers, these only work if the proper pretty-printer is written for the fancy pointer type itself.
63/2100 · 210
18
:33
English
Fixed `std::initializer_list` assignment issues for open-addressing containers
40/780 · 78
19
:34
English
({github-pr-url}/277[PR#277^]).
57/310 · 31
20
:35
English
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.
125/2380 · 238
21
:38
English
Release 1.86.0
9/140 · 14
22
:40
English
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.
180/2210 · 221
23
:41
English
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`.
82/2340 · 234
24
:42
English
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.
158/2700 · 270
25
:43
English
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.
111/2970 · 297
26
:45
English
Release 1.85.0
9/140 · 14
27
:47
English
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.
97/1980 · 198
28
:48
English
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`.
108/2640 · 264
29
:49
English
Fixed support for allocators with `explicit` copy constructors ({github-pr-url}/234[PR#234^]).
86/940 · 94
30
:50
English
Fixed bug in the `const` version of `unordered_multimap::find(k, hash, eq)` ({github-pr-url}/238[PR#238^]).
116/1070 · 107