Exit Zen
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
21
:86
English
image::foa-metadata.png[align=center]
37/370 · 37
21
:23
English
xref:reference/header_unordered_node_map.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_node_map.hpp>+++</code>+++ Synopsis]
153/1450 · 145
21
:264
English
The element nodes of the container are held into an internal _bucket array_. A 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.
80/2750 · 275
21
:310
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
85/1160 · 116
21
:322
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.
80/2720 · 272
21
:358
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.
74/2550 · 255
21
:256
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
94/1160 · 116
21
:270
English
Globally define this macro to support loading of ``unordered_multiset``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84.
86/1560 · 156
21
:307
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
86/1160 · 116
21
:311
English
Configuration macros
3/200 · 20
22
:22
English
xref:reference/unordered_multiset.adoc[`unordered_multiset`]
60/600 · 60
22
:105
English
boost::unordered_multiset<point, point_hash> points; ```
68/560 · 56
22
:89
English
Concurrent Containers
4/210 · 21
22
:100
English
Keys can be hashed using `hasher` which is accessed by member function `hash_function()`, and checked for equality using `key_equal` which is accessed by member function `key_eq()`. There is no function object for compared or hashing values.
95/2410 · 241
22
:40
English
Added container `pmr` aliases when header `<memory_resource>` is available. The alias `boost::unordered::pmr::[container]` refers to `boost::unordered::[container]` with a `std::pmr::polymorphic_allocator` allocator type.
180/2210 · 221