Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Move Constructor from unordered_flat

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:537	---	---
	Allocator Constructor	分配器构造函数
	```c++ explicit concurrent_flat_map(Allocator const& a); ```	```c++ explicit concurrent_flat_map(Allocator const& a); ```
	Constructs an empty table, using allocator `a`.	使用分配器a构造一个空表。
:546	---	---
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ concurrent_flat_map(concurrent_flat_map const& other, Allocator const& a); ```	```c++ concurrent_flat_map(concurrent_flat_map const& other, Allocator const& a); ```
	Constructs a table, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.	构造一个表，复制other的容器元素、哈希函数和谓词，但使用分配器a。
:556	Concurrency:;; Blocking on `other`.	并发特性：阻塞于 other
:558	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ concurrent_flat_map(concurrent_flat_map&& other, Allocator const& a); ```	```c++ concurrent_flat_map(concurrent_flat_map&& other, Allocator const& a); ```
	If `a == other.get_allocator()`, the elements of `other` are transferred directly to the new table; otherwise, elements are moved-constructed from those of `other`. The hash function and predicate are moved-constructed from `other`, and the allocator is copy-constructed from `a`. If statistics are xref:concurrent_flat_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff `a == other.get_allocator()`, and always calls `other.reset_stats()`.	若a == other.get_allocator()，则other的元素会直接转移到新表中；否则，元素从other移动构造而来。哈希函数与谓词从other移动构造，分配器从a拷贝构造。如果启用了 xref:concurrent_flat_map_boost_unordered_enable_stats [统计功能]：当且仅当a == other.get_allocator()时，从other转移内部统计信息始终调用other.reset_stats()
:573	Concurrency:;; Blocking on `other`.	并发特性：阻塞于 other
:575	---	---
	Move Constructor from unordered_flat_map	从 unordered_flat_map 的移动构造函数
	```c++ concurrent_flat_map(unordered_flat_map<Key, T, Hash, Pred, Allocator>&& other); ```	```c++ concurrent_flat_map(unordered_flat_map<key, t,="" hash,="" pred,="" allocator="">&& other); ```</key,>
	Move construction from a xref:#unordered_flat_map[`unordered_flat_map`]. The internal bucket array of `other` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:concurrent_flat_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	从 xref:#unordered_flat_map [unordered_flat_map] 进行移动构造。other的内部桶数组会直接转移到新容器中。哈希函数、谓词和分配器均从other移动构造而来。如果启用了 xref:concurrent_flat_map_boost_unordered_enable_stats [统计功能]，则从other转移内部统计信息，并调用other.reset_stats()。
	Complexity:;; O(`bucket_count()`)	复杂度：O (`bucket_count()`)
