245 lines
26 KiB
HTML
245 lines
26 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::equal</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_equal 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>equal</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> InputIterator I1, Sentinel<span class="sy1"><</span>I1<span class="sy1">></span> S1, InputIterator I2, Sentinel<span class="sy1"><</span>I2<span class="sy1">></span> S2,<br /></span>
|
|
<p> <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1"><></span>,<br />
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires IndirectlyComparable<span class="sy1"><</span>I1, I2, Pred, Proj1, Proj2<span class="sy1">></span><br />
|
|
<span class="kw4">bool</span> equal<span class="br0">(</span>I1 first1, S1 last1, I2 first2, S2 last2, Pred pred <span class="sy1">=</span> Pred<span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj1 proj1 <span class="sy1">=</span> Proj1<span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> Proj2<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> InputRange R1, InputRange R2, <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1"><></span>,<br /></span>
|
|
<p> <span class="kw1">class</span> Proj1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires IndirectlyComparable<span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R1<span class="sy1">></span>, ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R2<span class="sy1">></span>,<br />
|
|
Pred, Proj1, Proj2<span class="sy1">></span><br />
|
|
<span class="kw4">bool</span> equal<span class="br0">(</span>R1<span class="sy3">&&</span> r1, R2<span class="sy3">&&</span> r2, Pred pred <span class="sy1">=</span> Pred<span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj1 proj1 <span class="sy1">=</span> Proj1<span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> Proj2<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 t-since-ranges">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> InputIterator I1, Sentinel<span class="sy1"><</span>I1<span class="sy1">></span> S1, <span class="kw1">class</span> I2,<br /></span>
|
|
<p> <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1"><></span>,<br />
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires InputIterator<span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>I2<span class="sy1">>></span> <span class="sy3">&&</span> <span class="sy3">!</span>Range<span class="sy1"><</span>I2<span class="sy1">></span> <span class="sy3">&&</span><br />
|
|
IndirectlyComparable<span class="sy1"><</span>I1, <a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>I2<span class="sy1">></span>, Pred, Proj1, Proj2<span class="sy1">></span><br />
|
|
<span class="kw4">bool</span> equal<span class="br0">(</span>I1 first1, S1 last1, I2<span class="sy3">&&</span> first2_, Pred pred <span class="sy1">=</span> Pred<span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj1 proj1 <span class="sy1">=</span> Proj1<span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> Proj2<span class="br0">{</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td><span class="t-mark-rev t-since-ranges-ts t-mark-ts">(范围 TS)</span><br />
|
|
<span class="t-mark">(弃用)</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> InputRange R1, <span class="kw1">class</span> I2, <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1"><></span>,<br /></span>
|
|
<p> <span class="kw1">class</span> Proj1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span><br />
|
|
requires InputIterator<span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>I2<span class="sy1">>></span> <span class="sy3">&&</span> <span class="sy3">!</span>Range<span class="sy1"><</span>I2<span class="sy1">></span> <span class="sy3">&&</span><br />
|
|
IndirectlyComparable<span class="sy1"><</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1"><</span>R1<span class="sy1">></span>, <a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>I2<span class="sy1">></span>, Pred, Proj1, Proj2<span class="sy1">></span><br />
|
|
<span class="kw4">bool</span> equal<span class="br0">(</span>R1<span class="sy3">&&</span> r1, I2<span class="sy3">&&</span> first2_, Pred pred <span class="sy1">=</span> Pred<span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
|
Proj1 proj1 <span class="sy1">=</span> Proj1<span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> Proj2<span class="br0">{</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td>(4)</td>
|
|
<td><span class="t-mark-rev t-since-ranges-ts t-mark-ts">(范围 TS)</span><br />
|
|
<span class="t-mark">(弃用)</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>[first1, last1)</code> 等于 <code>[first2, last2)</code> 则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> ，否则返回 <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>r1</code> 为第一源范围并以 <code>r2</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>r1<span class="br0">)</span></span></span> 为 <code>first1</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>r1<span class="br0">)</span></span></span> 为 <code>last1</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>r2<span class="br0">)</span></span></span> 为 <code>first2</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>r2<span class="br0">)</span></span></span> 为 <code>last2</code> 。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 同 <span class="t-v">(1)</span> ，除了在穷尽第一范围或检测到首个不匹配时认为第二范围结束。等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw1">return</span> last1 <span class="sy1">==</span> ranges<span class="sy4">::</span><span class="me2">mismatch</span><span class="br0">(</span>first1, last1, <a href="cpp-utility-forward.html"><span class="kw1117">std::<span class="me2">forward</span></span></a><span class="sy1"><</span>I2<span class="sy1">></span><span class="br0">(</span>first2_<span class="br0">)</span>, comp, proj1, proj2<span class="br0">)</span>.<span class="me1">in1</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">4)</span> 同 <span class="t-v">(3)</span> ，但以 <code>r1</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>r1<span class="br0">)</span></span></span> 为 <code>first1</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>r1<span class="br0">)</span></span></span> 为 <code>last1</code> 。</div>
|
|
<p>若二个范围有相同数量的元素，且对于范围 <code>[first1,last1)</code> 中的每个迭代器 <code>i</code> ， <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>pred, ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>proj1, <span class="sy2">*</span>i<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>proj2, <span class="sy2">*</span><span class="br0">(</span>first2 <span class="sy2">+</span> <span class="br0">(</span>i <span class="sy2">-</span> first1<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span></span></span> 为 <code>true</code> ，则认为二个范围相等。</p>
|
|
<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>first1, last1</td>
|
|
<td>-</td>
|
|
<td>第一元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>r1</td>
|
|
<td>-</td>
|
|
<td>第一元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first2, last2</td>
|
|
<td>-</td>
|
|
<td>第二元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>r2</td>
|
|
<td>-</td>
|
|
<td>第二元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first2_</td>
|
|
<td>-</td>
|
|
<td>第二元素范围的起始</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>pred</td>
|
|
<td>-</td>
|
|
<td>应用到投影后元素的谓词</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj1</td>
|
|
<td>-</td>
|
|
<td>应用到第一范围中元素的投影</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>proj2</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="kw2">true</span></span></span> ，否则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E6.84.8F">注意</span></h3>
|
|
<p>不应该用 <code>ranges::equal</code> 比较来自 <span class="t-lc"><a href="cpp-container-unordered_set.html">std::unordered_set</a></span> 、 <span class="t-lc"><a href="cpp-container-unordered_multiset.html">std::unordered_multiset</a></span> 、 <span class="t-lc"><a href="cpp-container-unordered_map.html">std::unordered_map</a></span> 或 <span class="t-lc"><a href="cpp-container-unordered_multimap.html">std::unordered_multimap</a></span> 的迭代器所组成的范围，因为即使二个容器存储相同的元素，在容器中存储元素的顺序也可能不同。</p>
|
|
<p>比较整个容器是否相等时，通常更偏好使用对应容器的 <code>operator==</code> 。</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<div class="t-li1"><span class="t-li">1-2)</span> 若满足 <span class="t-c"><span class="mw-geshi cpp source-cpp">SizedSentinel<span class="sy1"><</span>S1, I1<span class="sy1">></span> <span class="sy3">&&</span> SizedSentinel<span class="sy1"><</span>S2, I2<span class="sy1">></span></span></span> 且 <span class="t-c"><span class="mw-geshi cpp source-cpp">last1 <span class="sy2">-</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last2 <span class="sy2">-</span> first2</span></span> ，则不应用谓词和投影。否则至多应用 min(<code>last1</code> - <code>first1</code>, <code>last2</code> - <code>first2</code>) 次谓词及各一次投影。</div>
|
|
<div class="t-li1"><span class="t-li">3-4)</span> 至多应用 <code>last1</code> - <code>first1</code> 次谓词及各一次投影。</div>
|
|
<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">namespace</span> detail
|
|
<span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span> InputIterator I1, SizedSentinel<span class="sy1"><</span>I1<span class="sy1">></span> S1,
|
|
InputIterator I2, SizedSentinel<span class="sy1"><</span>I1<span class="sy1">></span> S2 <span class="sy1">></span>
|
|
<span class="kw4">bool</span> check_size<span class="br0">(</span>I1<span class="sy3">&</span> first1, S1<span class="sy3">&</span> last1, I2<span class="sy3">&</span> first2, S2<span class="sy3">&</span> last2<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">return</span> last1 <span class="sy2">-</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last2 <span class="sy2">-</span> first2<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span> InputIterator I1, Sentinel<span class="sy1"><</span>I1<span class="sy1">></span> S1, InputIterator I2, Sentinel<span class="sy1"><</span>I1<span class="sy1">></span> S2 <span class="sy1">></span>
|
|
<span class="kw4">bool</span> check_size<span class="br0">(</span>I1<span class="sy3">&</span> first1, S1<span class="sy3">&</span> last1, I2<span class="sy3">&</span> first2, S2<span class="sy3">&</span> last2<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="kw2">false</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span> InputIterator I1, Sentinel<span class="sy1"><</span>I1<span class="sy1">></span> S1, InputIterator I2, Sentinel<span class="sy1"><</span>I2<span class="sy1">></span> S2,
|
|
<span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span><span class="sy1"><></span>,
|
|
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">></span>
|
|
requires IndirectlyComparable<span class="sy1"><</span>I1, I2, Pred, Proj1, Proj2<span class="sy1">></span>
|
|
<span class="kw4">bool</span> equal<span class="br0">(</span>I1 first1, S1 last1, I2 first2, S2 last2, Pred pred <span class="sy1">=</span> Pred<span class="br0">{</span><span class="br0">}</span>,
|
|
Proj1 proj1 <span class="sy1">=</span> Proj1<span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <span class="sy1">=</span> Proj2<span class="br0">{</span><span class="br0">}</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">if</span><span class="br0">(</span>detail<span class="sy4">::</span><span class="me2">check_size</span><span class="br0">(</span>first1, last1, first2, last2<span class="br0">)</span><span class="br0">)</span> <span class="kw1">return</span> <span class="kw2">false</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="sy4">;</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last1 <span class="sy3">&&</span> first2 <span class="sy3">!</span><span class="sy1">=</span> last2<span class="sy4">;</span> <span class="br0">(</span><span class="kw4">void</span><span class="br0">)</span> <span class="sy2">++</span>first1, <span class="br0">(</span><span class="kw4">void</span><span class="br0">)</span><span class="sy2">++</span>first2<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">if</span><span class="br0">(</span><span class="sy3">!</span>ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>pred, ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>proj1, <span class="sy2">*</span>first1<span class="br0">)</span>,
|
|
ranges<span class="sy4">::</span><span class="me2">invoke</span><span class="br0">(</span>proj2, <span class="sy2">*</span>first2<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">return</span> <span class="kw2">false</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">return</span> first1 <span class="sy1">==</span> last1 <span class="sy3">&&</span> first2 <span class="sy1">==</span> last2<span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<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-equal.html"><span class="t-lines"><span>equal</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="https://zh.cppreference.com/mwiki/index.php?title=cpp/experimental/ranges/algorithm/find&action=edit&redlink=1" class="new" title="cpp/experimental/ranges/algorithm/find（页面不存在）"><span class="t-lines"><span>find</span><span>find_if</span><span>find_if_not</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="https://zh.cppreference.com/mwiki/index.php?title=cpp/experimental/ranges/algorithm/lexicographical_compare&action=edit&redlink=1" class="new" title="cpp/experimental/ranges/algorithm/lexicographical compare（页面不存在）"><span class="t-lines"><span>lexicographical_compare</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>当一个范围按字典顺序小于另一个范围时，返回 true<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="https://zh.cppreference.com/mwiki/index.php?title=cpp/experimental/ranges/algorithm/mismatch&action=edit&redlink=1" class="new" title="cpp/experimental/ranges/algorithm/mismatch（页面不存在）"><span class="t-lines"><span>mismatch</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="https://zh.cppreference.com/mwiki/index.php?title=cpp/experimental/ranges/algorithm/search&action=edit&redlink=1" class="new" title="cpp/experimental/ranges/algorithm/search（页面不存在）"><span class="t-lines"><span>search</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>
|