Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Node Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Requires:;; `value_type` is constructible from `args`. Returns:;; `true` if an …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1138	Equivalent to [listing,subs="+macros,+quotes"]	等价于 [listing,subs="+macros,+quotes"]
:1145	Returns:;; The number of elements inserted.	返回值：;; 成功插入的元素个数。
:1147	---	---
	Insert Node or Visit	节点插入或访问
	```c++ template<class F> insert_return_type insert_or_visit(node_type&& nh, F f); template<class F> insert_return_type insert_or_cvisit(node_type&& nh, F f); ```	```c++ template<class f=""> insert_return_type insert_or_visit(node_type&& nh, F f); template<class f=""> insert_return_type insert_or_cvisit(node_type&& nh, F f); ```</class></class>
	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&&... args, F1&& f1, F2&& f2); template<class... args,="" class="" f1,="" f2=""> bool emplace_or_cvisit(Args&&... args, F1&& f1, F2&& 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& obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(const value_type& 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&& obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(value_type&& 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&& k, F1 f1, F2 f2); template<class k,="" class="" f1,="" f2=""> bool insert_and_cvisit(K&& 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` 类型对象的开销。

	English	Chinese (Simplified Han script)	Actions
	If an element `x` exists with key equivalent to `k`, invokes `f` with a const reference to `x`.	若存在键与 `k` 等价的元素 `x`，则使用指向 `x` 的常量引用调用 `f`。
	Returns:;; The number of elements visited.	返回值：;; 被访问的元素数量。
	```c++ template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f); template<class ExecutionPolicy, class F> void visit_all(ExecutionPolicy&& policy, F f) const; template<class ExecutionPolicy, class F> void cvisit_all(ExecutionPolicy&& policy, F f) const; ```	```c++ template<class executionpolicy,="" class="" f=""> void visit_all(ExecutionPolicy&& policy, F f); template<class executionpolicy,="" class="" f=""> void visit_all(ExecutionPolicy&& policy, F f) const; template<class executionpolicy,="" class="" f=""> void cvisit_all(ExecutionPolicy&& policy, F f) const; ```</class></class></class>
	size	大小
	```c++ size_type size() const noexcept; ```	```c++ size_type size() const noexcept; ```
	```c++ bool insert(value_type&& obj); ```	```c++ bool insert(value_type&& obj); ```
	```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ```	```c++ template<class inputiterator=""> size_type insert(InputIterator first, InputIterator last); ```</class>
	``concurrent_node_set``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.	`concurrent++_++node++_++set` 可通过本组件库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization] 进行归档/检索。支持常规归档与 XML 归档两种格式。
	Copy insert_or_[c]visit	复制 insert++_++or++_[++c++]++visit
	Move insert_or_[c]visit	移动 insert++_++or++_[++c++]++visit
	```c++ template<class F> insert_return_type insert_or_visit(node_type&& nh, F f); template<class F> insert_return_type insert_or_cvisit(node_type&& nh, F f); ```	```c++ template<class f=""> insert_return_type insert_or_visit(node_type&& nh, F f); template<class f=""> insert_return_type insert_or_cvisit(node_type&& nh, F f); ```</class></class>
	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`。
	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` 。
	emplace_and_[c]visit	emplace_and_[c]visit
	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` 参数。
	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& obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(const value_type& obj, F1 f2, F2 f2); ```</class></class>
	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&& obj, F1 f1, F2 f2); template<class f1,="" class="" f2=""> bool insert_and_cvisit(value_type&& obj, F1 f1, F2 f2); ```</class></class>
	Insert Node and Visit	节点插入并访问
	erase	擦除
	Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `f`.	返回值：;; 删除的元素数量。异常：;; 仅当 `f` 抛出异常时才会抛出异常。
	Parallel erase_if	并行条件擦除
	Iterator Range Constructor with Bucket Count and Hasher	带桶数和哈希函数的迭代器范围构造函数
	Invokes `f` with references to each of the elements in the table, and erases those for which `f` returns `true`. Execution is parallelized according to the semantics of the execution policy specified.	以表中每个元素的引用调用 `f`，并删除所有 `f` 返回 `true` 的元素。执行过程将根据指定执行策略的语义进行并行化处理。
	Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; Blocking on `*this` and `other`.	异常：;; 除非 `key_equal` 或 `hasher` 在交换时抛出异常，否则不抛出任何异常。并发：;; 阻塞 `*this` 和 `other`。
	```c++ template<class F> node_type extract_if(const key_type& k, F f); template<class K, class F> node_type extract_if(K&& k, F f); ```	```c++ template<class f=""> node_type extract_if(const key_type& k, F f); template<class k,="" class="" f=""> node_type extract_if(K&& k, F f); ```</class></class>
	Extracts the element `x` with key equivalent to `k`, if it exists and `f(x)` is `true`.	若键与 `k` 等价的元素 `x` 存在且 `f(x)` 为 `true`，则提取该元素。
	```c++ template<class H2, class P2> size_type merge(concurrent_node_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> size_type merge(concurrent_node_set<Key, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> size_type merge(concurrent_node_set<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> size_type merge(concurrent_node_set<key, h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 227 characters editedCurrent translationState: Translated

~~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可由 `args` 构造。
返回值：;; 若成功插入元素则返回 `true`。
并发特性：;; 会阻塞当前对象的重哈希操作。
注意：;; 该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明 `f1` ~~and~~和 `f2` ~~after a variadic parameter pack.~~参数。

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 280 characters editedPrevious translationState: Needs editing (Needs rewriting)

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

Flags

safe-html, strict-same

Unit identifier

53497

Source string location

:1183

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 294

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Translation

Things to check

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file