Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Changes if necessary the size of the bucket array so …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
:1604	---	---
	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.	返回值：容器的最大负载因子。
:1615	---	---
	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_map`.	效果：无任何操作，用户不允许修改此参数。保留该函数是为了与 `boost::unordered_map` 保持兼容。
:1625	---	---
	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()`。在高负载条件下执行擦除操作时，该数值可能会降低。若存在并发插入操作，返回值可能无法精确反映容器执行后的真实状态。
:1642	---	---
	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)` 会释放底层的桶数组内存。
:1653	Invalidates pointers and references to elements, and changes the order of elements.	会使指向元素的指针和引用失效，并改变元素的存储顺序。
	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`。
	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` 功能类似，该函数可用于增大或缩小容器的桶数量。
:1669	Invalidates pointers and references to elements, and changes the order of elements.	会使指向元素的指针和引用失效，并改变元素的存储顺序。
	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`。
:1675	---	---
	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_flat_map_boost_unordered_enable_stats[enabled].	返回值：容器截至目前执行的插入与查找操作的统计描述信息。说明：仅当启用统计计算时，该函数才可用。
:1688	---	---

	English	Chinese (Simplified Han script)	Actions
	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="">` 重载版本才参与重载决议。库假定哈希函数可同时作用于 `K` 类型与键类型，且相等谓词是透明的，从而支持异构查找，避免实例化键类型带来的开销。若存在并发插入操作，返回值可能无法精确反映容器执行后的真实状态。</class>
	Bucket Interface	桶接口
	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	哈希策略
	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>
	Returns:;; Returns the table's maximum load factor.	返回值：容器的最大负载因子。
	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_map`.	效果：无任何操作，用户不允许修改此参数。保留该函数是为了与 `boost::unordered_map` 保持兼容。
	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()`。在高负载条件下执行擦除操作时，该数值可能会降低。若存在并发插入操作，返回值可能无法精确反映容器执行后的真实状态。
	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`. ---	异常：若抛出异常，函数无任何效果（由容器的哈希函数或比较函数抛出的异常除外）。并发：阻塞当前对象 `*this`。
	```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()))`。
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator==(const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator==(const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	Returns `true` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).	若 `x.size() == y.size()`，且对于 `x` 中的每个元素，`y` 中均存在拥有相同键、值相等（使用 `operator==` 比较值类型）的元素，则返回 `true`。
	operator!	operator!
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class>
	Returns `false` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types).	若`x.size() == y.size()`，且`x`中每个元素在`y`中都存在键相同、值相等（使用`operator==`比较值类型）的元素，则返回`false`。
	Swap	交换
	```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```	```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> void swap(concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
	```c++ template<class K, class T, class H, class P, class A, class Predicate> typename concurrent_flat_map<K, T, H, P, A>::size_type erase_if(concurrent_flat_map<K, T, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" t,="" h,="" p,="" a,="" predicate=""> typename concurrent_flat_map<k, t,="" h,="" p,="" a="">::size_type erase_if(concurrent_flat_map<k, t,="" h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
	Serialization	序列化
	``concurrent_flat_map``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported.	`concurrent++_++flat++_++map` 可通过本组件库提供的 API，借助 link:../../../../../serialization/index.html[Boost.Serialization] 进行归档/检索。支持常规归档与 XML 归档两种格式。

Loading…

admin

Translation uploaded

English

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

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()`。

06/05/2026

admin

String added in the repository

English

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

06/05/2026

Browse all string changes

Things to check

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

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

String information

Flags

safe-html, strict-same

Unit identifier

54103

Source string location

:1649

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_flat_map_zh_Hans.adoc, string 406

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

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file