diff options
Diffstat (limited to 'doc/html/tqvaluevector.html')
| -rw-r--r-- | doc/html/tqvaluevector.html | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/doc/html/tqvaluevector.html b/doc/html/tqvaluevector.html index 78393e51..78c65972 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 <p> TQValueVector is a TQt implementation of an STL-like vector container. It can be used in your application if the standard <tt>vector</tt> is not available for your target platforms. TQValueVector is -part of the <a href="ntqtl.html">TQt Template Library</a>. +part of the <a href="tqtl.html">TQt Template Library</a>. <p> 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. <p> TQValueVector uses an STL-like syntax to manipulate and address the -objects it contains. See <a href="ntqtl.html">this document</a> for +objects it contains. See <a href="tqtl.html">this document</a> for more information. <p> Example: <pre> @@ -232,9 +232,9 @@ example: <p> 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 <a href="ntqtl.html">TQTL</a>. +example, algorithms provided by the STL or the <a href="tqtl.html">TQTL</a>. <p> Another way to find an element in the vector is by using the -std::find() or <a href="ntqtl.html#qFind">tqFind()</a> algorithms. +std::find() or <a href="tqtl.html#qFind">tqFind()</a> algorithms. For example: <p> <pre> TQValueVector<int> vec; @@ -305,7 +305,7 @@ elements at specific positions within the vector. There are several variants of the <a href="#erase">erase</a>() function which removes a specific element, or range of elements, from the vector. <p> Vectors can be also sorted with various STL algorithms , or it can -be sorted using the <a href="ntqtl.html">TQt Template Library</a>. +be sorted using the <a href="tqtl.html">TQt Template Library</a>. For example with qHeapSort(): <p> Example: <pre> @@ -320,7 +320,7 @@ For example with qHeapSort(): <p> TQValueVector stores its elements in contiguous memory. This means that you can use a TQValueVector in any situation that requires an array. -<p>See also <a href="ntqtl.html">TQt Template Library Classes</a>, <a href="shared.html">Implicitly and Explicitly Shared Classes</a>, and <a href="tools.html">Non-GUI Classes</a>. +<p>See also <a href="tqtl.html">TQt Template Library Classes</a>, <a href="shared.html">Implicitly and Explicitly Shared Classes</a>, and <a href="tools.html">Non-GUI Classes</a>. <hr><h2>Member Type Documentation</h2> <h3 class=fn><a name="ConstIterator"></a>TQValueVector::ConstIterator</h3> |