User avatar admin

Translation uploaded
Returns:;; The table's hash function.
Returns:;; The table's hash function.返回值：;; 表的哈希函数。
06/05/2026
User avatar admin

Translation uploaded
``` hasher hash_function() const; ```
``` hasher hash_function() const; ```
06/05/2026
User avatar admin

Translation uploaded
hash_function
hash_function哈希函数
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The table's allocator.
Returns:;; The table's allocator.返回值：;; 表的分配器。
06/05/2026
User avatar admin

Translation uploaded
``` allocator_type get_allocator() const noexcept; ```
``` allocator_type get_allocator() const noexcept; ```
06/05/2026
User avatar admin

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

Translation uploaded
Observers
Observers观察器
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; The number of elements inserted. Concurrency:;; Blocking on `*this` and `source`.
Returns:;; The number of elements inserted. Concurrency:;; Blocking on返回值：;; 插入的元素数量。
并发：;; 阻塞 `*this` and和 `source`.。
06/05/2026
User avatar admin

Translation uploaded
Move-inserts all the elements from `source` whose key is not already present in `*this`, and erases them from `source`.
Move-inserts all the elements from `source` whose key is not already present in `*this`, and erases them from `source`.将 `source` 中所有键尚未存在于 `*this` 内的元素移动插入，并从 `source` 中删除这些元素。
06/05/2026
User avatar admin

Translation uploaded
```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 Hh2,="" class P2="" p2=""> size_type merge(concurrent_node_set<Kkey, H2, P2, Allocator>&h2,="" p2,="" allocator="">&amp; source); template<class Hh2,="" class P2="" p2=""> size_type merge(concurrent_node_set<Kkey, H2, P2, Allocator>&& source); ```h2,="" p2,="" allocator="">&amp;&amp; source); ```</key,></class></key,></class>
06/05/2026
User avatar admin

Translation uploaded
merge
merge合并
06/05/2026
User avatar admin

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

Translation uploaded
Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()` Concurrency:;; Blocking on `*this`.
Postconditions:后置条件：;; `size() == 0`, ，`max_load() >&gt;= max_load_factor() * bucket_count()` Concurrency:;; Blocking on
并发：;; 阻塞 `*this`.。
06/05/2026
User avatar admin

Translation uploaded
Erases all elements in the table.
Erases all elements in the table.删除表中的所有元素。
06/05/2026
User avatar admin

Translation uploaded
```c++ void clear() noexcept; ```
```c++ void clear() noexcept; ```
06/05/2026
User avatar admin

Translation uploaded
clear
clear清空
06/05/2026
User avatar admin

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

Translation uploaded
Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal` or `f`. 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 `node_type` object holding the extracted element, or empty if no element was extracted. Throws:;; Only throws an exception if it is thrown by返回值：;; 存储被提取元素的 `node_type` 对象，若未提取任何元素则为空。
异常：;; 仅当 `hasher` or 、`key_equal` or或 `f`. 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为合法成员类型别名时，`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

Search