From 1f0ce8533cc837aa2d4155b5fc17d2004bed0197 Mon Sep 17 00:00:00 2001 From: Michele Calgaro Date: Wed, 5 Jun 2024 19:02:23 +0900 Subject: Rename template library nt* related files to equivalent tq* Signed-off-by: Michele Calgaro --- doc/man/man3/tqvariant.3qt | 80 +++++++++++++++++++++++----------------------- 1 file changed, 40 insertions(+), 40 deletions(-) (limited to 'doc/man/man3/tqvariant.3qt') diff --git a/doc/man/man3/tqvariant.3qt b/doc/man/man3/tqvariant.3qt index 5a8876570..02cdd692f 100644 --- a/doc/man/man3/tqvariant.3qt +++ b/doc/man/man3/tqvariant.3qt @@ -107,10 +107,10 @@ QVariant \- Acts like a union for the most common TQt data types .BI "\fBQVariant\fR ( const QPen & val )" .br .ti -1c -.BI "\fBQVariant\fR ( const QValueList & val )" +.BI "\fBQVariant\fR ( const TQValueList & val )" .br .ti -1c -.BI "\fBQVariant\fR ( const QMap & val )" +.BI "\fBQVariant\fR ( const TQMap & val )" .br .ti -1c .BI "\fBQVariant\fR ( int val )" @@ -257,34 +257,34 @@ QVariant \- Acts like a union for the most common TQt data types .BI "double \fBtoDouble\fR ( bool * ok = 0 ) const" .br .ti -1c -.BI "const QValueList \fBtoList\fR () const" +.BI "const TQValueList \fBtoList\fR () const" .br .ti -1c -.BI "const QMap \fBtoMap\fR () const" +.BI "const TQMap \fBtoMap\fR () const" .br .ti -1c .BI "QSizePolicy \fBtoSizePolicy\fR () const" .br .ti -1c -.BI "QValueListConstIterator stringListBegin () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator stringListBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator stringListEnd () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator stringListEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator listBegin () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator listBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator listEnd () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator listEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator mapBegin () const \fI(obsolete)\fR" +.BI "TQMapConstIterator mapBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator mapEnd () const \fI(obsolete)\fR" +.BI "TQMapConstIterator mapEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator mapFind ( const TQString & key ) const \fI(obsolete)\fR" +.BI "TQMapConstIterator mapFind ( const TQString & key ) const \fI(obsolete)\fR" .br .ti -1c .BI "TQString & \fBasString\fR ()" @@ -380,10 +380,10 @@ QVariant \- Acts like a union for the most common TQt data types .BI "double & \fBasDouble\fR ()" .br .ti -1c -.BI "QValueList & \fBasList\fR ()" +.BI "TQValueList & \fBasList\fR ()" .br .ti -1c -.BI "QMap & \fBasMap\fR ()" +.BI "TQMap & \fBasMap\fR ()" .br .ti -1c .BI "QSizePolicy & \fBasSizePolicy\fR ()" @@ -453,7 +453,7 @@ Here is some example code to demonstrate the use of QVariant: .br .fi .PP -You can even store QValueLists and QMaps in a variant, so you can easily construct arbitrarily complex data structures of arbitrary types. This is very powerful and versatile, but may prove less memory and speed efficient than storing specific types in standard data structures. +You can even store TQValueLists and TQMaps in a variant, so you can easily construct arbitrarily complex data structures of arbitrary types. This is very powerful and versatile, but may prove less memory and speed efficient than storing specific types in standard data structures. .PP QVariant also supports the notion of NULL values, where you have a defined type with no value set. .PP @@ -508,13 +508,13 @@ This enum type defines the types of variable that a QVariant can contain. .TP \fCQVariant::KeySequence\fR - a QKeySequence .TP -\fCQVariant::List\fR - a QValueList +\fCQVariant::List\fR - a TQValueList .TP \fCQVariant::LongLong\fR - a long long .TP \fCQVariant::ULongLong\fR - an unsigned long long .TP -\fCQVariant::Map\fR - a QMap +\fCQVariant::Map\fR - a TQMap .TP \fCQVariant::Palette\fR - a QPalette .TP @@ -618,9 +618,9 @@ Constructs a new variant with a bitarray value, \fIval\fR. Constructs a new variant with a key sequence value, \fIval\fR. .SH "QVariant::QVariant ( const QPen & val )" Constructs a new variant with a pen value, \fIval\fR. -.SH "QVariant::QVariant ( const QValueList & val )" +.SH "QVariant::QVariant ( const TQValueList & val )" Constructs a new variant with a list value, \fIval\fR. -.SH "QVariant::QVariant ( const QMap & val )" +.SH "QVariant::QVariant ( const TQMap & val )" Constructs a new variant with a map of QVariants, \fIval\fR. .SH "QVariant::QVariant ( int val )" Constructs a new variant with an integer value, \fIval\fR. @@ -724,16 +724,16 @@ Tries to convert the variant to hold a QKeySequence value. If that is not possib Returns a reference to the stored key sequence. .PP See also toKeySequence(). -.SH "QValueList & QVariant::asList ()" +.SH "TQValueList & QVariant::asList ()" Returns the variant's value as variant list reference. .PP Note that if you want to iterate over the list, you should iterate over a copy, e.g. .PP .nf .br - QValueList list = myVariant.asList(); + TQValueList list = myVariant.asList(); .br - QValueList::Iterator it = list.begin(); + TQValueList::Iterator it = list.begin(); .br while( it != list.end() ) { .br @@ -746,16 +746,16 @@ Note that if you want to iterate over the list, you should iterate over a copy, .fi .SH "TQ_LLONG & QVariant::asLongLong ()" Returns the variant's value as long long reference. -.SH "QMap & QVariant::asMap ()" +.SH "TQMap & QVariant::asMap ()" Returns the variant's value as variant map reference. .PP Note that if you want to iterate over the map, you should iterate over a copy, e.g. .PP .nf .br - QMap map = myVariant.asMap(); + TQMap map = myVariant.asMap(); .br - QMap::Iterator it = map.begin(); + TQMap::Iterator it = map.begin(); .br while( it != map.end() ) { .br @@ -875,23 +875,23 @@ Convert this variant to type Invalid and free up any resources used. Returns TRUE if this is a NULL variant, FALSE otherwise. .SH "bool QVariant::isValid () const" Returns TRUE if the storage type of this variant is not QVariant::Invalid; otherwise returns FALSE. -.SH "QValueListConstIterator QVariant::listBegin () const" +.SH "TQValueListConstIterator QVariant::listBegin () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns an iterator to the first item in the list if the variant's type is appropriate; otherwise returns a null iterator. -.SH "QValueListConstIterator QVariant::listEnd () const" +.SH "TQValueListConstIterator QVariant::listEnd () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns the end iterator for the list if the variant's type is appropriate; otherwise returns a null iterator. -.SH "QMapConstIterator QVariant::mapBegin () const" +.SH "TQMapConstIterator QVariant::mapBegin () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns an iterator to the first item in the map, if the variant's type is appropriate; otherwise returns a null iterator. -.SH "QMapConstIterator QVariant::mapEnd () const" +.SH "TQMapConstIterator QVariant::mapEnd () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns the end iterator for the map, if the variant's type is appropriate; otherwise returns a null iterator. -.SH "QMapConstIterator QVariant::mapFind ( const TQString & key ) const" +.SH "TQMapConstIterator QVariant::mapFind ( const TQString & key ) const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns an iterator to the item in the map with \fIkey\fR as key, if the variant's type is appropriate and \fIkey\fR is a valid key; otherwise returns a null iterator. @@ -907,11 +907,11 @@ Assigns the value of the variant \fIvariant\fR to this variant. This is a deep copy of the variant, but note that if the variant holds an explicitly shared type such as TQImage, a shallow copy is performed. .SH "bool QVariant::operator== ( const QVariant & v ) const" Compares this QVariant with \fIv\fR and returns TRUE if they are equal; otherwise returns FALSE. -.SH "QValueListConstIterator QVariant::stringListBegin () const" +.SH "TQValueListConstIterator QVariant::stringListBegin () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns an iterator to the first string in the list if the variant's type is StringList; otherwise returns a null iterator. -.SH "QValueListConstIterator QVariant::stringListEnd () const" +.SH "TQValueListConstIterator QVariant::stringListEnd () const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP Returns the end iterator for the list if the variant's type is StringList; otherwise returns a null iterator. @@ -993,16 +993,16 @@ See also asInt() and canCast(). Returns the variant as a QKeySequence if the variant can be cast to a KeySequence; otherwise returns an empty key sequence. .PP See also asKeySequence() and canCast(). -.SH "const QValueList QVariant::toList () const" -Returns the variant as a QValueList if the variant has type() List or StringList; otherwise returns an empty list. +.SH "const TQValueList QVariant::toList () const" +Returns the variant as a TQValueList if the variant has type() List or StringList; otherwise returns an empty list. .PP Note that if you want to iterate over the list, you should iterate over a copy, e.g. .PP .nf .br - QValueList list = myVariant.toList(); + TQValueList list = myVariant.toList(); .br - QValueList::Iterator it = list.begin(); + TQValueList::Iterator it = list.begin(); .br while( it != list.end() ) { .br @@ -1021,16 +1021,16 @@ Returns the variant as a long long int if the variant can be cast to LongLong; o If \fIok\fR is non-null: \fI*ok\fR is set to TRUE if the value could be converted to an int; otherwise \fI*ok\fR is set to FALSE. .PP See also asLongLong() and canCast(). -.SH "const QMap QVariant::toMap () const" -Returns the variant as a QMap if the variant has type() Map; otherwise returns an empty map. +.SH "const TQMap QVariant::toMap () const" +Returns the variant as a TQMap if the variant has type() Map; otherwise returns an empty map. .PP Note that if you want to iterate over the map, you should iterate over a copy, e.g. .PP .nf .br - QMap map = myVariant.toMap(); + TQMap map = myVariant.toMap(); .br - QMap::Iterator it = map.begin(); + TQMap::Iterator it = map.begin(); .br while( it != map.end() ) { .br @@ -1124,7 +1124,7 @@ See also asULongLong() and canCast(). .SH "Type QVariant::type () const" Returns the storage type of the value stored in the variant. Usually it's best to test with canCast() whether the variant can deliver the data type you are interested in. .SH "const char * QVariant::typeName () const" -Returns the name of the type stored in the variant. The returned strings describe the C++ datatype used to store the data: for example, "QFont", "TQString", or "QValueList". An Invalid variant returns 0. +Returns the name of the type stored in the variant. The returned strings describe the C++ datatype used to store the data: for example, "QFont", "TQString", or "TQValueList". An Invalid variant returns 0. .SH "const char * QVariant::typeToName ( Type typ )\fC [static]\fR" Converts the enum representation of the storage type, \fItyp\fR, to its string representation. -- cgit v1.2.1