User avatar admin

Translation uploaded
Container traversal.
Container traversal.容器遍历。
06/05/2026
User avatar admin

Translation uploaded
Access to an element previously located via lookup.
Access to an element previously located via lookup.访问先前通过查找定位的元素。
06/05/2026
User avatar admin

Translation uploaded
In a non-concurrent unordered container, iterators serve two main purposes:
In a non-concurrent unordered container, iterators serve two main purposes:在非并发无序容器中，迭代器主要有两项核心功能：
06/05/2026
User avatar admin

Translation uploaded
There is currently no specification in the C++ standard for this or any other type of concurrent data structure. The APIs of `boost::concurrent_flat_set`/`boost::concurrent_node_set` and `boost::concurrent_flat_map`/`boost::concurrent_node_map` are modelled after `std::unordered_flat_set` and `std::unordered_flat_map`, respectively, with the crucial difference that iterators are not provided due to their inherent problems in concurrent scenarios (high contention, prone to deadlocking): so, Boost.Unordered concurrent containers are technically not models of https://en.cppreference.com/w/cpp/named_req/Container[Container^], although they meet all the requirements of https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] containers (including https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointer^] support) except those implying iterators.
There is currently no specification in the C++ standard for this or any other type of concurrent data structure. The APIs of 目前 C++ 标准中尚未针对此类或任何其他类型的并发数据结构提供规范。`boost::concurrent_flat_set`/ / `boost::concurrent_node_set` and与 `boost::concurrent_flat_map`/ / `boost::concurrent_node_map` are modelled after的 API 分别参照 `std::unordered_flat_set` and和 `std::unordered_flat_map`, respectively, with the crucial difference that iterators are not provided due to their inherent problems in concurrent scenarios (high contention, prone to deadlocking): so, Boost.Unordered concurrent containers are technically not models of https://en.cppreference.com/w/cpp/named_req/Container[Container^], although they meet all the requirements of 设计，但有一个关键区别：由于迭代器在并发场景中存在的固有问题（高竞争、易死锁），这些容器不提供迭代器。因此，Boost.Unordered 并发容器在技术上并不符合 https://en.cppreference.com/w/cpp/named_req/Container[容器^] 的模型，但它们满足 https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] containers (including分配器感知^] 容器（包括 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointer^] support) except those implying iterators.花式指针^] 支持）中除涉及迭代器之外的所有要求。
06/05/2026
User avatar admin

Translation uploaded
Concurrent Containers
Concurrent Containers并发容器
06/05/2026
User avatar admin

Translation uploaded
** `value_type` must be move-constructible. ** Pointer stability is not kept under rehashing. ** There is no API for node extraction/insertion.
** `value_type` 必须支持移动构造。 ** 在重哈希的过程中，指针稳定性无法保持。 ** 不提供节点提取/插入的 API 接口。
06/05/2026
User avatar admin

Translation uploaded
Flat containers (`boost::unordered_flat_set` and `boost::unordered_flat_map`):
`begin()` is not constant-time. ** `erase(iterator)` does not return an iterator to the following element, but a proxy object that converts to that iterator if requested; this avoids a potentially costly iterator increment operation when not needed. ** There is no API for bucket handling (except `bucket_count`). ** The maximum load factor of the container is managed internally and can't be set by the user. The maximum load, exposed through the public function `max_load`, may decrease on erasure under high-load conditions.扁平容器（ `boost::unordered_flat_set` 与 `boost::unordered_flat_map` ）：
06/05/2026
User avatar admin

Translation uploaded
** `begin()` is not constant-time. ** `erase(iterator)` does not return an iterator to the following element, but a proxy object that converts to that iterator if requested; this avoids a potentially costly iterator increment operation when not needed. ** There is no API for bucket handling (except `bucket_count`). ** The maximum load factor of the container is managed internally and can't be set by the user. The maximum load, exposed through the public function `max_load`, may decrease on erasure under high-load conditions.
** `begin()` 不是常数时间复杂度操作。 ** `erase(iterator)` 不返回指向下一元素的迭代器，而是返回一个代理对象，该对象可按需转换为目标迭代器；这可以避免在无需迭代器时可能产生的高昂递增操作开销。 ** 未提供用于桶管理的 API（除 `bucket_count` 外）。 ** 容器的最大负载因子由内部自动管理，用户无法手动设置。通过公开函数 `max_load` 获取的最大负载值，在高负载情况下执行删除操作时可能会降低。
06/05/2026
User avatar admin

Translation uploaded
In general:
In general:总体特性：
06/05/2026
User avatar admin

