User avatar admin

Translation uploaded
The unsuccessful lookup benchmarks use `n` randomly generated integers but using a different seed value.
The unsuccessful lookup benchmarks use `n` randomly generated integers but using a different seed value.未命中查找基准测试使用不同种子值生成的 `n` 个随机整数进行。
:16
06/05/2026
User avatar admin

Translation uploaded
The successful lookup benchmarks are done by looking up all `n` values, in their original insertion order.
The successful lookup benchmarks are done by looking up all `n` values, in their original insertion order.成功查找基准测试通过按照元素的原始插入顺序查找全部 `n` 个值来完成。
:14
06/05/2026
User avatar admin

Translation uploaded
The erasure benchmarks erase all `n` elements randomly until the container is empty. Erasure by key uses `erase(const key_type&)` to remove entire groups of equivalent elements in each operation.
The erasure benchmarks erase all `n` elements randomly until the container is empty. Erasure by key uses `erase(const key_type&)` to remove entire groups of equivalent elements in each operation.在擦除基准测试中，随机删除所有 `n` 个元素直至容器为空。通过键擦除操作使用 `erase(const key++_++type&)` 方法，每次调用将移除整个等效元素组。
06/05/2026
User avatar admin

Translation uploaded
The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times.
The insertion benchmarks insert `n` random values, where `n` is between 10,000 and 3 million. For the duplicated benchmarks, the same random values are repeated an average of 5 times.插入基准测试会插入 `n` 个随机值，其中 `n` 的范围在10,000至300万之间。在重复值测试场景中，同一组随机值会平均重复插入 5 次。
06/05/2026
User avatar admin

Translation uploaded
All benchmarks were created using `unordered_set<unsigned int>` (non-duplicate) and `unordered_multiset<unsigned int>` (duplicate). The source code can be https://github.com/boostorg/boost_unordered_benchmarks/tree/boost_unordered_set[found here^].
All benchmarks were created using `unordered_set<unsigned int>` (non-duplicate) and所有基准测试均使用 `unordered++_++set++&lt;++unsigned int++&gt;++`(非重复元素） 和 `unordered_++_++multiset<++&lt;++unsigned int>` (duplicate). The source code can be++&gt;++` （重复元素）创建。源代码可 https://github.com/boostorg/boost_unordered_benchmarks/tree/boost_unordered_set[found here^].在此处获取] 。
06/05/2026
User avatar admin

Translation uploaded
boost::unordered_[multi]set
boost::unordered_[multi]set
06/05/2026
User avatar admin

Translation uploaded
= Benchmarks
= Benchmarks基准测试
06/05/2026
User avatar admin

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

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

Translation uploaded
xref:copyright.adoc[]
xref:copyright.adoc[版权声明]
06/05/2026
User avatar admin

Translation uploaded
xref:bibliography.adoc[]
xref:bibliography.adoc[参考文献]
06/05/2026
User avatar admin

Translation uploaded
xref:changes.adoc[]
xref:changes.adoc[变更记录]
06/05/2026
User avatar admin

Translation uploaded
xref:reference/concurrent_node_set.adoc[`concurrent_node_set`]
xref:reference/concurrent_node_set.adoc[`concurrent_node_set`]
06/05/2026
User avatar admin

Translation uploaded
xref:reference/header_concurrent_node_set.adoc[`<boost/unordered/concurrent_node_set.hpp>`]
xref:reference/header_concurrent_node_set.adoc[`<boost/ unordered/="" concurrent_node_set.hpp>`]="">`]</boost>
06/05/2026
User avatar admin

Translation uploaded
xref:reference/header_concurrent_node_set_fwd.adoc[`<boost/unordered/concurrent_node_set_fwd.hpp>`]
xref:reference/header_concurrent_node_set_fwd.adoc[`<boost/ unordered/="" concurrent_node_set_fwd.hpp>`]="">`]</boost>
06/05/2026
User avatar admin

Translation uploaded
xref:reference/concurrent_node_map.adoc[`concurrent_node_map`]
xref:reference/concurrent_node_map.adoc[`concurrent_node_map`]
06/05/2026
User avatar admin

Translation uploaded
xref:reference/header_concurrent_node_map.adoc[`<boost/unordered/concurrent_node_map.hpp>`]
xref:reference/header_concurrent_node_map.adoc[`<boost/ unordered/="" concurrent_node_map.hpp>`]="">`]</boost>
06/05/2026
User avatar admin

Translation uploaded
xref:reference/header_concurrent_node_map_fwd.adoc[`<boost/unordered/concurrent_node_map_fwd.hpp>`]
xref:reference/header_concurrent_node_map_fwd.adoc[`<boost/ unordered/="" concurrent_node_map_fwd.hpp>`]="">`]</boost>
06/05/2026
User avatar admin

Translation uploaded
xref:reference/concurrent_flat_set.adoc[`concurrent_flat_set`]
xref:reference/concurrent_flat_set.adoc[`concurrent_flat_set`]
06/05/2026
User avatar admin

Translation uploaded
xref:reference/header_concurrent_flat_set.adoc[`<boost/unordered/concurrent_flat_set.hpp>`]
xref:reference/header_concurrent_flat_set.adoc[`<boost/ unordered/="" concurrent_flat_set.hpp>`]="">`]</boost>
06/05/2026

Search