Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Returns:;; The number of elements inserted.

Zen

Translation

Key :1184

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1124	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:;; Invalidates pointers and references to elements if a rehashing is issued.	前置要求：;; `value_type` 满足可复制插入要求。返回值：;; 成功插入元素时返回 `true`。并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。注意：;; 若执行重哈希，将使指向元素的指针和引用失效。
:1129	---	---
	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>
:1137	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`。
:1142	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:;; Invalidates pointers and references to elements if a rehashing is issued.	要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]。返回值：;; 执行插入操作则返回 `true`。并发特性：;; 对 `*this` 执行重哈希时会阻塞。备注：;; 执行重哈希后，指向元素的指针和引用将会失效。
:1147	---	---
	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>
:1160	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:;; Invalidates pointers and references to elements if a rehashing is issued. + + 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` 类型对象的开销。
:1167	---	---
	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>
:1177	Equivalent to [listing,subs="+macros,+quotes"]	等效于 [listing,subs="+macros,+quotes"]
:1184	Returns:;; The number of elements inserted.	返回值：;; 插入的元素数量。
:1186	---	---
	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>
:1196	Equivalent to [listing,subs="+macros,+quotes"]	等效于 [listing,subs="+macros,+quotes"]
:1203	Returns:;; The number of elements inserted.	返回值：;; 插入的元素数量。
:1205	---	---
	erase	擦除
	```c++ size_type erase(const key_type& k); template<class K> size_type erase(const K& k); ```	```c++ size_type erase(const key_type& k); template<class k=""> size_type erase(const K& k); ```</class>
	Erases the element with key equivalent to `k` if it exists.	若存在键与`k`等价的元素，则将其删除。
	Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; The `template<class K>` 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.	返回值：;; 删除的元素数量（0 或 1）。抛出：;; 仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出异常。备注：;; `template<class k="">` 重载仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员类型别名时才参与重载决议。标准库假定 `Hash` 可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找，避免了实例化 `Key` 类型对象的开销。</class>
:1220	---	---
	erase_if by Key	通过键进行条件擦除
	```c++ template<class F> size_type erase_if(const key_type& k, F f); template<class K, class F> size_type erase_if(const K& k, F f); ```	```c++ template<class f=""> size_type erase_if(const key_type& k, F f); template<class k,="" class="" f=""> size_type erase_if(const K& k, F f); ```</class></class>
	Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is `true`.	若键与`k`等价的元素存在且`f(x)`为`true`，则删除该元素`x`。
	Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` 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.	返回值：;; 删除的元素数量（0 或 1）。抛出：;; 仅当 `hasher`、`key_equal` 或 `f` 抛出异常时才会抛出异常。备注：;; 仅当 `std::is_execution_policy_v<std::remove_cvref_t<executionpolicy>>` 为 `false` 时，`template<class k,="" class="" f="">` 重载才参与重载决议。仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员类型别名时，`template<class k,="" class="" f="">` 重载才参与重载决议。标准库假定 `Hash` 可同时接受 `K` 与 `Key` 类型调用，且 `Pred` 是透明的。这实现了异构查找，避免了实例化 `Key` 类型对象的开销。</class></class></std::remove_cvref_t<executionpolicy>

Key	English	Chinese (Simplified Han script)
:1070	Returns:;; The number of elements inserted.	返回值：;; 成功插入的元素数量。
:1072	---	---
:1080	Equivalent to [listing,subs="+macros,+quotes"]	等效于 [listing,subs="+macros,+quotes"]
:1087	Returns:;; The number of elements inserted.	返回值：;; 成功插入的元素数量。
:1089	---	---
:1111	---	---
:1119	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`。
:1124	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:;; Invalidates pointers and references to elements if a rehashing is issued.	前置要求：;; `value_type` 满足可复制插入要求。返回值：;; 成功插入元素时返回 `true`。并发特性：;; 若触发重哈希，则会阻塞当前对象 `*this`。注意：;; 若执行重哈希，将使指向元素的指针和引用失效。
:1129	---	---
:1137	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`。
:1142	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:;; Invalidates pointers and references to elements if a rehashing is issued.	要求：;; `value_type` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]。返回值：;; 执行插入操作则返回 `true`。并发特性：;; 对 `*this` 执行重哈希时会阻塞。备注：;; 执行重哈希后，指向元素的指针和引用将会失效。
:1147	---	---
:1160	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:;; Invalidates pointers and references to elements if a rehashing is issued. + + 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` 类型对象的开销。
:1167	---	---
:1177	Equivalent to [listing,subs="+macros,+quotes"]	等效于 [listing,subs="+macros,+quotes"]
:1184	Returns:;; The number of elements inserted.	返回值：;; 插入的元素数量。
:1186	---	---
:1196	Equivalent to [listing,subs="+macros,+quotes"]	等效于 [listing,subs="+macros,+quotes"]
:1203	Returns:;; The number of elements inserted.	返回值：;; 插入的元素数量。
:1205	---	---
:1220	---	---
:1237	---	---
:1239	erase_if	erase++_++if
:1250	---	---
:1268	---	---
:1285	---	---
:1298	---	---
:1314	---	---
:1326	---	---
:1336	---	---

Loading…

admin

Translation uploaded

English

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

Context

06/05/2026

admin

String added in the repository

English

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

Context

06/05/2026

Browse all string changes

Glossary

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

String information

Key

:1184

Flags

safe-html, strict-same

Unit identifier

50433

Source string location

:1184

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_flat_set_zh_Hans.adoc, string 290

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

Glossary

String information

Key

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file