Exit Zen
16
:344
English
_Pred_
6/100 · 6
16
:248
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
16
:258
English
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
85/1160 · 116
16
:297
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`.
66/1510 · 151
16
:287
English
_Allocator_
11/110 · 11
16
:68
English
These statistics can be used to determine if a given hash function can be marked as link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[__avalanching__].
117/1830 · 183
17
:17
English
xref:reference/unordered_multimap.adoc[`unordered_multimap`]
60/600 · 60
17
:79
English
Custom Types
5/120 · 12
17
:91
English
Storing an object in an unordered associative container requires both a key equality function and a hash function. The default function objects in the standard containers support a few basic types including integer types, floating point types, pointer types, and the standard strings. Since Boost.Unordered uses link:../../../../container_hash/index.html[boost::hash^] it also supports some other types, including standard containers. To use any types not supported by these methods you have to extend Boost.Hash to support the type or use your own custom equality predicates and hash functions. See the xref:hash_equality.adoc#hash_equality[Equality Predicates and Hash Functions], section for more details.
290/7080 · 708
17
:74
English
The main differences with C++ unordered associative containers are:
30/670 · 67
17
:120
English
An link:../../../benchmark/string_stats.cpp[example^] is provided that displays container statistics for `boost::hash<std::string>`, an implementation of the https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function#FNV-1a_hash[FNV-1a hash^] and two ill-behaved custom hash functions that have been incorrectly marked as avalanching:
231/3500 · 350
:100
:100
English
Associative Containers
4/220 · 22
17
:32
English
Added GDB pretty-printers for all containers and iterators. For a container with an allocator that uses fancy pointers, these only work if the proper pretty-printer is written for the fancy pointer type itself.
63/2100 · 210
17
:34
English
Always, when using pretty-printers, you must enable pretty-printing like below. This is typically a one-time setup.
40/1150 · 115
17
:161
English
In the absence of iterators, `visit_all` is provided as an alternative way to process all the elements in the container:
45/1200 · 120
17
:292
English
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`.
55/1590 · 159
17
:38
English
image::benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique 5.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice norehash non-unique 5.png,window=_blank]
198/1980 · 198
17
:41
English
So closed addressing is used.
10/290 · 29
17
:263
English
The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.
26/1000 · 100
17
:57
English
An upper bound on the number of buckets.
7/400 · 40