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>
:1040
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_node_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_node_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_node_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` 的元素，则该函数不执行任何操作。
:1027
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` 的元素，则插入一个新元素。
:1025
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
06/05/2026
User avatar admin

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

Translation uploaded
--
--
:1011
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 ifk,="" 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>
:1009
06/05/2026
User avatar admin

Translation uploaded
Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.
Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:1007
06/05/2026
User avatar admin

Translation uploaded
unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor.
unlike与 xref:#unordered_node_map_emplace[emplace], 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>
:1000
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)...))
```c++
value_type(std::piecewise_construct,
std::forward_as_tuple(std::forward<Kkey>(k)),
std::forward_as_tuple(std::forward<Aargs>(args)...))
```</args></key>
:995
06/05/2026
User avatar admin

Translation uploaded
Returns:;; The `bool` component of the return type is `true` if an insert took place. + + 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_node_map_emplace[emplace], 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:;; The `bool` component of the return type is `true` if an insert took place. + + 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_node_map_emplace[emplace], 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: + + -- 返回：返回类型的 `bool` 分量为 `true` 表示发生了插入。
如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：此函数类似于 xref:#unordered_node_map_emplace[emplace]，区别在于如果存在具有等价键的元素，则不构造 `value_type`；否则，构造形式为：

```c++
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` 的元素，则该函数不执行任何操作。
:982
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` 的元素，则插入一个新元素。
:980
06/05/2026
User avatar admin

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

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

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

Search