diff options
Diffstat (limited to 'doc/tqvaluevector.doc')
| -rw-r--r-- | doc/tqvaluevector.doc | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/doc/tqvaluevector.doc b/doc/tqvaluevector.doc index a2035be29..6583cded6 100644 --- a/doc/tqvaluevector.doc +++ b/doc/tqvaluevector.doc @@ -45,7 +45,7 @@ \class TQValueVector tqvaluevector.h \brief The TQValueVector class is a value-based template class that provides a dynamic array. - \ingroup qtl + \ingroup tqtl \ingroup tools \ingroup shared \mainclass @@ -54,7 +54,7 @@ TQValueVector is a TQt implementation of an STL-like vector container. It can be used in your application if the standard \c vector is not available for your target platforms. TQValueVector is - part of the \link ntqtl.html TQt Template Library\endlink. + part of the \link tqtl.html TQt Template Library\endlink. TQValueVector\<T\> defines a template instance to create a vector of values that all have the class T. TQValueVector does not store @@ -89,7 +89,7 @@ cases this is sufficient. TQValueVector uses an STL-like syntax to manipulate and address the - objects it contains. See \link ntqtl.html this document\endlink for + objects it contains. See \link tqtl.html this document\endlink for more information. Example: @@ -193,11 +193,11 @@ 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 \link ntqtl.html - QTL\endlink. + example, algorithms provided by the STL or the \link tqtl.html + TQTL\endlink. Another way to find an element in the vector is by using the - std::find() or \link ntqtl.html#qFind tqFind()\endlink algorithms. + std::find() or \link tqtl.html#qFind tqFind()\endlink algorithms. For example: \code @@ -276,7 +276,7 @@ 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 \link ntqtl.html TQt Template Library\endlink. + be sorted using the \link tqtl.html TQt Template Library\endlink. For example with qHeapSort(): Example: |