191 lines
16 KiB
HTML
191 lines
16 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>std::reverse</title>
|
|
<link rel="stylesheet" href="ext.css" />
|
|
<link rel="stylesheet" href="site_modules.css" />
|
|
</head>
|
|
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_algorithm_reverse skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::</span>reverse</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dsc-header">
|
|
<td>
|
|
<div>定义于头文件 <code><a href="cpp-header-algorithm.html"><algorithm></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody class="t-dcl-rev t-dcl-rev-num">
|
|
<tr class="t-dcl-rev-aux">
|
|
<td></td>
|
|
<td rowspan="142">(1)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-until-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> BidirIt <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> reverse<span class="br0">(</span> BidirIt first, BidirIt last <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx20">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> BidirIt <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> reverse<span class="br0">(</span> BidirIt first, BidirIt last <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
|
</tr>
|
|
</tbody>
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> ExecutionPolicy, <span class="kw1">class</span> BidirIt <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> reverse<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy, BidirIt first, BidirIt last <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<div class="t-li1"><span class="t-li">1)</span> 反转 <code>[first, last)</code> 范围中的元素顺序</div>
|
|
<div class="t-li1"><span class="t-li"></span> 表现如同应用 <span class="t-lc"><a href="cpp-algorithm-iter_swap.html">std::iter_swap</a></span> 到对于非负 <code>i < (last-first)/2</code> 的每对迭代器 <code>first+i, (last-i) - 1</code></div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ，但按照 <code>policy</code> 执行。此重载仅若 <span class="t-rev-inl t-until-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></span></span><span class="t-rev-inl t-since-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">remove_cvref_t</span><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></span></span> 为 true 才参与重载决议。</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>要反转的元素的范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>policy</td>
|
|
<td>-</td>
|
|
<td>所用的执行策略。细节见<a href="cpp-algorithm-execution_policy_tag_t.html">执行策略</a>。</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>BidirIt</code> 必须满足<a href="cpp-named_req-ValueSwappable.html"><span style="font-style:italic">值可交换</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(ValueSwappable)</span></a> 和 <a href="cpp-named_req-BidirectionalIterator.html"><span style="font-style:italic">老式双向迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyBidirectionalIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>（无）</p>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<p>拥有名为 <code>ExecutionPolicy</code> 的模板形参的重载按下列方式报告错误：</p>
|
|
<ul>
|
|
<li>若作为算法一部分调用的函数的执行抛出异常，且 <code>ExecutionPolicy</code> 为<a href="cpp-algorithm-execution_policy_tag_t.html">标准策略</a>之一，则调用 <span class="t-lc"><a href="cpp-error-terminate.html">std::terminate</a></span> 。对于任何其他 <code>ExecutionPolicy</code> ，行为是实现定义的。</li>
|
|
<li>若算法无法分配内存，则抛出 <span class="t-lc"><a href="cpp-memory-new-bad_alloc.html">std::bad_alloc</a></span> 。</li>
|
|
</ul>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>恰好交换 <code>(last - first)/2</code> 次。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>实现（例如 <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/main/stl/src/vector_algorithms.cpp">MSVC STL</a> ）可能在迭代器类型满足<a href="cpp-named_req-ContiguousIterator.html"><span style="font-style:italic">老式连续迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyContiguousIterator)</span></a> ，并且交换其值类型不调用非平凡的特殊成员函数或 <a href="cpp-language-adl.html">ADL</a> 所找到的 <code>swap</code> 时启用向量化。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">可能的实现</span></h3>
|
|
<p>参阅 <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/14d8a5ae472ca5743016f37da2dd4770d83dea21/libstdc%2B%2B-v3/include/bits/stl_algo.h#L1087-L1152">libstdc++</a> 、 <a rel="nofollow" class="external text" href="https://github.com/llvm/llvm-project/blob/6adbc83ee9e46b476e0f75d5671c3a21f675a936/libcxx/include/__algorithm/reverse.h">libc++</a> 和 <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/472161105d596192194d4715ccad307c6c163b4a/stl/inc/xutility#L5335-L5370">MSVC STL</a> 中的实现。</p>
|
|
<table class="eq-fun-cpp-table">
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> BidirIt<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++20 起</span>
|
|
<span class="kw4">void</span> reverse<span class="br0">(</span>BidirIt first, BidirIt last<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">using</span> iter_cat <span class="sy1">=</span> <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>BidirIt<span class="sy1">></span><span class="sy4">::</span><span class="me2">iterator_category</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 能在 C++14 和更早的模式中使用标签派发，</span>
|
|
<span class="co1">// 例如调用 reverse_impl(first, last, iter_cat()) 。</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span><a href="cpp-types-is_base_of.html"><span class="kw591">std::<span class="me2">is_base_of_v</span></span></a><span class="sy1"><</span><a href="cpp-iterator-iterator_tags.html"><span class="kw656">std::<span class="me2">random_access_iterator_tag</span></span></a>, iter_cat<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> last<span class="br0">)</span>
|
|
<span class="kw1">return</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="sy2">--</span>last<span class="sy4">;</span> first <span class="sy1"><</span> last<span class="sy4">;</span> <span class="br0">(</span><span class="kw4">void</span><span class="br0">)</span><span class="sy2">++</span>first, <span class="sy2">--</span>last<span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-algorithm-iter_swap.html"><span class="kw1601">std::<span class="me2">iter_swap</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span><span class="br0">(</span>first <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span> <span class="sy3">&&</span> <span class="br0">(</span>first <span class="sy3">!</span><span class="sy1">=</span> <span class="sy2">--</span>last<span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-algorithm-iter_swap.html"><span class="kw1601">std::<span class="me2">iter_swap</span></span></a><span class="br0">(</span>first<span class="sy2">++</span>, last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<div class="t-example-live-link"></div>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <vector></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <iterator></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> v<span class="br0">{</span><span class="nu0">1</span>,<span class="nu0">2</span>,<span class="nu0">3</span><span class="br0">}</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>v<span class="br0">)</span>, <a href="cpp-iterator-end.html"><span class="kw680">std::<span class="me2">end</span></span></a><span class="br0">(</span>v<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span> e <span class="sy4">:</span> v<span class="br0">)</span> <a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> e<span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> a<span class="br0">[</span><span class="br0">]</span> <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">4</span>, <span class="nu0">5</span>, <span class="nu0">6</span>, <span class="nu0">7</span><span class="br0">}</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>a<span class="br0">)</span>, <a href="cpp-iterator-end.html"><span class="kw680">std::<span class="me2">end</span></span></a><span class="br0">(</span>a<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span> e <span class="sy4">:</span> a<span class="br0">)</span> <a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> e<span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<p>输出：</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">321
|
|
7654</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-reverse_copy.html"><span class="t-lines"><span>reverse_copy</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>创建一个范围的逆向副本<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-ranges-reverse.html"><span class="t-lines"><span>ranges::reverse</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>逆转范围中的元素顺序<br />
|
|
<span class="t-mark">(niebloid)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|