The QGList class is an internal class for implementing Qt collection classes. More...
#include <qglist.h>
Inherits QCollection.
Inherited by QList, QQueue and QStack.
QGList is a strictly internal class that acts as a base class for several collection classes; QList, QQueue and QStack.
QGList has some virtual functions that can be reimplemented to customize the subclasses.
[protected]
For internal use only.
[protected]
For internal use only.
[virtual protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[virtual protected]
For internal use only.
Reimplemented from QCollection.
[virtual protected]
This virtual function compares two list items.
Returns:
This function returns int rather than bool so that reimplementations can return three values and use it to sort by:
The QList::inSort() function requires that compareItems() is implemented as described here.
This function should not modify the list because some const functions call compareItems().
The default implementation compares the pointers:
[protected]
For internal use only.
[protected]
For internal use only.
[virtual]
For internal use only.
Reimplemented from QCollection.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
Compares this list with list. Retruns TRUE if the lists contain the same data, else FALSE.
[protected]
For internal use only.
For internal use only.
[virtual protected]
Reads a collection/list item from the stream s and returns a reference to the stream.
The default implementation sets item to 0.
See also: write().
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
Sorts the list by the result of the virtual compareItems() function.
The Heap-Sort algorithm is used for sorting. It sorts n items with O(n*log n) compares. This is the asymptotic optimal solution of the sorting problem.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
[protected]
For internal use only.
For internal use only.
[virtual protected]
Writes a collection/list item to the stream s and returns a reference to the stream.
The default implementation does nothing.
See also: read().
Search the documentation, FAQ, qt-interest archive and more (uses
www.troll.no):
This file is part of the Qt toolkit, copyright © 1995-2000 Troll Tech, all rights reserved.
Copyright İ 2000 Troll Tech | Trademarks | Qt version 2.1.0 (pre-release)
|