Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Node Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: If `a == other.get_allocator()`, the elements of `other` are transferred …

Zen

Translation

English

If à == other.get_allocator()`, the elements of òther` are transferred directly to the new table; otherwise, elements are moved-constructed from those of òther`. The hash function and predicate are moved-constructed from òther`, and the allocator is copy-constructed from à`. If statistics are xref:concurrent_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from òther` iff à == other.get_allocator()`, and always calls òther.reset_stats()`.

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```c++ template<class InputIterator> concurrent_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```	```c++ template<class inputiterator=""> concurrent_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```</class>
	Constructs an empty table using `a` as the allocator, with the default hash function and key equality predicate and inserts the elements from `[f, l)` into it.	构造一个以 `a` 为分配器、使用默认哈希函数与键相等谓词的空哈希表，并将 `[f, l)` 范围内的元素插入其中。
:587	Requires:;; `hasher`, `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	要求：;; `hasher`、`key_equal` 必须满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[默认可构造]。
:589	---	---
	Allocator Constructor	分配器构造函数
	```c++ explicit concurrent_node_map(Allocator const& a); ```	```c++ explicit concurrent_node_map(Allocator const& a); ```
	Constructs an empty table, using allocator `a`.	构造一个空哈希表，使用分配器 `a`。
:598	---	---
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ concurrent_node_map(concurrent_node_map const& other, Allocator const& a); ```	```c++ concurrent_node_map(concurrent_node_map const& other, Allocator const& a); ```
	Constructs a table, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.	构造一个哈希表，复制 `other` 的容器元素、哈希函数和谓词，但使用分配器 `a`。
