(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 |
Member types | ||||||||||||||||||||||||||
Member functions | ||||||||||||||||||||||||||
Non-member functions | ||||||||||||||||||||||||||
|
| |||||||||||||||||||||||||
Helper classes | ||||||||||||||||||||||||||
Deduction guides(C++17) |
Defined in header <array> | ||
template<class T,std::size_t N> void swap(std::array<T, N>& lhs, | (since C++11) (until C++17) | |
template<class T,std::size_t N> void swap(std::array<T, N>& lhs, | (since C++17) (constexpr since C++20) | |
This overload participates in overload resolution only ifN==0 orstd::is_swappable_v<T> istrue. | (since C++17) |
Contents |
lhs, rhs | - | containers whose contents to swap |
Linear in size of the containers.
noexcept specification: noexcept(noexcept(lhs.swap(rhs))) | (since C++17) |
#include <algorithm>#include <iostream>#include <array> int main(){std::array<int,3> alice{1,2,3};std::array<int,3> bob{7,8,9}; 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';}
Output:
Alice: 1 2 3Bobby: 7 8 9-- SWAPAlice: 7 8 9Bobby: 1 2 3
swaps the contents (public member function)[edit] |