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

197 :288
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — {svn-ticket-url}/6190[Ticket 6190^]: 36/10000 · 36
197 :852
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class P> std::pair<iterator, bool> insert(P&& obj); ``` 71/10000 · 71
:810 :810
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key. 149/10000 · 149
:811 :811
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element constructed from `std::forward<K>(k)` in the container if and only if there is no element in the container with an equivalent key. 149/10000 · 149
197 :946
	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
197 :920
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — size 4/10000 · 4
197 :861
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — size 4/10000 · 4
197 :794
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; An iterator pointing to the inserted element. 56/10000 · 56
:896 :896
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:870 :870
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
:793 :793
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — `hint` is a suggestion to where the element should be inserted. This implementation ignores it. 95/10000 · 95
:794 :794
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:856 :856
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts `obj` in the container if and only if there is no element in the container with an equivalent key. 106/10000 · 106
198 :643
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-concurrent_map/gcc-x86/Parallel workload.xlsx.5M, 0.99.png[width=250,window=_blank,link="_images/benchmarks-concurrent_map/gcc-x86/Parallel workload.xlsx.5M, 0.99.png"] 186/10000 · 186
198 :289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Avoid gcc's `-Wshadow` warning. 31/10000 · 31
198 :856
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an element into the container by performing `emplace(std::forward<P>(value))`. 86/10000 · 86
198 :813
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; The bool component of the return type is true if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. 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. + + This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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. 1080/10000 · 1080
:814 :814
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; The bool component of the return type is true if an insert took place. + + If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent key. 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 to be greater than the maximum load. + + This overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs and neither `iterator` nor `const_iterator` are implicitly convertible from `K`. 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. 993/10000 · 993
:957 :957
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
198 :922
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type size() const noexcept; ``` 43/10000 · 43