109 lines
7.8 KiB
HTML
109 lines
7.8 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::experimental::ranges::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_experimental_ranges_algorithm_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::experimental::ranges::</span>sort</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-experimental.html">experimental</a>‎ | <a href="cpp-experimental-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-experimental-ranges-algorithm.html"><experimental/ranges/algorithm></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-ranges">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <a href="cpp-experimental-ranges-iterator-RandomAccessIterator.html"><span class="kw2573">ranges::<span class="me2">RandomAccessIterator</span></span></a> I, <a href="cpp-experimental-ranges-iterator-Sentinel.html"><span class="kw2567">ranges::<span class="me2">Sentinel</span></span></a><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="sy1"><></span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">></span><br />
|
|
requires <a href="cpp-experimental-ranges-iterator-Sortable.html"><span class="kw2587">ranges::<span class="me2">Sortable</span></span></a><span class="sy1"><</span>I, Comp, Proj<span class="sy1">></span><br /></p>
|
|
I sort<span class="br0">(</span> I first, S last, Comp comp <span class="sy1">=</span> Comp<span class="br0">{</span><span class="br0">}</span>, Proj proj <span class="sy1">=</span> Proj<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-ranges-ts t-mark-ts">(范围 TS)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-ranges">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <a href="cpp-experimental-ranges-range-RandomAccessRange.html"><span class="kw2596">ranges::<span class="me2">RandomAccessRange</span></span></a> Rng,<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="sy1"><></span>, <span class="kw1">class</span> Proj <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">></span><br />
|
|
requires <a href="cpp-experimental-ranges-iterator-Sortable.html"><span class="kw2587">ranges::<span class="me2">Sortable</span></span></a><span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>Rng<span class="sy1">></span>, Comp, Proj<span class="sy1">></span><br />
|
|
ranges<span class="sy4">::</span><span class="me2">safe_iterator_t</span><span class="sy1"><</span>Rng<span class="sy1">></span> sort<span class="br0">(</span> Rng<span class="sy3">&&</span> rng, Comp comp <span class="sy1">=</span> Comp<span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj proj <span class="sy1">=</span> Proj<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-ranges-ts t-mark-ts">(范围 TS)</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>proj</code> 后用 <code>comp</code> 比较元素。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 排序范围 <code>rng</code> 中的元素，如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw1">return</span> ranges<span class="sy4">::</span><span class="me2">sort</span><span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>rng<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>rng<span class="br0">)</span>, comp, proj<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<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>rng</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>指向范围尾后一位置的迭代器（即它对于重载 <span class="t-v">(1)</span> 等于 <code>last</code> ，对于重载 <code>ranges::end(rng)</code> 等于 <span class="t-v">(2)</span> ）。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p><span class="texhtml" style="white-space: nowrap;">O(N·log(N))</span> 次比较，其中 N 等于范围中的元素数。</p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<table class="metadata plainlinks ambox mbox-small-left ambox-notice" style="">
|
|
<tr>
|
|
<td class="mbox-empty-cell"></td>
|
|
<td class="mbox-text" style="">本节未完成<br />
|
|
原因：暂无示例</td>
|
|
</tr>
|
|
</table>
|
|
<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-sort.html"><span class="t-lines"><span>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>
|