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

Exit Zen

3 :6

	English Open-addressing and concurrent containers can be configured to keep running statistics of some internal operations affected by the quality of the supplied hash function. 169/10000 · 169
3 :6

	English Forward declares all the definitions in xref:reference/header_unordered_node_map.adoc[`<boost/unordered/unordered_node_map.hpp>`]. 130/10000 · 130
3 :6

	English Forward declares all the definitions in xref:reference/header_unordered_flat_map.adoc[`<boost/unordered/unordered_flat_map.hpp>`]. 130/10000 · 130
3 :6

	English Forward declares all the definitions in xref:reference/header_unordered_map.adoc[`<boost/unordered/unordered_map.hpp>`]. 120/10000 · 120
3 :6

	English Defines `xref:reference/unordered_map.adoc#unordered_map[boost::unordered_map]`, `xref:reference/unordered_multimap.adoc#unordered_multimap[boost::unordered_multimap]` and associated functions and alias templates. 213/10000 · 213
3 :4

	English :idprefix: concurrent_node_set_ 31/10000 · 31
3 :6

	English `boost::unordered_node_map` — A node-based, open-addressing unordered associative container that associates unique keys with another value. 139/10000 · 139
3 :6

	English Defines `xref:reference/unordered_flat_map.adoc#unordered_flat_map[boost::unordered_flat_map]` and associated functions and alias templates. 140/10000 · 140
3 :6

	English `boost::unordered_flat_set` — An open-addressing unordered associative container that stores unique values. 107/10000 · 107
3 :6

	English `boost::unordered_multiset` — An unordered associative container that stores values. The same key can be stored multiple times. 127/10000 · 127
3 :6

	English Defines `xref:reference/unordered_set.adoc#unordered_set[boost::unordered_set]`, `xref:reference/unordered_multiset.adoc#unordered_multiset[boost::unordered_multiset]` and associated functions and alias templates. 213/10000 · 213
3 :6

	English `boost::unordered_flat_map` — An open-addressing unordered associative container that associates unique keys with another value. 128/10000 · 128
3 :6

	English Defines `xref:reference/concurrent_node_set.adoc#concurrent_node_set[boost::concurrent_node_set]` and associated functions and alias templates. 143/10000 · 143
3 :6

	English Forward declares all the definitions in xref:reference/header_concurrent_node_set.adoc[`<boost/unordered/concurrent_node_set.hpp>`]. 132/10000 · 132
3 :6

	English Forward declares all the definitions in xref:reference/header_unordered_node_set.adoc[`<boost/unordered/unordered_node_set.hpp>`]. 130/10000 · 130
3 :6

	English Forward declares all the definitions in xref:reference/header_concurrent_flat_set.adoc[`<boost/unordered/concurrent_flat_set.hpp>`]. 132/10000 · 132
4 :4

	English xref:regular.adoc[] 19/10000 · 19
4 :16

	English For readers without previous experience with hash containers but familiar with normal associative containers (`std::set`, `std::map`, `std::multiset` and `std::multimap`), Boost.Unordered containers are used in a similar manner: 228/10000 · 228
4 :13

	English {cpp} introduced __unordered associative containers__ `std::unordered_set`, `std::unordered_map`, `std::unordered_multiset` and `std::unordered_multimap` in {cpp}11, but research on hash tables hasn't stopped since: advances in CPU architectures such as more powerful caches, link:https://en.wikipedia.org/wiki/Single_instruction,_multiple_data[SIMD] operations and increasingly available link:https://en.wikipedia.org/wiki/Multi-core_processor[multicore processors] open up possibilities for improved hash-based data structures and new use cases that are simply beyond reach of unordered associative containers as specified in 2011. 633/10000 · 633
4 :9

	English `boost::unordered_[multi]set` and `boost::unordered_[multi]map` adhere to the standard requirements for unordered associative containers, so the interface was fixed. But there are still some implementation decisions to make. The priorities are conformance to the standard and portability. 288/10000 · 288

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.