Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Unordered Node Set (adoc)

Exit Zen

267 :1023

	English Extract by Key 14/10000 · 14
268 :1024

	English ```c++ node_type extract(const key_type& k); template<class K> node_type extract(K&& k); ``` 92/10000 · 92
269 :1029

	English Extracts the element with key equivalent to `k`, if it exists. 62/10000 · 62
270 :1032

	English Returns:;; A `node_type` object holding the extracted element, or empty if no element was extracted. Throws:;; Only throws an exception if it is thrown by `hasher` or `key_equal`. Notes:;; The `template<class K>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. The library assumes that `Hash` is callable with both `K` and `Key` and that `Pred` is transparent. This enables heterogeneous lookup which avoids the cost of instantiating an instance of the `Key` type. 546/10000 · 546
:1036 :1036

	English --- 3/10000 · 3
272 :1038

	English pull 4/10000 · 4
273 :1039

	English ```c++ init_type pull(const_iterator position); ``` 51/10000 · 51
274 :1043

	English Move-constructs an `init_value` `x` from the element pointed to by `position`, erases the element and returns `x`. 114/10000 · 114
:1046 :1046

	English --- 3/10000 · 3
276 :1048

	English clear 5/10000 · 5
277 :1049

	English ```c++ void clear() noexcept; ``` 33/10000 · 33
278 :1053

	English Erases all elements in the container. 37/10000 · 37
279 :1056

	English Postconditions:;; `size() == 0`, `max_load() >= max_load_factor() * bucket_count()` 83/10000 · 83
:1058 :1058

	English --- 3/10000 · 3
281 :1060

	English merge 5/10000 · 5
282 :1061

	English ```c++ template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>& source); template<class H2, class P2> void merge(unordered_node_set<Key, T, H2, P2, Allocator>&& source); ``` 203/10000 · 203
283 :1068

	English Transfers all the element nodes from `source` whose key is not already present in `*this`. 90/10000 · 90
284 :1071

	English Requires:;; `this\->get_allocator() == source.get_allocator()`. Notes:;; Invalidates iterators to the elements transferred. If the resulting size of `this` is greater than its original maximum load, invalidates all iterators associated to `this`. 248/10000 · 248
:1076 :1076

	English --- 3/10000 · 3
286 :1078

	English Observers 9/10000 · 9

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.