Rename ptr nt* related files to equivalent tq*

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

1 files changed, 35 insertions, 35 deletions

diff --git a/doc/html/collection.html b/doc/html/collection.html
index 08b6be42c..cb7b53a6d 100644
--- a/doc/html/collection.html
+++ b/doc/html/collection.html
@@ -54,11 +54,11 @@ details.
 <p> The pointer-based collections are:
 <ul>
 <li> <a href="ntqcache.html">TQCache</a> and <a href="ntqintcache.html">TQIntCache</a>, LRU (least recently used) caches.
-<li> <a href="ntqdict.html">TQDict</a>, <a href="ntqintdict.html">TQIntDict</a> and <a href="ntqptrdict.html">TQPtrDict</a> dictionaries.
-<li> <a href="ntqptrlist.html">TQPtrList</a>, a doubly linked list.
-<li> <a href="ntqptrqueue.html">TQPtrQueue</a>, a FIFO (first in, first out) queue.
-<li> <a href="ntqptrstack.html">TQPtrStack</a>, a LIFO (last in, first out) stack.
-<li> <a href="ntqptrvector.html">TQPtrVector</a>, a vector.
+<li> <a href="ntqdict.html">TQDict</a>, <a href="ntqintdict.html">TQIntDict</a> and <a href="tqptrdict.html">TQPtrDict</a> dictionaries.
+<li> <a href="tqptrlist.html">TQPtrList</a>, a doubly linked list.
+<li> <a href="tqptrqueue.html">TQPtrQueue</a>, a FIFO (first in, first out) queue.
+<li> <a href="tqptrstack.html">TQPtrStack</a>, a LIFO (last in, first out) stack.
+<li> <a href="tqptrvector.html">TQPtrVector</a>, a vector.
 </ul>
 <p> <a href="ntqmemarray.html">TQMemArray</a> is exceptional; it is neither pointer nor value based,
 but memory based. For maximum efficiency with the simple data types
@@ -71,8 +71,8 @@ is a class for traversing the items in a collection:
 <a href="qintcacheiterator.html">TQIntCacheIterator</a>
 <li> <a href="qdictiterator.html">TQDictIterator</a>,
 <a href="qintdictiterator.html">TQIntDictIterator</a>, and
-<a href="qptrdictiterator.html">TQPtrDictIterator</a>
-<li> <a href="qptrlistiterator.html">TQPtrListIterator</a>
+<a href="tqptrdictiterator.html">TQPtrDictIterator</a>
+<li> <a href="tqptrlistiterator.html">TQPtrListIterator</a>
 <li> <a href="tqvaluelistiterator.html">TQValueListIterator</a>, and
 <a href="tqvaluelistconstiterator.html">TQValueListConstIterator</a>
 <li> <a href="tqmapiterator.html">TQMapIterator</a>, and
@@ -92,12 +92,12 @@ collections by casting item pointers to and from void pointers.
 <p> This strategy allows TQt's templates to be very economical on space
 (instantiating one of these templates adds only inlinable calls to
 the base classes), without hurting performance.
-<p> <h2> A <a href="ntqptrlist.html">TQPtrList</a> Example
+<p> <h2> A <a href="tqptrlist.html">TQPtrList</a> Example
 </h2>
 <a name="2"></a><p> This example shows how to store Employee items in a list and prints
 them out in reverse order:
 <p> <pre>
-    #include &lt;<a href="qptrlist-h.html">ntqptrlist.h</a>&gt;
+    #include &lt;<a href="tqptrlist-h.html">tqptrlist.h</a>&gt;
     #include &lt;<a href="qstring-h.html">ntqstring.h</a>&gt;
     #include &lt;stdio.h&gt;
 
