User avatar admin

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

Translation uploaded
---
---
:1164
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_multimap`. + + 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_multimap`. + + 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
User avatar admin

Translation uploaded
Extract by Key
Extract by Key通过键提取
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.
Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible返回：一个拥有该元素的 `node_type`。
注意：通过此方法提取的节点可以插入到兼容的 `unordered_multimap`. 中。
06/05/2026
User avatar admin

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

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

Translation uploaded
Extract by Iterator
Extract by Iterator通过迭代器提取
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:;; 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. + + 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:;; 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. + + The 返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：标准关于 `hint` 的含义表述相当模糊。但唯一实际的使用方式，也是 Boost.Unordered 支持的唯一方式，是将其指向一个具有相同键的已存在元素。
可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。 指向元素的指针和引用永远不会失效。
`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.
`hint` is a suggestion to where the element should be inserted.是关于元素插入位置的建议。
:1121
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>
:1116
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>
:1111
06/05/2026
User avatar admin

Translation uploaded
If there is no such element, it is added to the container as: ```c++
If there is no such element, it is added to the container as: ```c++向容器中插入新元素，或通过赋值给已存在的元素值来更新该元素。
:1108
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>
:1106
06/05/2026
User avatar admin

Translation uploaded
Inserts a new element into the container or updates an existing one by assigning to the contained value.
Inserts a new element into the container or updates an existing one by assigning to the contained value.向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1104
06/05/2026
User avatar admin

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

Search