TQSortedList Class

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. -

If the items in your list support operator<() and operator==(), -you might be better off with TQSortedList because it implements the -compareItems() function for you using these two operators.

type * TQPtrList::take ( uint index ) diff --git a/doc/html/ntqsortedlist.html b/doc/html/ntqsortedlist.html deleted file mode 100644 index a8880cf5a..000000000 --- a/doc/html/ntqsortedlist.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - - -TQSortedList Class - - - - - - - -

TQSortedList Class Reference
[obsolete]

The TQSortedList class provides a list sorted by operator< and operator==. -More... -

Public Members

Detailed Description

This class is obsolete. It is provided to keep old source working. We strongly advise against using it in new code. -

If you want to sort a TQPtrList you have to reimplement the -TQGList::compareItems() method. If the elements of your list support -operator<() and operator==(), you can use TQSortedList instead. -Its compareItems() calls operator<() and operator==() and returns an -appropriate result. -

Member Function Documentation

TQSortedList::TQSortedList () -

TQSortedList::TQSortedList ( const TQSortedList<type> & list ) -

TQSortedList::~TQSortedList () -

TQSortedList<type> & TQSortedList::operator= ( const TQSortedList<type> & list ) -

This list is first cleared; each item in list is then -appended to this list. Only the pointers are copied -(shallow copy) unless newItem() has been reimplemented(). - - -

ntqsortedlist.h

This is the verbatim text of the ntqsortedlist.h include file. It is provided only for illustration; the copyright remains with Trolltech. -

Complete Member List for TQSortedList

This is the complete list of member functions for -TQSortedList, including inherited members. - -

- operator= - ~QSortedList -

QSound available diff --git a/doc/html/titleindex b/doc/html/titleindex index 264d671b1..e91d005a9 100644 --- a/doc/html/titleindex +++ b/doc/html/titleindex @@ -769,8 +769,6 @@ QSocketDevice Class | ntqsocketdevice.html QSocketDevice Member List | qsocketdevice-members.html QSocketNotifier Class | ntqsocketnotifier.html QSocketNotifier Member List | qsocketnotifier-members.html -QSortedList Class | ntqsortedlist.html -QSortedList Member List | qsortedlist-members.html QSound Class | ntqsound.html QSound Member List | qsound-members.html QSpacerItem Class | qspaceritem.html @@ -1354,7 +1352,6 @@ ntqslider.h Include File | qslider-h.html ntqsocket.h Include File | qsocket-h.html ntqsocketdevice.h Include File | qsocketdevice-h.html ntqsocketnotifier.h Include File | qsocketnotifier-h.html -ntqsortedlist.h Include File | qsortedlist-h.html ntqsound.h Include File | qsound-h.html ntqspinbox.h Include File | qspinbox-h.html ntqsplashscreen.h Include File | qsplashscreen-h.html diff --git a/doc/man/man3/tqptrlist.3qt b/doc/man/man3/tqptrlist.3qt index 8546949f6..8d5b379df 100644 --- a/doc/man/man3/tqptrlist.3qt +++ b/doc/man/man3/tqptrlist.3qt @@ -13,7 +13,7 @@ QPtrList \- Template class that provides a list .PP Inherits QPtrCollection. .PP -Inherited by QObjectList, QSortedList, and QStrList. +Inherited by QObjectList and QStrList. .PP .SS "Public Members" .in +1c @@ -641,8 +641,6 @@ Sorts the list by the result of the virtual compareItems() function. .PP 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. .PP -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. -.PP See also inSort(). .SH "type * QPtrList::take ( uint index )" Takes the item at position \fIindex\fR out of the list without deleting it (even if auto-deletion is enabled). 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() */ diff --git a/doc/qsortedlist.doc b/doc/qsortedlist.doc deleted file mode 100644 index 06cd0e4f4..000000000 --- a/doc/qsortedlist.doc +++ /dev/null @@ -1,91 +0,0 @@ -/**************************************************************************** -** -** QSortedList documentation -** -** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved. -** -** This file is part of the TQt GUI Toolkit. -** -** This file may be used under the terms of the GNU General -** Public License versions 2.0 or 3.0 as published by the Free -** Software Foundation and appearing in the files LICENSE.GPL2 -** and LICENSE.GPL3 included in the packaging of this file. -** Alternatively you may (at your option) use any later version -** of the GNU General Public License if such license has been -** publicly approved by Trolltech ASA (or its successors, if any) -** and the KDE Free TQt Foundation. -** -** Please review the following information to ensure GNU General -** Public Licensing requirements will be met: -** http://trolltech.com/products/qt/licenses/licensing/opensource/. -** If you are unsure which license is appropriate for your use, please -** review the following information: -** http://trolltech.com/products/qt/licenses/licensing/licensingoverview -** or contact the sales department at sales@trolltech.com. -** -** This file may be used under the terms of the Q Public License as -** defined by Trolltech ASA and appearing in the file LICENSE.QPL -** included in the packaging of this file. Licensees holding valid Qt -** Commercial licenses may use this file in accordance with the Qt -** Commercial License Agreement provided with the Software. -** -** This file is provided "AS IS" with NO WARRANTY OF ANY KIND, -** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR -** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted -** herein. -** -**********************************************************************/ - -/*! - \class QSortedList ntqsortedlist.h - \brief The QSortedList class provides a list sorted by operator< and operator==. - - \obsolete - - If you want to sort a QPtrList you have to reimplement the - QGList::compareItems() method. If the elements of your list support - operator<() and operator==(), you can use QSortedList instead. - Its compareItems() calls operator<() and operator==() and returns an - appropriate result. - - Otherwise, this is as QPtrList. - - \sa QPtrList -*/ - - -/*! - \fn QSortedList::QSortedList() - Constructs an empty list. -*/ - -/*! - \fn QSortedList::QSortedList( const QSortedList &list ) - Constructs a copy of \a list. - - Each item in \a list is copied to this new list. -*/ - -/*! - \fn QSortedList::~QSortedList() - Removes all items from the list and destroys the list. - - All list iterators that access this list will be reset. -*/ - -/*! - \fn QSortedList& QSortedList::operator=(const QSortedList& list) - Assigns \a list to this list and returns a reference to this list. - - This list is first cleared; each item in \a list is then - appended to this list. Only the pointers are copied - (shallow copy) unless newItem() has been reimplemented(). -*/ - -/*! - \fn int QSortedList::compareItems( QPtrCollection::Item s1, QPtrCollection::Item s2 ) - - \reimp - - This reimplementation uses operator< and operator== to compare. -*/ -- cgit v1.2.1

Public Members

TQSortedList Class Reference[obsolete]

Public Members

Detailed Description

Member Function Documentation

TQSortedList::TQSortedList () -

TQSortedList::TQSortedList ( const TQSortedList<type> & list ) -

TQSortedList::~TQSortedList () -

TQSortedList<type> & TQSortedList::operator= ( const TQSortedList<type> & list ) -

ntqsortedlist.h

Complete Member List for TQSortedList

TQSortedList Class Reference
[obsolete]