Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Returns:;; The `bool` component of the return type is `true` …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	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& 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...>
: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& 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); ```</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++
: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>

	English	Chinese (Simplified Han script)	Actions
	Assign from values in initializer list. All previously existing elements are destroyed.	从初始化列表中的值进行赋值。所有之前存在的元素都会被销毁。
	```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```	```c++ iterator begin() noexcept; const_iterator begin() const noexcept; ```
	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 end() noexcept; const_iterator end() const noexcept; ```	```c++ iterator end() noexcept; const_iterator end() const noexcept; ```
	Returns:;; An iterator which refers to the past-the-end value for the container.	返回：指向容器尾后值的迭代器。
	Size and Capacity	大小与容量
	size	大小
	```c++ size_type size() const noexcept; ```	```c++ size_type size() const noexcept; ```
	Returns:;; `std::distance(begin(), end())`	Returns:;; `std::distance(begin(), end())`
	```c++ size_type max_size() const noexcept; ```	```c++ size_type max_size() const noexcept; ```
	```c++ std::pair<iterator, bool> insert(value_type&& obj); std::pair<iterator, bool> insert(init_type&& obj); ```	```c++ std::pair<iterator, bool=""> insert(value_type&& obj); std::pair<iterator, bool=""> insert(init_type&& obj); ```</iterator,></iterator,>
	```c++ iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, const init_type& obj); ``` Inserts `obj` in the container if and only if there is no element in the container with an equivalent key.	```c++ iterator insert(const_iterator hint, const value_type& obj); iterator insert(const_iterator hint, const init_type& obj); ``` 当且仅当容器中没有具有等价键的元素时，才将 `obj` 插入容器。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] into the container from `*first`. Throws:;; When inserting a single element, 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.	要求：`value_type` 可以从 `*first` 出发在容器中进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[可原位构造^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
	Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^] into the container. Throws:;; When inserting a single element, 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.	要求：`value_type` 可以在容器中进行 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。抛出：当插入单个元素时，如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。
	```c++ iterator insert(const_iterator hint, node_type&& nh); ```	```c++ iterator insert(const_iterator hint, node_type&& nh); ```
	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++
	```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& 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); ```</class></class...></class...>
	`hint` is a suggestion to where the element should be inserted. This implementation ignores it.	`hint` 是关于元素插入位置的建议。此实现会忽略该建议。
	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>
	```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>
	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>
	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>
	swap	交换
	```c++ void swap(unordered_node_map& other) noexcept(boost::allocator_traits<Allocator>::is_always_equal::value \|\| boost::allocator_traits<Allocator>::propagate_on_container_swap::value); ```	```c++ void swap(unordered_node_map& other) noexcept(boost::allocator_traits<allocator>::is_always_equal::value \|\| boost::allocator_traits<allocator>::propagate_on_container_swap::value); ```</allocator></allocator>
	Extract by Position	通过位置提取
	Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`.	从 `position` 指向的元素移动构造一个 `init_value` 对象 `x`，擦除该元素并返回 `x`。
	clear	清空
	Transfers all the element nodes from `source` whose key is not already present in `*this`.	从 `source` 转移所有键在 `*this` 中尚未存在的元素节点。
	Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `this` is greater than its original maximum load, invalidates all iterators associated to `this`.	要求：`this->get_allocator() == source.get_allocator()`。注意：会使被转移元素的迭代器失效。如果 `this` 的结果大小大于其原始最大负载，则会使与 `this` 关联的所有迭代器失效。

Loading…

admin

Translation uploaded

English

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

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

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Things to check

Double space

Translation contains double space.

Fix string

Reset

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

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

String information

Flags

safe-html, strict-same

Unit identifier

52988

Source string location

:985

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 235

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

Things to check

Double space

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file