Zen

Translation

When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
68/1720 · 172

Sign in to save translations.

Key English Chinese (Simplified Han script) Actions
max_load_factor
max_load_factor
```c++ float max_load_factor() const noexcept; ```
```c++ float max_load_factor() const noexcept; ```
Returns:;; Returns the container's maximum load factor.
返回：容器的最大负载因子。
:1202
---
---
Set max_load_factor
设置最大负载因子
```c++ void max_load_factor(float z); ```
```c++ void max_load_factor(float z); ```
Effects:;; Does nothing, as the user is not allowed to change this parameter. Kept for compatibility with `boost::unordered_set`.
效果：不执行任何操作，因为用户不允许更改此参数。保留此函数是为了与 `boost::unordered_set` 保持兼容。
:1212
---
---
max_load
max_load
```c++ size_type max_load() const noexcept; ```
```c++ size_type max_load() const noexcept; ```
Returns:;; The maximum number of elements the container can hold without rehashing, assuming that no further elements will be erased. Note:;; After construction, rehash or clearance, the container's maximum load is at least `max_load_factor() * bucket_count()`. This number may decrease on erasure under high-load conditions.
返回：容器在不触发重哈希的情况下能够容纳的最大元素数量（假设不再有元素被擦除）。
注意：在构造、重哈希或清空操作之后，容器的最大负载至少为 `max_load_factor() * bucket_count()`。在高负载条件下，该数值可能会因元素擦除而减小。
:1226
---
---
rehash
重哈希
```c++ void rehash(size_type n); ```
```c++ void rehash(size_type n); ```
Changes if necessary the size of the bucket array so that there are at least `n` buckets, and so that the load factor is less than or equal to the maximum load factor. When applicable, this will either grow or shrink the `bucket_count()` associated with the container.
必要时更改桶数组的大小，使其至少包含 `n` 个桶，并且使得负载因子小于或等于最大负载因子。在适用的情况下，这将增大或缩小与容器关联的 `bucket_count()`。
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
当 `size() == 0` 时，`rehash(0)` 将释放底层的桶数组。如果提供的分配器使用异形指针，则会随后执行一次默认分配。
:1237
Invalidates iterators and changes the order of elements.
使迭代器失效并改变元素的顺序。
:1240
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.
抛出：如果抛出异常（除非是由容器的哈希函数或比较函数抛出的），则该函数无效果。
:1242
---
---
reserve
保留
```c++ void reserve(size_type n); ```
```c++ void reserve(size_type n); ```
Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`.
等价于 `a.rehash(ceil(n / a.max_load_factor()))`。
Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the container.
与 `rehash` 类似，此函数可用于增大或缩小容器中的桶数量。
:1253
Invalidates iterators and changes the order of elements.
使迭代器失效并改变元素的顺序。
:1256
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.
抛出：如果抛出异常（除非是由容器的哈希函数或比较函数抛出的），则该函数无效果。
:1258
---
---
Statistics
统计信息
get_stats
get_stats
```c++ stats get_stats() const; ```
```c++ stats get_stats() const; ```
Returns:;; A statistical description of the insertion and lookup operations performed by the container so far. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:unordered_node_set_boost_unordered_enable_stats[enabled].
返回：容器迄今为止所执行插入和查找操作的统计描述。
注意：仅在 xref:reference/stats.adoc#stats[统计计算] 通过 xref:unordered_node_set_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`] 启用时才可用。
:1271
---
---
English Chinese (Simplified Han script) Actions
get_allocator
get_allocator
``` allocator_type get_allocator() const noexcept; ```
``` allocator_type get_allocator() const noexcept; ```
hash_function
哈希函数
key_eq
key_eq
``` key_equal key_eq() const; ```
``` key_equal key_eq() const; ```
Returns:;; The container's key equality predicate
返回：容器的键相等谓词。
Lookup
查找
Returns:;; An iterator pointing to an element with key equivalent to `k`, or `end()` if no such element exists. 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.
返回：指向键与 `k` 等价的元素的迭代器；如果不存在这样的元素，则返回 `end()`。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
Effects:;; Sets to zero the internal statistics kept by the container. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:unordered_node_set_boost_unordered_enable_stats[enabled].
效果：将容器内部维护的统计信息归零。
注意：仅在 xref:reference/stats.adoc#stats[统计计算] 通过 xref:unordered_node_set_boost_unordered_enable_stats[`BOOST_UNORDERED_ENABLE_STATS`] 启用时才可用。
Returns:;; The number of elements with key equivalent to `k`. 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` 等价的元素数量。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `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>
bucket_count
bucket_count
```c++ size_type bucket_count() const noexcept; ```
```c++ size_type bucket_count() const noexcept; ```
Returns:;; The size of the bucket array.
返回：桶数组的大小。
Hash Policy
哈希策略
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
当 `size() == 0` 时，`rehash(0)` 将释放底层的桶数组。如果提供的分配器使用异形指针，则会随后执行一次默认分配。
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` 的元素。
注意：`template<class k="">` 重载仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员 typedef 时参与重载决议。库假定 `Hash` 可同时使用 `K` 和 `Key` 调用，且 `Pred` 是透明的。这支持了异构查找，从而避免了实例化 `Key` 类型对象的开销。</class>
equal_range
equal_range
```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,>
load_factor
负载因子
```c++ float load_factor() const noexcept; ```
```c++ float load_factor() const noexcept; ```
Returns:;; `static_cast<float>(size())/static_cast<float>(bucket_count())`, or `0` if `bucket_count() == 0`.
返回：`static_cast<float>(size())/static_cast<float>(bucket_count())`，如果 `bucket_count() == 0` 则返回 `0`。</float></float>
max_load_factor
max_load_factor
```c++ float max_load_factor() const noexcept; ```
```c++ float max_load_factor() const noexcept; ```
Returns:;; Returns the container's maximum load factor.
返回：容器的最大负载因子。
```c++ void max_load_factor(float z); ```
```c++ void max_load_factor(float z); ```
Effects:;; Does nothing, as the user is not allowed to change this parameter. Kept for compatibility with `boost::unordered_set`.
效果：不执行任何操作，因为用户不允许更改此参数。保留此函数是为了与 `boost::unordered_set` 保持兼容。
max_load
max_load
```c++ size_type max_load() const noexcept; ```
```c++ size_type max_load() const noexcept; ```
`boost::unordered_node_set` — A node-based, open-addressing unordered associative container that stores unique values.
`boost::unordered_node_set` — 一种基于节点的开放寻址无序关联容器，用于存储唯一值。

Loading…

User avatar admin

Translation uploaded
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
When当 `size() == 0`, 时，`rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.将释放底层的桶数组。如果提供的分配器使用异形指针，则会随后执行一次默认分配。
06/05/2026
User avatar admin

String added in the repository
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array. If the provided Allocator uses fancy pointers, a default allocation is subsequently performed.
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
52686
Source string location
:1235
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_set_zh_Hans.adoc, string 342