#include <qstrlist.h>
Public Member Functions | |
| QStrIList (bool deepCopies=TRUE) | |
| ~QStrIList () | |
Public Member Functions inherited from QStrList | |
| QStrList (bool deepCopies=TRUE) | |
| QStrList (const QStrList &) | |
| ~QStrList () | |
| QStrList & | operator= (const QStrList &) |
Public Member Functions inherited from QInternalList< type > | |
| QInternalList () | |
| QInternalList (const QInternalList< type > &l) | |
| ~QInternalList () | |
| QInternalList< type > & | operator= (const QInternalList< type > &l) |
| bool | operator== (const QInternalList< type > &list) const |
| uint | count () const |
| bool | isEmpty () const |
| bool | insert (uint i, const type *d) |
| void | inSort (const type *d) |
| void | prepend (const type *d) |
| void | append (const type *d) |
| bool | remove (uint i) |
| bool | remove () |
| bool | remove (const type *d) |
| bool | removeRef (const type *d) |
| void | removeNode (QLNode *n) |
| bool | removeFirst () |
| bool | removeLast () |
| type * | take (uint i) |
| type * | take () |
| type * | takeNode (QLNode *n) |
| void | clear () |
| void | sort () |
| int | find (const type *d) |
| int | findNext (const type *d) |
| int | findRef (const type *d) |
| int | findNextRef (const type *d) |
| uint | contains (const type *d) const |
| uint | containsRef (const type *d) const |
| type * | at (uint i) |
| int | at () const |
| type * | current () const |
| QLNode * | currentNode () const |
| type * | getFirst () const |
| type * | getLast () const |
| type * | first () |
| type * | last () |
| type * | next () |
| type * | prev () |
| void | toVector (QGVector *vec) const |
Public Member Functions inherited from QGList | |
| QDataStream & | read (QDataStream &) |
| QDataStream & | write (QDataStream &) const |
Public Member Functions inherited from QCollection | |
| bool | autoDelete () const |
| void | setAutoDelete (bool enable) |
Private Member Functions | |
| int | compareItems (QCollection::Item s1, QCollection::Item s2) |
Definition at line 80 of file qstrlist.h.
Definition at line 83 of file qstrlist.h.
|
inline |
Definition at line 84 of file qstrlist.h.
|
inlineprivatevirtual |
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:
Reimplemented from QStrList.
Definition at line 86 of file qstrlist.h.
1.8.11