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

72 :503
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result. 140/10000 · 140
72 :450
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result. 140/10000 · 140
72 :436
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_multimap(const Allocator& a); ``` 59/10000 · 59
72 :486
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table 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. 195/10000 · 195
72 :483
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Allocator Constructor 21/10000 · 21
72 :408
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_set(unordered_flat_set const& other, Allocator const& a); ``` 83/10000 · 83
:430 :430
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
72 :459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_map(unordered_flat_map const& other, Allocator const& a); ``` 83/10000 · 83
:148 :148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — O(`size()`) 11/10000 · 11
73 :232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-set/vs/running insertion.xlsx.practice norehash non-unique 5.png[width=250,window=_blank,link=_images/benchmarks-set/vs/running insertion.xlsx.practice norehash non-unique 5.png] 196/10000 · 196
73 :108
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.79.0 14/10000 · 14
:489 :489
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
73 :448
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_set(const Allocator& a); ``` 54/10000 · 54
73 :437
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_node_set(Allocator const& a); ``` 59/10000 · 59
73 :541
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table 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. 195/10000 · 195
73 :506
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is copy constructible Concurrency:;; Blocking on `other`. 82/10000 · 82
73 :453
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is copy constructible Concurrency:;; Blocking on `other`. 82/10000 · 82
73 :440
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty container, using allocator `a`. 51/10000 · 51
:489 :489
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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^]. 180/10000 · 180
73 :484
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ explicit unordered_node_map(Allocator const& a); ``` 59/10000 · 59