Exit Zen
15
:62
English
multithreaded scenarios. Their interface is radically different from that of regular C++ containers. Flat and node-based variants are provided.
48/1430 · 143
15
:60
English
The C++ standard does not currently provide any open-addressing container specification to adhere to, so `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` take inspiration from `std::unordered_set` and `std::unordered_map`, respectively, and depart from their interface where convenient or as dictated by their internal data structure, which is radically different from that imposed by the standard (closed addressing).
231/4710 · 471
15
:117
English
just the element found is checked).
12/350 · 35
15
:94
English
:idprefix: comparison_
22/220 · 22
15
:29
English
`boost::concurrent_flat_set` operations to allow for safe mutable modification of elements ({github-pr-url}/265[PR#265^]).
72/1220 · 122
15
:30
English
All containers and iterators have a custom GDB pretty-printer.
25/620 · 62
15
:152
English
Consult the references of `xref:reference/concurrent_node_set.adoc#concurrent_node_set[boost::concurrent_node_set]`, `xref:reference/concurrent_node_map.adoc#concurrent_node_map[boost::concurrent_node_map]`, `xref:reference/concurrent_flat_set.adoc#concurrent_flat_set[boost::concurrent_flat_set]` and `xref:reference/concurrent_flat_map.adoc#concurrent_flat_map[boost::concurrent_flat_map]` for the complete list of visitation-enabled operations.
421/4470 · 447
15
:292
English
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
60/1510 · 151
15
:38
English
image::benchmarks-set/gcc/running insertion.xlsx.practice norehash.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash.png,window=_blank]
172/1720 · 172
15
:38
English
And since the standard is written with a eye towards closed
19/590 · 59
15
:246
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
15
:54
English
2+^h| *Closed-addressing containers only* h|*Method* h|*Description*
29/680 · 68
15
:254
English
A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool.
67/2470 · 247
15
:361
English
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
38/1510 · 151
15
:60
English
Thus container-wide iteration is turned into traversing the non-empty bucket groups (an operation with constant time complexity) which reduces the time complexity back to `O(size())`. In total, a bucket group is only 4 words in size and it views `sizeof(std::size_t) * CHAR_BIT` buckets meaning that for all common implementations, there's only 4 bits of space overhead per bucket introduced by the bucket groups.
156/4130 · 413
15
:17
English
xref:reference/header_unordered_flat_map.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_flat_map.hpp>+++</code>+++ Synopsis]
153/1450 · 145
15
:247
English
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
69/1510 · 151
15
:300
English
_Hash_
6/100 · 6
15
:309
English
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
38/1510 · 151
15
:344
English
A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.
57/1510 · 151