table of contents
std::swap(std::array)(3) | C++ Standard Libary | std::swap(std::array)(3) |
NAME¶
std::swap(std::array) - std::swap(std::array)
Synopsis¶
Defined in header <array>
template< class T, std::size_t N >
(since C++11)
void swap( std::array<T, N>& lhs, (until C++17)
std::array<T, N>& rhs );
template< class T, std::size_t N >
void swap( std::array<T, N>& lhs, (since C++17)
std::array<T, N>& rhs ) (constexpr since C++20)
noexcept(/* see below */);
Specializes the std::swap algorithm for std::array. Swaps the contents of lhs
and
rhs. Calls lhs.swap(rhs).
This overload participates in overload resolution only if N == 0 or (since
C++17)
std::is_swappable_v<T> is true.
Parameters¶
lhs, rhs - containers whose contents to swap
Return value¶
(none)
Complexity¶
Linear in size of the container.
Exceptions¶
noexcept specification: (since C++17)
noexcept(noexcept(lhs.swap(rhs)))
Example¶
// Run this code
#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 = [](const int& n) { std::cout << ' ' << n; };
// Print state before swap
std::cout << "Alice:";
std::for_each(alice.begin(), alice.end(), print);
std::cout << "\n" "Bob :";
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 << "\n" "Bob :";
std::for_each(bob.begin(), bob.end(), print);
std::cout << '\n';
}
Output:¶
Alice: 1 2 3
Bob : 7 8 9
-- SWAP
Alice: 7 8 9
Bob : 1 2 3
See also¶
swap swaps the contents
(public member function)
Category:¶
* conditionally noexcept
2024.06.10 | http://cppreference.com |