std::swap(std::array)
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::array
Defined in header
<array>
template< class T, std::size_t N >
(since C++11) void swap( std::array <T, N>& lhs,
(until C++17)
template< class T, std::size_t N >
(since C++17) void swap( std::array <T, N>& lhs,
std::array <T, N>& rhs )
(constexpr since C++20)
This overload participates in overload resolution only if N == 0 or std::is_swappable_v <T> is true.
(since C++17)[edit] Parameters
lhs, rhs
-
containers whose contents to swap
[edit] Complexity
Linear in size of the containers.
Exceptions
noexcept specification:
(since C++17)noexcept(noexcept(lhs.swap(rhs)))
[edit] 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 << "\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'; }
Output:
Alice: 1 2 3 Bobby: 7 8 9 -- SWAP Alice: 7 8 9 Bobby: 1 2 3