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

108 :333
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-flat_map/gcc-x64/Scattered unsuccessful looukp.xlsx.plot.png[width=250,window=_blank,link=_images/benchmarks-flat_map/gcc-x64/Scattered unsuccessful looukp.xlsx.plot.png] 188/10000 · 188
108 :164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Small standards compliance fixes: 33/10000 · 33
:592 :592
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
108 :552
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_set(std::initializer_list<value_type> il, const allocator_type& a); ``` 88/10000 · 88
108 :551
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it. 200/10000 · 200
108 :635
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move construction from a xref:#unordered_node_map[`unordered_node_map`]. 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:concurrent_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`. 409/10000 · 409
108 :611
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor with Allocator 39/10000 · 39
108 :558
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor with Allocator 39/10000 · 39
108 :543
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container using `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it. 133/10000 · 133
108 :587
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Complexity:;; O(`bucket_count()`) 33/10000 · 33
108 :598
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it. 200/10000 · 200
108 :526
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 137/10000 · 137
:537 :537
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
108 :577
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 137/10000 · 137
:340 :340
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|running insertion h|running erasure h|successful lookup h|unsuccessful lookup 79/10000 · 79
109 :165
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ** `noexpect` specs for `swap` free functions. ** Add missing `insert(P&&)` methods. 84/10000 · 84
109 :594
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — initializer_list Constructor with Allocator 43/10000 · 43
109 :556
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container using `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it. 133/10000 · 133
:554 :554
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 124/10000 · 124
109 :642
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Complexity:;; O(`bucket_count()`) 33/10000 · 33