2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Regular (adoc)
4. English
5. Zen

:100 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Unordered Associative Containers 32/10000 · 32
19 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parameterized by an ordering relation `Compare` 47/10000 · 47
20 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parameterized by a function object `Hash` and an equivalence relation `Pred` 76/10000 · 76
21 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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()`. 189/10000 · 189
22 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 241/10000 · 241
23 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructors have optional extra parameters for the comparison object. 70/10000 · 70
24 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructors have optional extra parameters for the initial minimum number of buckets, a hash function and an equality object. 126/10000 · 126
25 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Keys `k1`, `k2` are considered equivalent if `!Compare(k1, k2) && !Compare(k2, k1)`. 84/10000 · 84
26 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)` 59/10000 · 59
27 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Member function `lower_bound(k)` and `upper_bound(k)` 53/10000 · 53
28 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — No equivalent. Since the elements aren't ordered `lower_bound` and `upper_bound` would be meaningless. 102/10000 · 102
29 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `equal_range(k)` returns an empty range at the position that `k` would be inserted if `k` isn't present in the container. 121/10000 · 121
30 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `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. + 182/10000 · 182
31 :120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **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. 235/10000 · 235
32 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `iterator`, `const_iterator` are of the bidirectional category. 63/10000 · 63
33 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `iterator`, `const_iterator` are of at least the forward category. 66/10000 · 66
34 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators, pointers and references to the container's elements are never invalidated. 85/10000 · 85
35 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. + 109/10000 · 109
36 :127
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **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. 215/10000 · 215
37 :130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators iterate through the container in the order defined by the comparison object. 86/10000 · 86