diff options
| author | Michele Calgaro <michele.calgaro@yahoo.it> | 2024-09-09 14:57:42 +0900 |
|---|---|---|
| committer | Michele Calgaro <michele.calgaro@yahoo.it> | 2024-09-12 18:58:18 +0900 |
| commit | 6f57abfc9cd3acf1d648aee696947ac9216adb71 (patch) | |
| tree | 4ae374b1ce01d388bca2249c5d903d79a6cb814f /doc/html/tqstringlist.html | |
| parent | 0582c90a9ed4b965629267713f51c0da7c38b39d (diff) | |
| download | tqt-6f57abfc.tar.gz tqt-6f57abfc.zip | |
Rename remaining ntq[s-z]* related files to equivalent tq*
Signed-off-by: Michele Calgaro <michele.calgaro@yahoo.it>
Diffstat (limited to 'doc/html/tqstringlist.html')
| -rw-r--r-- | doc/html/tqstringlist.html | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/html/tqstringlist.html b/doc/html/tqstringlist.html index 22c58777a..574e818fc 100644 --- a/doc/html/tqstringlist.html +++ b/doc/html/tqstringlist.html @@ -72,7 +72,7 @@ together. Essentially TQStringList is a <a href="tqvaluelist.html">TQValueList</ objects. Unlike <a href="tqstrlist.html">TQStrList</a>, which stores pointers to characters, TQStringList holds real TQString objects. It is the class of choice whenever you work with Unicode strings. TQStringList is part of the -<a href="ntqtl.html">TQt Template Library</a>. +<a href="tqtl.html">TQt Template Library</a>. <p> Like TQString itself, TQStringList objects are <a href="shclass.html#implicitly-shared">implicitly shared</a>, so passing them around as value-parameters is both fast and safe. <p> Strings can be added to a list using <a href="tqvaluelist.html#append">append</a>(), <a href="tqvaluelist.html#operator+-eq">operator+=</a>() or @@ -250,7 +250,7 @@ separated by the string <em>sep</em> (which can be empty). <h3 class=fn>void <a name="sort"></a>TQStringList::sort () </h3> Sorts the list of strings in ascending case-sensitive order. -<p> Sorting is very fast. It uses the <a href="ntqtl.html">TQt Template +<p> Sorting is very fast. It uses the <a href="tqtl.html">TQt Template Library's</a> efficient HeapSort implementation that has a time complexity of O(n*log n). <p> If you want to sort your strings in an arbitrary order consider |