Zen

Translation

Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
67/1220 · 122

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Insert Iterator Range
迭代器范围插入
```c++ template<class InputIterator> void insert(InputIterator first, InputIterator last); ```
```c++ template<class inputiterator=""> void insert(InputIterator first, InputIterator last); ```</class>
:888
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.
将一个范围内的元素插入容器中。当且仅当容器中没有具有等价键的元素时，才会插入这些元素。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from `*first`. Throws:;; When inserting a single element, 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 to be greater than the maximum load.
要求：`value_type` 可以从 `*first` 出发在容器中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。
抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:895
---
---
Insert Initializer List
初始化列表插入
```c++ void insert(std::initializer_list<value_type>); ```
```c++ void insert(std::initializer_list<value_type>); ```</value_type>
:902
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.
将一个范围内的元素插入容器中。当且仅当容器中没有具有等价键的元素时，才会插入这些元素。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, 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 to be greater than the maximum load.
要求：`value_type` 可以在容器中进行 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。
抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:909
---
---
Insert Node
节点插入
```c++ insert_return_type insert(node_type&& nh); ```
```c++ insert_return_type insert(node_type&amp;&amp; nh); ```
If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.value()`. `nh` is empty when the function returns.
如果 `nh` 非空，则当且仅当容器中没有键与 `nh.value()` 等价的元素时，才将关联的元素插入容器。函数返回时 `nh` 变为空。
Returns:;; An `insert_return_type` object constructed from `position`, `inserted` and `node`: +
返回：一个 `insert_return_type` 对象，由 `position`、`inserted` 和 `node` 构造而成：
If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` ， `position` 为 `end()` ，且 `node` 为空。
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
否则，若插入操作发生，则 `inserted` 为 `true` ， `position` 指向被插入的元素，且 `node` 为空。
If the insertion failed, `inserted` is false, `node` has the previous value of `nh`, and `position` points to an element with a key equivalent to `nh.value()`.
若插入操作失败，则 `inserted` 为 `false` ， `node` 保留 `nh` 的原始值，且 `position` 指向一个键等价于 `nh.value()` 的元素。
Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
如果 `nh` 非空，则当且仅当容器中不存在键等价于 `nh.value()` 的元素时，插入其关联的元素。函数返回时， `nh` 为空。
:927
---
---
Insert Node with Hint
带提示的节点插入
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&amp;&amp; nh); ```
If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.value()`. `nh` becomes empty if insertion took place, otherwise it is not changed.
如果 `nh` 非空，则当且仅当容器中没有键与 `nh.value()` 等价的元素时，才将关联的元素插入容器。如果插入发生，则 `nh` 变为空；否则 `nh` 不变。
:937
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion took place, then the iterator points to the newly inserted element; otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
返回：如果 `nh` 为空，则返回的迭代器为 `end()`。如果插入发生，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：如果 `nh` 非空且 `nh` 与容器的分配器不相等，则行为未定义。
:945
---
---
Erase by Position
通过位置擦除
Erase the element pointed to by `position`.
擦除由 `position` 指向的元素。
Returns:;; An opaque object implicitly convertible to the `iterator` or `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to `iterator` or `const_iterator`.
返回;; 返回一个不透明对象，该对象可隐式转换为擦除前紧接在 `position` 之后的 `iterator` 或 `const++_++iterator` 。 抛出;; 无。 注意;; 返回的不透明对象必须被立即丢弃或转换为 `iterator` 或 `const++_++iterator` 。
:963
---
---
Erase by Key
通过键擦除
```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>
English Chinese (Simplified Han script) Actions
Extracts the element with key equivalent to `k`, if it exists.
提取键与 `k` 等价的元素（如果存在）。
pull
pull
```c++ init_type pull(const_iterator position); ```
```c++ init_type pull(const_iterator position); ```
Returns:;; A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns `std::make_pair(b.end(), b.end())`. Notes:;; The `template<class K>` 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.
返回：包含所有键与 `k` 等价的元素的范围。如果容器不包含任何此类元素，则返回 `std::make_pair(b.end(), b.end())`。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
- It has an `InputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an `Allocator` template parameter and a type that does not qualify as an allocator is deduced for that parameter. - It has a `Hash` template parameter and an integral type or a type that qualifies as an allocator is deduced for that parameter. - It has a `Pred` template parameter and a type that qualifies as an allocator is deduced for that parameter.
- 它具有一个 `InputIterator` 模板参数，并且为该参数推导出的类型不符合输入迭代器的要求。
- 它具有一个 `Allocator` 模板参数，并且为该参数推导出的类型不符合分配器的要求。
- 它具有一个 `Hash` 模板参数，并且为该参数推导出的类型是整数类型或符合分配器的要求。
- 它具有一个 `Pred` 模板参数，并且为该参数推导出的类型符合分配器的要求。
Equality Comparisons
相等性比较
```c++ iterator insert(const_iterator hint, const value_type& obj); ``` Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
```c++ iterator insert(const_iterator hint, const value_type&amp; obj); ```当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
```c++ std::pair<iterator, bool> insert(const value_type& obj); ```
```c++ std::pair<iterator, bool=""> insert(const value_type&amp; obj); ```</iterator,>
```c++ insert_return_type insert(node_type&& nh); ```
```c++ insert_return_type insert(node_type&amp;&amp; nh); ```
```c++ std::pair<iterator, bool> insert(value_type&& obj); ```
```c++ std::pair<iterator, bool=""> insert(value_type&amp;&amp; obj); ```</iterator,>
```c++ template<class K> std::pair<iterator, bool> insert(K&& k); ```
```c++ template<class k=""> std::pair<iterator, bool=""> insert(K&amp;&amp; k); ```</iterator,></class>
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from `*first`. Throws:;; When inserting a single element, 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 to be greater than the maximum load.
要求：`value_type` 可以从 `*first` 出发在容器中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。
抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
Copy Insert with Hint
带提示的复制插入
Insert Node
节点插入
If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` ， `position` 为 `end()` ，且 `node` 为空。
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
否则，若插入操作发生，则 `inserted` 为 `true` ， `position` 指向被插入的元素，且 `node` 为空。
If the insertion failed, `inserted` is false, `node` has the previous value of `nh`, and `position` points to an element with a key equivalent to `nh.value()`.
若插入操作失败，则 `inserted` 为 `false` ， `node` 保留 `nh` 的原始值，且 `position` 指向一个键等价于 `nh.value()` 的元素。
Insert Node with Hint
带提示的节点插入
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&amp;&amp; nh); ```
Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion took place, then the iterator points to the newly inserted element; otherwise, it points to the element with equivalent key. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
返回：如果 `nh` 为空，则返回的迭代器为 `end()`。如果插入发生，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：如果 `nh` 非空且 `nh` 与容器的分配器不相等，则行为未定义。
Erase by Position
通过位置擦除
Returns:;; An opaque object implicitly convertible to the `iterator` or `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to `iterator` or `const_iterator`.
返回;; 返回一个不透明对象，该对象可隐式转换为擦除前紧接在 `position` 之后的 `iterator` 或 `const++_++iterator` 。 抛出;; 无。 注意;; 返回的不透明对象必须被立即丢弃或转换为 `iterator` 或 `const++_++iterator` 。
Erase by Key
通过键擦除
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>
```c++ iterator erase(const_iterator first, const_iterator last); ```
```c++ iterator erase(const_iterator first, const_iterator last); ```
Returns:;; The iterator following the erased elements - i.e. `last`. Throws:;; Nothing in this implementation (neither the `hasher` nor the `key_equal` objects are called).
返回：被擦除元素之后的迭代器——即 `last`。
抛出：在此实现中不抛出任何异常（既不调用 `hasher` 也不调用 `key_equal` 对象）。
```c++ void swap(unordered_node_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```
```c++ void swap(unordered_node_set&amp; other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value || boost::allocator_traits<allocator>::propagate_on_container_swap::value); ```</allocator></allocator>
Swaps the contents of the container with the parameter.
交换容器的内容与参数的内容。
Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping.
抛出：除非 `key_equal` 或 `hasher` 在交换时抛出异常，否则不抛出任何异常。
Extract by Position
通过位置提取

Loading…

User avatar admin

Translation uploaded
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
Otherwise if the insertion took place,否则，若插入操作发生，则 `inserted` is 为 `true,` ， `position` points to the inserted element, and `node` is empty.指向被插入的元素，且 `node` 为空。
06/05/2026
User avatar admin

String added in the repository
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
06/05/2026
Browse all string changes

Glossary

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

String information

Flags
safe-html, strict-same
Unit identifier
52576
Source string location
:922
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_node_set_zh_Hans.adoc, string 232