@@ -114,16 +114,16 @@ them out in reverse order:
 
     int main()
     {
-        <a href="ntqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;        // list of pointers to Employee
-        list.<a href="ntqptrcollection.html#setAutoDelete">setAutoDelete</a>( TRUE );     // delete items when they are removed
+        <a href="tqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;        // list of pointers to Employee
+        list.<a href="tqptrcollection.html#setAutoDelete">setAutoDelete</a>( TRUE );     // delete items when they are removed
 
-        list.<a href="ntqptrlist.html#append">append</a>( new Employee("Bill", 50000) );
-        list.<a href="ntqptrlist.html#append">append</a>( new Employee("Steve",80000) );
-        list.<a href="ntqptrlist.html#append">append</a>( new Employee("Ron",  60000) );
+        list.<a href="tqptrlist.html#append">append</a>( new Employee("Bill", 50000) );
+        list.<a href="tqptrlist.html#append">append</a>( new Employee("Steve",80000) );
+        list.<a href="tqptrlist.html#append">append</a>( new Employee("Ron",  60000) );
 
-        <a href="qptrlistiterator.html">TQPtrListIterator</a>&lt;Employee&gt; it(list); // iterator for employee list
-        for ( it.<a href="qptrlistiterator.html#toLast">toLast</a>(); it.<a href="qptrlistiterator.html#current">current</a>(); --it) ) {
-            Employee *emp = it.<a href="qptrlistiterator.html#current">current</a>();
+        <a href="tqptrlistiterator.html">TQPtrListIterator</a>&lt;Employee&gt; it(list); // iterator for employee list
+        for ( it.<a href="tqptrlistiterator.html#toLast">toLast</a>(); it.<a href="tqptrlistiterator.html#current">current</a>(); --it) ) {
+            Employee *emp = it.<a href="tqptrlistiterator.html#current">current</a>();
             printf( "%s earns %d\n", emp-&gt;name(), emp-&gt;salary() );
         }
 
@@ -140,11 +140,11 @@ them out in reverse order:
  
 <p> <h2> Managing Collection Items
 </h2>
-<a name="3"></a><p> All pointer-based collections inherit the <a href="ntqptrcollection.html">TQPtrCollection</a> base class.
+<a name="3"></a><p> All pointer-based collections inherit the <a href="tqptrcollection.html">TQPtrCollection</a> base class.
 This class only knows about the number of items in the collection and
 the deletion strategy.
 <p> By default, items in a collection are not deleted when they are
-removed from the collection. The <a href="ntqptrcollection.html#setAutoDelete">TQPtrCollection::setAutoDelete</a>()
+removed from the collection. The <a href="tqptrcollection.html#setAutoDelete">TQPtrCollection::setAutoDelete</a>()
 function specifies the deletion strategy. In the list example, we
 enable auto-deletion to make the list delete the items when they are
 removed from the list.
@@ -152,23 +152,23 @@ removed from the list.
 not the item itself. This is called a <a href="shclass.html#shallow-copy">shallow copy</a>. It is possible to
 make the collection copy all of the item's data (known as a <a href="shclass.html#deep-copy">deep copy</a>)
 when an item is inserted. All collection functions that insert an
-item call the virtual function <a href="ntqptrcollection.html#newItem">TQPtrCollection::newItem</a>() for the item
+item call the virtual function <a href="tqptrcollection.html#newItem">TQPtrCollection::newItem</a>() for the item
 to be inserted. Inherit a collection and reimplement it if you want
 to have deep copies in your collection.
 <p> When removing an item from a list, the virtual function
-<a href="ntqptrcollection.html#deleteItem">TQPtrCollection::deleteItem</a>() is called. The default implementation
+<a href="tqptrcollection.html#deleteItem">TQPtrCollection::deleteItem</a>() is called. The default implementation
 in all collection classes deletes the item if auto-deletion is
 enabled.
 <p> <h2> Usage
 </h2>
-<a name="4"></a><p> A pointer-based collection class, such as <a href="ntqptrlist.html">TQPtrList</a>&lt;type&gt;, defines a
+<a name="4"></a><p> A pointer-based collection class, such as <a href="tqptrlist.html">TQPtrList</a>&lt;type&gt;, defines a
 collection of <em>pointers</em> to <em>type</em> objects. The pointer (*) is
 implicit.
-<p> We discuss <a href="ntqptrlist.html">TQPtrList</a> here, but the same techniques apply to all
+<p> We discuss <a href="tqptrlist.html">TQPtrList</a> here, but the same techniques apply to all
 pointer-based collection classes and all collection class iterators.
 <p> Template instantiation:
 <pre>
