Zen

Translation

:1108
English
Inserts a new element into the container or updates an existing one by assigning to the contained value.
26/1040 · 104

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
:1052
Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.
可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:1054
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>
:1056
--
--
:1058
---
---
insert_or_assign
insert_or_assign
```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 m="">
std::pair<iterator, bool=""> insert_or_assign(const key_type&amp; k, M&amp;&amp; obj);
template<class m="">
std::pair<iterator, bool=""> insert_or_assign(key_type&amp;&amp; k, M&amp;&amp; obj);
template<class k,="" class="" m="">
std::pair<iterator, bool=""> insert_or_assign(K&amp;&amp; k, M&amp;&amp; obj);
```</iterator,></class></iterator,></class></iterator,></class>
:1070
Inserts a new element into the container or updates an existing one by assigning to the contained value.
向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1072
If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.
如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新它。</m>
:1074
If there is no such element, it is added to the container as: ```c++
如果不存在这样的元素，则将其添加到容器中，形式为：
```c++
:1077
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<key>(k)), std::forward_as_tuple(std::forward<m>(obj)))</m></key>
:1082
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<k>(k)), std::forward_as_tuple(std::forward<m>(obj))) ```</m></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:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. + + 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.
返回：返回类型的 `bool` 分量为 `true` 表示发生了插入。
如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。

`template<class k,="" class="" m="">` 仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1096
---
---
insert_or_assign with Hint
带提示位置的 insert_or_assign
```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 m=""> iterator insert_or_assign(const_iterator hint, const key_type&amp; k, M&amp;&amp; obj); template<class m=""> iterator insert_or_assign(const_iterator hint, key_type&amp;&amp; k, M&amp;&amp; obj); template<class k,="" class="" m=""> iterator insert_or_assign(const_iterator hint, K&amp;&amp; k, M&amp;&amp; obj); ```</class></class></class>
:1108
Inserts a new element into the container or updates an existing one by assigning to the contained value.
向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1110
If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.
如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新它。</m>
:1112
If there is no such element, it is added to the container as: ```c++
如果不存在这样的元素，则将其添加到容器中，形式为：
```c++
:1115
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<key>(k)), std::forward_as_tuple(std::forward<m>(obj)))</m></key>
:1120
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<k>(k)), std::forward_as_tuple(std::forward<m>(obj))) ```</m></k>
:1125
`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:;; Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load. + + 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.
返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。
抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。

`template<class k,="" class="" m="">` 仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1134
---
---
Erase by Position
按位置擦除
Erase the element pointed to by `position`.
擦除由 `position` 指向的元素。
Returns:;; An opaque object implicitly convertible to the `iterator` or `const_iterator` immediately following `position` prior to the erasure. Throws:;; Nothing. Notes:;; The opaque object returned must only be discarded or immediately converted to `iterator` or `const_iterator`.
返回：一个不透明对象，可隐式转换为 `position` 在被擦除之前紧后位置的 `iterator` 或 `const_iterator`。
抛出：不抛出任何异常。
注意：返回的不透明对象只能被丢弃或立即转换为 `iterator` 或 `const_iterator`。
:1153
---
---
Erase by Key
通过键擦除
```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ```
```c++ size_type erase(const key_type&amp; k); template<class k=""> size_type erase(K&amp;&amp; k); ```</class>
Erase all elements with key equivalent to `k`.
擦除所有键与 `k` 等价的元素。
Returns:;; The number of elements erased. 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 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.
返回：被擦除的元素数量。
抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
Key English Chinese (Simplified Han script) Actions
:1013
---
---
: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` 的元素，则该函数不执行任何操作。
:1040
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<key>(k)), std::forward_as_tuple(std::forward<args>(args)...))</args></key>
:1045
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>
:1052
Can invalidate iterators, but only if the insert causes the load to be greater than the maximum load.
可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
:1054
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>
:1056
--
--
:1058
---
---
:1070
Inserts a new element into the container or updates an existing one by assigning to the contained value.
向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1072
If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.
如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新它。</m>
:1074
If there is no such element, it is added to the container as: ```c++
如果不存在这样的元素，则将其添加到容器中，形式为：
```c++
:1077
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<key>(k)), std::forward_as_tuple(std::forward<m>(obj)))</m></key>
:1082
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<k>(k)), std::forward_as_tuple(std::forward<m>(obj))) ```</m></k>
:1096
---
---
:1108
Inserts a new element into the container or updates an existing one by assigning to the contained value.
向容器中插入一个新元素，或通过赋值更新现有元素的值。
:1110
If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.
如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新它。</m>
:1112
If there is no such element, it is added to the container as: ```c++
如果不存在这样的元素，则将其添加到容器中，形式为：
```c++
:1115
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<key>(k)), std::forward_as_tuple(std::forward<m>(obj)))</m></key>
:1120
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<k>(k)), std::forward_as_tuple(std::forward<m>(obj))) ```</m></k>
:1125
`hint` is a suggestion to where the element should be inserted. This implementation ignores it.
`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
:1134
---
---
:1153
---
---
:1168
---
---
:1182
---
---
:1193
If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior.
如果 `Allocator::propagate_on_container_swap` 被声明且 `Allocator::propagate_on_container_swap::value` 为 `true`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
:1198
---
---
:1211
---
---
:1226
---
---
:1236
---
---

Loading…

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

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

Glossary

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

String information

Key
:1108
Flags
safe-html, strict-same
Unit identifier
53020
Source string location
:1108
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 267