Zen

Translation

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`.
71/1820 · 182

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
```c++ unordered_multiset(unordered_multiset&& other, const Allocator& a); ```
```c++ unordered_multiset(unordered_multiset&& 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` 可移动插入。
:452
---
---
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` 中的元素插入其中。
:467
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[可默认构造^]。
:469
---
---
Bucket Count Constructor with Allocator
带分配器的桶数构造函数
```c++ unordered_multiset(size_type n, const allocator_type& a); ```
```c++ unordered_multiset(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[可默认构造^]。
:482
---
---
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& 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[可默认构造^]。
:495
---
---
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)` 范围内的元素插入其中。
:507
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[可默认构造] 要求。
:509
---
---
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)` 中的元素插入该容器。
:522
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[可默认构造] 要求。
:524
---
---
initializer_list Constructor with Allocator
带分配器的初始化列表构造函数
```c++ unordered_multiset(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_multiset(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` 中的元素插入其中。
:535
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[可默认构造^]。
:537
---
---
English Chinese (Simplified Han script) Actions
`Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`Key` 必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^]（即 `allocator_traits` 能够销毁它）。
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_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)` 范围内的元素插入其中。
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` 构造一个空容器。
Move Constructor with Allocator
带分配器的移动构造函数
```c++ unordered_multiset(unordered_multiset&& other, const Allocator& a); ```
```c++ unordered_multiset(unordered_multiset&amp;&amp; other, const Allocator&amp; 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_multiset(size_type n, const allocator_type& a); ```
```c++ unordered_multiset(size_type n, const allocator_type&amp; 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`。
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[可默认构造^]。
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)` 范围内的元素插入其中。
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)` 中的元素插入该容器。
initializer_list Constructor with Allocator
带分配器的初始化列表构造函数
```c++ unordered_multiset(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_multiset(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_multiset(std::initializer_list<value_type> il, size_type n, const allocator_type& a) ```
```c++ unordered_multiset(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` 中的元素插入其中。
```c++ size_type size() const noexcept; ```
```c++ size_type size() const noexcept; ```
Returns:;; `std::distance(begin(), end())`
返回：`std::distance(begin(), end())`。
max_size
max_size

Loading…

User avatar admin

Translation uploaded
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`.
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构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，使用默认的键相等谓词，`a` 作为分配器，以及最大负载因子 `1.0`.。
06/05/2026
User avatar admin

String added in the repository
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`.
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`.
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
54628
Source string location
:489
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 93