258 lines
31 KiB
HTML
258 lines
31 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>std::ranges::ends_with</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_ends_with 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>ends_with</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-cxx23">
|
|
<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 <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span><span class="sy1"><</span>I1<span class="sy1">></span> <span class="sy3">||</span> std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S1, I1<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span><br />
|
|
<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span><span class="sy1"><</span>I2<span class="sy1">></span> <span class="sy3">||</span> std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S2, I2<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span><br />
|
|
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> ends_with<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>,<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>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx23">
|
|
<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 <span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span><span class="sy1"><</span>R1<span class="sy1">></span> <span class="sy3">||</span> ranges<span class="sy4">::</span><span class="me2">sized_range</span><span class="sy1"><</span>R1<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span><br />
|
|
<span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span><span class="sy1"><</span>R2<span class="sy1">></span> <span class="sy3">||</span> ranges<span class="sy4">::</span><span class="me2">sized_range</span><span class="sy1"><</span>R2<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span><br />
|
|
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>,<br />
|
|
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> ends_with<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-cxx23">(C++23 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>检查第二范围是否匹配第一范围的后缀。</p>
|
|
<div class="t-li1"><span class="t-li">1)</span> 令 <code>N1</code> 与 <code>N2</code> 分别为 <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>first1, last1<span class="br0">)</span></span></span> 与 <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>first2, last2<span class="br0">)</span></span></span> 。若 <span class="t-c"><span class="mw-geshi cpp source-cpp">N1 <span class="sy1"><</span> N2</span></span> 则返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 。否则,当且仅当 <code>[first2, last2)</code> 范围中的每个元素均等于 <code>[first1 + N1 - N2, last1)</code> 中的对应元素才返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 。通过应用二元谓词 <code>pred</code> 到分别由 <code>proj1</code> 与 <code>proj2</code> 投影的两个范围中的元素进行比较。</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>begin<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>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">end</span><span class="br0">(</span>r2<span class="br0">)</span></span></span> 为 <code>last2</code> 。</div>
|
|
<p>此页面上描述的仿函数实体是 <i>niebloid</i> ,即:</p>
|
|
<ul>
|
|
<li>调用它们中的任何一者时不可指定显式模板实参。</li>
|
|
<li>它们无一对<a href="cpp-language-adl.html">实参依赖查找</a>可见。</li>
|
|
<li>在<a href="cpp-language-unqualified_lookup.html">通常无限定查找</a>寻找函数调用运算符左侧的名称找到它们之一时,它禁止<a href="cpp-language-adl.html">实参依赖查找</a>。</li>
|
|
</ul>
|
|
<p>实际上,它们能以函数对象,或以某些特殊编译器扩展实现。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>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>若第二范围匹配第一范围的后缀则为 <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=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>线性:至多应用 <code>min(N1, N2)</code> 次谓词和两个投影。若 <span class="t-c"><span class="mw-geshi cpp source-cpp">N1 <span class="sy1"><</span> N2</span></span> 则不应用谓词和两个投影。</p>
|
|
<p>若 <code>N1</code> 与 <code>N2</code> 均能以常数时间计算(即两个迭代器-哨位类型对均实现 <a href="cpp-iterator-sized_sentinel_for.html"><code>sized_sentinel_for</code></a> ,或两个范围类型均实现 <a href="cpp-ranges-sized_range.html"><code>sized_range</code></a> )且 <span class="t-c"><span class="mw-geshi cpp source-cpp">N1 <span class="sy1"><</span> N2</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> ends_with_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 <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span><span class="sy1"><</span>I1<span class="sy1">></span> <span class="sy3">||</span> std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S1, I1<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span>
|
|
<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">forward_iterator</span><span class="sy1"><</span>I2<span class="sy1">></span> <span class="sy3">||</span> std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S2, I2<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span>
|
|
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="kw4">const</span> <span class="kw4">auto</span> n1 <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 class="sy4">;</span>
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> n2 <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="sy4">;</span>
|
|
|
|
<span class="kw1">if</span> <span class="br0">(</span>n1 <span class="sy1"><</span> n2<span class="br0">)</span>
|
|
<span class="kw1">return</span> <span class="kw2">false</span><span class="sy4">;</span>
|
|
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>first1, n1 <span class="sy2">-</span> n2<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> ranges<span class="sy4">::</span><span class="me2">equal</span><span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first1<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>last1<span class="br0">)</span>,
|
|
std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>first2<span class="br0">)</span>, std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>last2<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="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,
|
|
<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 <span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span><span class="sy1"><</span>R1<span class="sy1">></span> <span class="sy3">||</span> ranges<span class="sy4">::</span><span class="me2">sized_range</span><span class="sy1"><</span>R1<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span>
|
|
<span class="br0">(</span>ranges<span class="sy4">::</span><span class="me2">forward_range</span><span class="sy1"><</span>R2<span class="sy1">></span> <span class="sy3">||</span> ranges<span class="sy4">::</span><span class="me2">sized_range</span><span class="sy1"><</span>R2<span class="sy1">></span><span class="br0">)</span> <span class="sy3">&&</span>
|
|
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>,
|
|
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> ends_with_fn ends_with<span class="br0">{</span><span class="br0">}</span><span class="sy4">;</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<div class="t-example-live-link"></div>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <array></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
<span class="co2">#include <iostream></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><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> <a href="cpp-io-manip-boolalpha.html"><span class="kw1764">std::<span class="me2">boolalpha</span></span></a>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"static_cast"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"const_cast"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"reinterpret_cast"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"dynamic_cast"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"move"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"move_if_noexcept"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"forward"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"as_const"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"bit_cast"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><span class="st0">"to_underlying"</span>, <span class="st0">"cast"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><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>, <a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><span class="br0">{</span><span class="nu0">3</span>,<span class="nu0">4</span><span class="br0">}</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span>
|
|
<span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">ends_with</span><span class="br0">(</span><a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><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>, <a href="cpp-container-array.html"><span class="kw1268">std::<span class="me2">array</span></span></a><span class="br0">{</span><span class="nu0">4</span>,<span class="nu0">5</span><span class="br0">}</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</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">true
|
|
true
|
|
true
|
|
true
|
|
false
|
|
false
|
|
false
|
|
false
|
|
true
|
|
false</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-starts_with.html"><span class="t-lines"><span>ranges::starts_with</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx23">(C++23)</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-string-basic_string-ends_with.html"><span class="t-lines"><span>ends_with</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>检查 string 是否终于给定后缀<br />
|
|
<span class="t-mark">(<code>std::basic_string<CharT,Traits,Allocator></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-string-basic_string_view-ends_with.html"><span class="t-lines"><span>ends_with</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>检查 string_view 是否终于给定后缀<br />
|
|
<span class="t-mark">(<code>std::basic_string_view<CharT,Traits></code> 的公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|