klarkxy/hustoj
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

上传cppreference

Browse Source
This commit is contained in:
klarkxy
2025-08-01 12:57:54 +08:00
parent e29892f8cd
commit 196e706fe4
5485 changed files with 982007 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

335
web/cppreference-zh/chmhelp/cpp-algorithm-ranges-search_n.html Normal file
View File

@@ -0,0 +1,335 @@
<!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::search_n</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_search_n 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>search_n</h1>
<div id="bodyContent">
<div id="contentSub"><span class="subpages">&lt; <a href="cpp.html">cpp</a>&lrm; | <a href="cpp-algorithm.html">algorithm</a>&lrm; | <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>&#23450;&#20041;&#20110;&#22836;&#25991;&#20214; <code><a href="cpp-header-algorithm.html">&lt;algorithm&gt;</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>&#35843;&#29992;&#31614;&#21517;</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">&lt;</span> std<span class="sy4">::</span><span class="me2">forward_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> S, <span class="kw1">class</span> T,<br /></span>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <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> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">&gt;</span><br />
requires &nbsp;std<span class="sy4">::</span><span class="me2">indirectly_comparable</span><span class="sy1">&lt;</span>I, <span class="kw4">const</span> T<span class="sy2">*</span>, Pred, Proj<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">subrange</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span><br />
&nbsp; search_n<span class="br0">(</span> I first, S last, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> count,<br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Pred pred <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 &#36215;)</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">&lt;</span> ranges<span class="sy4">::</span><span class="me2">forward_range</span> R, <span class="kw1">class</span> T, <span class="kw1">class</span> Pred <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">equal_to</span>,<br /></span>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span> <span class="sy1">&gt;</span><br />
requires &nbsp;std<span class="sy4">::</span><span class="me2">indirectly_comparable</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, <span class="kw4">const</span> T<span class="sy2">*</span>, Pred, Proj<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span><br />
&nbsp; search_n<span class="br0">(</span> R<span class="sy3">&amp;&amp;</span> r, ranges<span class="sy4">::</span><span class="me2">range_difference_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span> count,<br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Pred pred <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 &#36215;)</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> &#22312;&#33539;&#22260; <code>[first, last)</code> &#20013;&#25628;&#32034;<i>&#39318;&#20010;</i> <code>count</code> &#20803;&#32032;&#30340;&#24207;&#21015;&#65292;&#20854;&#25237;&#24433;&#21518;&#30340;&#20540;&#25353;&#29031;&#20108;&#20803;&#35859;&#35789; <code>pred</code> &#31561;&#20110;&#32473;&#23450;&#30340;&#20540; <code>value</code> &#12290;</div>
<div class="t-li1"><span class="t-li">2)</span> &#21516; <span class="t-v">(1)</span> &#65292;&#20294;&#20197; <code>r</code> &#20026;&#28304;&#33539;&#22260;&#65292;&#22914;&#21516;&#20197; <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> &#20026; <code>first</code> &#24182;&#20197; <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> &#20026; <code>last</code> &#12290;</div>
<p>&#27492;&#39029;&#38754;&#19978;&#25551;&#36848;&#30340;&#20223;&#20989;&#25968;&#23454;&#20307;&#26159; <i>niebloid</i> &#65292;&#21363;&#65306;</p>
<ul>
<li>&#35843;&#29992;&#23427;&#20204;&#20013;&#30340;&#20219;&#20309;&#19968;&#32773;&#26102;&#19981;&#21487;&#25351;&#23450;&#26174;&#24335;&#27169;&#26495;&#23454;&#21442;&#12290;</li>
<li>&#23427;&#20204;&#26080;&#19968;&#23545;<a href="cpp-language-adl.html">&#23454;&#21442;&#20381;&#36182;&#26597;&#25214;</a>&#21487;&#35265;&#12290;</li>
<li>&#22312;<a href="cpp-language-unqualified_lookup.html">&#36890;&#24120;&#26080;&#38480;&#23450;&#26597;&#25214;</a>&#23547;&#25214;&#20989;&#25968;&#35843;&#29992;&#36816;&#31639;&#31526;&#24038;&#20391;&#30340;&#21517;&#31216;&#25214;&#21040;&#23427;&#20204;&#20043;&#19968;&#26102;&#65292;&#23427;&#31105;&#27490;<a href="cpp-language-adl.html">&#23454;&#21442;&#20381;&#36182;&#26597;&#25214;</a>&#12290;</li>
</ul>
<p>&#23454;&#38469;&#19978;&#65292;&#23427;&#20204;&#33021;&#20197;&#20989;&#25968;&#23545;&#35937;&#65292;&#25110;&#20197;&#26576;&#20123;&#29305;&#27530;&#32534;&#35793;&#22120;&#25193;&#23637;&#23454;&#29616;&#12290;</p>
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">&#21442;&#25968;</span></h3>
<table class="t-par-begin">
<tr class="t-par">
<td>first, last</td>
<td>-</td>
<td>&#35201;&#26816;&#39564;&#30340;&#20803;&#32032;&#33539;&#22260;&#65288;&#21448;&#31216;<i>&#33609;&#22534;</i>&#65289;</td>
</tr>
<tr class="t-par">
<td>r</td>
<td>-</td>
<td>&#35201;&#26816;&#39564;&#30340;&#20803;&#32032;&#33539;&#22260;&#65288;&#21448;&#31216;<i>&#33609;&#22534;</i>&#65289;</td>
</tr>
<tr class="t-par">
<td>count</td>
<td>-</td>
<td>&#35201;&#25628;&#32034;&#30340;&#24207;&#21015;&#38271;&#24230;</td>
</tr>
<tr class="t-par">
<td>value</td>
<td>-</td>
<td>&#35201;&#25628;&#32034;&#30340;&#20540;&#65288;&#21448;&#31216;<i>&#38024;</i>&#65289;</td>
</tr>
<tr class="t-par">
<td>pred</td>
<td>-</td>
<td>&#27604;&#36739;&#25237;&#24433;&#21518;&#20803;&#32032;&#19982; <code>value</code> &#30340;&#20108;&#20803;&#35859;&#35789;</td>
</tr>
<tr class="t-par">
<td>proj</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#35201;&#26816;&#39564;&#30340;&#33539;&#22260;&#30340;&#20803;&#32032;&#30340;&#25237;&#24433;</td>
</tr>
</table>
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">&#36820;&#22238;&#20540;</span></h3>
<div class="t-li1"><span class="t-li">1)</span> &#36820;&#22238;&#21547;&#26377;&#33539;&#22260; <code>[first, last)</code> &#20013;&#25351;&#20195;&#25214;&#21040;&#30340;&#24207;&#21015;&#30340;&#19968;&#23545;&#36845;&#20195;&#22120;&#30340; <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">subrange</span></span></span> &#12290;
<p>&#33509;&#25214;&#19981;&#21040;&#36825;&#31181;&#24207;&#21015;&#65292;&#21017;&#36820;&#22238; <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">subrange</span><span class="br0">{</span>last, last<span class="br0">}</span></span></span> &#12290;</p>
&#33509; <span class="t-c"><span class="mw-geshi cpp source-cpp">count &le; <span class="nu0">0</span></span></span> &#21017;&#36820;&#22238; <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">subrange</span><span class="br0">{</span>first, first<span class="br0">}</span></span></span> &#12290;</div>
<div class="t-li1"><span class="t-li">2)</span> &#21516; <span class="t-v">(1)</span> &#65292;&#20294;&#36820;&#22238;&#31867;&#22411;&#20026; <span class="t-c"><span class="mw-geshi cpp source-cpp">ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span></span></span> &#12290;</div>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">&#22797;&#26434;&#24230;</span></h3>
<p>&#32447;&#24615;&#65306;&#33267;&#22810;&#24212;&#29992; <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></span> &#27425;&#35859;&#35789;&#19982;&#25237;&#24433;&#12290;</p>
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">&#27880;&#35299;</span></h3>
<p>&#33509;&#36845;&#20195;&#22120;&#23454;&#29616; <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">random_access_iterator</span></span></span> &#21017;&#23454;&#29616;&#21487;&#20197;&#25552;&#21319;<i>&#24179;&#22343;</i>&#25628;&#32034;&#25928;&#29575;&#12290;</p>
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">&#21487;&#33021;&#30340;&#23454;&#29616;</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> search_n_fn
<span class="br0">{</span>
<span class="kw1">template</span><span class="sy1">&lt;</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> S, <span class="kw1">class</span> T,
<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> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">indirectly_comparable</span><span class="sy1">&lt;</span>I, <span class="kw4">const</span> T<span class="sy2">*</span>, Pred, Proj<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">subrange</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span>
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I first, S last, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> count,
<span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Pred pred <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">if</span> <span class="br0">(</span>count <span class="sy1">&lt;=</span> <span class="nu0">0</span><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="kw1">for</span> <span class="br0">(</span><span class="sy4">;</span> first <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>first<span class="br0">)</span> <span class="br0">{</span>
<span class="kw1">if</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>pred, <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>, value<span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
I start <span class="sy1">=</span> first<span class="sy4">;</span>
std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1">&lt;</span>I<span class="sy1">&gt;</span> n<span class="br0">{</span><span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw1">for</span> <span class="br0">(</span><span class="sy4">;;</span><span class="br0">)</span> <span class="br0">{</span>
<span class="kw1">if</span> <span class="br0">(</span>n<span class="sy2">++</span> <span class="sy1">==</span> count<span class="br0">)</span>
<span class="kw1">return</span> <span class="br0">{</span>start, <a href="cpp-iterator-next.html"><span class="kw674">std::<span class="me2">next</span></span></a><span class="br0">(</span>first<span class="br0">)</span><span class="br0">}</span><span class="sy4">;</span> <span class="co1">// &#25214;&#21040;</span>
<span class="kw1">if</span> <span class="br0">(</span><span class="sy2">++</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="co1">// &#25214;&#19981;&#21040;</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>proj, <span class="sy2">*</span>first<span class="br0">)</span>, value<span class="br0">)</span><span class="br0">)</span>
<span class="kw1">break</span><span class="sy4">;</span> <span class="co1">// not equ to value</span>
<span class="br0">}</span>
<span class="br0">}</span>
<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="br0">}</span>
<span class="kw1">template</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span> R, <span class="kw1">class</span> T, <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> Proj <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span><span class="sy1">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">indirectly_comparable</span><span class="sy1">&lt;</span>ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>, <span class="kw4">const</span> T<span class="sy2">*</span>, Pred, Proj<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_subrange_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span>
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>R<span class="sy3">&amp;&amp;</span> r, ranges<span class="sy4">::</span><span class="me2">range_difference_t</span><span class="sy1">&lt;</span>R<span class="sy1">&gt;</span> count,
<span class="kw4">const</span> T<span class="sy3">&amp;</span> value, Pred pred <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>count<span class="br0">)</span>, value,
std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>pred<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> search_n_fn search_n<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">&#31034;&#20363;</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 &lt;algorithm&gt;</span>
<span class="co2">#include &lt;iomanip&gt;</span>
<span class="co2">#include &lt;iostream&gt;</span>
<span class="co2">#include &lt;string&gt;</span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
<span class="kw4">static</span> <span class="kw4">constexpr</span> <span class="kw4">auto</span> nums <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">2</span>, <span class="nu0">2</span>, <span class="nu0">1</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">int</span> count<span class="br0">{</span> <span class="nu0">3</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">int</span> value<span class="br0">{</span> <span class="nu0">2</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> result1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">search_n</span><span class="br0">(</span>
nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, nums.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, count, value
<span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span> <span class="co1">// &#25214;&#21040;</span>
result1.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> count <span class="sy3">&amp;&amp;</span>
<a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, result1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">6</span> <span class="sy3">&amp;&amp;</span>
<a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, result1.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">9</span>
<span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> result2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">search_n</span><span class="br0">(</span>nums, count, value<span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span> <span class="co1">// &#25214;&#21040;</span>
result2.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> count <span class="sy3">&amp;&amp;</span>
<a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, result2.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">6</span> <span class="sy3">&amp;&amp;</span>
<a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, result2.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">9</span>
<span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> result3 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">search_n</span><span class="br0">(</span>nums, count, <span class="coMULTI">/* value */</span> <span class="nu0">5</span><span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span> <span class="co1">// &#25214;&#19981;&#21040;</span>
result3.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">0</span> <span class="sy3">&amp;&amp;</span>
result3.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> result3.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span> <span class="sy3">&amp;&amp;</span>
result3.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> nums.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>
<span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> result4 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">search_n</span><span class="br0">(</span>nums, <span class="coMULTI">/* count */</span> <span class="nu0">0</span>, <span class="coMULTI">/* value */</span> <span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span> <span class="co1">// &#25214;&#19981;&#21040;</span>
result4.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">0</span> <span class="sy3">&amp;&amp;</span>
result4.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> result4.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span> <span class="sy3">&amp;&amp;</span>
result4.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">==</span> nums.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>
<span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">char</span> symbol<span class="br0">{</span><span class="st0">&#39;B&#39;</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">&lt;&lt;</span> <a href="cpp-io-manip-boolalpha.html"><span class="kw1764">std::<span class="me2">boolalpha</span></span></a> <span class="sy1">&lt;&lt;</span> <span class="st0">&quot;Find a sub-sequence: &quot;</span>
<span class="sy1">&lt;&lt;</span> <a href="cpp-io-manip-quoted.html"><span class="kw1802">std::<span class="me2">quoted</span></span></a><span class="br0">(</span><a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a><span class="br0">(</span>count, symbol<span class="br0">)</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> <span class="st0">&#39;<span class="es1">\n</span>&#39;</span><span class="sy4">;</span>
<span class="kw4">auto</span> result5 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">search_n</span><span class="br0">(</span>nums, count, symbol,
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">char</span> x, <span class="kw4">const</span> <span class="kw4">char</span> y<span class="br0">)</span> <span class="br0">{</span> <span class="co1">// &#20108;&#20803;&#35859;&#35789;</span>
<span class="kw4">const</span> <span class="kw4">bool</span> o<span class="br0">{</span> x <span class="sy1">==</span> y <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">&lt;&lt;</span> <span class="st0">&quot;bin_op(&quot;</span> <span class="sy1">&lt;&lt;</span> x <span class="sy1">&lt;&lt;</span> <span class="st0">&quot;, &quot;</span> <span class="sy1">&lt;&lt;</span> y <span class="sy1">&lt;&lt;</span> <span class="st0">&quot;) == &quot;</span> <span class="sy1">&lt;&lt;</span> o <span class="sy1">&lt;&lt;</span> <span class="st0">&quot;<span class="es1">\n</span>&quot;</span><span class="sy4">;</span>
<span class="kw1">return</span> o<span class="sy4">;</span>
<span class="br0">}</span>,
<span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">int</span> z<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="st0">&#39;A&#39;</span> <span class="sy2">+</span> z <span class="sy2">-</span> <span class="nu0">1</span><span class="sy4">;</span> <span class="br0">}</span> <span class="co1">// &#25237;&#24433;&#25968;&#23383; -&gt; ASCII</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">&lt;&lt;</span> <span class="st0">&quot;Found: &quot;</span> <span class="sy1">&lt;&lt;</span> <span class="sy3">!</span>result5.<span class="me1">empty</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> <span class="st0">&#39;<span class="es1">\n</span>&#39;</span><span class="sy4">;</span>
<span class="br0">}</span></pre></div>
</div>
<p>&#36755;&#20986;&#65306;</p>
<div dir="ltr" class="mw-geshi" style="text-align: left;">
<div class="text source-text">
<pre class="de1">Find a sub-sequence: &quot;BBB&quot;
bin_op(A, B) == false
bin_op(B, B) == true
bin_op(B, B) == true
bin_op(C, B) == false
bin_op(D, B) == false
bin_op(A, B) == false
bin_op(B, B) == true
bin_op(B, B) == true
bin_op(B, B) == true
Found: true</pre></div>
</div>
</div>
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">&#21442;&#38405;</span></h3>
<table class="t-dsc-begin">
<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>&#26597;&#25214;&#39318;&#23545;&#30456;&#37051;&#30340;&#30456;&#21516;&#65288;&#25110;&#28385;&#36275;&#32473;&#23450;&#35859;&#35789;&#30340;&#65289;&#20803;&#32032;<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-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>&#23547;&#25214;&#39318;&#20010;&#28385;&#36275;&#29305;&#23450;&#21028;&#21035;&#26631;&#20934;&#30340;&#20803;&#32032;<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-find_end.html"><span class="t-lines"><span>ranges::find_end</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>&#22312;&#29305;&#23450;&#33539;&#22260;&#20013;&#23547;&#25214;&#26368;&#21518;&#20986;&#29616;&#30340;&#20803;&#32032;&#24207;&#21015;<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-find_first_of.html"><span class="t-lines"><span>ranges::find_first_of</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>&#25628;&#32034;&#20803;&#32032;&#38598;&#21512;&#20013;&#30340;&#20219;&#19968;&#20803;&#32032;<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-includes.html"><span class="t-lines"><span>ranges::includes</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>&#33509;&#19968;&#20010;&#24207;&#21015;&#26159;&#21478;&#19968;&#20010;&#30340;&#23376;&#21015;&#21017;&#36820;&#22238; <code>true</code><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>&#23547;&#25214;&#20004;&#20010;&#33539;&#22260;&#20986;&#29616;&#19981;&#21516;&#30340;&#39318;&#20010;&#20301;&#32622;<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>&#25628;&#32034;&#19968;&#20010;&#20803;&#32032;&#33539;&#22260;<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-search_n.html"><span class="t-lines"><span>search_n</span></span></a></div>
</div>
</td>
<td>&#22312;&#33539;&#22260;&#20013;&#25628;&#32034;&#19968;&#23450;&#37327;&#30340;&#26576;&#20010;&#20803;&#32032;&#30340;&#36830;&#32493;&#21103;&#26412;<br />
<span class="t-mark">(&#20989;&#25968;&#27169;&#26495;)</span></td>
</tr>
</table>
</div>
<div class="visualClear"></div>
</div>
</div>
</div>
</body>
</html>