291 lines
30 KiB
HTML
291 lines
30 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::ranges::rotate</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_ranges_rotate 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::ranges::</span>rotate</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a>‎ | <a href="cpp-algorithm-ranges.html">ranges</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>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl-h">
|
|
<td>
|
|
<div>调用签名</div>
|
|
</td>
|
|
<td></td>
|
|
<td></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> std<span class="sy4">::</span><span class="me2">permutable</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S <span class="sy1">></span><br /></span>
|
|
<p><span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">subrange</span><span class="sy1"><</span>I<span class="sy1">></span><br /></p>
|
|
rotate<span class="br0">(</span> I first, I middle, S last <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-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> ranges<span class="sy4">::</span><span class="me2">forward_range</span> R <span class="sy1">></span><br /></span>
|
|
<p>requires std<span class="sy4">::</span><span class="me2">permutable</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">>></span><br />
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1"><</span>R<span class="sy1">></span><br /></p>
|
|
rotate<span class="br0">(</span> R<span class="sy3">&&</span> r, ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span> middle <span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</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> 在元素范围上进行<i>左旋</i>。具体而言, <code>ranges::rotate</code> 交换范围 <code>[first, last)</code> 中的元素使得元素 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span>middle</span></span> 成为新范围的起始,而 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span><span class="br0">(</span>middle <span class="sy2">-</span> <span class="nu0">1</span><span class="br0">)</span></span></span> 成为新的末元素。</div>
|
|
<div class="t-li1"><span class="t-li"></span> 若 <code>[first, last)</code> 不是合法范围或 <code>middle</code> 不在 <code>[first, last)</code> 中则行为未定义。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ,但以 <code>r</code> 为范围,如同以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r<span class="br0">)</span></span></span> 为 <code>first</code> 并以 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r<span class="br0">)</span></span></span> 为 <code>last</code> 。</div>
|
|
<p>此页面上描述的仿函数实体是 <i>niebloid</i> ,即:</p>
|
|
<ul>
|
|
<li>调用它们中的任何一者时不可指定显式模板实参。</li>
|
|
<li>它们无一对<a href="cpp-language-adl.html">实参依赖查找</a>可见。</li>
|
|
<li>在<a href="cpp-language-unqualified_lookup.html">通常无限定查找</a>寻找函数调用运算符左侧的名称找到它们之一时,它禁止<a href="cpp-language-adl.html">实参依赖查找</a>。</li>
|
|
</ul>
|
|
<p>实际上,它们能以函数对象,或以某些特殊编译器扩展实现。</p>
|
|
<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>r</td>
|
|
<td>-</td>
|
|
<td>要旋转的元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>middle</td>
|
|
<td>-</td>
|
|
<td>指向要出现在旋转后范围起始的元素的迭代器</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p><span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>new_first, last<span class="br0">}</span></span></span> ,其中 <code><i>new_first</i></code> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first, ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>middle, last<span class="br0">)</span><span class="br0">)</span></span></span> 比较相等,并指代 <code>first</code> 所指向的元素的新位置。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>最坏为<i>线性</i>: <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 次交换。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>在常见实现上,若 <code>I</code> 实现 <a href="cpp-iterator-bidirectional_iterator.html"><code>bidirectional_iterator</code></a> 或(更好的) <a href="cpp-iterator-random_access_iterator.html"><code>random_access_iterator</code></a> 则 <code>ranges::rotate</code> 有更高的效率。</p>
|
|
<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-iterator-contiguous_iterator.html"><code>contiguous_iterator</code></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/ranges_algo.h#L1361-L1506">libstdc++</a> 与 <a rel="nofollow" class="external text" href="https://github.com/microsoft/STL/blob/472161105d596192194d4715ccad307c6c163b4a/stl/inc/algorithm#L4407-L4434">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">struct</span> rotate_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">permutable</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">subrange</span><span class="sy1"><</span>I<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span> <span class="br0">(</span> I first, I middle, S last <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> middle<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw4">auto</span> last_it<span class="br0">{</span><a href="cpp-iterator-next.html"><span class="kw674">std::<span class="me2">next</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>last_it, last_it<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>middle <span class="sy1">==</span> last<span class="br0">)</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>middle<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">bidirectional_iterator</span><span class="sy1"><</span>I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span>fist, middle<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> last_it<span class="br0">{</span>ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first, last<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span>middle, last_it<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">random_access_iterator</span><span class="sy1"><</span>I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span>first, last_it<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>first <span class="sy2">+</span> <span class="br0">(</span>last_it <span class="sy2">-</span> middle<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>last_it<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw4">auto</span> mid_last<span class="br0">{</span>last_it<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">do</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">iter_swap</span><span class="br0">(</span>first, <span class="sy2">--</span>mid_last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="sy2">++</span>first<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>first <span class="sy3">!</span><span class="sy1">=</span> middle <span class="sy3">&&</span> mid_last <span class="sy3">!</span><span class="sy1">=</span> middle<span class="br0">)</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">reverse</span><span class="br0">(</span>first, mid_last<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> middle<span class="br0">)</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>mid_last<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>last_it<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">else</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>last_it<span class="br0">)</span><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="co1">// I 仅为 forward_iterator</span>
|
|
<span class="kw4">auto</span> next_it<span class="br0">{</span>middle<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">do</span> <span class="br0">{</span> <span class="co1">// rotate 第一循环</span>
|
|
ranges<span class="sy4">::</span><span class="me2">iter_swap</span><span class="br0">(</span>first, next_it<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="sy2">++</span>first<span class="sy4">;</span>
|
|
<span class="sy2">++</span>next_it<span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> middle<span class="br0">)</span>
|
|
middle <span class="sy1">=</span> next_it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>next_it <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> new_first<span class="br0">{</span>first<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>middle <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span> <span class="br0">{</span> <span class="co1">// rotate 后继循环</span>
|
|
next_it <span class="sy1">=</span> middle<span class="sy4">;</span>
|
|
<span class="kw1">do</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">iter_swap</span><span class="br0">(</span>first, next_it<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="sy2">++</span>first<span class="sy4">;</span>
|
|
<span class="sy2">++</span>next_it<span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> middle<span class="br0">)</span>
|
|
middle <span class="sy1">=</span> next_it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>next_it <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">return</span> <span class="br0">{</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>new_first<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>middle<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span> R<span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">permutable</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">>></span>
|
|
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1"><</span>R<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span> <span class="br0">(</span> R<span class="sy3">&&</span> r, ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span> middle <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="br0">(</span><span class="sy2">*</span>this<span class="br0">)</span><span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>middle<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">inline</span> <span class="kw4">constexpr</span> rotate_fn rotate<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</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">
|
|
<p><i><code>rotate</code></i> 算法能用作许多其他算法的公共构建块,例如<i>插入排序</i>:</p>
|
|
<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 <algorithm></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <numeric></span>
|
|
<span class="co2">#include <string></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a> s<span class="br0">(</span><span class="nu0">16</span>, <span class="st0">' '</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> k<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span> k <span class="sy3">!</span><span class="sy1">=</span> <span class="nu0">5</span><span class="sy4">;</span> <span class="sy2">++</span>k<span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-algorithm-iota.html"><span class="kw1655">std::<span class="me2">iota</span></span></a><span class="br0">(</span>s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, s.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <span class="st0">'A'</span><span class="br0">)</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">rotate</span><span class="br0">(</span>s, s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">+</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"Rotate left ("</span> <span class="sy1"><<</span> k <span class="sy1"><<</span> <span class="st0">"): "</span> <span class="sy1"><<</span> s <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<a href="cpp-io-cout.html"><span class="kw1758">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="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> k<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span> k <span class="sy3">!</span><span class="sy1">=</span> <span class="nu0">5</span><span class="sy4">;</span> <span class="sy2">++</span>k<span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-algorithm-iota.html"><span class="kw1655">std::<span class="me2">iota</span></span></a><span class="br0">(</span>s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, s.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <span class="st0">'A'</span><span class="br0">)</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">rotate</span><span class="br0">(</span>s, s.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">-</span> k<span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"Rotate right ("</span> <span class="sy1"><<</span> k <span class="sy1"><<</span> <span class="st0">"): "</span> <span class="sy1"><<</span> s <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>"</span> <span class="st0">"Insertion sort using `rotate`, step-by-step:<span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
|
|
s <span class="sy1">=</span> <span class="br0">{</span><span class="st0">'2'</span>, <span class="st0">'4'</span>, <span class="st0">'2'</span>, <span class="st0">'0'</span>, <span class="st0">'5'</span>, <span class="st0">'9'</span>, <span class="st0">'7'</span>, <span class="st0">'3'</span>, <span class="st0">'7'</span>, <span class="st0">'1'</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> i <span class="sy1">=</span> s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> s.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"i = "</span> <span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, i<span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">": "</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">rotate</span><span class="br0">(</span>std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">upper_bound</span><span class="br0">(</span>s.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, i, <span class="sy2">*</span>i<span class="br0">)</span>, i, i <span class="sy2">+</span> <span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> s <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">is_sorted</span><span class="br0">(</span>s<span class="br0">)</span> <span class="sy4">?</span> <span class="st0">"Sorted!"</span> <span class="sy4">:</span> <span class="st0">"Not sorted."</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><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">Rotate left (0): ABCDEFGHIJKLMNOP
|
|
Rotate left (1): BCDEFGHIJKLMNOPA
|
|
Rotate left (2): CDEFGHIJKLMNOPAB
|
|
Rotate left (3): DEFGHIJKLMNOPABC
|
|
Rotate left (4): EFGHIJKLMNOPABCD
|
|
|
|
Rotate right (0): ABCDEFGHIJKLMNOP
|
|
Rotate right (1): PABCDEFGHIJKLMNO
|
|
Rotate right (2): OPABCDEFGHIJKLMN
|
|
Rotate right (3): NOPABCDEFGHIJKLM
|
|
Rotate right (4): MNOPABCDEFGHIJKL
|
|
|
|
Insertion sort using `rotate`, step-by-step:
|
|
i = 0: 2420597371
|
|
i = 1: 2420597371
|
|
i = 2: 2240597371
|
|
i = 3: 0224597371
|
|
i = 4: 0224597371
|
|
i = 5: 0224597371
|
|
i = 6: 0224579371
|
|
i = 7: 0223457971
|
|
i = 8: 0223457791
|
|
i = 9: 0122345779
|
|
Sorted!</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-ranges-rotate_copy.html"><span class="t-lines"><span>ranges::rotate_copy</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>
|
|
<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>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-algorithm-rotate.html"><span class="t-lines"><span>rotate</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>旋转范围中的元素顺序<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|