diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2023-07-06 17:00:23 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2023-07-07 10:28:19 +0900 |
| commit | bfd62a0bbfd44ce5f7530fc7bb624dd911f9033a (patch) | |
| tree | f34d57c9879101d3f64f6044d66b0e762622d57d /doc/qptrlist.doc | |
| parent | a8466ab3bb55c8c1717ca8f3bcc7cf5b225a43aa (diff) | |
| download | tqt3-bfd62a0bbfd44ce5f7530fc7bb624dd911f9033a.tar.gz tqt3-bfd62a0bbfd44ce5f7530fc7bb624dd911f9033a.zip | |
Drop Qt2's TQSemiModal and TQSortedList classes
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'doc/qptrlist.doc')
| -rw-r--r-- | doc/qptrlist.doc | 4 |
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() */ |