Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Multiset (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: A `size_type` parameter type in a deduction guide refers to …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	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)` 将释放底层的桶数组。
:1304	Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.	使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
:1307	Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.	当 `size() == 0` 时， `rehash(0)` 将释放底层桶数组。
:1309	---	---
	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` 类似，此函数可用于增大或缩小容器中的桶数量。
:1320	Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.	使迭代器失效，并改变元素的顺序。指向元素的指针和引用不会失效。
:1323	Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.	抛出：如果抛出异常（除非是由容器的哈希函数或比较函数抛出的），则该函数无效果。
:1326	---	---
	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	运算符
	```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const unordered_multiset<Key, Hash, Pred, Alloc>& x, const unordered_multiset<Key, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator==(const unordered_multiset<key, hash,="" pred,="" alloc="">& x, const unordered_multiset<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`。
:1360	Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.	注意：如果两个容器不具有等价的相等谓词，则行为未定义。
:1362	---	---
	operator!	operator!
	```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator!=(const unordered_multiset<Key, Hash, Pred, Alloc>& x, const unordered_multiset<Key, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator!=(const unordered_multiset<key, hash,="" pred,="" alloc="">& x, const unordered_multiset<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`。
:1374	Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates.	注意：如果两个容器不具有等价的相等谓词，则行为未定义。
:1376	---	---
	Swap	交换
	```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(unordered_multiset<Key, Hash, Pred, Alloc>& x, unordered_multiset<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```	```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> void swap(unordered_multiset<key, hash,="" pred,="" alloc="">& x, unordered_multiset<key, hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
	Swaps the contents of `x` and `y`.	交换 `x` 和 `y` 的内容。

	English	Chinese (Simplified Han script)	Actions
	```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```	```c++ bool contains(const key_type& k) const; template<class k=""> bool contains(const K& k) const; ```</class>
	Returns:;; A boolean indicating whether or not there is an element with key equal to `key` in the container Notes:;; The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.	返回：一个布尔值，指示容器中是否存在键等于 `key` 的元素。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ```	```c++ std::pair<iterator, iterator=""> equal_range(const key_type& k); std::pair<const_iterator, const_iterator=""> equal_range(const key_type& k) const; template<class k=""> std::pair<iterator, iterator=""> equal_range(const K& k); template<class k=""> std::pair<const_iterator, const_iterator=""> equal_range(const K& k) const; ```</const_iterator,></class></iterator,></class></const_iterator,></iterator,>
	```c++ size_type bucket_count() const noexcept; ```	```c++ size_type bucket_count() const noexcept; ```
	Returns:;; The number of buckets.	返回：桶的数量。
	Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`.	Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`.
	Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. Notes:;; The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.	返回：将包含键为 `k` 的元素的桶的索引。后置条件：返回值小于 `bucket_count()`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	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` 的桶中第一个元素的局部迭代器。
	```c++ const_local_iterator cbegin(size_type n) const; ```	```c++ const_local_iterator cbegin(size_type n) const; ```
	Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the first element in the bucket with index `n`.	要求：`n` 必须在 `[0, bucket_count())` 范围内。返回：指向索引为 `n` 的桶中第一个元素的常量局部迭代器。
	```c++ void max_load_factor(float z); ```	```c++ void max_load_factor(float z); ```
	Effects:;; Changes the container's maximum load factor, using `z` as a hint.	效果：使用 `z` 作为提示，更改容器的最大负载因子。
	When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.	当 `size() == 0` 时，`rehash(0)` 将释放底层的桶数组。
	Deduction Guides	推导指引
	- 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` 成员类型。其默认值与所选构造函数的默认值一致。
	Swap	交换
	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 标准不完全相同，因为相等谓词和哈希函数是使用其拷贝构造函数进行交换的。
	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 归档需支持 XML 序列化），并且支持 Boost.Serialization 的 `save_construct_data`/`load_construct_data` 协议（该协议由满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^] 的类型自动支持）。
	Deletes all preexisting elements of an `unordered_multiset` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_multiset` `other` saved to the storage read by `ar`.	删除 `unordered_multiset` 容器 `x` 中所有已存在的元素，并从归档（XML 归档）`ar` 中插入从原始 `unordered_multiset` 容器 `other` 保存到 `ar` 所读取存储中的元素恢复出的副本。
	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 保存的，则必须全局定义配置宏 `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` 才能使此操作成功；否则，将抛出异常。
	Saving an iterator/const_iterator to 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`.	使迭代器（或常量迭代器）`it` 指向原始迭代器（或常量迭代器）被保存到归档（XML 归档）`ar` 所读取存储中的位置恢复后的位置。
	`boost::unordered_multiset` — An unordered associative container that stores values. The same key can be stored multiple times.	`boost::unordered_multiset` — 一个存储值的无序关联容器。同一个键可以多次存储。
	Synopsis	概要
	Description	描述
	Template Parameters	模板参数
	_Key_	_键_
	_Hash_	_Hash_
	A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.	一个一元函数对象类型，用作 `Key` 的哈希函数。它接受一个 `Key` 类型的参数，并返回一个 `std::size_t` 类型的值。

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

54913

Source string location

:1336

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_multiset_zh_Hans.adoc, string 378

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