Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: `boost::unordered_node_map` — A node-based, open-addressing unordered associative container that associates …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	Class Template unordered_node_map	类模板 unordered_node_map
	:idprefix: unordered_node_map_	:idprefix: unordered_node_map_
	`boost::unordered_node_map` — A node-based, open-addressing unordered associative container that associates unique keys with another value.	`boost::unordered_node_map` — 一个基于节点的、开放寻址的无序关联容器，将唯一键与对应值相关联。
	`boost::unordered_node_map` uses an open-addressing layout like `boost::unordered_flat_map`, but, being node-based, it provides pointer stability and node handling functionalities. Its performance lies between those of `boost::unordered_map` and `boost::unordered_flat_map`.	`boost::unordered_node_map` 使用与 `boost::unordered_flat_map` 类似的开放寻址布局，但由于其基于节点的特性，它提供了指针稳定性和节点处理功能。其性能介于 `boost::unordered_map` 和 `boost::unordered_flat_map` 之间。
	As a result of its using open addressing, the interface of `boost::unordered_node_map` deviates in a number of aspects from that of `boost::unordered_map`/`std::unordered_map`:	由于使用开放寻址，`boost::unordered_node_map` 的接口在多个方面与 `boost::unordered_map`/`std::unordered_map` 有所不同：
	- `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`). - The maximum load factor of the container is managed internally and can't be set by the user.	- `begin()` 不是常数时间复杂度操作。 - 未提供用于桶管理的 API（除 `bucket_count` 外）。 - 容器的最大负载因子由内部管理，用户无法进行设置。
	Other than this, `boost::unordered_node_map` is mostly a drop-in replacement of standard unordered associative containers.	除此之外，`boost::unordered_node_map` 基本上可以作为标准无序关联容器的即时代替品。
	Synopsis	概要
:286	---	---
	Description	描述
	Template Parameters	模板参数
	_Key_	_键_
	into the container from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.	从任何可转换为 `std::pair` 的对象构造并插入容器，并且还必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[可擦除^]。
	_T_	_T_
	_Hash_	_Hash_
	A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.	一个一元函数对象类型，用作 `Key` 的哈希函数。它接受一个 `Key` 类型的参数，并返回一个 `std::size_t` 类型的值。
	_Pred_	_Pred_
	A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type `bool`.	一个二元函数对象，用于在 `Key` 类型的值上诱导出等价关系。它接受两个 `Key` 类型的参数，并返回一个 `bool` 类型的值。

	English	Chinese (Simplified Han script)	Actions
	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` 关联的所有迭代器失效。
	Returns:;; The container's key equality predicate	返回：容器的键相等谓词。
	Lookup	查找
	Loading an unordered_node_map from an archive	从归档中加载 unordered_node_map
	`boost::unordered_node_map` — A node-based, open-addressing unordered associative container that associates unique keys with another value.	`boost::unordered_node_map` — 一个基于节点的、开放寻址的无序关联容器，将唯一键与对应值相关联。
	`boost::unordered_node_map` uses an open-addressing layout like `boost::unordered_flat_map`, but, being node-based, it provides pointer stability and node handling functionalities. Its performance lies between those of `boost::unordered_map` and `boost::unordered_flat_map`.	`boost::unordered_node_map` 使用与 `boost::unordered_flat_map` 类似的开放寻址布局，但由于其基于节点的特性，它提供了指针稳定性和节点处理功能。其性能介于 `boost::unordered_map` 和 `boost::unordered_flat_map` 之间。
	Other than this, `boost::unordered_node_map` is mostly a drop-in replacement of standard unordered associative containers.	除此之外，`boost::unordered_node_map` 基本上可以作为标准无序关联容器的即时代替品。
	Description	描述
	Template Parameters	模板参数
	_Key_	_键_
	into the container from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.	从任何可转换为 `std::pair` 的对象构造并插入容器，并且还必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[可擦除^]。
	_T_	_T_
	An allocator whose value type is the same as the container's value type.	一个分配器，其值类型与容器的值类型相同。
	The element nodes of the container are held into an internal _bucket array_. A node is inserted into a bucket determined by the hash code of its element, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.	容器的元素节点被保存在内部的 _桶数组_ 中。节点根据其元素的哈希码被插入到对应的桶中，但如果该桶已被占用（发生 _冲突_），则会使用原始位置附近的一个可用桶。
	If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.	如果 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanching[hash_is_avalanching]<hash>::value` 为 `true`，则哈希函数将按原样使用；否则，会增加一个位混合后处理阶段，以牺牲额外的计算成本为代价来提高哈希质量。</hash>
	Configuration Macros	配置宏
	`BOOST_UNORDERED_ENABLE_STATS`	`BOOST_UNORDERED_ENABLE_STATS`
	Convertible to `const_iterator`.	可转换为 `const_iterator`。
	A constant iterator whose value type is `value_type`.	一个常量迭代器，其值类型为 `value_type` 。

Loading…

admin

Translation uploaded

English

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

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Glossary

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

String information

Flags

safe-html, strict-same

Unit identifier

52756

Source string location

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 3

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

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file