Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: A deduction guide will not participate in overload resolution if …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1373	---	---
	rehash	重哈希
	```c++ void rehash(size_type n); ```	```c++ void rehash(size_type n); ```
	Changes the number of buckets so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container.	改变桶的数量，使其至少为 `n` 个，并确保负载因子小于或等于最大负载因子。此操作将根据情况增加或减少容器关联的 `bucket_count()` 。
	When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.	当 `size() == 0` 时，`rehash(0)` 将释放底层桶数组。
:1384	Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.	使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
: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 > 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="">& x, const unordered_set<key, hash,="" pred,="" alloc="">& 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="">& x, const unordered_set<key, hash,="" pred,="" alloc="">& 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	交换

	English	Chinese (Simplified Han script)	Actions
	Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the first element in the bucket with index `n`.	要求：`n` 应在 `[0, bucket_count())` 范围内。返回：指向索引为 `n` 的桶中第一个元素的局部迭代器。
	Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the 'one past the end' element in the bucket with index `n`.	要求：`n` 应在 `[0, bucket_count())` 范围内。返回：指向索引为 `n` 的桶中“尾后”元素的局部迭代器。
	```c++ const_local_iterator cbegin(size_type n) const; ```	```c++ const_local_iterator cbegin(size_type n) const; ```
	```c++ const_local_iterator cend(size_type n) const; ```	```c++ const_local_iterator cend(size_type n) const; ```
	Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.	要求：`n` 应在 `[0, bucket_count())` 范围内。返回：指向索引为 `n` 的桶中“尾后”元素的常量局部迭代器。
	load_factor	负载因子
	```c++ float load_factor() const noexcept; ```	```c++ float load_factor() const noexcept; ```
	Returns:;; The average number of elements per bucket.	返回：每个桶的平均元素数量。
	max_load_factor	max_load_factor
	```c++ float max_load_factor() const noexcept; ```	```c++ float max_load_factor() const noexcept; ```
	Effects:;; Changes the container's maximum load factor, using `z` as a hint.	效果：使用 `z` 作为提示，更改容器的最大负载因子。
	```c++ void rehash(size_type n); ```	```c++ void rehash(size_type n); ```
	Changes the number of buckets so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container.	改变桶的数量，使其至少为 `n` 个，并确保负载因子小于或等于最大负载因子。此操作将根据情况增加或减少容器关联的 `bucket_count()` 。
	```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 > 0` 且 `a.max_load_factor() == std::numeric_limits<float>::infinity()` 则等价于 `a.rehash(1)`。</float>
	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` 成员类型。其默认值与所选构造函数的默认值一致。
	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`。
	operator!	operator!
	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="">& x, unordered_set<key, hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
	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 标准并不完全相同。
	erase_if	erase_if
	```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="">& c, Predicate pred); ```</k,></k,></class>
	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();
	``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[可默认构造] 要求的类型）。

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 95 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

51224

Source string location

:1407

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 389

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