Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Extracts the element pointed to by `position`.

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	Returns:;; The number of elements erased. 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 and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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.	返回：被擦除的元素数量。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时，才参与重载决议。库假定 `Hash` 可同时用 `K` 和 `Key` 调用，并且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:978	---	---
	Erase Range	范围擦除
	```c++ iterator erase(const_iterator first, const_iterator last); ```	```c++ iterator erase(const_iterator first, const_iterator last); ```
	Erases the elements in the range from `first` to `last`.	擦除从 `first` 到 `last` 范围内的元素。
	Returns:;; The iterator following the erased elements - i.e. `last`. Throws:;; Nothing in this implementation (neither the `hasher` nor the `key_equal` objects are called).	返回：被擦除元素之后的迭代器——即 `last`。抛出：在此实现中不抛出任何异常（既不调用 `hasher` 也不调用 `key_equal` 对象）。
:992	---	---
	swap	交换
	```c++ void swap(unordered_node_set& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value \|\| boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```	```c++ void swap(unordered_node_set& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value \|\| boost::allocator_traits<allocator>::propagate_on_container_swap::value); ```</allocator></allocator>
	Swaps the contents of the container with the parameter.	交换容器的内容与参数的内容。
:1003	If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.	如果 `Allocator::propagate_on_container_swap` 被声明且 `Allocator::propagate_on_container_swap::value` 为 `true`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
	Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping.	抛出：除非 `key_equal` 或 `hasher` 在交换时抛出异常，否则不抛出任何异常。
:1008	---	---
	Extract by Position	通过位置提取
	```c++ node_type extract(const_iterator position); ```	```c++ node_type extract(const_iterator position); ```
	Extracts the element pointed to by `position`.	提取 `position` 所指向的元素。
	Returns:;; A `node_type` object holding the extracted element. Throws:;; Nothing.	返回：一个持有被提取元素的 `node_type` 对象。抛出：不抛出任何异常。
:1021	---	---
	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>
	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()`

	English	Chinese (Simplified Han script)	Actions
	``unordered_node_set``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.	`unordered++_++node++_++set` 可通过本组件库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization] 进行归档/检索。支持常规归档与 XML 归档两种格式。
	Saving an unordered_node_set to an archive	将 `unordered_node_set` 保存到归档中
	Loading an unordered_node_set from an archive	从归档中加载 `unordered_node_set`
	Requires:;; The `unordered_node_set` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.	要求：`it` 所指向的 `unordered_node_set` 容器 `x` 必须先被保存到 `ar` 中，并且在保存 `x` 和保存 `it` 之间，不能对 `x` 执行任何修改操作。
	Loading an iterator/const_iterator from an archive	从归档加载迭代器/常量迭代器
	Copy Insert	复制插入
	```c++ iterator insert(const_iterator hint, value_type&& obj); ```	```c++ iterator insert(const_iterator hint, value_type&& obj); ```
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, if an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.	要求：`value_type` 可以在容器中进行 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
	If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.value()`. `nh` is empty when the function returns.	如果 `nh` 非空，则当且仅当容器中没有键与 `nh.value()` 等价的元素时，才将关联的元素插入容器。函数返回时 `nh` 变为空。
	Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.	如果 `nh` 非空，则当且仅当容器中不存在键等价于 `nh.value()` 的元素时，插入其关联的元素。函数返回时， `nh` 为空。
	If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.value()`. `nh` becomes empty if insertion took place, otherwise it is not changed.	如果 `nh` 非空，则当且仅当容器中没有键与 `nh.value()` 等价的元素时，才将关联的元素插入容器。如果插入发生，则 `nh` 变为空；否则 `nh` 不变。
	Erase the element pointed to by `position`.	擦除由 `position` 指向的元素。
	Erase Range	范围擦除
	Erases the elements in the range from `first` to `last`.	擦除从 `first` 到 `last` 范围内的元素。
	swap	交换
	Extracts the element pointed to by `position`.	提取 `position` 所指向的元素。
	Extracts the element with key equivalent to `k`, if it exists.	提取键与 `k` 等价的元素（如果存在）。
	pull	pull
	```c++ init_type pull(const_iterator position); ```	```c++ init_type pull(const_iterator position); ```
	Returns:;; A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns `std::make_pair(b.end(), b.end())`. 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` 等价的元素的范围。如果容器不包含任何此类元素，则返回 `std::make_pair(b.end(), b.end())`。注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	- 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` 模板参数，并且为该参数推导出的类型符合分配器的要求。
	Equality Comparisons	相等性比较
	```c++ iterator insert(const_iterator hint, const value_type& obj); ``` Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.	```c++ iterator insert(const_iterator hint, const value_type& obj); ```当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
	```c++ std::pair<iterator, bool> insert(const value_type& obj); ```	```c++ std::pair<iterator, bool=""> insert(const value_type& obj); ```</iterator,>
	```c++ insert_return_type insert(node_type&& nh); ```	```c++ insert_return_type insert(node_type&& nh); ```
	```c++ std::pair<iterator, bool> insert(value_type&& obj); ```	```c++ std::pair<iterator, bool=""> insert(value_type&& obj); ```</iterator,>
	```c++ template<class K> std::pair<iterator, bool> insert(K&& k); ```	```c++ template<class k=""> std::pair<iterator, bool=""> insert(K&& k); ```</iterator,></class>
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from `*first`. Throws:;; When inserting a single element, if an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.	要求：`value_type` 可以从 `*first` 出发在容器中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
	Copy Insert with Hint	带提示的复制插入
	Insert Node	节点插入

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

52608

Source string location

:1015

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 264

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