⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 classfg__forwarditerator.html

📁 《道法自然》书的源码FishGUI,一个跨平台的界面库
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head><meta http-equiv="Content-Type" content="text/html;charset=gb2312"><title>FishGUI:  TemplateFG_ForwardIterator&lt; NODE, ITEM &gt; class Reference</title><link href="doxygen.css" rel="stylesheet" type="text/css"></head><body><!-- 制作者 Doxygen 1.3.6 --><div class="qindex"><a class="qindex" href="main.html">首页</a> | <a class="qindex" href="modules.html">模块</a> | <a class="qindex" href="hierarchy.html">类继承关系</a> | <a class="qindex" href="classes.html">按字典顺序排序的列表</a> | <a class="qindex" href="annotated.html">组合类型列表</a> | <a class="qindex" href="files.html">文件列表</a> | <a class="qindex" href="functions.html">组合类型成员</a> | <a class="qindex" href="globals.html">文件成员</a></div><h1>FG_ForwardIterator&lt; NODE, ITEM &gt;模板类参考<br><small>[<a class="el" href="group__Utility.html">应用包</a>]</small></h1><code>#include &lt;<a class="el" href="FG__List_8h-source.html">FG_List.h</a>&gt;</code><p>FG_ForwardIterator&lt; NODE, ITEM &gt;合作图:<p><center><img src="classFG__ForwardIterator__coll__graph.png" border="0" usemap="#FG__ForwardIterator_3_01NODE_00_01ITEM_01_4__coll__map" alt="Collaboration graph"></center><center><font size="2">[<a target="top" href="graph_legend.html">图例</a>]</font></center><a href="classFG__ForwardIterator-members.html">所有成员的列表。</a><hr><a name="_details"></a><h2>详细描述</h2><h3>template&lt;class NODE, class ITEM&gt;<br> class FG_ForwardIterator&lt; NODE, ITEM &gt;</h3>正向迭代器类. <p><dl compact><dt><b>参数:</b></dt><dd>  <table border="0" cellspacing="2" cellpadding="0">    <tr><td valign=top><em>NODE</em>&nbsp;</td><td>节点类型 </td></tr>    <tr><td valign=top><em>ITEM</em>&nbsp;</td><td>节点中保存的对象类型 </td></tr>  </table></dl><p><p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00109">109</a>行定义。<table border=0 cellpadding=0 cellspacing=0><tr><td></td></tr><tr><td colspan=2><br><h2>公有成员</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a0">FG_ForwardIterator</a> ()</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">正向迭代器类的缺省构造函数.  <a href="#a0"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a1">FG_ForwardIterator</a> (NODE *const pNode)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">正向迭代器类的转换构造函数.  <a href="#a1"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>ITEM &amp;&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a2">operator *</a> () const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载*运算符函数.  <a href="#a2"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>ITEM *&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a3">operator-&gt;</a> () const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载-&gt;运算符函数.  <a href="#a3"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a4">operator ITEM *</a> () const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载转换运算符函数.  <a href="#a4"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>bool&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a5">IsDone</a> () const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">是否遍历结束.  <a href="#a5"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top><a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a> &amp;&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a6">operator++</a> ()</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载前置++运算符函数.  <a href="#a6"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>const <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a7">operator++</a> (int)</td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载后置++运算符函数.  <a href="#a7"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>bool&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a8">operator==</a> (const <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a> &amp;i) const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载==运算符函数.  <a href="#a8"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>bool&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a9">operator!=</a> (const <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a> &amp;i) const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载!=运算符函数.  <a href="#a9"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>bool&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a10">operator==</a> (ITEM *const p) const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载==运算符函数.  <a href="#a10"></a><br><br></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>bool&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#a11">operator!=</a> (ITEM *const p) const </td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">重载!=运算符函数.  <a href="#a11"></a><br><br></td></tr><tr><td colspan=2><br><h2>保护属性</h2></td></tr><tr><td class="memItemLeft" nowrap align=right valign=top>NODE *&nbsp;</td><td class="memItemRight" valign=bottom><a class="el" href="classFG__ForwardIterator.html#p0">m_pNode</a></td></tr><tr><td class="mdescLeft">&nbsp;</td><td class="mdescRight">正向迭代器当前指向的节点.  <a href="#p0"></a><br><br></td></tr></table><hr><h2>构造及析构函数文档</h2><a class="anchor" name="a0" doxytag="FG_ForwardIterator::FG_ForwardIterator" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::<a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a> </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="mdname1" valign="top" nowrap>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap><code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>  <tr>    <td>      &nbsp;    </td>    <td><p>正向迭代器类的缺省构造函数. <p><p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00114">114</a>行定义。<p>参考 <a class="el" href="FG__List_8h-source.html#l00219">FG_ForwardIterator&lt; NODE, ITEM &gt;::m_pNode</a>及<a class="el" href="FG__Common_8h-source.html#l00046">NULL</a>.    </td>  </tr></table><a class="anchor" name="a1" doxytag="FG_ForwardIterator::FG_ForwardIterator" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::<a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a> </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">NODE *const&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>pNode</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap><code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>  <tr>    <td>      &nbsp;    </td>    <td><p>正向迭代器类的转换构造函数. <p>把节点类指针转换成正向迭代器 <p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00121">121</a>行定义。<p>参考 <a class="el" href="FG__List_8h-source.html#l00219">FG_ForwardIterator&lt; NODE, ITEM &gt;::m_pNode</a>.    </td>  </tr></table><hr><h2>成员函数文档</h2><a class="anchor" name="a5" doxytag="FG_ForwardIterator::IsDone" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> bool <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::IsDone </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="mdname1" valign="top" nowrap>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap> const<code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>  <tr>    <td>      &nbsp;    </td>    <td><p>是否遍历结束. <p><dl compact><dt><b>返回:</b></dt><dd>true 已经遍历结束 false 还未遍历结束 </dd></dl><p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00153">153</a>行定义。<p>参考 <a class="el" href="FG__List_8h-source.html#l00219">FG_ForwardIterator&lt; NODE, ITEM &gt;::m_pNode</a>.    </td>  </tr></table><a class="anchor" name="a2" doxytag="FG_ForwardIterator::operator *" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> ITEM&amp; <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::operator * </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="mdname1" valign="top" nowrap>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap> const<code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>  <tr>    <td>      &nbsp;    </td>    <td><p>重载*运算符函数. <p>把正向迭代器转换成其指向的对象的引用 <dl compact><dt><b>返回:</b></dt><dd>正向迭代器转换成其指向的对象的引用 </dd></dl><p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00129">129</a>行定义。<p>参考 <a class="el" href="FG__List_8h-source.html#l00219">FG_ForwardIterator&lt; NODE, ITEM &gt;::m_pNode</a>.    </td>  </tr></table><a class="anchor" name="a4" doxytag="FG_ForwardIterator::operator ITEM *" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::operator ITEM * </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="mdname1" valign="top" nowrap>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap> const<code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>  <tr>    <td>      &nbsp;    </td>    <td><p>重载转换运算符函数. <p>把正向迭代器转换成其指向的对象的指针 <dl compact><dt><b>返回:</b></dt><dd>正向迭代器转换成其指向的对象的指针 </dd></dl><p>在文件<a class="el" href="FG__List_8h-source.html">FG_List.h</a>第<a class="el" href="FG__List_8h-source.html#l00145">145</a>行定义。<p>参考 <a class="el" href="FG__List_8h-source.html#l00219">FG_ForwardIterator&lt; NODE, ITEM &gt;::m_pNode</a>.    </td>  </tr></table><a class="anchor" name="a11" doxytag="FG_ForwardIterator::operator!=" ></a><p><table class="mdTable" width="100%" cellpadding="2" cellspacing="0">  <tr>    <td class="mdRow">      <table cellpadding="0" cellspacing="0" border="0">        <tr>          <td class="md" colspan="4">template&lt;class NODE, class ITEM&gt; </td>        </tr>        <tr>          <td class="md" nowrap valign="top"> bool <a class="el" href="classFG__ForwardIterator.html">FG_ForwardIterator</a>&lt; NODE, ITEM &gt;::operator!= </td>          <td class="md" valign="top">(&nbsp;</td>          <td class="md" nowrap valign="top">ITEM *const&nbsp;</td>          <td class="mdname1" valign="top" nowrap> <em>p</em>          </td>          <td class="md" valign="top">&nbsp;)&nbsp;</td>          <td class="md" nowrap> const<code> [inline]</code></td>        </tr>      </table>    </td>  </tr></table><table cellspacing=5 cellpadding=0 border=0>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -