Boost Unordered Translation (zh_Hans)/Doc / Modules / Root / Pages / Reference / Concurrent Node Map (adoc) — Chinese (Simplified Han script) @ Boost-Weblate: The `template<class K, class\... Args>` overload only participates in overload …

Zen

Translation

English

Chinese (Simplified Han script)

Needs editing

Skip

Key	English	Chinese (Simplified Han script)
	```c++ template<class F1, class F2> insert_return_type insert_and_visit(node_type&& nh, F1 f1, F2 f2); template<class F1, class F2> insert_return_type insert_and_cvisit(node_type&& nh, F1 f1, F2 f2); ```	```c++ template<class f1,="" class="" f2=""> insert_return_type insert_and_visit(node_type&& nh, F1 f1, F2 f2); template<class f1,="" class="" f2=""> insert_return_type insert_and_cvisit(node_type&& nh, F1 f1, F2 f2); ```</class></class>
	If `nh` is empty, does nothing. Otherwise, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.key()`, and then invokes `f1` with a non-const reference to the newly inserted element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff `insert_or_cvisit` is used.	若`nh`为空，则不执行任何操作。否则，当且仅当哈希表中不存在与`nh.key()`等价的键时，将关联元素插入表中，随后以非常量引用指向新插入的元素并调用`f1`。若存在等价键，则调用`f2`并传入等价元素的引用；当且仅当使用`insert_or_cvisit`时，该引用为常量引用。
:1326	Returns:;; An `insert_return_type` object constructed from `inserted` and `node`: +	返回值：;; 由 `inserted` 和 `node` 构造的 `insert_return_type` 对象：
:1327	If `nh` is empty, `inserted` is `false` and `node` is empty.	若 `nh` 为空，则 `inserted` 为 `false` 且 `node` 为空。
:1328	Otherwise if the insertion took place, `inserted` is true and `node` is empty.	若插入操作成功，则 `inserted` 为 true，且 `node` 为空。
:1329	If the insertion failed, `inserted` is false and `node` has the previous value of `nh`.	若插入操作失败，则 `inserted` 为 false ，且 `node` 保留 `nh` 的原值。
	Throws:;; If an exception is thrown by an operation other than a call to `hasher` or call to `f1` or `f2`, the function has no effect. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; Behavior is undefined if `nh` is not empty and the allocators of `nh` and the container are not equal.	若 `nh` 为空，则不执行任何操作。否则，当且仅当容器中不存在键等价于 `nh.key()` 的元素时，插入关联元素，并以新插入元素的非常量引用为参数调用 `f1` ；否则，以等价元素的引用为参数调用 `f2` ；当且仅当使用 `insert++_++or++_++cvisit` （此处应为 `insert++_++and++_++cvisit` ，可能是英文出了点错误）时该引用为常量引用。
:1334	---	---
	try_emplace	try_emplace
	```c++ template<class... Args> bool try_emplace(const key_type& k, Args&&... args); template<class... Args> bool try_emplace(key_type&& k, Args&&... args); template<class K, class... Args> bool try_emplace(K&& k, Args&&... args); ```	```c++ template<class... args=""> bool try_emplace(const key_type& k, Args&&... args); template<class... args=""> bool try_emplace(key_type&& k, Args&&... args); template<class k,="" class...="" args=""> bool try_emplace(K&& k, Args&&... args); ```</class></class...></class...>
	Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it.	若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中。
	Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This function is similiar to xref:#concurrent_node_map_emplace[emplace], with the difference that no `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: + + -- ```c++	返回值：;; 若执行插入操作则返回 true。并发特性：;; 阻塞对 *this 的重哈希操作。注意：;; 该函数与 xref:#concurrent_node_map_emplace [emplace] 类似，区别在于：若表中已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：
:1354	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...))	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<key>(k)), std::forward_as_tuple(std::forward<args>(args)...))</args></key>
:1359	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ```	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
	unlike xref:#concurrent_node_map_emplace[emplace], which simply forwards all arguments to ``value_type``'s constructor.	与 xref:#concurrent_node_map_emplace[emplace] 不同，该函数会直接将所有参数转发给 `value_type` 的构造函数。
	The `template<class K, class\... Args>` 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.	仅当 Hash::is_transparent 与 Pred::is_transparent 为合法的成员类型别名时，template<class k,="" args=""> 这个重载版本才会参与重载决议。库实现假定 Hash 可同时接受 K 类型与 Key 类型作为参数，且 Pred 是透明的。这一特性支持异构查找，从而避免实例化 Key 类型对象带来的性能开销。</class>
