(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::map| Member functions | |||||||||||||||||||||||||||
| Non-member functions | |||||||||||||||||||||||||||
| |||||||||||||||||||||||||||
| Deduction guides(C++17) | |||||||||||||||||||||||||||
Defined in header <map> | ||
| (until C++17) | ||
| (since C++17) (constexpr since C++26) | ||
Specializes thestd::swap algorithm forstd::map. 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 <map> int main(){std::map<int,char> alice{{1,'a'},{2,'b'},{3,'c'}};std::map<int,char> bob{{7,'Z'},{8,'Y'},{9,'X'},{10,'W'}}; auto print=[](std::pair<constint,char>& n){std::cout<<' '<< n.first<<':'<< n.second;}; // 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';}
Output:
Alice: 1:a 2:b 3:cBobby: 7:Z 8:Y 9:X 10:W-- SWAPAlice: 7:Z 8:Y 9:X 10:WBobby: 1:a 2:b 3:c
| swaps the contents (public member function)[edit] |
