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

:1123 :1123
	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 reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used. 224/10000 · 224
:1128 :1128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements inserted. 43/10000 · 43
:1046 :1046
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. 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. + + These overloads only participate in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. 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. 644/10000 · 644
255 :988
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Key 12/10000 · 12
255 :1057
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is constructible from `args`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; The interface is exposition only, as C++ does not allow to declare a parameter `f` after a variadic parameter pack. 271/10000 · 271
:1058 :1058
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
255 :970
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Observers 9/10000 · 9
:984 :984
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. Notes:;; This method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated. 454/10000 · 454
255 :1067
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Position 17/10000 · 17
256 :402
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Disable incorrect Visual {cpp} warnings. 40/10000 · 40
256 :1054
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert_or_assign 16/10000 · 16
256 :1024
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Value 14/10000 · 14
256 :994
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — swap 4/10000 · 4
256 :1127
	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:;; In a call of the form `insert_or_[c]visit(obj, f)`, the overloads accepting a `const value_type&` argument participate in overload resolution only if `std::remove_cv<std::remove_reference<decltype(obj)>::type>::type` is `value_type`. 441/10000 · 441
:1130 :1130
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1053 :1053
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
256 :989
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ``` 88/10000 · 88
:1062 :1062
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
256 :1060
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — insert_or_assign 16/10000 · 16
256 :972
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — get_allocator 13/10000 · 13