From e6077c30d14e9d662e8843c554db86c0d366d0b6 Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Thu, 6 Jun 2024 13:44:12 +0900 Subject: Rename str nt* related files to equivalent tq* Signed-off-by: Michele Calgaro --- doc/html/tqstrlist.html | 120 ++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 120 insertions(+) create mode 100644 doc/html/tqstrlist.html (limited to 'doc/html/tqstrlist.html') diff --git a/doc/html/tqstrlist.html b/doc/html/tqstrlist.html new file mode 100644 index 000000000..66588b818 --- /dev/null +++ b/doc/html/tqstrlist.html @@ -0,0 +1,120 @@ + + + + + +TQStrList Class + + + + + + + +

TQStrList Class Reference

+ +

The TQStrList class provides a doubly-linked list of char*. +More... +

#include <tqstrlist.h> +

Inherits TQPtrList<char>. +

Inherited by TQStrIList. +

List of all member functions. +

Public Members

TQStrList ( bool deepCopies = TRUE )
TQStrList ( const TQStrList & list )
~TQStrList ()
TQStrList & operator= ( const TQStrList & list )

Detailed Description

+ + +The TQStrList class provides a doubly-linked list of char*. +

+ + +

If you want a string list of TQStrings use TQStringList. +

This class is a TQPtrList<char> instance (a list of char*). +

TQStrList can make deep or shallow copies of the strings that are +inserted. +

A deep copy means that memory is allocated for the string and then +the string data is copied into that memory. A shallow copy is just +a copy of the pointer value and not of the string data itself. +

The disadvantage of shallow copies is that because a pointer can +be deleted only 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 they 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. +

A TQStrList that operates on deep copies will, by default, turn on +auto-deletion (see setAutoDelete()). Thus, by default TQStrList +will deallocate any string copies it allocates. +

The virtual compareItems() function is reimplemented and does a +case-sensitive string comparison. The inSort() function will +insert strings in sorted order. In general it is fastest to insert +the strings as they come and sort() at the end; inSort() is useful +when you just have to add a few extra strings to an already sorted +list. +

The TQStrListIterator class is an iterator for TQStrList. +

Member Function Documentation

TQStrList::TQStrList ( bool deepCopies = TRUE ) +

+ +

Constructs an empty list of strings. Will make deep copies of all +inserted strings if deepCopies is TRUE, or use shallow copies +if deepCopies is FALSE. + +

TQStrList::TQStrList ( const TQStrList & 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. + +

TQStrList::~TQStrList () +

+ +

Destroys the list. All strings are removed. + +

TQStrList & TQStrList::operator= ( const TQStrList & 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. + + +

+ +

Trademarks +

TQt 3.3.8

+ -- cgit v1.2.3