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

283 :1158
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`. + + The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 707/10000 · 707
283 :1104
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void clear() noexcept; ``` 33/10000 · 33
283 :1068
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transfers all the element nodes from `source` whose key is not already present in `*this`. 90/10000 · 90
283 :1213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args, class F1, class F2> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ``` 215/10000 · 215
283 :1239
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> bool try_emplace(const key_type& k, Args&&... args); template<class... Args> bool try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> bool try_emplace(K&& k, Args&&... args); ``` 233/10000 · 233
283 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K, class F1, class F2> bool insert_and_visit(K&& k, F1 f1, F2 f2); template<class K, class F1, class F2> bool insert_and_cvisit(K&& k, F1 f1, F2 f2); ``` 175/10000 · 175
283 :1072
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases all elements in the container. 37/10000 · 37
283 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> insert_return_type insert_or_visit(node_type&& nh, F f); template<class F> insert_return_type insert_or_cvisit(node_type&& nh, F f); ``` 161/10000 · 161
:1168 :1168
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
283 :1046
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ``` 344/10000 · 344
283 :1066
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Iterators to non-transferred elements in `source` remain valid. 63/10000 · 63
:1150 :1150
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
284 :445
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.36.0 14/10000 · 14
:1164 :1164
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
284 :1108
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases all elements in the container. 37/10000 · 37
284 :1071
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `*this` is greater than its original maximum load, invalidates all iterators associated to `*this`. 248/10000 · 248
284 :1220
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the table 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 `emplace_and_cvisit` is used. 335/10000 · 335
284 :1245
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it. 131/10000 · 131
284 :1155
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element. 298/10000 · 298
284 :1075
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0` Throws:;; Never throws an exception. 68/10000 · 68