Boost Unordered Translation (zh_Hans) - English @ Boost-Weblate

Exit Zen

6 :249

	English Description 11/10000 · 11
6 :43

	English Provides the average value, variance and standard deviation of a sequence of numerical values. 94/10000 · 94
6 :17

	English The internal data structure of `boost::concurrent_node_set` is similar to that of `boost::unordered_node_set`. Unlike `boost::concurrent_flat_set`, pointer stability and node handling functionalities are provided, at the expense of potentially lower performance. 262/10000 · 262
6 :15

	English - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`). - The maximum load factor of the container is managed internally and can't be set by the user. 191/10000 · 191
6 :17

	English - `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user. 312/10000 · 312
6 :240

	English Description 11/10000 · 11
6 :17

	English - `value_type` must be move-constructible. - Pointer stability is not kept under rehashing. - `begin()` is not constant-time. - There is no API for bucket handling (except `bucket_count`) or node extraction/insertion. - The maximum load factor of the container is managed internally and can't be set by the user. 312/10000 · 312
7 :7

	English xref:compliance.adoc[] 22/10000 · 22
7 :50

	English There are other differences, which are listed in the xref:regular.adoc#comparison[Comparison with Associative Containers] section. 130/10000 · 130
7 :31

	English ^.^h\|Closed addressing ^m\| boost::unordered_set + boost::unordered_map + boost::unordered_multiset + boost::unordered_multimap ^\| 131/10000 · 131
7 :20

	English By specifying an interface for accessing the buckets of the container the standard pretty much requires that the hash table uses closed addressing. 147/10000 · 147
7 :30

	English There is an link:../../../examples/fnv1.hpp[implementation of FNV-1a^] in the examples directory. 97/10000 · 97
:14 :14

	English The successful lookup benchmarks are done by looking up all `n` values, in their original insertion order. 106/10000 · 106
7 :11

	English Peter Dimov, 2022. https://pdimov.github.io/articles/unordered_dev_plan.html[Development Plan for Boost.Unordered^]. 116/10000 · 116
7 :61

	English In a multithreaded scenario, the iterator `it` may be invalid at point B if some other thread issues an `m.erase(k)` operation between A and B. There are designs that can remedy this by making iterators lock the element they point to, but this approach lends itself to high contention and can easily produce deadlocks in a program. `operator[]` has similar concurrency issues, and is not provided by `boost::concurrent_flat_map`/`boost::concurrent_node_map` either. Instead, element access is done through so-called _visitation functions_: 539/10000 · 539
7 :24

	English Even if your supplied hash function does not conform to the uniform behavior required by open addressing, chances are that the performance of Boost.Unordered containers will be acceptable, because the library executes an internal __post-mixing__ step that improves the statistical properties of the calculated hash values. This comes with an extra computational cost; if you'd like to opt out of post-mixing, annotate your hash function as follows: 448/10000 · 448
7 :27

	English There is xref:hash_equality.adoc#hash_equality[more information on hash functions and equality predicates in the next section]. 127/10000 · 127
7 :18

	English Deduction guides for https://en.cppreference.com/w/cpp/language/class_template_argument_deduction[class template argument deduction (CTAD)^] are only available on {cpp}17 (or later) compilers. 192/10000 · 192
7 :24

	English Canonical standard implementations will wind up looking like the diagram below: 79/10000 · 79
:14 :14

	English Visualization structure 23/10000 · 23

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.