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

287 :1080
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — get_allocator 13/10000 · 13
287 :1232
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy insert_and_[c]visit 24/10000 · 24
:1261 :1261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ``` 135/10000 · 135
287 :1169
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Iterator Range and Visit 31/10000 · 31
287 :1081
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multimap<Key, T, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_map<Key, T, H2, P2, Allocator>&& source); ``` 386/10000 · 386
:1162 :1162
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise if the insertion took place, `inserted` is true and `node` is empty. 78/10000 · 78
287 :1179
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The iterator following the erased elements - i.e. `last`. Throws:;; Nothing in this implementation (neither the `hasher` nor the `key_equal` objects are called). 172/10000 · 172
287 :1063
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — bucket_count 12/10000 · 12
287 :1073
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — get_allocator 13/10000 · 13
:1162 :1162
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
288 :451
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — using a cut down version of the Adobe move library when they are not. 69/10000 · 69
:1173 :1173
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key. 119/10000 · 119
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