Exit Zen
39
:311
English
```c++ unordered_flat_set(); ```
32/320 · 32
39
:332
English
Default Constructor
6/190 · 19
39
:362
English
```c++ unordered_flat_map(); ```
32/320 · 32
:374
:374
English
---
3/100 · 3
40
:40
English
xref:reference/header_concurrent_flat_set_fwd.adoc[`<boost/unordered/concurrent_flat_set_fwd.hpp>`]
113/990 · 99
40
:130
English
**Closed-addressing containers:** Local iterators can be used to iterate through individual buckets. (The order of local iterators and iterators aren't required to have any correspondence.)
45/1890 · 189
40
:62
English
Added Boost.Serialization support to all containers and their (non-local) iterator types.
43/890 · 89
40
:352
English
** Within a container function accepting two visitation functions, always for the first function. ** Within a non-const container function whose name does not contain `cvisit`, for the last (or only) visitation function.
87/2200 · 220
40
:120
English
image::benchmarks-set/clang_libcpp/running insertion.xlsx.practice non-unique.png[width=250, window=_blank,link=_images/benchmarks-set/clang_libcpp/running insertion.xlsx.practice non-unique.png]
195/1950 · 195
40
:130
English
Open-addressing layouts are eminently suitable for concurrent access and modification
34/850 · 85
:352
:352
English
---
3/100 · 3
40
:114
English
Construct an empty container with at least `n` buckets and insert elements from the range `[i, j)` (`X` is the container type).
53/1270 · 127
40
:342
English
Constructors
4/120 · 12
40
:422
English
** Within a container function accepting two visitation functions, always for the first function. ** Within a non-const container function whose name does not contain `cvisit`, for the last (or only) visitation function.
87/2200 · 220
40
:160
English
The value of the insertion counter for the initial group in the probe
12/690 · 69
40
:342
English
with `Iterator` = `iterator` and `NodeType` = `node_type`.
56/580 · 58
40
:379
English
A specialization of an internal class template:
9/470 · 47
40
:369
English
** Within a container function accepting two visitation functions, always for the first function. ** Within a non-const container function whose name does not contain `cvisit`, for the last (or only) visitation function.
87/2200 · 220
40
:405
English
** Within a container function accepting two visitation functions, always for the first function. ** Within a non-const container function whose name does not contain `cvisit`, for the last (or only) visitation function.
87/2200 · 220
40
:315
English
Constructs an empty container using `hasher()` as the hash function, `key_equal()` as the key equality predicate and `allocator_type()` as the allocator.
78/1530 · 153