Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Notes:;; This is implemented using Boost.Move. Requires:;; `value

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```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& a); ```</class>
	Constructs an empty container 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.	构造一个空容器，使用 `a` 作为分配器、默认的哈希函数和键相等性谓词，并将最大负载因子设为 `1.0` ，然后将 `[f, l)` 范围内的元素插入其中。
:443	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[可默认构造^]要求。
:445	---	---
	Allocator Constructor	分配器构造函数
	```c++ explicit unordered_set(const Allocator& a); ```	```c++ explicit unordered_set(const Allocator& a); ```
	Constructs an empty container, using allocator `a`.	构造一个空容器，使用分配器 `a`。
:454	---	---
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```	```c++ unordered_set(const unordered_set& other, const Allocator& a); ```
	Constructs an container, copying ``other``'s contained elements, hash function, predicate, maximum load factor, but using allocator `a`.	构造一个容器，移动 `other` 中所包含的元素，并获取其哈希函数、谓词及最大负载因子，但使用分配器 `a` 。
:463	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ unordered_set(unordered_set&& other, const Allocator& a); ```	```c++ unordered_set(unordered_set&& other, const Allocator& 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` 需满足可移动插入要求。
:476	---	---
	Initializer List Constructor	初始化列表构造函数
	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 `il` into it.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `eql` 作为键相等性谓词、及 `a` 作为分配器，并设置最大负载因子为 `1.0` ，随后将 `il` 中的元素插入该容器。
:491	Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	要求;; 若使用默认值，则 `hasher` 、 `key++_++equal` 和 `allocator++_++type` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:493	---	---
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ unordered_set(size_type n, const allocator_type& a); ```	```c++ unordered_set(size_type n, const allocator_type& 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` 。
	Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：`size() == 0` 要求：`hasher` 和 `key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:506	---	---
	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& hf, const allocator_type& 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` 。
	Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：size() == 0 要求：key_equal 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]要求。
:519	---	---

	English	Chinese (Simplified Han script)	Actions
	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&&... 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& 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&& other, const Allocator& 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& 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&& 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& hf, const allocator_type& 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	带桶数和哈希函数的迭代器范围构造函数

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 67 characters editedCurrent translationState: Translated

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 91 characters editedPrevious translationState: Needs editing (Needs rewriting)

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

50918

Source string location

:473

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 83

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Translation

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file