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

Zen

Translation

English

If à == other.get_allocator()`, the element nodes of òther` are transferred directly to the new container; 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:unordered_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)
	Iterator Range Constructor with Allocator	带分配器的迭代器范围构造函数
	```c++ template<class InputIterator> unordered_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```	```c++ template<class inputiterator=""> unordered_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```</class>
	Constructs an empty container 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)` 范围内的元素插入其中。
:479	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[可默认构造^]。
:481	---	---
	Allocator Constructor	分配器构造函数
	```c++ explicit unordered_node_map(Allocator const& a); ```	```c++ explicit unordered_node_map(Allocator const& a); ```
	Constructs an empty container, using allocator `a`.	使用分配器 `a` 构造一个空容器。
:490	---	---
	Copy Constructor with Allocator	带分配器的拷贝构造函数
	```c++ unordered_node_map(unordered_node_map const& other, Allocator const& a); ```	```c++ unordered_node_map(unordered_node_map const& other, Allocator const& a); ```
	Constructs a container, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.	构造一个容器，拷贝 `other` 所包含的元素、哈希函数和谓词，但使用分配器 `a`。
:499	---	---
	Move Constructor with Allocator	带分配器的移动构造函数
	```c++ unordered_node_map(unordered_node_map&& other, Allocator const& a); ```	```c++ unordered_node_map(unordered_node_map&& other, Allocator const& a); ```
	If `a == other.get_allocator()`, the element nodes of `other` are transferred directly to the new container; 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:unordered_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:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则当 `a == other.get_allocator()` 时，会从 `other` 转移内部的统计信息，并且始终会调用 `other.reset_stats()`。
:513	---	---
	Move Constructor from concurrent_node_map	从 `concurrent_node_map` 的移动构造函数
	```c++ unordered_node_map(concurrent_node_map<Key, T, Hash, Pred, Allocator>&& other); ```	```c++ unordered_node_map(concurrent_node_map<key, t,="" hash,="" pred,="" allocator="">&& other); ```</key,>
	Move construction from a xref:#concurrent_node_map[`concurrent_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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	从 xref:#concurrent_node_map[`concurrent_node_map`] 进行移动构造。`other` 的内部桶数组直接转移给新容器。哈希函数、谓词和分配器通过移动构造从 `other` 获得。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则从 `other` 转移内部的统计信息，并调用 `other.reset_stats()`。
	Complexity:;; Constant time. Concurrency:;; Blocking on `other`.	复杂度：常数时间。并发性：在 `other` 上阻塞。
:531	---	---
	Initializer List Constructor	初始化列表构造函数
	Constructs an empty container 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` 中的元素插入其中。
:546	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[可默认构造^]。
:548	---	---
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ unordered_node_map(size_type n, allocator_type const& a); ```	```c++ unordered_node_map(size_type n, allocator_type const& a); ```
	Constructs an empty container 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[可默认构造^]。
