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

Exit Zen

11 :290

	English Template Parameters 21/10000 · 21
11 :239

	English Template Parameters 21/10000 · 21
11 :245

	English A unary function object type that acts a hash function for a `Key`. It takes a single argument of type `Key` and returns a value of type `std::size_t`. 151/10000 · 151
11 :286

	English Template Parameters 21/10000 · 21
12 :12

	English xref:ref.adoc[] 15/10000 · 15
12 :76

	English ``` x.reserve(n); ``` 21/10000 · 21
12 :56

	English Open-addressing containers rely on much faster data structures and algorithms 81/10000 · 81
12 :32

	English meet the complexity requirements. 33/10000 · 33
12 :57

	English return seed; } }; ``` 21/10000 · 21
12 :24

	English image::benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png[width=250,link=_images/benchmarks-set/gcc/running insertion.xlsx.practice non-unique.png,window=_blank] 176/10000 · 176
12 :116

	English Visitation is prominent in the API provided by concurrent containers, and many classical operations have visitation-enabled variations: 135/10000 · 135
12 :108

	English Statistics for three internal operations are maintained: insertions (without considering the previous lookup to determine that the key is not present yet), successful lookups, and unsuccessful lookups (including those issued internally when inserting elements). _Probe length_ is the number of xref:structures.adoc#structures_open_addressing_containers[bucket groups] accessed per operation. If the hash function behaves properly: 431/10000 · 431
:48 :48

	English 2+^h\| All containers h\|Method h\|Description 49/10000 · 49
12 :52

	English Swap 4/10000 · 4
12 :44

	English With a simple bucket group layout, this is all that must be done: ```c++ auto const idx = get_bucket_idx(hash_function(key)); node* n = buckets[idx]; // first load if (n) { value_type const& v = *n; // second load // ... } ``` 226/10000 · 226
:24 :24

	English Fancy pointers 14/10000 · 14
12 :14

	English xref:reference/hash_traits.adoc[Hash Traits] 44/10000 · 44
12 :25

	English Added `insert_and_visit(x, f1, f2)` and similar operations to concurrent containers, which 90/10000 · 90
12 :287

	English _Hash_ 6/10000 · 6
12 :246

	English _Pred_ 6/10000 · 6

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.