Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1438	---	---
:1440	erase_if	erase_if
	```c++ template<class F> size_type erase_if(F f); ```	```c++ template<class f=""> size_type erase_if(F f); ```</class>
	Successively invokes `f` with non-const references to each of the elements in the table, and erases those for which `f` returns `true`.	依次以非常量引用为参数，对容器中的每个元素调用`f`，并删除所有`f`返回`true`的元素。
	Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `f`.	返回值：被删除的元素数量。异常：仅当函数 `f` 抛出异常时才会抛出异常。
:1451	---	---
	Parallel erase_if	并行条件擦除
	```c++ template<class ExecutionPolicy, class F> void erase_if(ExecutionPolicy&& policy, F f); ```	```c++ template<class executionpolicy,="" class="" f=""> void erase_if(ExecutionPolicy&& policy, F f); ```</class>
	Invokes `f` with non-const 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:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + This overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed.	异常：根据所使用执行策略的异常处理机制，若`f`内部抛出异常，可能会调用`std::terminate`终止程序。说明：仅在支持C++17并行算法的编译器中可用。仅当`std::is_execution_policy_v<std::remove_cvref_t<executionpolicy>>`为`true`时，该重载版本参与重载决议。不允许使用无顺序执行策略。</std::remove_cvref_t<executionpolicy>
:1469	---	---
	swap	交换
	```c++ void swap(concurrent_flat_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value \|\| boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```	```c++ void swap(concurrent_flat_map& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value \|\| boost::allocator_traits<allocator>::propagate_on_container_swap::value); ```</allocator></allocator>
	Swaps the contents of the table with the parameter.	将当前容器的内容与参数容器进行交换。
	If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the tables' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.	若`Allocator::propagate_on_container_swap`已定义且其值为`true`，则交换两个容器的分配器；否则，使用不相等的分配器进行交换会导致未定义行为。
	Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; Blocking on `*this` and `other`.	异常：除非`key_equal`或`hasher`在交换时抛出异常，否则不抛出任何异常。并发：会阻塞当前对象`*this`和参数对象`other`。
