Drop Qt2's TQSemiModal and TQSortedList classes

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

1 files changed, 1 insertions, 4 deletions

diff --git a/doc/html/ntqptrlist.html b/doc/html/ntqptrlist.html
index 305b49949..9307d8396 100644
--- a/doc/html/ntqptrlist.html
+++ b/doc/html/ntqptrlist.html
@@ -35,7 +35,7 @@ body { background: #ffffff; color: black; }
 <a href="#details">More...</a>
 <p><tt>#include &lt;<a href="qptrlist-h.html">ntqptrlist.h</a>&gt;</tt>
 <p>Inherits <a href="ntqptrcollection.html">TQPtrCollection</a>.
-<p>Inherited by <a href="ntqobjectlist.html">TQObjectList</a>, <a href="ntqsortedlist.html">TQSortedList</a>, and <a href="ntqstrlist.html">TQStrList</a>.
+<p>Inherited by <a href="ntqobjectlist.html">TQObjectList</a> and <a href="ntqstrlist.html">TQStrList</a>.
 <p><a href="qptrlist-members.html">List of all member functions.</a>
 <h2>Public Members</h2>
 <ul>
@@ -660,9 +660,6 @@ function.
 <p> The heap sort algorithm is used for sorting. It sorts n items with
 O(n*log n) comparisons. This is the asymptotic optimal solution of
 the sorting problem.
-<p> If the items in your list support <a href="ntqcstring.html#operator-lt-2">operator&lt;</a>() and <a href="#operator-eq-eq">operator==</a>(),
-you might be better off with TQSortedList because it implements the
-compareItems() function for you using these two operators.
 <p> <p>See also <a href="#inSort">inSort</a>().
 
 <h3 class=fn>type * <a name="take"></a>TQPtrList::take ( uint&nbsp;index )