2. Boost Unordered Translation (zh_Hans)
3. Chinese (Simplified Han script)
4. Zen

197 :946
	English Returns:;; `false` iff `f` ever returns `false`. Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + These overloads only participate in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed. + + Parallelization implies that execution does not necessary finish as soon as `f` returns `false`, and as a result `f` may be invoked with further elements for which the return value is also `false`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 返回值：;; 当且仅当 `f` 曾返回 `false` 时，返回 `false`。 抛出异常：;; 依据所使用执行策略的异常处理机制，若 `f` 内部抛出异常，则可能调用 `std::terminate`。 注意：;; 仅在支持 C++17 并行算法的编译器中可用。 仅当 `std::is_execution_policy_v<std::remove_cvref_t<executionpolicy>&gt;` 为 `true` 时，这些重载版本才参与重载决议。 不允许使用无序执行策略。 并行化意味着：一旦 `f` 返回 `false`，执行流程**不一定会立即终止**，因此 `f` 可能还会被继续用于后续元素，且这些调用的返回值同样为 `false`。</std::remove_cvref_t<executionpolicy> 368/6680 · 668 Needs editing
:811 :811
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中没有具有等价键的元素时，才将在容器中插入一个从 `std::forward<k>(k)` 构造的元素。</k> 62/1490 · 149 Needs editing
198 :856
	English Inserts an element into the container by performing `emplace(std::forward<P>(value))`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 通过执行 `emplace(std::forward<p>(value))` 向容器中插入一个元素。</p> 54/860 · 86 Needs editing
:858 :858
	English Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 仅当 std::is_constructible<value_type, p&&="">::value 为 true 时参与重载决议。</value_type,> 81/1020 · 102 Needs editing
:829 :829
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中不存在具有等价键的元素时，才插入一个从 `std::forward<k>(k)` 构造的元素。</k> 58/1490 · 149 Needs editing
212 :844
	English Inserts an element into the container by performing `emplace_hint(hint, std::forward<P>(value))`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 通过执行 `emplace_hint(hint, std::forward<p>(value))` 向容器中插入一个元素。</p> 65/970 · 97 Needs editing
:872 :872
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中不存在等价键的元素时，插入一个由 `std::forward<k>(k)` 构造的元素。</k> 55/1490 · 149 Needs editing
:846 :846
	English Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 仅在 `std::is_constructible<value_type, p&&="">::value` 为 `true` 时参与重载决议。</value_type,> 85/1020 · 102 Needs editing
:867 :867
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中没有具有等价键的元素时，才在容器中插入一个从 `std::forward<k>(k)` 构造的元素。</k> 61/1490 · 149 Needs editing
215 :914
	English Inserts an element into the container by performing `emplace_hint(hint, std::forward<P>(value))`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 通过执行 `emplace_hint(hint, std::forward<p>(value))` 向容器中插入一个元素。</p> 65/970 · 97 Needs editing
:916 :916
	English Only participates in overload resolution if `std::is_constructible<value_type, P&&>::value` is `true`.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 仅当 `std::is_constructible<value_type, p&&="">::value` 为 `true` 时参与重载决议。</value_type,> 85/1020 · 102 Needs editing
217 :327
	English The behaviour of swap is different when the two containers to be
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当两个待交换容器的分配器不相等时，swap 操作的行为发生变更。 32/640 · 64 Needs editing
219 :943
	English Returns:;; An `insert_return_type` object constructed from `position`, `inserted` and `node`: +
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 返回：一个 `insert_return_type` 对象，由 `position`、`inserted` 和 `node` 构造而成。 68/950 · 95 Needs editing
:939 :939
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — `template<class k,="" args="">` 重载仅在以下条件下参与重载决议：`Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 均不能从 `K` 隐式转换。库假定 `Hash` 可同时以 `K` 和 `Key` 调用，且 `Pred` 是透明的。这实现了异构查找，从而避免实例化 `Key` 类型对象的开销。</class> 241/4530 · 453 Needs editing
222 :871
	English 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_set`. + + 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 返回：如果找到该元素，则返回一个拥有该元素的 `node_type`；否则返回一个空的 `node_type`。 抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。 注意：通过此方法提取的节点可以插入到兼容的 `unordered_set` 中。 `template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class> 375/7010 · 701 Needs editing
224 :346
	English Fix a bug when inserting into an `unordered_map` or `unordered_set` using
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 修复了在使用返回 `value_type` 副本的迭代器插入 `unordered_map` 或 `unordered_set` 时的一个错误。 72/730 · 73 Needs editing
224 :939
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中不存在等价键的元素时，才会使用 `std::forward<k>(k)` 构造元素并插入到容器中。</k> 60/1490 · 149 Needs editing
225 :347
	English iterators which returns `value_type` by copy.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — (使用返回 `value_type` 副本) 22/450 · 45 Needs editing
229 :900
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 返回：;; 被删除的元素数量。抛出：;; 仅当由 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。备注：;; `template<class k="">` 重载仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，并且 `K` 不能隐式转换为 `iterator` 或 `const_iterator` 时，才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class> 298/5670 · 567 Needs editing
230 :986
	English 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.
	Chinese (Simplified Han script) ↹ ↵ NBS … 「 」 『 』 ﹙-﹚ ‐ – — 当且仅当容器中不存在键等价的元素时，才使用 `std::forward<k>(k)` 构造元素并插入到容器中。</k> 59/1490 · 149 Needs editing