User avatar admin

Translation uploaded
Added concurrent, node-based containers `boost::concurrent_node_map` and `boost::concurrent_node_set`.
Added concurrent, node-based containers新增基于节点的并发容器 `boost::concurrent_node_map` and与 `boost::concurrent_node_set`. 。
06/05/2026
User avatar admin

Translation uploaded
Release 1.87.0 - Major update
Release版本 1.87.0 - Major update重大更新
06/05/2026
User avatar admin

Translation uploaded
Migrated the documentation to a multipage format using Antora.
Migrated the documentation to a multipage format using Antora.使用 Antora 将文档重构为多页面格式。
06/05/2026
User avatar admin

Translation uploaded
Release 1.88.0
Release版本 1.88.0
06/05/2026
User avatar admin

Translation uploaded
allows for efficient removal and retrieval of an element via move construction.
allows for efficient removal and retrieval of an element via move construction.支持通过移动构造机制高效移除并检索指定元素。
06/05/2026
User avatar admin

Translation uploaded
Added `pull(const_iterator)` to open-addressing containers. This operation
Added为开放寻址容器新增 `pull(const_iterator)` to open-addressing containers. This operation操作，该操作
06/05/2026
User avatar admin

Translation uploaded
`boost::hash_is_avalanching` in `<boost/container_hash/hash_is_avalanching.hpp>`. Use that header directly instead. `<boost/unordered/hash_traits.hpp>` will be removed in the future.
`boost::hash_is_avalanching` in `在 <boost/ container_hash/="" hash_is_avalanching.hpp>`. Use that header directly instead. `=""> 中对 boost::hash_is_avalanching 的使用声明。请直接使用该头文件代替。<boost/ unordered/="" hash_traits.hpp>` will be removed in the future.=""> 将在未来被移除。</boost></boost>
06/05/2026
User avatar admin

Translation uploaded
Deprecated `boost::unordered::hash_is_avalanching` is now a using-declaration of
Deprecated `已弃用的 boost::unordered::hash_is_avalanching` is now a using-declaration of 现在是
06/05/2026
User avatar admin

Translation uploaded
Release 1.89.0
Release版本 1.89.0
06/05/2026
User avatar admin

Translation uploaded
:idprefix: changes_ :svn-ticket-url: https://svn.boost.org/trac/boost/ticket :github-pr-url: https://github.com/boostorg/unordered/pull :cpp: C++
:idprefix: changes_ :svn-ticket-url: https://svn.boost.org/trac/boost/ticket :github-pr-url: https://github.com/boostorg/unordered/pull :cpp: C++
06/05/2026
User avatar admin

Translation uploaded
= Change Log
= Change Log变更日志
06/05/2026
User avatar admin

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

Translation uploaded
A note on `max_load` for open-addressing and concurrent containers: the maximum load will be (`max_load_factor() * bucket_count()`) right after `rehash` or on container creation, but may slightly decrease when erasing elements in high-load situations. For instance, if we have a `xref:reference/unordered_flat_map.adoc#unordered_flat_map[boost::unordered_flat_map]` with `size()` almost at `max_load()` level and then erase 1,000 elements, `max_load()` may decrease by around a few dozen elements. This is done internally by Boost.Unordered in order to keep its performance stable, and must be taken into account when planning for rehash-free insertions.
A note on `max_load` for open-addressing and concurrent containers: the maximum load will be (`max_load_factor() * bucket_count()`) right after `rehash` or on container creation, but may slightly decrease when erasing elements in high-load situations. For instance, if we have a `关于开放寻址与并发容器的 `max_load` 注意事项：在容器创建或执行 `rehash` 后，最大负载值将保持为 `max_load_factor() * bucket_count()` ；但在高负载场景下执行元素删除操作时，该值可能轻微下降。例如，若某个 xref:reference/unordered_flat_map.adoc#unordered_flat_map[boost::unordered_flat_map]` with 的 `size()` almost at已接近 `max_load()` level and then erase 1,000 elements, `max_load()` may decrease by around a few dozen elements. This is done internally by Boost.Unordered in order to keep its performance stable, and must be taken into account when planning for rehash-free insertions.阈值，随后删除 1,000 个元素时， `max_load()` 可能减少约数十个元素。此机制是Boost.Unordered为保持性能稳定而采取的内部机制，用户在规划无重组插入操作时需予以考虑。
06/05/2026
User avatar admin

Translation uploaded
Returns the maximum number of allowed elements in the container before rehash.
Returns the maximum number of allowed elements in the container before rehash.返回容器触发重新哈希前所允许容纳的最大元素数量。
06/05/2026
User avatar admin

Translation uploaded
`size_type max_load() const`
`size_type max_load() const`
06/05/2026
User avatar admin

Translation uploaded
2+^h| *Open-addressing and concurrent containers only* h|*Method* h|*Description*
2+^h| *Open-addressing and concurrent containers only* h|*Method* h|*Description仅限开放寻址与并发容器* h|*方法* h|*描述*
06/05/2026
User avatar admin

Translation uploaded
Changes the number of buckets so that there at least `n` buckets, and so that the load factor is less than the maximum load factor.
Changes the number of buckets so that there at least `n` buckets, and so that the load factor is less than the maximum load factor.调整桶的数量，使其至少为 `n` ，并确保负载因子小于最大负载因子。
06/05/2026
User avatar admin

Translation uploaded
`void rehash(size_type n)`
`void rehash(size_type n)`
06/05/2026
User avatar admin

Translation uploaded
**Open-addressing and concurrent containers:** this function does nothing: users are not allowed to change the maximum load factor.
**Open-addressing and concurrent containers:** this function does nothing: users are not allowed to change the maximum load factor.开放寻址与并发容器：**此函数无效，用户不允许更改最大负载因子。
06/05/2026
User avatar admin

Translation uploaded
Changes the container's maximum load factor, using `z` as a hint. +
Changes the container's maximum load factor, using `z` as a hint.以 `z` 作为提示值来更改容器的最大负载因子。 +
06/05/2026

Search