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

288 :1117
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); ``` 374/10000 · 374
288 :1081
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` allocator_type get_allocator() const noexcept; ``` 54/10000 · 54
288 :1233
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F1, class F2> bool insert_and_visit(const value_type& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(const value_type& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_visit(const init_type& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(const init_type& obj, F1 f1, F2 f2); ``` 366/10000 · 366
288 :1266
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — unlike xref:#concurrent_flat_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor. 119/10000 · 119
288 :1170
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class InputIterator,class F1, class F2> size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); template<class InputIterator,class F1, class F2> size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, F2 f2); ``` 275/10000 · 275
288 :1092
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Attempt to "merge" two containers by iterating `source` and extracting all nodes in `source` and inserting them into `*this`. 125/10000 · 125
:1163 :1163
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the insertion failed, `inserted` is false and `node` has the previous value of `nh`. 87/10000 · 87
:1182 :1182
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
288 :1064
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_count() const noexcept; ``` 51/10000 · 51
288 :1074
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` allocator_type get_allocator() const noexcept; ``` 54/10000 · 54
288 :1164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Observers 9/10000 · 9
289 :452
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Emplace support when rvalue references and variadic template are available. 75/10000 · 75
289 :1176
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns an `insert_return_type` with: `inserted` equal to `false`, `position` equal to `end()` and `node` empty. + + Otherwise if there was already an element with an equivalent key, returns an `insert_return_type` with: `inserted` equal to `false`, `position` pointing to a matching element and `node` contains the node from `nh`. + + Otherwise if the insertion succeeded, returns an `insert_return_type` with: `inserted` equal to `true`, `position` pointing to the newly inserted element and `node` empty. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_multimap`. 1022/10000 · 1022
289 :1128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Attempt to "merge" two containers by iterating `source` and extracting any node in `source` that is not contained in `*this` and then inserting it into `*this`. 160/10000 · 160
289 :1086
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The container's allocator. 37/10000 · 37
:1240 :1240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key, and then invokes `f1` with a non-const reference to the newly created element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used. 304/10000 · 304
:1268 :1268
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invalidates pointers and references to elements if a rehashing is issued. 73/10000 · 73
:1177 :1177
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
289 :1094
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Because `source` can have a different hash function and key equality predicate, the key of each node in `source` is rehashed using `this\->hash_function()` and then, if required, compared using `this\->key_eq()`. 212/10000 · 212
289 :1164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; If an exception is thrown by an operation other than a call to `hasher` or call to `f`, the function has no effect. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal. 286/10000 · 286