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

137 :676
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — initializer_list Constructor with Bucket Count and Allocator 60/10000 · 60
137 :674
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_node_map& operator=(unordered_node_map&& other) noexcept((boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*>::value); ``` The move assignment operator. Destroys previously existing elements, swaps the hash function and predicate from `other`, and move-assigns the allocator from `other` if `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`. If at this point the allocator is equal to `other.get_allocator()`, the internal bucket array of `other` is transferred directly to the new container; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff the final allocator is equal to `other.get_allocator()`, and always calls `other.reset_stats()`. 1027/10000 · 1027
:613 :613
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] 103/10000 · 103
137 :615
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assign from values in initializer list. All existing elements are either overwritten by the new elements or destroyed. 118/10000 · 118
:664 :664
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] 103/10000 · 103
138 :428
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-flat_map/clang-x86/Scattered unsuccessful looukp.xlsx.plot.png[width=250,window=_blank,link=_images/benchmarks-flat_map/clang-x86/Scattered unsuccessful looukp.xlsx.plot.png] 192/10000 · 192
138 :208
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — for `unordered_multiset` and `unordered_multimap`. Might be a little slower. 76/10000 · 76
138 :674
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is move constructible. 47/10000 · 47
138 :634
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initializer List Assignment 27/10000 · 27
:641 :641
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
138 :731
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — initializer_list Constructor with Bucket Count and Allocator 60/10000 · 60
138 :699
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table 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. 185/10000 · 185
138 :646
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Constructs an empty table 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. 185/10000 · 185
138 :622
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_multimap& operator=(std::initializer_list<value_type> il); ``` 79/10000 · 79
138 :678
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_node_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ``` 107/10000 · 107
:688 :688
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
138 :615
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators 9/10000 · 9
138 :618
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container and https://en.cppreference.com/w/cpp/named_req/CopyAssignable[CopyAssignable^]. 203/10000 · 203
138 :666
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators 9/10000 · 9
:435 :435
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|running insertion h|running erasure h|successful lookup h|unsuccessful lookup 79/10000 · 79