Zen

Translation

Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
73/1890 · 189

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `[f, l)` 范围内的元素插入其中。
:601
Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求;; `key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求。
:603
---
---
initializer_list Constructor with Allocator
带分配器的初始化列表构造函数
```c++ unordered_node_map(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_node_map(std::initializer_list<value_type> il, const allocator_type&amp; a); ```</value_type>
Constructs an empty container using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词构造一个空容器，并将 `il` 中的元素插入其中。
:614
Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`hasher` 和 `key_equal` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:616
---
---
initializer_list Constructor with Bucket Count and Allocator
带桶数和分配器的初始化列表构造函数
```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const allocator_type& a); ```
```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const allocator_type&amp; a); ```</value_type>
Constructs an empty container with at least `n` buckets, using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词，构造一个至少包含 `n` 个桶的空容器，并将 `il` 中的元素插入其中。
:627
Requires:;; `hasher` and `key_equal` need to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`hasher` 和 `key_equal` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:629
---
---
initializer_list Constructor with Bucket Count and Hasher and Allocator
带桶数、哈希函数和分配器的初始化列表构造函数
```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const hasher& hf, const allocator_type& a); ```
```c++ unordered_node_map(std::initializer_list<value_type> il, size_type n, const hasher&amp; hf, const allocator_type&amp; a); ```</value_type>
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `il` 中的元素插入其中。
:641
Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
要求：`key_equal` 需要满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^]。
:643
---
---
Destructor
析构函数
```c++ ~unordered_node_map(); ```
```c++ ~unordered_node_map(); ```
Note:;; The destructor is applied to every element, and all memory is deallocated
注意：析构函数会应用于每个元素，并且所有内存都会被释放。
:654
---
---
Assignment
赋值操作
Copy Assignment
拷贝赋值
```c++ unordered_node_map& operator=(unordered_node_map const& other); ```
```c++ unordered_node_map&amp; operator=(unordered_node_map const&amp; other); ```
The assignment operator. Destroys previously existing elements, copy-assigns the hash function and predicate from `other`, copy-assigns the allocator from `other` if `Alloc::propagate_on_container_copy_assignment` exists and `Alloc::propagate_on_container_copy_assignment::value` is `true`, and finally inserts copies of the elements of `other`.
赋值运算符。销毁之前存在的元素，从 `other` 拷贝赋值哈希函数和谓词，如果 `Alloc::propagate_on_container_copy_assignment` 存在且 `Alloc::propagate_on_container_copy_assignment::value` 为 `true`，则从 `other` 拷贝赋值分配器，最后插入 `other` 中元素的副本。
:669
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]
要求：`value_type` 满足 https://en.cppreference.com/w/cpp/named_req/CopyInsertable[可拷贝插入^]。
:671
---
---
Move Assignment
移动赋值
```c++ unordered_node_map& operator=(unordered_node_map&& other) noexcept((boost::allocator_traits<Allocator>::is_always_equal::value || boost::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) && std::is_same<pointer, value_type*>::value); ``` The move assignment operator. Destroys previously existing elements, swaps the hash function and predicate from `other`, and move-assigns the allocator from `other` if `Alloc::propagate_on_container_move_assignment` exists and `Alloc::propagate_on_container_move_assignment::value` is `true`. If at this point the allocator is equal to `other.get_allocator()`, the internal bucket array of `other` is transferred directly to the new container; otherwise, inserts move-constructed copies of the elements of `other`. If statistics are xref:unordered_node_map_boost_unordered_enable_stats[enabled], transfers the internal statistical information from `other` iff the final allocator is equal to `other.get_allocator()`, and always calls `other.reset_stats()`.
```c++
unordered_node_map&amp; operator=(unordered_node_map&amp;&amp; other) noexcept((boost::allocator_traits<allocator>::is_always_equal::value || boost::allocator_traits<allocator>::propagate_on_container_move_assignment::value) &amp;&amp; std::is_same<pointer, value_type*="">::value);
```
移动赋值运算符。销毁之前存在的元素，交换来自 `other` 的哈希函数和谓词，并且如果 `Alloc::propagate_on_container_move_assignment` 存在且 `Alloc::propagate_on_container_move_assignment::value` 为 `true`，则从 `other` 移动赋值分配器。如果此时分配器与 `other.get_allocator()` 相等，则 `other` 的内部桶数组直接转移给当前容器；否则，插入从 `other` 元素移动构造而来的副本。如果启用了统计信息（详见 xref:unordered_node_map_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`]），则当最终分配器与 `other.get_allocator()` 相等时，从 `other` 转移内部的统计信息，并且始终会调用 `other.reset_stats()`。</pointer,></allocator></allocator>
:688
---
---
English Chinese (Simplified Han script) Actions
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
带哈希函数和分配器的桶数构造函数
Postconditions:;; `size() == 0` Requires:;; `key_equal` needs to be https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^].
后置条件：`size() == 0` 要求：`key_equal` 需满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造^] 要求。
Iterator Range Constructor with Bucket Count and Allocator
带桶数和分配器的迭代器范围构造函数
Constructs an empty container with at least `n` buckets, using `a` as the allocator and default hash function and key equality predicate, and inserts the elements from `[f, l)` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `a` 作为分配器以及默认的哈希函数和键相等谓词，并将 `[f, l)` 范围内的元素插入其中。
```c++ unordered_node_map(std::initializer_list<value_type> il, const allocator_type& a); ```
```c++ unordered_node_map(std::initializer_list<value_type> il, const allocator_type&amp; a); ```</value_type>
Constructs an empty container using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词构造一个空容器，并将 `il` 中的元素插入其中。
Constructs an empty container with at least `n` buckets, using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.
使用 `a` 以及默认的哈希函数和键相等谓词，构造一个至少包含 `n` 个桶的空容器，并将 `il` 中的元素插入其中。
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `il` 中的元素插入其中。
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&amp;&amp; obj); std::pair<iterator, bool=""> insert(init_type&amp;&amp; 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&amp; obj);
iterator insert(const_iterator hint, const init_type&amp; 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` 之外的操作抛出异常，则该函数无效果。
注意：可能使迭代器失效，但仅当插入导致负载大于最大负载时才会发生。

Loading…

User avatar admin

Translation uploaded
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数，`a` 作为分配器，使用默认的键相等谓词，并将 `il` 中的元素插入其中。
06/05/2026
User avatar admin

String added in the repository
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `a` as the allocator and default key equality predicate,and inserts the elements from `il` into it.
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
52876
Source string location
:638
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 123