diff options
Diffstat (limited to 'doc/html/qt-template-lib.html')
| -rw-r--r-- | doc/html/qt-template-lib.html | 50 |
1 files changed, 25 insertions, 25 deletions
diff --git a/doc/html/qt-template-lib.html b/doc/html/qt-template-lib.html index f76eb049..54b025ad 100644 --- a/doc/html/qt-template-lib.html +++ b/doc/html/qt-template-lib.html @@ -156,19 +156,19 @@ be treated as such. your data's class. <p> Naturally, the sorting templates won't work with const iterators. <p> <a name="qSwap"></a> -<h3> qSwap() +<h3> tqSwap() </h3> -<a name="2-2"></a><p> qSwap() exchanges the values of two variables: +<a name="2-2"></a><p> tqSwap() exchanges the values of two variables: <pre> <a href="ntqstring.html">TQString</a> second( "Einstein" ); <a href="ntqstring.html">TQString</a> name( "Albert" ); - qSwap( second, name ); + tqSwap( second, name ); </pre> <p> <a name="qCount"></a> -<h3> qCount() +<h3> tqCount() </h3> -<a name="2-3"></a><p> The qCount() template function counts the number of occurrences of a +<a name="2-3"></a><p> The tqCount() template function counts the number of occurrences of a value within a container. For example: <pre> <a href="ntqvaluelist.html">TQValueList</a><int> list; @@ -177,13 +177,13 @@ value within a container. For example: list.<a href="ntqvaluelist.html#push_back">push_back</a>( 1 ); list.<a href="ntqvaluelist.html#push_back">push_back</a>( 2 ); int c = 0; - qCount( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), 1, c ); // c == 3 + tqCount( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), 1, c ); // c == 3 </pre> <p> <a name="qFind"></a> -<h3> qFind() +<h3> tqFind() </h3> -<a name="2-4"></a><p> The qFind() template function finds the first occurrence of a value +<a name="2-4"></a><p> The tqFind() template function finds the first occurrence of a value within a container. For example: <pre> <a href="ntqvaluelist.html">TQValueList</a><int> list; @@ -191,23 +191,23 @@ within a container. For example: list.<a href="ntqvaluelist.html#push_back">push_back</a>( 1 ); list.<a href="ntqvaluelist.html#push_back">push_back</a>( 1 ); list.<a href="ntqvaluelist.html#push_back">push_back</a>( 2 ); - <a href="qvaluelistiterator.html">TQValueListIterator</a><int> it = qFind( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), 2 ); + <a href="qvaluelistiterator.html">TQValueListIterator</a><int> it = tqFind( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), 2 ); </pre> <p> <a name="qFill"></a> -<h3> qFill() +<h3> tqFill() </h3> -<a name="2-5"></a><p> The qFill() template function fills a range with copies of a value. +<a name="2-5"></a><p> The tqFill() template function fills a range with copies of a value. For example: <pre> <a href="ntqvaluevector.html">TQValueVector</a><int> vec(3); - qFill( vec.<a href="ntqvaluevector.html#begin">begin</a>(), vec.<a href="ntqvaluevector.html#end">end</a>(), 99 ); // vec contains 99, 99, 99 + tqFill( vec.<a href="ntqvaluevector.html#begin">begin</a>(), vec.<a href="ntqvaluevector.html#end">end</a>(), 99 ); // vec contains 99, 99, 99 </pre> <p> <a name="qEqual"></a> -<h3> qEqual() +<h3> tqEqual() </h3> -<a name="2-6"></a><p> The qEqual() template function compares two ranges for equality of +<a name="2-6"></a><p> The tqEqual() template function compares two ranges for equality of their elements. Note that the number of elements in each range is not considered, only if the elements in the first range are equal to the corresponding elements in the second range (consequently, both ranges @@ -225,14 +225,14 @@ must be valid). For example: v2[4] = 4; v2[5] = 5; - bool b = qEqual( v1.<a href="ntqvaluevector.html#begin">begin</a>(), v2.<a href="ntqvaluevector.html#end">end</a>(), v2.<a href="ntqvaluevector.html#begin">begin</a>() ); + bool b = tqEqual( v1.<a href="ntqvaluevector.html#begin">begin</a>(), v2.<a href="ntqvaluevector.html#end">end</a>(), v2.<a href="ntqvaluevector.html#begin">begin</a>() ); // b == TRUE </pre> <p> <a name="qCopy"></a> -<h3> qCopy() +<h3> tqCopy() </h3> -<a name="2-7"></a><p> The qCopy() template function copies a range of elements to an +<a name="2-7"></a><p> The tqCopy() template function copies a range of elements to an OutputIterator, in this case a TQTextOStreamIterator: <pre> <a href="ntqvaluelist.html">TQValueList</a><int> list; @@ -240,14 +240,14 @@ OutputIterator, in this case a TQTextOStreamIterator: list.<a href="ntqvaluelist.html#push_back">push_back</a>( 200 ); list.<a href="ntqvaluelist.html#push_back">push_back</a>( 300 ); <a href="qtextostream.html">TQTextOStream</a> str( stdout ); - qCopy( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), TQTextOStreamIterator(str) ); + tqCopy( list.<a href="ntqvaluelist.html#begin">begin</a>(), list.<a href="ntqvaluelist.html#end">end</a>(), TQTextOStreamIterator(str) ); </pre> <p> <p> <a name="qCopyBackward"></a> -<h3> qCopyBackward() +<h3> tqCopyBackward() </h3> -<a name="2-8"></a><p> The qCopyBackward() template function copies a container or a slice of +<a name="2-8"></a><p> The tqCopyBackward() template function copies a container or a slice of a container to an OutputIterator, but in reverse order, for example: <pre> <a href="ntqvaluevector.html">TQValueVector</a><int> vec(3); @@ -255,7 +255,7 @@ a container to an OutputIterator, but in reverse order, for example: vec.<a href="ntqvaluevector.html#push_back">push_back</a>( 200 ); vec.<a href="ntqvaluevector.html#push_back">push_back</a>( 300 ); <a href="ntqvaluevector.html">TQValueVector</a><int> another; - qCopyBackward( vec.<a href="ntqvaluevector.html#begin">begin</a>(), vec.<a href="ntqvaluevector.html#end">end</a>(), another.<a href="ntqvaluevector.html#begin">begin</a>() ); + tqCopyBackward( vec.<a href="ntqvaluevector.html#begin">begin</a>(), vec.<a href="ntqvaluevector.html#end">end</a>(), another.<a href="ntqvaluevector.html#begin">begin</a>() ); // 'another' now contains 100, 200, 300 // however the elements are copied one at a time // in reverse order (300, 200, then 100) @@ -271,10 +271,10 @@ illustrates this: <a href="ntqstringlist.html">TQStringList</a> list1, list2; list1 << "Weis" << "Ettrich" << "Arnt" << "Sue"; list2 << "Torben" << "Matthias"; - qCopy( list2.begin(), list2.end(), list1.<a href="ntqvaluelist.html#begin">begin</a>() ); + tqCopy( list2.begin(), list2.end(), list1.<a href="ntqvaluelist.html#begin">begin</a>() ); <a href="ntqvaluevector.html">TQValueVector</a><TQString> vec( list1.<a href="ntqvaluelist.html#size">size</a>(), "Dave" ); - qCopy( list2.begin(), list2.end(), vec.<a href="ntqvaluevector.html#begin">begin</a>() ); + tqCopy( list2.begin(), list2.end(), vec.<a href="ntqvaluevector.html#begin">begin</a>() ); </pre> <p> At the end of this code fragment, the list list1 contains "Torben", @@ -284,11 +284,11 @@ overwritten. The vector vec contains "Torben", "Matthias", "Dave" and <p> If you write new algorithms, consider writing them as template functions in order to make them usable with as many containers as possible. In the above example, you could just as easily print out -a standard C++ array with qCopy(): +a standard C++ array with tqCopy(): <p> <pre> int arr[] = { 100, 200, 300 }; <a href="qtextostream.html">TQTextOStream</a> str( stdout ); - qCopy( arr, arr + 3, TQTextOStreamIterator( str ) ); + tqCopy( arr, arr + 3, TQTextOStreamIterator( str ) ); </pre> <p> <h2> Streaming |