std::swap(std::unordered_multiset) - cppreference.com (original) (raw)

| Defined in header <unordered_set> | | | | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | | ------------------------------------- | | template< class Key, class Hash, class KeyEqual, class Alloc > void swap( std::unordered_multiset<Key, Hash, KeyEqual, Alloc>& lhs, std::unordered_multiset<Key, Hash, KeyEqual, Alloc>& rhs ); | | (since C++11) (until C++17) | | template< class Key, class Hash, class KeyEqual, class Alloc > void swap( std::unordered_multiset<Key, Hash, KeyEqual, Alloc>& lhs, std::unordered_multiset<Key, Hash, KeyEqual, Alloc>& rhs ) noexcept(/* see below */); | | (since C++17) (constexpr since C++26) |

Specializes the std::swap algorithm for std::unordered_multiset. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs).

[edit] Parameters

lhs, rhs - containers whose contents to swap

[edit] Complexity

Constant.

Exceptions

noexcept specification: noexcept(noexcept(lhs.swap(rhs))) (since C++17)

[edit] Example

#include #include #include   int main() { std::unordered_multiset alice{1, 2, 3}; std::unordered_multiset 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) [edit] | | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |