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

238 :1012
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Initializer List 23/10000 · 23
238 :1005
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor. 118/10000 · 118
238 :927
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swaps the contents of the container with the parameter. 55/10000 · 55
238 :931
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator erase(iterator position); iterator erase(const_iterator position); ``` 86/10000 · 86
:1000 :1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts a new element into the container or updates an existing one by assigning to the contained value. 104/10000 · 104
239 :372
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Add missing `std` qualifier to `ptrdiff_t`. 43/10000 · 43
:1000 :1000
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Pointers and references to elements are never invalidated. 58/10000 · 58
:957 :957
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
:937 :937
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
239 :1079
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Insert Node 11/10000 · 11
:1060 :1060
	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
239 :989
	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 const reference to the equivalent element. 203/10000 · 203
:927 :927
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, has no effect. 32/10000 · 32
239 :1013
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type insert(std::initializer_list<value_type> il); ``` 66/10000 · 66
:1007 :1007
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. 101/10000 · 101
:929 :929
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior. 237/10000 · 237
:936 :936
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase the element pointed to by `position`. 43/10000 · 43
:1002 :1002
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`. 92/10000 · 92
240 :373
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Some code formatting changes to fit almost all lines into 80 characters. 72/10000 · 72
:1002 :1002
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — The `template<class K, class\... Args>` 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. -- 456/10000 · 456