2. Boost Unordered Translation (zh_Hans)
3. Doc / Modules / Root / Pages / Reference / Unordered Set (adoc)
4. English
5. Zen

396 :1435
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Return `true` 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). 184/10000 · 184
:1438 :1438
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
:1440 :1440
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
399 :1442
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — operator! 9/10000 · 9
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
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
:1452 :1452
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
:1454 :1454
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
404 :1456
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swap 4/10000 · 4
405 :1457
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class Hash, class Pred, class Alloc> void swap(unordered_set<Key, Hash, Pred, Alloc>& x, unordered_set<Key, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ``` 192/10000 · 192
406 :1464
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swaps the contents of `x` and `y`. 34/10000 · 34
:1466 :1466
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — If `Allocator::propagate_on_container_swap` is declared and `Allocator::propagate_on_container_swap::value` is `true` then the containers' allocators are swapped. Otherwise, swapping with unequal allocators results in undefined behavior. 237/10000 · 237
408 :1469
	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
:1473 :1473
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
410 :1475
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — erase_if 8/10000 · 8
411 :1476
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K, class H, class P, class A, class Predicate> typename unordered_set<K, H, P, A>::size_type erase_if(unordered_set<K, H, P, A>& c, Predicate pred); ``` 174/10000 · 174
412 :1482
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traverses the container `c` and removes all elements for which the supplied predicate returns `true`. 101/10000 · 101
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
414 :1500
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Serialization 13/10000 · 13
415 :1502
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``unordered_set``s can be archived/retrieved by means of link:../../../../../serialization/index.html[Boost.Serialization^] using the API provided by this library. Both regular and XML archives are supported. 208/10000 · 208