Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Node Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Throws:;; The function has no effect if an exception is …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```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]（启用状态）激活时，本函数才可使用。
:1621	---	---

	English	Chinese (Simplified Han script)	Actions
	:idprefix: concurrent_node_set_	:idprefix: concurrent_node_set_
	key_eq	key_eq
	``` key_equal key_eq() const; ```	``` key_equal key_eq() const; ```
	Returns:;; The number of elements with key equivalent to `k` (0 or 1). 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. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.	返回值：;; 键与 `k` 等价的元素数量（0 或 1）。注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员类型别名时，`template<class k="">` 重载才参与重载决议。标准库假定 `Hash` 可同时接收 `K` 与 `Key` 类型参数调用，且 `Pred` 是透明的。该机制支持异构查找，避免了实例化 `Key` 类型对象的开销。注意：;; 若存在并发插入操作，返回值可能无法精确反映执行后表的真实状态。</class>
	Returns:;; A boolean indicating whether or not there is an element with key equal to `k` in the table. 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. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.	返回值：;; 布尔值，表示表中是否存在键等于 `k` 的元素。注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 为合法成员类型别名时，`template<class k="">` 重载才参与重载决议。标准库假定 `Hash` 可同时接收 `K` 与 `Key` 类型参数调用，且 `Pred` 是透明的。该机制支持异构查找，避免了实例化 `Key` 类型对象的开销。注意：;; 若存在并发插入操作，返回值可能无法精确反映执行后表的真实状态。</class>
	Returns:;; The size of the bucket array.	返回值：;; 桶数组的大小。
	Hash Policy	哈希策略
	load_factor	负载因子
	```c++ float load_factor() const noexcept; ```	```c++ float load_factor() const noexcept; ```
	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.	返回值：;; 表的最大负载因子。
	max_load	max++_++load（最大负载）
	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()`。在高负载条件下执行删除操作时，该数值可能会降低。注意：;; 若存在并发插入操作，返回值可能无法精确反映执行后表的真实状态。
	```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()`。
	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); ```
	```c++ concurrent_node_set(concurrent_node_set&& other, Allocator const& a); ```	```c++ concurrent_node_set(concurrent_node_set&& other, Allocator const& a); ```
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, `a` as the allocator, with the default key equality predicate, and inserts the elements from `[f, l)` into it.	构造一个至少包含 `n` 个桶的空容器，使用 `hf` 作为哈希函数、 `a` 作为分配器以及默认的键相等性谓词，并将 `++[++f, l)` 范围内的元素插入其中。
	Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`.	效果：;; 等价于 `a.rehash(ceil(n / a.max_load_factor()))`。
	erase_if by Key	通过键进行条件擦除
	contains	包含
	```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ```	```c++ bool contains(const key_type& k) const; template<class k=""> bool contains(const K& k) const; ```</class>
	initializer_list Constructor with Allocator	带分配器的初始化列表构造函数
	```c++ concurrent_node_set(std::initializer_list<value_type> il, const allocator_type& a); ```	```c++ concurrent_node_set(std::initializer_list<value_type> il, const allocator_type& a); ```</value_type>
	Constructs an empty table using `a` and default hash function and key equality predicate, and inserts the elements from `il` into it.	构造一个使用分配器`a`、默认哈希函数和键相等性谓词的空容器，并将`il`中的元素插入其中。
	rehash	重哈希
	Statistics	统计信息

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 162 characters editedCurrent translationState: Translated

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 176 characters editedPrevious translationState: Needs editing (Needs rewriting)

06/05/2026

Browse all string changes

Things to check

Mismatched full stop

Source and translation do not both end with a full stop.

Reset

Glossary

English	Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Flags

safe-html, strict-same

Unit identifier

53627

Source string location

:1580

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 424

Shortcut	Action
`?`	Open available keyboard shortcuts.
`Alt` + `Home`	Navigate to the first translation in the current search.
`Alt` + `End`	Navigate to the last translation in the current search.
`Alt` + `PageUp` or `Ctrl` + `↑` or `Alt` + `↑` or `Cmd` + `↑` or	Navigate to the previous translation in the current search.
`Alt` + `PageDown` or `Ctrl` + `↓` or `Alt` + `↓` or `Cmd` + `↓` or	Navigate to the next translation in the current search.
`Ctrl` + `Enter` or `Cmd` + `Enter`	Submit current form; this works the same as pressing Save and continue while editing translation.
`Ctrl` + `Shift` + `Enter` or `Cmd` + `Shift` +`Enter`	Unmark translation as Needing edit and submit it.
`Alt` + `Enter` or `Option` + `Enter`	Submit the string as a suggestion; this works the same as pressing Suggest while editing translation.
`Ctrl` + `E` or `Cmd` + `E`	Focus on translation editor.
`Ctrl` + `U` or `Cmd` + `U`	Focus on comment editor.
`Ctrl` + `M` or `Cmd` + `M`	Shows Automatic suggestions tab.
`Ctrl` + `1` to `Ctrl` + `9` or `Cmd` + `1` to `Cmd` + `9`	Copies placeable of a given number from source string.
`Ctrl` + `M` followed by `1` to `9` or `Cmd` + `M` followed by `1` to `9`	Copy the machine translation of a given number to current translation.
`Ctrl` + `I` followed by `1` to `9` or `Cmd` + `I` followed by `1` to `9`	Ignore one item in the list of failing checks.
`Ctrl` + `J` or `Cmd` + `J`	Shows the Nearby strings tab.
`Ctrl` + `S` or `Cmd` + `S`	Focus on search field.
`Ctrl` + `O` or `Cmd` + `O`	Copy the source string.
`Ctrl` + `Y` or `Cmd` + `Y`	Toggle the Needs editing checkbox.
`→`	Browse the next translation string.
`←`	Browse the previous translation string.

Translation

Things to check

Mismatched full stop

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file