2. Boost Unordered Translation (zh_Hans)
3. English
4. Zen

:827 :827
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:614 :614
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|5M updates, 45M lookups + skew=0.01 h|5M updates, 45M lookups + skew=0.5 h|5M updates, 45M lookups + skew=0.99 |=== 117/10000 · 117
190 :281
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Fix equality for `unordered_multiset` and `unordered_multimap`. 63/10000 · 63
:830 :830
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
190 :786
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
190 :789
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
190 :917
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> bool visit_while(F f); template<class F> bool visit_while(F f) const; template<class F> bool cvisit_while(F f) const; ``` 146/10000 · 146
190 :894
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `false` iff `f` ever returns `false`. Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + These overloads only participate in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed. + + Parallelization implies that execution does not necessary finish as soon as `f` returns `false`, and as a result `f` may be invoked with further elements for which the return value is also `false`. 668/10000 · 668
190 :835
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `false` iff `f` ever returns `false`. Throws:;; Depending on the exception handling mechanism of the execution policy used, may call `std::terminate` if an exception is thrown within `f`. Notes:;; Only available in compilers supporting C++17 parallel algorithms. + + These overloads only participate in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `true`. + + Unsequenced execution policies are not allowed. + + Parallelization implies that execution does not necessary finish as soon as `f` returns `false`, and as a result `f` may be invoked with further elements for which the return value is also `false`. 668/10000 · 668
:772 :772
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the container. 31/10000 · 31
190 :864
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Successively invokes `f` with const references to each of the elements in the table until `f` returns `false` or all the elements are visited. 142/10000 · 142
190 :843
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
190 :768
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Transparent Insert 18/10000 · 18
190 :766
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; An iterator pointing to the inserted element. Throws:;; If an exception is thrown by an operation other than a call to `hasher` the function has no effect. Notes:;; Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor. + + Pointers and references to elements are never invalidated. 469/10000 · 469
190 :829
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert with Hint 21/10000 · 21
:622 :622
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — GCC 12, x86 11/10000 · 11
191 :282
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {svn-ticket-url}/6857[Ticket 6857^]: 36/10000 · 36
191 :832
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
191 :787
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(value_type&& obj); ``` 62/10000 · 62
191 :790
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(value_type&& obj); ``` 62/10000 · 62