The Wayback Machine - https://web.archive.org/web/20210621011338/https://en.cppreference.com/w/cpp/algorithm/swap
Namespaces
Variants
Actions

std::swap

From cppreference.com
< cpp‎ | algorithm
 
 
Algorithm library
Constrained algorithms and algorithms on ranges(C++20)
Constrained algorithms: std::ranges::copy, std::ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
(C++11)(C++11)(C++11)
(C++17)
Modifying sequence operations
Operations on uninitialized storage
Partitioning operations
Sorting operations
Binary search operations
Set operations (on sorted ranges)
Heap operations
(C++11)
Minimum/maximum operations
(C++11)
(C++17)

Permutations
Numeric operations
C library
 
Defined in header <algorithm>
(until C++11)
Defined in header <utility>
(since C++11)
Defined in header <string_view>
(since C++17)
(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 >
constexprvoid 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 >
constexprvoid 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

[edit]Parameters

a, b - the values to be swapped
Type requirements
-
T must meet the requirements of MoveAssignable and MoveConstructible.
-
T2 must meet the requirements of Swappable.

[edit]Return value

(none)

[edit]Exceptions

1)

(none)

(until C++11)
noexcept specification:  
noexcept(

    std::is_nothrow_move_constructible<T>::value&&
    std::is_nothrow_move_assignable<T>::value

)
(since C++11)
2)
noexcept specification:  
noexcept(noexcept(swap(*a, *b)))
The lookup for the identifier 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.
(since C++11)
(until C++17)
noexcept specification:  
(since C++17)

[edit]Complexity

1) Constant
2) Linear in N

[edit]Specializations

std::swap may be specialized in namespace std for program-defined types, but such specializations are not found by ADL (the namespace std is not the associated namespace for the program-defined type).

(until C++20)

The expected way to make a program-defined type swappable is to provide a non-member function swap in the same namespace as the type: see Swappable for details.

The following overloads are already provided by the standard library:

specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function)[edit]
specialization of std::swap for unique_lock
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function template)[edit]
specializes the std::swap algorithm
(function)[edit]
specializes the std::swap algorithm
(function template)[edit]
swaps two paths
(function)[edit]

[edit]Example

#include <algorithm>#include <iostream>   int main(){int a =5, b =3;   // beforestd::cout<< a <<' '<< b <<'\n';   std::swap(a,b);   // afterstd::cout<< a <<' '<< b <<'\n';}

Output:

5 3 3 5

[edit] 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

[edit]See also

swaps the elements pointed to by two iterators
(function template)[edit]
swaps two ranges of elements
(function template)[edit]
(C++14)
replaces the argument with a new value and returns its previous value
(function template)[edit]
close