Zen

Translation

:1201
English
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`.
66/1980 · 198

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
If `nh` is empty, does nothing. Otherwise, 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()`. Otherwise, invokes `f` with a const reference to the equivalent element.
若 `nh` 为空，则不执行任何操作。否则，当且仅当哈希表中不存在与 `nh.value()` 键等价的元素时，将其关联元素插入表中；否则，以该等价元素的常量引用为参数调用函数 `f`。
: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` 的原值。
Throws:;; If an exception is thrown by an operation other than a call to `hasher` or call to `f`, 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()` 等效的键时，插入其关联的元素；否则，使用指向等效元素的常量引用调用 `f` 。
:1168
---
---
emplace_and_[c]visit
emplace_and_[c]visit
```c++ template<class... Args, class F1, class F2> bool emplace_or_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_or_cvisit(Args&&... args, F1&& f1, F2&& f2); ```
```c++ template<class... args,="" class="" f1,="" f2=""> bool emplace_or_visit(Args&amp;&amp;... args, F1&amp;&amp; f1, F2&amp;&amp; f2); template<class... args,="" class="" f1,="" f2=""> bool emplace_or_cvisit(Args&amp;&amp;... args, F1&amp;&amp; f1, F2&amp;&amp; f2); ```</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, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element.
若哈希表中不存在键等价的元素，则使用参数 `args` 构造对象并插入表中，随后以新建元素的常量引用为参数调用函数 `f1`；否则，以该等价元素的常量引用为参数调用函数 `f2`。
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 parameters `f1` and `f2` after a variadic parameter pack.
要求：;; `value_type` 可由 `args` 构造。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象的重哈希操作。
注意：;; 该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明 `f1` 和 `f2` 参数。
:1188
---
---
Copy insert_and_[c]visit
复制 insert++_++and++_[++c++]++visit
```c++ template<class F1, class F2> bool insert_and_visit(const value_type& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(const value_type& obj, F1 f2, F2 f2); ```
```c++ template<class f1,="" class="" f2=""> bool insert_and_visit(const value_type&amp; obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(const value_type&amp; obj, F1 f2, F2 f2); ```</class></class>
Inserts `obj` in the table if and only if there is no element in the table with an equivalent key, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f` with a const reference to the equivalent element.
当且仅当哈希表中不存在键等价的元素时，将 `obj` 插入表中，随后以新建元素的常量引用为参数调用函数 `f1`；否则，以该等价元素的常量引用为参数调用函数 `f`。
:1201
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`。
并发特性：会阻塞当前对象的重哈希操作。
:1205
---
---
Move insert_and_[c]visit
移动 insert++_++and++_[++c++]++visit
```c++ template<class F1, class F2> bool insert_and_visit(value_type&& obj, F1 f1, F2 f2); template<class F1, class F2> bool insert_and_cvisit(value_type&& obj, F1 f1, F2 f2); ```
```c++ template<class f1,="" class="" f2=""> bool insert_and_visit(value_type&amp;&amp; obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(value_type&amp;&amp; obj, F1 f1, F2 f2); ```</class></class>
Inserts `obj` in the table if and only if there is no element in the table 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.
当且仅当哈希表中不存在键等价的元素时，将 `obj` 插入表中，随后以新建元素的常量引用为参数调用函数 `f1`；否则，以该等价元素的常量引用为参数调用函数 `f2`。
要求：`value_type` 支持拷贝插入。
返回值：若成功插入元素则返回 `true`。
并发特性：会阻塞当前对象的重哈希操作。
:1218
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` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]。
返回值：;; 插入成功则返回 `true`。
并发特性：;; 会阻塞 `*this` 的重哈希操作。
:1222
---
---
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>
:1235
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` 满足 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^]。
返回值：;; 插入成功则返回 `true`。
并发特性：;; 会阻塞 `*this` 的重哈希操作。
注意：;; 仅当 `Hash::is_transparent` 与 `Pred::is_transparent` 为合法成员类型别名时，此类重载函数才参与重载决议。本库假定 `Hash` 可接收 `K` 与 `Key` 两种类型进行调用，且 `Pred` 具备透明特性。该特性支持异构查找，省去了实例化 `Key` 类型对象的开销。
:1240
---
---
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>
:1250
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1257
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
Key English Chinese (Simplified Han script) Actions
: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` 的原值。
:1168
---
---
:1188
---
---
:1201
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`。
并发特性：会阻塞当前对象的重哈希操作。
:1205
---
---
:1218
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` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]。
返回值：;; 插入成功则返回 `true`。
并发特性：;; 会阻塞 `*this` 的重哈希操作。
:1222
---
---
:1235
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` 满足 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^]。
返回值：;; 插入成功则返回 `true`。
并发特性：;; 会阻塞 `*this` 的重哈希操作。
注意：;; 仅当 `Hash::is_transparent` 与 `Pred::is_transparent` 为合法成员类型别名时，此类重载函数才参与重载决议。本库假定 `Hash` 可接收 `K` 与 `Key` 两种类型进行调用，且 `Pred` 具备透明特性。该特性支持异构查找，省去了实例化 `Key` 类型对象的开销。
:1240
---
---
:1250
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1257
Returns:;; The number of elements inserted.
返回值：;; 成功插入的元素数量。
:1259
---
---
:1269
Equivalent to [listing,subs="+macros,+quotes"]
等价于 [listing,subs="+macros,+quotes"]
:1276
Returns:;; The number of elements inserted.
返回值：;; 已插入的元素数量。
:1278
---
---
:1294
Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +
返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象：+
:1295
If `nh` is empty, `inserted` is `false` and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。
:1296
Otherwise if the insertion took place, `inserted` is true and `node` is empty.
若插入操作成功，则 `inserted` 为 true， 且 `node` 为空。

Loading…

User avatar admin

Translation uploaded
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`.
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`.支持拷贝插入。
返回值：若成功插入元素则返回 `true`。
并发特性：会阻塞当前对象的重哈希操作。
:1201
06/05/2026
User avatar admin

String added in the repository
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`.
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`.
:1201
06/05/2026
Browse all string changes

Things to check

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

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

String information

Key
:1201
Flags
safe-html, strict-same
Unit identifier
53502
Source string location
:1201
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 299