Difference between revisions of "cpp/container/unordered set/swap2"
From cppreference.com
< cpp | container | unordered set
m (Add link to edit the included template) |
m (langlinks) |
||
| (2 intermediate revisions by one user not shown) | |||
| Line 1: | Line 1: | ||
| − | {{page | + | {{include page|cpp/container/swap2|unordered_set}} |
| + | |||
| + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | ||
Latest revision as of 07:34, 4 December 2021
| Defined in header <unordered_set>
|
||
template< class Key, class Hash, class KeyEqual, class Alloc > void swap( std::unordered_set<Key, Hash, KeyEqual, Alloc>& lhs, |
(since C++11) (until C++17) |
|
| template< class Key, class Hash, class KeyEqual, class Alloc > void swap( std::unordered_set<Key, Hash, KeyEqual, Alloc>& lhs, |
(since C++17) | |
Specializes the std::swap algorithm for std::unordered_set. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).
Contents |
[edit] Parameters
| lhs, rhs | - | containers whose contents to swap |
[edit] Return value
(none)
[edit] Complexity
Constant.
Exceptions
|
noexcept specification:
noexcept(noexcept(lhs.swap(rhs))) |
(since C++17) |
[edit] Example
Run this code
#include <algorithm> #include <iostream> #include <unordered_set> int main() { std::unordered_set<int> alice{1, 2, 3}; std::unordered_set<int> bob{7, 8, 9, 10}; auto print = [](const int& n) { std::cout << ' ' << n; }; // Print state before swap std::cout << "Alice:"; std::for_each(alice.begin(), alice.end(), print); std::cout << "\nBobby:"; std::for_each(bob.begin(), bob.end(), print); std::cout << '\n'; std::cout << "-- SWAP\n"; std::swap(alice, bob); // Print state after swap std::cout << "Alice:"; std::for_each(alice.begin(), alice.end(), print); std::cout << "\nBobby:"; std::for_each(bob.begin(), bob.end(), print); std::cout << '\n'; }
Possible output:
Alice: 1 2 3 Bobby: 7 8 9 10 -- SWAP Alice: 7 8 9 10 Bobby: 1 2 3
[edit] See also
| swaps the contents (public member function) |
