Zen

Translation

```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
231/1800 · 180

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
:1387
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.
抛出：若抛出异常（除非由容器的哈希函数或比较函数抛出），则该函数无效果。
:1389
---
---
reserve
保留
```c++ void reserve(size_type n); ```
```c++ void reserve(size_type n); ```
Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if `n > 0` and `a.max_load_factor() == std::numeric_limits<float>::infinity()`.
等价于 `a.rehash(ceil(n / a.max_load_factor()))`，若 `n &gt; 0` 且 `a.max_load_factor() == std::numeric_limits<float>::infinity()` 则等价于 `a.rehash(1)`。</float>
Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the container.
与 `rehash` 类似，该函数可用于增加或减少容器中的桶数量。
:1400
Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.
使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
:1403
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.
抛出：若抛出异常（除非由容器的哈希函数或比较函数抛出），则该函数无效果。
Deduction Guides
推导指引
A deduction guide will not participate in overload resolution if any of the following are true:
如果以下任何一条件为真，则推导指引将不参与重载决议：
- 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` 模板参数，且为该参数推导出的类型符合分配器要求。
A `size_­type` parameter type in a deduction guide refers to the `size_­type` member type of the container type deduced by the deduction guide. Its default value coincides with the default value of the constructor selected.
推导指引中的 `size++_++type` 参数类型，指向由该推导指引所推导容器类型的 `size++_++type` 成员类型。其默认值与所选构造函数的默认值一致。
__iter-value-type__
__iter-value-type__
Equality Comparisons
相等性比较
operator
operator
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator==(const unordered_set<key, hash,="" pred,="" alloc="">&amp; x, const unordered_set<key, hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
Return `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).
如果 `x.size() == y.size()` 且对于 `x` 中的每个元素，在 `y` 中均存在一个具有相同键且值相等（使用 `operator==` 比较值类型）的元素，则返回 `true`。
:1438
Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.
说明：如果两个容器的相等谓词不等价，则行为未定义。
:1440
---
---
operator!
operator!
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator!=(const unordered_set<key, hash,="" pred,="" alloc="">&amp; x, const unordered_set<key, hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
Return `false` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).
如果 `x.size() == y.size()` 且对于 `x` 中的每个元素，在 `y` 中均存在一个具有相同键且值相等（使用 `operator==` 比较值类型）的元素，则返回 `false`。
:1452
Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.
注意：如果两个容器的相等谓词不等价，则行为未定义。
:1454
---
---
Swap
交换
```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(unordered_set<Key, Hash, Pred, Alloc>& x, unordered_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> void swap(unordered_set<key, hash,="" pred,="" alloc="">&amp; x, unordered_set<key, hash,="" pred,="" alloc="">&amp; y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
Swaps the contents of `x` and `y`.
交换 `x` 和 `y` 的内容。
:1466
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`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.
效果：`x.swap(y)` 抛出：除非 `key_equal` 或 `hasher` 的复制构造函数或复制赋值运算符抛出异常，否则不会抛出异常。 注意：由于相等谓词和哈希函数是通过它们的复制构造函数进行交换的，因此异常规范与 C++11 标准并不完全相同。
:1473
---
---
erase_if
erase_if
English Chinese (Simplified Han script) Actions
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
透明插入
```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>
Bucket Count Constructor with Hasher and Allocator
带哈希函数和分配器的桶数构造函数
```c++ unordered_set(size_type n, const hasher& hf, const allocator_type& a); ```
```c++ unordered_set(size_type n, const hasher&amp; hf, const allocator_type&amp; a); ```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、默认的键相等性谓词、 `a` 作为分配器，并设置最大负载因子为 `1.0` 。
Iterator Range Constructor with Bucket Count and Allocator
带桶数和分配器的迭代器范围构造函数
Extract by Value
通过键值提取元素
Removes an element with key equivalent to `k`.
移除键等价于 `k` 的元素。
```c++ void quick_erase(const_iterator position); ```
```c++ void quick_erase(const_iterator position); ```
Constructs an empty container with at least `n` buckets, using `a` as the allocator, with the default hash function and key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器、默认的哈希函数和键相等性谓词，并设置最大负载因子为 `1.0` ，随后将区间 `++[++f, l)` 中的元素插入该容器。
Iterator Range Constructor with Bucket Count and Hasher
带桶数和哈希函数的迭代器范围构造函数
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator==(const unordered_set<key, hash,="" pred,="" alloc="">&amp; x, const unordered_set<key, hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate and a maximum load factor of `1.0` and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、默认的键相等性谓词、 `a` 作为分配器，并设置最大负载因子为 `1.0` ，随后将区间 `++[++f, l)` 中的元素插入该容器。
initializer_list Constructor with Allocator
带分配器的初始化列表构造函数
```c++ unordered_set(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_set(std::initializer_list<value_type> il, const allocator_type&amp; a); ```</value_type>
Constructs an empty container using `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
使用 `a` 作为分配器构造一个空容器，设置最大负载因子为 1.0，并将 `il` 中的元素插入其中。
initializer_list Constructor with Bucket Count and Allocator
带桶数和分配器的初始化列表构造函数
```c++ unordered_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```
```c++ unordered_set(std::initializer_list<value_type> il, size_type n, const allocator_type&amp; a); ```</value_type>
Constructs an empty container with at least `n` buckets, using `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器，并设置最大负载因子为 1.0，随后将 `il` 中的元素插入该容器。
initializer_list Constructor with Bucket Count and Hasher and Allocator
带桶数、哈希函数和分配器的初始化列表构造函数
```c++ unordered_set(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```
```c++ unordered_set(std::initializer_list<value_type> il, size_type n, const hasher&amp; hf, const allocator_type&amp; a); ```</value_type>
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and a maximum load factor of 1.0 and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `a` 作为分配器，设置最大负载因子为 1.0，并将 `il` 中的元素插入其中。
Destructor
析构函数
```c++ ~unordered_set(); ```
```c++ ~unordered_set(); ```
Note:;; The destructor is applied to every element, and all memory is deallocated
注意：析构函数会应用于每个元素，并且所有内存都会被释放。
Assignment
赋值操作

Loading…

User avatar admin

Translation uploaded
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class Kkey,="" class Hash, class Pred, class A="" hash,="" pred,="" alloc=""> bool operator==(const unordered_set<Kkey, Hhash, Pred, Alloc>&="" pred,="" alloc="">&amp; x, const unordered_set<Kkey, Hhash, Pred, Alloc>& y); ```="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
06/05/2026
User avatar admin

String added in the repository
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ```
06/05/2026
Browse all string changes

Things to check

Consecutive duplicated words

The following word is duplicated: key,><

Reset

Glossary

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

String information

Flags
safe-html, strict-same
Unit identifier
51230
Source string location
:1429
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 395