Zen

Translation

:1037
English
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
30/980 · 98

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Returns:;; `size()` of the largest possible table.
返回值：;; 哈希表能容纳的最大元素数量（最大容量）。
:996
---
---
Modifiers
修改器
emplace
原地构造
```c++ template<class... Args> bool emplace(Args&&... args); ```
```c++ template<class... args=""> bool emplace(Args&amp;&amp;... args); ```</class...>
Inserts an object, constructed with the arguments `args`, in the table if and only if there is no element in the table with an equivalent key.
当且仅当哈希表中不存在等价键的元素时，才会使用参数 `args` 构造对象并插入到哈希表中。
Requires:;; `value_type` is constructible from `args`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check.
要求：;; `value_type` 可由参数 `args` 构造。
返回值：;; 成功插入元素时返回 `true`。
并发特性：;; 当对当前对象执行重哈希操作时会阻塞。
注意：;; 若 `args...` 格式为 `k,v`，则会仅使用参数 `k` 进行键检查，**直到确定需要插入元素时**，才会构造完整对象。
:1013
---
---
Copy Insert
复制插入
```c++ bool insert(const value_type& obj); bool insert(const init_type& obj); ```
```c++ bool insert(const value_type&amp; obj); bool insert(const init_type&amp; obj); ```
:1021
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
当且仅当哈希表中不存在键等价的元素时，将`obj`插入表中。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; A call of the form `insert(x)`, where `x` is equally convertible to both `const value_type&` and `const init_type&`, is not ambiguous and selects the `init_type` overload.
要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] 要求。返回值：;; 成功执行插入操作则返回 `true`。并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。注意：;; 若调用形式为 `insert(x)`，且 `x` 可同时隐式转换为 `const value_type&amp;` 与 `const init_type&amp;`，该调用不存在歧义，会选用 `init_type` 重载版本。
:1029
---
---
Move Insert
移动插入
```c++ bool insert(value_type&& obj); bool insert(init_type&& obj); ```
```c++ bool insert(value_type&amp;&amp; obj); bool insert(init_type&amp;&amp; obj); ```
:1037
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; A call of the form `insert(x)`, where `x` is equally convertible to both `value_type&&` and `init_type&&`, is not ambiguous and selects the `init_type` overload.
要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] 要求。
返回值：;; 成功执行插入操作则返回 `true`。
并发特性：;; 对当前对象执行重哈希操作时会发生阻塞。
注意：;; 若调用形式为 `insert(x)`，且 `x` 可同时转换为 `value_type&amp;&amp;` 与 `init_type&amp;&amp;`，该调用不存在歧义，会选用 `init_type` 重载版本。
:1045
---
---
Insert Iterator Range
迭代器范围插入
```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ```
```c++ template<class inputiterator=""> size_type insert(InputIterator first, InputIterator last); ```</class>
:1052
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1059
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
:1061
---
---
Insert Initializer List
初始化列表插入
```c++ size_type insert(std::initializer_list<value_type> il); ```
```c++ size_type insert(std::initializer_list<value_type> il); ```</value_type>
:1068
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1075
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1077
---
---
Insert Node
节点插入
```c++ insert_return_type insert(node_type&& nh); ```
```c++ insert_return_type insert(node_type&amp;&amp; nh); ```
If `nh` is not empty, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.key()`. `nh` is empty when the function returns.
若`nh`非空，则当且仅当哈希表中不存在与`nh.key()`等价的键时，将关联元素插入表中。函数返回时，`nh`为空。
Key English Chinese (Simplified Han script) Actions
A specialization of an internal class template:
内部类模板的特化：
When executed internally by a `boost::concurrent_node_map`, the following operations by a user-provided visitation function on the element passed do not introduce data races:
当由 `boost::concurrent++_++node++_++map` 在内部执行时，用户提供的访问函数对传递的元素执行以下操作不会引入数据竞争：
Non-mutable modification of the element.
对元素的非可变修改。
Any `boost::concurrent_node_map operation` that inserts or modifies an element `e` synchronizes with the internal invocation of a visitation function on `e`.
任何插入或修改元素 `e` 的 `boost::concurrent++_++node++_++map 操作 ` 都会与对 `e` 执行的内部访问函数的调用同步。
Visitation functions executed by a `boost::concurrent_node_map` `x` are not allowed to invoke any operation on `x`; invoking operations on a different `boost::concurrent_node_map` instance `y` is allowed only if concurrent outstanding operations on `y` do not access `x` directly or indirectly.
由 `boost::concurrent++_++node++_++map` 实例 `x` 执行的访问函数不允许调用 `x` 上的任何操作；仅当对另一 `boost::concurrent++_++node++_++map` 实例 `y` 的并发未完成操作不会直接或间接访问 `x` 时，才会允许调用 `y` 上的操作。
Typedefs
类型定义
A class for holding extracted table elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
用于保存提取的表元素的类，建模为 https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle] 。
Chunk size internally used in xref:concurrent_node_map_bulk_visit[bulk visit] operations.
内部用于 xref:concurrent_node_map_bulk_visit[批量访问] 操作的块大小。
`std::allocator_traits<Alloc>::construct`
`std::allocator_traits<alloc>::construct`</alloc>
In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members.
通常而言，若 `Hash` 、 `Pred` 和 `Allocator` 这些类型不包含状态，或其操作仅涉及对内部数据成员的常量访问，即可满足上述要求。
With the exception of destruction, concurrent invocations of any operation on the same instance of a `concurrent_node_map` do not introduce data races — that is, they are thread-safe.
除析构操作外，对同一个 `concurrent++_++node++_++map` 实例并发调用任何操作都不会引入数据竞争——即这些操作是线程安全的。
If an operation *op* is explicitly designated as _blocking on_ `x`, where `x` is an instance of a `boost::concurrent_node_map`, prior blocking operations on `x` synchronize with *op*. So, blocking operations on the same `concurrent_node_map` execute sequentially in a multithreaded scenario.
如果某个操作 *op* 被显式指定为__阻塞于__ `x` （其中 `x` 是 `boost::concurrent++_++node++_++map` 的实例），则先前对 `x` 的阻塞操作将与 *op* 同步。因此，在多线程场景中，对同一 `concurrent++_++node++_++map` 的阻塞操作将按顺序执行。
:1013
---
---
:1021
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
当且仅当哈希表中不存在键等价的元素时，将`obj`插入表中。
:1029
---
---
:1037
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。
:1045
---
---
:1052
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1059
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
:1061
---
---
:1068
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1075
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1077
---
---
:1088
Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +
返回值：;; 由`inserted`和`node`构造的`insert_return_type`对象：
:1089
If `nh` is empty, `inserted` is `false` and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。
:1090
Otherwise if the insertion took place, `inserted` is true and `node` is empty.
若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。
:1091
If the insertion failed, `inserted` is false and `node` has the previous value of `nh`.
若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。
:1096
---
---
:1113
---
---
:1123
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key. Otherwise, invokes `f` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used.
当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。否则，调用`f`并传入等价元素的引用；当且仅当使用`*_cvisit`重载版本时，该引用为常量引用。

Loading…

User avatar admin

Translation uploaded
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.当且仅当哈希表中不存在等价键的元素时，将`obj`插入表中。
:1037
06/05/2026
User avatar admin

String added in the repository
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key.
:1037
06/05/2026
Browse all string changes

Glossary

English Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Key
:1037
Flags
safe-html, strict-same
Unit identifier
51978
Source string location
:1037
String age
06/05/2026
Last updated
06/06/2026
Source string age
06/05/2026
Translation file AsciiDoc file
doc/modules/ROOT/pages/reference/concurrent_node_map_zh_Hans.adoc, string 226