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

85 :517
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move insertable. 91/10000 · 91
85 :478
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initializer List Constructor 28/10000 · 28
85 :470
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_node_set(concurrent_node_set<Key, Hash, Pred, Allocator>&& other); ``` 87/10000 · 87
:574 :574
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency:;; Blocking on `other`. 35/10000 · 35
85 :539
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocator Constructor 21/10000 · 21
85 :486
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocator Constructor 21/10000 · 21
85 :476
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, `a` as the allocator and a maximum load factor of `1.0` and inserts the elements from `il` into it. 226/10000 · 226
:521 :521
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
85 :517
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_node_map(concurrent_node_map<Key, T, Hash, Pred, Allocator>&& other); ``` 90/10000 · 90
85 :458
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it. 178/10000 · 178
:469 :469
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
85 :509
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it. 178/10000 · 178
86 :278
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/vs/scattered successful looukp.xlsx.practice non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/vs/scattered successful looukp.xlsx.practice non-unique 5.png] 198/10000 · 198
86 :128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ** Add template deduction guides from the standard. ** Use a simple implementation of `optional` in node handles, so that they're closer to the standard. ** Add missing `noexcept` specifications to `swap`, `operator=` and node handles, and change the implementation to match. Using `std::allocator_traits::is_always_equal`, or our own implementation when not available, and `boost::is_nothrow_swappable` in the implementation. 426/10000 · 426
:520 :520
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
86 :488
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, `a` as the allocator and a maximum load factor of `1.0` and inserts the elements from `il` into it. 226/10000 · 226
86 :474
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move construction from a xref:#concurrent_node_set[`concurrent_node_set`]. The internal bucket array of `other` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:unordered_node_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`. 410/10000 · 410
:576 :576
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
86 :540
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit concurrent_flat_map(Allocator const& a); ``` 60/10000 · 60
86 :487
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit concurrent_flat_set(Allocator const& a); ``` 60/10000 · 60