(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::unordered_multiset| Member types | ||||||||||||||||
| Member functions | ||||||||||||||||
| Non-member functions | ||||||||||||||||
|
| |||||||||||||||
| Deduction guides(C++17) | ||||||||||||||||
Defined in header <unordered_set> | ||
template<class Key,class Hash,class KeyEqual,class Alloc> void swap(std::unordered_multiset<Key, Hash, KeyEqual, Alloc>& lhs, | (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, | (since C++17) (constexpr since C++26) | |
Specializes thestd::swap algorithm forstd::unordered_multiset. Swaps the contents oflhs andrhs. Callslhs.swap(rhs).
Contents |
| lhs, rhs | - | containers whose contents to swap |
Constant.
noexcept specification: noexcept(noexcept(lhs.swap(rhs))) | (since C++17) |
#include <algorithm>#include <iostream>#include <unordered_set> int main(){std::unordered_multiset<int> alice{1,2,3};std::unordered_multiset<int> bob{7,8,9,10}; auto print=[](constint& n){std::cout<<' '<< n;}; // Print state before swapstd::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 swapstd::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 3Bobby: 7 8 9 10-- SWAPAlice: 7 8 9 10Bobby: 1 2 3
| swaps the contents (public member function)[edit] |
