Difference between revisions of "cpp/algorithm/swap"
m (complexity for array swap not constant) |
m (r2.7.3) (Robot: Adding de, fr, it, ja, pt, zh) |
||
| Line 103: | Line 103: | ||
{{dcl list end}} | {{dcl list end}} | ||
| + | [[de:cpp/algorithm/swap]] | ||
[[es:cpp/algorithm/swap]] | [[es:cpp/algorithm/swap]] | ||
| + | [[fr:cpp/algorithm/swap]] | ||
| + | [[it:cpp/algorithm/swap]] | ||
| + | [[ja:cpp/algorithm/swap]] | ||
| + | [[pt:cpp/algorithm/swap]] | ||
[[ru:cpp/algorithm/swap]] | [[ru:cpp/algorithm/swap]] | ||
| + | [[zh:cpp/algorithm/swap]] | ||
Revision as of 17:21, 2 November 2012
Template:ddcl list begin <tr class="t-dsc-header">
<td> </td><td></td>
<td>(since C++11)
</tr> <tr class="t-dcl ">
<td >void swap( T& a, T& b );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >void swap( T2 (&a)[N], T2 (&b)[N]);
<td > (2) </td> <td > (since C++11) </td> </tr> Template:ddcl list end
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 | ||
-T must meet the requirements of MoveAssignable and MoveConstructible.
| ||
-T2 must meet the requirements of Swappable.
| ||
Return value
(none)
Exceptions
1) std::is_nothrow_move_constructible<T>::value &&
std::is_nothrow_move_assignable<T>::value
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
| This section is incomplete Reason: no example |
