Difference between revisions of "cpp/algorithm/swap"
From cppreference.com
(minor formatting) |
m (Shorten template names. Use {{lc}} where appropriate.) |
||
Line 1: | Line 1: | ||
{{cpp/title|swap}} | {{cpp/title|swap}} | ||
{{cpp/algorithm/navbar}} | {{cpp/algorithm/navbar}} | ||
− | {{ | + | {{dcl begin}} |
− | {{ | + | {{dcl header | algorithm | utility | notes={{mark until c++11}}<br>{{mark since c++11}}}} |
− | {{ | + | {{dcl | num=1 | |
template< class T > | template< class T > | ||
void swap( T& a, T& b ); | void swap( T& a, T& b ); | ||
}} | }} | ||
− | {{ | + | {{dcl | num=2 | notes={{mark since c++11}} | |
template< class T2, size_t N > | template< class T2, size_t N > | ||
void swap( T2 (&a)[N], T2 (&b)[N]); | void swap( T2 (&a)[N], T2 (&b)[N]); | ||
}} | }} | ||
− | {{ | + | {{dcl end}} |
Exchanges the given values. | Exchanges the given values. | ||
Line 20: | Line 20: | ||
===Parameters=== | ===Parameters=== | ||
− | {{ | + | {{par begin}} |
− | {{ | + | {{par | a, b | the values to be swapped}} |
− | {{ | + | {{par hreq}} |
− | {{ | + | {{par req concept | T | MoveConstructible | MoveAssignable}} |
− | {{ | + | {{par req concept | T2 | Swappable }} |
− | {{ | + | {{par end}} |
===Return value=== | ===Return value=== | ||
Line 45: | Line 45: | ||
===Specializations=== | ===Specializations=== | ||
− | Both custom specializations and overloads of the {{ | + | Both custom specializations and overloads of the {{lc|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 {{concept|Swappable}} concept). |
The following overloads are already provided by the standard library: | The following overloads are already provided by the standard library: | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/utility/pair/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/utility/tuple/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/memory/shared_ptr/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/memory/weak_ptr/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/memory/unique_ptr/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/utility/functional/function/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/string/basic_string/dcl list swap2}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | array}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | deque}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | forward_list}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | list}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | vector}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | multimap}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | multiset}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | unordered_map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | unordered_multimap}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | unordered_set}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | unordered_multiset}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | queue}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | priority_queue}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | stack}} |
− | {{ | + | {{dsc tfun | cpp/numeric/valarray/swap2 | title=std::swap{{dsc small|(std::valarray)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/io/basic_stringbuf/swap2 | title=std::swap{{dsc small|(std::basic_stringbuf)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/io/basic_istringstream/swap2 | title=std::swap{{dsc small|(std::basic_istringstream)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/io/basic_ostringstream/swap2 | title=std::swap{{dsc small|(std::basic_ostringstream)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/io/basic_stringstream/swap2 | title=std::swap{{dsc small|(std::basic_stringstream)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/io/basic_filebuf/swap2 | title=std::swap{{dsc small|(std::basic_filebuf)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc inc | cpp/io/basic_fstream/dcl list swap2 | basic_ifstream}} |
− | {{ | + | {{dsc inc | cpp/io/basic_fstream/dcl list swap2 | basic_ofstream}} |
− | {{ | + | {{dsc inc | cpp/io/basic_fstream/dcl list swap2 | basic_fstream}} |
− | {{ | + | {{dsc tfun | cpp/regex/basic_regex/swap2 | title=std::swap{{dsc small|(std::basic_regex)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/regex/match_results/swap2 | title=std::swap{{dsc small|(std::match_results)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc inc | cpp/thread/thread/dcl list swap2}} |
− | {{ | + | {{dsc tfun | cpp/thread/unique_lock/swap2 | title=std::swap{{dsc small|(std::unique_lock)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/thread/promise/swap2 | title=std::swap{{dsc small|(std::promise)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc tfun | cpp/thread/packaged_task/swap2 | title=std::swap{{dsc small|(std::packaged_task)}} | specializes the {{cpp/ltf|cpp/algorithm/swap}} algorithm| notes={{mark c++11}}}} |
− | {{ | + | {{dsc end}} |
===Example=== | ===Example=== | ||
Line 115: | Line 115: | ||
===See also=== | ===See also=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/algorithm/dcl list iter_swap}} |
− | {{ | + | {{dsc inc | cpp/algorithm/dcl list swap_ranges}} |
− | {{ | + | {{dsc end}} |
[[de:cpp/algorithm/swap]] | [[de:cpp/algorithm/swap]] |
Revision as of 17:49, 31 May 2013
(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).
Contents |
Parameters
a, b | - | the values to be swapped |
Type requirements |
Return value
(none)
Exceptions
1)noexcept specification:
2) noexcept(noexcept(
std::is_nothrow_move_constructible<T>::value &&
std::is_nothrow_move_assignable<T>::value
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:
Example
Run this code
Output:
5 3 3 5