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

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
20 :269
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` 55/10000 · 55
20 :260
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported. 116/10000 · 116
20 :371
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported. 116/10000 · 116
20 :354
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported. 116/10000 · 116
20 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type*` and `const value_type*`, respectively. 178/10000 · 178
20 :276
	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
20 :317
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type*` and `const value_type*`, respectively. 178/10000 · 178
20 :300
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
20 :248
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
20 :268
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` 55/10000 · 55
20 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An allocator whose value type is the same as the container's value type. 72/10000 · 72
21 :21
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/unordered_set.adoc[`unordered_set`] 50/10000 · 50
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
21 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Using a power of 2 allows for much quicker selection of the bucket to use, but at the expense of losing the upper bits of the hash value. For some specially designed hash functions it is possible to do this and still get a good result but as the containers can take arbitrary hash functions this can't be relied on. 315/10000 · 315