Zen

Translation

`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
105/1360 · 136

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Class Template unordered_map
类模板 unordered_map
:idprefix: unordered_map_
:idprefix: unordered_map_
`boost::unordered_map` — An unordered associative container that associates unique keys with another value.
`boost::unordered_map` — 一个无序关联容器，用于将唯一的键与另一个值关联起来。
Synopsis
概要
:280
---
---
Description
描述
*Template Parameters*
*模板参数*
_Key_
_键_
`Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`Key` 必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^]（即 `allocator_traits` 能够销毁它）。
_T_
_T_
`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`T` 必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^]（即 `allocator_traits` 可以销毁它）。
_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 implements an equivalence relation on values of type `Key`. 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` 类型的值。
_Allocator_
_Allocator_
An allocator whose value type is the same as the container's value type.
一种分配器，其值类型与容器的值类型相同。
Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
支持使https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[异形指针] 的分配器。
The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.
元素被组织到桶中。具有相同哈希码的键存储在同一桶中。
The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.
桶的数量可以通过调用 insert 自动增加，或者作为调用 rehash 的结果。
Configuration macros
配置宏
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
`BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0`
Globally define this macro to support loading of ``unordered_map``s saved to a Boost.Serialization archive with a version of Boost prior to Boost 1.84.
全局定义此宏以支持加载由 Boost 1.84 之前版本的 Boost 保存到 Boost.Serialization 归档中的 `unordered_map`。
Typedefs
类型定义
An iterator whose value type is `value_type`.
一个迭代器，其值类型为 `value_type`。
:327
The iterator category is at least a forward iterator.
迭代器类别至少为前向迭代器。
English Chinese (Simplified Han script) Actions
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_map_emplace_hint[emplace_hint] except the `value_type` is constructed using: + + -- ```c++
返回：如果发生了插入，则迭代器指向新插入的元素；否则，指向具有等价键的元素。 抛出：如果除调用 `hasher` 之外的操作抛出异常，则该函数无效果。
注意：此函数类似于 xref:#unordered_map_emplace_hint[emplace_hint]，区别在于 `value_type` 的构造方式如下：
```c++
instead of xref:#unordered_map_emplace_hint[emplace_hint] which simply forwards all arguments to ``value_type``'s constructor.
而不是像 xref:#unordered_map_emplace_hint[emplace_hint] 那样简单地将所有参数转发给 `value_type` 的构造函数。
```c++ node_type extract(const_iterator position); ```
```c++ node_type extract(const_iterator position); ```
Removes the element pointed to by `position`.
移除 `position` 所指向的元素。
Returns:;; A `node_type` owning the element. Notes:;; A node extracted using this method can be inserted into a compatible `unordered_multimap`.
返回：一个拥有该元素的 `node_type`。
注意：通过此方法提取的节点可以插入到兼容的 `unordered_multimap` 中。
Extract by Key
通过键提取
```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ```
```c++ node_type extract(const key_type&amp; k); template<class k=""> node_type extract(K&amp;&amp; k); ```</class>
Removes an element with key equivalent to `k`.
移除一个键与 `k` 等价的元素。
`boost::unordered_map` — An unordered associative container that associates unique keys with another value.
`boost::unordered_map` — 一个无序关联容器，用于将唯一的键与另一个值关联起来。
Synopsis
概要
Description
描述
*Template Parameters*
*模板参数*
_Key_
_键_
`Key` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`Key` 必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^]（即 `allocator_traits` 能够销毁它）。
_T_
_T_
`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`T` 必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^]（即 `allocator_traits` 可以销毁它）。
_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_
try_emplace
try_emplace
try_emplace with Hint
带提示位置的 `try_emplace`
insert_or_assign
insert_or_assign
Returns:;; The iterator following `position` before the erasure. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; In older versions this could be inefficient because it had to search through several buckets to find the position of the returned iterator. The data structure has been changed so that this is no longer the case, and the alternative erase methods have been deprecated.
返回：`position` 在被擦除之前的后一个迭代器。
抛出：仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。
注意：在旧版本中，此操作可能效率较低，因为它需要搜索多个桶以找到返回迭代器的位置。数据结构已经更改，不再是这种情况，并且备用的擦除方法已被弃用。
```
```
contains
包含
Returns:;; A boolean indicating whether or not there is an element with key equal to `key` in the container Notes:;; The `template<class K>` overload 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.
返回：;; 一个布尔值，指示容器中是否存在键等于 `key` 的元素。
备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
__iter-value-type__
_iter-value-type_
Serialization
序列化
Saving an unordered_map to an archive
将 unordered_map 保存到归档
Loading an unordered_map from an archive
从归档中加载 unordered_map

Loading…

User avatar admin

Translation uploaded
`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`T` must be必须可以从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e.（即 `allocator_traits` can destroy it).可以销毁它）。
06/05/2026
User avatar admin

String added in the repository
`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy it).
`T` must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container (i.e. `allocator_traits` can destroy 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
55393
Source string location
:287
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_map_zh_Hans.adoc, string 11