Zen

Translation

:980
English
Inserts a new element into the container if there is no existing element with key `k` contained within it.
28/1060 · 106

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.key()`. `nh` is empty when the function returns.
如果 `nh` 非空，则当且仅当容器中没有键与 `nh.key()` 等价的元素时，才将关联的元素插入容器。函数返回时 `nh` 变为空。
Returns:;; An `insert_return_type` object constructed from `position`, `inserted` and `node`: +
返回：一个 `insert_return_type` 对象，由 `position`、`inserted` 和 `node` 构造而成。
If `nh` is empty, `inserted` is `false`, `position` is `end()`, and `node` is empty.
若 `nh` 为空，则 `inserted` 为 `false` ， `position` 为 `end()` ，且 `node` 为空。
Otherwise if the insertion took place, `inserted` is true, `position` points to the inserted element, and `node` is empty.
否则，若插入操作发生，则 `inserted` 为 `true` ， `position` 指向被插入的元素，且 `node` 为空。
If the insertion failed, `inserted` is false, `node` has the previous value of `nh`, and `position` points to an element with a key equivalent to `nh.key()`.
若插入操作失败，则 `inserted` 为 `false` ， `node` 保留 `nh` 的原始值，且 `position` 指向与 `nh.key()` 等效的元素。
Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
若 `nh` 非空，则当且仅当容器中不存在键等价于 `nh.key()` 的元素时，插入其关联元素。函数返回时 `nh` 为空。
:950
---
---
Insert Node with Hint
带提示的节点插入
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
```c++ iterator insert(const_iterator hint, node_type&& nh); ```
If `nh` is not empty, inserts the associated element in the container if and only if there is no element in the container with a key equivalent to `nh.key()`. `nh` becomes empty if insertion took place, otherwise it is not changed.
如果 `nh` 非空，则当且仅当容器中没有键与 `nh.key()` 等价的元素时，才将关联的元素插入容器。如果插入发生，则 `nh` 变为空；否则 `nh` 不变。
:960
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
Returns:;; The iterator returned is `end()` if `nh` is empty. If insertion 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:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.
返回：如果 `nh` 为空，则返回的迭代器为 `end()`。如果插入发生，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：如果 `nh` 非空且 `nh` 与容器的分配器不相等，则行为未定义。
:968
---
---
try_emplace
try_emplace
```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="">
std::pair<iterator, bool=""> try_emplace(const key_type&amp; k, Args&amp;&amp;... args);
template<class... args="">
std::pair<iterator, bool=""> try_emplace(key_type&amp;&amp; k, Args&amp;&amp;... args);
template<class k,="" class...="" args="">
std::pair<iterator, bool=""> try_emplace(K&amp;&amp; k, Args&amp;&amp;... args);
```</iterator,></class></iterator,></class...></iterator,></class...>
:980
Inserts a new element into the container if there is no existing element with key `k` contained within it.
如果容器中不存在键为 `k` 的元素，则插入一个新元素。
:982
If there is an existing element with key `k` this function does nothing.
如果已存在键为 `k` 的元素，则该函数不执行任何操作。
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++
返回：返回类型的 `bool` 分量为 `true` 表示发生了插入。
如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：此函数类似于 xref:#unordered_node_map_emplace[emplace]，区别在于如果存在具有等价键的元素，则不构造 `value_type`；否则，构造形式为：

```c++
:995
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<key>(k)),
std::forward_as_tuple(std::forward<args>(args)...))
```</args></key>
:1000
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<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
unlike xref:#unordered_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor.
与 xref:#unordered_node_map_emplace[emplace] 不同，后者只是将所有参数直接转发给 `value_type` 的构造函数。
:1007
Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.
可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:1009
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.
`template<class k,="" args="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1011
--
--
:1013
---
---
try_emplace with Hint
带提示的 try_emplace
```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... args=""> iterator try_emplace(const_iterator hint, const key_type&amp; k, Args&amp;&amp;... args); template<class... args=""> iterator try_emplace(const_iterator hint, key_type&amp;&amp; k, Args&amp;&amp;... args); template<class k,="" class...="" args=""> iterator try_emplace(const_iterator hint, K&amp;&amp; k, Args&amp;&amp;... args); ```</class></class...></class...>
:1025
Inserts a new element into the container if there is no existing element with key `k` contained within it.
如果容器中不存在键为 `k` 的元素，则插入一个新元素。
:1027
If there is an existing element with key `k` this function does nothing.
如果已存在键为 `k` 的元素，则该函数不执行任何操作。
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
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++
返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：此函数类似于 xref:#unordered_node_map_emplace_hint[emplace_hint]，区别在于如果存在具有等价键的元素，则不构造 `value_type`；否则，构造形式为：

```c++
Key English Chinese (Simplified Han script) Actions
:841
---
---
:849
Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
:861
---
---
:870
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
:882
---
---
:890
Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.
当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
:892
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
:904
---
---
:911
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
将一个范围内的元素插入容器中。当且仅当容器中没有具有等价键的元素时，才会插入这些元素。
:918
---
---
:925
Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent key.
将一个范围内的元素插入容器中。当且仅当容器中没有具有等价键的元素时，才会插入这些元素。
:932
---
---
:950
---
---
:960
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
:968
---
---
:980
Inserts a new element into the container if there is no existing element with key `k` contained within it.
如果容器中不存在键为 `k` 的元素，则插入一个新元素。
:982
If there is an existing element with key `k` this function does nothing.
如果已存在键为 `k` 的元素，则该函数不执行任何操作。
:995
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<key>(k)),
std::forward_as_tuple(std::forward<args>(args)...))
```</args></key>

Loading…

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

String added in the repository
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.
:980
06/05/2026
Browse all string changes

Glossary

English Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Key
:980
Flags
safe-html, strict-same
Unit identifier
52986
Source string location
:980
String age
06/05/2026
Last updated
06/06/2026
Source string age
06/05/2026
Translation file AsciiDoc file
doc/modules/ROOT/pages/reference/unordered_node_map_zh_Hans.adoc, string 233