Zen

Translation

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.
67/1600 · 160

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Iterator Range Constructor with Bucket Count and Allocator
带桶数和分配器的迭代器范围构造函数
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)` 中的元素插入该容器。
:531
Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求;; `hasher` 和 `key++_++equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:533
---
---
Iterator Range Constructor with Bucket Count and Hasher
带桶数和哈希函数的迭代器范围构造函数
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)` 中的元素插入该容器。
:546
Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求;; `key++_++equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:548
---
---
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` 中的元素插入其中。
:559
Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:561
---
---
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` 中的元素插入该容器。
:572
Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:574
---
---
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` 中的元素插入其中。
:586
Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:588
---
---
Destructor
析构函数
```c++ ~unordered_set(); ```
```c++ ~unordered_set(); ```
Note:;; The destructor is applied to every element, and all memory is deallocated
注意：析构函数会应用于每个元素，并且所有内存都会被释放。
:599
---
---
Assignment
赋值操作
Copy Assignment
复制赋值
```c++ unordered_set& operator=(const unordered_set& other); ```
```c++ unordered_set&amp; operator=(const unordered_set&amp; other); ```
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
赋值运算符。该操作会复制容器内的元素、哈希函数、谓词及最大负载因子，但不会复制分配器。
English Chinese (Simplified Han script) Actions
```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
赋值操作
Copy Assignment
复制赋值
```c++ unordered_set& operator=(const unordered_set& other); ```
```c++ unordered_set&amp; operator=(const unordered_set&amp; other); ```
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
赋值运算符。该操作会复制容器内的元素、哈希函数、谓词及最大负载因子，但不会复制分配器。
If `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, the allocator is overwritten, if not the copied elements are created using the existing allocator.
若 `Alloc::propagate_on_container_copy_assignment` 存在且 `Alloc::propagate_on_container_copy_assignment::value` 为 `true`，则覆盖分配器；否则，将使用现有分配器创建复制的元素。
Move Assignment
移动赋值
Copy Insert
复制插入
Copy Insert with Hint
带提示的复制插入

Loading…

User avatar admin

Translation uploaded
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.
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` 中的元素插入该容器。
06/05/2026
User avatar admin

String added in the repository
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.
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.
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
50949
Source string location
:569
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 114