Exit Zen
31
:280
English
As open-addressing and concurrent containers are based on the same internal data structure, they can be efficiently move-constructed from their non-concurrent counterpart, and vice versa.
57/1870 · 187
32
:286
English
^|`boost::concurrent_node_set` ^|`boost::unordered_node_set`
60/600 · 60
33
:289
English
^|`boost::concurrent_node_map` ^|`boost::unordered_node_map`
60/600 · 60
34
:292
English
^|`boost::concurrent_flat_set` ^|`boost::unordered_flat_set`
60/600 · 60
35
:295
English
^|`boost::concurrent_flat_map` ^|`boost::unordered_flat_map`
60/600 · 60
36
:300
English
This interoperability comes handy in multistage scenarios where parts of the data processing happen in parallel whereas other steps are non-concurrent (or non-modifying). In the following example, we want to construct a histogram from a huge input vector of words: the population phase can be done in parallel with `boost::concurrent_flat_map` and results then transferred to the final container.
138/3960 · 396
The translation has come to an end.