260 lines
27 KiB
HTML
260 lines
27 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::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_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>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">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="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 />
|
|
<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>
|
|
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">forward_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><br />
|
|
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 />
|
|
<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>
|
|
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> 的所有元素之前。不保持等价元素的相对顺序。</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>
|
|
<p>始于指向第二组首元素的迭代器，终于等于 <code>last</code> 的迭代器的 <code>subrange</code> 。若 <code>r</code> 是非 <a href="cpp-ranges-borrowed_range.html"><code>borrowed_range</code></a> 类型的右值则 <span class="t-v">(2)</span> 返回 <span class="t-lc">std::ranges::dangling</span> 。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>给定 N = <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>
|
|
<p>准确应用 N 次谓词与投影，若 <code>I</code> 实现 <code>ranges::bidirectional_iterator</code> 则至多交换 N/2 次，否则至多交换 N 次。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">可能的实现</span></h3>
|
|
<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> partition_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="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>
|
|
<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, 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, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>pred<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>proj<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> last<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span>first, first<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">auto</span> begin <span class="sy1">=</span> first<span class="sy4">;</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> i <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">next</span><span class="br0">(</span>first<span class="br0">)</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>pred, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj, <span class="sy2">*</span>i<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">iter_swap</span><span class="br0">(</span>i, first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="sy2">++</span>first<span class="sy4">;</span>
|
|
<span class="br0">}</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>begin<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first<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">forward_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>
|
|
<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, 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>,
|
|
<a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>pred<span class="br0">)</span>, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><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> partition_fn partition<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="co2">#include <forward_list></span>
|
|
|
|
<span class="kw1">namespace</span> ranges <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">void</span> quicksort<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="br0">{</span>
|
|
<span class="kw1">return</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">auto</span> pivot <span class="sy1">=</span> <span class="sy2">*</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>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> middle1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>first, last, <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="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> middle2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>middle1, last, <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="br0">)</span><span class="sy4">;</span>
|
|
quicksort<span class="br0">(</span>first, middle1<span class="br0">)</span><span class="sy4">;</span>
|
|
quicksort<span class="br0">(</span>middle2, last<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>
|
|
<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="sy1">=</span> <span class="br0">{</span><span class="nu0">0</span>,<span class="nu0">1</span>,<span class="nu0">2</span>,<span class="nu0">3</span>,<span class="nu0">4</span>,<span class="nu0">5</span>,<span class="nu0">6</span>,<span class="nu0">7</span>,<span class="nu0">8</span>,<span class="nu0">9</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> <span class="st0">"Original vector:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> elem <span class="sy4">:</span> v<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> elem <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw4">auto</span> it <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>v, <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> i<span class="br0">)</span><span class="br0">{</span><span class="kw1">return</span> i <span class="sy2">%</span> <span class="nu0">2</span> <span class="sy1">==</span> <span class="nu0">0</span><span class="sy4">;</span><span class="br0">}</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> <span class="st0">"<span class="es1">\n</span>Partitioned vector:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">copy</span><span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>v<span class="br0">)</span>, it, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</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> <span class="st0">" * "</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">copy</span><span class="br0">(</span>it, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>v<span class="br0">)</span>, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-container-forward_list.html"><span class="kw1273">std::<span class="me2">forward_list</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> fl <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">30</span>, <span class="sy2">-</span><span class="nu0">4</span>, <span class="nu0">3</span>, <span class="nu0">5</span>, <span class="sy2">-</span><span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">6</span>, <span class="sy2">-</span><span class="nu0">8</span>, <span class="nu0">2</span>, <span class="sy2">-</span><span class="nu0">5</span>, <span class="nu0">64</span>, <span class="nu0">1</span>, <span class="nu0">92</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> <span class="st0">"<span class="es1">\n</span>Unsorted list:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> n <span class="sy4">:</span> fl<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> n <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="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
quicksort<span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>fl<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>fl<span class="br0">)</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> <span class="st0">"Sorted using quicksort:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> fi <span class="sy4">:</span> fl<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> fi <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="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">Original vector:
|
|
0 1 2 3 4 5 6 7 8 9
|
|
Partitioned vector:
|
|
0 * 2 4 6 8
|
|
Unsorted list:
|
|
1 30 -4 3 5 -4 1 6 -8 2 -5 64 1 92
|
|
Sorted using quicksort:
|
|
-4 -4 -8 -5 1 1 3 2 5 1 30 64 6 92</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-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-ranges-stable_partition.html"><span class="t-lines"><span>ranges::stable_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-partition.html"><span class="t-lines"><span>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>
|