Boost Unordered Translation (zh_Hans) - Chinese (Simplified Han script) @ Boost-Weblate

English

This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done:

10 :283
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
:20 :20
	English Insertion
	Chinese (Simplified Han script) 插入 2/100 · 9 Needs editing
10 :28
	English the elements can't be stored in one array, but will need a layer of indirection instead - losing the efficiency and most of the memory gain, the main advantages of open addressing.
	Chinese (Simplified Han script) 元素无法存储在一个连续的数组中，而需要增加一层间接寻址——这将损失开放定址法的主要优势，即效率和大部分内存收益。 56/1800 · 180 Needs editing
10 :246
	English _Hash_
	Chinese (Simplified Han script) _Hash_ 6/100 · 6 Needs editing
10 :38
	English image::buckets-oa.png[]
	Chinese (Simplified Han script) image::buckets-oa.png[] 23/230 · 23 Needs editing
10 :254
	English _T_
	Chinese (Simplified Han script) _T_ 3/100 · 3 Needs editing
10 :351
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
10 :32
	English This unusually laid out data structure is chosen to make iteration of the entire container efficient by inter-connecting all of the nodes into a singly-linked list. One might also notice that buckets point to the node _before_ the start of the bucket's elements. This is done so that removing elements from the list can be done efficiently without introducing the need for a doubly-linked list. Unfortunately, this data structure introduces a guaranteed extra indirection. For example, to access the first element of a bucket, something like this must be done:
	Chinese (Simplified Han script) 这种非常规数据结构通过将所有节点连成单向链表来实现高效全局迭代。需注意：桶指向其元素起始节点的__前驱节点__，这样设计的目的是在保持高效元素删除的同时，无需引入双向链表。但这种数据结构不可避免地带来了额外的间接访问开销。例如，要访问某个桶的第一个元素，必须执行类似以下操作： 138/5600 · 560 Needs editing
10 :12
	English xref:reference/unordered_set.adoc[Class Template +++<code style="color: inherit;">+++unordered_set+++</code>+++]
	Chinese (Simplified Han script) xref:reference/unordered_set.adoc[类模板 +++<code style="color: inherit;">+++unordered_set+++</code>+++] 101/1120 · 112 Needs editing
10 :242
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :288
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :300
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
10 :333
	English Template Parameters
	Chinese (Simplified Han script) 模板参数 6/210 · 21 Needs editing
10 :237
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :245
	English _Hash_
	Chinese (Simplified Han script) _Hash_ 6/100 · 6 Needs editing
10 :284
	English Description
	Chinese (Simplified Han script) 描述 2/110 · 11 Needs editing
10 :287
	English _T_
	Chinese (Simplified Han script) _T_ 3/100 · 3 Needs editing
10 :53
	English For successful (element found) or unsuccessful (not found) lookup, provides the number of operations performed by a container and statistics on the associated __probe length__ (number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed) and number of element comparisons per operation.
	Chinese (Simplified Han script) 对于成功（找到元素）或失败（未找到）查找操作，提供容器执行的操作次数及相关__探查长度__（访问的 xref:structures.adoc#structures_open_addressing_containers[桶组] 数量）和每次操作的元素比较次数的统计信息。 134/3190 · 319 Needs editing
11 :11
	English xref:rationale.adoc[]
	Chinese (Simplified Han script) xref:rationale.adoc[设计依据] 25/210 · 21 Needs editing
11 :51
	English for(std::string::const_iterator it = x.begin(); it != x.end(); ++it) { boost::hash_combine(seed, std::toupper(*it, locale)); }
	Chinese (Simplified Han script) for(std::string::const_iterator it = x.begin(); it != x.end(); ++it) { boost::hash_combine(seed, std::toupper(*it, locale)); } 126/1260 · 126 Needs editing

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.