Zen

Translation

When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
51/770 · 77

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 table's maximum load factor.
返回值：;; 表的最大负载因子。
:1541
---
---
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` 保持兼容。
:1551
---
---
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 table can hold without rehashing, assuming that no further elements will be erased. Note:;; After construction, rehash or clearance, the table's maximum load is at least `max_load_factor() * bucket_count()`. This number may decrease on erasure under high-load conditions. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.
返回值：;; 表在不进行重哈希的情况下可容纳的最大元素数量（假定不会再删除任何元素）。
注意：;; 构造、重哈希或清空后，表的最大负载量至少为 `max_load_factor() * bucket_count()`。在高负载条件下执行删除操作时，该数值可能会降低。
注意：;; 若存在并发插入操作，返回值可能无法精确反映执行后表的真实状态。
:1568
---
---
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 table.
效果：;; 必要时调整桶数组大小，确保桶数量至少为 `n`，且负载因子小于等于最大负载因子。适用时，会增大或缩小表关联的桶数量 `bucket_count()`。
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
效果：;; 当 `size() == 0` 时，调用 `rehash(0)` 会释放底层桶数组的内存。
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the table's hash function or comparison function. Concurrency:;; Blocking on `*this`. ---
如有必要，将改变桶数组的大小，使其至少包含 `n` 个桶，并确保负载因子小于或等于最大负载因子。此操作将根据情况增加或减少容器的 `bucket++_++count()` 。
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 table.
效果：;; 与 `rehash` 功能类似，该函数可用于增大或缩小表中的桶数量。
Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the table's hash function or comparison function. Concurrency:;; Blocking on `*this`.
抛出异常：;; 若抛出异常，函数无任何效果（由表的哈希函数或比较函数抛出的异常除外）。
并发：;; 阻塞 `*this`。
:1597
---
---
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 table so far. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:concurrent_node_set_boost_unordered_enable_stats[enabled].
返回值：;; 截至目前，由该表执行的插入与查找操作的统计信息描述。
注意：;; 仅当**统计计算功能启用**时可用。
:1610
---
---
reset_stats
reset_stats
```c++ void reset_stats() noexcept; ```
```c++ void reset_stats() noexcept; ```
Effects:;; Sets to zero the internal statistics kept by the table. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:concurrent_node_set_boost_unordered_enable_stats[enabled].
效果：;; 将该哈希表所维护的内部统计数据清零。
注意：;; 仅当xref:reference/stats.adoc#stats[statistics calculation]（统计计算功能）被xref:concurrent_node_set_boost_unordered_enable_stats[enabled]（启用状态）激活时，本函数才可使用。
English Chinese (Simplified Han script) Actions
Iterator Range Constructor with Bucket Count and Hasher
带桶数和哈希函数的迭代器范围构造函数
Invokes `f` with references to each of the elements in the table, and erases those for which `f` returns `true`. Execution is parallelized according to the semantics of the execution policy specified.
以表中每个元素的引用调用 `f`，并删除所有 `f` 返回 `true` 的元素。执行过程将根据指定执行策略的语义进行并行化处理。
Throws:;; Nothing unless `key_equal` or `hasher` throw on swapping. Concurrency:;; Blocking on `*this` and `other`.
异常：;; 除非 `key_equal` 或 `hasher` 在交换时抛出异常，否则不抛出任何异常。
并发：;; 阻塞 `*this` 和 `other`。
```c++ template<class F> node_type extract_if(const key_type& k, F f); template<class K, class F> node_type extract_if(K&& k, F f); ```
```c++ template<class f=""> node_type extract_if(const key_type&amp; k, F f); template<class k,="" class="" f=""> node_type extract_if(K&amp;&amp; k, F f); ```</class></class>
Extracts the element `x` with key equivalent to `k`, if it exists and `f(x)` is `true`.
若键与 `k` 等价的元素 `x` 存在且 `f(x)` 为 `true`，则提取该元素。
```c++ template<class H2, class P2> size_type merge(concurrent_node_set<Key, H2, P2, Allocator>& source); template<class H2, class P2> size_type merge(concurrent_node_set<Key, H2, P2, Allocator>&& source); ```
```c++ template<class h2,="" class="" p2=""> size_type merge(concurrent_node_set<key, h2,="" p2,="" allocator="">&amp; source); template<class h2,="" class="" p2=""> size_type merge(concurrent_node_set<key, h2,="" p2,="" allocator="">&amp;&amp; source); ```</key,></class></key,></class>
Observers
观察器
get_allocator
get_allocator
Returns:;; The table's key equality predicate.
返回值：;; 表的键相等性断言。
Bucket Interface
桶接口
bucket_count
bucket_count
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>
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` 保持兼容。
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
效果：;; 当 `size() == 0` 时，调用 `rehash(0)` 会释放底层桶数组的内存。
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` 成员类型。其默认值与所选构造函数的默认值一致。
```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const concurrent_node_set<Key, Hash, Pred, Alloc>& x, const concurrent_node_set<Key, Hash, Pred, Alloc>& y); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator==(const concurrent_node_set<key, hash,="" pred,="" alloc="">&amp; x, const concurrent_node_set<key, hash,="" pred,="" alloc="">&amp; y); ```</key,></key,></class>
```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(concurrent_node_set<Key, Hash, Pred, Alloc>& x, concurrent_node_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> void swap(concurrent_node_set<key, hash,="" pred,="" alloc="">&amp; x, concurrent_node_set<key, hash,="" pred,="" alloc="">&amp; y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
```c++ template<class K, class H, class P, class A, class Predicate> typename concurrent_node_set<K, H, P, A>::size_type erase_if(concurrent_node_set<K, H, P, A>& c, Predicate pred); ```
```c++ template<class k,="" class="" h,="" p,="" a,="" predicate=""> typename concurrent_node_set<k, h,="" p,="" a="">::size_type erase_if(concurrent_node_set<k, h,="" p,="" a="">&amp; c, Predicate pred); ```</k,></k,></class>
When executed internally by a `boost::concurrent_node_set`, the following operations by a user-provided visitation function on the element passed do not introduce data races:
当由 `boost::concurrent++_++node++_++set` 内部执行时，用户提供的访问函数对传递的元素执行以下操作不会引入数据竞争：
Non-mutable modification of the element.
对元素的非可变修改。
Mutable modification of the element:
对元素的可变修改：
Constructors
构造函数
Even though it acts as a container, `boost::concurrent_node_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_node_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
尽管 `boost::concurrent++_++node++_++set` 的行为类似于容器，但它并不符合标准 C{plus}{plus} https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念。具体而言，它不提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素的访问通过用户提供的 _访问函数_ 实现，这些函数被传递至 `concurrent++_++node++_++set` 的内部操作，并以受控方式执行。这种基于访问的 API 设计支持低竞争度的并发使用场景。
The internal data structure of `boost::concurrent_node_set` is similar to that of `boost::unordered_node_set`. Unlike `boost::concurrent_flat_set`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.
`boost::concurrent++_++node++_++set` 的内部数据结构与 `boost::unordered++_++node++_++set` 类似。与 `boost::concurrent++_++flat++_++set` 不同，它提供了指针稳定性和节点处理功能，但可能以性能降低为代价。
Description
描述
*Template Parameters*
*模板参数*
_Key_
_键_

Loading…

User avatar admin

Translation uploaded
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
When效果：;; 当 `size() == 0`, 时，调用 `rehash(0)` will deallocate the underlying buckets array.会释放底层桶数组的内存。
06/05/2026
User avatar admin

String added in the repository
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
When `size() == 0`, `rehash(0)` will deallocate the underlying buckets array.
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
53626
Source string location
:1577
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/concurrent_node_set_zh_Hans.adoc, string 423