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

244 :951
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase all elements with key equivalent to `k`. 46/10000 · 46
:1026 :1026
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
245 :384
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — for EBO and a slightly different function buffer - now using a bool instead of a member pointer. 96/10000 · 96
:1019 :1019
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is an existing element with key `k` this function does nothing. 72/10000 · 72
:982 :982
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
:963 :963
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1091 :1091
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If the insertion failed, `inserted` is false and `node` has the previous value of `nh`. 87/10000 · 87
245 :1086
	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. + + In a call of the form `insert_or_[c]visit(obj, f)`, the overloads accepting a `value_type&&` argument participate in overload resolution only if `std::remove_reference<decltype(obj)>::type` is `value_type`. 492/10000 · 492
:1012 :1012
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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
:950 :950
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
245 :1033
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is not empty, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.value()`. `nh` is empty when the function returns. 194/10000 · 194
:1025 :1025
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a new element into the container if there is no existing element with key `k` contained within it. 106/10000 · 106
:944 :944
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
245 :954
	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
245 :1028
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert_or_assign with Hint 26/10000 · 26
246 :387
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Buckets are allocated lazily which means that constructing an empty container 77/10000 · 77
:1021 :1021
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. 63/10000 · 63
:984 :984
	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
246 :965
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Key 12/10000 · 12
246 :1092
	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