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

:1469 :1469
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
343 :1339
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``` key_equal key_eq() const; ``` 33/10000 · 33
343 :1246
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; ``` 107/10000 · 107
343 :1344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements erased. Throws:;; Only throws an exception if it is thrown by `f`. 100/10000 · 100
343 :1331
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ bool contains(const key_type& k) const; template<class K> bool contains(const K& k) const; ``` 123/10000 · 123
343 :1213
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const unordered_flat_set<Key, T, Hash, Pred, Alloc>& x, const unordered_flat_set<Key, T, Hash, Pred, Alloc>& y); ``` 205/10000 · 205
:1249 :1249
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
343 :1328
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Effects:;; Does nothing, as the user is not allowed to change this parameter. Kept for compatibility with `boost::unordered_map`. 129/10000 · 129
344 :1359
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Invalidates iterators belonging to `*this`. 43/10000 · 43
344 :1289
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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. 512/10000 · 512
:1240 :1240
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Throws:;; The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function. 140/10000 · 140
:1461 :1461
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — -- 2/10000 · 2
344 :1471
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — swap 4/10000 · 4
344 :1344
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The table's key equality predicate. 46/10000 · 46
344 :1252
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The index of the bucket which would contain an element with key `k`. Postconditions:;; The return value is less than `bucket_count()`. 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. 512/10000 · 512
:1347 :1347
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
344 :1338
	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
344 :1219
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `false` if `x.size() == y.size()` and for every element in `x`, there is an element in `y` with the same key, with an equal value (using `operator==` to compare the value types). 185/10000 · 185
:1251 :1251
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — cend 4/10000 · 4
:1330 :1330
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3