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

32 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `iterator`, `const_iterator` are of the bidirectional category. 63/10000 · 63
32 :105
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — When using a hash function directly suitable for open addressing, post-mixing can be opted out of via a dedicated `link:../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]` trait. `boost::hash` specializations for string types are marked as avalanching. 296/10000 · 296
32 :140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns the container's hash function. 38/10000 · 38
:97 :97
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Unsuccessful lookup 19/10000 · 19
32 :286
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ^|`boost::concurrent_node_set` ^|`boost::unordered_node_set` 60/10000 · 60
32 :94
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — You can't control the bucket count directly but there are two ways to influence it: 83/10000 · 83
32 :140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::cfoa.png[align=center] 29/10000 · 29
32 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The pretty-printers also work if you are using fancy pointers in your allocator, such as `boost::interprocess::offset_ptr`. While this is rare, Boost.Unordered has GDB pretty-printer customization points to support any type of fancy pointer. `boost::interprocess::offset_ptr` has support already defined in the Boost.Interprocess library, and you can add support to your own type by following the instructions contained in a comment near the end of the file link:https://github.com/boostorg/unordered/blob/develop/extra/boost_unordered_printers.py[/extra/boost_unordered_printers.py]. 584/10000 · 584
32 :34
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_concurrent_node_map_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/concurrent_node_map_fwd.hpp>+++</code>+++ Synopsis] 155/10000 · 155
32 :54
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added `boost::concurrent_flat_set`. 35/10000 · 35
32 :349
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iterator with the same value type, difference type and pointer and reference type as iterator. 97/10000 · 97
:309 :309
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
32 :299
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Convertible to `const_iterator`. 32/10000 · 32
32 :403
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members. 180/10000 · 180
32 :386
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members. 180/10000 · 180
32 :333
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members. 180/10000 · 180
32 :316
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iterator with the same value type, difference type and pointer and reference type as iterator. 97/10000 · 97
32 :350
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members. 180/10000 · 180
:347 :347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
:293 :293
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53