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

49 :74
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Sped up iteration of open-addressing containers. 48/10000 · 48
49 :415
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor 24/10000 · 24
49 :379
	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`. 183/10000 · 183
49 :363
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_node_set(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ``` 161/10000 · 161
49 :449
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the table. Note that this option decreases the overall performance of many operations. 183/10000 · 183
49 :432
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the table. Note that this option decreases the overall performance of many operations. 183/10000 · 183
49 :379
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the table. Note that this option decreases the overall performance of many operations. 183/10000 · 183
:372 :372
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 212/10000 · 212
49 :396
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the table. Note that this option decreases the overall performance of many operations. 183/10000 · 183
49 :412
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Bucket Count Constructor 24/10000 · 24
49 :352
	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` as the allocator, and inserts the elements from `[f, l)` into it. 199/10000 · 199
49 :365
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor 26/10000 · 26
49 :403
	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` as the allocator, and inserts the elements from `[f, l)` into it. 199/10000 · 199
50 :50
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — xref:bibliography.adoc[] 24/10000 · 24
50 :148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — O(_n_) where _n_ is the minimum number of buckets. 50/10000 · 50
50 :155
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/clang_libcpp/scattered erasure.xlsx.practice non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/clang_libcpp/scattered erasure.xlsx.practice non-unique 5.png] 198/10000 · 198
50 :133
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 2+^h| *Open-addressing and concurrent containers only* h|*Method* h|*Description* 81/10000 · 81
50 :75
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — In open-addressing containers, `erase(iterator)`, which previously returned nothing, now 88/10000 · 88
50 :416
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_map(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ``` 156/10000 · 156
:384 :384
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 212/10000 · 212