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

:1711 :1711
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
:1713 :1713
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
459 :1715
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — operator! 9/10000 · 9
460 :1716
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> bool operator!=(const unordered_map<Key, T, Hash, Pred, Alloc>& x, const unordered_map<Key, T, Hash, Pred, Alloc>& y); ``` 195/10000 · 195
461 :1722
	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
:1725 :1725
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Notes:;; Behavior is undefined if the two containers don't have equivalent equality predicates. 95/10000 · 95
463 :1727
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swap 4/10000 · 4
464 :1728
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class Key, class T, class Hash, class Pred, class Alloc> void swap(unordered_map<Key, T, Hash, Pred, Alloc>& x, unordered_map<Key, T, Hash, Pred, Alloc>& y) noexcept(noexcept(x.swap(y))); ``` 207/10000 · 207
465 :1735
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Swaps the contents of `x` and `y`. 34/10000 · 34
:1737 :1737
	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
467 :1740
	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
:1744 :1744
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — --- 3/10000 · 3
469 :1746
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — erase_if 8/10000 · 8
470 :1747
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ```c++ template<class K, class T, class H, class P, class A, class Predicate> typename unordered_map<K, T, H, P, A>::size_type erase_if(unordered_map<K, T, H, P, A>& c, Predicate pred); ``` 189/10000 · 189
471 :1753
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Traverses the container `c` and removes all elements for which the supplied predicate returns `true`. 101/10000 · 101
472 :1756
	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
473 :1773
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Serialization 13/10000 · 13
474 :1775
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — ``unordered_map``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
475 :1779
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saving an unordered_map to an archive 37/10000 · 37
476 :1781
	English ↹ ↵ NBS … “ ” ‘ ’ ﹙-﹚ ‐ – — Saves all the elements of an `unordered_map` `x` to an archive (XML archive) `ar`. 82/10000 · 82