std::swap

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Algorithm library

Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
is_execution_policy (C++17)   execution::seqexecution::parexecution::par_unseqexecution::unseq (C++17)    (C++17)(C++17)(C++20)	execution::sequenced_policyexecution::parallel_policyexecution::parallel_unsequenced_policyexecution::parallel_unsequenced (C++17)(C++17)(C++17)(C++20)
Non-modifying sequence operations Batch operations for_each for_each_n (C++17) Search operations all_ofany_ofnone_of (C++11)                (C++11)(C++11) countcount_if mismatch equal findfind_iffind_if_not (C++11) find_end find_first_of adjacent_find search search_n Modifying sequence operations Copy operations copycopy_if (C++11) copy_backward copy_n (C++11) move (C++11) move_backward (C++11) Swap operations swap iter_swap swap_ranges Transformation operations replacereplace_if transform replace_copyreplace_copy_if Generation operations fill fill_n generate generate_n Removing operations removeremove_if unique remove_copyremove_copy_if unique_copy Order-changing operations reverse reverse_copy rotate rotate_copy random_shuffleshuffle (until C++17)(C++11) shift_leftshift_right (C++20)(C++20) Sampling operations sample (C++17)	Sorting and related operations Partitioning operations partition partition_copy (C++11)   stable_partition is_partitioned (C++11) partition_point (C++11) Sorting operations sort stable_sort partial_sort partial_sort_copy is_sorted (C++11) is_sorted_until (C++11) nth_element Binary search operations (on partitioned ranges) lower_bound upper_bound equal_range binary_search Set operations (on sorted ranges) includes set_union set_intersection set_difference set_symmetric_difference Merge operations (on sorted ranges) merge inplace_merge Heap operations push_heap pop_heap make_heap sort_heap is_heap (C++11) is_heap_until (C++11) Minimum/maximum operations max min minmax (C++11) clamp (C++17) max_element min_element minmax_element (C++11) Lexicographical comparison operations lexicographical_compare lexicographical_compare_three_way (C++20) Permutation operations next_permutation prev_permutation is_permutation (C++11) C library qsort bsearch
Numeric operations
iota (C++11) inner_product adjacent_difference    accumulate reduce (C++17) transform_reduce (C++17)	partial_sum inclusive_scan (C++17)    exclusive_scan (C++17) transform_inclusive_scan (C++17) transform_exclusive_scan (C++17)
Operations on uninitialized memory
uninitialized_copy uninitialized_move (C++17)    uninitialized_fill uninitialized_copy_n (C++11) uninitialized_move_n (C++17) uninitialized_fill_n	destroy (C++17) destroy_n (C++17) destroy_at (C++17) construct_at (C++20)       uninitialized_default_construct (C++17) uninitialized_value_construct (C++17) uninitialized_default_construct_n (C++17) uninitialized_value_construct_n (C++17)

 

Defined in header <algorithm> Defined in header <utility>		(until C++11) (since C++11)
template< class T > void swap( T& a, T& b );	(1)
template< class T2, size_t N > void swap( T2 (&a)[N], T2 (&b)[N]);	(2)	(since C++11)

Exchanges the given values.

1) Swaps the values a and b.

2) Swaps the arrays a and b. In effect calls std::swap_ranges(a, a+N, b).

Parameters

a, b	-	the values to be swapped
Type requirements

Return value

(none)

Exceptions

1)

noexcept specification:  

noexcept(noexcept(

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

))

2)

noexcept specification:  

noexcept(noexcept(swap(*a, *b)))

Complexity

1) Constant

2) Linear in N

Specializations

Both custom specializations and overloads of the std::swap algorithm are allowed, but the overloads are generally preferred since specializations of a function template aren't allowed for template classes. Library functions always use the user-provided overloads when swapping, if they are found by argument-dependent lookup (as per Template:concept concept).

The following overloads are already provided by the standard library:

std::swap(std::pair) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::tuple) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::shared_ptr) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::weak_ptr) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::unique_ptr) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::function) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_string)	specializes the std::swap algorithm (function template)
std::swap(std::array) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::deque)	specializes the std::swap algorithm (function template)
std::swap(std::forward_list) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::list)	specializes the std::swap algorithm (function template)
std::swap(std::vector)	specializes the std::swap algorithm (function template)
std::swap(std::map)	specializes the std::swap algorithm (function template)
std::swap(std::multimap)	specializes the std::swap algorithm (function template)
std::swap(std::set)	specializes the std::swap algorithm (function template)
std::swap(std::multiset)	specializes the std::swap algorithm (function template)
std::swap(std::unordered_map) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::unordered_multimap) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::unordered_set) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::unordered_multiset) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::queue) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::priority_queue) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::stack) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::valarray) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_stringbuf) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_istringstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_ostringstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_stringstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_filebuf) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_ifstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_ofstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_fstream) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::basic_regex) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::match_results) (C++11)	specializes the std::swap algorithm (function template)
swap(std::) ({{{1}}})	specializes the std::swap algorithm (function)
std::swap(std::unique_lock) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::promise) (C++11)	specializes the std::swap algorithm (function template)
std::swap(std::packaged_task) (C++11)	specializes the std::swap algorithm (function template)

Example

Run this code

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

Output:

5 3
3 5

See also

iter_swap	swaps the elements pointed to by two iterators (function template)
swap_ranges	swaps two ranges of elements (function template)