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

:351 :351
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:297 :297
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
34 :317
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A const_local_iterator object can be used to iterate through a single bucket. 77/10000 · 77
:348 :348
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
35 :35
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_node_set.adoc[`<boost/unordered/unordered_node_set.hpp>`] 89/10000 · 89
35 :122
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. + 109/10000 · 109
35 :117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Although the implementation internally uses SIMD technologies, such as https://en.wikipedia.org/wiki/SSE2[SSE2^] and https://en.wikipedia.org/wiki/ARM_architecture_family#Advanced_SIMD_(NEON)[Neon^], when available, this does not affect interoperatility. For instance, the behavior is the same for Visual Studio on an x64-mode Intel CPU with SSE2 and for GCC on an IBM s390x without any supported SIMD technology. 413/10000 · 413
35 :101
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/gcc/scattered unsuccessful looukp.xlsx.practice non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/gcc/scattered unsuccessful looukp.xlsx.practice non-unique 5.png] 204/10000 · 204
35 :295
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ^|`boost::concurrent_flat_map` ^|`boost::unordered_flat_map` 60/10000 · 60
35 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `max_load_factor` doesn't let you set the maximum load factor yourself, it just lets you give a _hint_. And even then, the standard doesn't actually require the container to pay much attention to this value. The only time the load factor is _required_ to be less than the maximum is following a call to `rehash`. But most implementations will try to keep the number of elements below the max load factor, and set the maximum load factor to be the same as or close to the hint - unless your hint is unreasonably small or large. 526/10000 · 526
35 :145
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — to the container. Typically, such access is in read mode (that is, concurrent) even for modifying operations, so for most practical purposes there is no thread contention at this level. Access is only in write mode (blocking) when rehashing or performing container-wide operations such as swapping or assignment. 312/10000 · 312
35 :37
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_concurrent_node_set_fwd.adoc[+++<code style="color: inherit;">+++<boost/unordered/concurrent_node_set_fwd.hpp>+++</code>+++ Synopsis] 155/10000 · 155
35 :57
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Added efficient move construction of `boost::unordered_flat_(map|set)` from 75/10000 · 75
35 :360
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A constant iterator with the same value type, difference type and pointer and reference type as const_iterator. 111/10000 · 111
:320 :320
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:310 :310
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
35 :413
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued. 126/10000 · 126
35 :396
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued. 126/10000 · 126
35 :343
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued. 126/10000 · 126
35 :327
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A constant iterator with the same value type, difference type and pointer and reference type as const_iterator. 111/10000 · 111