feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

documented boost::concurrent_flat_set

Browse Source
This commit is contained in:
joaquintides
2023-09-16 09:50:22 +02:00
parent 0673c5653c
commit 49f0929466
9 changed files with 1441 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/unordered/changes.adoc
+7 -6
View File
@@ -6,14 +6,15 @@
:github-pr-url: https://github.com/boostorg/unordered/pull
:cpp: C++
== Release 1.84.0
== Release 1.84.0 - Major update
* Added `[c]visit_while` operations to `boost::concurrent_map`,
* Added `boost::concurrent_flat_set`.
* Added `[c]visit_while` operations to concurrent containers,
with serial and parallel variants.
* Added efficient move construction of `boost::unordered_flat_map` from
`boost::concurrent_flat_map` and vice versa.
* Added debug mode mechanisms for detecting illegal reentrancies into
a `boost::concurrent_flat_map` from user code.
* Added efficient move construction of `boost::unordered_flat_(map|set)` from
`boost::concurrent_flat_(map|set)` and vice versa.
* Added debug-mode mechanisms for detecting illegal reentrancies into
a concurrent container from user code.
* Added Boost.Serialization support to all containers and their (non-local) iterator types.
* Added support for fancy pointers to open-addressing and concurrent containers.
This enables scenarios like the use of Boost.Interprocess allocators to construct containers in shared memory.