diff options
Diffstat (limited to 'doc/man/man3/tqintcache.3qt')
| -rw-r--r-- | doc/man/man3/tqintcache.3qt | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/doc/man/man3/tqintcache.3qt b/doc/man/man3/tqintcache.3qt index 6b16b4e09..458b82178 100644 --- a/doc/man/man3/tqintcache.3qt +++ b/doc/man/man3/tqintcache.3qt @@ -11,7 +11,7 @@ QIntCache \- Template class that provides a cache based on long keys .SH SYNOPSIS \fC#include <ntqintcache.h>\fR .PP -Inherits QPtrCollection. +Inherits TQPtrCollection. .PP .SS "Public Members" .in +1c @@ -72,7 +72,7 @@ Apart from insert(), by far the most important function is find() (which also ex .PP There are also methods to remove() or take() an object from the cache. Calling setAutoDelete(TRUE) for a cache tells it to delete items that are removed. The default is to not delete items when they are removed (i.e. remove() and take() are equivalent). .PP -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 QPtrCollection::newItem() for the item to be inserted. Inherit a dictionary and reimplement newItem() if you want deep copies. +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 TQPtrCollection::newItem() for the item to be inserted. Inherit a dictionary and reimplement newItem() if you want deep copies. .PP When removing a cache item, the item will be automatically deleted if auto-deletion is enabled. .PP @@ -95,13 +95,13 @@ All cache iterators that operate this on cache are reset. .PP See also remove() and take(). .PP -Reimplemented from QPtrCollection. +Reimplemented from TQPtrCollection. .SH "uint QIntCache::count () const\fC [virtual]\fR" Returns the number of items in the cache. .PP See also totalCost(). .PP -Reimplemented from QPtrCollection. +Reimplemented from TQPtrCollection. .SH "type * QIntCache::find ( long k, bool ref = TRUE ) const" Returns the item associated with \fIk\fR, or 0 if the key does not exist in the cache. If \fIref\fR is TRUE (the default), the item is moved to the front of the least recently used list. .PP |