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

English

- It has an `InputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an `Allocator` template parameter and a type that does not qualify as an allocator is deduced for that parameter. - It has a `Hash` template parameter and an integral type or a type that qualifies as an allocator is deduced for that parameter. - It has a `Pred` template parameter and a type that qualifies as an allocator is deduced for that parameter.

441 :1764
	English ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, const concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y); ```
	Chinese (Simplified Han script) ```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> bool operator!=(const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, const concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y); ```</key,></key,></class> 261/2070 · 207 Needs editing
441 :1645
	English Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`, or `a.rehash(1)` if `n > 0` and `a.max_load_factor() == std::numeric_limits<float>::infinity()`.
	Chinese (Simplified Han script) 等价于 `a.rehash(ceil(n / a.max_load_factor()))`；如果 `n > 0` 且 `a.max_load_factor() == std::numeric_limits<float>::infinity()`，则等价于 `a.rehash(1)`。</float> 153/1530 · 153 Needs editing
442 :1750
	English ```c++ size_type max_load() const noexcept; ```
	Chinese (Simplified Han script) ```c++ size_type max_load() const noexcept; ``` 47/470 · 47 Needs editing
443 :1755
	English 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.
	Chinese (Simplified Han script) 返回值：;; 表在不进行重哈希的情况下可容纳的最大元素数量（假设不会再删除任何元素）。注意：;; 构造、重哈希或清空后，表的最大装载量至少为 `max_load_factor() * bucket_count()`。在高负载条件下执行删除操作时，该数值可能会降低。在存在并发插入操作的情况下，返回的值可能无法精确反映执行后容器的真实状态。 171/4700 · 470 Needs editing
:1773 :1773
	English Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if the two tables don't have equivalent equality predicates.
	Chinese (Simplified Han script) 并发：阻塞`x`和`y`。说明：若两个容器的相等判定谓词不一致，则行为未定义。 40/1310 · 131 Needs editing
:1762 :1762
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
:1667 :1667
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
:1776 :1776
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
446 :1765
	English ```c++ void rehash(size_type n); ```
	Chinese (Simplified Han script) ```c++ void rehash(size_type n); ``` 36/360 · 36 Needs editing
446 :1645
	English operator
	Chinese (Simplified Han script) operator 8/100 · 8 Needs editing
446 :1779
	English ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(concurrent_flat_map<Key, T, Hash, Pred, Alloc>& x, concurrent_flat_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ```
	Chinese (Simplified Han script) ```c++ template<class key,="" class="" t,="" hash,="" pred,="" alloc=""> void swap(concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& x, concurrent_flat_map<key, t,="" hash,="" pred,="" alloc="">& y) noexcept(noexcept(x.swap(y))); ```</key,></key,></class> 273/2190 · 219 Needs editing
447 :1646
	English ```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator==(const concurrent_node_set<Key, Hash, Pred, Alloc>& x, const concurrent_node_set<Key, Hash, Pred, Alloc>& y); ```
	Chinese (Simplified Han script) ```c++ template<class key,="" class="" hash,="" pred,="" alloc=""> bool operator==(const concurrent_node_set<key, hash,="" pred,="" alloc="">& x, const concurrent_node_set<key, hash,="" pred,="" alloc="">& y); ```</key,></key,></class> 243/1920 · 192 Needs editing
447 :1657
	English - It has an `InputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an `Allocator` template parameter and a type that does not qualify as an allocator is deduced for that parameter. - It has a `Hash` template parameter and an integral type or a type that qualifies as an allocator is deduced for that parameter. - It has a `Pred` template parameter and a type that qualifies as an allocator is deduced for that parameter.
	Chinese (Simplified Han script) - 它具有 `InputIterator` 模板参数，并且为该参数推导出的类型不符合输入迭代器的要求。 - 它具有 `Allocator` 模板参数，并且为该参数推导出的类型不符合分配器的要求。 - 它具有 `Hash` 模板参数，并且为该参数推导出的是整数类型或符合分配器要求的类型。 - 它具有 `Pred` 模板参数，并且为该参数推导出的是符合分配器要求的类型。 184/4940 · 494 Needs editing
:1792 :1792
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
449 :1774
	English Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the table's hash function or comparison function. Concurrency:;; Blocking on `*this`. ---
	Chinese (Simplified Han script) 抛出异常：;; 若抛出异常，函数不会产生任何效果（由容器的哈希函数或比较函数抛出的异常除外）。并发特性：;; 阻塞当前容器 `*this`。 71/1760 · 176 Needs editing
:1655 :1655
	English Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if the two tables don't have equivalent equality predicates.
	Chinese (Simplified Han script) 并发：;; 对 `x` 和 `y` 进行阻塞操作。注意：;; 若两个哈希表的相等性断言不匹配，则行为未定义。 55/1310 · 131 Needs editing
:1794 :1794
	English erase_if
	Chinese (Simplified Han script) erase_if 8/100 · 8 Needs editing
:1658 :1658
	English ---
	Chinese (Simplified Han script) --- 3/100 · 3 Needs editing
450 :1795
	English ```c++ template<class K, class T, class H, class P, class A, class Predicate> typename concurrent_flat_map<K, T, H, P, A>::size_type erase_if(concurrent_flat_map<K, T, H, P, A>& c, Predicate pred); ```
	Chinese (Simplified Han script) ```c++ template<class k,="" class="" t,="" h,="" p,="" a,="" predicate=""> typename concurrent_flat_map<k, t,="" h,="" p,="" a="">::size_type erase_if(concurrent_flat_map<k, t,="" h,="" p,="" a="">& c, Predicate pred); ```</k,></k,></class> 244/2010 · 201 Needs editing
450 :1674
	English __iter-key-type__
	Chinese (Simplified Han script) __iter-key-type__ 17/170 · 17 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.