:608	Concurrency:;; Blocking on `other`.	并发：;; 阻塞 `other`。
:610	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ concurrent_node_map(concurrent_node_map&& other, Allocator const& a); ```	```c++ concurrent_node_map(concurrent_node_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_node_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_node_map_boost_unordered_enable_stats[统计功能]，仅当 `a == other.get_allocator()` 时从 `other` 转移内部统计信息，且始终调用 `other.reset_stats()`。
:625	Concurrency:;; Blocking on `other`.	并发：;; 阻塞 `other`。
:627	---	---
	Move Constructor from unordered_node_map	基于 unordered_node_map 的移动构造函数
	```c++ concurrent_node_map(unordered_node_map<Key, T, Hash, Pred, Allocator>&& other); ```	```c++ concurrent_node_map(unordered_node_map<key, t,="" hash,="" pred,="" allocator="">&& other); ```</key,>
	Move construction from a xref:#unordered_node_map[`unordered_node_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_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	通过 xref:#unordered_node_map[`unordered_node_map`] 进行移动构造。将 `other` 的内部桶数组直接转移到新容器中。哈希函数、谓词和分配器均从 `other` 移动构造而来。若启用了 xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，则从 `other` 转移内部统计信息，并调用 `other.reset_stats()`。
	Complexity:;; O(`bucket_count()`)	复杂度：;; O(`bucket_count()`)
:644	---	---
	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` 中的元素插入其中。
:659	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[可默认构造] 要求。
:661	---	---
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ concurrent_node_map(size_type n, allocator_type const& a); ```	```c++ concurrent_node_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[默认可构造]。

	English	Chinese (Simplified Han script)	Actions
	Requires:;; `value_type` is copy constructible Concurrency:;; Blocking on `other`.	要求：;; `value_type` 是可复制构造的并发：;; 阻塞 `other`
	The move constructor. The internal bucket array of `other` is transferred directly to the new table. The hash function, predicate and allocator are moved-constructed from `other`. If statistics are xref:concurrent_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	移动构造函数。将 `other` 的内部桶数组直接转移到新哈希表中。哈希函数、谓词和分配器均从 `other` 移动构造而来。若启用了 xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，则从 `other` 转移内部统计信息，并调用 `other.reset_stats()`。
	Iterator Range Constructor with Allocator	带分配器的迭代器范围构造函数
	Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the table.	效果：;; 必要时调整桶数组的大小，使桶数量至少为 `n`，且负载因子小于等于最大负载因子。适用时，该操作会增大或缩小容器的桶数量 `bucket_count()`。
	```c++ template<class InputIterator> concurrent_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```	```c++ template<class inputiterator=""> concurrent_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```</class>
	Constructs an empty table using `a` as the allocator, with the default hash function and key equality predicate and inserts the elements from `[f, l)` into it.	构造一个以 `a` 为分配器、使用默认哈希函数与键相等谓词的空哈希表，并将 `[f, l)` 范围内的元素插入其中。
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ concurrent_node_map(concurrent_node_map const& other, Allocator const& a); ```	```c++ concurrent_node_map(concurrent_node_map const& other, Allocator const& a); ```
	```c++ void reserve(size_type n); ```	```c++ void reserve(size_type n); ```
	Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`.	效果：;; 等价于 `a.rehash(ceil(n / a.max_load_factor()))`。
	Constructs a table, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.	构造一个哈希表，复制 `other` 的容器元素、哈希函数和谓词，但使用分配器 `a`。
	Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the table.	效果：;; 与 `rehash` 功能类似，该函数可用于增大或缩小容器的桶数量。
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ concurrent_node_map(concurrent_node_map&& other, Allocator const& a); ```	```c++ concurrent_node_map(concurrent_node_map&& other, Allocator const& a); ```
	Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the table's hash function or comparison function. Concurrency:;; Blocking on `*this`.	抛出异常：;; 若抛出异常，函数不会产生任何效果（由容器的哈希函数或比较函数抛出的异常除外）。并发特性：;; 阻塞当前容器 `*this`。
	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_node_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_node_map_boost_unordered_enable_stats[统计功能]，仅当 `a == other.get_allocator()` 时从 `other` 转移内部统计信息，且始终调用 `other.reset_stats()`。
	Statistics	统计信息
	get_stats	get_stats
	Effects:;; Sets to zero the internal statistics kept by the table. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:concurrent_node_map_boost_unordered_enable_stats[enabled].	效果：;; 将容器维护的内部统计数据归零。注意：;; 仅当 xref:reference/stats.adoc#stats[statistics calculation] 被 xref:concurrent_node_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` 模板参数，且为该参数推导出的类型符合分配器要求。
	A `size_type` parameter type in a deduction guide refers to the `size_type` member type of the table type deduced by the deduction guide. Its default value coincides with the default value of the constructor selected.	推导指引中的 `size++_++type` 参数类型，指向由该推导指引所推导容器类型的 `size++_++type` 成员类型。其默认值与所选构造函数的默认值一致。
	__iter-value-type__	_iter-value-type_
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const concurrent_node_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_node_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const concurrent_node_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_node_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ concurrent_node_map(size_type n, allocator_type const& a); ```	```c++ concurrent_node_map(size_type n, allocator_type const& 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[默认可构造]。
	Bucket Count Constructor with Hasher and Allocator	带哈希函数和分配器的桶数构造函数
	```c++ concurrent_node_map(size_type n, hasher const& hf, allocator_type const& a); ```	```c++ concurrent_node_map(size_type n, hasher const& hf, allocator_type const& a); ```

Loading…

admin

Translation uploaded

English

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

If若 à == other.get_allocator()`, the elements of òther` are transferred directly to the new table; otherwise, elements are moved-constructed from those of òther`. The hash function and predicate are moved-constructed from òther`, and the allocator is copy-constructed from à`. If statistics are xref:concurrent_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from òther` iff，则将 òther` 的元素直接转移到新哈希表中；否则从 òther` 的元素移动构造出新元素。哈希函数与谓词从 òther` 移动构造而来，分配器从 à` 复制构造而来。
若启用了 xref:concurrent_node_map_boost_unordered_enable_stats[统计功能]，仅当 à == other.get_allocator()`~~, and always calls~~ 时从 òther` 转移内部统计信息，且始终调用 òther.reset_stats()`.。

06/05/2026

admin

String added in the repository

English

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

51855

Source string location

:617

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

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