:1368	--	--
:1370	---	---
	try_emplace_or_[c]visit	try_emplace_or_[c]visit
	```c++ template<class... Args, class F> bool try_emplace_or_visit(const key_type& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_cvisit(const key_type& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_visit(key_type&& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_cvisit(key_type&& k, Args&&... args, F&& f); template<class K, class... Args, class F> bool try_emplace_or_visit(K&& k, Args&&... args, F&& f); template<class K, class... Args, class F> bool try_emplace_or_cvisit(K&& k, Args&&... args, F&& f); ```	```c++ template<class... args,="" class="" f=""> bool try_emplace_or_visit(const key_type& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_cvisit(const key_type& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_visit(key_type&& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_cvisit(key_type&& k, Args&&... args, F&& f); template<class k,="" class...="" args,="" class="" f=""> bool try_emplace_or_visit(K&& k, Args&&... args, F&& f); template<class k,="" class...="" args,="" class="" f=""> bool try_emplace_or_cvisit(K&& k, Args&&... args, F&& f); ```</class></class></class...></class...></class...></class...>
	Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it. Otherwise, invokes `f` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used.	若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中。否则，以指向等价元素的引用调用`f`；当且仅当使用`*_cvisit`重载版本时，该引用为常量引用。
:1392	Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; No `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: + + -- ```c++	返回值：;; 若执行插入操作则返回 true。并发特性：;; 阻塞对 *this 的重哈希操作。注意：;; 若已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：
:1400	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...))	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<key>(k)), std::forward_as_tuple(std::forward<args>(args)...))</args></key>
:1405	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ```	value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<k>(k)), std::forward_as_tuple(std::forward<args>(args)...)) ```</args></k>
	The interface is exposition only, as C++ does not allow to declare a parameter `f` after a variadic parameter pack.	该接口仅为说明性用法，因为 C++ 不允许在可变参数包之后声明参数 `f`。
	The `template<class K, class\... Args, class F>` overloads only participate 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.	仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类型别名时，`template<class k,="" args,="" class="" f="">` 这些重载版本才会参与重载决议。库假定 `Hash` 可同时接受 `K` 类型和 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从而避免实例化 `Key` 类型对象带来的性能开销。</class>
