265 lines
29 KiB
HTML
265 lines
29 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::stable_partition</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_stable_partition 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>stable_partition</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">bidirectional_iterator</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="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">indirect_unary_predicate</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">>></span> Pred<span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">permutable</span><span class="sy1"><</span>I<span class="sy1">></span><br />
|
|
ranges<span class="sy4">::</span><span class="me2">subrange</span><span class="sy1"><</span>I<span class="sy1">></span><br /></p>
|
|
stable_partition<span class="br0">(</span> I first, S last, Pred pred, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <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">bidirectional_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br /></span>
|
|
<p> std<span class="sy4">::</span><span class="me2">indirect_unary_predicate</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</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>, Proj<span class="sy1">>></span> Pred<span class="sy1">></span><br />
|
|
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 />
|
|
ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1"><</span>R<span class="sy1">></span><br /></p>
|
|
stable_partition<span class="br0">(</span> R<span class="sy3">&&</span> r, Pred pred, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <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> 重排序范围 <code>[first, last)</code> 中的元素，使得所有谓词 <code>pred</code> 对 <code>proj</code> 投影后返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 的元素在所有谓词 <code>pred</code> 对 <code>proj</code> 投影后返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 的元素之前。算法是<i>稳定</i>的，即<i>保持</i>元素的相对顺序。</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>pred</td>
|
|
<td>-</td>
|
|
<td>应用到投影后元素的谓词</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj</td>
|
|
<td>-</td>
|
|
<td>应用到元素的投影</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<div class="t-li1"><span class="t-li">1)</span> 等于 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>pivot, last<span class="br0">}</span></span></span> 的对象，其中 <code>pivot</code> 是指向第二群首元素的迭代器。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 若 <code>r</code> 为左值或拥有 <a href="cpp-ranges-borrowed_range.html"><code>borrowed_range</code></a> 类型则同 <span class="t-v">(1)</span> 。否则返回 <span class="t-lc">std::ranges::dangling</span>.</div>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>给定 <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span></span></span> ，复杂度最坏为 <span class="mjax" style="display:none">\(\scriptsize N\cdot\log{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N·log(N)</span> 次交换，而在使用额外内存时仅 <span class="mjax" style="display:none">\(\scriptsize \mathcal{O}(N)\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">𝓞(N)</span> 次交换。准确应用 <span class="mjax" style="display:none">\(\scriptsize N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 次谓词 <code>pred</code> 和投影 <code>proj</code> 。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>此函数尝试分配临时缓冲区。若分配失败，则选择效率较低的算法。</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/microsoft/STL/blob/e745bad3b1d05b5b19ec652d68abb37865ffa454/stl/inc/algorithm#L5358-L5555">MSVC STL</a> 与 <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/master/libstdc%2B%2B-v3/include/bits/ranges_algo.h#L2365-L2394">libstdc++</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> stable_partition_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">bidirectional_iterator</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="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_unary_predicate</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</span><span class="sy1"><</span>I, Proj<span class="sy1">>></span> Pred<span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">permutable</span><span class="sy1"><</span>I<span class="sy1">></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, S last, Pred pred, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
first <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">find_if_not</span><span class="br0">(</span>first, last, pred, proj<span class="br0">)</span><span class="sy4">;</span>
|
|
I mid <span class="sy1">=</span> first<span class="sy4">;</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>mid <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span> <span class="br0">{</span>
|
|
mid <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">find_if</span><span class="br0">(</span>mid, last, pred, proj<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>mid <span class="sy1">==</span> last<span class="br0">)</span> <span class="kw1">break</span><span class="sy4">;</span>
|
|
I last2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">find_if_not</span><span class="br0">(</span>mid, last, pred, proj<span class="br0">)</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">rotate</span><span class="br0">(</span>first, mid, last2<span class="br0">)</span><span class="sy4">;</span>
|
|
first <span class="sy1">=</span> 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>mid, last2<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
mid <span class="sy1">=</span> last2<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>first<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>mid<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">bidirectional_range</span> R, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,
|
|
std<span class="sy4">::</span><span class="me2">indirect_unary_predicate</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">projected</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>, Proj<span class="sy1">>></span> Pred<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>
|
|
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, Pred pred, Proj proj <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span> <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>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>pred<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>proj<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> stable_partition_fn stable_partition<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">
|
|
<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 <iterator></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw1">namespace</span> rng <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">;</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> <span class="kw4">void</span> stable_sort<span class="br0">(</span>I first, S last<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="kw4">auto</span> pivot <span class="sy1">=</span> <span class="sy2">*</span>rng<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first, rng<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first, last<span class="br0">)</span> <span class="sy2">/</span> <span class="nu0">2</span>, last<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> left <span class="sy1">=</span> <span class="br0">[</span>pivot<span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> em<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> em <span class="sy1"><</span> pivot<span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> tail1 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">stable_partition</span><span class="br0">(</span>first, last, left<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> right <span class="sy1">=</span> <span class="br0">[</span>pivot<span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> em<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="sy3">!</span><span class="br0">(</span>pivot <span class="sy1"><</span> em<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> tail2 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">stable_partition</span><span class="br0">(</span>tail1, right<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
stable_sort<span class="br0">(</span>first, tail1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
stable_sort<span class="br0">(</span>tail2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, tail2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">void</span> print<span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span> rem, <span class="kw4">auto</span> first, <span class="kw4">auto</span> last, <span class="kw4">bool</span> end <span class="sy1">=</span> <span class="kw2">true</span><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> rem<span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> first <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>first<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="sy2">*</span>first <span class="sy1"><<</span> <span class="st0">' '</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>end <span class="sy4">?</span> <span class="st0">"<span class="es1">\n</span>"</span> <span class="sy4">:</span> <span class="st0">""</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> original <span class="sy1">=</span> <span class="br0">{</span> <span class="nu0">9</span>, <span class="nu0">6</span>, <span class="nu0">5</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">7</span>, <span class="nu0">8</span> <span class="br0">}</span><span class="sy4">;</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> vi<span class="sy4">;</span>
|
|
<span class="kw4">auto</span> even <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> x<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="nu0">0</span> <span class="sy1">==</span> <span class="br0">(</span>x <span class="sy2">%</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
print<span class="br0">(</span><span class="st0">"Original vector:<span class="es1">\t</span>"</span>, original.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, original.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <span class="st0">"<span class="es1">\n</span>"</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
vi <span class="sy1">=</span> original<span class="sy4">;</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> ret1 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">stable_partition</span><span class="br0">(</span>vi, even<span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"Stable partitioned:<span class="es1">\t</span>"</span>, vi.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, ret1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">0</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"│ "</span>, ret1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, ret1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
vi <span class="sy1">=</span> original<span class="sy4">;</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> ret2 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>vi, even<span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"Partitioned:<span class="es1">\t</span><span class="es1">\t</span>"</span>, vi.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, ret2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">0</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"│ "</span>, ret2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, ret2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
|
|
vi <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">16</span>, <span class="nu0">30</span>, <span class="nu0">44</span>, <span class="nu0">30</span>, <span class="nu0">15</span>, <span class="nu0">24</span>, <span class="nu0">10</span>, <span class="nu0">18</span>, <span class="nu0">12</span>, <span class="nu0">35</span><span class="br0">}</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"Unsorted vector: "</span>, vi.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, vi.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
stable_sort<span class="br0">(</span>rng<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>vi<span class="br0">)</span>, rng<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>vi<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span><span class="st0">"Sorted vector: "</span>, vi.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, vi.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</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">Original vector: 9 6 5 2 3 1 7 8
|
|
Stable partitioned: 6 2 8 │ 9 5 3 1 7
|
|
Partitioned: 8 6 2 │ 5 3 1 7 9
|
|
Unsorted vector: 16 30 44 30 15 24 10 18 12 35
|
|
Sorted vector: 10 12 15 16 18 24 30 30 35 44</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-partition.html"><span class="t-lines"><span>ranges::partition</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-partition_copy.html"><span class="t-lines"><span>ranges::partition_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-is_partitioned.html"><span class="t-lines"><span>ranges::is_partitioned</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-stable_partition.html"><span class="t-lines"><span>stable_partition</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>
|