Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/swap"

From cppreference.com
< cpp‎ | algorithm
(format)
(p0185r1)
Line 15: Line 15:
 
Exchanges the given values.
 
Exchanges the given values.
  
@1@ Swaps the values {{tt|a}} and {{tt|b}}.
+
@1@ Swaps the values {{tt|a}} and {{tt|b}}. {{rev inl|since=c++17|This overload does not participate is overload resolution unless {{c|std::is_move_constructible_v<T> && std::is_move_assignable_v<T>}}}}
  
 
@2@ Swaps the arrays {{tt|a}} and {{tt|b}}. In effect calls {{c|std::swap_ranges(a, a+N, b)}}.
 
@2@ Swaps the arrays {{tt|a}} and {{tt|b}}. In effect calls {{c|std::swap_ranges(a, a+N, b)}}.
Line 39: Line 39:
 
}}
 
}}
 
}}{{rev end}}
 
}}{{rev end}}
@2@ {{noexcept|noexcept(swap(*a, *b))}}
+
@2@ {{rev begin}}
 +
{{rev|until=c++17|{{noexcept|noexcept(swap(*a, *b))}}}}
 +
{{rev|since=c++17|{{noexcept|std::is_nothrow_swappable_v<T>}}}}{{rev end}}
  
 
===Complexity===
 
===Complexity===

Revision as of 11:27, 13 March 2016

 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
Non-modifying sequence operations
Batch operations
(C++17)
Search operations
(C++11)                (C++11)(C++11)

Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
swap
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations
C library
Numeric operations
Operations on uninitialized memory
 
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. This overload does not participate is overload resolution unless std::is_move_constructible_v<T> && std::is_move_assignable_v<T>(since C++17)
2) Swaps the arrays a and b. In effect calls std::swap_ranges(a, a+N, b).

Contents

Parameters

a, b - the values to be swapped
Type requirements

Template:par req concept Template:par req concept

Return value

(none)

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)))
(until C++17)
noexcept specification:  
(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:

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]
({{{1}}})
specializes the std::swap algorithm
(function) [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]

Example

#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

swaps the elements pointed to by two iterators
(function template) [edit]
swaps two ranges of elements
(function template) [edit]