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.向容器中插入一个新元素，或通过赋值给已包含的值来更新现有元素。
:1000
06/05/2026
User avatar admin

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

Translation uploaded
insert_or_assign
insert_or_++_++or++_++assign
06/05/2026
User avatar admin

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

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

Translation uploaded
The `template<class K, class\... Args>` 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.
The `template<class K, class\... Args>` overload only participates in overload resolution if k,="" args="">` 重载仅在以下条件下参与重载决议：`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>
:984
06/05/2026
User avatar admin

Translation uploaded
Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load.
Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load.可能会导致迭代器、指针和引用失效，但仅当插入操作导致负载因子超过最大负载因子时才会发生。
:982
06/05/2026
User avatar admin

Translation uploaded
unlike xref:#unordered_flat_map_emplace_hint[emplace_hint], which simply forwards all arguments to ``value_type``'s constructor.
unlike而非像 xref:#unordered_flat_map_emplace_hint[emplace_hint], which simply forwards all arguments to ``value_type``'s constructor. 只是简单地将所有参数转发给 value_type 的构造函数。
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<Args>(args)...)) ```
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Kk>(k)), std::forward_as_tuple(std::forward<Aargs>(args)...)) ```</args></k>
:975
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<Args>(args)...))
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Kkey>(k)), std::forward_as_tuple(std::forward<Aargs>(args)...))</args></key>
:970
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:;; This function is similiar to xref:#unordered_flat_map_emplace_hint[emplace_hint], with the difference that no `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: + + -- ```c++
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:;; This function is similiar to xref:#unordered_flat_map_emplace_hint[emplace_hint], with the difference that no `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: 返回：若执行了插入，则迭代器指向新插入的元素；否则指向等价的元素。抛出：若调用 `hasher` 以外的操作抛出异常，则函数无效果。注意：此函数与 xref:#unordered_flat_map_emplace_hint[emplace_hint] 类似，区别在于：若存在等价的键，则不构造 `value_type`；否则，构造形式如下：+ + -- ```c++`
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.是一个关于元素应插入位置的建议。此实现会忽略该建议。
06/05/2026
User avatar admin

Translation uploaded
If there is an existing element with key `k` this function does nothing.
If there is an existing element with key `k` this function does nothing.如果存在键为 `k` 的元素，则该函数不执行任何操作。
:957
06/05/2026
User avatar admin

Translation uploaded
Inserts a new element into the container if there is no existing element with key `k` contained within it.
Inserts a new element into the container if there is no existing element with key `k` contained within it.如果容器中不存在键为 `k` 的元素，则向容器中插入一个新元素。
:955
06/05/2026
User avatar admin

Translation uploaded
```c++ template<class... Args> iterator try_emplace(const_iterator hint, const key_type& k, Args&&... args); template<class... Args> iterator try_emplace(const_iterator hint, key_type&& k, Args&&... args); template<class K, class... Args> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```
```c++ template<class... Aargs=""> iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&&amp;&amp;... args); template<class... Aargs=""> iterator try_emplace(const_iterator hint, key_type&& k, Args&&amp;&amp; k, Args&amp;&amp;... args); template<class K,k,="" class... Args="" args=""> iterator try_emplace(const_iterator hint, K&& k, Args&&... args); ```amp;&amp; k, Args&amp;&amp;... args); ```</class></class...></class...>
06/05/2026
User avatar admin

Translation uploaded
try_emplace with Hint
try_emplace with Hint带提示的 try++_++emplace
06/05/2026
User avatar admin

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

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

Translation uploaded
The `template<class K, class\... Args>` 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.
The `template<class K, class\... Args>` overload only participates in overload resolution if k,="" args="">` 重载仅在以下条件下参与重载决议：`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>
:939
06/05/2026
User avatar admin

Translation uploaded
Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load.
Can invalidate iterators pointers and references, but only if the insert causes the load to be greater than the maximum load.可能会导致迭代器、指针和引用失效，但仅当插入操作导致负载因子超过最大负载因子时才会发生。
:937
06/05/2026

Search