
We bake cookies in your browser for a better experience. Using this site means that you consent.Read More
TheQ3AsciiCacheIterator class provides an iterator forQ3AsciiCache collections.More...
| Header: | #include <Q3AsciiCacheIterator> |
| 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) |
TheQ3AsciiCacheIterator class provides an iterator forQ3AsciiCache 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 sameQ3AsciiCache.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() andcurrentKey() to access the current cache item and its key. It also providesatFirst() andatLast(), which return TRUE if the iterator points to the first or last item in the cache respectively. TheisEmpty() function returns TRUE if the cache is empty; andcount() returns the number of items in the cache.
Note thatatFirst() andatLast() refer to the iterator's arbitrary ordering, not to the cache's internal least recently used list.
See alsoQ3AsciiCache.
Constructs an iterator forcache. The current iterator item is set to point to the first item in thecache.
Constructs an iterator for the same cache asci. 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 alsotoFirst() andatLast().
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 alsotoLast() andatFirst().
Returns the number of items in the cache over which this iterator operates.
See alsoisEmpty().
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 alsocount().
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 alsotoLast() andisEmpty().
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 alsotoFirst() andisEmpty().
Cast operator. Returns a pointer to the current iterator item. Same ascurrent().
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 aftercurrent(), and makes that the new current item for the iterator. Ifcurrent() was the last item, operator++() returns 0.
Returns the itemjump 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 beforecurrent(), and makes that the new current item for the iterator. Ifcurrent() was the first item, operator--() returns 0.
Returns the itemjump 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 asci. The new iterator starts at the same item as ci.current(), but moves independently thereafter.
© 2016 The Qt Company Ltd. Documentation contributions included herein are the copyrights of their respective owners. The documentation provided herein is licensed under the terms of theGNU Free Documentation License version 1.3 as published by the Free Software Foundation. Qt and respective logos are trademarks of The Qt Company Ltd. in Finland and/or other countries worldwide. All other trademarks are property of their respective owners.