:561	---	---

	English	Chinese (Simplified Han script)	Actions
	Constructs an empty container using `hasher()` as the hash function, `key_equal()` as the key equality predicate and `allocator_type()` as the allocator.	使用 `hasher()` 作为哈希函数，`key_equal()` 作为键相等谓词，`allocator_type()` 作为分配器，构造一个空容器。
	Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, and `a` as the allocator.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器。
	Iterator Range Constructor	迭代器范围构造函数
	Copy Constructor	复制构造函数
	```c++ unordered_node_map(unordered_node_map const& other); ```	```c++ unordered_node_map(unordered_node_map const& other); ```
	The copy constructor. Copies the contained elements, hash function, predicate and allocator.	拷贝构造函数。拷贝所包含的元素、哈希函数、谓词和分配器。
	If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.	如果 `Allocator::select_on_container_copy_construction` 存在且具有正确的签名，则分配器将根据其结果进行构造。
	Move Constructor	移动构造函数
	```c++ unordered_node_map(unordered_node_map&& other); ```	```c++ unordered_node_map(unordered_node_map&& other); ```
	The move constructor. 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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	移动构造函数。`other` 的内部桶数组会被直接转移给新容器。哈希函数、谓词和分配器通过移动构造从 `other` 获得。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则会从 `other` 转移内部的统计信息，并调用 `other.reset_stats()`。
	Allocator Constructor	分配器构造函数
	```c++ explicit unordered_node_map(Allocator const& a); ```	```c++ explicit unordered_node_map(Allocator const& a); ```
	Constructs an empty container, using allocator `a`.	使用分配器 `a` 构造一个空容器。
	Copy Constructor with Allocator	带分配器的拷贝构造函数
	```c++ unordered_node_map(unordered_node_map const& other, Allocator const& a); ```	```c++ unordered_node_map(unordered_node_map const& other, Allocator const& a); ```
	If `a == other.get_allocator()`, the element nodes of `other` are transferred directly to the new container; 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:unordered_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:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则当 `a == other.get_allocator()` 时，会从 `other` 转移内部的统计信息，并且始终会调用 `other.reset_stats()`。
	Move construction from a xref:#concurrent_node_map[`concurrent_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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` and calls `other.reset_stats()`.	从 xref:#concurrent_node_map[`concurrent_node_map`] 进行移动构造。`other` 的内部桶数组直接转移给新容器。哈希函数、谓词和分配器通过移动构造从 `other` 获得。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则从 `other` 转移内部的统计信息，并调用 `other.reset_stats()`。
	Complexity:;; Constant time. Concurrency:;; Blocking on `other`.	复杂度：常数时间。并发性：在 `other` 上阻塞。
	Bucket Count Constructor with Allocator	带分配器的桶数构造函数
	```c++ unordered_node_map(size_type n, allocator_type const& a); ```	```c++ unordered_node_map(size_type n, allocator_type const& a); ```
	```c++ unordered_node_map(size_type n, hasher const& hf, allocator_type const& a); ```	```c++ unordered_node_map(size_type n, hasher const& hf, allocator_type const& a); ```
	Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate and `a` as the allocator.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，使用默认的键相等谓词，并以 `a` 作为分配器。
	Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `[f, l)` 范围内的元素插入其中。
	initializer_list Constructor with Bucket Count and Allocator	带桶数和分配器的初始化列表构造函数
	```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```	```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```</value_type>
	initializer_list Constructor with Bucket Count and Hasher and Allocator	带桶数、哈希函数和分配器的初始化列表构造函数
	```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```	```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```</value_type>
	Destructor	析构函数
	```c++ unordered_node_map& operator=(unordered_node_map&& other) noexcept((boost::allocator_traits<Allocator>::is_always_equal::value \|\| boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*>::value); ``` The move assignment operator. Destroys previously existing elements, swaps the hash function and predicate from `other`, and move-assigns the allocator from `other` if `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`. If at this point the allocator is equal to `other.get_allocator()`, the internal bucket array of `other` is transferred directly to the new container; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff the final allocator is equal to `other.get_allocator()`, and always calls `other.reset_stats()`.	```c++ unordered_node_map& operator=(unordered_node_map&& other) noexcept((boost::allocator_traits<allocator>::is_always_equal::value \|\| boost::allocator_traits<allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*="">::value); ``` 移动赋值运算符。销毁之前存在的元素，交换来自 `other` 的哈希函数和谓词，并且如果 `Alloc::propagate_on_container_move_assignment` 存在且 `Alloc::propagate_on_container_move_assignment::value` 为 `true`，则从 `other` 移动赋值分配器。如果此时分配器与 `other.get_allocator()` 相等，则 `other` 的内部桶数组直接转移给当前容器；否则，插入从 `other` 元素移动构造而来的副本。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则当最终分配器与 `other.get_allocator()` 相等时，从 `other` 转移内部的统计信息，并且始终会调用 `other.reset_stats()`。</pointer,></allocator></allocator>
	Returns:;; A `const_iterator` referring to the first element of the container, or if the container is empty the past-the-end value for the container. Complexity:;; O(`bucket_count()`)	返回：指向容器第一个元素的 `const_iterator`，如果容器为空则返回容器的尾后值。复杂度：O(`bucket_count()`)

Loading…

admin

Translation uploaded

English

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

If如果 à == other.get_allocator()`, the element nodes of òther` are transferred directly to the new container; 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:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from òther` iff à == other.get_allocator()`, and always calls，则 òther` 的元素节点会直接转移给新容器；否则，元素将从 òther` 中的元素通过移动构造获得。哈希函数和谓词通过移动构造从 òther` 获得，而分配器则通过拷贝构造从 à` 获得。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则当 à == other.get_allocator()` 时，会从 òther` 转移内部的统计信息，并且始终会调用 òther.reset_stats()`.。

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Things to check

Multiple capitals

Translation contains words with multiple misplaced capital letters.

Reset

Glossary

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

String information

Flags

safe-html, strict-same

Unit identifier

52835

Source string location

:506

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/unordered_node_map_zh_Hans.adoc, string 82

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

Multiple capitals

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file