2. Boost Unordered Translation (zh_Hans)
3. English
4. Zen

18 :270
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported. 116/10000 · 116
18 :309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
18 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 159/10000 · 159
18 :248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 159/10000 · 159
18 :264
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash. 109/10000 · 109
18 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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`. 159/10000 · 159
19 :19
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_set_top.adoc[`<boost/unordered_set.hpp>`] 73/10000 · 73
19 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parameterized by an ordering relation `Compare` 47/10000 · 47
19 :45
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There are two popular methods for choosing the number of buckets in a hash table. One is to have a prime number of buckets, another is to use a power of 2. 155/10000 · 155
:83 :83
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```cpp struct point { int x; int y; }; 38/10000 · 38
:54 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erasure 7/10000 · 7
19 :181
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traversal can be interrupted midway: 36/10000 · 36
19 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The number of elements in bucket `n`. 37/10000 · 37
19 :77
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ** `begin()` is not constant-time. ** `erase(iterator)` does not return an iterator to the following element, but a proxy object that converts to that iterator if requested; this avoids a potentially costly iterator increment operation when not needed. ** There is no API for bucket handling (except `bucket_count`). ** The maximum load factor of the container is managed internally and can't be set by the user. The maximum load, exposed through the public function `max_load`, may decrease on erasure under high-load conditions. 530/10000 · 530
19 :76
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::foa.png[align=center] 28/10000 · 28
19 :40
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — By default, if you compile into an ELF binary format, your binary will contain the Boost.Unordered pretty-printers. To use the embedded pretty-printers, ensure you allow auto-loading like below. This must be done every time you load GDB, or add it to a ".gdbinit" file. 269/10000 · 269
19 :21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_flat_set.adoc[Class Template +++<code style="color: inherit;">+++unordered_flat_set+++</code>+++] 122/10000 · 122
19 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ({github-pr-url}/277[PR#277^]). 31/10000 · 31
19 :307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The elements are organized into buckets. Keys with the same hash code are stored in the same bucket. 100/10000 · 100
19 :267
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Configuration macros 20/10000 · 20