User avatar admin

Translation uploaded
Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; `f` is passed a non-const reference to `x`. + + The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` overload 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:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by返回值：;; 删除的元素数量（0 或 1）。
抛出异常：;; 仅当 `hasher`, 、`key_equal` or或 `f`. Notes:;; `f` is passed a non-const reference to `x`. + + The 抛出异常时才会抛出。
注意：;; `f` 接收指向 `x` 的非常量引用。
`template<class K,k,="" class F>` overload only participates in overload resolution if="" f="">` 重载版本仅在 `std::is_execution_policy_v<std::remove_cvref_t<EexecutionPpolicy>>` is&gt;` 为 `false`. + + The 时参与重载决议。
`template<class K,k,="" class F>` overload only participates in overload resolution if="" f="">` 重载版本仅在 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both为有效成员类型别名时参与重载决议。库假定 `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></std::remove_cvref_t<executionpolicy></class>
06/05/2026
User avatar admin

Translation uploaded
Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is `true`.
Erases the element `x` with key equivalent to `k` if it exists and若存在键与 `k` 等价的元素 `x`，且 `f(x)` is返回 `true`.，则删除该元素。
06/05/2026
User avatar admin

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

Translation uploaded
erase_if by Key
erase_if by Key
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The number of elements erased (0 or 1). 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. 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 (0 or 1). Throws:;; Only throws an exception if it is thrown by返回值：;; 删除的元素数量（0 或 1）。
抛出异常：;; 仅当 `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. The library assumes that `Hash` is callable with both是有效的成员类型别名时，`template<class 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
Erases the element with key equivalent to `k` if it exists.
Erases the element with key equivalent to `k` if it exists.若存在键与 `k` 等价的元素，则删除该元素。
06/05/2026
User avatar admin

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

Translation uploaded
erase
erase擦除
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; 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:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; The `template<class K, class M>` only participates in overload resolution if返回值：;; 若执行插入操作则返回 `true`。
并发特性：;; 阻塞对 `*this` 的重哈希操作。
注意：;; 仅当 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both是有效的成员类型别名时，`template<class k,="" class="" m="">` 才参与重载决议。库假定 `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
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<M>(obj))) ```
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Kk>(k)), std::forward_as_tuple(std::forward<Mm>(obj))) ```</m></k>
06/05/2026
User avatar admin

Translation uploaded
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<M>(obj)))
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Kkey>(k)), std::forward_as_tuple(std::forward<Mm>(obj)))</m></key>
06/05/2026
User avatar admin

Translation uploaded
If there is no such element, it is added to the table as: ```c++
If there is no such element, it is added to the table as: ```c++若不存在该元素，则以如下形式添加到表中：
06/05/2026
User avatar admin

Translation uploaded
If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.
If there is an element with key `k`, then it is updated by assigning 若表中存在键为`k`的元素，则通过`std::forward<Mm>(obj)`.赋值来更新该元素。</m>
06/05/2026
User avatar admin

Translation uploaded
Inserts a new element into the table or updates an existing one by assigning to the contained value.
Inserts a new element into the table or updates an existing one by assigning to the contained value.向表中插入新元素，或通过为已包含的值赋值来更新现有元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class M> bool insert_or_assign(const key_type& k, M&& obj); template<class M> bool insert_or_assign(key_type&& k, M&& obj); template<class K, class M> bool insert_or_assign(K&& k, M&& obj); ```
```c++ template<class Mm=""> bool insert_or_assign(const key_type&amp; k, M&&amp;&amp; obj); template<class Mm=""> bool insert_or_assign(key_type&& k, M&&amp;&amp; k, M&amp;&amp; obj); template<class K,k,="" class M="" m=""> bool insert_or_assign(K&& k, M&& obj); ```amp;&amp; k, M&amp;&amp; obj); ```</class></class></class>
06/05/2026
User avatar admin

Translation uploaded
insert_or_assign
insert_or_assign
06/05/2026
User avatar admin

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

Translation uploaded
--
--
:1461
06/05/2026

Search