Zen

Translation

:984
English
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
38/1190 · 119

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
:933
---
---
Extract by Value
通过键值提取元素
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
```c++ node_type extract(const key_type&amp; k); template<class k=""> node_type extract(K&amp;&amp; k); ```</class>
Removes an element with key equivalent to `k`.
移除键等价于 `k` 的元素。
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:;; In C++17 a node extracted using this method can be inserted into a compatible `unordered_multiset`, but that is not supported yet. + + 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.
返回：若找到元素，则返回拥有该元素的 `node_type`；否则返回空 `node_type`。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。说明：在 C++17 中，通过此方法提取的节点可以插入到兼容的 `unordered_multiset` 中，但该功能尚未支持。+ +`template<class k="">` 重载仅在以下条件下参与重载决议：`Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 均不能从 `K` 隐式转换。库假定 `Hash` 可同时以 `K` 和 `Key` 调用，且 `Pred` 是透明的。这实现了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:950
---
---
Insert with `node_handle`
通过 `node++_++handle` 插入
```c++ insert_return_type insert(node_type&& nh); ```
```c++ insert_return_type insert(node_type&amp;&amp; nh); ```
:957
If `nh` is empty, has no effect.
若 `nh` 为空节点，则此操作不产生任何效果。
:959
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns an `insert_return_type` with: `inserted` equal to `false`, `position` equal to `end()` and `node` empty. + + Otherwise if there was already an element with an equivalent key, returns an `insert_return_type` with: `inserted` equal to `false`, `position` pointing to a matching element and `node` contains the node from `nh`. + + Otherwise if the insertion succeeded, returns an `insert_return_type` with: `inserted` equal to `true`, `position` pointing to the newly inserted element and `node` empty. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + In C++17 this can be used to insert a node extracted from a compatible `unordered_multiset`, but that is not supported yet.
要求：`nh` 为空或 `nh.get_allocator()` 与容器的分配器相等。返回：若 `nh` 为空，则返回一个 `insert_return_type`，其中：`inserted` 为 `false`，`position` 等于 `end()`，`node` 为空。+ +否则若已存在等价的键，则返回一个 `insert_return_type`，其中：`inserted` 为 `false`，`position` 指向匹配的元素，`node` 包含 `nh` 中的节点。+ +否则若插入成功，则返回一个 `insert_return_type`，其中：`inserted` 为 `true`，`position` 指向新插入的元素，`node` 为空。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。+ +在 C++17 中，该函数可用于插入从兼容的 `unordered_multiset` 中提取的节点，但该功能尚未支持。
:975
---
---
Insert with Hint and `node_handle`
带提示和 `node++_++handle` 的插入
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&amp;&amp; nh); ```
:982
If `nh` is empty, has no effect.
若 `nh` 为空节点，则此操作不产生任何效果。
:984
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
If there is already an element in the container with an equivalent key has no effect on `nh` (i.e. `nh` still contains the node.)
如果容器中已存在具有等价键的元素，则对 `nh` 不产生任何影响.（即 `nh` 仍持有该节点.）
:988
`hint` is a suggestion to where the element should be inserted.
`hint` 是插入元素位置的建议。
Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty returns `end()`. + + If there was already an element in the container with an equivalent key returns an iterator pointing to that. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_multiset`.
要求：`nh` 为空或 `nh.get_allocator()` 与容器的分配器相等。返回：若 `nh` 为空，则返回 `end()`。+ +若容器中已存在等价的键，则返回指向该元素的迭代器。+ +否则，返回指向新插入元素的迭代器。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。说明：标准对 hint 的含义表述相当模糊。但使用它的唯一实际方式，也是 Boost.Unordered 唯一支持的方式，是将其指向具有相同键的现有元素。+ +可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。+ +指向元素的指针和引用永远不会失效。+ +该函数可用于插入从兼容的 `unordered_multiset` 中提取的节点。
:1006
---
---
Erase by Position
通过位置擦除
```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
:1015
Erase the element pointed to by `position`.
擦除由 `position` 指向的元素。
Returns:;; The iterator following `position` before the erasure. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated.
返回：擦除前指向 `position` 之后位置的迭代器。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。说明：在旧版本中，该操作可能效率较低，因为它需要搜索多个桶才能找到所返回迭代器的位置。数据结构已做修改，此问题已不复存在，并且其他替代的 `erase` 方法已被弃用。
:1022
---
---
Erase by Value
通过值擦除
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
```c++ size_type erase(const key_type&amp; k); template<class k=""> size_type erase(K&amp;&amp; k); ```</class>
Erase all elements with key equivalent to `k`.
擦除所有键等价于 `k` 的元素。
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.
返回：擦除的元素数量。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。说明：`template<class k="">` 重载仅在以下条件下参与重载决议：`Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 均不能从 `K` 隐式转换。库假定 `Hash` 可同时以 `K` 和 `Key` 调用，且 `Pred` 是透明的。这实现了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1037
---
---
Erase Range
范围擦除
Key English Chinese (Simplified Han script) Actions
:853
`hint` is a suggestion to where the element should be inserted.
`hint` 是一个关于元素应插入位置的建议。
:865
---
---
:872
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.
当且仅当容器中不存在等价键的元素时，插入一个由 `std::forward<k>(k)` 构造的元素。</k>
:874
`hint` is a suggestion to where the element should be inserted.
`hint` 是插入元素位置的建议。
:888
---
---
:895
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
将元素范围插入容器中。仅当容器中不存在等价键的元素时，才会插入相应元素。
:904
---
---
:911
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
将元素范围插入容器中。仅当容器中不存在等价键的元素时，才会插入相应元素。
:920
---
---
:933
---
---
:950
---
---
:957
If `nh` is empty, has no effect.
若 `nh` 为空节点，则此操作不产生任何效果。
:959
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
:975
---
---
:982
If `nh` is empty, has no effect.
若 `nh` 为空节点，则此操作不产生任何效果。
:984
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
:988
`hint` is a suggestion to where the element should be inserted.
`hint` 是插入元素位置的建议。

Loading…

User avatar admin

Translation uploaded
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.否则，当且仅当容器中不存在等价键的元素时，才会插入 `nh` 所拥有的元素。
:984
06/05/2026
User avatar admin

String added in the repository
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
:984
06/05/2026
Browse all string changes

Glossary

English Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Key
:984
Flags
safe-html, strict-same
Unit identifier
51081
Source string location
:984
String age
06/05/2026
Last updated
06/06/2026
Source string age
06/05/2026
Translation file AsciiDoc file
doc/modules/ROOT/pages/reference/unordered_set_zh_Hans.adoc, string 246