282 lines
25 KiB
HTML
282 lines
25 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::advance</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_iterator_ranges_advance 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>advance</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-iterator.html">iterator</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-iterator.html"><iterator></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_or_output_iterator</span> I <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> advance<span class="br0">(</span> I<span class="sy3">&</span> i, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n <span class="br0">)</span><span class="sy4">;</span></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> std<span class="sy4">::</span><span class="me2">input_or_output_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> advance<span class="br0">(</span> I<span class="sy3">&</span> i, S bound <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(2)</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> std<span class="sy4">::</span><span class="me2">input_or_output_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> advance<span class="br0">(</span> I<span class="sy3">&</span> i, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n, S bound <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(3)</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>i</code> <code>n</code> 次。</div>
|
|
<div class="t-li1"><span class="t-li">2)</span> 自增给定的迭代器 <code>i</code> 直至 <span class="t-c"><span class="mw-geshi cpp source-cpp">i <span class="sy1">==</span> bound</span></span> 。</div>
|
|
<div class="t-li1"><span class="t-li">3)</span> 自增给定的迭代器 <code>i</code> <code>n</code> 次,或直至 <span class="t-c"><span class="mw-geshi cpp source-cpp">i <span class="sy1">==</span> bound</span></span> ,取决于何者先来到。</div>
|
|
<p>若 <code>n</code> ,则自减迭代器。此情况下, <code>I</code> 必须实现 <span class="t-lc">std::bidirectional_iterator</span> ,而若提供 <code>bound</code> 则 <code>S</code> 必须与 <code>I</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>i</td>
|
|
<td>-</td>
|
|
<td>要推进的迭代器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>bound</td>
|
|
<td>-</td>
|
|
<td>指代 <code>i</code> 所指向的范围结尾的迭代器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>n</td>
|
|
<td>-</td>
|
|
<td><code>i</code> 应自增的次数</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<div class="t-li1"><span class="t-li">3)</span> <code>n</code> 与 <code>i</code> 所遍历的实际距离的差。</div>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>线性。</p>
|
|
<p>然而,若 <code>I</code> 额外实现 <span class="t-lc">std::random_access_iterator</span> ,或若 <code>S</code> 实现 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span></span></span> ,或若 <code>I</code> 与 <code>S</code> 实现 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">assignable_from</span><span class="sy1"><</span>I<span class="sy3">&</span>, S<span class="sy1">></span></span></span> ,则复杂度为常数。</p>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E8.A7.A3">注解</span></h3>
|
|
<p>若指定的自增或自减序列会要求自增不可自增的迭代器(例如尾后迭代器)或自减不可自减的迭代器(例如首迭代器或孤立迭代器)则行为未定义。</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> advance_fn <span class="br0">{</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_or_output_iterator</span> I<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I<span class="sy3">&</span> i, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n<span class="br0">)</span> <span class="kw4">const</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">random_access_iterator</span><span class="sy1"><</span>I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
i <span class="sy2">+</span><span class="sy1">=</span> n<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>n <span class="sy1">></span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">--</span>n<span class="sy4">;</span>
|
|
<span class="sy2">++</span>i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">bidirectional_iterator</span><span class="sy1"><</span>I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>n <span class="sy1"><</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">++</span>n<span class="sy4">;</span>
|
|
<span class="sy2">--</span>i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_or_output_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I<span class="sy3">&</span> i, S bound<span class="br0">)</span> <span class="kw4">const</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">assignable_from</span><span class="sy1"><</span>I<span class="sy3">&</span>, S<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
i <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>bound<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S, I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>i, bound <span class="sy2">-</span> i<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>i <span class="sy3">!</span><span class="sy1">=</span> bound<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">++</span>i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">input_or_output_iterator</span> I, std<span class="sy4">::</span><span class="me2">sentinel_for</span><span class="sy1"><</span>I<span class="sy1">></span> S<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span>
|
|
operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span>I<span class="sy3">&</span> i, std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> n, S bound<span class="br0">)</span> <span class="kw4">const</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">sized_sentinel_for</span><span class="sy1"><</span>S, I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="co1">// std::abs 非 constexpr</span>
|
|
<span class="kw4">auto</span> abs <span class="sy1">=</span> <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> std<span class="sy4">::</span><span class="me2">iter_difference_t</span><span class="sy1"><</span>I<span class="sy1">></span> x<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> x <span class="sy1"><</span> <span class="nu0">0</span> <span class="sy4">?</span> <span class="sy2">-</span>x <span class="sy4">:</span> x<span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">const</span> <span class="kw4">auto</span> dist <span class="sy1">=</span> abs<span class="br0">(</span>n<span class="br0">)</span> <span class="sy2">-</span> abs<span class="br0">(</span>bound <span class="sy2">-</span> i<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="br0">(</span>dist <span class="sy1"><</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
|
|
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>i, bound<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="sy2">-</span>dist<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
ranges<span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>i, n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">return</span> <span class="nu0">0</span><span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>n <span class="sy1">></span> <span class="nu0">0</span> <span class="sy3">&&</span> i <span class="sy3">!</span><span class="sy1">=</span> bound<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">--</span>n<span class="sy4">;</span>
|
|
<span class="sy2">++</span>i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span>std<span class="sy4">::</span><span class="me2">bidirectional_iterator</span><span class="sy1"><</span>I<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>n <span class="sy1"><</span> <span class="nu0">0</span> <span class="sy3">&&</span> i <span class="sy3">!</span><span class="sy1">=</span> bound<span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">++</span>n<span class="sy4">;</span>
|
|
<span class="sy2">--</span>i<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">return</span> n<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw1">inline</span> <span class="kw4">constexpr</span> <span class="kw4">auto</span> advance <span class="sy1">=</span> advance_fn<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 <iomanip></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <iterator></span>
|
|
<span class="co2">#include <vector></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> v<span class="br0">{</span> <span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span> <span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> vi <span class="sy1">=</span> v.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>vi, <span class="nu0">2</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"><<</span> <span class="st0">"value: "</span> <span class="sy1"><<</span> <span class="sy2">*</span>vi <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<span class="br0">{</span>
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>vi, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</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"><<</span> <a href="cpp-io-manip-boolalpha.html"><span class="kw1764">std::<span class="me2">boolalpha</span></span></a><span class="sy4">;</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">"vi == v.end(): "</span> <span class="sy1"><<</span> <span class="br0">(</span>vi <span class="sy1">==</span> v.<span class="me1">end</span><span class="br0">(</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>
|
|
|
|
std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>vi, <span class="sy2">-</span><span class="nu0">3</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"><<</span> <span class="st0">"value: "</span> <span class="sy1"><<</span> <span class="sy2">*</span>vi <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</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"><<</span> <span class="st0">"diff: "</span> <span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>vi, <span class="nu0">2</span>, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">", "</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"><<</span> <span class="st0">"value: "</span> <span class="sy1"><<</span> <span class="sy2">*</span>vi <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</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"><<</span> <span class="st0">"diff: "</span> <span class="sy1"><<</span> std<span class="sy4">::</span><span class="me2">ranges</span><span class="sy4">::</span><span class="me2">advance</span><span class="br0">(</span>vi, <span class="nu0">4</span>, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">", "</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"><<</span> <span class="st0">"vi == v.end(): "</span> <span class="sy1"><<</span> <span class="br0">(</span>vi <span class="sy1">==</span> v.<span class="me1">end</span><span class="br0">(</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>
|
|
<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="kw1765">std::<span class="me2">noboolalpha</span></span></a><span class="sy4">;</span>
|
|
<span class="br0">}</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">value: 4
|
|
vi == v.end(): true
|
|
value: 3
|
|
diff: 0, value: 4
|
|
diff: 3, vi == v.end(): true</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-iterator-ranges-next.html"><span class="t-lines"><span>ranges::next</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-iterator-ranges-prev.html"><span class="t-lines"><span>ranges::prev</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-iterator-ranges-distance.html"><span class="t-lines"><span>ranges::distance</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-iterator-advance.html"><span class="t-lines"><span>advance</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>
|