2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Reference / Unordered Flat Map (adoc)
4. English
5. Zen

127 :626
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_map& operator=(unordered_flat_map const& other); ``` 74/10000 · 74
128 :630
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The assignment operator. Destroys previously existing elements, copy-assigns the hash function and predicate from `other`, copy-assigns the allocator from `other` if `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, and finally inserts copies of the elements of `other`. 345/10000 · 345
:635 :635
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] 103/10000 · 103
:637 :637
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
131 :639
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Assignment 15/10000 · 15
132 :640
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_map& operator=(unordered_flat_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_flat_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
:654 :654
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
134 :656
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initializer List Assignment 27/10000 · 27
135 :657
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ unordered_flat_map& operator=(std::initializer_list<value_type> il); ``` 79/10000 · 79
136 :661
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assign from values in initializer list. All previously existing elements are destroyed. 87/10000 · 87
:664 :664
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] 103/10000 · 103
138 :666
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators 9/10000 · 9
139 :668
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — begin 5/10000 · 5
140 :669
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ``` 76/10000 · 76
141 :675
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container. Complexity:;; O(`bucket_count()`) 176/10000 · 176
:678 :678
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
143 :680
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — end 3/10000 · 3
144 :681
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator end() noexcept; const_iterator end() const noexcept; ``` 72/10000 · 72
145 :687
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An iterator which refers to the past-the-end value for the container. 80/10000 · 80
:689 :689
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3