User avatar admin

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

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

Translation uploaded
If `nh` is empty, has no effect.
If如果 `nh` is empty, has no effect.为空，则无效果。
:907
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&&& 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
---
---
:900
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_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:;; 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_set`. 中提取的节点。
06/05/2026
User avatar admin

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

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

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

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

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

Translation uploaded
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.
Returns:;; A `node_type` owning the element if found, otherwise an empty `node_type`. Throws:;; Only throws an exception if it is thrown by返回：如果找到该元素，则返回一个拥有该元素的 `node_type`；否则返回一个空的 `node_type`。
抛出：仅当 `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 ifk="">` 重载仅在 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs and neither是有效的成员 typedef，且 `iterator` nor和 `const_iterator` are implicitly convertible from `K`. The library assumes that `Hash` is callable with both都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` and和 `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
06/05/2026
User avatar admin

Translation uploaded
Removes an element with key equivalent to `k`.
Removes an element with key equivalent to `k`.移除一个键与 `k` 等价的元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
```c++ node_type extract(const key_type&amp; k); template<class Kk=""> node_type extract(K&& k); ```amp;&amp; k); ```</class>
06/05/2026

Search