Rename utility class nt* related files to equivalent tq*

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

1 files changed, 33 insertions, 33 deletions

diff --git a/doc/man/man3/tqintdict.3qt b/doc/man/man3/tqintdict.3qt
index 936ca6cd0..71d58c019 100644
--- a/doc/man/man3/tqintdict.3qt
+++ b/doc/man/man3/tqintdict.3qt
@@ -1,5 +1,5 @@
 '\" t
-.TH QIntDict 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*-
+.TH TQIntDict 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*-
 .\" Copyright 1992-2007 Trolltech ASA.  All rights reserved.  See the
 .\" license file included in the distribution for a complete license
 .\" statement.
@@ -7,25 +7,25 @@
 .ad l
 .nh
 .SH NAME
-QIntDict \- Template class that provides a dictionary based on long keys
+TQIntDict \- Template class that provides a dictionary based on long keys
 .SH SYNOPSIS
-\fC#include <ntqintdict.h>\fR
+\fC#include <tqintdict.h>\fR
 .PP
 Inherits TQPtrCollection.
 .PP
 .SS "Public Members"
 .in +1c
 .ti -1c
-.BI "\fBQIntDict\fR ( int size = 17 )"
+.BI "\fBTQIntDict\fR ( int size = 17 )"
 .br
 .ti -1c
-.BI "\fBQIntDict\fR ( const QIntDict<type> & dict )"
+.BI "\fBTQIntDict\fR ( const TQIntDict<type> & dict )"
 .br
 .ti -1c
-.BI "\fB~QIntDict\fR ()"
+.BI "\fB~TQIntDict\fR ()"
 .br
 .ti -1c
-.BI "QIntDict<type> & \fBoperator=\fR ( const QIntDict<type> & dict )"
+.BI "TQIntDict<type> & \fBoperator=\fR ( const TQIntDict<type> & dict )"
 .br
 .ti -1c
 .BI "virtual uint \fBcount\fR () const"
@@ -83,11 +83,11 @@ Inherits TQPtrCollection.
 .br
 .in -1c
 .SH DESCRIPTION
-The QIntDict class is a template class that provides a dictionary based on long keys.
+The TQIntDict class is a template class that provides a dictionary based on long keys.
 .PP
 TQMap is an STL-compatible alternative to this class.
 .PP
-QIntDict is implemented as a template class. Define a template instance QIntDict<X> to create a dictionary that operates on pointers to X (X*).
+TQIntDict is implemented as a template class. Define a template instance TQIntDict<X> to create a dictionary that operates on pointers to X (X*).
 .PP
 A dictionary is a collection of key-value pairs. The key is an \fClong\fR used for insertion, removal and lookup. The value is a pointer. Dictionaries provide very fast insertion and lookup.
 .PP
@@ -95,7 +95,7 @@ Example:
 .PP
 .nf
 .br
-    QIntDict<QLineEdit> fields; // long int keys, QLineEdit* values
+    TQIntDict<QLineEdit> fields; // long int keys, QLineEdit* values
 .br
     for ( int i = 0; i < 3; i++ )
 .br
@@ -109,7 +109,7 @@ Example:
     fields[2]->setText( "45" );
 .br
 .br
-    QIntDictIterator<QLineEdit> it( fields );
+    TQIntDictIterator<QLineEdit> it( fields );
 .br
     for ( ; it.current(); ++it )
 .br
@@ -133,19 +133,19 @@ Example:
 .br
 .fi
 .PP
-See QDict for full details, including the choice of dictionary size, and how deletions are handled.
+See TQDict for full details, including the choice of dictionary size, and how deletions are handled.
 .PP
-See also QIntDictIterator, QDict, QAsciiDict, TQPtrDict, Collection Classes, Collection Classes, and Non-GUI Classes.
+See also TQIntDictIterator, TQDict, TQAsciiDict, TQPtrDict, Collection Classes, Collection Classes, and Non-GUI Classes.
 .SH MEMBER FUNCTION DOCUMENTATION
