Exit Zen
21
:100
English
Keys can be compared using `key_compare` which is accessed by member function `key_comp()`, values can be compared using `value_compare` which is accessed by member function `value_comp()`.
72/1890 · 189
22
:100
English
Keys can be hashed using `hasher` which is accessed by member function `hash_function()`, and checked for equality using `key_equal` which is accessed by member function `key_eq()`. There is no function object for compared or hashing values.
95/2410 · 241
23
:100
English
Constructors have optional extra parameters for the comparison object.
20/700 · 70
24
:100
English
Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object.
42/1260 · 126
25
:100
English
Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`.
54/840 · 84
26
:100
English
Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`
34/590 · 59
27
:100
English
Member function `lower_bound(k)` and `upper_bound(k)`
37/530 · 53
28
:100
English
No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless.
49/1020 · 102
29
:100
English
`equal_range(k)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container.
43/1210 · 121
30
:100
English
`equal_range(k)` returns a range at the end of the container if `k` isn't present in the container. It can't return a positioned range as `k` could be inserted into multiple place. +
62/1820 · 182
31
:120
English
**Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket.
68/2350 · 235
32
:122
English
`iterator`, `const_iterator` are of the bidirectional category.
24/630 · 63
33
:122
English
`iterator`, `const_iterator` are of at least the forward category.
26/660 · 66
34
:122
English
Iterators, pointers and references to the container's elements are never invalidated.
23/850 · 85
35
:122
English
xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
80/1090 · 109
36
:127
English
**Node-based containers:** Pointers and references to the container's elements are never invalidated. + **Flat containers:** Pointers and references to the container's elements are invalidated when rehashing occurs.
58/2150 · 215
37
:130
English
Iterators iterate through the container in the order defined by the comparison object.
19/860 · 86
38
:130
English
Iterators iterate through the container in an arbitrary order, that can change as elements are inserted, although equivalent elements are always adjacent.
39/1540 · 154
39
:130
English
No equivalent
5/130 · 13
40
:130
English
**Closed-addressing containers:** Local iterators can be used to iterate through individual buckets. (The order of local iterators and iterators aren't required to have any correspondence.)
45/1890 · 189