Zen

Translation

Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
74/1670 · 167

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
: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; ```
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中“尾后”元素的常量局部迭代器。
:1588
---
---
Hash Policy
哈希策略
load_factor
负载因子
```c++ float load_factor() const noexcept; ```
```c++ float load_factor() const noexcept; ```
Returns:;; The average number of elements per bucket.
返回：;; 每个桶的平均元素个数。
:1600
---
---
max_load_factor
max_load_factor
```c++ float max_load_factor() const noexcept; ```
```c++ float max_load_factor() const noexcept; ```
Returns:;; Returns the current maximum load factor.
返回：;; 返回当前的最大负载因子。
:1611
---
---
Set max_load_factor
设置最大负载因子
```c++ void max_load_factor(float z); ```
```c++ void max_load_factor(float z); ```
Effects:;; Changes the container's maximum load factor, using `z` as a hint.
效果：;; 改变容器的最大负载因子，以 `z` 作为提示。
:1621
---
---
rehash
重哈希
Key English Chinese (Simplified Han script) Actions
```c++ const_local_iterator cend(size_type n) const; ```
```c++ const_local_iterator cend(size_type n) const; ```
Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if `n > 0` and `a.max_load_factor() == std::numeric_limits<float>::infinity()`.
等价于 `a.rehash(ceil(n / a.max_load_factor()))`；如果 `n &gt; 0` 且 `a.max_load_factor() == std::numeric_limits<float>::infinity()`，则等价于 `a.rehash(1)`。</float>
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中“尾后”元素的常量局部迭代器。
Iterators to non-transferred elements in `source` remain valid.
`source` 中未被转移的元素的迭代器保持有效。
Returns:;; An iterator pointing to an element with key equivalent to `k`, or `b.end()` if no such element exists. Notes:;; The templated overloads containing `CompatibleKey`, `CompatibleHash` and `CompatiblePredicate` are non-standard extensions which allow you to use a compatible hash function and equality predicate for a key of a different type in order to avoid an expensive type cast. In general, its use is not encouraged and instead the `K` member function templates should be used. + + The `template<class K>` overloads only participate 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` 等价之元素的迭代器；若无此元素，则返回 `b.end()`。
备注：;; 包含 `CompatibleKey`、`CompatibleHash` 和 `CompatiblePredicate` 的模板重载属于非标准扩展，允许使用兼容的哈希函数和相等谓词来处理不同类型的键，从而避免昂贵的类型转换。通常不建议使用它们，而应使用 `K` 成员函数模板。
此外，仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class>
```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```
```c++ bool contains(const key_type&amp; k) const; template<class k=""> bool contains(const K&amp; k) const; ```</class>
```c++ std::pair<iterator, iterator> equal_range(const key_type& k); std::pair<const_iterator, const_iterator> equal_range(const key_type& k) const; template<class K> std::pair<iterator, iterator> equal_range(const K& k); template<class K> std::pair<const_iterator, const_iterator> equal_range(const K& k) const; ```
```c++ std::pair<iterator, iterator=""> equal_range(const key_type&amp; k); std::pair<const_iterator, const_iterator=""> equal_range(const key_type&amp; k) const; template<class k=""> std::pair<iterator, iterator=""> equal_range(const K&amp; k); template<class k=""> std::pair<const_iterator, const_iterator=""> equal_range(const K&amp; k) const; ```</const_iterator,></class></iterator,></class></const_iterator,></iterator,>
```c++ mapped_type& operator[](const key_type& k); mapped_type& operator[](key_type&& k); template<class K> mapped_type& operator[](K&& k); ```
```c++ mapped_type&amp; operator[](const key_type&amp; k); mapped_type&amp; operator[](key_type&amp;&amp; k); template<class k=""> mapped_type&amp; operator[](K&amp;&amp; k); ```</class>
Effects:;; If the container does not already contain an elements with a key equivalent to `k`, inserts the value `std::pair<key_type const, mapped_type>(k, mapped_type())`. Returns:;; A reference to `x.second` where `x` is the element already in the container, or the newly inserted element with a key equivalent to `k`. 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 factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. + + 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` 等价的元素，则插入值 `std::pair<key_type const,="" mapped_type="">(k, mapped_type())`。
返回：;; 指向 `x.second` 的引用，其中 `x` 是容器中已存在的元素，或者是键与 `k` 等价的新插入元素。
抛出：;; 如果除调用 `hasher` 之外的操作抛出异常，则该函数无效。
备注：;; 可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
此外，指向元素的指针和引用永远不会失效。
另外，仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时，`template<class k="">` 重载才会参与重载决议。库假定 `Hash` 可同时以 `K` 和 `Key` 类型调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型的开销。</class></key_type>
```c++ mapped_type& at(const key_type& k); const mapped_type& at(const key_type& k) const; template<class K> mapped_type& at(const K& k); template<class K> const mapped_type& at(const K& k) const; ```
```c++ mapped_type&amp; at(const key_type&amp; k); const mapped_type&amp; at(const key_type&amp; k) const; template<class k=""> mapped_type&amp; at(const K&amp; k); template<class k=""> const mapped_type&amp; at(const K&amp; k) const; ```</class></class>
Bucket Interface
桶接口
bucket_count
bucket_count
```c++ size_type bucket_count() const noexcept; ```
```c++ size_type bucket_count() const noexcept; ```
max_bucket_count
max_bucket_count
bucket_size
桶大小
```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>
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` 的桶中第一个元素的局部迭代器。
:1000
Pointers and references to elements are never invalidated.
指向元素的指针和引用永远不会失效。
:1002
The `template<class K, class\... Args>` 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. --
`template<class k,="" args="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1005
---
---
:1017
Inserts a new element into the container if there is no existing element with key `k` contained within it.
如果容器中不存在键为 `k` 的元素，则插入一个新元素。
:1019
If there is an existing element with key `k` this function does nothing.
如果已存在键为 `k` 的元素，则该函数不执行任何操作。
:1021
`hint` is a suggestion to where the element should be inserted.
`hint` 是关于元素插入位置的建议。
:1031
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...))
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<key>(k)), std::forward_as_tuple(std::forward<args>(args)...))</args></key>
:1036
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ```
value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
:1045
Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.
可能使迭代器失效，但仅当插入导致负载因子大于或等于最大负载因子时才会发生。
:1047
Pointers and references to elements are never invalidated.
指向元素的指针和引用永远不会失效。
:1049
The `template<class K, class\... Args>` 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. --
`template<class k,="" args="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef，且 `iterator` 和 `const_iterator` 都不能从 `K` 隐式转换时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
:1052
---
---
:1064
Inserts a new element into the container or updates an existing one by assigning to the contained value.
向容器中插入一个新元素，或通过赋值更新现有元素的值。

Loading…

User avatar admin

Translation uploaded
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.要求：;; `n` 应在 `[0, bucket_count())` 范围内。
返回：;; 指向索引为 `n` 的桶中“尾后”元素的常量局部迭代器。
06/05/2026
User avatar admin

String added in the repository
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`.
06/05/2026
Browse all string changes

Things to check

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
55799
Source string location
:1585
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 417