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

185 :876
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `false` iff `f` ever returns `false`. 48/10000 · 48
185 :818
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; `false` iff `f` ever returns `false`. 48/10000 · 48
:755 :755
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the container. 31/10000 · 31
185 :843
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invokes `f` with const references to each of the elements in the table. Execution is parallelized according to the semantics of the execution policy specified. 159/10000 · 159
185 :823
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
185 :751
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
185 :749
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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
185 :809
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Move Insert 11/10000 · 11
:598 :598
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — h|500k updates, 4.5M lookups + skew=0.01 h|500k updates, 4.5M lookups + skew=0.5 h|500k updates, 4.5M lookups + skew=0.99 |=== 126/10000 · 126
186 :275
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Remove a `try..catch` to support compiling without exceptions. 62/10000 · 62
186 :813
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Copy Insert 11/10000 · 11
186 :768
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(const value_type& obj); ``` 67/10000 · 67
186 :773
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(const value_type& obj); ``` 67/10000 · 67
186 :902
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invokes `f` with references to each of the elements in the table. Such references are const iff `*this` is const. Execution is parallelized according to the semantics of the execution policy specified. 201/10000 · 201
:878 :878
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:820 :820
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
186 :758
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/CopyInsertable[CopyInsertable^]. 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
186 :847
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — 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. 417/10000 · 417
186 :824
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(const value_type& obj); std::pair<iterator, bool> insert(const init_type& obj); ``` 123/10000 · 123
186 :752
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ std::pair<iterator, bool> insert(value_type&& obj); ``` 62/10000 · 62