Difference between revisions of "cpp/algorithm/swap"
From cppreference.com
m (+syncbuf) |
(P0879) |
||
Line 7: | Line 7: | ||
void swap( T& a, T& b ); | void swap( T& a, T& b ); | ||
|dcl2= | |dcl2= | ||
+ | template< class T > | ||
+ | void swap( T& a, T& b ) noexcept(/* see below */); | ||
+ | |since3=c++20|dcl3= | ||
template< class T > | template< class T > | ||
void swap( T& a, T& b ) noexcept(/* see below */); | void swap( T& a, T& b ) noexcept(/* see below */); | ||
}} | }} | ||
− | {{dcl | num=2 | | + | {{dcl rev multi | num=2 | since1=c++11 | until1=c++20 |dcl1= |
+ | |||
template< class T2, std::size_t N > | template< class T2, std::size_t N > | ||
void swap( T2 (&a)[N], T2 (&b)[N]) noexcept(/* see below */); | void swap( T2 (&a)[N], T2 (&b)[N]) noexcept(/* see below */); | ||
+ | |||
+ | |dcl2= | ||
+ | template< class T2, std::size_t N > | ||
+ | constexpr void swap( T2 (&a)[N], T2 (&b)[N]) noexcept(/* see below */); | ||
}} | }} | ||
{{dcl end}} | {{dcl end}} |
Revision as of 11:14, 9 June 2018
(until C++11) (since C++11) |
||
(1) | ||
template< class T > void swap( T& a, T& b ); |
(until C++11) | |
template< class T > void swap( T& a, T& b ) noexcept(/* see below */); |
(since C++11) (until C++20) |
|
template< class T > void swap( T& a, T& b ) noexcept(/* see below */); |
(since C++20) | |
(2) | ||
template< class T2, std::size_t N > void swap( T2 (&a)[N], T2 (&b)[N]) noexcept(/* see below */); |
(since C++11) (until C++20) |
|
template< class T2, std::size_t N > constexpr void swap( T2 (&a)[N], T2 (&b)[N]) noexcept(/* see below */); |
(since C++20) | |
Exchanges the given values.
1) Swaps the values
a
and b
. This overload does not participate in overload resolution unless std::is_move_constructible_v<T> && std::is_move_assignable_v<T> is true.(since C++17)2) Swaps the arrays
a
and b
. In effect calls std::swap_ranges(a, a+N, b). This overload does not participate in overload resolution unless std::is_swappable_v<T2> is true.(since C++17)Contents |
Parameters
a, b | - | the values to be swapped |
Type requirements |
Return value
(none)
Exceptions
1)
(none) | (until C++11) |
noexcept specification:
noexcept( std::is_nothrow_move_constructible<T>::value && |
(since C++11) |
2)
noexcept specification:
The lookup for the identifier noexcept(noexcept(swap(*a, *b))) swap in the exception specification finds this function template in addition to anything found by the usual lookup rules, making the exception specification equivalent to C++17 std::is_nothrow_swappable. |
(until C++17) |
noexcept specification:
noexcept(std::is_nothrow_swappable_v<T2>) |
(since C++17) |
Complexity
1) Constant
2) Linear in N
Specializations
std::swap may be specialized in namespace std for user-defined types, but such specializations are not found by ADL (the namespace std is not the associated namespace for the user-defined type). The expected way to make a user-defined type swappable is to provide a non-member function swap in the same namespace as the type: see Template:concept for details.
The following overloads are already provided by the standard library:
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
specializes the std::swap algorithm (function template) | |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
({{{1}}}) |
specializes the std::swap algorithm (function) |
(C++11) |
specializes the std::swap algorithm (function template) |
(C++11) |
specializes the std::swap algorithm (function template) |
specializes the std::swap algorithm (function template) | |
(C++17) |
specializes the std::swap algorithm (function template) |
(C++17) |
specializes the std::swap algorithm (function) |
(C++17) |
specializes the std::swap algorithm (function template) |
(C++17) |
specializes the std::swap algorithm (function) |
Example
Run this code
Output:
5 3 3 5
Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 2554 | C++11 | swapping multi-dimensional arrays can never be noexcept due to name lookup problems
|
made to work |
See also
swaps the elements pointed to by two iterators (function template) | |
swaps two ranges of elements (function template) |