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

19 :292
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the table's value type. 68/10000 · 68
19 :274
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The elements are organized into buckets. Keys with the same hash code are stored in the same bucket. 100/10000 · 100
19 :309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the table's value type. 68/10000 · 68
19 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
19 :248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
19 :266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Configuration macros 20/10000 · 20
19 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — _Allocator_ 11/10000 · 11
20 :20
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_set.adoc[`<boost/unordered/unordered_set.hpp>`] 79/10000 · 79
20 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Parameterized by a function object `Hash` and an equivalence relation `Pred` 76/10000 · 76
20 :49
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Using a prime number of buckets, and choosing a bucket by using the modulus of the hash function's result will usually give a good result. The downside is that the required modulus operation is fairly expensive. This is what the containers used to do in most cases. 265/10000 · 265
:89 :89
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — bool operator==(point const& p1, point const& p2) { return p1.x == p2.x && p1.y == p2.y; } 90/10000 · 90
20 :58
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/scattered erasure.xlsx.practice.png[width=250,link=_images/benchmarks-set/gcc/scattered erasure.xlsx.practice.png,window=_blank] 154/10000 · 154
20 :202
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — There is one last whole-table visitation operation, `erase_if`: 63/10000 · 63
20 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `size_type bucket(key_type const& k) const` 43/10000 · 43
20 :84
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Flat containers (`boost::unordered_flat_set` and `boost::unordered_flat_map`): 78/10000 · 78
20 :78
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As with all open-addressing containers, elements (or pointers to the element nodes in the case of `boost::unordered_node_set` and `boost::unordered_node_map`) are stored directly in the bucket array. This array is logically divided into 2^_n_^ _groups_ of 15 elements each. In addition to the bucket array, there is an associated _metadata array_ with 2^_n_^ 16-byte words. 373/10000 · 373
20 :42
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```plaintext (gdb) add-auto-load-safe-path [/path/to/executable] ``` 68/10000 · 68
20 :22
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_node_map_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/unordered_node_map_fwd.hpp>+++</code>+++ Synopsis] 153/10000 · 153
20 :35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allowed non-copyable callables to be passed to the `std::initializer_list` overloads of `insert_{and|or}_[c]visit` for concurrent containers, by internally passing a `std::reference_wrapper` of the callable to the iterator-pair overloads. 238/10000 · 238
20 :309
	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