228 lines
17 KiB
HTML
228 lines
17 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::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_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::</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 t-until-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Distance <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> advance<span class="br0">(</span> InputIt<span class="sy3">&</span> it, Distance n <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-until-cxx17">(C++17 前)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt, <span class="kw1">class</span> Distance <span class="sy1">></span><br />
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> advance<span class="br0">(</span> InputIt<span class="sy3">&</span> it, Distance n <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>增加给定的迭代器 <code>it</code> 以 <code>n</code> 个元素的步长。</p>
|
|
<p>若 <code>n</code> 为负,则迭代器自减。该情况下, <code>InputIt</code> 必须满足<a href="cpp-named_req-BidirectionalIterator.html"><span style="font-style:italic">老式双向迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyBidirectionalIterator)</span></a> 的要求,否则行为未定义。</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>it</td>
|
|
<td>-</td>
|
|
<td>要前进的迭代器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>n</td>
|
|
<td>-</td>
|
|
<td><code>it</code> 要前进的元素数</td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>InputIt</code> 必须满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>(无)</p>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<p>线性。</p>
|
|
<p>然而,若 <code>InputIt</code> 额外满足<a href="cpp-named_req-RandomAccessIterator.html"><span style="font-style:italic">老式随机访问迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyRandomAccessIterator)</span></a> 的要求,则复杂度是常数。</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>
|
|
<p>参阅 <a rel="nofollow" class="external text" href="https://github.com/gcc-mirror/gcc/blob/d9375e490072d1aae73a93949aa158fcd2a27018/libstdc%2B%2B-v3/include/bits/stl_iterator_base_funcs.h#L200">libstdc++</a> 与 <a rel="nofollow" class="external text" href="https://github.com/llvm-mirror/libcxx/blob/a12cb9d211019d99b5875b6d8034617cbc24c2cc/include/iterator#L582">libc++</a> 中的实现。</p>
|
|
<p><br /></p>
|
|
<table class="eq-fun-cpp-table">
|
|
<tr>
|
|
<th>版本一</th>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co1">// 经由标签派发的实现,移除 constexpr 后可用于 C++98</span>
|
|
<span class="kw1">namespace</span> detail <span class="br0">{</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> It<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++17 起要求</span>
|
|
<span class="kw4">void</span> do_advance<span class="br0">(</span>It<span class="sy3">&</span> it, <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span> n,
|
|
<a href="cpp-iterator-iterator_tags.html"><span class="kw652">std::<span class="me2">input_iterator_tag</span></span></a><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>it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> It<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++17 起要求</span>
|
|
<span class="kw4">void</span> do_advance<span class="br0">(</span>It<span class="sy3">&</span> it, <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span> n,
|
|
<a href="cpp-iterator-iterator_tags.html"><span class="kw655">std::<span class="me2">bidirectional_iterator_tag</span></span></a><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>it<span class="sy4">;</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>it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> It<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++17 起要求</span>
|
|
<span class="kw4">void</span> do_advance<span class="br0">(</span>It<span class="sy3">&</span> it, <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span> n,
|
|
<a href="cpp-iterator-iterator_tags.html"><span class="kw656">std::<span class="me2">random_access_iterator_tag</span></span></a><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
it <span class="sy2">+</span><span class="sy1">=</span> n<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
|
|
<span class="br0">}</span> <span class="co1">// namespace detail</span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> It, <span class="kw1">class</span> Distance<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="co1">// C++17 起</span>
|
|
<span class="kw4">void</span> advance<span class="br0">(</span>It<span class="sy3">&</span> it, Distance n<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
detail<span class="sy4">::</span><span class="me2">do_advance</span><span class="br0">(</span>it, <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span><span class="br0">(</span>n<span class="br0">)</span>,
|
|
<span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">iterator_category</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
<tr>
|
|
<th>版本二</th>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co1">// 经由 constexpr if 的实现,可用于 C++17</span>
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> It, <span class="kw1">class</span> Distance<span class="sy1">></span>
|
|
<span class="kw4">constexpr</span> <span class="kw4">void</span> advance<span class="br0">(</span>It<span class="sy3">&</span> it, Distance n<span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<span class="kw1">using</span> category <span class="sy1">=</span> <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">iterator_category</span><span class="sy4">;</span>
|
|
static_assert<span class="br0">(</span><a href="cpp-types-is_base_of.html"><span class="kw591">std::<span class="me2">is_base_of_v</span></span></a><span class="sy1"><</span><a href="cpp-iterator-iterator_tags.html"><span class="kw652">std::<span class="me2">input_iterator_tag</span></span></a>, category<span class="sy1">></span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">auto</span> dist <span class="sy1">=</span> <span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>It<span class="sy1">></span><span class="sy4">::</span><span class="me2">difference_type</span><span class="br0">(</span>n<span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span><a href="cpp-types-is_base_of.html"><span class="kw591">std::<span class="me2">is_base_of_v</span></span></a><span class="sy1"><</span><a href="cpp-iterator-iterator_tags.html"><span class="kw656">std::<span class="me2">random_access_iterator_tag</span></span></a>, category<span class="sy1">></span><span class="br0">)</span>
|
|
it <span class="sy2">+</span><span class="sy1">=</span> dist<span class="sy4">;</span>
|
|
<span class="kw1">else</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>dist <span class="sy1">></span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">--</span>dist<span class="sy4">;</span>
|
|
<span class="sy2">++</span>it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="kw1">if</span> <span class="kw4">constexpr</span> <span class="br0">(</span><a href="cpp-types-is_base_of.html"><span class="kw591">std::<span class="me2">is_base_of_v</span></span></a><span class="sy1"><</span><a href="cpp-iterator-iterator_tags.html"><span class="kw655">std::<span class="me2">bidirectional_iterator_tag</span></span></a>, category<span class="sy1">></span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="kw1">while</span> <span class="br0">(</span>dist <span class="sy1"><</span> <span class="nu0">0</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="sy2">++</span>dist<span class="sy4">;</span>
|
|
<span class="sy2">--</span>it<span class="sy4">;</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<p><br /></p>
|
|
<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 <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="kw1268">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">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="kw1757">std::<span class="me2">cout</span></span></a> <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></pre></div>
|
|
</div>
|
|
<p>输出:</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">4</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-next.html"><span class="t-lines"><span>next</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>令迭代器自增<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-iterator-distance.html"><span class="t-lines"><span>distance</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>
|