Exit Zen
16
:16
English
xref:reference/unordered_map.adoc[`unordered_map`]
50/500 · 50
16
:72
English
predicates, especially if you're using a function pointer. If you compare two containers with different equality predicates then the result is undefined. For most stateless function objects this is impossible - since you can only compare objects with the same equality predicate you know the equality predicates must be equal. But if you're using function pointers or a stateful equality predicate (e.g. `boost::function`) then you can get into trouble.
162/4530 · 453
16
:65
English
All sets and maps in Boost.Unordered are instantiatied similarly as `std::unordered_set` and `std::unordered_map`, respectively:
90/1280 · 128
16
:67
English
Open-addressing containers provided by Boost.Unordered only work with reasonably compliant C++11 (or later) compilers. Language-level features such as move semantics and variadic template parameters are then not emulated. The containers are fully https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^].
249/4300 · 430
16
:118
English
The average number of comparisons per unsuccessful lookup should be close to 0.0.
21/810 · 81
16
:96
English
Comparison with Associative Containers
8/380 · 38
16
:31
English
In Visual Studio Natvis, supported any container with an allocator that uses fancy pointers. This applies to any fancy pointer type, as long as the proper Natvis customization point "Intrinsic" functions are written for the fancy pointer type.
98/2430 · 243
:32
:32
English
Using in your project
6/210 · 21
16
:159
English
Whole-Table Visitation
4/220 · 22
16
:292
English
_Pred_
6/100 · 6
16
:38
English
image::benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique.png,window=_blank]
194/1940 · 194
16
:39
English
addressing, users will be surprised if the performance doesn't reflect that.
20/760 · 76
16
:259
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
85/1160 · 116
16
:57
English
`size_type max_bucket_count() const`
36/360 · 36
16
:254
English
_Allocator_
11/110 · 11
16
:361
English
_Pred_
6/100 · 6
16
:62
English
A more detailed description of Boost.Unordered's closed-addressing implementation is given in an https://bannalia.blogspot.com/2022/06/advancing-state-of-art-for.html[external article]. For more information on implementation rationale, read the xref:rationale.adoc#rationale_closed_addressing_containers[corresponding section].
192/3270 · 327
16
:18
English
xref:reference/unordered_flat_map.adoc[Class Template +++<code style="color: inherit;">+++unordered_flat_map+++</code>+++]
111/1220 · 122
16
:247
English
_Pred_
6/100 · 6
16
:300
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