summaryrefslogtreecommitdiffstats
path: root/doc/qptrlist.doc
diff options
context:
space:
mode:
Diffstat (limited to 'doc/qptrlist.doc')
-rw-r--r--doc/qptrlist.doc4
1 files changed, 0 insertions, 4 deletions
diff --git a/doc/qptrlist.doc b/doc/qptrlist.doc
index 2d753f69f..7b784a66a 100644
--- a/doc/qptrlist.doc
+++ b/doc/qptrlist.doc
@@ -238,10 +238,6 @@
O(n*log n) comparisons. This is the asymptotic optimal solution of
the sorting problem.
- If the items in your list support operator<() and operator==(),
- you might be better off with QSortedList because it implements the
- compareItems() function for you using these two operators.
-
\sa inSort()
*/