User avatar admin

Translation uploaded
An allocator whose value type is the same as the container's value type.
An allocator whose value type is the same as the container's value type.一个分配器，其值类型与容器的值类型相同。
06/05/2026
User avatar admin

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

Translation uploaded
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`.
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一个二元函数对象，在 `Key` 类型的值上诱导出等价关系。它接受两个 `Key` 类型的参数并返回 `bool`. 类型的值。
06/05/2026
User avatar admin

Translation uploaded
_Pred_
_Pred_
06/05/2026
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
_T_
_T_
06/05/2026
User avatar admin

Translation uploaded
`std::pair<const Key, T>` must be https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.
`std::pair<const Key, T>` must bekey,="" t="">` 必须能从任何可转换为它的 `std::pair` 对象满足对容器的 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from any `std::pair` object convertible to it, and it also must be可原位构造^] 要求，并且还必须满足对容器的 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.可擦除^] 要求。</const>
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
---
---
:282
06/05/2026
User avatar admin

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

Translation uploaded
Other than this, `boost::unordered_flat_map` is mostly a drop-in replacement of node-based standard unordered associative containers.
Other than this,除此之外， `boost::unordered_flat_map` is mostly a drop-in replacement of node-based standard unordered associative containers.++_++flat++_++map` 基本可完全替代基于节点的标准无序关联容器。
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必须支持移动构造。 - 在重哈希的过程中，指针稳定性无法保持。 - `begin()` 不是常数时间复杂度操作。 - 未提供用于桶管理（除 `bucket_++_++count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user. 外）或节点提取/插入的 API。 - 容器的最大负载因子由内部管理，用户无法进行设置。
06/05/2026
User avatar admin

Translation uploaded
As a result of its using open addressing, the interface of `boost::unordered_flat_map` deviates in a number of aspects from that of `boost::unordered_map`/`std::unordered_map`:
As a result of its using open addressing, the interface of `boost::unordered_flat_map` deviates in a number of aspects from that of由于采用开放寻址法， `boost::unordered++_++flat++_++map` 的接口在多个方面与 `boost::unordered_++_++map`/ / `std::unordered_map`:++_++map` 不同：
06/05/2026
User avatar admin

Translation uploaded
The performance of `boost::unordered_flat_map` is much better than that of `boost::unordered_map` or other implementations of `std::unordered_map`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_map` 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_map` is much better than that of `boost::unordered_map` or other implementations of `std::unordered_map`. Unlike standard unordered associative containers, which are node-based, the elements of a `boost::unordered_flat_map` 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++_++flat++_++map` 的性能远优于 `boost::unordered++_++map` 或其他 `std::unordered++_++map` 的实现。与基于节点的标准无序关联容器不同， `boost::unordered++_++flat++_++map` 的元素直接存储在桶数组中，且当元素被插入到已被占用的桶时，会将其重定向到原始位置附近的可用桶。这种数据布局类型称为__开放寻址法__。
06/05/2026
User avatar admin

Translation uploaded
`boost::unordered_flat_map` — An open-addressing unordered associative container that associates unique keys with another value.
`boost::unordered_flat_map` — An open-addressing unordered associative container that associates unique keys with another value.++_++flat++_++map` —— 一种开放寻址的无序关联容器，用于将唯一键与另一个值关联。
06/05/2026
User avatar admin

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

Translation uploaded
Class Template unordered_flat_map
Class Template unordered_flat_类模板 unordered++_++flat++_++map
06/05/2026

Search