diff options
| author | Timothy Pearson <[email protected]> | 2011-11-08 12:31:36 -0600 |
|---|---|---|
| committer | Timothy Pearson <[email protected]> | 2011-11-08 12:31:36 -0600 |
| commit | d796c9dd933ab96ec83b9a634feedd5d32e1ba3f (patch) | |
| tree | 6e3dcca4f77e20ec8966c666aac7c35bd4704053 /doc/html/qcacheiterator.html | |
| download | tqt3-d796c9dd933ab96ec83b9a634feedd5d32e1ba3f.tar.gz tqt3-d796c9dd933ab96ec83b9a634feedd5d32e1ba3f.zip | |
Test conversion to TQt3 from Qt3 8c6fc1f8e35fd264dd01c582ca5e7549b32ab731
Diffstat (limited to 'doc/html/qcacheiterator.html')
| -rw-r--r-- | doc/html/qcacheiterator.html | 211 |
1 files changed, 211 insertions, 0 deletions
diff --git a/doc/html/qcacheiterator.html b/doc/html/qcacheiterator.html new file mode 100644 index 000000000..a53556e35 --- /dev/null +++ b/doc/html/qcacheiterator.html @@ -0,0 +1,211 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> +<!-- /home/espenr/tmp/qt-3.3.8-espenr-2499/qt-x11-free-3.3.8/doc/qcache.doc:293 --> +<html> +<head> +<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> +<title>TQCacheIterator Class</title> +<style type="text/css"><!-- +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>TQCacheIterator Class Reference</h1> + +<p>The TQCacheIterator class provides an iterator for TQCache collections. +<a href="#details">More...</a> +<p><tt>#include <<a href="qcache-h.html">qcache.h</a>></tt> +<p><a href="qcacheiterator-members.html">List of all member functions.</a> +<h2>Public Members</h2> +<ul> +<li class=fn><a href="#TQCacheIterator"><b>TQCacheIterator</b></a> ( const TQCache<type> & cache )</li> +<li class=fn><a href="#TQCacheIterator-2"><b>TQCacheIterator</b></a> ( const TQCacheIterator<type> & ci )</li> +<li class=fn>TQCacheIterator<type> & <a href="#operator-eq"><b>operator=</b></a> ( const TQCacheIterator<type> & ci )</li> +<li class=fn>uint <a href="#count"><b>count</b></a> () const</li> +<li class=fn>bool <a href="#isEmpty"><b>isEmpty</b></a> () const</li> +<li class=fn>bool <a href="#atFirst"><b>atFirst</b></a> () const</li> +<li class=fn>bool <a href="#atLast"><b>atLast</b></a> () const</li> +<li class=fn>type * <a href="#toFirst"><b>toFirst</b></a> ()</li> +<li class=fn>type * <a href="#toLast"><b>toLast</b></a> ()</li> +<li class=fn><a href="#operator-type-*"><b>operator type *</b></a> () const</li> +<li class=fn>type * <a href="#current"><b>current</b></a> () const</li> +<li class=fn>TQString <a href="#currentKey"><b>currentKey</b></a> () const</li> +<li class=fn>type * <a href="#operator()"><b>operator()</b></a> ()</li> +<li class=fn>type * <a href="#operator++"><b>operator++</b></a> ()</li> +<li class=fn>type * <a href="#operator+-eq"><b>operator+=</b></a> ( uint jump )</li> +<li class=fn>type * <a href="#operator--"><b>operator--</b></a> ()</li> +<li class=fn>type * <a href="#operator--eq"><b>operator-=</b></a> ( uint jump )</li> +</ul> +<hr><a name="details"></a><h2>Detailed Description</h2> + + +The TQCacheIterator class provides an iterator for <a href="qcache.html">TQCache</a> collections. +<p> + +<p> Note that the traversal order is arbitrary; you are not guaranteed +any particular order. If new objects are inserted into the cache +while the iterator is active, the iterator may or may not see +them. +<p> Multiple iterators are completely independent, even when they +operate on the same TQCache. TQCache updates all iterators that +refer an item when that item is removed. +<p> TQCacheIterator provides an <a href="#operator++">operator++</a>(), and an <a href="#operator+-eq">operator+=</a>() to +traverse the cache. The <a href="#current">current</a>() and <a href="#currentKey">currentKey</a>() functions are +used to access the current cache item and its key. The <a href="#atFirst">atFirst</a>() +and <a href="#atLast">atLast</a>() return TRUE if the iterator points to the first or +last item in the cache respectively. The <a href="#isEmpty">isEmpty</a>() function +returns TRUE if the cache is empty, and <a href="#count">count</a>() returns the number +of items in the cache. +<p> Note that atFirst() and atLast() refer to the iterator's arbitrary +ordering, not to the cache's internal least recently used list. +<p> <p>See also <a href="qcache.html">TQCache</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="TQCacheIterator"></a>TQCacheIterator::TQCacheIterator ( const <a href="qcache.html">TQCache</a><type> & cache ) +</h3> + +<p> Constructs an iterator for <em>cache</em>. The current iterator item is +set to point to the first item in the <em>cache</em>. + +<h3 class=fn><a name="TQCacheIterator-2"></a>TQCacheIterator::TQCacheIterator ( const <a href="qcacheiterator.html">TQCacheIterator</a><type> & ci ) +</h3> + +<p> Constructs an iterator for the same cache as <em>ci</em>. The new +iterator starts at the same item as ci.<a href="#current">current</a>(), but moves +independently from there on. + +<h3 class=fn>bool <a name="atFirst"></a>TQCacheIterator::atFirst () const +</h3> + +<p> Returns TRUE if the iterator points to the first item in the +cache; otherwise returns FALSE. Note that this refers to the +iterator's arbitrary ordering, not to the cache's internal least +recently used list. +<p> <p>See also <a href="#toFirst">toFirst</a>() and <a href="#atLast">atLast</a>(). + +<h3 class=fn>bool <a name="atLast"></a>TQCacheIterator::atLast () const +</h3> + +<p> Returns TRUE if the iterator points to the last item in the cache; +otherwise returns FALSE. Note that this refers to the iterator's +arbitrary ordering, not to the cache's internal least recently +used list. +<p> <p>See also <a href="#toLast">toLast</a>() and <a href="#atFirst">atFirst</a>(). + +<h3 class=fn>uint <a name="count"></a>TQCacheIterator::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>TQCacheIterator::current () const +</h3> + +<p> Returns a pointer to the current iterator item. + +<h3 class=fn><a href="qstring.html">TQString</a> <a name="currentKey"></a>TQCacheIterator::currentKey () const +</h3> + +<p> Returns the key for the current iterator item. + +<h3 class=fn>bool <a name="isEmpty"></a>TQCacheIterator::isEmpty () const +</h3> + +<p> Returns TRUE if the cache is empty, i.e. <a href="#count">count</a>() == 0; otherwise +it returns FALSE. +<p> <p>See also <a href="#count">count</a>(). + +<h3 class=fn><a name="operator-type-*"></a>TQCacheIterator::operator type * () const +</h3> + +<p> Cast operator. Returns a pointer to the current iterator item. +Same as <a href="#current">current</a>(). + +<h3 class=fn>type * <a name="operator()"></a>TQCacheIterator::operator() () +</h3> + +<p> Makes the succeeding item current and returns the original current +item. +<p> If the current iterator item was the last item in the cache or if +it was 0, 0 is returned. + +<h3 class=fn>type * <a name="operator++"></a>TQCacheIterator::operator++ () +</h3> + +<p> Prefix++ makes the iterator point to the item just after <a href="#current">current</a>() +and makes that the new current item for the iterator. If current() +was the last item, <a href="#operator++">operator++</a>() returns 0. + +<h3 class=fn>type * <a name="operator+-eq"></a>TQCacheIterator::operator+= ( uint jump ) +</h3> + +<p> Returns the item <em>jump</em> positions after the current item, or 0 if +it is beyond the last item. Makes this the current item. + +<h3 class=fn>type * <a name="operator--"></a>TQCacheIterator::operator-- () +</h3> + +<p> Prefix-- makes the iterator point to the item just before +<a href="#current">current</a>() and makes that the new current item for the iterator. If +current() was the first item, <a href="#operator--">operator--</a>() returns 0. + +<h3 class=fn>type * <a name="operator--eq"></a>TQCacheIterator::operator-= ( uint jump ) +</h3> + +<p> Returns the item <em>jump</em> positions before the current item, or 0 +if it is before the first item. Makes this the current item. + +<h3 class=fn><a href="qcacheiterator.html">TQCacheIterator</a><type> & <a name="operator-eq"></a>TQCacheIterator::operator= ( const <a href="qcacheiterator.html">TQCacheIterator</a><type> & ci ) +</h3> + +<p> Makes this an iterator for the same cache as <em>ci</em>. The new +iterator starts at the same item as ci.<a href="#current">current</a>(), but moves +independently thereafter. + +<h3 class=fn>type * <a name="toFirst"></a>TQCacheIterator::toFirst () +</h3> + +<p> Sets the iterator to point to the first item in the cache and +returns a pointer to the item. +<p> Sets the iterator to 0 and returns 0 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>TQCacheIterator::toLast () +</h3> + +<p> Sets the iterator to point to the last item in the cache and +returns a pointer to the item. +<p> Sets the iterator to 0 and returns 0 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">TQt toolkit</a>. +Copyright © 1995-2007 +<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 © 2007 +<a href="troll.html">Trolltech</a><td align=center><a href="trademarks.html">Trademarks</a> +<td align=right><div align=right>TQt 3.3.8</div> +</table></div></address></body> +</html> |