QGList3qt
Internal class for implementing qt collection classes #include <qglist.h> inherits qcollection. inherited by qlist, qqueue and qstack.
Overview
The QGList class is an internal class for implementing Qt collection classes.
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.
- compareItems() compares two collection/list items.
- read() reads a collection/list item from a QDataStream.
- write() writes a collection/list item to a QDataStream. Normally, you do not have to reimplement any of these functions. If you still want to reimplement them, see the QStrList class (qstrlist.h), which is a good example.
Member function documentation
int QGList::compareItems ( QCollection::Item item1, QCollection::Item item2 ) [virtual protected]
This virtual function compares two list items.
Returns:
- 0 if item1 == item2
- non-zero if item1 != item2
This function returns int rather than bool so that reimplementations can return three values and use it to sort by:
- 0 if item1 == item2
- > 0 (positive integer) if item1 > item2
- < 0 (negative integer) if item1 < item2
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:
bool QGList::operator== ( const QGList & list ) const [protected]
Compares this list with list. Retruns TRUE if the lists contain the same data, else FALSE.
QDataStream & QGList::read ( QDataStream & s, QCollection::Item & item ) [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().
void QGList::sort () [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.
QDataStream & QGList::write ( QDataStream & s, QCollection::Item ) const [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().
QGList::QGList () [protected]
For internal use only.
QGList::QGList ( const QGList & list ) [protected]
For internal use only.
QGList::~QGList () [virtual protected]
For internal use only.
void QGList::append ( QCollection::Item d ) [protected]
For internal use only.
QCollection::Item QGList::at( uint index ) [protected]
For internal use only.
int QGList::at () const [protected]
For internal use only.
QCollection::Item QGList::cfirst() const [protected]
For internal use only.
QCollection::Item QGList::clast() const [protected]
For internal use only.
void QGList::clear () [virtual protected]
For internal use only.
Reimplemented from QCollection.
uint QGList::contains ( QCollection::Item d ) const [protected]
For internal use only.
uint QGList::containsRef ( QCollection::Item d ) const [protected]
For internal use only.
uint QGList::count () const [virtual]
For internal use only.
Reimplemented from QCollection.
QLNode * QGList::currentNode () const [protected]
For internal use only.
int QGList::find ( QCollection::Item d, bool fromStart = TRUE ) [protected]
For internal use only.
int QGList::findRef ( QCollection::Item d, bool fromStart = TRUE ) [protected]
For internal use only.
QCollection::Item QGList::first() [protected]
For internal use only.
QCollection::Item QGList::get() const [protected]
For internal use only.
void QGList::inSort ( QCollection::Item d ) [protected]
For internal use only.
bool QGList::insertAt ( uint index, QCollection::Item d ) [protected]
For internal use only.
QCollection::Item QGList::last() [protected]
For internal use only.
QCollection::Item QGList::next() [protected]
For internal use only.
QGList& QGList::operator= ( const QGList & list ) [protected]
For internal use only.
QCollection::Item QGList::prev() [protected]
For internal use only.
QDataStream & QGList::read ( QDataStream & s )
For internal use only.
void QGList::relinkNode ( QLNode * n ) [protected]
For internal use only.
bool QGList::remove ( QCollection::Item d = 0 ) [protected]
For internal use only.
bool QGList::removeAt ( uint index ) [protected]
For internal use only.
bool QGList::removeFirst () [protected]
For internal use only.
bool QGList::removeLast () [protected]
For internal use only.
bool QGList::removeNode ( QLNode * n ) [protected]
For internal use only.
bool QGList::removeRef ( QCollection::Item d = 0 ) [protected]
For internal use only.
QCollection::Item QGList::take() [protected]
For internal use only.
QCollection::Item QGList::takeAt( uint index ) [protected]
For internal use only.
QCollection::Item QGList::takeFirst() [protected]
For internal use only.
QCollection::Item QGList::takeLast() [protected]
For internal use only.
QCollection::Item QGList::takeNode( QLNode * n ) [protected]
For internal use only.
void QGList::toVector ( QGVector * vector ) const [protected]
For internal use only.
QDataStream & QGList::write ( QDataStream & s ) const
For internal use only.
Releases
2 releases since Debian 2.2 (Potato); the text changed 1 time.