User avatar admin

Translation uploaded
Erases the elements in the range from `first` to `last`.
Erases the elements in the range from擦除从 `first` to到 `last`. 范围内的元素。
06/05/2026
User avatar admin

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

Translation uploaded
Erase Range
Erase Range范围擦除
06/05/2026
User avatar admin

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

Translation uploaded
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.
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 抛出异常时才会抛出。
注意：`template<class k="">` 重载仅在 `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
Erase all elements with key equivalent to `k`.
Erase all elements with key equivalent to `k`.擦除所有键与 `k` 等价的元素。
06/05/2026
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
---
---
:1236
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`. 所指向的元素。
:1229
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
---
---
:1220
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()`. + + If there was already an element in the container with an equivalent key returns an iterator pointing to that. + + 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_multimap`.
Requires:;; `nh` is empty or `nh.get_allocator()` is equal to the container's allocator. Returns:;; If `nh` was empty returns `end()`. + + If there was already an element in the container with an equivalent key returns an iterator pointing to that. + + 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_multimap`. 中提取的节点。
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.是关于元素插入位置的建议。
:1202
06/05/2026
User avatar admin

Translation uploaded
If there is already an element in the container with an equivalent key has no effect on `nh` (i.e. `nh` still contains the node.)
If there is already an element in the container with an equivalent key has no effect on如果容器中已存在具有等价键的元素，则对 `nh` (i.e.无影响（即 `nh` still contains the node.)仍然包含该节点）。
06/05/2026
User avatar admin

Translation uploaded
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.
Otherwise inserts the element owned by `nh` if and only if there is no element in the container with an equivalent key.否则，当且仅当容器中没有具有等价键的元素时，才插入 `nh` 所拥有的元素。
:1198
06/05/2026
User avatar admin

Translation uploaded
If `nh` is empty, has no effect.
If如果 `nh` is empty, has no effect.为空，则无效果。
:1196
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

Search