QStrList(3qt)

NAME
QStrList - Doubly linked list of char*.

SYNOPSIS

#include <qstrlist.h>

Inherits QList.

Inherited by QStrIList.

  Public Members
QStrList ( bool deepCopies=TRUE )
QStrList ( const QStrList & )
~QStrList ()
QStrList& operator= ( const QStrList & )

DESCRIPTION
The QStrList class provides a doubly linked list of 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

MEMBER FUNCTION DOCUMENTATION

QStrList::QStrList ( bool deepCopies=TRUE )
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.

QStrList::QStrList ( const QStrList & list )
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.

QStrList::~QStrList ()
Destroys the list. All strings are removed.

QStrList& QStrList::operator= ( const QStrList & list )
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.

SEE ALSO
http://www.troll.no/qt/qstrlist.html

COPYRIGHT
Copyright 1992-1997 Troll Tech AS. See the LICENSE file included in the distribution for a complete license statement.

AUTHOR
Generated automatically from the source code.