Exit Zen
35
:101
English
image::benchmarks-set/gcc/scattered unsuccessful looukp.xlsx.practice non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/gcc/scattered unsuccessful looukp.xlsx.practice non-unique 5.png]
204/2040 · 204
35
:117
English
Although the implementation internally uses SIMD technologies, such as https://en.wikipedia.org/wiki/SSE2[SSE2^] and https://en.wikipedia.org/wiki/ARM_architecture_family#Advanced_SIMD_(NEON)[Neon^], when available, this does not affect interoperatility. For instance, the behavior is the same for Visual Studio on an x64-mode Intel CPU with SSE2 and for GCC on an IBM s390x without any supported SIMD technology.
256/4130 · 413
:320
:320
English
---
3/100 · 3
35
:100
English
`max_load_factor` doesn't let you set the maximum load factor yourself, it just lets you give a _hint_. And even then, the standard doesn't actually require the container to pay much attention to this value. The only time the load factor is _required_ to be less than the maximum is following a call to `rehash`. But most implementations will try to keep the number of elements below the max load factor, and set the maximum load factor to be the same as or close to the hint - unless your hint is unreasonably small or large.
179/5260 · 526
35
:327
English
A constant iterator with the same value type, difference type and pointer and reference type as const_iterator.
48/1110 · 111
35
:413
English
An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued.
53/1260 · 126
35
:145
English
to the container. Typically, such access is in read mode (that is, concurrent) even for modifying operations, so for most practical purposes there is no thread contention at this level. Access is only in write mode (blocking) when rehashing or performing container-wide operations such as swapping or assignment.
96/3120 · 312
35
:37
English
xref:reference/header_concurrent_node_set_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/concurrent_node_set_fwd.hpp>+++</code>+++ Synopsis]
163/1550 · 155
:310
:310
English
The iterator category is at least a forward iterator.
14/530 · 53
35
:358
English
A constant iterator whose value type is `value_type`.
28/530 · 53
35
:360
English
An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued.
53/1260 · 126
35
:396
English
An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued.
49/1260 · 126
:304
:304
English
A constant iterator whose value type is `value_type`.
27/530 · 53
:319
:319
English
---
3/100 · 3
35
:355
English
A constant iterator whose value type is `value_type`.
32/530 · 53
35
:360
English
A constant iterator with the same value type, difference type and pointer and reference type as const_iterator.
47/1110 · 111
36
:36
English
xref:reference/unordered_node_set.adoc[`unordered_node_set`]
60/600 · 60
36
:127
English
**Node-based containers:** Pointers and references to the container's elements are never invalidated. + **Flat containers:** Pointers and references to the container's elements are invalidated when rehashing occurs.
58/2150 · 215
36
:58
English
`boost::concurrent_flat_(map|set)` and vice versa.
76/500 · 50
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