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

249 :974
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; 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. 567/10000 · 567
249 :1099
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args, class F> bool emplace_or_visit(Args&&... args, F&& f); template<class... Args, class F> bool emplace_or_cvisit(Args&&... args, F&& f); ``` 169/10000 · 169
:1104 :1104
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
:1025 :1025
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. Otherwise, invokes `f` with a const reference to the equivalent element. 171/10000 · 171
:970 :970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1040 :1040
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the insertion failed, `inserted` is false and `node` has the previous value of `nh`. 87/10000 · 87
:1040 :1040
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) 133/10000 · 133
249 :954
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()` 83/10000 · 83
249 :966
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases the elements in the range from `first` to `last`. 56/10000 · 56
:1042 :1042
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is no such element, it is added to the container as: ```c++ 68/10000 · 68
250 :393
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Store the prime list as a preprocessor sequence - so that it will always get the length right if it changes again in the future. 128/10000 · 128
250 :1041
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — instead of xref:#unordered_map_emplace_hint[emplace_hint] which simply forwards all arguments to ``value_type``'s constructor. 126/10000 · 126
:1006 :1006
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:978 :978
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
250 :1104
	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. Otherwise, invokes `f` with a reference to the equivalent element; such reference is const iff `emplace_or_cvisit` is used. 254/10000 · 254
:1111 :1111
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements inserted. 43/10000 · 43
:1029 :1029
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Invalidates pointers and references to elements if a rehashing is issued. 281/10000 · 281
250 :972
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Position 17/10000 · 17
250 :1041
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; If an exception is thrown by an operation other than a call to `hasher` 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. 270/10000 · 270
:1045 :1045
	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