Zen

Translation

If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
80/1400 · 140

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Constructs an empty container using `hasher()` as the hash function, `key_equal()` as the key equality predicate, `allocator_type()` as the allocator and a maximum load factor of `1.0`.
使用 `hasher()` 作为哈希函数，`key_equal()` 作为键相等谓词，`allocator_type()` 作为分配器，以及最大负载因子 `1.0` 构造一个空容器。
:342
Postconditions:;; `size() == 0` 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^].
后置条件：`size() == 0`
要求：如果使用默认值，则 `hasher`、`key_equal` 和 `allocator_type` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:345
---
---
Bucket Count Constructor
桶数构造函数
```c++ explicit unordered_multiset(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```
```c++ explicit unordered_multiset(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```
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`.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器，以及最大负载因子 `1.0`。
:360
Postconditions:;; `size() == 0` 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^].
后置条件：`size() == 0`
要求：如果使用默认值，则 `hasher`、`key_equal` 和 `allocator_type` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:363
---
---
Iterator Range 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 `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器，以及最大负载因子 `1.0`，并将 `[f, l)` 范围内的元素插入其中。
:379
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[可默认构造^]。
:381
---
---
Copy Constructor
复制构造函数
```c++ unordered_multiset(const unordered_multiset& other); ```
```c++ unordered_multiset(const unordered_multiset& other); ```
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
拷贝构造函数。拷贝所包含的元素、哈希函数、谓词、最大负载因子和分配器。
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
如果 `Allocator::select_on_container_copy_construction` 存在且具有正确的签名，则分配器将根据其结果进行构造。
:393
Requires:;; `value_type` is copy constructible
要求：`value_type` 可拷贝构造。
:395
---
---
Move Constructor
移动构造函数
```c++ unordered_multiset(unordered_multiset&& other); ```
```c++ unordered_multiset(unordered_multiset&& other); ```
The move constructor.
移动构造函数。
Notes:;; This is implemented using Boost.Move. Requires:;; `value_type` is move-constructible.
注意：此函数使用 Boost.Move 实现。
要求：`value_type` 可移动构造。
:408
---
---
Iterator Range Constructor with Allocator
带分配器的迭代器范围构造函数
```c++ template<class InputIterator> unordered_multiset(InputIterator f, InputIterator l, const allocator_type& a); ```
```c++ template<class inputiterator=""> unordered_multiset(InputIterator f, InputIterator l, const allocator_type&amp; 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)` 范围内的元素插入其中。
:419
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[可默认构造^]。
:421
---
---
Allocator Constructor
分配器构造函数
```c++ explicit unordered_multiset(const Allocator& a); ```
```c++ explicit unordered_multiset(const Allocator&amp; a); ```
Constructs an empty container, using allocator `a`.
使用分配器 `a` 构造一个空容器。
English Chinese (Simplified Han script) Actions
Returns:;; The container's hash function.
返回：容器的哈希函数对象。
bucket
桶
Set max_load_factor
设置最大负载因子
rehash
重哈希
reserve
保留
Loading an unordered_multiset from an archive
从归档加载 unordered_multiset
Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.
将迭代器（或常量迭代器）`it` 的位置信息保存到归档（XML 归档）`ar` 中。`it` 可以是一个 `end()` 迭代器。
A binary function object that implements an equivalence relation on values of type `Key`. A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type bool.
一个二元函数对象，用于在 `Key` 类型的值上实现等价关系。它接受两个 `Key` 类型的参数，并返回一个 `bool` 类型的值。
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
支持使用 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[异形指针] 的分配器。
The elements are organized into buckets. Keys with the same hash code are stored in the same bucket and elements with equivalent keys are stored next to each other.
元素被组织到桶中。具有相同哈希码的键存储在同一桶中，并且具有等价键的元素彼此相邻存储。
The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.
桶的数量可以通过调用 insert 自动增加，或者作为调用 rehash 的结果。
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
Globally define this macro to support loading of ``unordered_multiset``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84.
全局定义此宏以支持加载由 Boost 1.84 之前版本的 Boost 保存到 Boost.Serialization 归档中的 `unordered_multiset`。
Convertible to `const_iterator`.
可转换为 `const_iterator` 。
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
拷贝构造函数。拷贝所包含的元素、哈希函数、谓词、最大负载因子和分配器。
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
如果 `Allocator::select_on_container_copy_construction` 存在且具有正确的签名，则分配器将根据其结果进行构造。
```c++ unordered_multiset(const unordered_multiset& other, const Allocator& a); ```
```c++ unordered_multiset(const unordered_multiset&amp; other, const Allocator&amp; a); ```
Constructs an container, copying ``other``'s contained elements, hash function, predicate, maximum load factor, but using allocator `a`.
构造一个容器，拷贝 `other` 所包含的元素、哈希函数、谓词和最大负载因子，但使用分配器 `a`。
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` 中的元素插入其中。
Extract by Value
按值提取
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[可默认构造^]。
Bucket Count Constructor with Hasher and Allocator
带哈希函数和分配器的桶数构造函数
```c++ unordered_multiset(size_type n, const hasher& hf, const allocator_type& a); ```
```c++ unordered_multiset(size_type n, const hasher&amp; hf, const allocator_type&amp; a); ```
Assignment
赋值操作
Copy Assignment
复制赋值
Move Assignment
移动赋值
If `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`, the allocator is overwritten, if not the moved elements are created using the existing allocator.
如果 `Alloc::propagate_on_container_move_assignment` 存在且 `Alloc::propagate_on_container_move_assignment::value` 为 `true`，则分配器会被覆盖；否则，移动的元素将使用现有的分配器创建。
Requires:;; `value_type` is move constructible.
要求：`value_type` 可移动构造。
```c++ unordered_multiset& operator=(std::initializer_list<value_type> il); ```
```c++ unordered_multiset&amp; operator=(std::initializer_list<value_type> il); ```</value_type>
Assign from values in initializer list. All existing elements are either overwritten by the new elements or destroyed.
从初始化列表中的值进行赋值。所有现有元素要么被新元素覆盖，要么被销毁。

Loading…

User avatar admin

Translation uploaded
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
If如果 `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.存在且具有正确的签名，则分配器将根据其结果进行构造。
06/05/2026
User avatar admin

String added in the repository
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.
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
54591
Source string location
:390
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 56