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

308 :1313
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F1, class F2> insert_return_type insert_and_visit(node_type&& nh, F1 f1, F2 f2); template<class F1, class F2> insert_return_type insert_and_cvisit(node_type&& nh, F1 f1, F2 f2); ``` 203/10000 · 203
:1353 :1353
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<Key>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) 133/10000 · 133
308 :1240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class F> size_type erase_if(F f); ``` 53/10000 · 53
308 :1134
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` key_equal key_eq() const; ``` 33/10000 · 33
308 :1230
	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, and then invokes `f1` with a const reference to the newly created element. Otherwise, invokes `f2` with a const reference to the equivalent element. 298/10000 · 298
:1236 :1236
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
308 :1120
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — rehash 6/10000 · 6
308 :1141
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ``` 123/10000 · 123
308 :1214
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
309 :1253
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Erase Range 11/10000 · 11
309 :1172
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` key_equal key_eq() const; ``` 33/10000 · 33
309 :1140
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — contains 8/10000 · 8
309 :1320
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `nh` is empty, does nothing. Otherwise, inserts the associated element in the table if and only if there is no element in the table with a key equivalent to `nh.key()`, and then invokes `f1` with a non-const reference to the newly inserted element. Otherwise, invokes `f2` with a reference to the equivalent element; such reference is const iff `insert_or_cvisit` is used. 375/10000 · 375
:1358 :1358
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — value_type(std::piecewise_construct, std::forward_as_tuple(std::forward<K>(k)), std::forward_as_tuple(std::forward<Args>(args)...)) ``` 135/10000 · 135
309 :1244
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Successively invokes `f` with references to each of the elements in the table, and erases those for which `f` returns `true`. 125/10000 · 125
309 :1139
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The container's key equality predicate 49/10000 · 49
:1235 :1235
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `value_type` is https://en.cppreference.com/w/cpp/named_req/EmplaceConstructible[EmplaceConstructible^] from `k`. Returns:;; `true` if an insert took place. Concurrency:;; Blocking on rehashing of `*this`. Notes:;; These overloads only participate 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. 566/10000 · 566
309 :1238
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — clear 5/10000 · 5
309 :1121
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void rehash(size_type n); ``` 36/10000 · 36
309 :1148
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; A boolean indicating whether or not there is an element with key equal to `key` in the container Notes:;; The `template<class K>` 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. 474/10000 · 474