Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Node Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Move construction from a xref:#unordered_node_set[`unordered_node

Zen

Translation

English

Move construction from a xref:#unordered_node_set[ùnordered_node_set`]. The internal bucket array of òther` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from òther`. If statistics are xref:concurrent_node_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from òther` and calls òther.reset_stats()`.

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```c++ explicit concurrent_node_set(Allocator const& a); ```	```c++ explicit concurrent_node_set(Allocator const& a); ```
	Constructs an empty table, using allocator `a`.	构造一个空容器，使用分配器 `a`。
:543	---	---
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ concurrent_node_set(concurrent_node_set const& other, Allocator const& a); ```	```c++ concurrent_node_set(concurrent_node_set const& other, Allocator const& a); ```
	Constructs a table, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.	构造一个容器，复制 `other` 中的元素、哈希函数和谓词，但使用分配器 `a`。
:553	Concurrency:;; Blocking on `other`.	并发特性：;; 阻塞 `other`
:555	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ concurrent_node_set(concurrent_node_set&& other, Allocator const& a); ```	```c++ concurrent_node_set(concurrent_node_set&& 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_set_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` 复制构造。若启用了统计功能：仅当 `a == other.get_allocator()` 时，从 `other` 转移内部统计信息；始终调用 `other.reset_stats()`。
:570	Concurrency:;; Blocking on `other`.	并发特性：;; 阻塞 `other`
:572	---	---
	Move Constructor from unordered_node_set	从 unordered++_++node++_++set 的移动构造函数
	```c++ concurrent_node_set(unordered_node_set<Key, Hash, Pred, Allocator>&& other); ```	```c++ concurrent_node_set(unordered_node_set<key, hash,="" pred,="" allocator="">&& other); ```</key,>
	Move construction from a xref:#unordered_node_set[`unordered_node_set`]. 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_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	从xref:#unordered_node_set[`unordered_node_set`]执行移动构造。`other`的内部桶数组直接转移至新容器。哈希函数、谓词及分配器均从`other`移动构造。若启用xref:concurrent_node_set_boost_unordered_enable_stats[统计功能]，则从`other`转移内部统计信息，并调用`other.reset_stats()`。
	Complexity:;; O(`bucket_count()`)	复杂度：;; O(`bucket_count()`)
:589	---	---
	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` 中的元素插入其中。
:604	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[可默认构造] 要求。
:606	---	---
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ concurrent_node_set(size_type n, allocator_type const& a); ```	```c++ concurrent_node_set(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[DefaultConstructible^]。
:619	---	---
	Bucket Count Constructor with Hasher and Allocator	带哈希函数和分配器的桶数构造函数
	```c++ concurrent_node_set(size_type n, hasher const& hf, allocator_type const& a); ```	```c++ concurrent_node_set(size_type n, hasher const& hf, allocator_type const& a); ```
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator.	构造一个至少拥有 `n` 个桶的空容器，使用 `hf` 作为哈希函数、默认的键相等性谓词，并以 `a` 作为分配器。
	Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：;; `size() == 0` 要求：;; `key_equal` 必须满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]。

	English	Chinese (Simplified Han script)	Actions
	Transparent insert_or_[c]visit	透明 insert++_++or++_[++c++]++visit
	Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the table.	效果：;; 与 `rehash` 功能类似，该函数可用于增大或缩小表中的桶数量。
	with `NodeType` = `node_type`.	其中 `NodeType` = `node++_++type` 。
	```cpp static constexpr size_type bulk_visit_size; ```	```cpp static constexpr size_type bulk_visit_size; ```
	Default Constructor	默认构造函数
	Constructs an empty table using `hasher()` as the hash function, `key_equal()` as the key equality predicate and `allocator_type()` as the allocator.	构造一个空表，使用 `hasher()` 作为哈希函数，`key_equal()` 作为键相等性谓词，`allocator_type()` 作为分配器。
	Bucket Count Constructor	桶数构造函数
	```c++ explicit concurrent_node_set(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```	```c++ explicit concurrent_node_set(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```
	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_set_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` 复制构造。若启用了统计功能：仅当 `a == other.get_allocator()` 时，从 `other` 转移内部统计信息；始终调用 `other.reset_stats()`。
	Move Constructor from unordered_node_set	从 unordered++_++node++_++set 的移动构造函数
	```c++ concurrent_node_set(unordered_node_set<Key, Hash, Pred, Allocator>&& other); ```	```c++ concurrent_node_set(unordered_node_set<key, hash,="" pred,="" allocator="">&& other); ```</key,>
	Move construction from a xref:#unordered_node_set[`unordered_node_set`]. 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_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	从xref:#unordered_node_set[`unordered_node_set`]执行移动构造。`other`的内部桶数组直接转移至新容器。哈希函数、谓词及分配器均从`other`移动构造。若启用xref:concurrent_node_set_boost_unordered_enable_stats[统计功能]，则从`other`转移内部统计信息，并调用`other.reset_stats()`。
	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` 中的元素插入其中。
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ concurrent_node_set(size_type n, allocator_type const& a); ```	```c++ concurrent_node_set(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[DefaultConstructible^]。
	```c++ concurrent_node_set(size_type n, hasher const& hf, allocator_type const& a); ```	```c++ concurrent_node_set(size_type n, hasher const& hf, allocator_type const& a); ```
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator.	构造一个至少拥有 `n` 个桶的空容器，使用 `hf` 作为哈希函数、默认的键相等性谓词，并以 `a` 作为分配器。
	max_size	max_size
	Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].	后置条件：;; `size() == 0` 要求：;; `key_equal` 必须满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^]。
	Iterator Range Constructor with Bucket Count and Allocator	带桶数和分配器的迭代器范围构造函数
	Constructs an empty table with at least `n` buckets, using `a` as the allocator and default hash function and key equality predicate, and inserts the elements from `[f, l)` into it.	构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器以及默认的哈希函数和键相等性谓词，并将 `++[++f, l)` 范围内的元素插入其中。
	initializer_list Constructor with Bucket Count and Allocator	带桶数和分配器的初始化列表构造函数
	```c++ concurrent_node_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```	```c++ concurrent_node_set(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```</value_type>

Loading…

admin

Translation uploaded

English

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

~~Move construction from a~~ 从xref:#unordered_node_set[ùnordered_node_set`]. The internal bucket array of òther` is transferred directly to the new container. The hash function, predicate and allocator are moved-constructed from òther`. If statistics are xref:concurrent_node_set_boost_unordered_enable_stats[enabled], transfers the internal statistical information from òther` and calls 执行移动构造。òther`的内部桶数组直接转移至新容器。哈希函数、谓词及分配器均从òther`移动构造。若启用xref:concurrent_node_set_boost_unordered_enable_stats[统计功能]，则从òther`转移内部统计信息，并调用òther.reset_stats()`.。

06/05/2026

admin

String added in the repository

English

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

53310

Source string location

:580

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 107

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