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

30 :330
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
:307 :307
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The iterator category is at least a forward iterator. 53/10000 · 53
30 :347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `std::allocator_traits<Alloc>::construct` 41/10000 · 41
30 :338
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
30 :284
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
30 :304
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — An iterator with the same value type, difference type and pointer and reference type as iterator. 97/10000 · 97
30 :335
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Typedefs 8/10000 · 8
31 :31
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/header_unordered_node_map_fwd.adoc[`<boost/unordered/unordered_node_map_fwd.hpp>`] 97/10000 · 97
31 :120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — **Closed-addressing containers:** To find out the bucket that `k` would be inserted into use `bucket(k)`. But remember that an insert can cause the container to rehash - meaning that the element can be inserted into a different bucket. 235/10000 · 235
31 :100
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — where *mul* is an _extended multiplication_ (128 bits in 64-bit architectures, 64 bits in 32-bit environments), and *high* and *low* are the upper and lower halves of an extended word, respectively. In 64-bit architectures, _C_ is the integer part of 2^64^&#8725;https://en.wikipedia.org/wiki/Golden_ratio[_&phi;_], whereas in 32 bits _C_ = 0xE817FB2Du has been obtained from https://arxiv.org/abs/2001.05304[Steele and Vigna (2021)^]. 435/10000 · 435
31 :140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hasher hash_function() const` 30/10000 · 30
:90 :90
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|non-duplicate elements h|duplicate elements h|duplicate elements, + max load factor 5 87/10000 · 87
31 :280
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — As open-addressing and concurrent containers are based on the same internal data structure, they can be efficiently move-constructed from their non-concurrent counterpart, and vice versa. 187/10000 · 187
31 :88
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The standard leaves a lot of freedom to the implementer to decide how the number of buckets is chosen, but it does make some requirements based on the container's _load factor_, the number of elements divided by the number of buckets. Containers also have a _maximum load factor_ which they should try to keep the load factor below. 332/10000 · 332
31 :145
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — One notable operation not provided by `boost::concurrent_flat_map`/`boost::concurrent_node_map` is `operator[]`/`at`, which can be replaced, if in a more convoluted manner, by `xref:reference/concurrent_flat_map.adoc#concurrent_flat_map_try_emplace_or_cvisit[try_emplace_or_visit]`. 282/10000 · 282
31 :132
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `boost::concurrent_flat_set`/`boost::concurrent_node_set` and `boost::concurrent_flat_map`/`boost::concurrent_node_map` use the basic xref:structures.adoc#structures_open_addressing_containers[open-addressing layout] described above augmented with synchronization mechanisms. 275/10000 · 275
:88 :88
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fancy pointers 14/10000 · 14
31 :33
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:reference/concurrent_flat_set.adoc[Class Template +++<code style="color: inherit;">+++concurrent_flat_set+++</code>+++] 124/10000 · 124
31 :52
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.84.0 - Major update 29/10000 · 29
:342 :342
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3