上传cppreference
This commit is contained in:
272
web/cppreference-zh/chmhelp/cpp-algorithm-ranges-equal.html
Normal file
272
web/cppreference-zh/chmhelp/cpp-algorithm-ranges-equal.html
Normal file
@@ -0,0 +1,272 @@
|
||||
<!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::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_algorithm_ranges_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::ranges::</span>equal</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">input_iterator</span> I1, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I1<span class="sy1">></span> S1,<br /></span>
|
||||
<p> std<span class="sy4">::</span><span class="me2">input_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I2<span class="sy1">></span> S2,<br />
|
||||
<span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span>,<br />
|
||||
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <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">indirectly_comparable</span><span class="sy1"><</span>I1, I2, Pred, Proj1, Proj2<span class="sy1">></span><br />
|
||||
<span class="kw4">constexpr</span> <span class="kw4">bool</span> equal<span class="br0">(</span> I1 first1, S1 last1, I2 first2, S2 last2,<br /></p>
|
||||
Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <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">input_range</span> R1, ranges<span class="sy4">::</span><span class="me2">input_range</span> R2,<br /></span>
|
||||
<p> <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span>,<br />
|
||||
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <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">indirectly_comparable</span><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">constexpr</span> <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> <span class="br0">{</span><span class="br0">}</span>,<br /></p>
|
||||
Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <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>[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>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>若二个范围拥有相同数量的元素,且每对被投影元素都满足 <code>pred</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>pred, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj1, <span class="sy2">*</span>first1<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>proj2, <span class="sy2">*</span>first2<span class="br0">)</span><span class="br0">)</span></span></span> 对范围中的所有对应元素对都返回 <code>true</code> 。</p>
|
||||
<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>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>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>若范围 <code>[first1, last1)</code> 的长度不等于范围 <code>[first2, last2)</code> 的长度,则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。</p>
|
||||
<p>若二个范围中的元素在投影后相等,则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。</p>
|
||||
<p>否则返回 <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.E8.A7.A3">注解</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>
|
||||
<p>至多应用 min(<code>last1</code> - <code>first1</code>, <code>last2</code> - <code>first2</code>) 次谓词和对应的投影。</p>
|
||||
<p>然而,若 <code>S1</code> 与 <code>S2</code> 均分别与其迭代器实现 <span class="t-lc">std::sized_sentinel_for</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> ,则不应用谓词(无需查看任何元素即可检测出大小不合)。</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> equal_fn <span class="br0">{</span>
|
||||
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_iterator</span> I1, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I1<span class="sy1">></span> S1,
|
||||
std<span class="sy4">::</span><span class="me2">input_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><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="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <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">indirectly_comparable</span><span class="sy1"><</span>I1, I2, Pred, Proj1, Proj2<span class="sy1">></span>
|
||||
<span class="kw4">constexpr</span> <span class="kw4">bool</span>
|
||||
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I1 first1, S1 last1, I2 first2, S2 last2,
|
||||
Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <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">if</span> <span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first1, last1<span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first2, last2<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="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> first1 <span class="sy3">!</span><span class="sy1">=</span> last1<span class="sy4">;</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><a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>pred, <a href="cpp-utility-functional-invoke.html"><span class="kw1058">std::<span class="me2">invoke</span></span></a><span class="br0">(</span>proj1, <span class="sy2">*</span>first1<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>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> <span class="kw2">true</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">input_range</span> R1, std<span class="sy4">::</span><span class="me2">input_range</span> R2,
|
||||
<span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span>,
|
||||
<span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>, <span class="kw1">class</span> Proj2 <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">indirectly_comparable</span><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>,
|
||||
Pred, Proj1, Proj2<span class="sy1">></span>
|
||||
<span class="kw4">constexpr</span> <span class="kw4">bool</span>
|
||||
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>R1<span class="sy3">&&</span> r1, R2<span class="sy3">&&</span> r2, Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj1 proj1 <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>, Proj2 proj2 <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>r1<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r1<span class="br0">)</span>,
|
||||
ranges<span class="sy4">::</span><span class="me2">begin</span><span class="br0">(</span>r2<span class="br0">)</span>, ranges<span class="sy4">::</span><span class="me2">end</span><span class="br0">(</span>r2<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>pred<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>proj1<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>proj2<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> equal_fn equal<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">
|
||||
<p>下列代码用 <code>equal()</code> 测试字符串是否为回文</p>
|
||||
<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 <iostream></span>
|
||||
<span class="co2">#include <string_view></span>
|
||||
<span class="co2">#include <ranges></span>
|
||||
|
||||
<span class="kw4">bool</span> is_palindrome<span class="br0">(</span><span class="kw4">const</span> <a href="cpp-string-basic_string_view.html"><span class="kw1248">std::<span class="me2">string_view</span></span></a> s<span class="br0">)</span>
|
||||
<span class="br0">{</span>
|
||||
<span class="kw1">namespace</span> views <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">views</span><span class="sy4">;</span>
|
||||
<span class="kw4">auto</span> forward <span class="sy1">=</span> s <span class="sy3">|</span> views<span class="sy4">::</span><span class="me2">take</span><span class="br0">(</span>s.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">/</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="kw4">auto</span> backward <span class="sy1">=</span> s <span class="sy3">|</span> views<span class="sy4">::</span><span class="me2">reverse</span> <span class="sy3">|</span> views<span class="sy4">::</span><span class="me2">take</span><span class="br0">(</span>s.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">/</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="kw1">return</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">equal</span><span class="br0">(</span>forward, backward<span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="br0">}</span>
|
||||
|
||||
<span class="kw4">void</span> test<span class="br0">(</span><span class="kw4">const</span> <a href="cpp-string-basic_string_view.html"><span class="kw1248">std::<span class="me2">string_view</span></span></a> s<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 class="es1">\"</span>"</span> <span class="sy1"><<</span> s <span class="sy1"><<</span> <span class="st0">"<span class="es1">\"</span> is"</span>
|
||||
<span class="sy1"><<</span> <span class="br0">(</span>is_palindrome<span class="br0">(</span>s<span class="br0">)</span> <span class="sy4">?</span> <span class="st0">""</span> <span class="sy4">:</span> <span class="st0">"not"</span><span class="br0">)</span>
|
||||
<span class="sy1"><<</span> <span class="st0">" a palindrome<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>
|
||||
test<span class="br0">(</span><span class="st0">"radar"</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
test<span class="br0">(</span><span class="st0">"hello"</span><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">"radar" is a palindrome
|
||||
"hello" is not a palindrome</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-find.html"><span class="t-lines"><span>ranges::find</span><span>ranges::find_if</span><span>ranges::find_if_not</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><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-lexicographical_compare.html"><span class="t-lines"><span>ranges::lexicographical_compare</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>当一个范围按字典顺序小于另一个范围时,返回 true<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-mismatch.html"><span class="t-lines"><span>ranges::mismatch</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-search.html"><span class="t-lines"><span>ranges::search</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-equal.html"><span class="t-lines"><span>equal</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>
|
||||
Reference in New Issue
Block a user