-    <a href="ntqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;            // wherever the list is used
+    <a href="tqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;            // wherever the list is used
 </pre>
  
 <p> The item's class or type, Employee in our example, must be defined prior
@@ -176,22 +176,22 @@ to the list definition.
 <p> <pre>
     // Does not work: Employee is not defined
     class Employee;
-    <a href="ntqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;
+    <a href="tqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;
 
     // This works: Employee is defined before it is used
     class Employee {
         ...
     };
-    <a href="ntqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;
+    <a href="tqptrlist.html">TQPtrList</a>&lt;Employee&gt; list;
 </pre>
  
 <p> <h2> Iterators
 </h2>
-<a name="5"></a><p> Although <a href="ntqptrlist.html">TQPtrList</a> has member functions to traverse the list, it can
-often be better to make use of an iterator. <a href="qptrlistiterator.html">TQPtrListIterator</a> is very
+<a name="5"></a><p> Although <a href="tqptrlist.html">TQPtrList</a> has member functions to traverse the list, it can
+often be better to make use of an iterator. <a href="tqptrlistiterator.html">TQPtrListIterator</a> is very
 safe and can traverse lists that are being modified at the same time.
 Multiple iterators can work independently on the same collection.
-<p> A <a href="ntqptrlist.html">TQPtrList</a> has an internal list of all the iterators that are
+<p> A <a href="tqptrlist.html">TQPtrList</a> has an internal list of all the iterators that are
 currently operating on it. When a list entry is removed, the list
 updates all iterators accordingly.
 <p> The <a href="ntqdict.html">TQDict</a> and <a href="ntqcache.html">TQCache</a> collections have no traversal functions. To
@@ -231,12 +231,12 @@ Iterator Classes
 <tr bgcolor=#f0f0f0><td><b><a href="qintdictiterator.html">TQIntDictIterator</a></b><td>Iterator for TQIntDict collections
 <tr bgcolor=#f0f0f0><td><b><a href="tqobjectlist.html">TQObjectList</a></b><td>TQPtrList of TQObjects
 <tr bgcolor=#f0f0f0><td><b><a href="tqobjectlistiterator.html">TQObjectListIterator</a></b><td>Iterator for TQObjectLists
-<tr bgcolor=#f0f0f0><td><b><a href="ntqptrcollection.html">TQPtrCollection</a></b><td>The base class of most pointer-based TQt collections
-<tr bgcolor=#f0f0f0><td><b><a href="ntqptrdict.html">TQPtrDict</a></b><td>Template class that provides a dictionary based on void* keys
-<tr bgcolor=#f0f0f0><td><b><a href="qptrdictiterator.html">TQPtrDictIterator</a></b><td>Iterator for TQPtrDict collections
-<tr bgcolor=#f0f0f0><td><b><a href="ntqptrlist.html">TQPtrList</a></b><td>Template class that provides a list
-<tr bgcolor=#f0f0f0><td><b><a href="qptrlistiterator.html">TQPtrListIterator</a></b><td>Iterator for TQPtrList collections
-<tr bgcolor=#f0f0f0><td><b><a href="ntqptrqueue.html">TQPtrQueue</a></b><td>Template class that provides a queue
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrcollection.html">TQPtrCollection</a></b><td>The base class of most pointer-based TQt collections
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrdict.html">TQPtrDict</a></b><td>Template class that provides a dictionary based on void* keys
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrdictiterator.html">TQPtrDictIterator</a></b><td>Iterator for TQPtrDict collections
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrlist.html">TQPtrList</a></b><td>Template class that provides a list
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrlistiterator.html">TQPtrListIterator</a></b><td>Iterator for TQPtrList collections
+<tr bgcolor=#f0f0f0><td><b><a href="tqptrqueue.html">TQPtrQueue</a></b><td>Template class that provides a queue
 <tr bgcolor=#f0f0f0><td><b><a href="qstrilist.html">TQStrIList</a></b><td>Doubly-linked list of char* with case-insensitive comparison
 <tr bgcolor=#f0f0f0><td><b><a href="ntqstrlist.html">TQStrList</a></b><td>Doubly-linked list of char*
 </table>