Exit Zen
6
:15
English
- `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`). - The maximum load factor of the container is managed internally and can't be set by the user.
86/1910 · 191
6
:15
English
- `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`). - The maximum load factor of the container is managed internally and can't be set by the user.
88/1910 · 191
6
:17
English
The internal data structure of `boost::concurrent_node_set` is similar to that of `boost::unordered_node_set`. Unlike `boost::concurrent_flat_set`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.
156/2620 · 262
6
:17
English
The internal data structure of `boost::concurrent_flat_map` is similar to that of `boost::unordered_flat_map`. As a result of its using open-addressing techniques, `value_type` must be move-constructible and pointer stability is not kept under rehashing.
141/2540 · 254
6
:17
English
- `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user.
140/3120 · 312
6
:240
English
Description
2/110 · 11
6
:17
English
- `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user.
151/3120 · 312
6
:282
English
Description
2/110 · 11
6
:43
English
Provides the average value, variance and standard deviation of a sequence of numerical values.
18/940 · 94
7
:7
English
xref:compliance.adoc[]
25/220 · 22
7
:30
English
There is an link:../../../examples/fnv1.hpp[implementation of FNV-1a^] in the examples directory.
71/970 · 97
7
:31
English
^.^h|*Closed addressing* ^m| boost::unordered_set + boost::unordered_map + boost::unordered_multiset + boost::unordered_multimap ^|
131/1310 · 131
7
:18
English
Deduction guides for https://en.cppreference.com/w/cpp/language/class_template_argument_deduction[class template argument deduction (CTAD)^] are only available on {cpp}17 (or later) compilers.
130/1920 · 192
7
:24
English
Even if your supplied hash function does not conform to the uniform behavior required by open addressing, chances are that the performance of Boost.Unordered containers will be acceptable, because the library executes an internal __post-mixing__ step that improves the statistical properties of the calculated hash values. This comes with an extra computational cost; if you'd like to opt out of post-mixing, annotate your hash function as follows:
131/4480 · 448
7
:50
English
There are other differences, which are listed in the xref:regular.adoc#comparison[Comparison with Associative Containers] section.
50/1300 · 130
7
:16
English
allows for efficient removal and retrieval of an element via move construction.
22/790 · 79
:14
:14
English
Visualization structure
5/230 · 23
7
:14
English
Copyright (C) 2022-2025 Joaquín M López Muñoz
53/660 · 66
7
:11
English
Peter Dimov, 2022. https://pdimov.github.io/articles/unordered_dev_plan.html[Development Plan for Boost.Unordered^].
101/1160 · 116
7
:61
English
In a multithreaded scenario, the iterator `it` may be invalid at point B if some other thread issues an `m.erase(k)` operation between A and B. There are designs that can remedy this by making iterators lock the element they point to, but this approach lends itself to high contention and can easily produce deadlocks in a program. `operator[]` has similar concurrency issues, and is not provided by `boost::concurrent_flat_map`/`boost::concurrent_node_map` either. Instead, element access is done through so-called _visitation functions_:
241/5390 · 539