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

:688 :688
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 136/10000 · 136
:690 :690
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
136 :692
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — initializer_list Constructor with Bucket Count and Hasher and Allocator 71/10000 · 71
137 :694
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ concurrent_flat_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ``` 125/10000 · 125
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
:702 :702
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]. 124/10000 · 124
:704 :704
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
141 :706
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Destructor 10/10000 · 10
142 :708
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ ~concurrent_flat_map(); ``` 34/10000 · 34
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