Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	Extracts the element with key equivalent to `k`, if it exists.	提取键与 `k` 等价的元素（如果存在）。
	Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. 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.	返回：一个持有被提取元素的 `node_type` 对象；如果未提取到任何元素，则返回空。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时才参与重载决议。库假定 `Hash` 可同时用 `K` 和 `Key` 调用，并且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1036	---	---
	pull	pull
	```c++ init_type pull(const_iterator position); ```	```c++ init_type pull(const_iterator position); ```
	Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`.	从 `position` 指向的元素移动构造一个 `init_value` 对象 `x`，擦除该元素并返回 `x`。
:1046	---	---
	clear	清空
	```c++ void clear() noexcept; ```	```c++ void clear() noexcept; ```
	Erases all elements in the container.	擦除容器中的所有元素。
	Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()`	后置条件：`size() == 0`，`max_load() >= max_load_factor() * bucket_count()`
:1058	---	---
	merge	合并
	```c++ template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_node_set<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_node_set<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>
	Transfers all the element nodes from `source` whose key is not already present in `*this`.	从 `source` 转移所有键在 `*this` 中尚未存在的元素节点。
	Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `this` is greater than its original maximum load, invalidates all iterators associated to `this`.	要求：`this->get_allocator() == source.get_allocator()`。注意：会使被转移元素的迭代器失效。如果 `this` 的结果大小大于其原始最大负载，则会使与 `this` 关联的所有迭代器失效。
:1076	---	---
	Observers	观察器
	get_allocator	get_allocator
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	Returns:;; The container's allocator.	返回：容器的分配器。
:1088	---	---
	hash_function	哈希函数
	``` hasher hash_function() const; ```	```cpp hasher hash_function() const; ```
	Returns:;; The container's hash function.	返回：容器的哈希函数对象。
:1098	---	---
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```
	Returns:;; The container's key equality predicate	返回：容器的键相等谓词。
:1108	---	---
	Lookup	查找

	English	Chinese (Simplified Han script)	Actions
	```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ```	```c++ size_type count(const key_type& k) const; template<class k=""> size_type count(const K& k) const; ```</class>
	contains	包含
	Move Insert with Hint	带提示的移动插入
	```c++ void insert(std::initializer_list<value_type>); ```	```c++ void insert(std::initializer_list<value_type>); ```</value_type>
	Transparent Insert with Hint	带提示的透明插入
	```c++ template<class K> std::pair<iterator, bool> insert(const_iterator hint, K&& k); ```	```c++ template<class k=""> std::pair<iterator, bool=""> insert(const_iterator hint, K&& k); ```</iterator,></class>
	Insert Iterator Range	迭代器范围插入
	```c++ template<class InputIterator> void insert(InputIterator first, InputIterator last); ```	```c++ template<class inputiterator=""> void insert(InputIterator first, InputIterator last); ```</class>
	```c++ node_type extract(const_iterator position); ```	```c++ node_type extract(const_iterator position); ```
	Returns:;; A `node_type` object holding the extracted element. Throws:;; Nothing.	返回：一个持有被提取元素的 `node_type` 对象。抛出：不抛出任何异常。
	Extract by Key	通过键提取
	```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```	```c++ node_type extract(const key_type& k); template<class k=""> node_type extract(K&& k); ```</class>
	Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. 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.	返回：一个持有被提取元素的 `node_type` 对象；如果未提取到任何元素，则返回空。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时才参与重载决议。库假定 `Hash` 可同时用 `K` 和 `Key` 调用，并且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()`	后置条件：`size() == 0`，`max_load() >= max_load_factor() * bucket_count()`
	```c++ template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_node_set<key, t,="" h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_node_set<key, t,="" h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class>
	Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `this` is greater than its original maximum load, invalidates all iterators associated to `this`.	要求：`this->get_allocator() == source.get_allocator()`。注意：会使被转移元素的迭代器失效。如果 `this` 的结果大小大于其原始最大负载，则会使与 `this` 关联的所有迭代器失效。
	get_allocator	get_allocator
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
	hash_function	哈希函数
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```
	Returns:;; The container's key equality predicate	返回：容器的键相等谓词。
	Lookup	查找
	Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. Notes:;; The `template<class K>` overloads only participate 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.	返回：指向键与 `k` 等价的元素的迭代器；如果不存在这样的元素，则返回 `end()`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	Effects:;; Sets to zero the internal statistics kept by the container. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:unordered_node_set_boost_unordered_enable_stats[enabled].	效果：将容器内部维护的统计信息归零。注意：仅在 xref:reference/stats.adoc#stats[统计计算] 通过 xref:unordered_node_set_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`] 启用时才可用。
	Returns:;; The number of elements with key equivalent to `k`. 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.	返回：键与 `k` 等价的元素数量。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	```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>
	bucket_count	bucket_count
	```c++ size_type bucket_count() const noexcept; ```	```c++ size_type bucket_count() const noexcept; ```
	Returns:;; The size of the bucket array.	返回：桶数组的大小。

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Things to check

Double space

Translation contains double space.

Fix string

Reset

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

52628

Source string location

:1071

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_set_zh_Hans.adoc, string 284

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

Double space

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file