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 `bool`.一种二元函数对象，用于对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 `std::size_t`.一元函数对象类型，用作 `Key` 的哈希函数。它接受一个类型为 `Key`
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
into the table 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 table.
into the table from any `std::pair` object convertible to it, and it also must be`std::pair` 对象 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[原地构造] 到容器中，并且必须支持从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the table.擦除] 。
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
---
---
:347
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_map` is similar to that of `boost::unordered_node_map`. Unlike `boost::concurrent_flat_map`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.
The internal data structure of `boost::concurrent_node_map` is similar to that of `boost::unordered_node_map`. Unlike `boost::concurrent_flat_map`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.`boost::concurrent++_++node++_++map` 的内部数据结构与 `boost::unordered++_++node++_++map` 类似。与 `boost::concurrent++_++flat++_++map` 不同，它提供了指针稳定性和节点处理功能，但代价是可能带来性能上的损失。
06/05/2026
User avatar admin

Translation uploaded
Even though it acts as a container, `boost::concurrent_node_map` 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 and modification are done through user-provided _visitation functions_ that are passed to `concurrent_node_map` 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_map` 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++_++map` 的行为类似于容器，但它并不符合标准 C{plus}{plus} 的 https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念模型。具体而言，它不提供迭代器及相关操作（如 `begin`, 、 `end`, etc.) are not provided. Element access and modification are done through user-provided _visitation functions_ that are passed to `concurrent_node_map` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios. 等）。元素的访问和修改通过用户提供的__访问函数__来实现，这些函数被传递至 `concurrent++_++node++_++map` 的操作中，并在其内部以受控方式执行。这种基于访问的 API 设计能够支持低争用的并发应用场景。
06/05/2026
User avatar admin

Translation uploaded
`boost::concurrent_node_map` — A node-based hash table that associates unique keys with another value and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.
`boost::concurrent_node_++_++node++_++map` — A node-based hash table that associates unique keys with another value and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.— 一种基于节点的哈希表，用于建立唯一键与对应值的关联，并支持在无外部同步机制的情况下并发执行元素插入、擦除、查找和访问操作。
06/05/2026
User avatar admin

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

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

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

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

Translation uploaded
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

Translation uploaded
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_删除 `concurrent++_++node++_++set` 容器 `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `concurrent_node_中所有已存在的元素，并从归档（XML 归档） `ar` 中插入原始 `concurrent++_++node++_++set` 容器 `other` saved to the storage read by `ar`.的元素副本，这些副本是从 `ar` 所读取的存储中恢复的。
06/05/2026

Search