TQCacheIterator Class

Home | All Classes | Main Classes | Annotated | Grouped Classes | Functions |

# TQCacheIterator Class Reference

The TQCacheIterator class provides an iterator for TQCache collections. More...

`#include <tqcache.h>`

List of all member functions.

## Public Members

- TQCacheIterator ( const TQCache<type> & cache )
- TQCacheIterator ( const TQCacheIterator<type> & ci )
- TQCacheIterator<type> & operator= ( const TQCacheIterator<type> & ci )
- uint count () const
- bool isEmpty () const
- bool atFirst () const
- bool atLast () const
- type * toFirst ()
- type * toLast ()
- operator type * () const
- type * current () const
- TQString currentKey () const
- type * operator() ()
- type * operator++ ()
- type * operator+= ( uint jump )
- type * operator-- ()
- type * operator-= ( uint jump )

## Detailed Description

The TQCacheIterator class provides an iterator for TQCache 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 TQCache. TQCache updates all iterators that refer an item when that item is removed.

TQCacheIterator provides an operator++(), and an operator+=() to traverse the cache. The current() and currentKey() functions are used to access the current cache item and its key. The atFirst() and atLast() 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 TQCache, Collection Classes, and Non-GUI Classes.

## Member Function Documentation

### TQCacheIterator::TQCacheIterator ( const TQCache<type> & cache )

Constructs an iterator for cache. The current iterator item is set to point to the first item in the cache.

### TQCacheIterator::TQCacheIterator ( const TQCacheIterator<type> & ci )

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.

### bool TQCacheIterator::atFirst () const

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().

### bool TQCacheIterator::atLast () const

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().

### uint TQCacheIterator::count () const

Returns the number of items in the cache on which this iterator operates.

See also isEmpty().

### type * TQCacheIterator::current () const

Returns a pointer to the current iterator item.

### TQString TQCacheIterator::currentKey () const

Returns the key for the current iterator item.

### bool TQCacheIterator::isEmpty () const

Returns true if the cache is empty, i.e. count() == 0; otherwise it returns false.

See also count().

### TQCacheIterator::operator type * () const

Cast operator. Returns a pointer to the current iterator item. Same as current().

### type * TQCacheIterator::operator() ()

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.

### type * TQCacheIterator::operator++ ()

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.

### type * TQCacheIterator::operator+= ( uint jump )

Returns the item jump positions after the current item, or 0 if it is beyond the last item. Makes this the current item.

### type * TQCacheIterator::operator-- ()

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.

### type * TQCacheIterator::operator-= ( uint jump )

Returns the item jump positions before the current item, or 0 if it is before the first item. Makes this the current item.

### TQCacheIterator<type> & TQCacheIterator::operator= ( const TQCacheIterator<type> & ci )

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.

### type * TQCacheIterator::toFirst ()

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().

### type * TQCacheIterator::toLast ()

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().

This file is part of the TQt toolkit. Copyright © 1995-2007 Trolltech. All Rights Reserved.