:1486	---	---
	clear	清空
	```c++ void clear() noexcept; ```	```c++ void clear() noexcept; ```
	Erases all elements in the table.	清空容器中的所有元素。
	Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()` Concurrency:;; Blocking on `*this`.	后置条件：容器大小 `size() == 0`，且 `max_load() >= max_load_factor() * bucket_count()` 并发：会阻塞当前对象 `*this`。
:1499	---	---
	merge	合并
	```c++ template<class H2, class P2> size_type merge(concurrent_flat_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> size_type merge(concurrent_flat_map<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> size_type merge(concurrent_flat_map<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> size_type merge(concurrent_flat_map<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>
	Move-inserts all the elements from `source` whose key is not already present in `*this`, and erases them from `source`.	将来源容器`source`中所有*键不存在于当前容器`this`中的元素移动插入**到当前容器，并从`source`中擦除这些元素。
	Returns:;; The number of elements inserted. Concurrency:;; Blocking on `*this` and `source`.	返回值：插入的元素数量。并发：会阻塞当前对象 `*this` 和源对象 `source`。
:1515	---	---
	Observers	观察器
	get_allocator	get_allocator
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	Returns:;; The table's allocator.	返回值：容器的分配器。

	English	Chinese (Simplified Han script)	Actions
	```c++ template<class M> bool insert_or_assign(const key_type& k, M&& obj); template<class M> bool insert_or_assign(key_type&& k, M&& obj); template<class K, class M> bool insert_or_assign(K&& k, M&& obj); ```	```c++ template<class m=""> bool insert_or_assign(const key_type& k, M&& obj); template<class m=""> bool insert_or_assign(key_type&& k, M&& obj); template<class k,="" class="" m=""> bool insert_or_assign(K&& k, M&& obj); ```</class></class></class>
	Inserts a new element into the table or updates an existing one by assigning to the contained value.	向容器插入新元素，或通过赋值给容器内已存值来更新现有元素。
	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	若容器中存在键为`k`的元素，则通过`std::forward<m>(obj)`赋值来更新该元素。</m>
	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. + + The `template<class K, class M>` 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.	返回值：插入成功时返回`true`。并发：执行重哈希操作时会阻塞当前对象`*this`。说明：若触发重哈希，将使指向元素的指针和引用失效。 `template<class k,="" class="" m="">` 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为有效成员类型别名时才参与重载决议。库假定`Hash`可同时接受`K`与`Key`类型参数调用，且`Pred`是透明的。这支持异构查找，避免了实例化`Key`类型对象的开销。</class>
	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>
	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`抛出异常时才会抛出异常。说明：仅当`Hash::is_transparent`和`Pred::is_transparent`为有效的成员类型别名时，`template<class k="">`重载版本才参与重载决议。库假定`Hash`可同时接受`K`与`Key`类型的参数调用，且`Pred`是透明的。该设计支持异构查找，避免了实例化`Key`类型对象的开销。</class>
	```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>
	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:;; `f` is passed a non-const reference to `x`. + + 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`抛出异常时才会抛出异常。说明：`f`接收元素`x`的非常量引用。仅当`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>
	```c++ template<class F> size_type erase_if(F f); ```	```c++ template<class f=""> size_type erase_if(F f); ```</class>
	Successively invokes `f` with non-const references to each of the elements in the table, and erases those for which `f` returns `true`.	依次以非常量引用为参数，对容器中的每个元素调用`f`，并删除所有`f`返回`true`的元素。
	Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + This overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed.	异常：根据所使用执行策略的异常处理机制，若`f`内部抛出异常，可能会调用`std::terminate`终止程序。说明：仅在支持C++17并行算法的编译器中可用。仅当`std::is_execution_policy_v<std::remove_cvref_t<executionpolicy>>`为`true`时，该重载版本参与重载决议。不允许使用无顺序执行策略。</std::remove_cvref_t<executionpolicy>
	```c++ void swap(concurrent_flat_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value \|\| boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```	```c++ void swap(concurrent_flat_map& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value \|\| boost::allocator_traits<allocator>::propagate_on_container_swap::value); ```</allocator></allocator>
	Swaps the contents of the table with the parameter.	将当前容器的内容与参数容器进行交换。
	If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the tables' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.	若`Allocator::propagate_on_container_swap`已定义且其值为`true`，则交换两个容器的分配器；否则，使用不相等的分配器进行交换会导致未定义行为。
	Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; Blocking on `*this` and `other`.	异常：除非`key_equal`或`hasher`在交换时抛出异常，否则不抛出任何异常。并发：会阻塞当前对象`*this`和参数对象`other`。
	merge	合并
	```c++ template<class H2, class P2> size_type merge(concurrent_flat_map<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> size_type merge(concurrent_flat_map<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> size_type merge(concurrent_flat_map<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> size_type merge(concurrent_flat_map<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>
	Move-inserts all the elements from `source` whose key is not already present in `*this`, and erases them from `source`.	将来源容器`source`中所有*键不存在于当前容器`this`中的元素移动插入**到当前容器，并从`source`中擦除这些元素。
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	Returns:;; The table's allocator.	返回值：容器的分配器。
	hash_function	哈希函数
	``` hasher hash_function() const; ```	``` hasher hash_function() const; ```
	Returns:;; The table's hash function.	返回值：容器的哈希函数。
	Returns:;; The number of elements with key equivalent to `k` (0 or 1). 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. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.	返回值：匹配键 `k` 的元素数量（0 或 1）。说明：仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为有效成员类型别名时，`template<class k="">` 重载版本才参与重载决议。库假定哈希函数可同时作用于 `K` 类型与键类型，且相等谓词是透明的，从而支持异构查找，避免实例化键类型带来的开销。若存在并发插入操作，返回值可能无法精确反映容器执行后的真实状态。</class>
	contains	包含
	```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```	```c++ bool contains(const key_type& k) const; template<class k=""> bool contains(const K& k) const; ```</class>
	```c++ size_type max_load() const noexcept; ```	```c++ size_type max_load() const noexcept; ```
	Equality Comparisons	相等性比较
	operator	operator

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

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

54045

Source string location

:1483

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_map_zh_Hans.adoc, string 348

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

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file