Zen

Translation

Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
97/1830 · 183

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
```c++ template<class K, class H, class P, class A, class Predicate> typename unordered_set<K, H, P, A>::size_type erase_if(unordered_set<K, H, P, A>& c, Predicate pred); ```
```c++ template<class k,="" class="" h,="" p,="" a,="" predicate=""> typename unordered_set<k, h,="" p,="" a="">::size_type erase_if(unordered_set<k, h,="" p,="" a="">&amp; c, Predicate pred); ```</k,></k,></class>
Traverses the container `c` and removes all elements for which the supplied predicate returns `true`.
遍历容器 `c`，并移除所有使得给定谓词返回 `true` 的元素。
Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return original_size - c.size(); ```
返回：被擦除的元素数量。注意：等价于：auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return original_size - c.size();
Serialization
序列化
``unordered_set``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.
`unordered++_++set` 可通过本库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization] 实现序列化存档与读取功能。同时支持常规格式与 XML 格式的归档。
Saving an unordered_set to an archive
将 unordered++_++set 保存到归档
Saves all the elements of an `unordered_set` `x` to an archive (XML archive) `ar`.
将 `unordered++_++set` 对象 `x` 的所有元素保存到归档（XML 归档） `ar` 中。
Requires:;; `value_type` is serializable (XML serializable), and it supports Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types).
要求;; `value++_++type` 必须可序列化（支持 XML 序列化），且需要支持 Boost.Serialization 的 `save++_++construct++_++data` / `load++_++construct++_++data` 协议（该协议自动支持满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求的类型）。
:1517
---
---
Loading an unordered_set from an archive
从归档加载 unordered++_++set
Deletes all preexisting elements of an `unordered_set` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_set` `other` saved to the storage read by `ar`.
删除 `unordered++_++set` 对象 `x` 的所有预先存在的元素，并从归档（XML 归档） `ar` 中读取原始 `unordered++_++set` 对象 `other` 先前保存至存储的元素副本并插入到 `x` 中。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. `x.key_equal()` is functionally equivalent to `other.key_equal()`. Note:;; If the archive was saved using a release of Boost prior to Boost 1.84, the configuration macro `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` has to be globally defined for this operation to succeed; otherwise, an exception is thrown.
要求;; `value++_++type` 需满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[可移动插入] 要求，且 `x.key++_++equal()` 在功能上需等价于 `other.key++_++equal()` 。 注意;; 若归档文件是使用 Boost 1.84 之前的版本保存的，则必须全局定义配置宏 `BOOST++_++UNORDERED++_++ENABLE++_++SERIALIZATION++_++COMPATIBILITY++_++V0` 才能成功执行此操作；否则将抛出异常。
:1532
---
---
Saving an iterator/const_iterator to an archive
将迭代器/常量迭代器保存到归档
Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.
将 `iterator` （ `const++_++iterator` ）常量迭代器 `it` 的位置信息保存到归档（XML 归档） `ar` 中。 `it` 可以是 `end()` 迭代器。
Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
要求;; 迭代器 `it` 指向的 `unordered++_++set` `x` 必须已预先保存至归档 `ar` ，且在保存 `x` 和保存 `it` 的时间间隔内 `x` 执行任何修改操作。
:1544
---
---
Loading an iterator/const_iterator from an archive
从归档加载迭代器/常量迭代器
Makes an `iterator` (`const_iterator`) `it` point to the restored position of the original `iterator` (`const_iterator`) saved to the storage read by an archive (XML archive) `ar`.
使 `iterator` （ `const++_++iterator` ） `it` 指向原始 `iterator` （ `const++_++iterator` ）所恢复的位置。该原始迭代器已被保存到由归档（XML 归档） `ar` 读取的存储中。
Requires:;; If `x` is the `unordered_set` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.
要求;; 如果 `x` 是 `it` 指向的 `unordered++_++set` ，则在加载 `x` 与加载 `it` 的时间间隔内，不得对 `x` 执行任何修改操作。
English Chinese (Simplified Han script) Actions
empty
空
```c++ [[nodiscard]] bool empty() const noexcept; ```
```c++ [[nodiscard]] bool empty() const noexcept; ```
Returns:;; `size() == 0`
返回：`size() == 0`
size
大小
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
explicit unordered_set(size_type n, const hasher&amp; hf = hasher(), const key_equal&amp; eql = key_equal(), const allocator_type&amp; a = allocator_type());
Iterator Range Constructor
迭代器范围构造函数
```c++ size_type size() const noexcept; ```
```c++ size_type size() const noexcept; ```
Returns:;; `std::distance(begin(), end())`
返回：`std::distance(begin(), end())`
max_size
max_size
```c++ size_type max_size() const noexcept; ```
```c++ size_type max_size() const noexcept; ```
Returns:;; `size()` of the largest possible container.
返回：可能的最大容器的 `size()`。
Modifiers
修改器
emplace
原地构造
```c++ template<class... Args> std::pair<iterator, bool> emplace(Args&&... args); ```
```c++ template<class... args=""> std::pair<iterator, bool=""> emplace(Args&amp;&amp;... args); ```</iterator,></class...>
Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.
将 `iterator` （ `const++_++iterator` ）常量迭代器 `it` 的位置信息保存到归档（XML 归档） `ar` 中。 `it` 可以是 `end()` 迭代器。
Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
要求;; 迭代器 `it` 指向的 `unordered++_++set` `x` 必须已预先保存至归档 `ar` ，且在保存 `x` 和保存 `it` 的时间间隔内 `x` 执行任何修改操作。
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, `a` as the allocator and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `eql` 作为键相等性谓词、 `a` 作为分配器，将最大负载因子设为 `1.0` ，并将区间 `++[++f, l)` 中的元素插入其中。
Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move-constructible.
说明：;; 该实现使用 Boost.Move。要求：;; `value_type` 需满足可移动构造要求。
Iterator Range Constructor with Allocator
带分配器的迭代器范围构造函数
```c++ template<class InputIterator> unordered_set(InputIterator f, InputIterator l, const allocator_type& a); ```
```c++ template<class inputiterator=""> unordered_set(InputIterator f, InputIterator l, const allocator_type&amp; a); ```</class>
Allocator Constructor
分配器构造函数
Copy Constructor with Allocator
带分配器的复制构造函数
Constructs an container, copying ``other``'s contained elements, hash function, predicate, maximum load factor, but using allocator `a`.
构造一个容器，移动 `other` 中所包含的元素，并获取其哈希函数、谓词及最大负载因子，但使用分配器 `a` 。
```c++ unordered_set(unordered_set&& other, const Allocator& a); ```
```c++ unordered_set(unordered_set&amp;&amp; other, const Allocator&amp; a); ```
Construct a container moving ``other``'s contained elements, and having the hash function, predicate and maximum load factor, but using allocate `a`.
构造一个容器，移动 `other` 中所包含的元素，并获取其哈希函数、谓词及最大负载因子，但使用分配器 `a` 。
Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move insertable.
说明：该实现使用 Boost.Move。要求：`value_type` 需满足可移动插入要求。
Bucket Count Constructor with Allocator
带分配器的桶数构造函数
```c++ unordered_set(size_type n, const allocator_type& a); ```
```c++ unordered_set(size_type n, const allocator_type&amp; a); ```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数（应为默认哈希函数）、默认的键相等性谓词、 `a` 作为分配器，并设置最大负载因子为 `1.0` 。
Transparent Insert
透明插入

Loading…

User avatar admin

Translation uploaded
Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
Requires:;; The要求;; 迭代器 `it` 指向的 `unordered_++_++set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.必须已预先保存至归档 `ar` ，且在保存 `x` 和保存 `it` 的时间间隔内 `x` 执行任何修改操作。
06/05/2026
User avatar admin

String added in the repository
Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
Requires:;; The `unordered_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
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
51261
Source string location
:1540
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 426