Zen

Translation

Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
34/640 · 64

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Allocator Constructor
分配器构造函数
```c++ explicit unordered_flat_set(Allocator const& a); ```
```c++ explicit unordered_flat_set(Allocator const& a); ```
Constructs an empty container, using allocator `a`.
构造一个空容器，使用分配器 `a`。
:405
---
---
Copy Constructor with Allocator
带分配器的复制构造函数
```c++ unordered_flat_set(unordered_flat_set const& other, Allocator const& a); ```
```c++ unordered_flat_set(unordered_flat_set const& other, Allocator const& a); ```
Constructs a container, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.
构造一个容器，复制 `other` 所包含的元素、哈希函数和谓词，但使用分配器 `a`。
:414
---
---
Move Constructor with Allocator
带分配器的移动构造函数
```c++ unordered_flat_set(unordered_flat_set&& other, Allocator const& a); ```
```c++ unordered_flat_set(unordered_flat_set&& other, Allocator const& a); ```
If `a == other.get_allocator()`, the elements of `other` are transferred directly to the new container; otherwise, elements are moved-constructed from those of `other`. The hash function and predicate are moved-constructed from `other`, and the allocator is copy-constructed from `a`. If statistics are xref:unordered_flat_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff `a == other.get_allocator()`, and always calls `other.reset_stats()`.
如果 `a == other.get_allocator()`，则 `other` 的元素会直接转移给新容器；否则，将根据 `other` 中的元素进行移动构造。哈希函数和谓词从 `other` 进行移动构造，而分配器则从 `a` 进行复制构造。如果启用了统计信息（xref:unordered_flat_set_boost_unordered_enable_stats[enabled]），则仅当 `a == other.get_allocator()` 时才从 `other` 转移内部统计信息，并且总是调用 `other.reset_stats()`。
:428
---
---
Move Constructor from concurrent_flat_set
从 concurrent_flat_set 移动构造
```c++ unordered_flat_set(concurrent_flat_set<Key, Hash, Pred, Allocator>&& other); ```
```c++ unordered_flat_set(concurrent_flat_set<key, hash,="" pred,="" allocator="">&amp;&amp; other); ```</key,>
Move construction from a xref:#concurrent_flat_set[`concurrent_flat_set`]. The internal bucket array of `other` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:unordered_flat_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.
从 xref:#concurrent_flat_set[`concurrent_flat_set`] 进行移动构造。`other` 的内部桶数组将直接转移给新容器。哈希函数、谓词和分配器从 `other` 进行移动构造。如果启用了统计信息（xref:unordered_flat_set_boost_unordered_enable_stats[enabled]），则从 `other` 转移内部统计信息，并调用 `other.reset_stats()`。
Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
复杂度：;; 常数时间。
并发性：;; 在 `other` 上阻塞。
:446
---
---
Initializer List Constructor
初始化列表构造函数
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器，并将 `il` 中的元素插入其中。
:461
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[DefaultConstructible^]。
:463
---
---
Bucket Count Constructor with Allocator
带分配器的桶数构造函数
```c++ unordered_flat_set(size_type n, allocator_type const& a); ```
```c++ unordered_flat_set(size_type n, allocator_type const&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 and `a` as the allocator.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，默认的哈希函数和键相等谓词，并以 `a` 作为分配器。
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[DefaultConstructible^]。
:476
---
---
Bucket Count Constructor with Hasher and Allocator
带哈希函数和分配器的桶数构造函数
```c++ unordered_flat_set(size_type n, hasher const& hf, allocator_type const& a); ```
```c++ unordered_flat_set(size_type n, hasher const&amp; hf, allocator_type const&amp; a); ```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，默认的键相等谓词，并以 `a` 作为分配器。
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[DefaultConstructible^]。
:489
---
---
English Chinese (Simplified Han script) Actions
```c++ unordered_flat_set& operator=(unordered_flat_set&& other) noexcept((boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*>::value); ``` The move assignment operator. Destroys previously existing elements, swaps the hash function and predicate from `other`, and move-assigns the allocator from `other` if `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`. If at this point the allocator is equal to `other.get_allocator()`, the internal bucket array of `other` is transferred directly to the new container; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:unordered_flat_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff the final allocator is equal to `other.get_allocator()`, and always calls `other.reset_stats()`.
```c++
unordered_flat_set&amp; operator=(unordered_flat_set&amp;&amp; other) noexcept((boost::allocator_traits<allocator>::is_always_equal::value || boost::allocator_traits<allocator>::propagate_on_container_move_assignment::value) &amp;&amp; std::is_same<pointer, value_type*="">::value);
```
移动赋值运算符。销毁先前存在的元素，交换来自 `other` 的哈希函数和谓词，如果 `Alloc::propagate_on_container_move_assignment` 存在且 `Alloc::propagate_on_container_move_assignment::value` 为 `true`，则从 `other` 移动赋值分配器。如果此时分配器等于 `other.get_allocator()`，则 `other` 的内部桶数组直接转移给当前容器；否则，插入 `other` 元素的移动构造副本。如果启用了统计信息（xref:unordered_flat_set_boost_unordered_enable_stats[enabled]），则仅当最终的分配器等于 `other.get_allocator()` 时才从 `other` 转移内部统计信息，并且总是调用 `other.reset_stats()`。</pointer,></allocator></allocator>
Initializer List Assignment
初始化列表赋值
```c++ unordered_flat_set& operator=(std::initializer_list<value_type> il); ```
```c++ unordered_flat_set&amp; operator=(std::initializer_list<value_type> il); ```</value_type>
begin
begin
```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```
```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```
Returns:;; An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container. Complexity:;; O(`bucket_count()`)
返回：;; 指向容器第一个元素的迭代器，若容器为空，则返回容器的尾后迭代器。
复杂度：;; O(`bucket_count()`)
end
end
```c++ iterator end() noexcept; const_iterator end() const noexcept; ```
```c++ iterator end() noexcept; const_iterator end() const noexcept; ```
cend
cend
```c++ const_iterator cend() const noexcept; ```
```c++ const_iterator cend() const noexcept; ```
Returns:;; A `const_iterator` which refers to the past-the-end value for the container.
返回：;; 指向容器尾后值的常量迭代器。
size
大小
*Template Parameters*
*模板参数*
Allocator Constructor
分配器构造函数
Copy Constructor with Allocator
带分配器的复制构造函数
Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
复杂度：;; 常数时间。
并发性：;; 在 `other` 上阻塞。
`position` is a suggestion to where the element should be inserted. This implementation ignores it.
`position` 是关于元素应该插入位置的一个提示。此实现会忽略它。
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 inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，并使用默认的键相等谓词，然后将 `[f, l)` 范围内的元素插入其中。
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
```c++ size_type erase(const key_type&amp; k); template<class k=""> size_type erase(K&amp;&amp; k); ```</class>
get_stats
get_stats
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`。
operator!
operator!
```c++ ~unordered_flat_set(); ```
```c++ ~unordered_flat_set(); ```
```c++ unordered_flat_set& operator=(unordered_flat_set const& other); ```
```c++ unordered_flat_set&amp; operator=(unordered_flat_set const&amp; other); ```
Erase all elements with key equivalent to `k`.
删除所有键与 `k` 等价的元素。
Erase Range
范围擦除
```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
emplace
原地构造

Loading…

User avatar admin

Translation uploaded
Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
Complexity:;; Constant time. Concurrency:;; Blocking on复杂度：;; 常数时间。
并发性：;; 在 `other`. 上阻塞。
06/05/2026
User avatar admin

String added in the repository
Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
Complexity:;; Constant time. Concurrency:;; Blocking on `other`.
06/05/2026
Browse all string changes

Things to check

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

English Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Flags
safe-html, strict-same
Unit identifier
54239
Source string location
:443
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_flat_set_zh_Hans.adoc, string 82