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

:1551 :1551
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
:1563 :1563
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
415 :1468
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Loading an iterator/const_iterator from an archive 50/10000 · 50
415 :1564
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Makes an `iterator` (`const_iterator`) `it` point to the restored position of the original `iterator` (`const_iterator`) saved to the storage read by an archive (XML archive) `ar`. 180/10000 · 180
416 :1580
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ const_local_iterator cend(size_type n) const; ``` 56/10000 · 56
416 :1506
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saving an unordered_set to an archive 37/10000 · 37
416 :1672
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ size_type count(const key_type& k) const; template<class K> size_type count(const K& k) const; ``` 117/10000 · 117
:1675 :1675
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
416 :1553
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(concurrent_flat_set<Key, Hash, Pred, Alloc>& x, concurrent_flat_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ``` 204/10000 · 204
416 :1472
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traverses the container `c` and removes all elements for which the supplied predicate returns `true`. 101/10000 · 101
416 :1554
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — max_load 8/10000 · 8
:1565 :1565
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
416 :1470
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Makes an `iterator` (`const_iterator`) `it` point to the restored position of the original `iterator` (`const_iterator`) saved to the storage read by an archive (XML archive) `ar`. 180/10000 · 180
416 :1569
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; If `x` is the `unordered_flat_map` `it` points to, no modifying operations have been issued on `x` between loading of `x` and loading of `it`. 154/10000 · 154
417 :1585
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Requires:;; `n` shall be in the range `[0, bucket_count())`. Returns:;; A constant local iterator pointing the 'one past the end' element in the bucket with index `n`. 167/10000 · 167
417 :1508
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saves all the elements of an `unordered_set` `x` to an archive (XML archive) `ar`. 82/10000 · 82
417 :1679
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Returns:;; The number of elements with key equivalent to `k` (0 or 1). 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. + + In the presence of concurrent insertion operations, the value returned may not accurately reflect the true state of the table right after execution. 590/10000 · 590
417 :1677
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Statistics 10/10000 · 10
:1560 :1560
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Equivalent to [listing,subs="+macros,+quotes"] 46/10000 · 46
417 :1475
	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(); ``` + Note that the references passed to `pred` are non-const. 309/10000 · 309