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

added tutorial on boost::concurrent_flat_map

Browse Source
This commit is contained in:
joaquintides
2023-05-08 18:37:36 +02:00
parent 02197674f4
commit ba25041fc8
3 changed files with 191 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doc/unordered/intro.adoc
+10
View File
@@ -216,3 +216,13 @@ for more details.
There are other differences, which are listed in the
<<comparison,Comparison with Associative Containers>> section.
== A concurrent hashmap
Starting in Boost 1.83, Boost.Unordered provides `boost::concurrent_flat_map`,
a thread-safe hash table for high performance multithreaded scenarios. Although
it shares the internal data structure and most of the algorithms with Boost.Unordered
open-addressing `boost::unordered_flat_map`, ``boost::concurrent_flat_map``'s API departs significantly
from that of C++ unordered associative containers to make this table suitable for
concurrent usage. Consult the xref:#concurrent_flat_map_intro[dedicated tutorial]
for more information.