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 `std::size_t`.一元函数对象类型，用作 `Key` 的哈希函数。它接受一个类型为 `Key`
06/05/2026
User avatar admin

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

Translation uploaded
and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.
and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.MoveInsertable[可移动插入] 到容器中的要求，且需满足从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[可擦除] 的要求。
06/05/2026
User avatar admin

Translation uploaded
`Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container
`Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container必须满足可移动插入要求，即能够被
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
---
---
:296
06/05/2026
User avatar admin

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

Translation uploaded
The internal data structure of `boost::concurrent_node_set` is similar to that of `boost::unordered_node_set`. Unlike `boost::concurrent_flat_set`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.
The internal data structure of `boost::concurrent_node_set` is similar to that of `boost::unordered_node_set`. Unlike `boost::concurrent_flat_set`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.`boost::concurrent++_++node++_++set` 的内部数据结构与 `boost::unordered++_++node++_++set` 类似。与 `boost::concurrent++_++flat++_++set` 不同，它提供了指针稳定性和节点处理功能，但可能以性能降低为代价。
06/05/2026
User avatar admin

Translation uploaded
Even though it acts as a container, `boost::concurrent_node_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_node_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
Even though it acts as a container, `boost::concurrent_node_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (尽管 `boost::concurrent++_++node++_++set` 的行为类似于容器，但它并不符合标准 C{plus}{plus} https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念。具体而言，它不提供迭代器及相关操作（如 `begin`, 、 `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_node_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios. 等）。元素的访问通过用户提供的 _访问函数_ 实现，这些函数被传递至 `concurrent++_++node++_++set` 的内部操作，并以受控方式执行。这种基于访问的 API 设计支持低竞争度的并发使用场景。
06/05/2026
User avatar admin

Translation uploaded
`boost::concurrent_node_set` — A node-based hash table that stores unique values and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.
`boost::concurrent_node_set` — A node-based hash table that stores unique values and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.++_++node++_++set` —— 一种基于节点的哈希表，用于存储唯一值，并允许在无外部同步机制的情况下并发执行元素插入、擦除、查找和访问操作。
06/05/2026
User avatar admin

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

Translation uploaded
Class Template concurrent_node_set
Class Template concurrent_node_类模板 concurrent++_++node++_++set
06/05/2026
User avatar admin

Translation uploaded
[#concurrent_node_set]
[#concurrent_node_set]
06/05/2026
User avatar admin

Resource updated
The “doc/modules/ROOT/pages/reference/concurrent_node_set_zh_Hans.adoc” file was changed. 06/05/2026
User avatar admin

Resource updated
File “doc/modules/ROOT/pages/reference/concurrent_node_set_zh_Hans.adoc” was added. 06/05/2026
User avatar admin

String added in the repository
Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`. Concurrency:;; Blocking on `x`.
Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`. Concurrency:;; Blocking on `x`.
06/05/2026
User avatar admin

String added in the repository
Deletes all preexisting elements of a `concurrent_node_set` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `concurrent_node_set` `other` saved to the storage read by `ar`.
Deletes all preexisting elements of a `concurrent_node_set` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `concurrent_node_set` `other` saved to the storage read by `ar`.
06/05/2026
User avatar admin

String added in the repository
Loading an concurrent_node_set from an archive
Loading an concurrent_node_set from an archive
06/05/2026

Search