klarkxy/hustoj
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
ab2a3ca65fe48738b0c71d258cd43268385ce35b
hustoj/web/cppreference-zh/chmhelp/cpp-algorithm-ranges-find_first_of.html
klarkxy 196e706fe4 上传cppreference
2025-08-01 12:57:54 +08:00

290 lines
30 KiB
HTML
Raw Blame History

<!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::find_first_of</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_find_first_of 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>find_first_of</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">input_iterator</span> I1, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I1<span class="sy1">&gt;</span> S1,<br /></span>
<p>&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; std<span class="sy4">::</span><span class="me2">forward_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I2<span class="sy1">&gt;</span> S2,<br />
&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>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj2 <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>I1, I2, Pred, Proj1, Proj2<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> I1 find_first_of<span class="br0">(</span> I1 first1, S1 last1, I2 first2, S2 last2,<br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 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 &#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">input_range</span> R1, ranges<span class="sy4">::</span><span class="me2">forward_range</span> R2,<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>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">identity</span>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; <span class="kw1">class</span> Proj2 <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>R1<span class="sy1">&gt;</span>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R2<span class="sy1">&gt;</span>,<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;Pred, Proj1, Proj2<span class="sy1">&gt;</span><br />
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R1<span class="sy1">&gt;</span><br />
&nbsp; find_first_of<span class="br0">(</span> R1<span class="sy3">&amp;&amp;</span> r1, R2<span class="sy3">&amp;&amp;</span> r2, Pred pred <span class="sy1">=</span> <span class="br0">{</span><span class="br0">}</span>,<br /></p>
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;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 &#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>[first1, last1)</code> &#20013;&#25628;&#32034;<i>&#20219;&#20309;</i>&#33539;&#22260; <code>[first2, last2)</code> &#20013;&#30340;&#20803;&#32032;&#65292;&#20998;&#21035;&#20197; <code>proj1</code> &#19982; <code>proj2</code> &#25237;&#24433;&#33539;&#22260;&#12290;&#29992;&#20108;&#20803;&#35859;&#35789; <code>pred</code> &#27604;&#36739;&#25237;&#24433;&#21518;&#30340;&#20803;&#32032;&#12290;</div>
<div class="t-li1"><span class="t-li">2)</span> &#21516; <span class="t-v">(1)</span> &#65292;&#20294;&#20197; <code>r1</code> &#20026;&#31532;&#19968;&#28304;&#33539;&#22260;&#24182;&#20197; <code>r2</code> &#20026;&#31532;&#20108;&#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>r1<span class="br0">)</span></span></span> &#20026; <code>first1</code> &#65292;&#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>r1<span class="br0">)</span></span></span> &#20026; <code>last1</code> &#65292;&#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>r2<span class="br0">)</span></span></span> &#20026; <code>first2</code> &#65292;&#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>r2<span class="br0">)</span></span></span> &#20026; <code>last2</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>first1, last1</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>first2, last2</td>
<td>-</td>
<td>&#35201;&#25628;&#32034;&#30340;&#20803;&#32032;&#33539;&#22260;&#65288;&#21448;&#31216;<i>&#38024;</i>&#65289;</td>
</tr>
<tr class="t-par">
<td>r1</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>r2</td>
<td>-</td>
<td>&#35201;&#25628;&#32034;&#30340;&#20803;&#32032;&#33539;&#22260;&#65288;&#21448;&#31216;<i>&#38024;</i>&#65289;</td>
</tr>
<tr class="t-par">
<td>pred</td>
<td>-</td>
<td>&#27604;&#36739;&#20803;&#32032;&#30340;&#20108;&#20803;&#35859;&#35789;</td>
</tr>
<tr class="t-par">
<td>proj1</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#31532;&#19968;&#33539;&#22260;&#20013;&#20803;&#32032;&#30340;&#25237;&#24433;</td>
</tr>
<tr class="t-par">
<td>proj2</td>
<td>-</td>
<td>&#24212;&#29992;&#21040;&#31532;&#20108;&#33539;&#22260;&#20013;&#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>
<p>&#25351;&#21521;&#33539;&#22260; <code>[first1, last1)</code> &#20013;&#39318;&#20010;&#22312;&#25237;&#24433;&#21518;&#31561;&#20110;&#26469;&#33258;&#33539;&#22260; <code>[first2, last2)</code> &#20013;&#20803;&#32032;&#30340;&#36845;&#20195;&#22120;&#12290;&#33509;&#25214;&#19981;&#21040;&#36825;&#31181;&#20803;&#32032;&#65292;&#21017;&#36820;&#22238;&#31561;&#20110; <code>last1</code> &#30340;&#36845;&#20195;&#22120;&#12290;</p>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">&#22797;&#26434;&#24230;</span></h3>
<p>&#33267;&#22810;&#24212;&#29992; <code>(S*N)</code> &#27425;&#27604;&#36739;&#21644;&#21508;&#33258;&#30340;&#25237;&#24433;&#65292;&#20854;&#20013;<br />
<span class="t-v">(1)</span> <span class="t-c"><span class="mw-geshi cpp source-cpp">S <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></span> &#32780; <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">distance</span><span class="br0">(</span>first1, last1<span class="br0">)</span></span></span> &#65307;<br />
<span class="t-v">(2)</span> <span class="t-c"><span class="mw-geshi cpp source-cpp">S <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">size</span><span class="br0">(</span>r2<span class="br0">)</span></span></span> &#32780; <span class="t-c"><span class="mw-geshi cpp source-cpp">N <span class="sy1">=</span> ranges<span class="sy4">::</span><span class="me2">size</span><span class="br0">(</span>r1<span class="br0">)</span></span></span> &#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> find_first_of_fn <span class="br0">{</span>
<span class="kw1">template</span><span class="sy1">&lt;</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">&lt;</span>I1<span class="sy1">&gt;</span> S1,
std<span class="sy4">::</span><span class="me2">forward_iterator</span> I2, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1">&lt;</span>I2<span class="sy1">&gt;</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">&gt;</span>
requires std<span class="sy4">::</span><span class="me2">indirectly_comparable</span><span class="sy1">&lt;</span>I1, I2, Pred, Proj1, Proj2<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> I1 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">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="kw1">for</span> <span class="br0">(</span><span class="kw4">auto</span> i <span class="sy1">=</span> first2<span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> last2<span class="sy4">;</span> <span class="sy2">++</span>i<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>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>i<span class="br0">)</span><span class="br0">)</span><span class="br0">)</span>
<span class="kw1">return</span> first1<span class="sy4">;</span>
<span class="kw1">return</span> first1<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">input_range</span> R1, ranges<span class="sy4">::</span><span class="me2">forward_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">&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>R1<span class="sy1">&gt;</span>,
ranges<span class="sy4">::</span><span class="me2">iterator_t</span><span class="sy1">&lt;</span>R2<span class="sy1">&gt;</span>,
Pred, Proj1, Proj2<span class="sy1">&gt;</span>
<span class="kw4">constexpr</span> ranges<span class="sy4">::</span><span class="me2">borrowed_iterator_t</span><span class="sy1">&lt;</span>R1<span class="sy1">&gt;</span>
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>R1<span class="sy3">&amp;&amp;</span> r1, R2<span class="sy3">&amp;&amp;</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>,
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>proj1<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><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> find_first_of_fn find_first_of<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;iostream&gt;</span>
<span class="co2">#include &lt;iterator&gt;</span>
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
<span class="kw1">namespace</span> rng <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">static</span> <span class="kw4">auto</span> haystack <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">2</span>, <span class="nu0">3</span>, <span class="nu0">4</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">static</span> <span class="kw4">auto</span> needles <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">0</span>, <span class="nu0">3</span>, <span class="nu0">4</span>, <span class="nu0">3</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> found1 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">find_first_of</span><span class="br0">(</span>haystack.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, haystack.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>,
needles.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, needles.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>haystack.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, found1<span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> found2 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">find_first_of</span><span class="br0">(</span>haystack, needles<span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>haystack.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, found2<span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">static</span> <span class="kw4">auto</span> negatives <span class="sy1">=</span> <span class="br0">{</span><span class="sy2">-</span><span class="nu0">6</span>, <span class="sy2">-</span><span class="nu0">3</span>, <span class="sy2">-</span><span class="nu0">4</span>, <span class="sy2">-</span><span class="nu0">3</span><span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">auto</span> not_found <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">find_first_of</span><span class="br0">(</span>haystack, negatives<span class="br0">)</span><span class="sy4">;</span>
static_assert<span class="br0">(</span>not_found <span class="sy1">==</span> haystack.<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> found3 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">find_first_of</span><span class="br0">(</span>haystack, negatives,
<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> x <span class="sy1">==</span> <span class="sy2">-</span>y<span class="sy4">;</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span> <span class="co1">// &#20351;&#29992;&#20108;&#20803;&#27604;&#36739;&#22120;</span>
static_assert<span class="br0">(</span><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>haystack.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, found3<span class="br0">)</span> <span class="sy1">==</span> <span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
<span class="kw1">struct</span> P <span class="br0">{</span> <span class="kw4">int</span> x, y<span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">static</span> <span class="kw4">auto</span> p1 <span class="sy1">=</span> <span class="br0">{</span> P<span class="br0">{</span><span class="nu0">1</span>, <span class="sy2">-</span><span class="nu0">1</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">2</span>, <span class="sy2">-</span><span class="nu0">2</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">3</span>, <span class="sy2">-</span><span class="nu0">3</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">4</span>, <span class="sy2">-</span><span class="nu0">4</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="kw4">constexpr</span> <span class="kw4">static</span> <span class="kw4">auto</span> p2 <span class="sy1">=</span> <span class="br0">{</span> P<span class="br0">{</span><span class="nu0">5</span>, <span class="sy2">-</span><span class="nu0">5</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">6</span>, <span class="sy2">-</span><span class="nu0">3</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">7</span>, <span class="sy2">-</span><span class="nu0">5</span><span class="br0">}</span>, P<span class="br0">{</span><span class="nu0">8</span>, <span class="sy2">-</span><span class="nu0">3</span><span class="br0">}</span> <span class="br0">}</span><span class="sy4">;</span>
<span class="co1">// &#20165;&#27604;&#36739; P::y &#25968;&#25454;&#25104;&#21592;&#65292;&#36890;&#36807;&#25237;&#24433;&#23427;&#20204;&#65306;</span>
<span class="kw4">const</span> <span class="kw4">auto</span> found4 <span class="sy1">=</span> rng<span class="sy4">::</span><span class="me2">find_first_of</span><span class="br0">(</span>p1, p2, <span class="br0">{</span><span class="br0">}</span>, <span class="sy3">&amp;</span>P<span class="sy4">::</span><span class="me2">y</span>, <span class="sy3">&amp;</span>P<span class="sy4">::</span><span class="me2">y</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;First equivalent element {&quot;</span> <span class="sy1">&lt;&lt;</span> found4<span class="sy2">-</span><span class="sy1">&gt;</span>x <span class="sy1">&lt;&lt;</span> <span class="st0">&quot;, &quot;</span> <span class="sy1">&lt;&lt;</span> found4<span class="sy2">-</span><span class="sy1">&gt;</span>y
<span class="sy1">&lt;&lt;</span> <span class="st0">&quot;} was found at position &quot;</span> <span class="sy1">&lt;&lt;</span> <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>p1.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, found4<span class="br0">)</span>
<span class="sy1">&lt;&lt;</span> <span class="st0">&quot;.<span class="es1">\n</span>&quot;</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">First equavalent element {3, -3} was found at position 2.</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-find_first_of.html"><span class="t-lines"><span>find_first_of</span></span></a></div>
</div>
</td>
<td>&#25628;&#32034;&#20803;&#32032;&#38598;&#21512;&#20013;&#30340;&#20219;&#24847;&#20803;&#32032;<br />
<span class="t-mark">(&#20989;&#25968;&#27169;&#26495;)</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>&#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-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-ranges-search_n.html"><span class="t-lines"><span>ranges::search_n</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;&#33539;&#22260;&#20013;&#25628;&#32034;&#19968;&#23450;&#37327;&#30340;&#26576;&#20010;&#20803;&#32032;&#30340;&#36830;&#32493;&#21103;&#26412;<br />
<span class="t-mark">(niebloid)</span></td>
</tr>
</table>
</div>
<div class="visualClear"></div>
</div>
</div>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink