Zen

Translation

:1008
English
---
3/100 · 3

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
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>
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>
:978
---
---
Erase Range
范围擦除
```c++ iterator erase(const_iterator first, const_iterator last); ```
```c++ iterator erase(const_iterator first, const_iterator last); ```
Erases the elements in the range from `first` to `last`.
擦除从 `first` 到 `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` 对象）。
:992
---
---
swap
交换
```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.
交换容器的内容与参数的内容。
:1003
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.
如果 `Allocator::propagate_on_container_swap` 被声明且 `Allocator::propagate_on_container_swap::value` 为 `true`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping.
抛出：除非 `key_equal` 或 `hasher` 在交换时抛出异常，否则不抛出任何异常。
:1008
---
---
Extract by Position
通过位置提取
```c++ node_type extract(const_iterator position); ```
```c++ node_type extract(const_iterator position); ```
Extracts the element pointed to by `position`.
提取 `position` 所指向的元素。
Returns:;; A `node_type` object holding the extracted element. Throws:;; Nothing.
返回：一个持有被提取元素的 `node_type` 对象。
抛出：不抛出任何异常。
:1021
---
---
Extract by Key
通过键提取
```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>
Extracts the element with key equivalent to `k`, if it exists.
提取键与 `k` 等价的元素（如果存在）。
Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. 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. 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` 对象；如果未提取到任何元素，则返回空。
抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时才参与重载决议。库假定 `Hash` 可同时用 `K` 和 `Key` 调用，并且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1036
---
---
pull
pull
```c++ init_type pull(const_iterator position); ```
```c++ init_type pull(const_iterator position); ```
Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`.
从 `position` 指向的元素移动构造一个 `init_value` 对象 `x`，擦除该元素并返回 `x`。
:1046
---
---
clear
清空
Key English Chinese (Simplified Han script) Actions
Constructs an empty container with at least `n` buckets, using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词，构造一个至少包含 `n` 个桶的空容器，并将 `il` 中的元素插入其中。
```c++ unordered_node_set& operator=(unordered_node_set const& other); ```
```c++ unordered_node_set&amp; operator=(unordered_node_set const&amp; other); ```
Copy Assignment
复制赋值
Assignment
赋值操作
Note:;; The destructor is applied to every element, and all memory is deallocated
注意：析构函数会应用于每个元素，并且所有内存都会被释放。
```c++ ~unordered_node_set(); ```
```c++ ~unordered_node_set(); ```
Destructor
析构函数
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `il` 中的元素插入其中。
```c++ unordered_node_set(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```
```c++ unordered_node_set(std::initializer_list<value_type> il, size_type n, const hasher&amp; hf, const allocator_type&amp; a); ```</value_type>
initializer_list Constructor with Bucket Count and Hasher and Allocator
带桶数、哈希函数和分配器的初始化列表构造函数
```c++ unordered_node_set(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_node_set(std::initializer_list<value_type> il, const allocator_type&amp; a); ```</value_type>
Constructs an empty container using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词构造一个空容器，并将 `il` 中的元素插入其中。
initializer_list Constructor with Bucket Count and Allocator
带桶数和分配器的初始化列表构造函数
```c++ unordered_node_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```
```c++ unordered_node_set(std::initializer_list<value_type> il, size_type n, const allocator_type&amp; a); ```</value_type>
:1003
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.
如果 `Allocator::propagate_on_container_swap` 被声明且 `Allocator::propagate_on_container_swap::value` 为 `true`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
:1008
---
---
:1021
---
---
:1036
---
---
:1046
---
---
:1058
---
---
:1076
---
---
:1088
---
---
:1098
---
---
:1108
---
---
:1125
---
---
:1138
---
---
:1151
---
---
:1167
---
---
:1179
---
---
:1191
---
---

Loading…

User avatar admin

Translation uploaded
---
---
:1008
06/05/2026
User avatar admin

String added in the repository
---
---
:1008
06/05/2026
Browse all string changes

Things to check

Unchanged translation

Source and translation are identical.

Reset

Glossary

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

String information

Key
:1008
Flags
safe-html, strict-same
Unit identifier
52605
Source string location
:1008
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 261