-.SH "QIntDict::QIntDict ( int size = 17 )"
+.SH "TQIntDict::TQIntDict ( int size = 17 )"
 Constructs a dictionary using an internal hash array of size \fIsize\fR.
 .PP
 Setting \fIsize\fR to a suitably large prime number (equal to or greater than the expected number of entries) makes the hash distribution better which leads to faster lookup.
-.SH "QIntDict::QIntDict ( const QIntDict<type> & dict )"
+.SH "TQIntDict::TQIntDict ( const TQIntDict<type> & dict )"
 Constructs a copy of \fIdict\fR.
 .PP
 Each item in \fIdict\fR is inserted into this dictionary. Only the pointers are copied (shallow copy).
-.SH "QIntDict::~QIntDict ()"
+.SH "TQIntDict::~TQIntDict ()"
 Removes all items from the dictionary and destroys it.
 .PP
 All iterators that access this dictionary will be reset.
@@ -155,7 +155,7 @@ See also setAutoDelete().
 Returns the setting of the auto-delete option. The default is FALSE.
 .PP
 See also setAutoDelete().
-.SH "void QIntDict::clear ()\fC [virtual]\fR"
+.SH "void TQIntDict::clear ()\fC [virtual]\fR"
 Removes all items from the dictionary.
 .PP
 The removed items are deleted if auto-deletion is enabled.
@@ -165,13 +165,13 @@ All dictionary iterators that access this dictionary will be reset.
 See also remove(), take(), and setAutoDelete().
 .PP
 Reimplemented from TQPtrCollection.
-.SH "uint QIntDict::count () const\fC [virtual]\fR"
+.SH "uint TQIntDict::count () const\fC [virtual]\fR"
 Returns the number of items in the dictionary.
 .PP
 See also isEmpty().
 .PP
 Reimplemented from TQPtrCollection.
-.SH "type * QIntDict::find ( long key ) const"
+.SH "type * TQIntDict::find ( long key ) const"
 Returns the item associated with \fIkey\fR, or 0 if the key does not exist in the dictionary.
 .PP
 If there are two or more items with equal keys, then the most recently inserted item will be found.
@@ -181,7 +181,7 @@ Equivalent to operator[].
 See also operator[]().
 .PP
 Example: table/bigtable/main.cpp.
-.SH "void QIntDict::insert ( long key, const type * item )"
+.SH "void TQIntDict::insert ( long key, const type * item )"
 Insert item \fIitem\fR into the dictionary using key \fIkey\fR.
 .PP
 Multiple items can have the same key, in which case only the last item will be accessible using operator[]().
@@ -191,15 +191,15 @@ Multiple items can have the same key, in which case only the last item will be a
 See also replace().
 .PP
 Example: scribble/scribble.cpp.
-.SH "bool QIntDict::isEmpty () const"
+.SH "bool TQIntDict::isEmpty () const"
 Returns TRUE if the dictionary is empty; otherwise returns FALSE.
 .PP
 See also count().
-.SH "QIntDict<type> & QIntDict::operator= ( const QIntDict<type> & dict )"
+.SH "TQIntDict<type> & TQIntDict::operator= ( const TQIntDict<type> & dict )"
 Assigns \fIdict\fR to this dictionary and returns a reference to this dictionary.
 .PP
 This dictionary is first cleared and then each item in \fIdict\fR is inserted into this dictionary. Only the pointers are copied (shallow copy), unless newItem() has been reimplemented.
-.SH "type * QIntDict::operator[] ( long key ) const"
+.SH "type * TQIntDict::operator[] ( long key ) const"
 Returns the item associated with \fIkey\fR, or 0 if the key does not exist in the dictionary.
 .PP
 If there are two or more items with equal keys, then the most recently inserted item will be found.
@@ -207,13 +207,13 @@ If there are two or more items with equal keys, then the most recently inserted
 Equivalent to the find() function.
 .PP
 See also find().
