Zen

Translation

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.value()`. `nh` is empty when the function returns.
72/1940 · 194

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key.
当且仅当容器中不存在键等价的元素时，才使用 `std::forward<k>(k)` 构造元素并插入到容器中。</k>
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.
要求：;; `value_type` 可通过 `k` 原位构造。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员别名时，该重载版本参与重载决议。库假定 `Hash` 可同时接收 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这支持异构查找，避免了实例化 `Key` 类型对象的开销。
:994
---
---
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>
:1001
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1008
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
:1010
---
---
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>
:1017
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1024
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1026
---
---
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.value()`. `nh` is empty when the function returns.
若 `nh` 非空，则当且仅当哈希表中不存在与 `nh.value()` 键等价的元素时，将其关联元素插入哈希表。函数返回时 `nh` 变为空。
:1037
Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +
返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象。
:1038
If `nh` is empty, `inserted` is `false` and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。
:1039
Otherwise if the insertion took place, `inserted` is true and `node` is empty.
若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。
:1040
If the insertion failed, `inserted` is false and `node` has the previous value of `nh`.
若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。
Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
若 `nh` 非空，则当且仅当容器中不存在与 `nh.value()` 等效的键时，插入其关联的元素。函数返回时 `nh` 为空。
:1045
---
---
emplace_or_[c]visit
emplace_or_[c]visit
```c++ template<class... Args, class F> bool emplace_or_visit(Args&&... args, F&& f); template<class... Args, class F> bool emplace_or_cvisit(Args&&... args, F&& f); ```
```c++ template<class... args,="" class="" f=""> bool emplace_or_visit(Args&amp;&amp;... args, F&amp;&amp; f); template<class... args,="" class="" f=""> bool emplace_or_cvisit(Args&amp;&amp;... args, F&amp;&amp; f); ```</class...></class...>
Inserts an object, constructed with the arguments `args`, in the table if there is no element in the table with an equivalent key. Otherwise, invokes `f` with a const reference to the equivalent element.
若哈希表中不存在键等价的元素，则使用参数 `args` 构造对象并插入表中；否则，以该等价元素的常量引用为参数调用函数 `f`。
Requires:;; `value_type` is constructible from `args`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; The interface is exposition only, as C++ does not allow to declare a parameter `f` after a variadic parameter pack.
要求：;; `value_type` 可由 `args` 构造。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
注意：;; 该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明参数 `f`。
:1062
---
---
Copy insert_or_[c]visit
复制 insert++_++or++_[++c++]++visit
```c++ template<class F> bool insert_or_visit(const value_type& obj, F f); template<class F> bool insert_or_cvisit(const value_type& obj, F f); ```
```c++ template<class f=""> bool insert_or_visit(const value_type&amp; obj, F f); template<class f=""> bool insert_or_cvisit(const value_type&amp; obj, F f); ```</class></class>
:1070
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 const reference to the equivalent element.
当且仅当哈希表中不存在键等价的元素时，将 `obj` 插入表中；否则，以该等价元素的常量引用为参数调用函数 `f`。
:1074
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`.
要求：;; `value_type` 支持拷贝插入。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
English Chinese (Simplified Han script) Actions
Insert Iterator Range or Visit
迭代器范围插入或访问
Saving an concurrent_node_set to an archive
将 concurrent++_++node++_++set 保存到归档
_Pred_
_Pred_
_Allocator_
_Allocator_
```c++ concurrent_node_set(); ```
```c++ concurrent_node_set(); ```
Iterator Range Constructor
迭代器范围构造函数
Bucket Count Constructor with Hasher and Allocator
带哈希函数和分配器的桶数构造函数
Copy Assignment
复制赋值
Concurrency:;; Blocking on `*this` and `other`.
并发：;; 阻塞于 `*this` 和 `other`。
Initializer List Assignment
初始化列表赋值
Bulk visit
批量访问
Successively invokes `f` with const references to each of the elements in the table.
依次以表中每个元素的常量引用调用 `f`。
```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.value()`. `nh` is empty when the function returns.
若 `nh` 非空，则当且仅当哈希表中不存在与 `nh.value()` 键等价的元素时，将其关联元素插入哈希表。函数返回时 `nh` 变为空。
Serialization
序列化
Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`. Concurrency:;; Blocking on `x`.
要求;; `x.key++_++equal()` 需要在功能上等价于 `other.key++_++equal()` 。 并发性;; 阻塞于 `x` 。
Chunk size internally used in xref:concurrent_node_set_bulk_visit[bulk visit] operations.
xref:concurrent_node_set_bulk_visit[批量遍历]操作内部使用的块大小。
```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ```
```c++ size_type count(const key_type&amp; k) const; template<class k=""> size_type count(const K&amp; k) const; ```</class>
Insert Node or Visit
节点插入或访问
Transparent insert_and_[c]visit
透明 insert++_++and++_[++c++]++visit（透明插入并 ++[++c++]++ 访问）
```c++ template<class K, class F1, class F2> bool insert_and_visit(K&& k, F1 f1, F2 f2); template<class K, class F1, class F2> bool insert_and_cvisit(K&& k, F1 f1, F2 f2); ```
```c++ template<class k,="" class="" f1,="" f2=""> bool insert_and_visit(K&amp;&amp; k, F1 f1, F2 f2); template<class k,="" class="" f1,="" f2=""> bool insert_and_cvisit(K&amp;&amp; k, F1 f1, F2 f2); ```</class></class>
Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element.
当且仅当容器中不存在键等价的元素时，通过`std::forward<k>(k)`构造元素并插入容器，随后使用新建元素的常量引用调用`f1`。若存在等价键元素，则使用该元素的常量引用调用`f2`。</k>
Insert Iterator Range and Visit
迭代器范围插入并访问
```c++ template<class InputIterator,class F1, class F2> size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); template<class InputIterator,class F1, class f2> size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, F2 f2); ```
```c++ template<class inputiterator,class="" f1,="" class="" f2=""> size_type insert_and_visit(InputIterator first, InputIterator last, F1 f1, F2 f2); template<class inputiterator,class="" f1,="" class="" f2=""> size_type insert_and_cvisit(InputIterator first, InputIterator last, F1 f1, F2 f2); ```</class></class>
Insert Initializer List and Visit
初始化列表插入并访问
```c++ template<class F1, class F2> size_type insert_and_visit(std::initializer_list<value_type> il, F1 f1, F2 f2); template<class F1, class F2> size_type insert_and_cvisit(std::initializer_list<value_type> il, F1 f1, F2 f2); ```
```c++ template<class f1,="" class="" f2=""> size_type insert_and_visit(std::initializer_list<value_type> il, F1 f1, F2 f2); template<class f1,="" class="" f2=""> size_type insert_and_cvisit(std::initializer_list<value_type> il, F1 f1, F2 f2); ```</value_type></class></value_type></class>
`std::allocator_traits<Alloc>::allocate`
`std::allocator++_++traits++&lt;++Alloc++&gt;++::allocate`
`std::allocator_traits<Alloc>::deallocate`
`std::allocator++_++traits++&lt;++Alloc++&gt;++::deallocate`
Loading an concurrent_node_set from an archive
从归档加载 concurrent++_++node++_++set
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`.
删除 `concurrent++_++node++_++set` 容器 `x` 中所有已存在的元素，并从归档（XML 归档） `ar` 中插入原始 `concurrent++_++node++_++set` 容器 `other` 的元素副本，这些副本是从 `ar` 所读取的存储中恢复的。

Loading…

User avatar admin

Translation uploaded
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.value()`. `nh` is empty when the function returns.
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.value()`. `nh` is empty when the function returns.非空，则当且仅当哈希表中不存在与 `nh.value()` 键等价的元素时，将其关联元素插入哈希表。函数返回时 `nh` 变为空。
06/05/2026
User avatar admin

String added in the repository
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.value()`. `nh` is empty when the function returns.
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.value()`. `nh` is empty when the function returns.
06/05/2026
Browse all string changes

Glossary

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

String information

Flags
safe-html, strict-same
Unit identifier
53448
Source string location
:1033
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_set_zh_Hans.adoc, string 245