Zen

Translation

Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
248/5120 · 512

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
Bucket Interface
桶接口
bucket_count
bucket_count
```c++ size_type bucket_count() const noexcept; ```
```c++ size_type bucket_count() const noexcept; ```
Returns:;; The number of buckets.
返回：;; 桶的数量。
:1507
---
---
max_bucket_count
max_bucket_count
```c++ size_type max_bucket_count() const noexcept; ```
```c++ size_type max_bucket_count() const noexcept; ```
Returns:;; An upper bound on the number of buckets.
返回：;; 桶数量的上限。
:1517
---
---
bucket_size
桶大小
```c++ size_type bucket_size(size_type n) const; ```
```c++ size_type bucket_size(size_type n) const; ```
Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`.
要求：;; `n &lt; bucket_count()`返回：;; 桶 `n` 中的元素个数。
:1528
---
---
bucket
桶
```c++ size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; ```
```c++ size_type bucket(const key_type&amp; k) const; template<class k=""> size_type bucket(const K&amp; k) const; ```</class>
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
返回：;; 包含键 `k` 的元素的桶索引。
后置条件：;; 返回值小于 `bucket_count()`。
备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
:1541
---
---
:1543
begin
begin
```c++ local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; ```
```c++ local_iterator begin(size_type n); const_local_iterator begin(size_type n) const; ```
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the first element in the bucket with index `n`.
要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中第一个元素的局部迭代器。
:1554
---
---
:1556
end
end
```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ```
```c++ local_iterator end(size_type n); const_local_iterator end(size_type n) const; ```
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A local iterator pointing the 'one past the end' element in the bucket with index `n`.
要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中“尾后”元素的局部迭代器。
:1566
---
---
:1568
cbegin
cbegin
```c++ const_local_iterator cbegin(size_type n) const; ```
```c++ const_local_iterator cbegin(size_type n) const; ```
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the first element in the bucket with index `n`.
要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中第一个元素的常量局部迭代器。
:1577
---
---
:1579
cend
cend
```c++ const_local_iterator cend(size_type n) const; ```
```c++ const_local_iterator cend(size_type n) const; ```
English Chinese (Simplified Han script) Actions
Deduction Guides
推导指引
A deduction guide will not participate in overload resolution if any of the following are true:
在以下任一条件成立时，推导指引将不参与重载决议：
A `size_­type` parameter type in a deduction guide refers to the `size_­type` member type of the container type deduced by the deduction guide. Its default value coincides with the default value of the constructor selected.
推导指引中的 `size_type` 参数类型指向由该推导指引所推导出的容器类型的 `size_type` 成员类型。其默认值与所选构造函数的默认值一致。
__iter-to-alloc-type__
__iter-to-alloc-type__
Equality Comparisons
相等性比较
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const unordered_map<Key, T, Hash, Pred, Alloc>& x, const unordered_map<Key, T, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator==(const unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; x, const unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
operator!
operator!
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x, const unordered_map<Key, T, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; x, const unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x, unordered_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> void swap(unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; x, unordered_map<key, t,="" hash,="" pred,="" alloc="">&amp; y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors.
效果：;; `x.swap(y)`
抛出：;; 除非由 `key_equal` 或 `hasher` 的复制构造函数或复制赋值运算符抛出异常，否则不会抛出异常。
备注：;; 异常规范与 C++11 标准不完全相同，因为相等谓词和哈希函数是通过它们的复制构造函数进行交换的。
Saves all the elements of an `unordered_map` `x` to an archive (XML archive) `ar`.
将 `unordered_map` `x` 的所有元素保存到归档（XML 归档）`ar` 中。
Deletes all preexisting elements of an `unordered_map` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `unordered_map` `other` saved to the storage read by `ar`.
删除 `unordered_map` `x` 中所有已存在的元素，并从归档（XML 归档）`ar` 中插入由 `ar` 所读取存储中保存的原始 `unordered_map` `other` 元素的恢复副本。
Constructs an empty container with at least `n` buckets, using `hf` as the hash function, the default key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
构造一个至少包含 n 个桶的空容器，使用 hf 作为哈希函数，使用默认的键相等谓词，a 作为分配器，以及最大负载因子 1.0。
Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `(std::remove_const<key_type>::type&&, std::remove_const<mapped_type>::type&&)`. `x.key_equal()` is functionally equivalent to `other.key_equal()`. Note:;; If the archive was saved using a release of Boost prior to Boost 1.84, the configuration macro `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` has to be globally defined for this operation to succeed; otherwise, an exception is thrown.
要求：;; `value_type` 可以从 `(std::remove_const<key_type>::type&amp;&amp;, std::remove_const<mapped_type>::type&amp;&amp;)` 进行 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^]。`x.key_equal()` 在功能上等价于 `other.key_equal()`。
注意：;; 如果归档是使用 Boost 1.84 之前的 Boost 版本保存的，则必须全局定义配置宏 `BOOST_UNORDERED_ENABLE_SERIALIZATION_COMPATIBILITY_V0` 才能使此操作成功；否则将抛出异常。</mapped_type></key_type>
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
返回：;; 包含键 `k` 的元素的桶索引。
后置条件：;; 返回值小于 `bucket_count()`。
备注：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>

Loading…

User avatar admin

Translation uploaded
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. Notes:;; The `template<class K>` overload only participates in overload resolution if返回：;; 包含键 `k` 的元素的桶索引。
后置条件：;; 返回值小于 `bucket_count()`。
备注：;; 仅当 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` and和 `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type.类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
06/05/2026
User avatar admin

String added in the repository
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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.
06/05/2026
Browse all string changes

Things to check

Mismatched full stop

Source and translation do not both end with a full stop.

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
55783
Source string location
:1537
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 401