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

175 :716
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); ``` 98/10000 · 98
:718 :718
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
175 :769
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> iterator emplace_hint(const_iterator position, Args&&... args); ``` 98/10000 · 98
176 :557
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — image::benchmarks-concurrent_map/vs-x64/Parallel workload.xlsx.500k, 0.99.png[width=250,window=_blank,link="_images/benchmarks-concurrent_map/vs-x64/Parallel workload.xlsx.500k, 0.99.png"] 188/10000 · 188
176 :261
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Release 1.52.0 14/10000 · 14
176 :770
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args> std::pair<iterator, bool> emplace(Args&&... args); ``` 85/10000 · 85
:732 :732
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent value. 152/10000 · 152
:741 :741
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
176 :858
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Although functionally equivalent to individually invoking xref:concurrent_node_map_cvisit[`[c\]visit`] for each key, bulk visitation performs generally faster due to internal streamlining optimizations. It is advisable that `std::distance(first,last)` be at least xref:#concurrent_node_map_constants[`bulk_visit_size`] to enjoy a performance gain: beyond this size, performance is not expected to increase further. 414/10000 · 414
:840 :840
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:783 :783
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:727 :727
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
176 :809
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `FwdIterator` is a https://en.cppreference.com/w/cpp/named_req/ForwardIterator[LegacyForwardIterator^] ({cpp}11 to {cpp}17), or satisfies https://en.cppreference.com/w/cpp/iterator/forward_iterator[std::forward_iterator^] ({cpp}20 and later). For `K` = `std::iterator_traits<FwdIterator>::value_type`, either `K` is `key_type` or else `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. In the latter case, 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. Returns:;; The number of elements visited. 690/10000 · 690
:788 :788
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
:720 :720
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
176 :720
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — emplace_hint 12/10000 · 12
:773 :773
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150
:563 :563
	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
177 :263
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Faster assign, which assigns to existing nodes where possible, rather than 74/10000 · 74
:774 :774
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Inserts an object, constructed with the arguments `args`, in the container if and only if there is no element in the container with an equivalent key. 150/10000 · 150