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

143 :713
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Note:;; The destructor is applied to every element, and all memory is deallocated 81/10000 · 81
:715 :715
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
145 :717
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assignment 10/10000 · 10
146 :719
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Assignment 15/10000 · 15
147 :721
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_map& operator=(concurrent_flat_map const& other); ``` 76/10000 · 76
148 :725
	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
149 :730
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on `*this` and `other`. 151/10000 · 151
:733 :733
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
151 :735
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Assignment 15/10000 · 15
152 :736
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_map& operator=(concurrent_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 `*this`; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:concurrent_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()`. 1020/10000 · 1020
153 :751
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency:;; Blocking on `*this` and `other`. 47/10000 · 47
:753 :753
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
155 :755
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Initializer List Assignment 27/10000 · 27
156 :756
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_map& operator=(std::initializer_list<value_type> il); ``` 80/10000 · 80
157 :760
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Assign from values in initializer list. All previously existing elements are destroyed. 87/10000 · 87
158 :763
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] Concurrency:;; Blocking on `*this`. 139/10000 · 139
:766 :766
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
160 :768
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Visitation 10/10000 · 10
161 :770
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — [c]visit 8/10000 · 8
162 :772
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> size_t visit(const key_type& k, F f); template<class F> size_t visit(const key_type& k, F f) const; template<class F> size_t cvisit(const key_type& k, F f) const; template<class K, class F> size_t visit(const K& k, F f); template<class K, class F> size_t visit(const K& k, F f) const; template<class K, class F> size_t cvisit(const K& k, F f) const; ``` 378/10000 · 378