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

File uploaded
Processed 416 strings from the uploaded files (skipped: 0, not found: 0, updated: 416).
File upload mode: Add as translation 06/05/2026
User avatar admin

Translation uploaded
Requires:;; If `x` is the `unordered_flat_map` `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_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.是 `it` 所指向的 `unordered++_++flat++_++map` 容器，则在加载 `x` 与加载 `it` 期间不得对 `x` 执行任何修改操作。
06/05/2026
User avatar admin

Translation uploaded
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`. ）所恢复的位置。该原始迭代器已被保存到由归档（XML 归档） `ar` 读取的存储中。
06/05/2026
User avatar admin

Translation uploaded
Loading an iterator/const_iterator from an archive
Loading an iterator/const_iterator from an archive从归档加载迭代器/常量迭代器
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; The `unordered_flat_map` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
Requires:;; The `unordered_flat_要求;; `it` 所指向的 `unordered++_++flat++_++map` 容器 `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.必须先前已保存至 `ar` ，且在保存 `x` 与保存 `it` 期间不得对 `x` 执行任何修改操作。
06/05/2026
User avatar admin

Translation uploaded
Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.
Saves the positional information of an将 `iterator` (（ `const_++_++iterator`) `it` to an archive (XML archive) ）常量迭代器 `it` 的位置信息保存到归档（XML 归档） `ar`. 中。 `it` can be and `end()` iterator.可以是 `end()` 迭代器。
06/05/2026
User avatar admin

Translation uploaded
Saving an iterator/const_iterator to an archive
Saving an iterator/const_iterator to an archive将迭代器/常量迭代器保存到归档
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`.
Requires:要求;; `x.key_++_++equal()` is functionally equivalent to需要在功能上等价于 `other.key_++_++equal()`. 。
06/05/2026
User avatar admin

Translation uploaded
Deletes all preexisting elements of an `unordered_flat_map` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_flat_map` `other` saved to the storage read by `ar`.
Deletes all preexisting elements of an `unordered_flat_删除 `unordered++_++flat++_++map` 容器 `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_flat_中所有已存在的元素，并从归档（XML 归档） `ar` 中插入原始 `unordered++_++flat++_++map` 容器 `other` saved to the storage read by `ar`.的元素副本，这些副本是从 `ar` 所读取的存储中恢复的。
06/05/2026
User avatar admin

Translation uploaded
Loading an unordered_flat_map from an archive
Loading an unordered_flat_map from an archive从归档加载 unordered++_++flat++_++map
06/05/2026
User avatar admin

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

Translation uploaded
Requires:;; `std::remove_const<key_type>::type` and `std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types).
Requires:;; `要求：std::remove_const<key_type>::type` and ` 和 std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support 必须满足可序列化要求（XML 可序列化），且需要支持 Boost.Serialization `的 save_construct_data`/` / load_construct_data` protocol (automatically suported by 协议（该协议自动支持 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] 可默认构造] 要求）。</mapped_type></key_types).>
06/05/2026

Search