The Q3AsciiCacheIterator class provides an iterator for Q3AsciiCache collections. More...
#include <Q3AsciiCacheIterator>This class is part of the Qt 3 support library. It is provided to keep old source code working. We strongly advise against using it in new code. See Porting to Qt 4 for more information.
| Q3AsciiCacheIterator ( const Q3AsciiCache<type> & cache ) | |
| Q3AsciiCacheIterator ( const Q3AsciiCacheIterator<type> & ci ) | |
| bool | atFirst () const |
| bool | atLast () const |
| uint | count () const |
| type * | current () const |
| const char * | currentKey () const |
| bool | isEmpty () const |
| type * | toFirst () |
| type * | toLast () |
| operator type * () const | |
| type * | operator() () |
| type * | operator++ () |
| type * | operator+= ( uint jump ) |
| type * | operator-- () |
| type * | operator-= ( uint jump ) |
| Q3AsciiCacheIterator<type> & | operator= ( const Q3AsciiCacheIterator<type> & ci ) |
The Q3AsciiCacheIterator class provides an iterator for Q3AsciiCache collections.
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.
Multiple iterators are completely independent, even when they operate on the same Q3AsciiCache. Q3AsciiCache updates all iterators that refer an item when that item is removed.
Q3AsciiCacheIterator provides an operator++() and an operator+=() to traverse the cache; current() and currentKey() to access the current cache item and its key. It also provides atFirst() and atLast(), which return TRUE if the iterator points to the first or last item in the cache respectively. The isEmpty() function returns TRUE if the cache is empty; and count() returns the number of items in the cache.
Note that atFirst() and atLast() refer to the iterator's arbitrary ordering, not to the cache's internal least recently used list.
See also Q3AsciiCache.
Constructs an iterator for cache. The current iterator item is set to point to the first item in the cache.
Constructs an iterator for the same cache as ci. The new iterator starts at the same item as ci.current() but moves independently from there on.
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.
See also toFirst() and atLast().
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.
See also toLast() and atFirst().
Returns the number of items in the cache over which this iterator operates.
See also isEmpty().
Returns a pointer to the current iterator item.
Returns the key for the current iterator item.
Returns TRUE if the cache is empty, i.e. count() == 0; otherwise returns FALSE.
See also count().
Sets the iterator to point to the first item in the cache and returns a pointer to the item.
Sets the iterator to 0 and returns 0 if the cache is empty.
See also toLast() and isEmpty().
Sets the iterator to point to the last item in the cache and returns a pointer to the item.
Sets the iterator to 0 and returns 0 if the cache is empty.
See also toFirst() and isEmpty().
Cast operator. Returns a pointer to the current iterator item. Same as current().
Makes the succeeding item current and returns the original current item.
If the current iterator item was the last item in the cache or if it was 0, 0 is returned.
Prefix ++ makes the iterator point to the item just after current(), and makes that the new current item for the iterator. If current() was the last item, operator++() returns 0.
Returns the item jump positions after the current item, or 0 if it is beyond the last item. Makes this the current item.
Prefix -- makes the iterator point to the item just before current(), and makes that the new current item for the iterator. If current() was the first item, operator--() returns 0.
Returns the item jump positions before the current item, or 0 if it is before the first item. Makes this the current item.
Makes this an iterator for the same cache as ci. The new iterator starts at the same item as ci.current(), but moves independently thereafter.