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

:699 :699
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 133/10000 · 133
127 :668
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_map(std::initializer_list<value_type> il, const allocator_type& a); ``` 94/10000 · 94
127 :615
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_set(std::initializer_list<value_type> il, const allocator_type& a); ``` 94/10000 · 94
127 :592
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_multimap& operator=(const unordered_multimap& other); ``` 74/10000 · 74
:646 :646
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
127 :647
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ ~unordered_node_map(); ``` 33/10000 · 33
127 :575
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_set& operator=(unordered_flat_set const& other); ``` 74/10000 · 74
127 :587
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, the allocator is overwritten, if not the copied elements are created using the existing allocator. 226/10000 · 226
127 :626
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_map& operator=(unordered_flat_map const& other); ``` 74/10000 · 74
:404 :404
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — GCC 12, x86 11/10000 · 11
128 :195
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fix assigning the hash/key equality functions for empty containers. 67/10000 · 67
128 :645
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assignment 10/10000 · 10
128 :605
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_set& operator=(const unordered_set& other); ``` 64/10000 · 64
128 :605
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note:;; The destructor is applied to every element, and all memory is deallocated 81/10000 · 81
:701 :701
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
128 :672
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 133/10000 · 133
128 :619
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it. 133/10000 · 133
128 :596
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator. 127/10000 · 127
128 :648
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterator Range Constructor with Bucket Count and Hasher 55/10000 · 55
128 :652
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note:;; The destructor is applied to every element, and all memory is deallocated 81/10000 · 81