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.

2 :4
	English :idprefix: header_unordered_map_top_
	Chinese (Simplified Han script) :idprefix: header_unordered_map_top_ 36/360 · 36 Needs editing
2 :4
	English :idprefix: header_concurrent_node_set_
	Chinese (Simplified Han script) :idprefix: header_concurrent_node_set_ 38/380 · 38 Needs editing
2 :4
	English :idprefix: header_concurrent_node_set_fwd_
	Chinese (Simplified Han script) :idprefix: header_concurrent_node_set_fwd_ 42/420 · 42 Needs editing
2 :4
	English :idprefix: unordered_map_
	Chinese (Simplified Han script) :idprefix: unordered_map_ 25/250 · 25 Needs editing
2 :4
	English :idprefix: header_unordered_node_set_fwd_
	Chinese (Simplified Han script) :idprefix: header_unordered_node_set_fwd_ 41/410 · 41 Needs editing
2 :4
	English :idprefix: header_concurrent_flat_set_fwd_
	Chinese (Simplified Han script) :idprefix: header_concurrent_flat_set_fwd_ 42/420 · 42 Needs editing
2 :4
	English :idprefix: stats_
	Chinese (Simplified Han script) :idprefix: stats_ 17/170 · 17 Needs editing
3 :3
	English xref:hash_equality.adoc[]
	Chinese (Simplified Han script) xref:hash_equality.adoc[] 25/250 · 25 Needs editing
3 :7
	English link:https://en.wikipedia.org/wiki/Hash_table[Hash tables^] are extremely popular computer data structures and can be found under one form or another in virtually any programming language. Whereas other associative structures such as rb-trees (used in {cpp} by `std::set` and `std::map`) have logarithmic-time complexity for insertion and lookup, hash tables, if configured properly, perform these operations in constant time on average, and are generally much faster.
	Chinese (Simplified Han script) https://en.wikipedia.org/wiki/Hash_table[哈希表] 是一种极其流行的计算机数据结构，几乎在所有编程语言中都能找到其不同形式的存在。红黑树（在 C{plus}{plus} 中被 `std::set` 和 `std::map` 使用）等其他关联结构在插入和查找操作上具有对数时间复杂度，但哈希表若配置得当，这些操作的平均时间复杂度可达到常数级别，并且通常速度更快。 200/4680 · 468 Needs editing
3 :6
	English :cpp: C++
	Chinese (Simplified Han script) :cpp: C++ 9/100 · 9 Needs editing
3 :6
	English Boost.Unordered closed-addressing containers (`boost::unordered_set`, `boost::unordered_map`, `boost::unordered_multiset` and `boost::unordered_multimap`) are fully conformant with the C++ specification for unordered associative containers, so for those who know how to use `std::unordered_set`, `std::unordered_map`, etc., their homonyms in Boost.Unordered are drop-in replacements. The interface of open-addressing containers (`boost::unordered_node_set`, `boost::unordered_node_map`, `boost::unordered_flat_set` and `boost::unordered_flat_map`) is very similar, but they present some minor differences listed in the dedicated xref:compliance.adoc#compliance_open_addressing_containers[standard compliance section].
	Chinese (Simplified Han script) Boost.Unordered 的闭寻址容器（ `boost::unordered++_++set` 、 `boost::unordered++_++map` 、 `boost::unordered++_++multiset` 与 `boost::unordered++_++multimap` ）完全符合 C{plus}{plus} 无序关联容器的标准规范。因此，对于熟悉 `std::unordered++_++set` 、 `std::unordered++_++map` 等用法的用户，可直接将其替换为Boost.Unordered 中的同名容器。开放寻址容器（ `boost::unordered++_++node++_++set` 、 `boost::unordered++_++node++_++map` 、 `boost::unordered++_++flat++_++set` 和 `boost::unordered++_++flat++_++map` ）的接口与之高度相似，但存在一些细微差异，详见专门的 xref:compliance.adoc#compliance_open_addressing_containers[标准符合性章节] 。 532/7170 · 717 Needs editing
3 :4
	English :idprefix: concurrent_flat_set_
	Chinese (Simplified Han script) :idprefix: concurrent_flat_set_ 31/310 · 31 Needs editing
3 :6
	English boost::unordered_[multi]set
	Chinese (Simplified Han script) boost::unordered_[multi]set 27/270 · 27 Needs editing
3 :4
	English :idprefix: concurrent_node_map_
	Chinese (Simplified Han script) :idprefix: concurrent_node_map_ 31/310 · 31 Needs editing
3 :6
	English `boost::unordered_node_set` — A node-based, open-addressing unordered associative container that stores unique values.
	Chinese (Simplified Han script) `boost::unordered_node_set` — 一种基于节点的开放寻址无序关联容器，用于存储唯一值。 57/1180 · 118 Needs editing
3 :4
	English :idprefix: concurrent_node_set_
	Chinese (Simplified Han script) :idprefix: concurrent_node_set_ 31/310 · 31 Needs editing
3 :6
	English Forward declares all the definitions in xref:reference/header_unordered_map.adoc[`<boost/unordered/unordered_map.hpp>`].
	Chinese (Simplified Han script) 前向声明 xref:reference/header_unordered_map.adoc[`<boost unordered="" unordered_map.hpp="">`]中的所有定义。</boost> 105/1200 · 120 Needs editing
3 :4
	English :idprefix: concurrent_flat_map_
	Chinese (Simplified Han script) :idprefix: concurrent_flat_map_ 31/310 · 31 Needs editing
4 :4
	English xref:regular.adoc[]
	Chinese (Simplified Han script) xref:regular.adoc[] 19/190 · 19 Needs editing
4 :12
	English ```cpp template < class Key, class Mapped, class Hash = boost::hash<Key>, class Pred = std::equal_to<Key>, class Alloc = std::allocator<std::pair<Key const, Mapped> > > class unordered_map; ```
	Chinese (Simplified Han script) ```cpp template < class Key, class Mapped, class Hash = boost::hash<key>, class Pred = std::equal_to<key>, class Alloc = std::allocator<std::pair<key const,="" mapped=""> > > class unordered_map; ```</std::pair<key></key></key> 236/1930 · 193 Needs editing