User avatar admin

Translation uploaded
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`.
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一种一元函数对象类型，用作 `Key` 的哈希函数。它接受一个 `Key` 类型的参数，并返回一个 `std::size_t`. 类型的值。
06/05/2026
User avatar admin

Translation uploaded
_Hash_
_Hash_
06/05/2026
User avatar admin

Translation uploaded
and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.
and并且可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.。
06/05/2026
User avatar admin

Translation uploaded
`Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container
`Key` must be必须可以 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container到容器中
06/05/2026
User avatar admin

Translation uploaded
_Key_
_Key键_
06/05/2026
User avatar admin

Translation uploaded
*Template Parameters*
*Template Parameters模板参数*
06/05/2026
User avatar admin

Translation uploaded
Description
Description描述
06/05/2026
User avatar admin

Translation uploaded
---
---
:235
06/05/2026
User avatar admin

Translation uploaded
Synopsis
Synopsis概要
06/05/2026
User avatar admin

Translation uploaded
Other than this, `boost::unordered_flat_set` is mostly a drop-in replacement of node-based standard unordered associative containers.
Other than this, 除此之外，`boost::unordered_flat_set` is mostly a drop-in replacement of node-based standard unordered associative containers.基本上是基于节点的标准无序关联容器的直接替代品。
06/05/2026
User avatar admin

Translation uploaded
- `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user.
- `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user.必须可移动构造。
- 在重哈希过程中不保持指针稳定性。
- `begin()` 不是常数时间操作。
- 没有用于桶操作的 API（除了 `bucket_count`），也没有节点提取/插入的 API。
- 容器的最大负载因子由内部管理，用户无法设置。
06/05/2026
User avatar admin

Translation uploaded
As a result of its using open addressing, the interface of `boost::unordered_flat_set` deviates in a number of aspects from that of `boost::unordered_flat_set`/`std::unordered_flat_set`:
As a result of its using open addressing, the interface of `boost::unordered_flat_set` deviates in a number of aspects from that of由于采用开放定址，`boost::unordered_flat_set` 的接口在多个方面与 `boost::unordered_flat_set`/`std::unordered_flat_set`:set` 存在差异：
06/05/2026
User avatar admin

Translation uploaded
The performance of `boost::unordered_flat_set` is much better than that of `boost::unordered_set` or other implementations of `std::unordered_set`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_set` are held directly in the bucket array, and insertions into an already occupied bucket are diverted to available buckets in the vicinity of the original position. This type of data layout is known as _open addressing_.
The performance of `boost::unordered_flat_set` is much better than that of `boost::unordered_set` or other implementations of `std::unordered_set`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_set` are held directly in the bucket array, and insertions into an already occupied bucket are diverted to available buckets in the vicinity of the original position. This type of data layout is known as _open addressing_.的性能远优于 `boost::unordered_set` 或 `std::unordered_set` 的其他实现。与基于节点的标准无序关联容器不同，`boost::unordered_flat_set` 的元素直接保存在桶数组中，当插入位置已被占用时，会转移到原始位置附近可用的桶中。这种数据布局称为**开放定址**。
06/05/2026
User avatar admin

Translation uploaded
`boost::unordered_flat_set` — An open-addressing unordered associative container that stores unique values.
`boost::unordered_flat_set` — An open-addressing unordered associative container that stores unique values.一种开放定址无序关联容器，用于存储唯一值。
06/05/2026
User avatar admin

Translation uploaded
:idprefix: unordered_flat_set_
:idprefix: unordered_flat_set_
06/05/2026
User avatar admin

Translation uploaded
Class Template unordered_flat_set
Class Template类模板 unordered_flat_set
06/05/2026
User avatar admin

Resource updated
File “doc/modules/ROOT/pages/reference/unordered_flat_set_zh_Hans.adoc” was added. 06/05/2026
User avatar admin

String added in the repository
Requires:;; If `x` is the `unordered_flat_set` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.
Requires:;; If `x` is the `unordered_flat_set` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.
06/05/2026
User avatar admin

String added in the repository
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`.
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`.
06/05/2026
User avatar admin

String added in the repository
Loading an iterator/const_iterator from an archive
Loading an iterator/const_iterator from an archive
06/05/2026

Search