Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: Requires:;; `value_type` is serializable (XML serializable), and it supports Boost.Serialization …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator!=(const concurrent_flat_set<Key, Hash, Pred, Alloc>& x, const concurrent_flat_set<Key, Hash, Pred, Alloc>& y); ```	```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator!=(const concurrent_flat_set<key, hash,="" pred,="" alloc="">& x, const concurrent_flat_set<key, 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。
:1547	Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if the two tables don't have equivalent equality predicates.	并发：;; 阻塞`x`与`y`。备注：;; 若两个哈希表的相等谓词不兼容，行为未定义。
:1550	---	---
	Swap	交换
	```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(concurrent_flat_set<Key, Hash, Pred, Alloc>& x, concurrent_flat_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```	```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> void swap(concurrent_flat_set<key, hash,="" pred,="" alloc="">& x, concurrent_flat_set<key, hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class>
:1560	Equivalent to [listing,subs="+macros,+quotes"]	等价于 [listing,subs="+macros,+quotes"]
:1566	---	---
:1568	erase_if	erase_if
	```c++ template<class K, class H, class P, class A, class Predicate> typename concurrent_flat_set<K, H, P, A>::size_type erase_if(concurrent_flat_set<K, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" h,="" p,="" a,="" predicate=""> typename concurrent_flat_set<k, h,="" p,="" a="">::size_type erase_if(concurrent_flat_set<k, h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
:1575	Equivalent to [listing,subs="+macros,+quotes"]	等价于 [listing,subs="+macros,+quotes"]
	Serialization	序列化
	``concurrent_flat_set``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.	可通过本库提供的 API ，借助 link:../../../../../serialization/index.html[Boost.Serialization] 实现档归档/检索 `concurrent++_++flat++_++set` 。同时支持常规格式与 XML 格式的归档文件。
	Saving an concurrent_flat_set to an archive	将 concurrent++_++flat++_++set 保存到归档
	Saves all the elements of a `concurrent_flat_set` `x` to an archive (XML archive) `ar`.	将 `concurrent++_++flat++_++set` 容器 `x` 的所有元素保存到归档（XML 归档） `ar` 中。
	Requires:;; `value_type` is serializable (XML serializable), and it supports Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types). Concurrency:;; Blocking on `x`.	要求;; `value++_++type` 必须可序列化（支持 XML 序列化），且需要支持 Boost.Serialization 的 `save++_++construct++_++data` / `load++_++construct++_++data` 协议（该协议自动支持满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求的类型）。并发性;; 阻塞于 `x` 。
:1598	---	---
	Loading an concurrent_flat_set from an archive	从归档加载 concurrent++_++flat++_++set
	Deletes all preexisting elements of a `concurrent_flat_set` `x` and inserts from an archive (XML archive) `ar` restored copies of the elements of the original `concurrent_flat_set` `other` saved to the storage read by `ar`.	删除 `concurrent++_++flat++_++set` 容器 `x` 中的所有现有元素，并从归档 `ar` （XML格式归档）中读取原始 `concurrent++_++flat++_++set` 容器 `other` 保存的元素副本并插入到 `x` 。
	Requires:;; `x.key_equal()` is functionally equivalent to `other.key_equal()`. Concurrency:;; Blocking on `x`.	要求;; `x.key++_++equal()` 需要在功能上等价于 `other.key++_++equal()` 。并发性;; 阻塞于 `x` 。

	English	Chinese (Simplified Han script)	Actions
	```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` 保持兼容。
	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()`。在高负载条件下执行删除操作后，该数值可能会降低。在存在并发插入操作时，返回的值可能无法准确反映执行后哈希表的真实状态。
	rehash	重哈希
	```c++ void rehash(size_type n); ```	```c++ void rehash(size_type n); ```
	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()))`。
	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_set_boost_unordered_enable_stats[enabled].	返回值：;; 该哈希表迄今为止执行的插入与查找操作的统计信息。备注：;; 仅当 xref:reference/stats.adoc#stats[统计计算] 被 xref:concurrent_flat_set_boost_unordered_enable_stats[启用] 时，本接口方可使用。
	```c++ template<class K, class H, class P, class A, class Predicate> typename concurrent_flat_set<K, H, P, A>::size_type erase_if(concurrent_flat_set<K, H, P, A>& c, Predicate pred); ```	```c++ template<class k,="" class="" h,="" p,="" a,="" predicate=""> typename concurrent_flat_set<k, h,="" p,="" a="">::size_type erase_if(concurrent_flat_set<k, h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class>
	Serialization	序列化
	Saving an concurrent_flat_set to an archive	将 concurrent++_++flat++_++set 保存到归档
	Requires:;; `value_type` is serializable (XML serializable), and it supports Boost.Serialization `save_construct_data`/`load_construct_data` protocol (automatically suported by https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[DefaultConstructible^] types). Concurrency:;; Blocking on `x`.	要求;; `value++_++type` 必须可序列化（支持 XML 序列化），且需要支持 Boost.Serialization 的 `save++_++construct++_++data` / `load++_++construct++_++data` 协议（该协议自动支持满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[可默认构造] 要求的类型）。并发性;; 阻塞于 `x` 。
	`std::allocator_traits<Alloc>::deallocate`	`std::allocator_traits<alloc>::deallocate`</alloc>
	Returns:;; The number of elements in the table.	返回值：;; 哈希表中的元素总数。
	Notes:;; In the presence of concurrent insertion operations, the value returned may not accurately reflect the true size of the table right after execution.	注意：;; 在存在并发插入操作时，返回的值可能无法准确反映函数执行后哈希表的真实大小。
	max_size	max_size
	```c++ concurrent_flat_set(std::initializer_list<value_type> il, const allocator_type& a); ```	```c++ concurrent_flat_set(std::initializer_list<value_type> il, const allocator_type& a); ```</value_type>
	The internal data structure of `boost::concurrent_flat_set` is similar to that of `boost::unordered_flat_set`. As a result of its using open-addressing techniques, `value_type` must be move-constructible and pointer stability is not kept under rehashing.	`boost::concurrent++_++flat++_++set` 的内部数据结构类似于 `boost::unordered++_++flat++_++set` 。由于其采用开放寻址技术， `value++_++type` 必须满足可移动构造要求，且在重哈希过程中无法保持指针稳定性。
	Template Parameters	模板参数
	and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.	https://en.cppreference.com/w/cpp/named_req/MoveInsertable[可移动插入] 到容器中的要求，且需满足从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[可擦除] 的要求。
	A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`.	一种为`Key`提供哈希功能的一元函数对象类型。它接受单个`Key`类型参数，并返回`std::size_t`类型的值。
	A binary function object that induces an equivalence relation on values of type `Key`. It takes two arguments of type `Key` and returns a value of type `bool`.	一种二元函数对象，用于在Key类型的值上构建等价关系。它接受两个Key类型的参数，并返回一个bool类型的值。
	An allocator whose value type is the same as the table's value type.	值类型与该表的值类型相同的分配器。
	The size of the bucket array can be automatically increased by a call to `insert`/`emplace`, or as a result of calling `rehash`/`reserve`. The _load factor_ of the table (number of elements divided by number of buckets) is never greater than `max_load_factor()`, except possibly for small sizes where the implementation may decide to allow for higher loads.	调用 `insert`/`emplace` 或执行 `rehash`/`reserve` 操作时，桶数组的大小会自动扩容。容器的负载因子（元素数量除以桶数量）永远不会超过 `max_load_factor()`，仅在尺寸较小时，实现可能允许更高的负载因子。
	If `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<Hash>::value` is `true`, the hash function is used as-is; otherwise, a bit-mixing post-processing stage is added to increase the quality of hashing at the expense of extra computational cost.	若 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<hash>::value` 为 `true`，则哈希函数直接使用；否则会添加一个位混合后处理阶段，以额外的计算开销为代价提升哈希质量。</hash>
	Concurrency Requirements and Guarantees	并发要求与保证

Loading…

admin

Translation uploaded

English

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

~~Requires:~~要求;; `value_++_++type` ~~is serializable (XML serializable), and it supports~~必须可序列化（支持 XML 序列化），且需要支持 Boost.Serialization 的 `save_++_++construct_++_++data`/ / `load_++_++construct_++_++data` ~~protocol (automatically suported by~~协议（该协议自动支持满足 https://en.cppreference.com/w/cpp/named_req/DefaultConstructible[~~DefaultConstructible^] types). Concurrency:;; Blocking on~~可默认构造] 要求的类型）。并发性;; 阻塞于 `x`. 。

06/05/2026

admin

String added in the repository

English

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

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

50569

Source string location

:1592

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_set_zh_Hans.adoc, string 426

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

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file