From 6f57abfc9cd3acf1d648aee696947ac9216adb71 Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Mon, 9 Sep 2024 14:57:42 +0900 Subject: Rename remaining ntq[s-z]* related files to equivalent tq* Signed-off-by: Michele Calgaro --- doc/html/tqvaluevector.html | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'doc/html/tqvaluevector.html') diff --git a/doc/html/tqvaluevector.html b/doc/html/tqvaluevector.html index 78393e518..78c659725 100644 --- a/doc/html/tqvaluevector.html +++ b/doc/html/tqvaluevector.html @@ -105,7 +105,7 @@ The TQValueVector class is a value-based template class that provides a dynamic

TQValueVector is a TQt implementation of an STL-like vector container. It can be used in your application if the standard vector is not available for your target platforms. TQValueVector is -part of the TQt Template Library. +part of the TQt Template Library.

TQValueVector<T> defines a template instance to create a vector of values that all have the class T. TQValueVector does not store pointers to the members of the vector; it holds a copy of every @@ -134,7 +134,7 @@ qualify as a value the class must provide: copy constructors if no explicit version is supplied. In many cases this is sufficient.

TQValueVector uses an STL-like syntax to manipulate and address the -objects it contains. See this document for +objects it contains. See this document for more information.

Example: 

@@ -232,9 +232,9 @@ example:
  
 
 The iterators provided by vector are random access iterators,
 therefore you can use them with many generic algorithms, for
-example, algorithms provided by the STL or the TQTL. 
+example, algorithms provided by the STL or the TQTL. 
 
 Another way to find an element in the vector is by using the
-std::find() or tqFind() algorithms.
+std::find() or tqFind() algorithms.
 For example:
 
 
     TQValueVector<int> vec;
@@ -305,7 +305,7 @@ elements at specific positions within the vector.
 There are several variants of the erase() function which removes a
 specific element, or range of elements, from the vector.
 
 Vectors can be also sorted with various STL algorithms , or it can
-be sorted using the TQt Template Library.
+be sorted using the TQt Template Library.
 For example with qHeapSort():
 
 Example:
 
@@ -320,7 +320,7 @@ For example with qHeapSort():
 
 TQValueVector stores its elements in contiguous memory. This means
 that you can use a TQValueVector in any situation that requires an
 array. 
-
See also TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes.
+
See also TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes.
 
 
Member Type Documentation

 
TQValueVector::ConstIterator
 
-- 
cgit v1.2.3