User avatar admin

Translation uploaded
Swaps the contents of the container with the parameter.
Swaps the contents of the container with the parameter.交换容器的内容与参数的内容。
06/05/2026
User avatar admin

Translation uploaded
```c++ void swap(unordered_node_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```
```c++ void swap(unordered_node_map&amp; other) noexcept(boost::allocator_traits<Aallocator>::is_always_equal::value || boost::allocator_traits<Aallocator>::propagate_on_container_swap::value); ```</allocator></allocator>
06/05/2026
User avatar admin

Translation uploaded
swap
swap交换
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The iterator following the erased elements - i.e. `last`. Throws:;; Nothing in this implementation (neither the `hasher` nor the `key_equal` objects are called).
Returns:;; The iterator following the erased elements - i.e. `last`. Throws:;; Nothing in this implementation (neither the返回：被擦除元素之后的迭代器——即 `last`。
抛出：在此实现中不抛出任何异常（既不调用 `hasher` nor the也不调用 `key_equal` objects are called).对象）。
06/05/2026
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
---
---
:1168
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
---
---
:1153
06/05/2026
User avatar admin

Translation uploaded
Returns:;; An opaque object implicitly convertible to the `iterator` or `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to `iterator` or `const_iterator`.
Returns:;; An opaque object implicitly convertible to the返回：一个不透明对象，可隐式转换为 `position` 在被擦除之前紧后位置的 `iterator` or或 `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to。
抛出：不抛出任何异常。
注意：返回的不透明对象只能被丢弃或立即转换为 `iterator` or或 `const_iterator`.。
06/05/2026
User avatar admin

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

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

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

Translation uploaded
Returns:;; If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. 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 to be greater than the maximum load. + + The `template<class K, class M>` only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. 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:;; If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. 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 to be greater than the maximum load. + + The 返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。

`template<class K,k,="" class M>` only participates in overload resolution if="" m="">` 仅在 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both是有效的成员 typedef 时参与重载决议。库假定 `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
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.是关于元素插入位置的建议。此实现会忽略该建议。
:1125
06/05/2026

Search