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

400 :1531
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket(const key_type& k) const; template<class K> size_type bucket(const K& k) const; ``` 107/10000 · 107
400 :1443
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class Hash, class Pred, class Alloc> bool operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, const unordered_set<Key, Hash, Pred, Alloc>& y); ``` 180/10000 · 180
:1416 :1416
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1635 :1635
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
400 :1628
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — max_load 8/10000 · 8
400 :1501
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — A deduction guide will not participate in overload resolution if any of the following are true: 95/10000 · 95
400 :1425
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `true` if `x.size() == y.size()` and for every equivalent key group in `x`, there is a group in `y` for the same key, which is a permutation (using `operator==` to compare the value types). 196/10000 · 196
400 :1511
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type bucket_count() const noexcept; ``` 51/10000 · 51
400 :1496
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void reset_stats() noexcept; ``` 39/10000 · 39
400 :1407
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of erased elements. Notes:;; Equivalent to: + + ```c++ auto original_size = c.size(); for (auto i = c.begin(), last = c.end(); i != last; ) { if (pred(*i)) { i = c.erase(i); } else { ++i; } } return original_size - c.size(); ``` 250/10000 · 250
400 :1520
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Serialization 13/10000 · 13
401 :1537
	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
401 :1449
	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
401 :1418
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Loading an iterator/const_iterator from an archive 50/10000 · 50
401 :1637
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Observers 9/10000 · 9
401 :1630
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type max_load() const noexcept; ``` 47/10000 · 47
401 :1503
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — - It has an `InputIterator` template parameter and a type that does not qualify as an input iterator is deduced for that parameter. - It has an `Allocator` template parameter and a type that does not qualify as an allocator is deduced for that parameter. - It has a `Hash` template parameter and an integral type or a type that qualifies as an allocator is deduced for that parameter. - It has a `Pred` template parameter and a type that qualifies as an allocator is deduced for that parameter. 494/10000 · 494
:1428 :1428
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
401 :1516
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The size of the bucket array. 40/10000 · 40
401 :1501
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Effects:;; Sets to zero the internal statistics kept by the container. Notes:;; Only available if xref:reference/stats.adoc#stats[statistics calculation] is xref:unordered_node_map_boost_unordered_enable_stats[enabled]. 219/10000 · 219