Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Flat Set (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: The elements of the table are held into an internal …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	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` 必须满足可移动构造要求，且在重哈希过程中无法保持指针稳定性。
	Synopsis	概要
:279	---	---
	Description	描述
	Template Parameters	模板参数
	_Key_	_键_
	`Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container	Key 必须满足
	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[可擦除] 的要求。
	_Hash_	_Hash_
	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`类型的值。
	_Pred_	_Pred_
	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类型的值。
	_Allocator_	_Allocator_
	An allocator whose value type is the same as the table's value type.	值类型与该表的值类型相同的分配器。
	`std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type` and `const value_type`, respectively.	`std::allocator_traits<allocator>::pointer` 与 `std::allocator_traits<allocator>::const_pointer` 必须分别可与 `value_type` 和 `const value_type` 相互转换。</allocator></allocator>
	The elements of the table are held into an internal _bucket array_. An element is inserted into a bucket determined by its hash code, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.	容器的元素存储在内部的桶数组中。元素根据其哈希值被插入到对应的桶中，若该桶已被占用（即发生哈希冲突），则使用原位置附近的可用桶。
	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>
:318	---	---
	Concurrency Requirements and Guarantees	并发要求与保证
	Concurrent invocations of `operator()` on the same const instance of `Hash` or `Pred` are required to not introduce data races. For `Alloc` being either `Allocator` or any allocator type rebound from `Allocator`, concurrent invocations of the following operations on the same instance `al` of `Alloc` are required to not introduce data races:	要求对同一 `Hash` 或 `Pred` 常量实例并发调用 `operator()` 时不得引入数据竞争。对于 `Alloc` （即 `Allocator` 或其重绑定后的任意分配器类型），在同一实例 `al` 上并发调用以下操作时不得引入数据竞争：
	Copy construction from `al` of an allocator rebound from `Alloc`	通过从`Alloc`重新绑定的分配器以`al`进行拷贝构造
	`std::allocator_traits<Alloc>::allocate`	`std::allocator_traits<alloc>::allocate`</alloc>
	`std::allocator_traits<Alloc>::deallocate`	`std::allocator_traits<alloc>::deallocate`</alloc>
	`std::allocator_traits<Alloc>::construct`	`std::allocator_traits<alloc>::construct`</alloc>
	`std::allocator_traits<Alloc>::destroy`	`std::allocator_traits<alloc>::destroy`</alloc>
	In general, these requirements on `Hash`, `Pred` and `Allocator` are met if these types are not stateful or if the operations only involve constant access to internal data members.	通常而言，若 `Hash` 、 `Pred` 和 `Allocator` 这些类型不包含状态，或其操作仅涉及对内部数据成员的常量访问，即可满足上述要求。
	With the exception of destruction, concurrent invocations of any operation on the same instance of a `concurrent_flat_set` do not introduce data races — that is, they are thread-safe.	除析构操作外，对同一个 `concurrent++_++flat++_++set` 实例并发调用任何操作都不会引发数据竞争——即这些操作是线程安全的。
	If an operation op is explicitly designated as _blocking on_ `x`, where `x` is an instance of a `boost::concurrent_flat_set`, prior blocking operations on `x` synchronize with op. So, blocking operations on the same `concurrent_flat_set` execute sequentially in a multithreaded scenario.	若操作 op 显式指定为__阻塞于__ 容器 `x` （其中 `x` 是 `boost::concurrent++_++flat++_++set` 的实例），则先前对 `x` 的阻塞操作将与 op 同步。因此，在多线程场景下，对同一 `concurrent++_++flat++_++set` 的阻塞操作将按顺序执行。
	An operation is said to be _blocking on rehashing of_ ``__x__`` if it blocks on `x` only when an internal rehashing is issued.	若某个操作仅在触发内部重哈希时才会阻塞于 _`x`_，则称该操作__阻塞于 _`x`_ 的重哈希过程__。
	When executed internally by a `boost::concurrent_flat_set`, the following operations by a user-provided visitation function on the element passed do not introduce data races:	当由 `boost::concurrent++_++flat++_++set` 内部执行时，用户提供的访问函数对传入元素的以下操作不会引发数据竞争：

	English	Chinese (Simplified Han script)	Actions
	Size and Capacity	大小与容量
	```c++ [[nodiscard]] bool empty() const noexcept; ```	```c++ [[nodiscard]] bool empty() const noexcept; ```
	Returns:;; `size() == 0`	返回值：;; `size() == 0`
	size	大小
	emplace	原地构造
	Insert Iterator Range	迭代器范围插入
	```c++ template<class InputIterator> size_type insert(InputIterator first, InputIterator last); ```	```c++ template<class inputiterator=""> size_type insert(InputIterator first, InputIterator last); ```</class>
	```c++ template<class ExecutionPolicy, class F> void erase_if(ExecutionPolicy&& policy, F f); ```	```c++ template<class executionpolicy,="" class="" f=""> void erase_if(ExecutionPolicy&& policy, F f); ```</class>
	_Key_	_键_
	`Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container	Key 必须满足
	```c++ size_type size() const noexcept; ```	```c++ size_type size() const noexcept; ```
	`boost::concurrent_flat_set` — A hash table that stores unique values and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.	`boost::concurrent++_++flat++_++set` —— 一种存储唯一值的哈希表，它支持并发的元素插入、删除、查找及访问操作，且无需外部同步机制。
	Synopsis	概要
	Description	描述
	`std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type` and `const value_type`, respectively.	`std::allocator_traits<allocator>::pointer` 与 `std::allocator_traits<allocator>::const_pointer` 必须分别可与 `value_type` 和 `const value_type` 相互转换。</allocator></allocator>
	The elements of the table are held into an internal _bucket array_. An element is inserted into a bucket determined by its hash code, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.	容器的元素存储在内部的桶数组中。元素根据其哈希值被插入到对应的桶中，若该桶已被占用（即发生哈希冲突），则使用原位置附近的可用桶。
	`std::allocator_traits<Alloc>::construct`	`std::allocator_traits<alloc>::construct`</alloc>
	`std::allocator_traits<Alloc>::destroy`	`std::allocator_traits<alloc>::destroy`</alloc>
	Read access to the element.	对元素的读取访问。
	Configuration Macros	配置宏
	Constants	常量
	Copy insert_and_[c]visit	复制 insert++_++and++_[++c++]++visit
	If `Allocator::select_on_container_copy_construction` exists and has the right signature, the allocator will be constructed from its result.	若`Allocator::select_on_container_copy_construction`存在且签名正确，则分配器将根据其返回值构造。
	Iterator Range Constructor with Allocator	带分配器的迭代器范围构造函数
	Constructs an empty table, using allocator `a`.	构造一个使用分配器`a`的空容器。
	Copy Constructor with Allocator	带分配器的复制构造函数
	```c++ concurrent_flat_set(concurrent_flat_set const& other, Allocator const& a); ```	```c++ concurrent_flat_set(concurrent_flat_set const& other, Allocator const& a); ```
	Complexity:;; O(`bucket_count()`)	Complexity:;; O(`bucket_count()`)
	```c++ concurrent_flat_set(size_type n, allocator_type const& a); ```	```c++ concurrent_flat_set(size_type n, allocator_type const& a); ```
	Constructs an empty table with at least `n` buckets, using `hf` as the hash function, the default hash function and key equality predicate and `a` as the allocator.	构造一个至少包含 `n` 个桶的空容器，以 `hf` 作为哈希函数，使用默认键相等谓词，并以 `a` 作为分配器。

Loading…

admin

Translation uploaded

English

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

The elements of the table are held into an internal _bucket array_. An element is inserted into a bucket determined by its hash code, but if the bucket is already occupied (a _collision_), an available one in the vicinity of the original position is used.容器的元素存储在内部的桶数组中。元素根据其哈希值被插入到对应的桶中，若该桶已被占用（即发生哈希冲突），则使用原位置附近的可用桶。

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 255 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

50164

Source string location

:305

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 21

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