Concurrent Flat Set (adoc)

Chinese (Simplified Han script)

Zen

Exit Zen

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.

3 :4
	English :idprefix: concurrent_flat_set_
	Chinese (Simplified Han script) :idprefix: concurrent_flat_set_ 31/310 · 31 Needs editing
4 :6
	English `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.
	Chinese (Simplified Han script) `boost::concurrent++_++flat++_++set` —— 一种存储唯一值的哈希表，它支持并发的元素插入、删除、查找及访问操作，且无需外部同步机制。 84/1860 · 186 Needs editing
5 :10
	English Even though it acts as a container, `boost::concurrent_flat_set` does not model the standard C++ https://en.cppreference.com/w/cpp/named_req/Container[Container^] concept. In particular, iterators and associated operations (`begin`, `end`, etc.) are not provided. Element access is done through user-provided _visitation functions_ that are passed to `concurrent_flat_set` operations where they are executed internally in a controlled fashion. Such visitation-based API allows for low-contention concurrent usage scenarios.
	Chinese (Simplified Han script) 尽管 `boost::concurrent++_++flat++_++set` 具备容器特性，但它并不符合 C{plus}{plus}标准中的 https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念。具体而言，该容器未提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素访问通过用户提供的__访问函数__实现，这些函数被传递至 `concurrent++_++flat++_++set` 操作中，并在其内部以受控方式执行。这种基于访问机制的 API 设计能够有效支持低争用的并发应用场景。 285/5230 · 523 Needs editing
6 :17
	English 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.
	Chinese (Simplified Han script) `boost::concurrent++_++flat++_++set` 的内部数据结构类似于 `boost::unordered++_++flat++_++set` 。由于其采用开放寻址技术， `value++_++type` 必须满足可移动构造要求，且在重哈希过程中无法保持指针稳定性。 145/2540 · 254 Needs editing
7 :21
	English Synopsis
	Chinese (Simplified Han script) 概要 2/100 · 8 Needs editing
:279 :279
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
9 :281
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :283
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
11 :286
	English _Key_
	Chinese (Simplified Han script) _键_ 3/100 · 5 Needs editing
12 :286
	English `Key` must be https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^] into the container
	Chinese (Simplified Han script) Key 必须满足 8/1080 · 108 Needs editing
13 :290
	English and https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the container.
	Chinese (Simplified Han script) https://en.cppreference.com/w/cpp/named_req/MoveInsertable[可移动插入] 到容器中的要求，且需满足从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[可擦除] 的要求。 145/870 · 87 Needs editing
14 :292
	English _Hash_
	Chinese (Simplified Han script) _Hash_ 6/100 · 6 Needs editing
15 :292
	English 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`.
	Chinese (Simplified Han script) 一种为`Key`提供哈希功能的一元函数对象类型。它接受单个`Key`类型参数，并返回`std::size_t`类型的值。 60/1510 · 151 Needs editing
16 :292
	English _Pred_
	Chinese (Simplified Han script) _Pred_ 6/100 · 6 Needs editing
17 :292
	English 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`.
	Chinese (Simplified Han script) 一种二元函数对象，用于在Key类型的值上构建等价关系。它接受两个Key类型的参数，并返回一个bool类型的值。 55/1590 · 159 Needs editing
18 :292
	English _Allocator_
	Chinese (Simplified Han script) _Allocator_ 11/110 · 11 Needs editing
19 :292
	English An allocator whose value type is the same as the table's value type.
	Chinese (Simplified Han script) 值类型与该表的值类型相同的分配器。 17/680 · 68 Needs editing
20 :300
	English `std::allocator_traits<Allocator>::pointer` and `std::allocator_traits<Allocator>::const_pointer` must be convertible to/from `value_type` and `const value_type`, respectively.
	Chinese (Simplified Han script) `std::allocator_traits<allocator>::pointer` 与 `std::allocator_traits<allocator>::const_pointer` 必须分别可与 `value_type` 和 `const value_type` 相互转换。</allocator></allocator> 168/1780 · 178 Needs editing
21 :305
	English 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.
	Chinese (Simplified Han script) 容器的元素存储在内部的桶数组中。元素根据其哈希值被插入到对应的桶中，若该桶已被占用（即发生哈希冲突），则使用原位置附近的可用桶。 64/2550 · 255 Needs editing
22 :309
	English 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.
	Chinese (Simplified Han script) 调用 `insert`/`emplace` 或执行 `rehash`/`reserve` 操作时，桶数组的大小会自动扩容。容器的负载因子（元素数量除以桶数量）永远不会超过 `max_load_factor()`，仅在尺寸较小时，实现可能允许更高的负载因子。 128/3570 · 357 Needs editing