qintcacheiterator.html
来自「QT 下载资料仅供参考」· HTML 代码 · 共 208 行
HTML
208 行
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"><!-- /home/reggie/tmp/qt-3.0-reggie-5401/qt-x11-commercial-3.0.5/doc/qintcache.doc:277 --><html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>QIntCacheIterator Class</title><style type="text/css"><!--h3.fn,span.fn { margin-left: 1cm; text-indent: -1cm; }a:link { color: #004faf; text-decoration: none }a:visited { color: #672967; text-decoration: none }body { background: #ffffff; color: black; }--></style></head><body><table border="0" cellpadding="0" cellspacing="0" width="100%"><tr bgcolor="#E5E5E5"><td valign=center> <a href="index.html"><font color="#004faf">Home</font></a> | <a href="classes.html"><font color="#004faf">All Classes</font></a> | <a href="mainclasses.html"><font color="#004faf">Main Classes</font></a> | <a href="annotated.html"><font color="#004faf">Annotated</font></a> | <a href="groups.html"><font color="#004faf">Grouped Classes</font></a> | <a href="functions.html"><font color="#004faf">Functions</font></a></td><td align="right" valign="center"><img src="logo32.png" align="right" width="64" height="32" border="0"></td></tr></table><h1 align=center>QIntCacheIterator Class Reference</h1><p>The QIntCacheIterator class provides an iterator for QIntCache collections.<a href="#details">More...</a><p><tt>#include <<a href="qintcache-h.html">qintcache.h</a>></tt><p><a href="qintcacheiterator-members.html">List of all member functions.</a><h2>Public Members</h2><ul><li><div class=fn><a href="#QIntCacheIterator"><b>QIntCacheIterator</b></a> ( const QIntCache<type> & cache )</div></li><li><div class=fn><a href="#QIntCacheIterator-2"><b>QIntCacheIterator</b></a> ( const QIntCacheIterator<type> & ci )</div></li><li><div class=fn>QIntCacheIterator<type> & <a href="#operator-eq"><b>operator=</b></a> ( const QIntCacheIterator<type> & ci )</div></li><li><div class=fn>uint <a href="#count"><b>count</b></a> () const</div></li><li><div class=fn>bool <a href="#isEmpty"><b>isEmpty</b></a> () const</div></li><li><div class=fn>bool <a href="#atFirst"><b>atFirst</b></a> () const</div></li><li><div class=fn>bool <a href="#atLast"><b>atLast</b></a> () const</div></li><li><div class=fn>type * <a href="#toFirst"><b>toFirst</b></a> ()</div></li><li><div class=fn>type * <a href="#toLast"><b>toLast</b></a> ()</div></li><li><div class=fn><a href="#operator-type-*"><b>operator type *</b></a> () const</div></li><li><div class=fn>type * <a href="#current"><b>current</b></a> () const</div></li><li><div class=fn>long <a href="#currentKey"><b>currentKey</b></a> () const</div></li><li><div class=fn>type * <a href="#operator()"><b>operator()</b></a> ()</div></li><li><div class=fn>type * <a href="#operator++"><b>operator++</b></a> ()</div></li><li><div class=fn>type * <a href="#operator+-eq"><b>operator+=</b></a> ( uint jump )</div></li><li><div class=fn>type * <a href="#operator--"><b>operator--</b></a> ()</div></li><li><div class=fn>type * <a href="#operator--eq"><b>operator-=</b></a> ( uint jump )</div></li></ul><hr><a name="details"></a><h2>Detailed Description</h2>The QIntCacheIterator class provides an iterator for <a href="qintcache.html">QIntCache</a> collections.<p> <p> Note that the traversal order is arbitrary; you are not guaranteedany particular order. If new objects are inserted into the cachewhile the iterator is active, the iterator may or may not see them.<p> Multiple iterators are completely independent, even when theyoperate on the same QIntCache. QIntCache updates all iterators that referan item when that item is removed.<p> QIntCacheIterator provides an <a href="#operator++">operator++</a>(), and an <a href="#operator+-eq">operator+=</a>() totraverse the cache; <a href="#current">current</a>() and <a href="#currentKey">currentKey</a>() to access the currentcache item and its key; <a href="#atFirst">atFirst</a>() <a href="#atLast">atLast</a>(), which return TRUE if theiterator points to the first/last item in the cache; <a href="#isEmpty">isEmpty</a>(), whichreturns TRUE if the cache is empty; and <a href="#count">count</a>(), which returnsthe number of items in the cache.<p> Note that atFirst() and atLast() refer to the iterator's arbitraryordering, not to the cache's internal LRU list.<p> <p>See also <a href="qintcache.html">QIntCache</a>, <a href="collection.html">Collection Classes</a> and <a href="tools.html">Non-GUI Classes</a>.<hr><h2>Member Function Documentation</h2><h3 class=fn><a name="QIntCacheIterator"></a>QIntCacheIterator::QIntCacheIterator ( const <a href="qintcache.html">QIntCache</a><type> & cache )</h3><p> Constructs an iterator for <em>cache</em>. The current iterator item isset to point to the first item in the <em>cache</em> (or rather, the firstitem is defined to be the item at which this constructor sets theiterator to point).<h3 class=fn><a name="QIntCacheIterator-2"></a>QIntCacheIterator::QIntCacheIterator ( const <a href="qintcacheiterator.html">QIntCacheIterator</a><type> & ci )</h3><p> Constructs an iterator for the same cache as <em>ci</em>. The newiterator starts at the same item as ci.<a href="#current">current</a>(), but movesindependently from there on.<h3 class=fn>bool <a name="atFirst"></a>QIntCacheIterator::atFirst () const</h3><p> Returns TRUE if the iterator points to the first item in thecache; otherwise returns FALSE. Note that this refers to theiterator's arbitrary ordering, not to the cache's internal LRU list.<p> <p>See also <a href="#toFirst">toFirst</a>() and <a href="#atLast">atLast</a>().<h3 class=fn>bool <a name="atLast"></a>QIntCacheIterator::atLast () const</h3><p> Returns TRUE if the iterator points to the last item in thecache; otherwise returns FALSE. Note that this refers to theiterator's arbitrary ordering, not to the cache's internal LRU list.<p> <p>See also <a href="#toLast">toLast</a>() and <a href="#atFirst">atFirst</a>().<h3 class=fn>uint <a name="count"></a>QIntCacheIterator::count () const</h3><p> Returns the number of items in the cache on which this iterator operates.<p> <p>See also <a href="#isEmpty">isEmpty</a>().<h3 class=fn>type * <a name="current"></a>QIntCacheIterator::current () const</h3><p> Returns a pointer to the current iterator item.<h3 class=fn>long <a name="currentKey"></a>QIntCacheIterator::currentKey () const</h3><p> Returns the key for the current iterator item.<h3 class=fn>bool <a name="isEmpty"></a>QIntCacheIterator::isEmpty () const</h3><p> Returns TRUE if the cache is empty; otherwise returns FALSE.<p> <p>See also <a href="#count">count</a>().<h3 class=fn><a name="operator-type-*"></a>QIntCacheIterator::operator type * () const</h3><p> Cast operator. Returns a pointer to the current iterator item.Same as <a href="#current">current</a>().<p> <h3 class=fn>type * <a name="operator()"></a>QIntCacheIterator::operator() ()</h3><p> Makes the succeeding item current and returns the original currentitem.<p> If the current iterator item was the last item in the cache or if itwas null, null is returned.<h3 class=fn>type * <a name="operator++"></a>QIntCacheIterator::operator++ ()</h3><p> Prefix ++ makes the iterator point to the item just after<a href="#current">current</a>(), and makes it the new current item for the iterator. Ifcurrent() was the last item, <a href="#operator--">operator--</a>() returns 0.<h3 class=fn>type * <a name="operator+-eq"></a>QIntCacheIterator::operator+= ( uint jump )</h3><p> Returns the item <em>jump</em> positions after the current item, or null ifit is beyond the last item. Makes this the current item.<h3 class=fn>type * <a name="operator--"></a>QIntCacheIterator::operator-- ()</h3><p> Prefix -- makes the iterator point to the item just before<a href="#current">current</a>(), and makes it the new current item for the iterator. Ifcurrent() was the first item, <a href="#operator--">operator--</a>() returns 0.<h3 class=fn>type * <a name="operator--eq"></a>QIntCacheIterator::operator-= ( uint jump )</h3><p> Returns the item <em>jump</em> positions before the current item, or null ifit is beyond the first item. Makes this the current item.<h3 class=fn><a href="qintcacheiterator.html">QIntCacheIterator</a><type> & <a name="operator-eq"></a>QIntCacheIterator::operator= ( const <a href="qintcacheiterator.html">QIntCacheIterator</a><type> & ci )</h3><p> Makes this an iterator for the same cache as <em>ci</em>. The newiterator starts at the same item as ci.<a href="#current">current</a>(), but movesindependently thereafter.<h3 class=fn>type * <a name="toFirst"></a>QIntCacheIterator::toFirst ()</h3><p> Sets the iterator to point to the first item in the cache andreturns a pointer to the item.<p> Sets the iterator to null and returns null if if the cache is empty.<p> <p>See also <a href="#toLast">toLast</a>() and <a href="#isEmpty">isEmpty</a>().<h3 class=fn>type * <a name="toLast"></a>QIntCacheIterator::toLast ()</h3><p> Sets the iterator to point to the last item in the cache andreturns a pointer to the item.<p> Sets the iterator to null and returns null if if the cache is empty.<p> <p>See also <a href="#toFirst">toFirst</a>() and <a href="#isEmpty">isEmpty</a>().<!-- eof --><hr><p>This file is part of the <a href="index.html">Qt toolkit</a>.Copyright © 1995-2002<a href="http://www.trolltech.com/">Trolltech</a>. All Rights Reserved.<p><address><hr><div align=center><table width=100% cellspacing=0 border=0><tr><td>Copyright © 2002 <a href="http://www.trolltech.com">Trolltech</a><td><a href="http://www.trolltech.com/trademarks.html">Trademarks</a><td align=right><div align=right>Qt version 3.0.5</div></table></div></address></body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?