Exit Zen
19
:307
English
The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.
26/1000 · 100
20
:20
English
xref:reference/header_unordered_set.adoc[`<boost/unordered/unordered_set.hpp>`]
93/790 · 79
:89
:89
English
bool operator==(point const& p1, point const& p2) { return p1.x == p2.x && p1.y == p2.y; }
106/900 · 90
20
:84
English
Flat containers (`boost::unordered_flat_set` and `boost::unordered_flat_map`):
66/780 · 78
20
:100
English
Parameterized by a function object `Hash` and an equivalence relation `Pred`
26/760 · 76
20
:35
English
Allowed non-copyable callables to be passed to the `std::initializer_list` overloads of `insert_{and|or}_[c]visit` for concurrent containers, by internally passing a `std::reference_wrapper` of the callable to the iterator-pair overloads.
125/2380 · 238
20
:42
English
```plaintext (gdb) add-auto-load-safe-path [/path/to/executable] ```
3/680 · 68
20
:202
English
There is one last whole-table visitation operation, `erase_if`:
28/630 · 63
20
:300
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
:58
English
image::benchmarks-set/gcc/scattered erasure.xlsx.practice.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure.xlsx.practice.png,window=_blank]
154/1540 · 154
20
:49
English
Using a prime number of buckets, and choosing a bucket by using the modulus of the hash function's result will usually give a good result. The downside is that the required modulus operation is fairly expensive. This is what the containers used to do in most cases.
73/2650 · 265
20
:269
English
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
55/550 · 55
20
:57
English
`size_type bucket(key_type const& k) const`
47/430 · 43
20
:276
English
The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.
41/1090 · 109
20
:371
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
85/1160 · 116
20
:78
English
As with all open-addressing containers, elements (or pointers to the element nodes in the case of `boost::unordered_node_set` and `boost::unordered_node_map`) are stored directly in the bucket array. This array is logically divided into 2^_n_^ _groups_ of 15 elements each. In addition to the bucket array, there is an associated _metadata array_ with 2^_n_^ 16-byte words.
191/3730 · 373
20
:22
English
xref:reference/header_unordered_node_map_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_node_map_fwd.hpp>+++</code>+++ Synopsis]
161/1530 · 153
20
:260
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
85/1160 · 116
20
:300
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
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