-.SH "QDataStream & QIntDict::read ( QDataStream & s, TQPtrCollection::Item & item )\fC [virtual protected]\fR"
+.SH "QDataStream & TQIntDict::read ( QDataStream & s, TQPtrCollection::Item & item )\fC [virtual protected]\fR"
 Reads a dictionary item from the stream \fIs\fR and returns a reference to the stream.
 .PP
 The default implementation sets \fIitem\fR to 0.
 .PP
 See also write().
-.SH "bool QIntDict::remove ( long key )"
+.SH "bool TQIntDict::remove ( long key )"
 Removes the item associated with \fIkey\fR from the dictionary. Returns TRUE if successful, i.e. if the \fIkey\fR is in the dictionary; otherwise returns FALSE.
 .PP
 If there are two or more items with equal keys, then the most recently inserted item will be removed.
@@ -225,7 +225,7 @@ All dictionary iterators that refer to the removed item will be set to point to
 See also take(), clear(), and setAutoDelete().
 .PP
 Example: table/bigtable/main.cpp.
-.SH "void QIntDict::replace ( long key, const type * item )"
+.SH "void TQIntDict::replace ( long key, const type * item )"
 If the dictionary has key \fIkey\fR, this key's item is replaced with \fIitem\fR. If the dictionary doesn't contain key \fIkey\fR, \fIitem\fR is inserted into the dictionary using key \fIkey\fR.
 .PP
 \fIitem\fR may not be 0.
@@ -234,7 +234,7 @@ Equivalent to:
 .PP
 .nf
 .br
-        QIntDict<char> dict;
+        TQIntDict<char> dict;
 .br
         //      ...
 .br
@@ -251,7 +251,7 @@ If there are two or more items with equal keys, then the most recently inserted
 See also insert().
 .PP
 Example: table/bigtable/main.cpp.
-.SH "void QIntDict::resize ( uint newsize )"
+.SH "void TQIntDict::resize ( uint newsize )"
 Changes the size of the hashtable to \fInewsize\fR. The contents of the dictionary are preserved, but all iterators on the dictionary become invalid.
 .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.
@@ -266,13 +266,13 @@ See also autoDelete().
 .PP
 Examples:
 .)l grapher/grapher.cpp, scribble/scribble.cpp, and table/bigtable/main.cpp.
-.SH "uint QIntDict::size () const"
+.SH "uint TQIntDict::size () const"
 Returns the size of the internal hash array (as specified in the constructor).
 .PP
 See also count().
-.SH "void QIntDict::statistics () const"
+.SH "void TQIntDict::statistics () const"
 Debugging-only function that prints out the dictionary distribution using tqDebug().
-.SH "type * QIntDict::take ( long key )"
+.SH "type * TQIntDict::take ( long key )"
 Takes the item associated with \fIkey\fR out of the dictionary without deleting it (even if auto-deletion is enabled).
 .PP
 If there are two or more items with equal keys, then the most recently inserted item will be taken.
@@ -284,13 +284,13 @@ All dictionary iterators that refer to the taken item will be set to point to th
 See also remove(), clear(), and setAutoDelete().
 .PP
 Example: table/bigtable/main.cpp.
-.SH "QDataStream & QIntDict::write ( QDataStream & s, TQPtrCollection::Item ) const\fC [virtual protected]\fR"
+.SH "QDataStream & TQIntDict::write ( QDataStream & s, TQPtrCollection::Item ) const\fC [virtual protected]\fR"
 Writes a dictionary item to the stream \fIs\fR and returns a reference to the stream.
 .PP
 See also read().
 
 .SH "SEE ALSO"
-.BR http://doc.trolltech.com/ntqintdict.html
+.BR http://doc.trolltech.com/tqintdict.html
 .BR http://www.trolltech.com/faq/tech.html
 .SH COPYRIGHT
 Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com.  See the