107 lines
11 KiB
HTML
107 lines
11 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::list<T,Allocator>::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_container_list_sort skin-cppreference2 action-view cpp-page-template 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::list<T,Allocator>::</span>sort</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-container.html">container</a>‎ | <a href="cpp-container-list.html">list</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<div class="t-page-template" style="">
|
|
<p></p>
|
|
</div>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx98">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw4">void</span> sort<span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx98">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> Compare <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> sort<span class="br0">(</span> Compare comp <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>以升序排序元素。保持相等元素的顺序。第一版本用 <span class="t-c"><span class="mw-geshi cpp source-cpp">operator<span class="sy1"><</span></span></span> 比较元素，第二版本用给定的比较函数 <code>comp</code> 。</p>
|
|
<p>若抛出异常，则 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="sy2">*</span>this</span></span> 中元素顺序未指定。</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>comp</td>
|
|
<td>-</td>
|
|
<td>比较函数对象（即满足<a href="cpp-named_req-Compare.html"><span style="font-style:italic">比较</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Compare)</span></a> 概念的对象），若第一参数<i>小于</i>（即<i>先</i>序于）第二参数则返回 ​<span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。<br />
|
|
<p>比较函数的签名应等价于如下：</p>
|
|
<p><span class="t-cc"><span class="mw-geshi cpp source-cpp"> <span class="kw4">bool</span> cmp<span class="br0">(</span><span class="kw4">const</span> Type1 <span class="sy3">&</span>a, <span class="kw4">const</span> Type2 <span class="sy3">&</span>b<span class="br0">)</span><span class="sy4">;</span></span></span></p>
|
|
<p>虽然签名不必有 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">const</span> <span class="sy3">&</span></span></span> ，函数也不能修改传递给它的对象，而且必须接受（可为 const 的）类型 <code>Type1</code> 与 <code>Type2</code> 的值，无关乎<a href="cpp-language-value_category.html">值类别</a>（从而不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1 <span class="sy3">&</span></span></span> <span class="t-rev-inl t-since-cxx11"><span>，亦不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> ，除非 <code>Type1</code> 的移动等价于复制</span> <span><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></span></span>）。<br />
|
|
类型 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type1</span></span> 与 <span class="t-c"><span class="mw-geshi cpp source-cpp">Type2</span></span> 必须使得 <span class="t-c"><span class="mw-geshi cpp source-cpp">list<span class="sy1"><</span>T,Allocator<span class="sy1">></span><span class="sy4">::</span><span class="me2">const_iterator</span></span></span> 类型的对象能在解引用后隐式转换到这两个类型。 ​</p>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>（无）</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>大约 <span class="t-c"><span class="mw-geshi cpp source-cpp">N log N</span></span> 次比较，其中 N 是表中的元素数。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E6.84.8F">注意</span></h3>
|
|
<p><span class="t-lc"><a href="cpp-algorithm-sort.html">std::sort</a></span> 要求随机访问迭代器且不能用于 <code>list</code> 。此函数与 <span class="t-lc"><a href="cpp-algorithm-sort.html">std::sort</a></span> 的区别在于，它不要求 <code>list</code> 的元素类型可交换，保留所有迭代器的值，并进行稳定排序。</p>
|
|
<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 <iostream></span>
|
|
<span class="co2">#include <functional></span>
|
|
<span class="co2">#include <list></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> ostr, <span class="kw4">const</span> <a href="cpp-container-list.html"><span class="kw1275">std::<span class="me2">list</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="sy3">&</span> list<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> <span class="sy3">&</span>i <span class="sy4">:</span> list<span class="br0">)</span> <span class="br0">{</span>
|
|
ostr <span class="sy1"><<</span> <span class="st0">" "</span> <span class="sy1"><<</span> i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> ostr<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-list.html"><span class="kw1275">std::<span class="me2">list</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> list <span class="sy1">=</span> <span class="br0">{</span> <span class="nu0">8</span>,<span class="nu0">7</span>,<span class="nu0">5</span>,<span class="nu0">9</span>,<span class="nu0">0</span>,<span class="nu0">1</span>,<span class="nu0">3</span>,<span class="nu0">2</span>,<span class="nu0">6</span>,<span class="nu0">4</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">"before: "</span> <span class="sy1"><<</span> list <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
list.<span class="me1">sort</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">"ascending: "</span> <span class="sy1"><<</span> list <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
list.<span class="me1">sort</span><span class="br0">(</span><a href="cpp-utility-functional-greater.html"><span class="kw1037">std::<span class="me2">greater</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</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">"descending: "</span> <span class="sy1"><<</span> list <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">before: 8 7 5 9 0 1 3 2 6 4
|
|
ascending: 0 1 2 3 4 5 6 7 8 9
|
|
descending: 9 8 7 6 5 4 3 2 1 0</pre></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|