Translation uploaded
The main differences with C++ unordered associative containers are:
The main differences with C++ unordered associative containers are:与 C{plus}{plus} 无序关联容器的主要区别在于：
06/05/2026
User avatar admin

Translation uploaded
Open-addressing containers provided by Boost.Unordered only work with reasonably compliant C++11 (or later) compilers. Language-level features such as move semantics and variadic template parameters are then not emulated. The containers are fully https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^].
Open-addressing containers provided by Boost.Unordered only work with reasonably compliant C++11 (or later) compilers. Language-level features such as move semantics and variadic template parameters are then not emulated. The containers are fullyBoost.Unordered 提供的开放寻址容器仅兼容符合 C{plus}{plus}1（或更高版本）的编译器，且不再对移动语义、变参模板等语言特性进行模拟实现。这些容器完全符合 https://en.cppreference.com/w/cpp/named_req/AllocatorAwareContainer[AllocatorAware^] and support分配器感知] 规范，并支持 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers^].花式指针] 。
06/05/2026
User avatar admin

Translation uploaded
The C++ standard does not currently provide any open-addressing container specification to adhere to, so `boost::unordered_flat_set`/`unordered_node_set` and `boost::unordered_flat_map`/`unordered_node_map` take inspiration from `std::unordered_set` and `std::unordered_map`, respectively, and depart from their interface where convenient or as dictated by their internal data structure, which is radically different from that imposed by the standard (closed addressing).
The C++ standard does not currently provide any open-addressing container specification to adhere to, soC++ 标准目前并未提供任何可供遵循的开放定址容器规范，因此 `boost::unordered_flat_set`/ / `unordered_node_set` and与 `boost::unordered_flat_map`/ / `unordered_node_map` take inspiration from分别借鉴 `std::unordered_set` and和 `std::unordered_map`, respectively, and depart from their interface where convenient or as dictated by their internal data structure, which is radically different from that imposed by the standard (closed addressing). 的设计，并在其内部数据结构（与标准规定的闭寻址方式截然不同）允许或需要时，对接口进行相应调整。
06/05/2026
User avatar admin

Translation uploaded
Open-addressing Containers
Open-addressing Containers开放寻址容器
06/05/2026
User avatar admin

Translation uploaded
When swapping, `Pred` and `Hash` are not currently swapped by calling `swap`, their copy constructors are used. As a consequence, when swapping an exception may be thrown from their copy constructor.
When swapping,执行交换操作时，当前未通过调用 `swap` 函数来交换 `Pred` and和 `Hash` are not currently swapped by calling `swap`, their copy constructors are used. As a consequence, when swapping an exception may be thrown from their copy constructor.对象，而是使用其复制构造函数。因此，在交换过程中可能会因其复制构造函数而抛出异常。
06/05/2026
User avatar admin

Translation uploaded
Swap
Swap交换
06/05/2026
User avatar admin

Translation uploaded
This feature has been retained for backwards compatibility with previous versions of Boost.Unordered: users are encouraged to update their code to use `std::piecewise_construct` and ``std::tuple``s instead.
This feature has been retained for backwards compatibility with previous versions of Boost.Unordered: users are encouraged to update their code to use此特性为保持与 Boost.Unordered 旧版本的向后兼容性而保留：建议用户更新代码以使用 `std::piecewise_construct` and `与 `std::tuple``s instead. 。
06/05/2026
User avatar admin

Translation uploaded
Additionally, the same functionality is provided via non-standard `boost::unordered::piecewise_construct` and Boost.Tuple:
Additionally, the same functionality is provided via non-standard此外，通过非标准接口 `boost::unordered::piecewise_construct` and与 Boost.Tuple: 提供相同功能：
06/05/2026
User avatar admin

Translation uploaded
In accordance with the standard specification, `boost::unordered_[multi]map::emplace` supports piecewise pair construction:
In accordance with the standard specification,根据标准规范， `boost::unordered_[multi]map::emplace` supports piecewise pair construction:支持 pair 的分段构造：
06/05/2026
User avatar admin

Translation uploaded
Piecewise Pair Emplacement
Piecewise Pair Emplacement分段式 Pair 就地构造
06/05/2026
User avatar admin

Translation uploaded
Deduction guides for https://en.cppreference.com/w/cpp/language/class_template_argument_deduction[class template argument deduction (CTAD)^] are only available on {cpp}17 (or later) compilers.
Deduction guides for https://en.cppreference.com/w/cpp/language/class_template_argument_deduction[class template argument deduction类模板参数推导 (CTAD)^] are only available on {cpp}17 (or later) compilers.的推导指南仅在 C{plus}{plus}17（或更高版本）编译器中可用。
06/05/2026

Search