Zen

Translation

A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
90/1280 · 128

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the container (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.
桶数组的大小可以通过调用 `insert`/`emplace` 自动增加，或者作为调用 `rehash`/`reserve` 的结果。容器的 _负载因子_（元素数量除以桶数量）永远不会大于 `max_load_factor()`，但在容器规模较小时，实现可能会允许更高的负载。
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>
:327
---
---
Configuration Macros
配置宏
`BOOST_UNORDERED_ENABLE_STATS`
`BOOST_UNORDERED_ENABLE_STATS`
Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the container. Note that this option decreases the overall performance of many operations.
全局定义此宏可为容器启用 xref:reference/stats.adoc#stats[统计计算]。请注意，此选项会降低许多操作的整体性能。
:336
---
---
Typedefs
类型定义
An iterator whose value type is `value_type`.
一种迭代器，其值类型为 `value_type` 。
:347
The iterator category is at least a forward iterator.
迭代器类别至少为前向迭代器。
Convertible to `const_iterator`.
可转换为 `const_iterator`。
:351
---
---
A constant iterator whose value type is `value_type`.
一个常量迭代器，其值类型为 `value_type` 。
:360
The iterator category is at least a forward iterator.
迭代器类别至少为前向迭代器。
:362
---
---
A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
一个用于存放被提取容器元素的类，符合 https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle] 模型。
:372
---
---
A specialization of an internal class template:
内部类模板的特化：
with `Iterator` = `iterator` and `NodeType` = `node_type`.
其中 `Iterator` = `iterator`，`NodeType` = `node_type`。
:394
---
---
Constructors
构造函数
Default Constructor
默认构造函数
```c++ unordered_node_map(); ```
```c++ unordered_node_map(); ```
Constructs an empty container using `hasher()` as the hash function, `key_equal()` as the key equality predicate and `allocator_type()` as the allocator.
使用 `hasher()` 作为哈希函数，`key_equal()` 作为键相等谓词，`allocator_type()` 作为分配器，构造一个空容器。
:407
Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
后置条件：`size() == 0`
要求：如果使用默认值，则 `hasher`、`key_equal` 和 `allocator_type` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:410
---
---
Bucket Count Constructor
桶数构造函数
```c++ explicit unordered_node_map(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```
```c++ explicit unordered_node_map(size_type n, const hasher&amp; hf = hasher(), const key_equal&amp; eql = key_equal(), const allocator_type&amp; a = allocator_type()); ```
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, and `a` as the allocator.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器。
:424
Postconditions:;; `size() == 0` Requires:;; If the defaults are used, `hasher`, `key_equal` and `allocator_type` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
后置条件：`size() == 0`
要求：如果使用默认值，则 `hasher`、`key_equal` 和 `allocator_type` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:427
---
---
English Chinese (Simplified Han script) Actions
```c++ explicit unordered_node_map(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); ```
```c++ explicit unordered_node_map(size_type n, const hasher&amp; hf = hasher(), const key_equal&amp; eql = key_equal(), const allocator_type&amp; a = allocator_type()); ```
initializer_list Constructor with Allocator
带分配器的初始化列表构造函数
Move Insert with Hint
带提示的移动插入
Insert Iterator Range
迭代器范围插入
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++
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` 外）。 - 容器的最大负载因子由内部管理，用户无法进行设置。
Globally define this macro to enable xref:reference/stats.adoc#stats[statistics calculation] for the container. Note that this option decreases the overall performance of many operations.
全局定义此宏可为容器启用 xref:reference/stats.adoc#stats[统计计算]。请注意，此选项会降低许多操作的整体性能。
Typedefs
类型定义
An iterator whose value type is `value_type`.
一种迭代器，其值类型为 `value_type` 。
A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
一个用于存放被提取容器元素的类，符合 https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle] 模型。
Bucket Count Constructor
桶数构造函数
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a` as the allocator, and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词，`a` 作为分配器，并将 `[f, l)` 范围内的元素插入其中。
Iterator Range Constructor with Allocator
带分配器的迭代器范围构造函数
```c++ template<class InputIterator> unordered_node_map(InputIterator f, InputIterator l, const allocator_type& a); ```
```c++ template<class inputiterator=""> unordered_node_map(InputIterator f, InputIterator l, const allocator_type&amp; a); ```</class>
Constructs an empty container using `a` as the allocator, with the default hash function and key equality predicate and inserts the elements from `[f, l)` into it.
使用 `a` 作为分配器，以默认哈希函数和键相等谓词构造一个空容器，并将 `[f, l)` 范围内的元素插入其中。
Constructs a container, copying ``other``'s contained elements, hash function, and predicate, but using allocator `a`.
构造一个容器，拷贝 `other` 所包含的元素、哈希函数和谓词，但使用分配器 `a`。
Move Constructor with Allocator
带分配器的移动构造函数
```c++ unordered_node_map(unordered_node_map&& other, Allocator const& a); ```
```c++ unordered_node_map(unordered_node_map&amp;&amp; other, Allocator const&amp; a); ```
```c++ unordered_node_map(concurrent_node_map<Key, T, Hash, Pred, Allocator>&& other); ```
```c++ unordered_node_map(concurrent_node_map<key, t,="" hash,="" pred,="" allocator="">&amp;&amp; other); ```</key,>
Initializer List Constructor
初始化列表构造函数
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate and `a`, and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`eql` 作为键相等谓词和 `a`，并将 `il` 中的元素插入其中。
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate and `a` as the allocator.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，使用默认的哈希函数和键相等谓词，并以 `a` 作为分配器。
Postconditions:;; `size() == 0` Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
后置条件：`size() == 0`
要求：`hasher` 和 `key_equal` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
Bucket Count Constructor with Hasher and Allocator
带哈希函数和分配器的桶数构造函数
Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator.
将迭代器（或常量迭代器）`it` 的位置信息保存到归档（XML 归档）`ar` 中。`it` 可以是一个 `end()` 迭代器。
Requires:;; The `unordered_node_map` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`.
要求：`it` 所指向的 `unordered_node_map` 容器 `x` 必须先被保存到 `ar` 中，并且在保存 `x` 和保存 `it` 之间，不能对 `x` 执行任何修改操作。
Loading an iterator/const_iterator from an archive
从归档加载迭代器/常量迭代器
Makes an `iterator` (`const_iterator`) `it` point to the restored position of the original `iterator` (`const_iterator`) saved to the storage read by an archive (XML archive) `ar`.
使迭代器（或常量迭代器）`it` 指向原始迭代器（或常量迭代器）被保存到归档（XML 归档）`ar` 所读取存储中的位置恢复后的位置。
Requires:;; If `x` is the `unordered_node_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`.
要求：如果 `x` 是 `it` 所指向的 `unordered_node_map` 容器，则在加载 `x` 和加载 `it` 之间，不能对 `x` 执行任何修改操作。

Loading…

User avatar admin

Translation uploaded
A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
A class for holding extracted container elements, modelling一个用于存放被提取容器元素的类，符合 https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle]. 模型。
06/05/2026
User avatar admin

String added in the repository
A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
A class for holding extracted container elements, modelling https://en.cppreference.com/w/cpp/container/node_handle[NodeHandle].
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
52791
Source string location
:369
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 38