|  | Home · All Classes · Main Classes · Grouped Classes · Modules · Functions |

# Q3AsciiCache Class Reference
[Qt3Support module]

The Q3AsciiCache class is a template class that provides a cache based on char* keys. More...

    #include <Q3AsciiCache>

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.

Inherits Q3PtrCollection.

- List of all members, including inherited members

### Public Functions

- Q3AsciiCache ( int maxCost = 100, int size = 17, bool caseSensitive = true, bool copyKeys = true )
- ~Q3AsciiCache ()
- virtual void clear ()
- virtual uint count () const
- type * find ( const char * k, bool ref = true ) const
- bool insert ( const char * k, const type * d, int c = 1, int p = 0 )
- bool isEmpty () const
- int maxCost () const
- bool remove ( const char * k )
- void setMaxCost ( int m )
- uint size () const
- void statistics () const
- type * take ( const char * k )
- int totalCost () const
- type * operator[] ( const char * k ) const

- 4 public functions inherited from Q3PtrCollection

### Additional Inherited Members

- 2 protected functions inherited from Q3PtrCollection

## Detailed Description

The Q3AsciiCache class is a template class that provides a cache based on char* keys.

Q3AsciiCache is implemented as a template class. Define a template instance Q3AsciiCache<X> to create a cache that operates on pointers to X (X*).

A cache is a least recently used (LRU) list of cache items. The cache items are accessed via `char*` keys. For Unicode keys use the Q3Cache template instead, which uses QString keys. A Q3Cache has the same performace as a Q3AsciiCache.

Each cache item has a cost. The sum of item costs, totalCost(), will not exceed the maximum cache cost, maxCost(). If inserting a new item would cause the total cost to exceed the maximum cost, the least recently used items in the cache are removed.

Apart from insert(), by far the most important function is find() (which also exists as operator[]()). This function looks up an item, returns it, and by default marks it as being the most recently used item.

There are also methods to remove() or take() an object from the cache. Calling setAutoDelete(TRUE) tells the cache to delete items that are removed. The default is to not delete items when then are removed (i.e., remove() and take() are equivalent).

When inserting an item into the cache, only the pointer is copied, not the item itself. This is called a shallow copy. It is possible to make the cache copy all of the item's data (known as a deep copy) when an item is inserted. insert() calls the virtual function Q3PtrCollection::newItem() for the item to be inserted. Inherit a cache and reimplement newItem() if you want deep copies.

When removing a cache item the virtual function Q3PtrCollection::deleteItem() is called. Its default implementation in Q3AsciiCache is to delete the item if auto-deletion is enabled.

There is a Q3AsciiCacheIterator which may be used to traverse the items in the cache in arbitrary order.

See also Q3AsciiCacheIterator, Q3Cache, and Q3IntCache.

## Member Function Documentation

### Q3AsciiCache::Q3AsciiCache ( int maxCost = 100, int size = 17, bool caseSensitive = true, bool copyKeys = true )

Constructs a cache whose contents will never have a total cost greater than maxCost and which is expected to contain less than size items.

size is actually the size of an internal hash array; it's usually best to make it prime and at least 50% bigger than the largest expected number of items in the cache.

Each inserted item has an associated cost. When inserting a new item, if the total cost of all items in the cache will exceed maxCost, the cache will start throwing out the older (least recently used) items until there is enough room for the new item to be inserted.

If caseSensitive is TRUE (the default), the cache keys are case sensitive; if it is FALSE, they are case-insensitive. Case-insensitive comparison only affects the 26 letters in US-ASCII. If copyKeys is TRUE (the default), Q3AsciiCache makes a copy of the cache keys, otherwise it copies just the const char * pointer - slightly faster if you can guarantee that the keys will never change, but very risky.

### Q3AsciiCache::~Q3AsciiCache ()

Removes all items from the cache and destroys it. All iterators that access this cache will be reset.

### void Q3AsciiCache::clear () `[virtual]`

Removes all items from the cache, and deletes them if auto-deletion has been enabled.

All cache iterators that operate on this cache are reset.

Reimplemented from Q3PtrCollection.

See also remove() and take().

### uint Q3AsciiCache::count () const `[virtual]`

Returns the number of items in the cache.

Reimplemented from Q3PtrCollection.

See also totalCost() and size().

### type * Q3AsciiCache::find ( const char * k, bool ref = true ) const

Returns the item with key k, or 0 if the key does not exist in the cache. If ref is TRUE (the default), the item is moved to the front of the least recently used list.

If there are two or more items with equal keys, the one that was inserted last is returned.

### bool Q3AsciiCache::insert ( const char * k, const type * d, int c = 1, int p = 0 )

Inserts the item d into the cache using key k, and with an associated cost of c. Returns TRUE if the item is successfully inserted. Returns FALSE if the item is not inserted, for example, if the cost of the item exceeds maxCost().

The cache's size is limited, and if the total cost is too high, Q3AsciiCache will remove old, least recently used items until there is room for this new item.

Items with duplicate keys can be inserted.

The parameter p is internal and should be left at the default value (0).

Warning: If this function returns FALSE, you must delete d yourself. Additionally, be very careful about using d after calling this function, because any other insertions into the cache, from anywhere in the application or within Qt itself, could cause the object to be discarded from the cache and the pointer to become invalid.

### bool Q3AsciiCache::isEmpty () const

Returns TRUE if the cache is empty; otherwise returns FALSE.

### int Q3AsciiCache::maxCost () const

Returns the maximum allowed total cost of the cache.

See also setMaxCost() and totalCost().

### bool Q3AsciiCache::remove ( const char * k )

Removes the item with key k and returns TRUE if the item was present in the cache; otherwise returns FALSE.

The item is deleted if auto-deletion has been enabled, i.e., if you have called setAutoDelete(TRUE).

If there are two or more items with equal keys, the one that was inserted last is removed.

All iterators that refer to the removed item are set to point to the next item in the cache's traversal order.

See also take() and clear().

### void Q3AsciiCache::setMaxCost ( int m )

Sets the maximum allowed total cost of the cache to m. If the current total cost is greater than m, some items are removed immediately.

See also maxCost() and totalCost().

### uint Q3AsciiCache::size () const

Returns the size of the hash array used to implement the cache. This should be a bit bigger than count() is likely to be.

### void Q3AsciiCache::statistics () const

A debug-only utility function. Prints out cache usage, hit/miss, and distribution information using qDebug(). This function does nothing in the release library.

### type * Q3AsciiCache::take ( const char * k )

Takes the item associated with k out of the cache without deleting it and returns a pointer to the item taken out, or 0 if the key does not exist in the cache.

If there are two or more items with equal keys, the one that was inserted last is taken.

All iterators that refer to the taken item are set to point to the next item in the cache's traversal order.

See also remove() and clear().

### int Q3AsciiCache::totalCost () const

Returns the total cost of the items in the cache. This is an integer in the range 0 to maxCost().

See also setMaxCost().

### type * Q3AsciiCache::operator[] ( const char * k ) const

Returns the item with key k, or 0 if k does not exist in the cache, and moves the item to the front of the least recently used list.

If there are two or more items with equal keys, the one that was inserted last is returned.

This is the same as find( k, TRUE ).

See also find().