:1414	--	--
:1416	---	---
	try_emplace_and_[c]visit	try_emplace_and_[c]visit
	```c++ template<class... Args, class F1, class F2> bool try_emplace_and_visit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_visit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_visit(K&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_cvisit(K&& k, Args&&... args, F1&& f1, F2&& f2); ```	```c++ template<class... args,="" class="" f1,="" f2=""> bool try_emplace_and_visit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... args,="" class="" f1,="" f2=""> bool try_emplace_and_cvisit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... args,="" class="" f1,="" f2=""> bool try_emplace_and_visit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class... args,="" class="" f1,="" f2=""> bool try_emplace_and_cvisit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class k,="" class...="" args,="" class="" f1,="" f2=""> bool try_emplace_and_visit(K&& k, Args&&... args, F1&& f1, F2&& f2); template<class k,="" class...="" args,="" class="" f1,="" f2=""> bool try_emplace_and_cvisit(K&& k, Args&&... args, F1&& f1, F2&& f2); ```</class></class></class...></class...></class...></class...>
	Inserts an element constructed from `k` and `args` into the table if there is no existing element with key `k` contained within it, and then invokes `f1` with a non-const reference to the newly created element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff a `*_cvisit` overload is used.	若表中不存在键为`k`的元素，则将由`k`和`args`构造的元素插入表中，随后以非常量引用指向新创建的元素并调用`f1`。否则，以指向等价元素的引用调用`f2`；当且仅当使用`*_cvisit`重载版本时，该引用为常量引用。

	English	Chinese (Simplified Han script)	Actions
	If an element `x` exists with key equivalent to `k`, invokes `f` with a reference to `x`. Such reference is const iff `*this` is const.	若存在键与 `k` 等价的元素 `x`，则以 `x` 的引用调用函数 `f`。当且仅当 `*this` 为常量时，该引用为常量引用。
	Returns:;; The number of elements visited.	返回值：;; 被访问的元素数量。
	Parallel [c]visit_all	并行 ++[++c++]++visit++_++all
	```c++ template<class ExecutionPolicy, class F> bool visit_while(ExecutionPolicy&& policy, F f); template<class ExecutionPolicy, class F> bool visit_while(ExecutionPolicy&& policy, F f) const; template<class ExecutionPolicy, class F> bool cvisit_while(ExecutionPolicy&& policy, F f) const; ```	```c++ template<class executionpolicy,="" class="" f=""> bool visit_while(ExecutionPolicy&& policy, F f); template<class executionpolicy,="" class="" f=""> bool visit_while(ExecutionPolicy&& policy, F f) const; template<class executionpolicy,="" class="" f=""> bool cvisit_while(ExecutionPolicy&& policy, F f) const; ```</class></class></class>
	Size and Capacity	大小与容量
	empty	空
	```c++ [[nodiscard]] bool empty() const noexcept; ```	```c++ [[nodiscard]] bool empty() const noexcept; ```
	Notes:;; In the presence of concurrent insertion operations, the value returned may not accurately reflect the true size of the table right after execution.	注意：;; 在存在并发插入操作时，返回的值可能无法精确反映函数执行完成后哈希表的真实大小。
	Inserts an object, constructed with the arguments `args`, in the table if and only if there is no element in the table with an equivalent key.	当且仅当哈希表中不存在等价键的元素时，才会使用参数 `args` 构造对象并插入到哈希表中。
	Requires:;; `value_type` is constructible from `args`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; If `args...` is of the form `k,v`, it delays constructing the whole object until it is certain that an element should be inserted, using only the `k` argument to check.	要求：;; `value_type` 可由参数 `args` 构造。返回值：;; 成功插入元素时返回 `true`。并发特性：;; 当对当前对象执行重哈希操作时会阻塞。注意：;; 若 `args...` 格式为 `k,v`，则会仅使用参数 `k` 进行键检查，直到确定需要插入元素时，才会构造完整对象。
	Move Insert	移动插入
	```c++ bool insert(value_type&& obj); bool insert(init_type&& obj); ```	```c++ bool insert(value_type&& obj); bool insert(init_type&& obj); ```
	Insert Iterator Range	迭代器范围插入
	```c++ template<class F> bool insert_or_visit(const value_type& obj, F f); template<class F> bool insert_or_cvisit(const value_type& obj, F f); template<class F> bool insert_or_visit(const init_type& obj, F f); template<class F> bool insert_or_cvisit(const init_type& obj, F f); ```	```c++ template<class f=""> bool insert_or_visit(const value_type& obj, F f); template<class f=""> bool insert_or_cvisit(const value_type& obj, F f); template<class f=""> bool insert_or_visit(const init_type& obj, F f); template<class f=""> bool insert_or_cvisit(const init_type& obj, F f); ```</class></class></class></class>
	Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. Notes:;; This function is similiar to xref:#concurrent_node_map_emplace[emplace], with the difference that no `value_type` is constructed if there is an element with an equivalent key; otherwise, the construction is of the form: + + -- ```c++	返回值：;; 若执行插入操作则返回 true。并发特性：;; 阻塞对 *this 的重哈希操作。注意：;; 该函数与 xref:#concurrent_node_map_emplace [emplace] 类似，区别在于：若表中已存在等价键的元素，则不会构造 value_type；否则，构造方式如下：
	The `template<class K, class\... Args>` 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.	仅当 Hash::is_transparent 与 Pred::is_transparent 为合法的成员类型别名时，template<class k,="" args=""> 这个重载版本才会参与重载决议。库实现假定 Hash 可同时接受 K 类型与 Key 类型作为参数，且 Pred 是透明的。这一特性支持异构查找，从而避免实例化 Key 类型对象带来的性能开销。</class>
	```c++ template<class... Args, class F> bool try_emplace_or_visit(const key_type& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_cvisit(const key_type& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_visit(key_type&& k, Args&&... args, F&& f); template<class... Args, class F> bool try_emplace_or_cvisit(key_type&& k, Args&&... args, F&& f); template<class K, class... Args, class F> bool try_emplace_or_visit(K&& k, Args&&... args, F&& f); template<class K, class... Args, class F> bool try_emplace_or_cvisit(K&& k, Args&&... args, F&& f); ```	```c++ template<class... args,="" class="" f=""> bool try_emplace_or_visit(const key_type& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_cvisit(const key_type& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_visit(key_type&& k, Args&&... args, F&& f); template<class... args,="" class="" f=""> bool try_emplace_or_cvisit(key_type&& k, Args&&... args, F&& f); template<class k,="" class...="" args,="" class="" f=""> bool try_emplace_or_visit(K&& k, Args&&... args, F&& f); template<class k,="" class...="" args,="" class="" f=""> bool try_emplace_or_cvisit(K&& k, Args&&... args, F&& f); ```</class></class></class...></class...></class...></class...>
	Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; `f` is passed a non-const reference to `x`. + + The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` 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.	返回值：;; 删除的元素数量（0 或 1）。抛出异常：;; 仅当 `hasher`、`key_equal` 或 `f` 抛出异常时才会抛出。注意：;; `f` 接收指向 `x` 的非常量引用。 `template<class k,="" class="" f="">` 重载版本仅在 `std::is_execution_policy_v<std::remove_cvref_t<executionpolicy>>` 为 `false` 时参与重载决议。 `template<class k,="" class="" f="">` 重载版本仅在 `Hash::is_transparent` 和 `Pred::is_transparent` 为有效成员类型别名时参与重载决议。库假定 `Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从而避免实例化 `Key` 类型对象带来的性能开销。</class></std::remove_cvref_t<executionpolicy></class>
	```c++ template<class F> size_type erase_if(F f); ```	```c++ template<class f=""> size_type erase_if(F f); ```</class>
	swap	交换
	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.	返回值：;; 一个存储被提取元素的 `node_type` 对象；若未提取任何元素，则为空。抛出异常：;; 仅当 `hasher` 或 `key_equal` 抛出异常时才会抛出。注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类型别名时，`template<class k="">` 重载版本才参与重载决议。库假定 `Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从而避免实例化 `Key` 类型对象带来的性能开销。</class>
	```c++ template<class F> node_type extract_if(const key_type& k, F f); template<class K, class F> node_type extract_if(K&& k, F f); ```	```c++ template<class f=""> node_type extract_if(const key_type& k, F f); template<class k,="" class="" f=""> node_type extract_if(K&& k, F f); ```</class></class>
	Extracts the element `x` with key equivalent to `k`, if it exists and `f(x)` is `true`.	若存在键与 `k` 等价的元素 `x`，且 `f(x)` 返回 `true`，则提取该元素。
	clear	清空
	merge	合并
	Returns:;; The number of elements with key equivalent to `k` (0 or 1). 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. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.	返回值：;; 与键 `k` 等价的元素数量（值为 0 或 1）。注意：;; 仅当 `Hash::is_transparent` 和 `Pred::is_transparent` 是有效的成员类型别名时，`template<class k="">` 重载版本才参与重载决议。库假定 `Hash` 可同时接受 `K` 类型与 `Key` 类型作为参数，且 `Pred` 是透明的。这支持异构查找，从而避免实例化 `Key` 类型对象带来的性能开销。在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。</class>
	Set max_load_factor	设置最大负载因子
	Returns:;; The maximum number of elements the table can hold without rehashing, assuming that no further elements will be erased. Note:;; After construction, rehash or clearance, the table's maximum load is at least `max_load_factor() * bucket_count()`. This number may decrease on erasure under high-load conditions. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution.	返回值：;; 表在不进行重哈希的情况下可容纳的最大元素数量（假设不会再删除任何元素）。注意：;; 构造、重哈希或清空后，表的最大装载量至少为 `max_load_factor() * bucket_count()`。在高负载条件下执行删除操作时，该数值可能会降低。在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。
	```c++ void rehash(size_type n); ```	```c++ void rehash(size_type n); ```
	```c++ stats get_stats() const; ```	```c++ stats get_stats() const; ```

Loading…

admin

Translation uploaded

English

Chinese (Simplified Han script) 300 characters editedCurrent translationState: Translated

~~The `template<class K, class\... Args>` 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. 为合法的成员类型别名时，template<class k,="" args=""> 这个重载版本才会参与重载决议。
库实现假定 Hash 可同时接受 K 类型与 Key 类型作为参数，且 Pred 是透明的。
这一特性支持异构查找，从而避免实例化 Key 类型对象带来的性能开销。</class>

06/05/2026

admin

String added in the repository

English

Chinese (Simplified Han script) 373 characters editedPrevious translationState: Needs editing (Needs rewriting)

06/05/2026

Browse all string changes

Things to check

Mismatched full stop

Source and translation do not both end with a full stop.

Reset

Mismatching line breaks

Number of new lines in translation does not match source.

Reset

Glossary

English	Chinese (Simplified Han script)
No related strings found in the glossary.

String information

Flags

safe-html, strict-same

Unit identifier

52075

Source string location

:1366

String age

06/05/2026

Last updated

06/06/2026

Source string age

06/05/2026

Translation file AsciiDoc file

doc/modules/ROOT/pages/reference/concurrent_node_map_zh_Hans.adoc, string 323

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.

Translation

Things to check

Mismatched full stop

Mismatching line breaks

Glossary

String information

Flags

Details

Unit identifier

Source string location

String age

Last updated

Source string age

Translation file AsciiDoc file