Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Multiset (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Requires:;; `nh` is empty or `nh.get

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:847	---	---
	Extract by Iterator	通过迭代器提取
	```c++ node_type extract(const_iterator position); ```	```c++ node_type extract(const_iterator position); ```
	Removes the element pointed to by `position`.	移除 `position` 所指向的元素。
	Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`.	返回：一个拥有该元素的 `node_type`。注意：通过此方法提取的节点可以插入到兼容的 `unordered_set` 中。
:860	---	---
	Extract by Value	按值提取
	```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>
	Removes an element with key equivalent to `k`.	移除一个键与 `k` 等价的元素。
	Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`. + + 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.	返回：如果找到该元素，则返回一个拥有该元素的 `node_type`；否则返回一个空的 `node_type`。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：通过此方法提取的节点可以插入到兼容的 `unordered_set` 中。 `template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:877	---	---
	Insert with `node_handle`	通过 `node_handle` 插入
	```c++ iterator insert(node_type&& nh); ```	```c++ iterator insert(node_type&& nh); ```
:884	If `nh` is empty, has no effect.	如果 `nh` 为空，则无效果。
:886	Otherwise inserts the element owned by `nh`.	否则，插入 `nh` 所拥有的元素。
	Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; 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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_set`.	要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。返回：如果 `nh` 为空，则返回 `end()`。否则，返回指向新插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。此函数可用于插入从兼容的 `unordered_set` 中提取的节点。
:900	---	---
	Insert with Hint and `node_handle`	带提示和 `node_handle` 的插入
	```c++ iterator insert(const_iterator hint, node_type&& nh); ```	```c++ iterator insert(const_iterator hint, node_type&& nh); ```
:907	If `nh` is empty, has no effect.	如果 `nh` 为空，则无效果。
:909	Otherwise inserts the element owned by `nh`.	否则，插入 `nh` 所拥有的元素。
:911	`hint` is a suggestion to where the element should be inserted.	`hint` 是关于元素插入位置的建议。
	Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; If an exception is thrown by an operation other than a call to hasher the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_set`.	要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。返回：如果 `nh` 为空，则返回 `end()`。否则，返回指向新插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。此函数可用于插入从兼容的 `unordered_set` 中提取的节点。
:927	---	---
	Erase by Position	通过位置擦除
	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
:936	Erase the element pointed to by `position`.	擦除 `position` 所指向的元素。
	Returns:;; The iterator following `position` before the erasure. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated.	返回：`position` 在被擦除之前的后一个迭代器。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：在旧版本中，此操作可能效率较低，因为它需要搜索多个桶以找到返回迭代器的位置。数据结构已经更改，不再是这种情况，并且备用的擦除方法已被弃用。
:943	---	---
	Erase by Value	通过值擦除
	```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& x); ```	```c++ size_type erase(const key_type& k); template<class k=""> size_type erase(K&& x); ```</class>

	English	Chinese (Simplified Han script)	Actions
	```c++ size_type max_size() const noexcept; ```	```c++ size_type max_size() const noexcept; ```
	Modifiers	修改器
	emplace	原地构造
	```c++ template<class... Args> iterator emplace(Args&&... args); ```	```c++ template<class... args=""> iterator emplace(Args&&... args); ```</class...>
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the inserted element. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated.	要求：`value_type` 满足 https://en.cppreference.com/w/cpp/named_req/MoveInsertable[可移动插入^]。返回：指向已插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	Inserts a range of elements into the container.	将一个范围内的元素插入容器中。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` 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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated.	要求：`value_type` 必须可以从 `*first` 出发在 `X` 中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	Insert Initializer List	初始化列表插入
	Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.	将一个范围内的元素插入容器中。当且仅当容器中没有具有等价键的元素时，才会插入这些元素。
	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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated.	要求：`value_type` 可以在容器中进行 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	Extract by Iterator	通过迭代器提取
	```c++ node_type extract(const_iterator position); ```	```c++ node_type extract(const_iterator position); ```
	Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`.	返回：一个拥有该元素的 `node_type`。注意：通过此方法提取的节点可以插入到兼容的 `unordered_set` 中。
	Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_set`. + + 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.	返回：如果找到该元素，则返回一个拥有该元素的 `node_type`；否则返回一个空的 `node_type`。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：通过此方法提取的节点可以插入到兼容的 `unordered_set` 中。 `template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
	```c++ iterator insert(node_type&& nh); ```	```c++ iterator insert(node_type&& nh); ```
	Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; 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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_set`.	要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。返回：如果 `nh` 为空，则返回 `end()`。否则，返回指向新插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。此函数可用于插入从兼容的 `unordered_set` 中提取的节点。
	Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns `end()`. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; If an exception is thrown by an operation other than a call to hasher the function has no effect. Notes:;; The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same key. + + Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible `unordered_set`.	要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。返回：如果 `nh` 为空，则返回 `end()`。否则，返回指向新插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。此函数可用于插入从兼容的 `unordered_set` 中提取的节点。
	Erase by Position	通过位置擦除
	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```	```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
	Class Template unordered_multiset	类模板 unordered_multiset
	:idprefix: unordered_multiset_	:idprefix: unordered_multiset_
	Erase by Value	通过值擦除
	erase_return_void	erase_return_void
	merge	合并
	Invalidates iterators to transferred elements.	使指向被转移元素的迭代器失效。
	Invalidates iterators belonging to `*this`.	使属于 `*this` 的迭代器失效。
	Iterators to non-transferred elements in `source` remain valid.	指向 `source` 中未被转移元素的迭代器保持有效。
	--	--
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```

Loading…

admin

Translation uploaded

English

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

Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty, returns ènd()`. + + Otherwise returns an iterator pointing to the newly inserted element. Throws:;; 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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + This can be used to insert a node extracted from a compatible要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。
返回：如果 `nh` 为空，则返回 ènd()`。
否则，返回指向新插入元素的迭代器。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
此函数可用于插入从兼容的 ùnordered_set`. 中提取的节点。

06/05/2026

admin

String added in the repository

English

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

54763

Source string location

:889

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_multiset_zh_Hans.adoc, string 228

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