:592	---	---
	Initializer List Constructor	初始化列表构造函数
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `eql` 作为键相等性谓词、 `a` 作为分配器，并 `il` 中的元素插入其中。
:607	Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	要求;; 若使用默认值，则 `hasher` 、 `key++_++equal` 和 `allocator++_++type` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:609	---	---
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ concurrent_flat_map(size_type n, allocator_type const& a); ```	```c++ concurrent_flat_map(size_type n, allocator_type const& a); ```
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate and `a` as the allocator.	构造一个至少包含 n 个桶的空表，使用 hf 作为哈希函数、默认的键相等谓词，并以 a 作为分配器。
	Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：size() == 0 要求：hasher 和 key_equal 必须满足https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[默认可构造]要求。
:622	---	---
	Bucket Count Constructor with Hasher and Allocator	带哈希函数和分配器的桶数构造函数
	```c++ concurrent_flat_map(size_type n, hasher const& hf, allocator_type const& a); ```	```c++ concurrent_flat_map(size_type n, hasher const& hf, allocator_type const& a); ```

	English	Chinese (Simplified Han script)	Actions
	Move Constructor from unordered_flat_map	从 unordered_flat_map 的移动构造函数
	emplace	原地构造
	Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `f`.	返回值：被删除的元素数量。异常：仅当函数 `f` 抛出异常时才会抛出异常。
	Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the table.	与 `rehash` 功能类似，该函数可用于增大或缩小容器的桶数量。
	get_stats	get_stats
	```c++ stats get_stats() const; ```	```c++ stats get_stats() const; ```
	Returns:;; A statistical description of the insertion and lookup operations performed by the table so far. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:concurrent_flat_map_boost_unordered_enable_stats[enabled].	返回值：容器截至目前执行的插入与查找操作的统计描述信息。说明：仅当启用统计计算时，该函数才可用。
	Deduction Guides	推导指引
	A deduction guide will not participate in overload resolution if any of the following are true:	满足以下任一条件时，推导指引不参与重载决议：
	- It has an `InputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an `Allocator` template parameter and a type that does not qualify as an allocator is deduced for that parameter. - It has a `Hash` template parameter and an integral type or a type that qualifies as an allocator is deduced for that parameter. - It has a `Pred` template parameter and a type that qualifies as an allocator is deduced for that parameter.	- 该推导指引包含 `InputIterator` 模板参数，且为此参数推导出的类型不符合输入迭代器的要求。 - 该推导指引包含 `Allocator` 模板参数，且为该参数推导出的类型不符合分配器要求。 - 该推导指引包含 `Hash` 模板参数，且为该参数推导出的类型为整型或符合分配器要求。 - 该推导指引包含 `Pred` 模板参数，且为该参数推导出的类型符合分配器要求。
	Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`. Concurrency:;; Blocking on `x`.	要求;; `x.key++_++equal()` 需要在功能上等价于 `other.key++_++equal()` 。并发性;; 阻塞于 `x` 。
	_T_	_T_
	Constructors	构造函数
	emplace_and_[c]visit	emplace_and_[c]visit
	```c++ template<class... Args, class F1, class F2> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ```	```c++ template<class... args,="" class="" f1,="" f2=""> bool emplace_and_visit(Args&&... args, F1&& f1, F2&& f2); template<class... args,="" class="" f1,="" f2=""> bool emplace_and_cvisit(Args&&... args, F1&& f1, F2&& f2); ```</class...></class...>
	Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`.	等价于 `a.rehash(ceil(n / a.max_load_factor()))`。
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator==(const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	Returns `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).	若 `x.size() == y.size()`，且对于 `x` 中的每个元素，`y` 中均存在拥有相同键、值相等（使用 `operator==` 比较值类型）的元素，则返回 `true`。
	operator!	operator!
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	Returns `false` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).	若`x.size() == y.size()`，且`x`中每个元素在`y`中都存在键相同、值相等（使用`operator==`比较值类型）的元素，则返回`false`。
	Swap	交换
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> void swap(concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
	```c++ template<class K, class T, class H, class P, class A, class Predicate> typename concurrent_flat_map<K, T, H, P, A>::size_type erase_if(concurrent_flat_map<K, T, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" t,="" h,="" p,="" a,="" predicate=""> typename concurrent_flat_map<k, t,="" h,="" p,="" a="">::size_type erase_if(concurrent_flat_map<k, t,="" h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
	Serialization	序列化
	``concurrent_flat_map``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++_++flat++_++map` 可通过本组件库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization] 进行归档/检索。支持常规归档与 XML 归档两种格式。
	Saving an concurrent_flat_map to an archive	将concurrent++_++flat++_++map保存到归档
	Saves all the elements of a `concurrent_flat_map` `x` to an archive (XML archive) `ar`.	将 `concurrent++_++flat++_++map` 容器 `x` 的所有元素保存到归档（XML归档） `ar` 中。
	Requires:;; `std::remove_const<key_type>::type` and `std::remove_const<mapped_type>::type` are serializable (XML serializable), and they do support Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types). Concurrency:;; Blocking on `x`.	要求：`std::remove_const<key_type>::type` 和 `std::remove_const<mapped_type>::type` 必须是可序列化的（支持 XML 序列化），并且它们支持 Boost.Serialization 的 `save_construct_data` / `load_construct_data` 协议（https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^] 类型自动支持该协议）。并发：阻塞 `x`。</mapped_type></key_type>
	Loading an concurrent_flat_map from an archive	从归档加载concurrent++_++flat++_++map

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 40 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

53796

Source string location

:577

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 99

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