286 lines
27 KiB
HTML
286 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::stable_sort</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_sort 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_sort</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">random_access_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S,<br /></span>
|
|
<p> <span class="kw1">class</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1"><</span>I, Comp, Proj<span class="sy1">></span><br /></p>
|
|
I stable_sort<span class="br0">(</span> I first, S last, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, 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">random_access_range</span> R, <span class="kw1">class</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>,<br /></span>
|
|
<p> <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires std<span class="sy4">::</span><span class="me2">sortable</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>, Comp, Proj<span class="sy1">></span><br />
|
|
ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1"><</span>R<span class="sy1">></span><br /></p>
|
|
stable_sort<span class="br0">(</span> R<span class="sy3">&&</span> r, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, 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>
|
|
<p>以非降序排序范围 <code>[first, last)</code> 中的元素。等价元素的顺序是<i>稳定</i>的，即保证得到保持。</p>
|
|
<p>称序列为按照比较器 <code>comp</code> 与投影 <code>proj</code> <i>已排序</i>，若对应任何指向序列的迭代器 <code>it</code> 与任何使得 <code>it + n</code> 为指向序列元素的合法迭代器的非负整数 <code>n</code> ， <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>comp, <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><span class="br0">(</span>it <span class="sy2">+</span> n<span class="br0">)</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>proj, <span class="sy2">*</span>it<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span> 求值为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 用给定的二元比较函数 <code>comp</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>comp</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> 的迭代器。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>若额外内存可用则比较 <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 N\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N</span> 为 <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> 。否则比较 <span class="mjax" style="display:none">\(\scriptsize N\cdot\log^2{(N)}\)</span><span class="mjax-fallback texhtml" style="white-space: nowrap;">N·log²(N)</span> 次。两种情况下都进行二倍数量的投影。</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#L7842-L8094">MSVC STL</a> 与 <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/54258e22b0846aaa6bd3265f592feb161eecda75/libstdc%2B%2B-v3/include/bits/ranges_algo.h#L1836-L1862">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_sort_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span> std<span class="sy4">::</span><span class="me2">random_access_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> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">sortable</span><span class="sy1"><</span>I, Comp, Proj<span class="sy1">></span>
|
|
I operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> I first, S last, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, 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="kw4">auto</span> count <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 class="sy4">;</span>
|
|
<span class="kw4">auto</span> mid <span class="sy1">=</span> first <span class="sy2">+</span> count <span class="sy2">/</span> <span class="nu0">2</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> last_it <span class="sy1">=</span> first <span class="sy2">+</span> count<span class="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span>count <span class="sy1"><=</span> <span class="nu0">1</span><span class="br0">)</span>
|
|
<span class="kw1">return</span> last_it<span class="sy4">;</span>
|
|
|
|
<span class="br0">(</span><span class="sy2">*</span>this<span class="br0">)</span><span class="br0">(</span>first, mid, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<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="sy2">*</span>this<span class="br0">)</span><span class="br0">(</span>mid, last_it, <a href="cpp-utility-functional-ref.html"><span class="kw1069">std::<span class="me2">ref</span></span></a><span class="br0">(</span>comp<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>
|
|
|
|
ranges<span class="sy4">::</span><span class="me2">inplace_merge</span><span class="br0">(</span>first, mid, last_it<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">return</span> last_it<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">random_access_range</span> R, <span class="kw1">class</span> Comp <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">less</span>,
|
|
<span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span>
|
|
requires std<span class="sy4">::</span><span class="me2">sortable</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>, Comp, Proj<span class="sy1">></span>
|
|
ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_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, Comp comp <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, 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>comp<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_sort_fn stable_sort<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 <array></span>
|
|
<span class="co2">#include <functional></span>
|
|
<span class="co2">#include <iomanip></span>
|
|
<span class="co2">#include <iostream></span>
|
|
|
|
<span class="kw4">void</span> print<span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> seq<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> elem <span class="sy4">:</span> seq<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>
|
|
<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>
|
|
|
|
<span class="kw1">struct</span> Particle <span class="br0">{</span>
|
|
<a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a> name<span class="sy4">;</span> <span class="kw4">double</span> mass<span class="sy4">;</span> <span class="co1">// MeV</span>
|
|
<span class="kw1">friend</span> <a href="cpp-io-basic_ostream.html"><span class="kw1729">std::<span class="me2">ostream</span></span></a><span class="sy3">&</span> operator<span class="sy1"><<</span> <span class="br0">(</span><a href="cpp-io-basic_ostream.html"><span class="kw1729">std::<span class="me2">ostream</span></span></a><span class="sy3">&</span> os, Particle <span class="kw4">const</span><span class="sy3">&</span> p<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> os <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>"</span> <span class="sy1"><<</span> <a href="cpp-io-manip-left.html"><span class="kw1779">std::<span class="me2">left</span></span></a> <span class="sy1"><<</span> <a href="cpp-io-manip-setw.html"><span class="kw1797">std::<span class="me2">setw</span></span></a><span class="br0">(</span><span class="nu0">8</span><span class="br0">)</span> <span class="sy1"><<</span> p.<span class="me1">name</span> <span class="sy1"><<</span> <span class="st0">" : "</span> <span class="sy1"><<</span> p.<span class="me1">mass</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a> s <span class="br0">{</span><span class="nu0">5</span>, <span class="nu0">7</span>, <span class="nu0">4</span>, <span class="nu0">2</span>, <span class="nu0">8</span>, <span class="nu0">6</span>, <span class="nu0">1</span>, <span class="nu0">9</span>, <span class="nu0">0</span>, <span class="nu0">3</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 以默认的 operator< 排序</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">stable_sort</span><span class="br0">(</span>s<span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>s<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 以标准库比较函数对象排序</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">stable_sort</span><span class="br0">(</span>s, std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">greater</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>s<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 以定制函数对象排序</span>
|
|
<span class="kw1">struct</span> <span class="br0">{</span>
|
|
<span class="kw4">bool</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span><span class="kw4">int</span> a, <span class="kw4">int</span> b<span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> a <span class="sy1"><</span> b<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span> customLess<span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">stable_sort</span><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>, customLess<span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>s<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 以 lambda 表达式排序</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">stable_sort</span><span class="br0">(</span>s, <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> a, <span class="kw4">int</span> b<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> a <span class="sy1">></span> b<span class="sy4">;</span>
|
|
<span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>s<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 以投影排序</span>
|
|
Particle particles<span class="br0">[</span><span class="br0">]</span> <span class="br0">{</span>
|
|
<span class="br0">{</span><span class="st0">"Electron"</span>, <span class="nu16">0.511</span><span class="br0">}</span>, <span class="br0">{</span><span class="st0">"Muon"</span>, <span class="nu16">105.66</span><span class="br0">}</span>, <span class="br0">{</span><span class="st0">"Tau"</span>, <span class="nu16">1776.86</span><span class="br0">}</span>,
|
|
<span class="br0">{</span><span class="st0">"Positron"</span>, <span class="nu16">0.511</span><span class="br0">}</span>, <span class="br0">{</span><span class="st0">"Proton"</span>, <span class="nu16">938.27</span><span class="br0">}</span>, <span class="br0">{</span><span class="st0">"Neutron"</span>, <span class="nu16">939.57</span><span class="br0">}</span>,
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>particles<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">stable_sort</span><span class="br0">(</span>particles, <span class="br0">{</span><span class="br0">}</span>, <span class="sy3">&</span>Particle<span class="sy4">::</span><span class="me2">name</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">//< sort by name</span>
|
|
print<span class="br0">(</span>particles<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">stable_sort</span><span class="br0">(</span>particles, <span class="br0">{</span><span class="br0">}</span>, <span class="sy3">&</span>Particle<span class="sy4">::</span><span class="me2">mass</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">//< sort by mass</span>
|
|
print<span class="br0">(</span>particles<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">0 1 2 3 4 5 6 7 8 9
|
|
9 8 7 6 5 4 3 2 1 0
|
|
0 1 2 3 4 5 6 7 8 9
|
|
9 8 7 6 5 4 3 2 1 0
|
|
|
|
Electron : 0.511
|
|
Muon : 105.66
|
|
Tau : 1776.86
|
|
Positron : 0.511
|
|
Proton : 938.27
|
|
Neutron : 939.57
|
|
|
|
Electron : 0.511
|
|
Muon : 105.66
|
|
Neutron : 939.57
|
|
Positron : 0.511
|
|
Proton : 938.27
|
|
Tau : 1776.86
|
|
|
|
Electron : 0.511
|
|
Positron : 0.511
|
|
Muon : 105.66
|
|
Proton : 938.27
|
|
Neutron : 939.57
|
|
Tau : 1776.86</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-sort.html"><span class="t-lines"><span>ranges::sort</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-partial_sort.html"><span class="t-lines"><span>ranges::partial_sort</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>排序一个范围的前 N 个元素<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-stable_sort.html"><span class="t-lines"><span>stable_sort</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>
|