User avatar admin

Translation uploaded
Requires:;; `n < bucket_count()` Returns:;; The number of elements in bucket `n`.
Requires:;; `n <要求：`n &lt; bucket_count()` Returns:;; The number of elements in bucket `n`.
返回：桶 `n` 中的元素数量。
06/05/2026
User avatar admin

Translation uploaded
```c++ size_type bucket_size(size_type n) const; ```
```c++ size_type bucket_size(size_type n) const; ```
06/05/2026
User avatar admin

Translation uploaded
bucket_size
bucket_size桶大小
06/05/2026
User avatar admin

Translation uploaded
---
---
:1232
06/05/2026
User avatar admin

Translation uploaded
Returns:;; An upper bound on the number of buckets.
Returns:;; An upper bound on the number of buckets.返回：桶数量的上界。
06/05/2026
User avatar admin

Translation uploaded
```c++ size_type max_bucket_count() const noexcept; ```
```c++ size_type max_bucket_count() const noexcept; ```
06/05/2026
User avatar admin

Translation uploaded
max_bucket_count
max_bucket_count
06/05/2026
User avatar admin

Translation uploaded
---
---
:1222
06/05/2026
User avatar admin

Translation uploaded
Returns:;; The number of buckets.
Returns:;; The number of buckets.返回：桶的数量。
06/05/2026
User avatar admin

Translation uploaded
```c++ size_type bucket_count() const noexcept; ```
```c++ size_type bucket_count() const noexcept; ```
06/05/2026
User avatar admin

Translation uploaded
bucket_count
bucket_count
06/05/2026
User avatar admin

Translation uploaded
Bucket Interface
Bucket Interface桶接口
06/05/2026
User avatar admin

Translation uploaded
---
---
:1210
06/05/2026
User avatar admin

Translation uploaded
Returns:;; A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns `std::make_pair(b.end(), b.end())`. Notes:;; 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.
Returns:;; A range containing all elements with key equivalent to `k`. If the container doesn't contain any such elements, returns返回：包含所有键与 `k` 等价的元素的范围。如果容器不包含任何此类元素，则返回 `std::make_pair(b.end(), b.end())`. Notes:;; The 。
注意：`template<class K>` overloads only participate in overload resolution ifk="">` 重载仅在 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both是有效的成员 typedef 时参与重载决议。库假定 `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

Translation uploaded
```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 Kk=""> std::pair<iterator, iterator=""> equal_range(const K&amp; k); template<class Kk=""> std::pair<const_iterator, const_iterator=""> equal_range(const K&amp; k) const; ```</const_iterator,></class></iterator,></class></const_iterator,></iterator,>
06/05/2026
User avatar admin

Translation uploaded
equal_range
equal_range
06/05/2026
User avatar admin

Translation uploaded
---
---
:1194
06/05/2026
User avatar admin

Translation uploaded
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.
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返回：一个布尔值，指示容器中是否存在键等于 `key` 的元素。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` and和 `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both是有效的成员 typedef 时参与重载决议。库假定 `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

Translation uploaded
```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 Kk=""> bool contains(const K&amp; k) const; ```</class>
06/05/2026
User avatar admin

Translation uploaded
contains
contains包含
06/05/2026

Search