The QStrList class provides a doubly linked list of char*.
More...
#include <qstrlist.h>
Inherits QList.
Inherited by QStrIList.
char*.
This class is a QList<char> instance (a list of char*).
QStrList can make deep or shallow copies of the strings that are inserted.
A deep copy means to allocate space for the string and then copy the string data into it. A shallow copy is just a copy of the pointer value and not the string data.
The disadvantage with shallow copies is that since a pointer can only be deleted once, the program must put all strings in a central place and know when it is safe to delete them (i.e. when the strings are no longer referenced by other parts of the program). This can make the program more complex. The advantage of shallow copies is that shallow copies consume far less memory than deep copies. It is also much faster to copy a pointer (typically 4 or 8 bytes) than to copy string data.
The virtual compareItems() function is reimplemented and does a case sensitive string comparision. The inSort() function will insert strings in a sorted order.
The QStrListIterator class is an iterator for QStrList.
Examples: showimg/showimg.cpp
Constructs an empty list of strings. Will make deep copies of all inserted strings if deepCopies is TRUE, or uses shallow copies if deepCopies is FALSE.
Constructs a copy of list.
If list has deep copies, this list will also get deep copies. Only the pointers are copied (shallow copy) if the other list does not use deep copies.
Destroys the list. All strings are removed.
Assigns list to this list and returns a reference to this list.
If list has deep copies, this list will also get deep copies. Only the pointers are copied (shallow copy) if the other list does not use deep copies.
Search the documentation, FAQ, qt-interest archive and more (uses
www.troll.no):
This file is part of the Qt toolkit, copyright © 1995-98 Troll Tech, all rights reserved.
It was generated from the following files:
| Copyright İ 1998 Troll Tech | Trademarks | Qt version 1.42
|