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

118 :182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Manually write out `emplace_args` for small numbers of arguments - 66/10000 · 66
:618 :618
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
118 :578
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_set(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ``` 119/10000 · 119
118 :577
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 164/10000 · 164
118 :671
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 168/10000 · 168
118 :637
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Allocator 58/10000 · 58
118 :584
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Allocator 58/10000 · 58
118 :570
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it. 187/10000 · 187
:619 :619
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
118 :624
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 164/10000 · 164
118 :553
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it. 189/10000 · 189
:564 :564
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
118 :604
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it. 189/10000 · 189
119 :371
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-flat_map/vs-x64/Scattered successful looukp.xlsx.plot.png[width=250,window=_blank,link=_images/benchmarks-flat_map/vs-x64/Scattered successful looukp.xlsx.plot.png] 182/10000 · 182
119 :183
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — should make template error messages a little more bearable. 59/10000 · 59
119 :620
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — initializer_list Constructor with Bucket Count and Hasher and Allocator 71/10000 · 71
119 :583
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it. 187/10000 · 187
:580 :580
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 136/10000 · 136
:674 :674
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
119 :644
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table with at least `n` buckets, using `a` as the allocator and default hash function and key equality predicate, and inserts the elements from `[f, l)` into it. 181/10000 · 181