Rename str nt* related files to equivalent tq*

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

1 files changed, 27 insertions, 27 deletions

diff --git a/doc/tqptrlist.doc b/doc/tqptrlist.doc
index 502abaf26..a6412ae63 100644
--- a/doc/tqptrlist.doc
+++ b/doc/tqptrlist.doc
@@ -162,9 +162,9 @@
     directly on the QLNode, but they should be used with care. The
     data component of the node is available through QLNode::getData().
 
-    The QStrList class defined in \l ntqstrlist.h is a list of \c char*.
+    The TQStrList class defined in \l tqstrlist.h is a list of \c char*.
     It reimplements newItem(), deleteItem() and compareItems(). (But
-    see QStringList for a list of Unicode QStrings.)
+    see TQStringList for a list of Unicode TQStrings.)
 
     \sa TQPtrListIterator
 */
@@ -1037,22 +1037,22 @@
 
 
 /*****************************************************************************
-  QStrList documentation
+  TQStrList documentation
  *****************************************************************************/
 
 /*!
-    \class QStrList ntqstrlist.h
-    \brief The QStrList class provides a doubly-linked list of char*.
+    \class TQStrList tqstrlist.h
+    \brief The TQStrList class provides a doubly-linked list of char*.
 
     \ingroup collection
     \ingroup tools
     \ingroup text
 
-    If you want a string list of \l{TQString}s use QStringList.
+    If you want a string list of \l{TQString}s use TQStringList.
 
     This class is a TQPtrList\<char\> instance (a list of char*).
 
-    QStrList can make deep or shallow copies of the strings that are
+    TQStrList can make deep or shallow copies of the strings that are
     inserted.
 
     A deep copy means that memory is allocated for the string and then
@@ -1068,8 +1068,8 @@
     copies. It is also much faster to copy a pointer (typically 4 or 8
     bytes) than to copy string data.
 
-    A QStrList that operates on deep copies will, by default, turn on
-    auto-deletion (see setAutoDelete()). Thus, by default QStrList
+    A TQStrList that operates on deep copies will, by default, turn on
+    auto-deletion (see setAutoDelete()). Thus, by default TQStrList
     will deallocate any string copies it allocates.
 
     The virtual compareItems() function is reimplemented and does a
@@ -1079,11 +1079,11 @@
     when you just have to add a few extra strings to an already sorted
     list.
 
-    The QStrListIterator class is an iterator for QStrList.
+    The TQStrListIterator class is an iterator for TQStrList.
 */
 
 /*!
-    \fn QStrList::QStrList( bool deepCopies )
+    \fn TQStrList::TQStrList( bool deepCopies )
 
     Constructs an empty list of strings. Will make deep copies of all
     inserted strings if \a deepCopies is TRUE, or use shallow copies
@@ -1091,7 +1091,7 @@
 */
 
 /*!
-    \fn QStrList::QStrList( const QStrList &list )
+    \fn TQStrList::TQStrList( const TQStrList &list )
 
     Constructs a copy of \a list.
 
@@ -1101,13 +1101,13 @@
 */
 
 /*!
-    \fn QStrList::~QStrList()
+    \fn TQStrList::~TQStrList()
 
     Destroys the list. All strings are removed.
 */
 
 /*!
-    \fn QStrList& QStrList::operator=( const QStrList& list )
+    \fn TQStrList& TQStrList::operator=( const TQStrList& list )
 
     Assigns \a list to this list and returns a reference to this list.
 
@@ -1118,12 +1118,12 @@
 
 
 /*****************************************************************************
-  QStrIList documentation
+  TQStrIList documentation
  *****************************************************************************/
 
 /*!
-    \class QStrIList ntqstrlist.h
-    \brief The QStrIList class provides a doubly-linked list of char*
+    \class TQStrIList tqstrlist.h
+    \brief The TQStrIList class provides a doubly-linked list of char*
     with case-insensitive comparison.
 
     \ingroup collection
@@ -1131,20 +1131,20 @@
 
     This class is a TQPtrList\<char\> instance (a list of char*).
 
-    QStrIList is identical to QStrList except that the virtual
+    TQStrIList is identical to TQStrList except that the virtual
     compareItems() function is reimplemented to compare strings
     case-insensitively. The inSort() function inserts strings in a
     sorted order. In general it is fastest to insert the strings as
     they come and sort() at the end; inSort() is useful when you just
     have to add a few extra strings to an already sorted list.
 
-    The QStrListIterator class works for QStrIList.
+    The TQStrListIterator class works for TQStrIList.
 
-    \sa QStringList
+    \sa TQStringList
 */
 
 /*!
-    \fn QStrIList::QStrIList( bool deepCopies )
+    \fn TQStrIList::TQStrIList( bool deepCopies )
 
     Constructs a list of strings. Will make deep copies of all
     inserted strings if \a deepCopies is TRUE, or use shallow copies
@@ -1152,7 +1152,7 @@
 */
 
 /*!
-    \fn QStrIList::~QStrIList()
+    \fn TQStrIList::~TQStrIList()
 
     Destroys the list. All strings are removed.
 */
@@ -1225,18 +1225,18 @@
 */
 
 /*****************************************************************************
-  QStrListIterator documentation
+  TQStrListIterator documentation
  *****************************************************************************/
 
 /*!
-    \class QStrListIterator ntqstrlist.h
-    \brief The QStrListIterator class is an iterator for the QStrList
-    and QStrIList classes.
+    \class TQStrListIterator tqstrlist.h
+    \brief The TQStrListIterator class is an iterator for the TQStrList
+    and TQStrIList classes.
 
     \ingroup tools
 
     This class is a TQPtrListIterator\<char\> instance. It can traverse
-    the strings in the QStrList and QStrIList classes.
+    the strings in the TQStrList and TQStrIList classes.
 */