Boost Unordered Translation (zh_Hans)

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.

23 :331
	English 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.
	Chinese (Simplified Han script) 若 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanchinghash[hash_is_avalanching]<hash>::value` 为 `true`，则直接使用原哈希函数；否则会添加一个位混合后置处理阶段，以额外计算开销为代价提升哈希质量。</hash> 181/2980 · 298 Needs editing
24 :323
	English 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.
	Chinese (Simplified Han script) 如果 `link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanching[hash_is_avalanching]<hash>::value` 为 `true`，则哈希函数将按原样使用；否则，会增加一个位混合后处理阶段，以牺牲额外的计算成本为代价来提高哈希质量。</hash> 183/2980 · 298 Needs editing
24 :269
	English 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.
	Chinese (Simplified Han script) 如果`link:../../../../../container_hash/doc/html/hash.html#ref_hash_is_avalanching[hash_is_avalanching]<hash>::value` 为 `true`，则哈希函数将按原样使用；否则，将添加一个比特混合后处理阶段，以增加哈希质量，但会增加额外的计算成本。</hash> 182/2980 · 298 Needs editing
26 :100
	English Keys `k1`, `k2` are considered equivalent if `Pred(k1, k2)`
	Chinese (Simplified Han script) 若`谓词对象(k1, k2)成立`，则键`k1`、`k2`视为等价。 34/590 · 59 Needs editing
27 :73
	English The other containers are identical other than replacing "`boost::unordered_{map\|set}`" with the appropriate template name when displaying the container itself. Note that each sub-element (i.e. the key, the mapped value, or the value) is displayed based on its own printing settings which may include its own pretty-printer.
	Chinese (Simplified Han script) (gdb) print example_unordered_map $1 = boost::unordered_map with 3 elements = {["C"] = "c", ["B"] = "b", ["A"] = "a"} (gdb) print example_unordered_map_begin $2 = iterator = { {first = "C", second = "c"} } (gdb) print example_unordered_map_end $3 = iterator = { end iterator } (gdb) print example_unordered_set $4 = boost::unordered_set with 3 elements = {[0] = "c", [1] = "b", [2] = "a"} (gdb) print example_unordered_set_begin $5 = iterator = { "c" } (gdb) print example_unordered_set_end $6 = iterator = { end iterator } 523/3230 · 323 Needs editing
28 :75
	English Both the SIMD and the non-SIMD implementations are viewable through the GDB pretty-printers.
	Chinese (Simplified Han script) ``` 3/920 · 92 Needs editing
30 :100
	English `equal_range(k)` returns a range at the end of the container if `k` isn't present in the container. It can't return a positioned range as `k` could be inserted into multiple place. +
	Chinese (Simplified Han script) equal_range(k) 若键k不存在于容器中，则返回容器末尾的区间。该函数无法返回定位区间，因为k可被插入到多个位置。 62/1820 · 182 Needs editing
30 :79
	English ```plaintext (gdb) print example_flat_map.get_stats() $1 = [stats] = {[insertion] = {[count] = 5, [probe_length] = {avg = 1.0, var = 0.0, dev = 0.0}}, [successful_lookup] = {[count] = 0, [probe_length] = {avg = 0.0, var = 0.0, dev = 0.0}, [num_comparisons] = {avg = 0.0, var = 0.0, dev = 0.0}}, [unsuccessful_lookup] = {[count] = 5, [probe_length] = {avg = 1.0, var = 0.0, dev = 0.0}, [num_comparisons] = {avg = 0.0, var = 0.0, dev = 0.0}}} ```
	Chinese (Simplified Han script) 无论采用 SIMD 还是非 SIMD 实现，均可通过 GDB 美化打印器查看。 39/4440 · 444 Needs editing
34 :144
	English Container level: A read-write mutex is used to control access from any operation
	Chinese (Simplified Han script) 容器层面：使用读写互斥锁来控制来自任何操作的访问。 25/800 · 80 Needs editing
35 :122
	English xref:regular.adoc#regular_iterator_invalidation[Iterators can be invalidated by calls to insert or rehash]. +
	Chinese (Simplified Han script) xref:regular.adoc#regular_iterator_invalidation [调用 insert 或 rehash 可能会导致迭代器失效]。 80/1090 · 109 Needs editing
36 :58
	English `boost::concurrent_flat_(map\|set)` and vice versa.
	Chinese (Simplified Han script) `boost::unordered_flat_(map\|set)` 到 `boost::concurrent_flat_(map\|set)` 及反向的） 76/500 · 50 Needs editing
38 :128
	English Open-addressing is faster than closed-addressing alternatives, both in non-concurrent and
	Chinese (Simplified Han script) 无论是在非并发环境还是并发环境下，开放寻址都比闭地址方案更快。 31/890 · 89 Needs editing
40 :130
	English Open-addressing layouts are eminently suitable for concurrent access and modification
	Chinese (Simplified Han script) 开放寻址的内存布局极其适合在最小化锁竞争的条件下进行并发访问与修改。 34/850 · 85 Needs editing
49 :379
	English Constructs an empty container with at least `n` buckets, using `hf` as the hash function, `eql` as the key equality predicate, `a` as the allocator and a maximum load factor of `1.0`.
	Chinese (Simplified Han script) explicit unordered_set(size_type n, const hasher& hf = hasher(), const key_equal& eql = key_equal(), const allocator_type& a = allocator_type()); 157/1830 · 183 Needs editing
56 :369
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：;; `value_type` 可复制构造。 25/460 · 46 Needs editing
56 :420
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：`value_type` 需满足可复制构造要求。 27/460 · 46 Needs editing
:393 :393
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：`value_type` 可拷贝构造。 22/460 · 46 Needs editing
:405 :405
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：`value_type` 可拷贝构造。 22/460 · 46 Needs editing
:417 :417
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：;; `value_type` 需满足可复制构造要求。 30/460 · 46 Needs editing
:461 :461
	English Requires:;; `value_type` is copy constructible
	Chinese (Simplified Han script) 要求：`value_type` 可拷贝构造。 22/460 · 46 Needs editing