Concurrent Node Map (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_node_map_
	Chinese (Simplified Han script) :idprefix: concurrent_node_map_ 31/310 · 31 Needs editing
4 :6
	English `boost::concurrent_node_map` — A node-based hash table that associates unique keys with another value and allows for concurrent element insertion, erasure, lookup and access without external synchronization mechanisms.
	Chinese (Simplified Han script) `boost::concurrent++_++node++_++map` —— 一种基于节点的哈希表，用于建立唯一键与对应值的关联，并支持在无外部同步机制的情况下并发执行元素插入、擦除、查找和访问操作。 101/2180 · 218 Needs editing
5 :10
	English Even though it acts as a container, `boost::concurrent_node_map` 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 and modification are done through user-provided _visitation functions_ that are passed to `concurrent_node_map` 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++_++node++_++map` 的行为类似于容器，但它并不符合标准 C{plus}{plus} 的 https://en.cppreference.com/w/cpp/named_req/Container[容器] 概念模型。具体而言，它不提供迭代器及相关操作（如 `begin` 、 `end` 等）。元素的访问和修改通过用户提供的__访问函数__来实现，这些函数被传递至 `concurrent++_++node++_++map` 的操作中，并在其内部以受控方式执行。这种基于访问的 API 设计能够支持低争用的并发应用场景。 289/5410 · 541 Needs editing
6 :17
	English The internal data structure of `boost::concurrent_node_map` is similar to that of `boost::unordered_node_map`. Unlike `boost::concurrent_flat_map`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance.
	Chinese (Simplified Han script) `boost::concurrent++_++node++_++map` 的内部数据结构与 `boost::unordered++_++node++_++map` 类似。与 `boost::concurrent++_++flat++_++map` 不同，它提供了指针稳定性和节点处理功能，但代价是可能带来性能上的损失。 159/2620 · 262 Needs editing
7 :21
	English Synopsis
	Chinese (Simplified Han script) 概要 2/100 · 8 Needs editing
:347 :347
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
9 :349
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :351
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
11 :354
	English _Key_
	Chinese (Simplified Han script) _键_ 3/100 · 5 Needs editing
12 :358
	English into the table from any `std::pair` object convertible to it, and it also must be https://en.cppreference.com/w/cpp/named_req/Erasable[Erasable^] from the table.
	Chinese (Simplified Han script) `std::pair` 对象 https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[原地构造] 到容器中，并且必须支持从容器中 https://en.cppreference.com/w/cpp/named_req/Erasable[擦除] 。 160/1610 · 161 Needs editing
13 :361
	English _T_
	Chinese (Simplified Han script) _T_ 3/100 · 3 Needs editing
14 :361
	English _Hash_
	Chinese (Simplified Han script) _Hash_ 6/100 · 6 Needs editing
15 :361
	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` 38/1510 · 151 Needs editing
16 :361
	English _Pred_
	Chinese (Simplified Han script) _Pred_ 6/100 · 6 Needs editing
17 :361
	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类型的值。 54/1590 · 159 Needs editing
18 :361
	English _Allocator_
	Chinese (Simplified Han script) _Allocator_ 11/110 · 11 Needs editing
19 :361
	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 :371
	English Allocators using https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[fancy pointers] are supported.
	Chinese (Simplified Han script) 支持使用 https://en.cppreference.com/w/cpp/named_req/Allocator#Fancy_pointers[花式指针] 的分配器。 85/1160 · 116 Needs editing
21 :375
	English The element nodes of the table are held into an internal _bucket array_. An node is inserted into a bucket determined by the hash code of its element, 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) 哈希表的元素节点存储在内部桶数组中。节点会根据其元素的哈希值插入到对应的桶中；若该桶已被占用（即发生哈希冲突），则使用原位置附近的可用桶。 77/2720 · 272 Needs editing
22 :379
	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()`，仅在尺寸极小时，实现可能允许更高的负载。 132/3570 · 357 Needs editing