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

303 :1199
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ iterator find(const key_type& k); const_iterator find(const key_type& k) const; template<class K> iterator find(const K& k); 147/10000 · 147
304 :1238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase by Key 12/10000 · 12
304 :1160
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — hash_function 13/10000 · 13
:1125 :1125
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1301 :1301
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
304 :1324
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — try_emplace_and_[c]visit 24/10000 · 24
304 :1228
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erases the element `x` with key equivalent to `k` if it exists and `f(x)` is `true`. 84/10000 · 84
304 :1124
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` hasher hash_function() const; ``` 37/10000 · 37
:1218 :1218
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/MoveInsertable[MoveInsertable^]. Returns:;; `true` if an insert took place. + Concurrency:;; Blocking on rehashing of `*this`. 198/10000 · 198
:1226 :1226
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
304 :1107
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — max_load 8/10000 · 8
304 :1128
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
304 :1205
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` 3/10000 · 3
305 :1239
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type erase(const key_type& k); template<class K> size_type erase(K&& k); ``` 88/10000 · 88
305 :1161
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` hasher hash_function() const; ``` 37/10000 · 37
305 :1127
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — count 5/10000 · 5
:1308 :1308
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements inserted. 43/10000 · 43
305 :1325
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class... Args, class F1, class F2> bool try_emplace_and_visit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(const key_type& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_visit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class... Args, class F1, class F2> bool try_emplace_and_cvisit(key_type&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_visit(K&& k, Args&&... args, F1&& f1, F2&& f2); template<class K, class... Args, class F1, class F2> bool try_emplace_and_cvisit(K&& k, Args&&... args, F1&& f1, F2&& f2); ``` 747/10000 · 747
305 :1231
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements erased (0 or 1). Throws:;; Only throws an exception if it is thrown by `hasher`, `key_equal` or `f`. Notes:;; The `template<class K, class F>` overload only participates in overload resolution if `std::is_execution_policy_v<std::remove_cvref_t<ExecutionPolicy>>` is `false`. + + The `template<class K, class F>` overload only participates in overload resolution if `Hash::is_transparent` and `Pred::is_transparent` are valid member typedefs. 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. 679/10000 · 679
305 :1129
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The container's hash function. 41/10000 · 41