Rename ptr nt* related files to equivalent tq*

Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>

1 files changed, 7 insertions, 7 deletions

diff --git a/doc/man/man3/tqcache.3qt b/doc/man/man3/tqcache.3qt
index fd473a730..a37868537 100644
--- a/doc/man/man3/tqcache.3qt
+++ b/doc/man/man3/tqcache.3qt
@@ -11,7 +11,7 @@ QCache \- Template class that provides a cache based on TQString keys
 .SH SYNOPSIS
 \fC#include <ntqcache.h>\fR
 .PP
-Inherits QPtrCollection.
+Inherits TQPtrCollection.
 .PP
 .SS "Public Members"
 .in +1c
@@ -81,9 +81,9 @@ 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 cache 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 cache and reimplement newItem() if you want deep copies.
 .PP
-When removing a cache item, the virtual function QPtrCollection::deleteItem() is called. The default implementation deletes the item if auto-deletion is enabled, and does nothing otherwise.
+When removing a cache item, the virtual function TQPtrCollection::deleteItem() is called. The default implementation deletes the item if auto-deletion is enabled, and does nothing otherwise.
 .PP
 There is a QCacheIterator that can be used to traverse the items in the cache in arbitrary order.
 .PP
@@ -101,7 +101,7 @@ Each inserted item has an associated cost. When inserting a new item, if the tot
 If \fIcaseSensitive\fR is TRUE (the default), the cache keys are case sensitive; if it is FALSE, they are case-insensitive. Case-insensitive comparison considers all Unicode letters.
 .SH "QCache::~QCache ()"
 Removes all items from the cache and destroys it. All iterators that access this cache will be reset.
-.SH "bool QPtrCollection::autoDelete () const"
+.SH "bool TQPtrCollection::autoDelete () const"
 Returns the setting of the auto-delete option. The default is FALSE.
 .PP
 See also setAutoDelete().
@@ -112,13 +112,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 QCache::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 * QCache::find ( const TQString & k, bool ref = TRUE ) const"
 Returns the item associated with key \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
@@ -155,7 +155,7 @@ If there are two or more items with equal keys, the one that was inserted last i
 All iterators that refer to the removed item are set to point to the next item in the cache's traversal order.
 .PP
 See also take() and clear().
-.SH "void QPtrCollection::setAutoDelete ( bool enable )"
+.SH "void TQPtrCollection::setAutoDelete ( bool enable )"
 Sets the collection to auto-delete its contents if \fIenable\fR is TRUE and to never delete them if \fIenable\fR is FALSE.
 .PP
 If auto-deleting is turned on, all the items in a collection are deleted when the collection itself is deleted. This is convenient if the collection has the only pointer to the items.