Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Multiset (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Returns:;; The iterator following `position` before the erasure. Throws:;; Only …

Zen

Translation

English

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.

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```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>
	Erase all elements with key equivalent to `k`.	擦除所有键与 `k` 等价的元素。
	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>
:958	---	---
	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:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.	返回：被擦除元素之后的迭代器——即 `last`。抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。在此实现中，此重载不会调用任何函数对象的方法，因此不会抛出异常，但这在其他实现中可能并不成立。
:974	---	---
	quick_erase	quick_erase
	```c++ void quick_erase(const_iterator position); ```	```c++ void quick_erase(const_iterator position); ```
:981	Erase the element pointed to by `position`.	擦除 `position` 所指向的元素。
:984	Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. + + In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations. Notes:;; This method was implemented because returning an iterator to the next element from erase was expensive, but the container has been redesigned so that is no longer the case. So this method is now deprecated.	抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。在此实现中，此重载不会调用任何函数对象的方法，因此不会抛出异常，但这在其他实现中可能并不成立。注意：引入此方法是因为从 `erase` 返回指向下一个元素的迭代器成本较高，但容器已经过重新设计，不再存在这种情况。因此，此方法现已弃用。

Key	English	Chinese (Simplified Han script)
	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); template<class K> const_iterator find(const K& k) const; template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename CompatibleKey, typename CompatibleHash, typename CompatiblePredicate> const_iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; ```	```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class k=""> iterator find(const K& k); template<class k=""> const_iterator find(const K& k) const; template<typename compatiblekey,="" typename="" compatiblehash,="" compatiblepredicate=""> iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&); template<typename compatiblekey,="" typename="" compatiblehash,="" compatiblepredicate=""> const_iterator find(CompatibleKey const&, CompatibleHash const&, CompatiblePredicate const&) const; ```</typename></typename></class></class>
	```c++ const_iterator cend() const noexcept; ```	```c++ const_iterator cend() const noexcept; ```
	Returns:;; A `const_iterator` which refers to the past-the-end value for the container.	返回：指向容器尾后值的 `const_iterator`。
	Size and Capacity	大小与容量
	Returns:;; `size()` of the largest possible container.	返回：可能的最大容器的 `size()`。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into `X` from `args`. 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:;; 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` 必须可以从 `args` 出发在 `X` 中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。返回：指向已插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	emplace_hint	emplace_hint
	Move Insert	移动插入
	```c++ iterator insert(value_type&& obj); ```	```c++ iterator insert(value_type&& obj); ```
	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:;; 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` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	Copy Insert with Hint	带提示的复制插入
	```c++ iterator insert(const_iterator hint, const value_type& obj); ```	```c++ iterator insert(const_iterator hint, const value_type& obj); ```
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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/CopyInsertable[可拷贝插入^]。返回：指向已插入元素的迭代器。抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。指向元素的指针和引用永远不会失效。
	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); ```
	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` 抛出异常时才会抛出。注意：在旧版本中，此操作可能效率较低，因为它需要搜索多个桶以找到返回迭代器的位置。数据结构已经更改，不再是这种情况，并且备用的擦除方法已被弃用。
	```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>
	quick_erase	quick_erase
	```c++ void quick_erase(const_iterator position); ```	```c++ void quick_erase(const_iterator position); ```
	```c++ void erase_return_void(const_iterator position); ```	```c++ void erase_return_void(const_iterator position); ```
	```c++ unordered_multiset& operator=(unordered_multiset&& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value && boost::is_nothrow_move_assignable_v<Hash> && boost::is_nothrow_move_assignable_v<Pred>); ``` The move assignment operator.	```c++unordered_multiset& operator=(unordered_multiset&& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value && boost::is_nothrow_move_assignable_v<hash> && boost::is_nothrow_move_assignable_v<pred>);```移动赋值运算符。</pred></hash></allocator>
	Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.	抛出：除非 `key_equal` 或 `hasher` 的拷贝构造函数或拷贝赋值运算符抛出异常，否则不抛出任何异常。注意：异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是使用其拷贝构造函数进行交换的。
	```c++ template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_multiset<Key, H2, P2, Allocator>&& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_set<Key, H2, P2, Allocator>&& source); ```	```c++ template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_multiset<key, h2,="" p2,="" allocator="">&& source); template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">& source); template<class h2,="" class="" p2=""> void merge(unordered_set<key, h2,="" p2,="" allocator="">&& source); ```</key,></class></key,></class></key,></class></key,></class>
	Attempt to "merge" two containers by iterating `source` and extracting all nodes in `source` and inserting them into `*this`.	尝试“合并”两个容器：遍历 `source`，提取 `source` 中的所有节点，并将它们插入到 `*this` 中。
	Because `source` can have a different hash function and key equality predicate, the key of each node in `source` is rehashed using `this\->hash_function()` and then, if required, compared using `this\->key_eq()`.	由于 `source` 可能具有不同的哈希函数和键相等谓词，因此 `source` 中每个节点的键都会使用 `this->hash_function()` 重新计算哈希值，然后在必要时使用 `this->key_eq()` 进行比较。
	The behavior of this function is undefined if `this\->get_allocator() != source.get_allocator()`.	如果 `this->get_allocator() != source.get_allocator()`，则此函数的行为未定义。
	Observers	观察器
	get_allocator	get_allocator
	``` allocator_type get_allocator() const noexcept; ```	``` allocator_type get_allocator() const noexcept; ```
:1004	---	---

Loading…

admin

Translation uploaded

English

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

~~Returns:;; The iterator following `position` before the erasure. Throws:;; Only throws an exception if it is thrown by~~返回：`position` 在被擦除之前的后一个迭代器。
抛出：仅当 `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. 抛出异常时才会抛出。
注意：在旧版本中，此操作可能效率较低，因为它需要搜索多个桶以找到返回迭代器的位置。数据结构已经更改，不再是这种情况，并且备用的擦除方法已被弃用。

06/05/2026

admin

String added in the repository

English

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

54775

Source string location

:939

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 240

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