Zen

Translation

:1086
English
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.
58/1710 · 171

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
: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` 的扩容重哈希操作。
:1078
---
---
Move insert_or_[c]visit
移动 insert++_++or++_[++c++]++visit
```c++ template<class F> bool insert_or_visit(value_type&& obj, F f); template<class F> bool insert_or_cvisit(value_type&& obj, F f); ```
```c++ template<class f=""> bool insert_or_visit(value_type&amp;&amp; obj, F f); template<class f=""> bool insert_or_cvisit(value_type&amp;&amp; obj, F f); ```</class></class>
:1086
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`。
:1090
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`.
要求：;; `value_type` 支持移动插入。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
:1094
---
---
Transparent insert_or_[c]visit
透明 insert++_++or++_[++c++]++visit
```c++ template<class K, class F> bool insert_or_visit(K&& k, F f); template<class K, class F> bool insert_or_cvisit(K&& k, F f); ```
```c++ template<class k,="" class="" f=""> bool insert_or_visit(K&amp;&amp; k, F f); template<class k,="" class="" f=""> bool insert_or_cvisit(K&amp;&amp; k, F f); ```</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. Otherwise, invokes `f` with a const reference to the equivalent element.
当且仅当容器中不存在键等价的元素时，使用 `std::forward<k>(k)` 构造元素并插入容器；否则，以该等价元素的常量引用为参数调用函数 `f`。</k>
:1106
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:;; These overloads only participate 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` 类型对象的开销。
:1111
---
---
Insert Iterator Range or Visit
迭代器范围插入或访问
```c++ template<class InputIterator,class F> size_type insert_or_visit(InputIterator first, InputIterator last, F f); template<class InputIterator,class F> size_type insert_or_cvisit(InputIterator first, InputIterator last, F f); ```
```c++ template<class inputiterator,class="" f=""> size_type insert_or_visit(InputIterator first, InputIterator last, F f); template<class inputiterator,class="" f=""> size_type insert_or_cvisit(InputIterator first, InputIterator last, F f); ```</class></class>
:1121
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1128
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1130
---
---
Insert Initializer List or Visit
初始化列表插入或访问
```c++ template<class F> size_type insert_or_visit(std::initializer_list<value_type> il, F f); template<class F> size_type insert_or_cvisit(std::initializer_list<value_type> il, F f); ```
```c++ template<class f=""> size_type insert_or_visit(std::initializer_list<value_type> il, F f); template<class f=""> size_type insert_or_cvisit(std::initializer_list<value_type> il, F f); ```</value_type></class></value_type></class>
:1138
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
Key English Chinese (Simplified Han script) Actions
:1001
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1008
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
:1010
---
---
:1017
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1024
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1026
---
---
: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` 的原值。
:1045
---
---
:1062
---
---
: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` 的扩容重哈希操作。
:1078
---
---
:1086
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`。
:1090
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`.
要求：;; `value_type` 支持移动插入。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象 `*this` 的扩容重哈希操作。
:1094
---
---
:1106
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:;; These overloads only participate 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` 类型对象的开销。
:1111
---
---
:1121
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1128
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1130
---
---
:1138
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1145
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素个数。
:1147
---
---
:1160
Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +
返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象。
:1161
If `nh` is empty, `inserted` is `false` and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。
:1162
Otherwise if the insertion took place, `inserted` is true and `node` is empty.
若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。
:1163
If the insertion failed, `inserted` is false and `node` has the previous value of `nh`.
若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。

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. Otherwise, invokes `f` with a const reference to the equivalent element.
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`。
:1086
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. Otherwise, invokes `f` with a const reference to the equivalent element.
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.
:1086
06/05/2026
Browse all string changes

Glossary

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

String information

Key
:1086
Flags
safe-html, strict-same
Unit identifier
53467
Source string location
:1086
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 264