Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Flat Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: If there is no such element, it is added to …

Zen

Translation

Key :1042

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:986	--	--
:988	---	---
	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& 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); ```</iterator,></class></iterator,></class></iterator,></class>
:1000	Inserts a new element into the container or updates an existing one by assigning to the contained value.	向容器中插入一个新元素，或通过赋值给已包含的值来更新现有元素。
:1002	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	如果存在键为 k 的元素，则通过赋值 std::forward<m>(obj) 来更新该元素</m>
:1004	If there is no such element, it is added to the container as: ```c++	如果不存在这样的元素，则将其添加到容器中，形式如下：```c++
:1007	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>
:1012	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 pointers and references, 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>
:1026	---	---
	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& 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); ```</class></class></class>
:1038	Inserts a new element into the container or updates an existing one by assigning to the contained value.	向容器中插入一个新元素，或通过赋值给已存在的值来更新现有元素。
:1040	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新该元素。</m>
:1042	If there is no such element, it is added to the container as: ```c++	如果不存在这样的元素，则将其添加到容器中，形式如下：```c++
:1045	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>
:1050	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>
:1055	`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, pointers and references, 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>
:1064	---	---
	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` 。
:1083	---	---
	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& k); template<class k=""> size_type erase(K&& 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>
:1098	---	---
	Erase Range	范围擦除

Key	English	Chinese (Simplified Han script)
	```c++ init_type pull(const_iterator position); ```	```c++ init_type pull(const_iterator position); ```
	end	end
	Returns:;; An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container. Complexity:;; O(`bucket_count()`)	返回：指向容器第一个元素的迭代器，若容器为空则返回容器尾后迭代器。复杂度：O(`bucket_count()`)
	```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```	```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```
	Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`.	从 `position` 指向的元素移动构造一个 `init_value` 对象 `x`，擦除该元素并返回 `x`。
	begin	begin
	```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& 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); ```</iterator,></class></iterator,></class...></iterator,></class...>
:1000	Inserts a new element into the container or updates an existing one by assigning to the contained value.	向容器中插入一个新元素，或通过赋值给已包含的值来更新现有元素。
:1002	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	如果存在键为 k 的元素，则通过赋值 std::forward<m>(obj) 来更新该元素</m>
:1004	If there is no such element, it is added to the container as: ```c++	如果不存在这样的元素，则将其添加到容器中，形式如下：```c++
:1007	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>
:1012	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>
:1026	---	---
:1038	Inserts a new element into the container or updates an existing one by assigning to the contained value.	向容器中插入一个新元素，或通过赋值给已存在的值来更新现有元素。
:1040	If there is an element with key `k`, then it is updated by assigning `std::forward<M>(obj)`.	如果存在键为 `k` 的元素，则通过赋值 `std::forward<m>(obj)` 来更新该元素。</m>
:1042	If there is no such element, it is added to the container as: ```c++	如果不存在这样的元素，则将其添加到容器中，形式如下：```c++
:1045	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>
:1050	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>
:1055	`hint` is a suggestion to where the element should be inserted. This implementation ignores it.	`hint` 是一个关于元素应插入位置的建议。此实现会忽略该建议。
:1064	---	---
:1083	---	---
:1098	---	---
:1112	---	---
:1123	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`，则交换容器的分配器。否则，使用不相等的分配器进行交换将导致未定义行为。
:1128	---	---
:1138	---	---
:1150	---	---
:1162	---	---
:1174	---	---
:1184	---	---

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 62 characters editedCurrent translationState: Translated

Context

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 68 characters editedPrevious translationState: Needs editing (Needs rewriting)

Context

06/05/2026

Browse all string changes

Glossary

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

String information

Key

:1042

Flags

safe-html, strict-same

Unit identifier

55207

Source string location

:1042

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_flat_map_zh_Hans.adoc, string 249

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Translation

Glossary

String information

Key

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file