User avatar admin

Translation uploaded
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
```c++ size_type erase(const key_type&amp; k); template<class Kk=""> size_type erase(K&& k); ```amp;&amp; k); ```</class>
06/05/2026
User avatar admin

Translation uploaded
Erase by Key
Erase by Key通过键擦除
06/05/2026
User avatar admin

Translation uploaded
---
---
:986
06/05/2026
User avatar admin

Translation uploaded
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.
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
User avatar admin

Translation uploaded
Erase the element pointed to by `position`.
Erase the element pointed to by擦除 `position`. 所指向的元素。
:979
06/05/2026
User avatar admin

Translation uploaded
```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
```c++ iterator erase(iterator position); iterator erase(const_iterator position); ```
06/05/2026
User avatar admin

Translation uploaded
Erase by Position
Erase by Position通过位置擦除
06/05/2026
User avatar admin

Translation uploaded
---
---
:970
06/05/2026
User avatar admin

Translation uploaded
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_map`.
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要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。
返回：如果 `nh` 为空，则返回 `end()`；否则，返回指向新插入元素的迭代器。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。
可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
指向元素的指针和引用永远不会失效。
此函数可用于插入从兼容的 `unordered_map`. 中提取的节点。
06/05/2026
User avatar admin

Translation uploaded
`hint` is a suggestion to where the element should be inserted.
`hint` is a suggestion to where the element should be inserted.是关于元素插入位置的建议。
:954
06/05/2026
User avatar admin

Translation uploaded
Otherwise inserts the element owned by `nh`.
Otherwise inserts the element owned by `nh`.否则，插入 `nh` 所拥有的元素。
:952
06/05/2026
User avatar admin

Translation uploaded
If `nh` is empty, has no effect.
If如果 `nh` is empty, has no effect.为空，则无效果。
:950
06/05/2026
User avatar admin

Translation uploaded
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&&amp;&amp; nh); ```
06/05/2026
User avatar admin

Translation uploaded
Insert with Hint and `node_handle`
Insert with Hint and带提示和 `node_handle` 的插入
06/05/2026
User avatar admin

Translation uploaded
---
---
:943
06/05/2026
User avatar admin

Translation uploaded
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_map`.
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要求：`nh` 为空，或者 `nh.get_allocator()` 等于容器的分配器。
返回：如果 `nh` 为空，则返回 `end()`。
否则，返回指向新插入元素的迭代器。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
指向元素的指针和引用永远不会失效。
此函数可用于插入从兼容的 `unordered_map`. 中提取的节点。
06/05/2026
User avatar admin

Translation uploaded
Otherwise inserts the element owned by `nh`.
Otherwise inserts the element owned by `nh`.否则，插入 `nh` 所拥有的元素。
:929
06/05/2026
User avatar admin

Translation uploaded
If `nh` is empty, has no effect.
If如果 `nh` is empty, has no effect.为空，则无效果。
:927
06/05/2026
User avatar admin

Translation uploaded
```c++ iterator insert(node_type&& nh); ```
```c++ iterator insert(node_type&&amp;&amp; nh); ```
06/05/2026
User avatar admin

Translation uploaded
Insert with `node_handle`
Insert with通过 `node_handle` 插入
06/05/2026

Search