183 lines
13 KiB
HTML
183 lines
13 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::iterator</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_iterator 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>iterator</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">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span><br /></span>
|
|
<p> <span class="kw1">class</span> Category,<br />
|
|
<span class="kw1">class</span> T,<br />
|
|
<span class="kw1">class</span> Distance <span class="sy1">=</span> <a href="cpp-types-ptrdiff_t.html"><span class="kw101">std::<span class="me2">ptrdiff_t</span></span></a>,<br />
|
|
<span class="kw1">class</span> Pointer <span class="sy1">=</span> T<span class="sy2">*</span>,<br />
|
|
<span class="kw1">class</span> Reference <span class="sy1">=</span> T<span class="sy3">&</span><br /></p>
|
|
<span class="sy1">></span> <span class="kw1">struct</span> iterator<span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td><span class="t-mark">(C++17 中弃用)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><code>std::iterator</code> 是提供以简化迭代器所要求类型定义的基类。</p>
|
|
<h3><span class="mw-headline" id=".E6.A8.A1.E6.9D.BF.E5.BD.A2.E5.8F.82">模板形参</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>Category</td>
|
|
<td>-</td>
|
|
<td>迭代器类别。必须是<a href="cpp-iterator-iterator_tags.html">迭代器类别标签</a>之一。</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>T</td>
|
|
<td>-</td>
|
|
<td>能通过解引用迭代器获得的值的类型。此类型对于输出迭代器应为 <code>void</code> 。</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>Distance</td>
|
|
<td>-</td>
|
|
<td>能用于标识迭代器间距离的类型</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>Pointer</td>
|
|
<td>-</td>
|
|
<td>定义指向被迭代的类型( <code>T</code> )的指针</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>Reference</td>
|
|
<td>-</td>
|
|
<td>定义到被迭代的类型( <code>T</code> )的引用</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E6.88.90.E5.91.98.E7.B1.BB.E5.9E.8B">成员类型</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc-hitem">
|
|
<td>成员类型</td>
|
|
<td>定义</td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td><code>iterator_category</code></td>
|
|
<td><code>Category</code></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td><code>value_type</code></td>
|
|
<td><code>T</code></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td><code>difference_type</code></td>
|
|
<td><code>Distance</code></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td><code>pointer</code></td>
|
|
<td><code>Pointer</code></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td><code>reference</code></td>
|
|
<td><code>Reference</code></td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<p>以下示例演示如何通过继承 <code>std::iterator</code> 实现<a href="cpp-named_req-InputIterator.html">输入迭代器</a></p>
|
|
<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 <algorithm></span>
|
|
|
|
<span class="kw1">template</span><span class="sy1"><</span><span class="kw4">long</span> FROM, <span class="kw4">long</span> TO<span class="sy1">></span>
|
|
<span class="kw1">class</span> Range <span class="br0">{</span>
|
|
<span class="kw1">public</span><span class="sy4">:</span>
|
|
<span class="co1">// 通过继承自 std::iterator 提供成员 typedef</span>
|
|
<span class="kw1">class</span> iterator<span class="sy4">:</span> <span class="kw1">public</span> std<span class="sy4">::</span><span class="me2">iterator</span><span class="sy1"><</span>
|
|
<a href="cpp-iterator-iterator_tags.html"><span class="kw652">std::<span class="me2">input_iterator_tag</span></span></a>, <span class="co1">// iterator_category</span>
|
|
<span class="kw4">long</span>, <span class="co1">// value_type</span>
|
|
<span class="kw4">long</span>, <span class="co1">// difference_type</span>
|
|
<span class="kw4">const</span> <span class="kw4">long</span><span class="sy2">*</span>, <span class="co1">// pointer</span>
|
|
<span class="kw4">long</span> <span class="co1">// reference</span>
|
|
<span class="sy1">></span><span class="br0">{</span>
|
|
<span class="kw4">long</span> num <span class="sy1">=</span> FROM<span class="sy4">;</span>
|
|
<span class="kw1">public</span><span class="sy4">:</span>
|
|
<span class="kw1">explicit</span> iterator<span class="br0">(</span><span class="kw4">long</span> _num <span class="sy1">=</span> <span class="nu0">0</span><span class="br0">)</span> <span class="sy4">:</span> num<span class="br0">(</span>_num<span class="br0">)</span> <span class="br0">{</span><span class="br0">}</span>
|
|
iterator<span class="sy3">&</span> operator<span class="sy2">++</span><span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span>num <span class="sy1">=</span> TO <span class="sy1">>=</span> FROM <span class="sy4">?</span> num <span class="sy2">+</span> <span class="nu0">1</span><span class="sy4">:</span> num <span class="sy2">-</span> <span class="nu0">1</span><span class="sy4">;</span> <span class="kw1">return</span> <span class="sy2">*</span>this<span class="sy4">;</span><span class="br0">}</span>
|
|
iterator operator<span class="sy2">++</span><span class="br0">(</span><span class="kw4">int</span><span class="br0">)</span> <span class="br0">{</span>iterator retval <span class="sy1">=</span> <span class="sy2">*</span>this<span class="sy4">;</span> <span class="sy2">++</span><span class="br0">(</span><span class="sy2">*</span>this<span class="br0">)</span><span class="sy4">;</span> <span class="kw1">return</span> retval<span class="sy4">;</span><span class="br0">}</span>
|
|
<span class="kw4">bool</span> operator<span class="sy1">==</span><span class="br0">(</span>iterator other<span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span><span class="kw1">return</span> num <span class="sy1">==</span> other.<span class="me1">num</span><span class="sy4">;</span><span class="br0">}</span>
|
|
<span class="kw4">bool</span> operator<span class="sy3">!</span><span class="sy1">=</span><span class="br0">(</span>iterator other<span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span><span class="kw1">return</span> <span class="sy3">!</span><span class="br0">(</span><span class="sy2">*</span>this <span class="sy1">==</span> other<span class="br0">)</span><span class="sy4">;</span><span class="br0">}</span>
|
|
reference operator<span class="sy2">*</span><span class="br0">(</span><span class="br0">)</span> <span class="kw4">const</span> <span class="br0">{</span><span class="kw1">return</span> num<span class="sy4">;</span><span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
iterator begin<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span><span class="kw1">return</span> iterator<span class="br0">(</span>FROM<span class="br0">)</span><span class="sy4">;</span><span class="br0">}</span>
|
|
iterator end<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span><span class="kw1">return</span> iterator<span class="br0">(</span>TO <span class="sy1">>=</span> FROM<span class="sy4">?</span> TO<span class="sy2">+</span><span class="nu0">1</span> <span class="sy4">:</span> TO<span class="sy2">-</span><span class="nu0">1</span><span class="br0">)</span><span class="sy4">;</span><span class="br0">}</span>
|
|
<span class="br0">}</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<span class="co1">// std::find 要求输入迭代器</span>
|
|
<span class="kw4">auto</span> range <span class="sy1">=</span> Range<span class="sy1"><</span><span class="nu0">15</span>, <span class="nu0">25</span><span class="sy1">></span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> itr <span class="sy1">=</span> <a href="cpp-algorithm-find_if_not.html"><span class="kw1573">std::<span class="me2">find</span></span></a><span class="br0">(</span>range.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, range.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <span class="nu0">18</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>itr <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span> <span class="co1">// 18</span>
|
|
|
|
<span class="co1">// Range::iterator 亦满足基于范围的 for 要求</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">long</span> l <span class="sy4">:</span> Range<span class="sy1"><</span><span class="nu0">3</span>, <span class="nu0">5</span><span class="sy1">></span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> l <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span> <span class="co1">// 3 4 5</span>
|
|
<span class="br0">}</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <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">18
|
|
3 4 5</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-iterator_traits.html"><span class="t-lines"><span>iterator_traits</span></span></a></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-iterator_tags.html"><span class="t-lines"><span>input_iterator_tag</span><span>output_iterator_tag</span><span>forward_iterator_tag</span><span>bidirectional_iterator_tag</span><span>random_access_iterator_tag</span><span>contiguous_iterator_tag</span></span></a></div>
|
|
<div><span class="t-lines"><span></span><span></span><span></span><span></span><span></span><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>用于指示迭代器类别的空类类型<br />
|
|
<span class="t-mark">(类)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|