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

411 :1551
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equality Comparisons 20/10000 · 20
411 :1456
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saving an iterator/const_iterator to an archive 47/10000 · 47
411 :1552
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator. 141/10000 · 141
412 :1569
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_local_iterator cbegin(size_type n) const; ``` 58/10000 · 58
412 :1482
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traverses the container `c` and removes all elements for which the supplied predicate returns `true`. 101/10000 · 101
412 :1665
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The table's key equality predicate. 46/10000 · 46
412 :1665
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to `a.rehash(ceil(n / a.max_load_factor()))`. 56/10000 · 56
412 :1544
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns `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). 186/10000 · 186
412 :1459
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Effects:;; `x.swap(y)` Throws:;; Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of `key_equal` or `hasher`. Notes:;; The exception specifications aren't quite the same as the C++11 standard, as the equality predicate and hash function are swapped using their copy constructors. 329/10000 · 329
412 :1543
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Set max_load_factor 19/10000 · 19
412 :1553
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — operator 8/10000 · 8
412 :1458
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saves the positional information of an `iterator` (`const_iterator`) `it` to an archive (XML archive) `ar`. `it` can be and `end()` iterator. 141/10000 · 141
412 :1556
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; The `unordered_flat_map` `x` pointed to by `it` has been previously saved to `ar`, and no modifying operations have been issued on `x` between saving of `x` and saving of `it`. 188/10000 · 188
413 :1574
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the first element in the bucket with index `n`. 154/10000 · 154
413 :1485
	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
:1667 :1667
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
413 :1667
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Similar to `rehash`, this function can be used to grow or shrink the number of buckets in the table. 100/10000 · 100
:1547 :1547
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Concurrency:;; Blocking on `x` and `y`. Notes:;; Behavior is undefined if the two tables don't have equivalent equality predicates. 131/10000 · 131
:1463 :1463
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
413 :1544
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ void max_load_factor(float z); ``` 41/10000 · 41