Exit Zen
20
:317
English
`std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type*` and `const value_type*`, respectively.
168/1780 · 178
20
:354
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
84/1160 · 116
20
:248
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
20
:268
English
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
55/550 · 55
20
:297
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
20
:309
English
The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.
41/1090 · 109
21
:21
English
xref:reference/unordered_set.adoc[`unordered_set`]
50/500 · 50
21
:94
English
struct point_hash { std::size_t operator()(point const& p) const { std::size_t seed = 0; boost::hash_combine(seed, p.x); boost::hash_combine(seed, p.y); return seed; } };
174/1700 · 170
21
:85
English
** `value_type` must be move-constructible. ** Pointer stability is not kept under rehashing. ** There is no API for node extraction/insertion.
71/1430 · 143
21
:100
English
Keys can be compared using `key_compare` which is accessed by member function `key_comp()`, values can be compared using `value_compare` which is accessed by member function `value_comp()`.
72/1890 · 189
21
:38
English
Release 1.86.0
9/140 · 14
21
:46
English
You can choose to compile your binary _without_ embedding the pretty-printers by defining `BOOST_ALL_NO_EMBEDDED_GDB_SCRIPTS`, which disables the embedded GDB pretty-printers for all Boost libraries that have this feature.
126/2220 · 222
21
:211
English
`visit_while` and `erase_if` can also be parallelized. Note that, in order to increase efficiency, whole-table visitation operations do not block the table during execution: this implies that elements may be inserted, modified or erased by other threads during visitation. It is advisable not to assume too much about the exact global state of a concurrent container at any point in your program.
144/3960 · 396
21
:305
English
The elements of the table are held into an internal _bucket array_. An element is inserted into a bucket determined by its hash code, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.
64/2550 · 255
21
:58
English
image::benchmarks-set/gcc/scattered erasure.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure.xlsx.practice non-unique.png,window=_blank]
176/1760 · 176
21
:54
English
Using a power of 2 allows for much quicker selection of the bucket to use, but at the expense of losing the upper bits of the hash value. For some specially designed hash functions it is possible to do this and still get a good result but as the containers can take arbitrary hash functions this can't be relied on.
84/3150 · 315
21
:271
English
Globally define this macro to support loading of ``unordered_set``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84.
81/1510 · 151
21
:57
English
Returns the index of the bucket which would contain `k`.
17/560 · 56
21
:278
English
Configuration macros
3/200 · 20
21
:375
English
The element nodes of the table are held into an internal _bucket array_. An node is inserted into a bucket determined by the hash code of its element, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.
77/2720 · 272