Exit Zen
15
:292
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`.
60/1510 · 151
15
:38
English
image::benchmarks-set/gcc/running insertion.xlsx.practice norehash.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash.png,window=_blank]
172/1720 · 172
15
:38
English
And since the standard is written with a eye towards closed
19/590 · 59
15
:246
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
15
:54
English
2+^h| *Closed-addressing containers only* h|*Method* h|*Description*
29/680 · 68
15
:254
English
A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool.
67/2470 · 247
15
:361
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`.
38/1510 · 151
15
:60
English
Thus container-wide iteration is turned into traversing the non-empty bucket groups (an operation with constant time complexity) which reduces the time complexity back to `O(size())`. In total, a bucket group is only 4 words in size and it views `sizeof(std::size_t) * CHAR_BIT` buckets meaning that for all common implementations, there's only 4 bits of space overhead per bucket introduced by the bucket groups.
156/4130 · 413
15
:17
English
xref:reference/header_unordered_flat_map.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_flat_map.hpp>+++</code>+++ Synopsis]
153/1450 · 145
15
:247
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
15
:300
English
_Hash_
6/100 · 6
15
:309
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`.
38/1510 · 151
15
:344
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`.
57/1510 · 151
15
:248
English
_Hash_
6/100 · 6
15
:245
English
An allocator whose value type is the same as the container's value type.
20/720 · 72
15
:297
English
_Hash_
6/100 · 6
15
:287
English
A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool.
66/2470 · 247
15
:66
English
For unsuccessful lookups, the average number of element comparisons should be close to 0.0.
23/910 · 91
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