278 lines
30 KiB
HTML
278 lines
30 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::unique</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_unique 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>unique</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_equivalence_relation</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><br />
|
|
C <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span> <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>
|
|
unique<span class="br0">(</span> I first, S last, C 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">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_equivalence_relation</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><br />
|
|
C <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span> <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>
|
|
unique<span class="br0">(</span> R<span class="sy3">&&</span> r, C 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>
|
|
<div class="t-li1"><span class="t-li">1)</span> 从来自范围 <code>[first, last)</code> 的每个连续的等价元素组消除首个以外的全部元素,并返回子范围 <code>[ret, last)</code> ,其中 <code>ret</code> 是新范围的尾后迭代器。</div>
|
|
<div class="t-li1"><span class="t-li"></span> 若 <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>i <span class="sy2">-</span> <span class="nu0">1</span><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>i<span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> 则认为二个连续元素 <code>*(i - 1)</code> 与 <code>*i</code> 等价,其中 <code>i</code> 是范围 <code>[first + 1, last)</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>返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="br0">{</span>ret, last<span class="br0">}</span></span></span> ,其中 <code>ret</code> 是新范围末尾的尾后迭代器。</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">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">1</span></span></span> 次相应的谓词 <code>comp</code> ,并且应用投影 <code>proj</code> 的次数不多于其二倍。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>由迁移(通过移动赋值的手段)范围中的元素进行移除,使得未被移除的元素出现在范围起始。保持元素的相对顺序并且不改变容器的<i>物理</i>大小。 <code>[ret, last)</code> 中的迭代器(若存在)仍然可解引用,但元素自身拥有未指定值(如<a href="cpp-named_req-MoveAssignable.html"><span style="font-style:italic">可移动赋值</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(MoveAssignable)</span></a> 后条件所要求)。</p>
|
|
<p>对 <code>ranges::unique</code> 的调用有时后随容器的 <code>erase</code> 成员函数,这擦除未指定值并减少容器的<i>物理</i>大小以匹配其新的<i>逻辑</i>大小。此二调用一并实现<a href="https://en.wikipedia.org/wiki/Erase-remove_idiom" class="extiw" title="enwiki:Erase-remove idiom"><i>擦除-移除</i>手法</a>。</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> unique_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_equivalence_relation</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> C <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><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, C 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>
|
|
first <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">adjacent_find</span><span class="br0">(</span>first, last, comp, proj<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="kw1">return</span> <span class="br0">{</span>first, first<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> i <span class="br0">{</span>first<span class="br0">}</span><span class="sy4">;</span>
|
|
<span class="sy2">++</span>first<span class="sy4">;</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span><span class="sy2">++</span>first <span class="sy3">!</span><span class="sy1">=</span> last<span class="br0">)</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span><span class="sy3">!</span><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>i<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>first<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span>
|
|
<span class="sy2">*++</span>i <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span><span class="sy2">*</span>first<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="br0">{</span><span class="sy2">++</span>i, first<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_equivalence_relation</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>
|
|
C <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><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, C 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> unique_fn unique<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 <cmath></span>
|
|
<span class="co2">#include <complex></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw1">struct</span> id <span class="br0">{</span> <span class="kw4">int</span> i<span class="sy4">;</span> <span class="kw1">explicit</span> id<span class="br0">(</span><span class="kw4">int</span> i<span class="br0">)</span> <span class="sy4">:</span> i<span class="br0">{</span>i<span class="br0">}</span> <span class="br0">{</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">void</span> print<span class="br0">(</span>id i, <span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</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> <span class="st0">"@"</span> <span class="sy1"><<</span> i.<span class="me1">i</span> <span class="sy1"><<</span> <span class="st0">": "</span><span class="sy4">;</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">for_each</span><span class="br0">(</span>v, <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">auto</span> <span class="kw4">const</span><span class="sy3">&</span> e<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> e <span class="sy1"><<</span> <span class="st0">' '</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>'</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="co1">// 含数个重复元素的 vector</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="br0">{</span><span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">1</span>, <span class="nu0">1</span>, <span class="nu0">3</span>, <span class="nu0">3</span>, <span class="nu0">3</span>, <span class="nu0">4</span>, <span class="nu0">5</span>, <span class="nu0">4</span><span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">1</span><span class="br0">}</span>, v<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// 移除连续(相接)的副本</span>
|
|
<span class="kw4">auto</span> ret <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">unique</span><span class="br0">(</span>v<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="co1">// v 现在保有 {1 2 1 3 4 5 4 x x x} ,其中 'x' 不确定</span>
|
|
v.<span class="me1">erase</span><span class="br0">(</span>ret.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, ret.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">2</span><span class="br0">}</span>, v<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="co1">// sort 后随 unique ,移除所有副本</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">sort</span><span class="br0">(</span>v<span class="br0">)</span><span class="sy4">;</span> <span class="co1">// {1 1 2 3 4 4 5}</span>
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">3</span><span class="br0">}</span>, v<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> <span class="br0">[</span>first, last<span class="br0">]</span> <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">unique</span><span class="br0">(</span>v.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="co1">// v 现在保有 {1 2 3 4 5 x x} ,其中 'x' 不确定</span>
|
|
v.<span class="me1">erase</span><span class="br0">(</span>first, last<span class="br0">)</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">4</span><span class="br0">}</span>, v<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
|
|
<span class="co1">// 以定制比较与投影 unique</span>
|
|
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><a href="cpp-numeric-complex.html"><span class="kw1472">std::<span class="me2">complex</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">>></span> vc<span class="br0">{</span> <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">1</span><span class="br0">}</span>, <span class="br0">{</span><span class="sy2">-</span><span class="nu0">1</span>, <span class="nu0">2</span><span class="br0">}</span>, <span class="br0">{</span><span class="sy2">-</span><span class="nu0">2</span>, <span class="nu0">3</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">2</span>, <span class="nu0">4</span><span class="br0">}</span>, <span class="br0">{</span><span class="sy2">-</span><span class="nu0">3</span>, <span class="nu0">5</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">5</span><span class="br0">}</span>, vc<span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> ret2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">unique</span><span class="br0">(</span>vc,
|
|
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> x, <span class="kw4">int</span> y<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> std<span class="sy4">::</span><span class="me2">abs</span><span class="br0">(</span>x<span class="br0">)</span> <span class="sy1">==</span> std<span class="sy4">::</span><span class="me2">abs</span><span class="br0">(</span>y<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span>, <span class="co1">// comp</span>
|
|
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><a href="cpp-numeric-complex.html"><span class="kw1472">std::<span class="me2">complex</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> z<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> z.<span class="me1">real</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span> <span class="co1">// proj</span>
|
|
<span class="br0">)</span><span class="sy4">;</span>
|
|
vc.<span class="me1">erase</span><span class="br0">(</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>
|
|
print<span class="br0">(</span>id<span class="br0">{</span><span class="nu0">6</span><span class="br0">}</span>, vc<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">@1: 1 2 1 1 3 3 3 4 5 4
|
|
@2: 1 2 1 3 4 5 4
|
|
@3: 1 1 2 3 4 4 5
|
|
@4: 1 2 3 4 5
|
|
@5: (1,1) (-1,2) (-2,3) (2,4) (-3,5)
|
|
@6: (1,1) (-2,3) (-3,5)</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-unique_copy.html"><span class="t-lines"><span>ranges::unique_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-adjacent_find.html"><span class="t-lines"><span>ranges::adjacent_find</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-remove.html"><span class="t-lines"><span>ranges::remove</span><span>ranges::remove_if</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span><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-unique.html"><span class="t-lines"><span>unique</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>移除范围内的连续重复元素<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-list-unique.html"><span class="t-lines"><span>unique</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>删除连续的重复元素<br />
|
|
<span class="t-mark">(<code>std::list<T,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-forward_list-unique.html"><span class="t-lines"><span>unique</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>删除连续的重复元素<br />
|
|
<span class="t-mark">(<code>std::forward_list<T,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|