diff options
Diffstat (limited to 'doc/man')
43 files changed, 624 insertions, 624 deletions
diff --git a/doc/man/man3/tqaxbase.3qt b/doc/man/man3/tqaxbase.3qt index fc0f1969f..e8c6f0a2e 100644 --- a/doc/man/man3/tqaxbase.3qt +++ b/doc/man/man3/tqaxbase.3qt @@ -33,7 +33,7 @@ Inherited by QAxObject and QAxWidget. .BI "QVariant \fBdynamicCall\fR ( const QCString & function, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" .br .ti -1c -.BI "QVariant \fBdynamicCall\fR ( const QCString & function, QValueList<QVariant> & vars )" +.BI "QVariant \fBdynamicCall\fR ( const QCString & function, TQValueList<QVariant> & vars )" .br .ti -1c .BI "QAxObject * \fBquerySubObject\fR ( const QCString & name, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" @@ -156,7 +156,7 @@ QAxBase transparently converts between COM data types and the equivalent TQt dat .PP Supported COM datatypes are listed in the first column of following table. The second column is the TQt type that can be used with the TQObject property functions. The third column is the TQt type that is used in the prototype of generated signals and slots for in-parameters, and the last column is the TQt type that is used in the prototype of signals and slots for out-parameters. <center>.nf .TS -l - l. COM type TQt property in-parameter out-parameter VARIANT_BOOL bool bool bool& BSTR TQString const TQString& TQString& char, short, int, long int int int& uchar, ushort, uint, ulong uint uint uint& float, double double double double& DATE QDateTime const QDateTime& QDateTime& CY TQ_LLONG TQ_LLONG TQ_LLONG& OLE_COLOR TQColor const TQColor& TQColor& SAFEARRAY(VARIANT) QValueList<QVariant> const QValueList<QVariant>& QValueList<QVariant>& SAFEARRAY(BYTE) QByteArray const QByteArray& QByteArray& SAFEARRAY(BSTR) QStringList const QStringList& QStringList& VARIANT type-dependent const QVariant& QVariant& IFontDisp* QFont const QFont& QFont& IPictureDisp* QPixmap const QPixmap& QPixmap& IDispatch* QAxObject* (read-only) QAxBase::asVariant() QAxObject* (return value) IUnknown* QAxObject* (read-only) QAxBase::asVariant() QAxObject* (return value) SCODE, DECIMAL \fIunsupported\fR \fIunsupported\fR +l - l. COM type TQt property in-parameter out-parameter VARIANT_BOOL bool bool bool& BSTR TQString const TQString& TQString& char, short, int, long int int int& uchar, ushort, uint, ulong uint uint uint& float, double double double double& DATE QDateTime const QDateTime& QDateTime& CY TQ_LLONG TQ_LLONG TQ_LLONG& OLE_COLOR TQColor const TQColor& TQColor& SAFEARRAY(VARIANT) TQValueList<QVariant> const TQValueList<QVariant>& TQValueList<QVariant>& SAFEARRAY(BYTE) QByteArray const QByteArray& QByteArray& SAFEARRAY(BSTR) QStringList const QStringList& QStringList& VARIANT type-dependent const QVariant& QVariant& IFontDisp* QFont const QFont& QFont& IPictureDisp* QPixmap const QPixmap& QPixmap& IDispatch* QAxObject* (read-only) QAxBase::asVariant() QAxObject* (return value) IUnknown* QAxObject* (read-only) QAxBase::asVariant() QAxObject* (return value) SCODE, DECIMAL \fIunsupported\fR \fIunsupported\fR .TE .fi </center> @@ -208,20 +208,20 @@ use the QAxBase API like this: bool ok = object.dynamicCall( "addColumn(const TQString&)", "Column 1" ).toBool(); .br .br - QValueList<QVariant> varlist; + TQValueList<QVariant> varlist; .br - QValueList<QVariant> parameters; + TQValueList<QVariant> parameters; .br parameters << QVariant( varlist ); .br - int n = object.dynamicCall( "fillList(QValueList<QVariant>&)", parameters ).toInt(); + int n = object.dynamicCall( "fillList(TQValueList<QVariant>&)", parameters ).toInt(); .br .br QAxObject *item = object.querySubItem( "item(int)", 5 ); .br .fi .PP -Note that the QValueList the object should fill has to be provided as an element in the parameter list of QVariants. +Note that the TQValueList the object should fill has to be provided as an element in the parameter list of QVariants. .PP If you need to access properties or pass parameters of unsupported datatypes you must access the COM object directly through its IDispatch implementation or other interfaces. Those interfaces can be retrieved through queryInterface(). .PP @@ -246,7 +246,7 @@ To get the definition of the COM interfaces you will have to use the header file If you need to react to events that pass parameters of unsupported datatypes you can use the generic signal that delivers the event data as provided by the COM event. .SS "Member Type Documentation" .SH "QAxBase::PropertyBag" -A QMap<TQString,QVariant> that can store properties as name:value pairs. +A TQMap<TQString,QVariant> that can store properties as name:value pairs. .SH MEMBER FUNCTION DOCUMENTATION .SH "QAxBase::QAxBase ( IUnknown * iface = 0 )" Creates a QAxBase object that wraps the COM object \fIiface\fR. If \fIiface\fR is 0 (the default), use setControl() to instantiate a COM object. @@ -330,7 +330,7 @@ It is only possible to call functions through dynamicCall() that have parameters This is also more efficient. .PP Example: qutlook/centralwidget.cpp. -.SH "QVariant QAxBase::dynamicCall ( const QCString & function, QValueList<QVariant> & vars )" +.SH "QVariant QAxBase::dynamicCall ( const QCString & function, TQValueList<QVariant> & vars )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Calls the COM object's method \fIfunction\fR, passing the parameters in \fIvars\fR, and returns the value returned by the method. If the method does not return a value or when the function call failed this function returns an invalid QVariant object. diff --git a/doc/man/man3/tqaxobject.3qt b/doc/man/man3/tqaxobject.3qt index f035fcde3..3019e2e0a 100644 --- a/doc/man/man3/tqaxobject.3qt +++ b/doc/man/man3/tqaxobject.3qt @@ -38,7 +38,7 @@ Inherited by QAxScriptEngine. .BI "QVariant \fBdynamicCall\fR ( const QCString & function, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" .br .ti -1c -.BI "QVariant \fBdynamicCall\fR ( const QCString & function, QValueList<QVariant> & vars )" +.BI "QVariant \fBdynamicCall\fR ( const QCString & function, TQValueList<QVariant> & vars )" .br .ti -1c .BI "QAxObject * \fBquerySubObject\fR ( const QCString & name, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" @@ -118,7 +118,7 @@ It is only possible to call functions through dynamicCall() that have parameters This is also more efficient. .PP Example: qutlook/centralwidget.cpp. -.SH "QVariant QAxBase::dynamicCall ( const QCString & function, QValueList<QVariant> & vars )" +.SH "QVariant QAxBase::dynamicCall ( const QCString & function, TQValueList<QVariant> & vars )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Calls the COM object's method \fIfunction\fR, passing the parameters in \fIvars\fR, and returns the value returned by the method. If the method does not return a value or when the function call failed this function returns an invalid QVariant object. diff --git a/doc/man/man3/tqaxscript.3qt b/doc/man/man3/tqaxscript.3qt index 42bcfe4fd..0117f6bda 100644 --- a/doc/man/man3/tqaxscript.3qt +++ b/doc/man/man3/tqaxscript.3qt @@ -45,7 +45,7 @@ Inherits TQObject. .BI "QVariant \fBcall\fR ( const TQString & function, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" .br .ti -1c -.BI "QVariant \fBcall\fR ( const TQString & function, QValueList<QVariant> & arguments )" +.BI "QVariant \fBcall\fR ( const TQString & function, TQValueList<QVariant> & arguments )" .br .in -1c .SS "Signals" @@ -97,7 +97,7 @@ Destroys the object, releasing all allocated resources. Calls \fIfunction\fR, passing the parameters \fIvar1\fR, \fIvar1\fR, \fIvar2\fR, \fIvar3\fR, \fIvar4\fR, \fIvar5\fR, \fIvar6\fR, \fIvar7\fR and \fIvar8\fR as arguments and returns the value returned by the function, or an invalid QVariant if the function does not return a value or when the function call failed. .PP See QAxScriptManager::call() for more information about how to call script functions. -.SH "QVariant QAxScript::call ( const TQString & function, QValueList<QVariant> & arguments )" +.SH "QVariant QAxScript::call ( const TQString & function, TQValueList<QVariant> & arguments )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Calls \fIfunction\fR passing \fIarguments\fR as parameters, and returns the result. Returns when the script's execution has finished. diff --git a/doc/man/man3/tqaxscriptmanager.3qt b/doc/man/man3/tqaxscriptmanager.3qt index d789b0568..432b5a8e5 100644 --- a/doc/man/man3/tqaxscriptmanager.3qt +++ b/doc/man/man3/tqaxscriptmanager.3qt @@ -48,7 +48,7 @@ Inherits TQObject. .BI "QVariant \fBcall\fR ( const TQString & function, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" .br .ti -1c -.BI "QVariant \fBcall\fR ( const TQString & function, QValueList<QVariant> & arguments )" +.BI "QVariant \fBcall\fR ( const TQString & function, TQValueList<QVariant> & arguments )" .br .in -1c .SS "Signals" @@ -111,7 +111,7 @@ use .PP .nf .br - QValueList args; + TQValueList args; .br args << 5; .br @@ -130,7 +130,7 @@ However, this is slower. Functions provided by script engines that don't support introspection are not available and must be called directly using QAxScript::call() on the respective script object. .PP Note that calling this function can be significantely slower than using call() on the respective QAxScript directly. -.SH "QVariant QAxScriptManager::call ( const TQString & function, QValueList<QVariant> & arguments )" +.SH "QVariant QAxScriptManager::call ( const TQString & function, TQValueList<QVariant> & arguments )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Calls \fIfunction\fR passing \fIarguments\fR as parameters, and returns the result. Returns when the script's execution has finished. diff --git a/doc/man/man3/tqaxwidget.3qt b/doc/man/man3/tqaxwidget.3qt index 4bc933518..448584e3a 100644 --- a/doc/man/man3/tqaxwidget.3qt +++ b/doc/man/man3/tqaxwidget.3qt @@ -36,7 +36,7 @@ Inherits TQWidget and QAxBase. .BI "QVariant \fBdynamicCall\fR ( const QCString & function, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" .br .ti -1c -.BI "QVariant \fBdynamicCall\fR ( const QCString & function, QValueList<QVariant> & vars )" +.BI "QVariant \fBdynamicCall\fR ( const QCString & function, TQValueList<QVariant> & vars )" .br .ti -1c .BI "QAxObject * \fBquerySubObject\fR ( const QCString & name, const QVariant & var1 = QVariant ( ), const QVariant & var2 = QVariant ( ), const QVariant & var3 = QVariant ( ), const QVariant & var4 = QVariant ( ), const QVariant & var5 = QVariant ( ), const QVariant & var6 = QVariant ( ), const QVariant & var7 = QVariant ( ), const QVariant & var8 = QVariant ( ) )" @@ -131,7 +131,7 @@ It is only possible to call functions through dynamicCall() that have parameters This is also more efficient. .PP Example: qutlook/centralwidget.cpp. -.SH "QVariant QAxBase::dynamicCall ( const QCString & function, QValueList<QVariant> & vars )" +.SH "QVariant QAxBase::dynamicCall ( const QCString & function, TQValueList<QVariant> & vars )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Calls the COM object's method \fIfunction\fR, passing the parameters in \fIvars\fR, and returns the value returned by the method. If the method does not return a value or when the function call failed this function returns an invalid QVariant object. diff --git a/doc/man/man3/tqcanvasitemlist.3qt b/doc/man/man3/tqcanvasitemlist.3qt index 258d9fd29..f3be5b4dc 100644 --- a/doc/man/man3/tqcanvasitemlist.3qt +++ b/doc/man/man3/tqcanvasitemlist.3qt @@ -11,7 +11,7 @@ TQCanvasItemList \- List of TQCanvasItems .SH SYNOPSIS \fC#include <tqcanvas.h>\fR .PP -Inherits QValueList<TQCanvasItem * >. +Inherits TQValueList<TQCanvasItem * >. .PP .SS "Public Members" .in +1c @@ -22,9 +22,9 @@ Inherits QValueList<TQCanvasItem * >. .SH DESCRIPTION The TQCanvasItemList class is a list of TQCanvasItems. .PP -TQCanvasItemList is a QValueList of pointers to TQCanvasItems. This class is used by some methods in TQCanvas that need to return a list of canvas items. +TQCanvasItemList is a TQValueList of pointers to TQCanvasItems. This class is used by some methods in TQCanvas that need to return a list of canvas items. .PP -The QValueList documentation describes how to use this list. +The TQValueList documentation describes how to use this list. .PP See also Graphics Classes and Image Processing Classes. .SH MEMBER FUNCTION DOCUMENTATION diff --git a/doc/man/man3/tqcanvaspixmaparray.3qt b/doc/man/man3/tqcanvaspixmaparray.3qt index 296c66c73..5c3369c40 100644 --- a/doc/man/man3/tqcanvaspixmaparray.3qt +++ b/doc/man/man3/tqcanvaspixmaparray.3qt @@ -23,7 +23,7 @@ TQCanvasPixmapArray \- Array of TQCanvasPixmaps .BI "TQCanvasPixmapArray ( QPtrList<QPixmap> list, QPtrList<QPoint> hotspots ) \fI(obsolete)\fR" .br .ti -1c -.BI "\fBTQCanvasPixmapArray\fR ( QValueList<QPixmap> list, QPointArray hotspots = QPointArray ( ) )" +.BI "\fBTQCanvasPixmapArray\fR ( TQValueList<QPixmap> list, QPointArray hotspots = QPointArray ( ) )" .br .ti -1c .BI "\fB~TQCanvasPixmapArray\fR ()" @@ -78,10 +78,10 @@ If \fIdatafilenamepattern\fR does not exist, is not readable, isn't an image, or .SH "TQCanvasPixmapArray::TQCanvasPixmapArray ( QPtrList<QPixmap> list, QPtrList<QPoint> hotspots )" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .PP -Use TQCanvasPixmapArray::TQCanvasPixmapArray( QValueList<QPixmap>, QPointArray ) instead. +Use TQCanvasPixmapArray::TQCanvasPixmapArray( TQValueList<QPixmap>, QPointArray ) instead. .PP Constructs a TQCanvasPixmapArray from the list of QPixmaps \fIlist\fR. The \fIhotspots\fR list has to be of the same size as \fIlist\fR. -.SH "TQCanvasPixmapArray::TQCanvasPixmapArray ( QValueList<QPixmap> list, QPointArray hotspots = QPointArray ( ) )" +.SH "TQCanvasPixmapArray::TQCanvasPixmapArray ( TQValueList<QPixmap> list, QPointArray hotspots = QPointArray ( ) )" Constructs a TQCanvasPixmapArray from the list of QPixmaps in the \fIlist\fR. Each pixmap will get a hotspot according to the \fIhotspots\fR array. If no hotspots are specified, each one is set to be at position (0, 0). .PP If an error occurs, isValid() will return FALSE. diff --git a/doc/man/man3/tqdeepcopy.3qt b/doc/man/man3/tqdeepcopy.3qt index 6275ab594..d586efdcb 100644 --- a/doc/man/man3/tqdeepcopy.3qt +++ b/doc/man/man3/tqdeepcopy.3qt @@ -145,13 +145,13 @@ Currently, QDeepCopy works with the following classes: .TP QMemArray (including subclasses like QByteArray and QCString) .TP -QMap +TQMap .TP TQString .TP -QValueList (including subclasses like QStringList and QValueStack) +TQValueList (including subclasses like QStringList and TQValueStack) .TP -QValueVector +TQValueVector .PP See also Thread Support in Qt, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. .SH MEMBER FUNCTION DOCUMENTATION diff --git a/doc/man/man3/tqdict.3qt b/doc/man/man3/tqdict.3qt index 81aed0021..e5e051efc 100644 --- a/doc/man/man3/tqdict.3qt +++ b/doc/man/man3/tqdict.3qt @@ -85,13 +85,13 @@ Inherits QPtrCollection. .SH DESCRIPTION The QDict class is a template class that provides a dictionary based on TQString keys. .PP -QMap is an STL-compatible alternative to this class. +TQMap is an STL-compatible alternative to this class. .PP QDict is implemented as a template class. Define a template instance QDict<X> to create a dictionary that operates on pointers to X (X *). .PP A dictionary is a collection of key-value pairs. The key is a TQString used for insertion, removal and lookup. The value is a pointer. Dictionaries provide very fast insertion and lookup. .PP -If you want to use non-Unicode, plain 8-bit \fCchar*\fR keys, use the QAsciiDict template. A QDict has the same performance as a QAsciiDict. If you want to have a dictionary that maps QStrings to QStrings use QMap. +If you want to use non-Unicode, plain 8-bit \fCchar*\fR keys, use the QAsciiDict template. A QDict has the same performance as a QAsciiDict. If you want to have a dictionary that maps QStrings to QStrings use TQMap. .PP The size() of the dictionary is very important. In order to get good performance, you should use a suitably large prime number. Suitable means equal to or larger than the maximum expected number of dictionary items. Size is set in the constructor but may be changed with resize(). .PP diff --git a/doc/man/man3/tqdns.3qt b/doc/man/man3/tqdns.3qt index 8aae9e479..38b3e062c 100644 --- a/doc/man/man3/tqdns.3qt +++ b/doc/man/man3/tqdns.3qt @@ -49,13 +49,13 @@ Inherits TQObject. .BI "bool \fBisWorking\fR () const" .br .ti -1c -.BI "QValueList<QHostAddress> \fBaddresses\fR () const" +.BI "TQValueList<QHostAddress> \fBaddresses\fR () const" .br .ti -1c -.BI "QValueList<MailServer> \fBmailServers\fR () const" +.BI "TQValueList<MailServer> \fBmailServers\fR () const" .br .ti -1c -.BI "QValueList<Server> \fBservers\fR () const" +.BI "TQValueList<Server> \fBservers\fR () const" .br .ti -1c .BI "QStringList \fBhostNames\fR () const" @@ -128,7 +128,7 @@ The DNS lookup is started the next time the application enters the event loop. W \fIrr\fR defaults to Ptr, that maps addresses to hostnames. .SH "QDns::~QDns ()\fC [virtual]\fR" Destroys the DNS query object and frees its allocated resources. -.SH "QValueList<QHostAddress> QDns::addresses () const" +.SH "TQValueList<QHostAddress> QDns::addresses () const" Returns a list of the addresses for this name if this QDns object has a recordType() of QDns::A or QDns::Aaaa and the answer is available; otherwise returns an empty list. .PP As a special case, if label() is a valid numeric IP address, this function returns that address. @@ -137,9 +137,9 @@ Note that if you want to iterate over the list, you should iterate over a copy, .PP .nf .br - QValueList<QHostAddress> list = myDns.addresses(); + TQValueList<QHostAddress> list = myDns.addresses(); .br - QValueList<QHostAddress>::Iterator it = list.begin(); + TQValueList<QHostAddress>::Iterator it = list.begin(); .br while( it != list.end() ) { .br @@ -186,7 +186,7 @@ Example: network/mail/smtp.cpp. Returns the domain name for which this object returns information. .PP See also setLabel(). -.SH "QValueList<MailServer> QDns::mailServers () const" +.SH "TQValueList<MailServer> QDns::mailServers () const" Returns a list of mail servers if the record type is Mx. The class \fCQDns::MailServer\fR contains the following public variables: .TP TQString QDns::MailServer::name @@ -197,9 +197,9 @@ Note that if you want to iterate over the list, you should iterate over a copy, .PP .nf .br - QValueList<QDns::MailServer> list = myDns.mailServers(); + TQValueList<QDns::MailServer> list = myDns.mailServers(); .br - QValueList<QDns::MailServer>::Iterator it = list.begin(); + TQValueList<QDns::MailServer>::Iterator it = list.begin(); .br while( it != list.end() ) { .br @@ -240,7 +240,7 @@ See also setRecordType() and RecordType. This signal is emitted when results are available for one of the qualifiedNames(). .PP Example: network/mail/smtp.cpp. -.SH "QValueList<Server> QDns::servers () const" +.SH "TQValueList<Server> QDns::servers () const" Returns a list of servers if the record type is Srv. The class \fCQDns::Server\fR contains the following public variables: .TP TQString QDns::Server::name @@ -255,9 +255,9 @@ Note that if you want to iterate over the list, you should iterate over a copy, .PP .nf .br - QValueList<QDns::Server> list = myDns.servers(); + TQValueList<QDns::Server> list = myDns.servers(); .br - QValueList<QDns::Server>::Iterator it = list.begin(); + TQValueList<QDns::Server>::Iterator it = list.begin(); .br while( it != list.end() ) { .br diff --git a/doc/man/man3/tqfiledialog.3qt b/doc/man/man3/tqfiledialog.3qt index a7d6c1107..2f6cb0dcd 100644 --- a/doc/man/man3/tqfiledialog.3qt +++ b/doc/man/man3/tqfiledialog.3qt @@ -973,7 +973,7 @@ Note that if you want to iterate over the list, you should iterate over a copy, .br .fi .PP -See also selectedFile, selectedFilter, and QValueList::empty(). +See also selectedFile, selectedFilter, and TQValueList::empty(). .PP Get this property's value with selectedFiles(). .SH "TQString selectedFilter" diff --git a/doc/man/man3/tqfont.3qt b/doc/man/man3/tqfont.3qt index da524875e..c0964e005 100644 --- a/doc/man/man3/tqfont.3qt +++ b/doc/man/man3/tqfont.3qt @@ -628,7 +628,7 @@ Example: chart/optionsform.cpp. .SH "TQString QFont::key () const" Returns the font's key, a textual representation of a font. It is typically used as the key for a cache or dictionary of fonts. .PP -See also QMap. +See also TQMap. .SH "TQString QFont::lastResortFamily () const" Returns the "last resort" font family name. .PP diff --git a/doc/man/man3/tqfontdatabase.3qt b/doc/man/man3/tqfontdatabase.3qt index f0996c801..10cb8b239 100644 --- a/doc/man/man3/tqfontdatabase.3qt +++ b/doc/man/man3/tqfontdatabase.3qt @@ -26,10 +26,10 @@ QFontDatabase \- Information about the fonts available in the underlying window .BI "QStringList \fBstyles\fR ( const TQString & family ) const" .br .ti -1c -.BI "QValueList<int> \fBpointSizes\fR ( const TQString & family, const TQString & style = TQString::null )" +.BI "TQValueList<int> \fBpointSizes\fR ( const TQString & family, const TQString & style = TQString::null )" .br .ti -1c -.BI "QValueList<int> \fBsmoothSizes\fR ( const TQString & family, const TQString & style )" +.BI "TQValueList<int> \fBsmoothSizes\fR ( const TQString & family, const TQString & style )" .br .ti -1c .BI "TQString \fBstyleString\fR ( const QFont & f )" @@ -65,10 +65,10 @@ QFontDatabase \- Information about the fonts available in the underlying window .BI "QStringList styles ( const TQString & family, const TQString & ) const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueList<int> pointSizes ( const TQString & family, const TQString & style, const TQString & ) \fI(obsolete)\fR" +.BI "TQValueList<int> pointSizes ( const TQString & family, const TQString & style, const TQString & ) \fI(obsolete)\fR" .br .ti -1c -.BI "QValueList<int> smoothSizes ( const TQString & family, const TQString & style, const TQString & ) \fI(obsolete)\fR" +.BI "TQValueList<int> smoothSizes ( const TQString & family, const TQString & style, const TQString & ) \fI(obsolete)\fR" .br .ti -1c .BI "QFont font ( const TQString & familyName, const TQString & style, int pointSize, const TQString & ) \fI(obsolete)\fR" @@ -98,7 +98,7 @@ QFontDatabase \- Information about the fonts available in the underlying window .SS "Static Public Members" .in +1c .ti -1c -.BI "QValueList<int> \fBstandardSizes\fR ()" +.BI "TQValueList<int> \fBstandardSizes\fR ()" .br .ti -1c .BI "TQString \fBscriptName\fR ( QFont::Script script )" @@ -157,9 +157,9 @@ int main( int argc, char **argv ) .br TQString dstyle = "\\t" + style + " ("; .br - QValueList<int> smoothies = fdb.smoothSizes( family, style ); + TQValueList<int> smoothies = fdb.smoothSizes( family, style ); .br - for ( QValueList<int>::Iterator points = smoothies.begin(); + for ( TQValueList<int>::Iterator points = smoothies.begin(); .br points != smoothies.end(); ++points ) { .br @@ -239,11 +239,11 @@ Returns TRUE if the font that has family \fIfamily\fR and style \fIstyle\fR is i See also weight() and bold(). .SH "bool QFontDatabase::italic ( const TQString & family, const TQString & style, const TQString & ) const" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. -.SH "QValueList<int> QFontDatabase::pointSizes ( const TQString & family, const TQString & style = TQString::null )" +.SH "TQValueList<int> QFontDatabase::pointSizes ( const TQString & family, const TQString & style = TQString::null )" Returns a list of the point sizes available for the font that has family \fIfamily\fR and style \fIstyle\fR. The list may be empty. .PP See also smoothSizes() and standardSizes(). -.SH "QValueList<int> QFontDatabase::pointSizes ( const TQString & family, const TQString & style, const TQString & )" +.SH "TQValueList<int> QFontDatabase::pointSizes ( const TQString & family, const TQString & style, const TQString & )" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. .SH "TQString QFontDatabase::scriptName ( QFont::Script script )\fC [static]\fR" Returns a string that gives a default description of the \fIscript\fR (e.g. for displaying to the user in a dialog). The name matches the name of the script as defined by the Unicode 3.0 standard. @@ -253,13 +253,13 @@ See also QFont::Script. Returns a string with sample characters from \fIscript\fR. .PP See also QFont::Script. -.SH "QValueList<int> QFontDatabase::smoothSizes ( const TQString & family, const TQString & style )" +.SH "TQValueList<int> QFontDatabase::smoothSizes ( const TQString & family, const TQString & style )" Returns the point sizes of a font that has family \fIfamily\fR and style \fIstyle\fR that will look attractive. The list may be empty. For non-scalable fonts and bitmap scalable fonts, this function is equivalent to pointSizes(). .PP See also pointSizes() and standardSizes(). -.SH "QValueList<int> QFontDatabase::smoothSizes ( const TQString & family, const TQString & style, const TQString & )" +.SH "TQValueList<int> QFontDatabase::smoothSizes ( const TQString & family, const TQString & style, const TQString & )" \fBThis function is obsolete.\fR It is provided to keep old source working. We strongly advise against using it in new code. -.SH "QValueList<int> QFontDatabase::standardSizes ()\fC [static]\fR" +.SH "TQValueList<int> QFontDatabase::standardSizes ()\fC [static]\fR" Returns a list of standard font sizes. .PP See also smoothSizes() and pointSizes(). diff --git a/doc/man/man3/tqiconview.3qt b/doc/man/man3/tqiconview.3qt index acde42dc0..ccd7a4284 100644 --- a/doc/man/man3/tqiconview.3qt +++ b/doc/man/man3/tqiconview.3qt @@ -247,7 +247,7 @@ Inherits QScrollView. .BI "void \fBcontextMenuRequested\fR ( QIconViewItem * item, const QPoint & pos )" .br .ti -1c -.BI "void \fBdropped\fR ( QDropEvent * e, const QValueList<QIconDragItem> & lst )" +.BI "void \fBdropped\fR ( QDropEvent * e, const TQValueList<QIconDragItem> & lst )" .br .ti -1c .BI "void \fBmoved\fR ()" @@ -431,7 +431,7 @@ The simple approach to dragging items out of the icon view is to subclass QIconV .PP In this example we create a QTextDrag object, (derived from QDragObject), containing the item's label and return it as the drag object. We could just as easily have created a QImageDrag from the item's pixmap and returned that instead. .PP -QIconViews and their QIconViewItems can also be the targets of drag and drops. To make the QIconView itself able to accept drops connect to the dropped() signal. When a drop occurs this signal will be emitted with a QDragEvent and a QValueList of QIconDragItems. To make a QIconViewItem into a drop target subclass QIconViewItem and reimplement QIconViewItem::acceptDrop() and QIconViewItem::dropped(). +QIconViews and their QIconViewItems can also be the targets of drag and drops. To make the QIconView itself able to accept drops connect to the dropped() signal. When a drop occurs this signal will be emitted with a QDragEvent and a TQValueList of QIconDragItems. To make a QIconViewItem into a drop target subclass QIconViewItem and reimplement QIconViewItem::acceptDrop() and QIconViewItem::dropped(). .PP .nf .br @@ -448,7 +448,7 @@ QIconViews and their QIconViewItems can also be the targets of drag and drops. T } .br .br - void MyIconViewItem::dropped( QDropEvent *evt, const QValueList<QIconDragItem>& ) + void MyIconViewItem::dropped( QDropEvent *evt, const TQValueList<QIconDragItem>& ) .br { .br @@ -468,7 +468,7 @@ If you want to use extended drag-and-drop or have drag shapes drawn you must tak .PP The first part is starting drags -- you should use a QIconDrag (or a class derived from it) for the drag object. In dragObject() create the drag object, populate it with QIconDragItems and return it. Normally such a drag should offer each selected item's data. So in dragObject() you should iterate over all the items, and create a QIconDragItem for each selected item, and append these items with QIconDrag::append() to the QIconDrag object. You can use QIconDragItem::setData() to set the data of each item that should be dragged. If you want to offer the data in additional mime-types, it's best to use a class derived from QIconDrag, which implements additional encoding and decoding functions. .PP -When a drag enters the icon view, there is little to do. Simply connect to the dropped() signal and reimplement QIconViewItem::acceptDrop() and QIconViewItem::dropped(). If you've used a QIconDrag (or a subclass of it) the second argument to the dropped signal contains a QValueList of QIconDragItems -- you can access their data by calling QIconDragItem::data() on each one. +When a drag enters the icon view, there is little to do. Simply connect to the dropped() signal and reimplement QIconViewItem::acceptDrop() and QIconViewItem::dropped(). If you've used a QIconDrag (or a subclass of it) the second argument to the dropped signal contains a TQValueList of QIconDragItems -- you can access their data by calling QIconDragItem::data() on each one. .PP For an example implementation of complex drag-and-drop look at the fileiconview example (qt/examples/fileiconview). .PP @@ -588,7 +588,7 @@ The default implementation fills \fIr\fR with the viewport's backgroundBrush(). See also contentsX, contentsY, and drawContents(). .SH "void QIconView::drawRubber ( QPainter * p )\fC [virtual protected]\fR" Draws the rubber band using the painter \fIp\fR. -.SH "void QIconView::dropped ( QDropEvent * e, const QValueList<QIconDragItem> & lst )\fC [signal]\fR" +.SH "void QIconView::dropped ( QDropEvent * e, const TQValueList<QIconDragItem> & lst )\fC [signal]\fR" This signal is emitted when a drop event occurs in the viewport (but not on any icon) which the icon view itself can't handle. .PP \fIe\fR provides all the information about the drop. If the drag object of the drop was a QIconDrag, \fIlst\fR contains the list of the dropped items. You can get the data using QIconDragItem::data() on each item. If the \fIlst\fR is empty, i.e. the drag was not a QIconDrag, you have to decode the data in \fIe\fR and work with that. diff --git a/doc/man/man3/tqiconviewitem.3qt b/doc/man/man3/tqiconviewitem.3qt index 870f53bbd..d965c7947 100644 --- a/doc/man/man3/tqiconviewitem.3qt +++ b/doc/man/man3/tqiconviewitem.3qt @@ -193,7 +193,7 @@ Inherits Qt. .BI "virtual void \fBpaintFocus\fR ( QPainter * p, const QColorGroup & cg )" .br .ti -1c -.BI "virtual void \fBdropped\fR ( QDropEvent * e, const QValueList<QIconDragItem> & lst )" +.BI "virtual void \fBdropped\fR ( QDropEvent * e, const TQValueList<QIconDragItem> & lst )" .br .ti -1c .BI "virtual void \fBdragEntered\fR ()" @@ -333,7 +333,7 @@ Example: fileiconview/qfileiconview.cpp. Returns TRUE if the user is allowed to drop something onto the item; otherwise returns FALSE. .PP See also setDropEnabled(). -.SH "void QIconViewItem::dropped ( QDropEvent * e, const QValueList<QIconDragItem> & lst )\fC [virtual protected]\fR" +.SH "void QIconViewItem::dropped ( QDropEvent * e, const TQValueList<QIconDragItem> & lst )\fC [virtual protected]\fR" This function is called when something is dropped on the item. \fIe\fR provides all the information about the drop. If the drag object of the drop was a QIconDrag, \fIlst\fR contains the list of the dropped items. You can get the data by calling QIconDragItem::data() on each item. If the \fIlst\fR is empty, i.e. the drag was not a QIconDrag, you must decode the data in \fIe\fR and work with that. .PP The default implementation does nothing; subclasses may reimplement this function. diff --git a/doc/man/man3/tqimage.3qt b/doc/man/man3/tqimage.3qt index d7b37bc0e..7fafb7464 100644 --- a/doc/man/man3/tqimage.3qt +++ b/doc/man/man3/tqimage.3qt @@ -245,7 +245,7 @@ TQImage \- Hardware-independent pixmap representation with direct access to the .BI "void \fBsetOffset\fR ( const QPoint & p )" .br .ti -1c -.BI "QValueList<QImageTextKeyLang> \fBtextList\fR () const" +.BI "TQValueList<QImageTextKeyLang> \fBtextList\fR () const" .br .ti -1c .BI "QStringList \fBtextLanguages\fR () const" @@ -1007,16 +1007,16 @@ Note that if you want to iterate over the list, you should iterate over a copy, .fi .PP See also textList(), text(), setText(), and textKeys(). -.SH "QValueList<QImageTextKeyLang> TQImage::textList () const" +.SH "TQValueList<QImageTextKeyLang> TQImage::textList () const" Returns a list of QImageTextKeyLang objects that enumerate all the texts key/language pairs set by setText() for this image. .PP Note that if you want to iterate over the list, you should iterate over a copy, e.g. .PP .nf .br - QValueList<QImageTextKeyLang> list = myImage.textList(); + TQValueList<QImageTextKeyLang> list = myImage.textList(); .br - QValueList<QImageTextKeyLang>::Iterator it = list.begin(); + TQValueList<QImageTextKeyLang>::Iterator it = list.begin(); .br while( it != list.end() ) { .br diff --git a/doc/man/man3/tqintdict.3qt b/doc/man/man3/tqintdict.3qt index 1ee5298ba..2b91b9839 100644 --- a/doc/man/man3/tqintdict.3qt +++ b/doc/man/man3/tqintdict.3qt @@ -85,7 +85,7 @@ Inherits QPtrCollection. .SH DESCRIPTION The QIntDict class is a template class that provides a dictionary based on long keys. .PP -QMap is an STL-compatible alternative to this class. +TQMap is an STL-compatible alternative to this class. .PP QIntDict is implemented as a template class. Define a template instance QIntDict<X> to create a dictionary that operates on pointers to X (X*). .PP diff --git a/doc/man/man3/tqmacmime.3qt b/doc/man/man3/tqmacmime.3qt index 6c1710b64..4166efc3c 100644 --- a/doc/man/man3/tqmacmime.3qt +++ b/doc/man/man3/tqmacmime.3qt @@ -38,10 +38,10 @@ QMacMime \- Maps open-standard MIME to Mac flavors .BI "virtual int \fBflavorFor\fR ( const char * mime ) = 0" .br .ti -1c -.BI "virtual QByteArray \fBconvertToMime\fR ( QValueList<QByteArray> data, const char * mime, int flav ) = 0" +.BI "virtual QByteArray \fBconvertToMime\fR ( TQValueList<QByteArray> data, const char * mime, int flav ) = 0" .br .ti -1c -.BI "virtual QValueList<QByteArray> \fBconvertFromMime\fR ( QByteArray data, const char * mime, int flav ) = 0" +.BI "virtual TQValueList<QByteArray> \fBconvertFromMime\fR ( QByteArray data, const char * mime, int flav ) = 0" .br .in -1c .SS "Static Public Members" @@ -87,13 +87,13 @@ Returns a list of all currently defined QMacMime objects of type \fIt\fR. Returns TRUE if the convertor can convert (both ways) between \fImime\fR and \fIflav\fR; otherwise returns FALSE. .PP All subclasses must reimplement this pure virtual function. -.SH "QValueList<QByteArray> QMacMime::convertFromMime ( QByteArray data, const char * mime, int flav )\fC [pure virtual]\fR" +.SH "TQValueList<QByteArray> QMacMime::convertFromMime ( QByteArray data, const char * mime, int flav )\fC [pure virtual]\fR" Returns \fIdata\fR converted from MIME type \fImime\fR to Mac flavor \fIflav\fR. .PP Note that Mac flavors must all be self-terminating. The return value may contain trailing data. .PP All subclasses must reimplement this pure virtual function. -.SH "QByteArray QMacMime::convertToMime ( QValueList<QByteArray> data, const char * mime, int flav )\fC [pure virtual]\fR" +.SH "QByteArray QMacMime::convertToMime ( TQValueList<QByteArray> data, const char * mime, int flav )\fC [pure virtual]\fR" Returns \fIdata\fR converted from Mac flavor \fIflav\fR to MIME type \fImime\fR. .PP Note that Mac flavors must all be self-terminating. The input \fIdata\fR may contain trailing data. diff --git a/doc/man/man3/tqmap.3qt b/doc/man/man3/tqmap.3qt index e7d208fd0..04b53cb7a 100644 --- a/doc/man/man3/tqmap.3qt +++ b/doc/man/man3/tqmap.3qt @@ -1,5 +1,5 @@ '\" t -.TH QMap 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQMap 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,9 +7,9 @@ .ad l .nh .SH NAME -QMap \- Value-based template class that provides a dictionary +TQMap \- Value-based template class that provides a dictionary .SH SYNOPSIS -\fC#include <ntqmap.h>\fR +\fC#include <tqmap.h>\fR .PP .SS "Public Members" .in +1c @@ -38,40 +38,40 @@ QMap \- Value-based template class that provides a dictionary .BI "typedef size_t \fBsize_type\fR" .br .ti -1c -.BI "typedef QMapIterator<Key, T> \fBiterator\fR" +.BI "typedef TQMapIterator<Key, T> \fBiterator\fR" .br .ti -1c -.BI "typedef QMapConstIterator<Key, T> \fBconst_iterator\fR" +.BI "typedef TQMapConstIterator<Key, T> \fBconst_iterator\fR" .br .ti -1c .BI "typedef TQPair<iterator, bool> \fBinsert_pair\fR" .br .ti -1c -.BI "typedef QMapIterator<Key, T> \fBIterator\fR" +.BI "typedef TQMapIterator<Key, T> \fBIterator\fR" .br .ti -1c -.BI "typedef QMapConstIterator<Key, T> \fBConstIterator\fR" +.BI "typedef TQMapConstIterator<Key, T> \fBConstIterator\fR" .br .ti -1c .BI "typedef T \fBValueType\fR" .br .ti -1c -.BI "\fBQMap\fR ()" +.BI "\fBTQMap\fR ()" .br .ti -1c -.BI "\fBQMap\fR ( const QMap<Key, T> & m )" +.BI "\fBTQMap\fR ( const TQMap<Key, T> & m )" .br .ti -1c -.BI "\fBQMap\fR ( const std::map<Key, T> & m )" +.BI "\fBTQMap\fR ( const std::map<Key, T> & m )" .br .ti -1c -.BI "\fB~QMap\fR ()" +.BI "\fB~TQMap\fR ()" .br .ti -1c -.BI "QMap<Key, T> & \fBoperator=\fR ( const QMap<Key, T> & m )" +.BI "TQMap<Key, T> & \fBoperator=\fR ( const TQMap<Key, T> & m )" .br .ti -1c -.BI "QMap<Key, T> & \fBoperator=\fR ( const std::map<Key, T> & m )" +.BI "TQMap<Key, T> & \fBoperator=\fR ( const std::map<Key, T> & m )" .br .ti -1c .BI "iterator \fBbegin\fR ()" @@ -134,10 +134,10 @@ QMap \- Value-based template class that provides a dictionary .BI "size_type \fBcount\fR () const" .br .ti -1c -.BI "QValueList<Key> \fBkeys\fR () const" +.BI "TQValueList<Key> \fBkeys\fR () const" .br .ti -1c -.BI "QValueList<T> \fBvalues\fR () const" +.BI "TQValueList<T> \fBvalues\fR () const" .br .ti -1c .BI "bool \fBisEmpty\fR () const" @@ -161,22 +161,22 @@ QMap \- Value-based template class that provides a dictionary .SH RELATED FUNCTION DOCUMENTATION .in +1c .ti -1c -.BI "QDataStream & \fBoperator>>\fR ( QDataStream & s, QMap<Key, T> & m )" +.BI "QDataStream & \fBoperator>>\fR ( QDataStream & s, TQMap<Key, T> & m )" .br .ti -1c -.BI "QDataStream & \fBoperator<<\fR ( QDataStream & s, const QMap<Key, T> & m )" +.BI "QDataStream & \fBoperator<<\fR ( QDataStream & s, const TQMap<Key, T> & m )" .br .in -1c .SH DESCRIPTION -The QMap class is a value-based template class that provides a dictionary. +The TQMap class is a value-based template class that provides a dictionary. .PP -QMap is a TQt implementation of an STL-like map container. It can be used in your application if the standard \fCmap\fR is not available on all your target platforms. QMap is part of the TQt Template Library. +TQMap is a TQt implementation of an STL-like map container. It can be used in your application if the standard \fCmap\fR is not available on all your target platforms. TQMap is part of the TQt Template Library. .PP -QMap<Key, Data> defines a template instance to create a dictionary with keys of type Key and values of type Data. QMap does not store pointers to the members of the map; instead, it holds a copy of every member. For this reason, QMap is value-based, whereas QPtrList and QDict are pointer-based. +TQMap<Key, Data> defines a template instance to create a dictionary with keys of type Key and values of type Data. TQMap does not store pointers to the members of the map; instead, it holds a copy of every member. For this reason, TQMap is value-based, whereas QPtrList and QDict are pointer-based. .PP -QMap contains and manages a collection of objects of type Data with associated key values of type Key and provides iterators that allow the contained objects to be addressed. QMap owns the contained items. +TQMap contains and manages a collection of objects of type Data with associated key values of type Key and provides iterators that allow the contained objects to be addressed. TQMap owns the contained items. .PP -Some classes cannot be used within a QMap. For example everything derived from TQObject and thus all classes that implement widgets. Only values can be used in a QMap. To qualify as a value, the class must provide +Some classes cannot be used within a TQMap. For example everything derived from TQObject and thus all classes that implement widgets. Only values can be used in a TQMap. To qualify as a value, the class must provide .TP A copy constructor .TP @@ -188,7 +188,7 @@ Note that C++ defaults to field-by-field assignment operators and copy construct .PP The class used for the key requires that the \fCoperator<\fR is implemented to define ordering of the keys. .PP -QMap's function naming is consistent with the other TQt classes (e.g., count(), isEmpty()). QMap also provides extra functions for compatibility with STL algorithms, such as size() and empty(). Programmers already familiar with the STL \fCmap\fR can use these the STL-like functions if preferred. +TQMap's function naming is consistent with the other TQt classes (e.g., count(), isEmpty()). TQMap also provides extra functions for compatibility with STL algorithms, such as size() and empty(). Programmers already familiar with the STL \fCmap\fR can use these the STL-like functions if preferred. .PP Example: .PP @@ -196,7 +196,7 @@ Example: .br #include <ntqstring.h> .br - #include <ntqmap.h> + #include <tqmap.h> .br #include <ntqstring.h> .br @@ -243,7 +243,7 @@ Example: QApplication app( argc, argv ); .br .br - typedef QMap<TQString, Employee> EmployeeMap; + typedef TQMap<TQString, Employee> EmployeeMap; .br EmployeeMap map; .br @@ -308,7 +308,7 @@ Another approach uses the operator[]. But be warned: if the map does not contain .PP .nf .br - QMap<TQString,TQString> map; + TQMap<TQString,TQString> map; .br map["Clinton"] = "Bill"; .br @@ -322,15 +322,15 @@ If you just want to know whether a certain key is contained in the map, use the .PP It is safe to have multiple iterators at the same time. If some member of the map is removed, only iterators pointing to the removed member become invalid; inserting in the map does not invalidate any iterators. .PP -Since QMap is value-based, there is no need to be concerned about deleting items in the map. The map holds its own copies and will free them if the corresponding member or the map itself is deleted. +Since TQMap is value-based, there is no need to be concerned about deleting items in the map. The map holds its own copies and will free them if the corresponding member or the map itself is deleted. .PP -QMap is implicitly shared. This means you can just make copies of the map in time O(1). If multiple QMap instances share the same data and one is modifying the map's data, this modifying instance makes a copy and modifies its private copy: so it does not affect other instances. If a QMap is being used in a multi-threaded program, you must protect all access to the map. See QMutex. +TQMap is implicitly shared. This means you can just make copies of the map in time O(1). If multiple TQMap instances share the same data and one is modifying the map's data, this modifying instance makes a copy and modifies its private copy: so it does not affect other instances. If a TQMap is being used in a multi-threaded program, you must protect all access to the map. See QMutex. .PP There are a couple of ways of inserting new items into the map. One uses the insert() method; the other uses operator[]: .PP .nf .br - QMap<TQString, TQString> map; + TQMap<TQString, TQString> map; .br map["Clinton"] = "Bill"; .br @@ -340,196 +340,196 @@ There are a couple of ways of inserting new items into the map. One uses the ins .PP Items can also be removed from the map in several ways. One way is to pass an iterator to remove(). Another way is to pass a key value to remove(), which will delete the entry with the requested key. In addition you can clear the entire map using the clear() method. .PP -See also QMapIterator, TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. +See also TQMapIterator, TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QMap::ConstIterator" +.SH "TQMap::ConstIterator" The map's const iterator type, TQt style. -.SH "QMap::Iterator" +.SH "TQMap::Iterator" The map's iterator type, TQt style. -.SH "QMap::ValueType" +.SH "TQMap::ValueType" Corresponds to TQPair<key_type, mapped_type>, TQt style. -.SH "QMap::const_iterator" +.SH "TQMap::const_iterator" The map's const iterator type. -.SH "QMap::const_pointer" +.SH "TQMap::const_pointer" Const pointer to value_type. -.SH "QMap::const_reference" +.SH "TQMap::const_reference" Const reference to value_type. -.SH "QMap::iterator" +.SH "TQMap::iterator" The map's iterator type. -.SH "QMap::key_type" +.SH "TQMap::key_type" The map's key type. -.SH "QMap::mapped_type" +.SH "TQMap::mapped_type" The map's data type. -.SH "QMap::pointer" +.SH "TQMap::pointer" Pointer to value_type. -.SH "QMap::reference" +.SH "TQMap::reference" Reference to value_type. -.SH "QMap::size_type" +.SH "TQMap::size_type" An unsigned integral type, used to represent various sizes. -.SH "QMap::value_type" +.SH "TQMap::value_type" Corresponds to TQPair<key_type, mapped_type>. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QMap::QMap ()" +.SH "TQMap::TQMap ()" Constructs an empty map. -.SH "QMap::QMap ( const QMap<Key, T> & m )" +.SH "TQMap::TQMap ( const TQMap<Key, T> & m )" Constructs a copy of \fIm\fR. .PP -This operation costs O(1) time because QMap is implicitly shared. This makes returning a QMap from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and this takes O(n) time. -.SH "QMap::QMap ( const std::map<Key, T> & m )" +This operation costs O(1) time because TQMap is implicitly shared. This makes returning a TQMap from a function very fast. If a shared instance is modified, it will be copied (copy-on-write), and this takes O(n) time. +.SH "TQMap::TQMap ( const std::map<Key, T> & m )" Constructs a copy of \fIm\fR. -.SH "QMap::~QMap ()" -Destroys the map. References to the values in the map and all iterators of this map become invalidated. Since QMap is highly tuned for performance you won't see warnings if you use invalid iterators, because it is not possible for an iterator to check whether it is valid or not. -.SH "iterator QMap::begin ()" +.SH "TQMap::~TQMap ()" +Destroys the map. References to the values in the map and all iterators of this map become invalidated. Since TQMap is highly tuned for performance you won't see warnings if you use invalid iterators, because it is not possible for an iterator to check whether it is valid or not. +.SH "iterator TQMap::begin ()" Returns an iterator pointing to the first element in the map. This iterator equals end() if the map is empty. .PP The items in the map are traversed in the order defined by operator<(Key, Key). .PP -See also end() and QMapIterator. -.SH "const_iterator QMap::begin () const" +See also end() and TQMapIterator. +.SH "const_iterator TQMap::begin () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP -See also end() and QMapConstIterator. -.SH "void QMap::clear ()" +See also end() and TQMapConstIterator. +.SH "void TQMap::clear ()" Removes all items from the map. .PP See also remove(). -.SH "const_iterator QMap::constBegin () const" +.SH "const_iterator TQMap::constBegin () const" Returns an iterator pointing to the first element in the map. This iterator equals end() if the map is empty. .PP The items in the map are traversed in the order defined by operator<(Key, Key). .PP -See also constEnd() and QMapConstIterator. -.SH "const_iterator QMap::constEnd () const" +See also constEnd() and TQMapConstIterator. +.SH "const_iterator TQMap::constEnd () const" The iterator returned by end() points to the element which is one past the last element in the container. The past-the-end iterator is still associated with the map it belongs to, but it is \fInot\fR dereferenceable; operator*() will not return a well-defined value. .PP This iterator equals constBegin() if the map is empty. .PP -See also constBegin() and QMapConstIterator. -.SH "bool QMap::contains ( const Key & k ) const" +See also constBegin() and TQMapConstIterator. +.SH "bool TQMap::contains ( const Key & k ) const" Returns TRUE if the map contains an item with key \fIk\fR; otherwise returns FALSE. -.SH "size_type QMap::count ( const key_type & k ) const" -Returns the number of items whose key is \fIk\fR. Since QMap does not allow duplicate keys, the return value is always 0 or 1. +.SH "size_type TQMap::count ( const key_type & k ) const" +Returns the number of items whose key is \fIk\fR. Since TQMap does not allow duplicate keys, the return value is always 0 or 1. .PP This function is provided for STL compatibility. -.SH "size_type QMap::count () const" +.SH "size_type TQMap::count () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns the number of items in the map. .PP See also isEmpty(). -.SH "void QMap::detach ()\fC [protected]\fR" -If the map does not share its data with another QMap instance, nothing happens; otherwise the function creates a new copy of this map and detaches from the shared one. This function is called whenever the map is modified. The implicit sharing mechanism is implemented this way. -.SH "bool QMap::empty () const" +.SH "void TQMap::detach ()\fC [protected]\fR" +If the map does not share its data with another TQMap instance, nothing happens; otherwise the function creates a new copy of this map and detaches from the shared one. This function is called whenever the map is modified. The implicit sharing mechanism is implemented this way. +.SH "bool TQMap::empty () const" Returns TRUE if the map contains no items; otherwise returns FALSE. .PP This function is provided for STL compatibility. It is equivalent to isEmpty(). .PP See also size(). -.SH "iterator QMap::end ()" +.SH "iterator TQMap::end ()" The iterator returned by end() points to the element which is one past the last element in the container. The past-the-end iterator is still associated with the map it belongs to, but it is \fInot\fR dereferenceable; operator*() will not return a well-defined value. .PP This iterator equals begin() if the map is empty. .PP -See also begin() and QMapIterator. -.SH "const_iterator QMap::end () const" +See also begin() and TQMapIterator. +.SH "const_iterator TQMap::end () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "void QMap::erase ( iterator it )" +.SH "void TQMap::erase ( iterator it )" Removes the item associated with the iterator \fIit\fR from the map. .PP This function is provided for STL compatibility. It is equivalent to remove(). .PP See also clear(). -.SH "void QMap::erase ( const key_type & k )" +.SH "void TQMap::erase ( const key_type & k )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Removes the item with the key \fIk\fR from the map. -.SH "iterator QMap::find ( const Key & k )" +.SH "iterator TQMap::find ( const Key & k )" Returns an iterator pointing to the element with key \fIk\fR in the map. .PP Returns end() if no key matched. .PP -See also QMapIterator. -.SH "const_iterator QMap::find ( const Key & k ) const" +See also TQMapIterator. +.SH "const_iterator TQMap::find ( const Key & k ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator pointing to the element with key \fIk\fR in the map. .PP Returns end() if no key matched. .PP -See also QMapConstIterator. -.SH "iterator QMap::insert ( const Key & key, const T & value, bool overwrite = TRUE )" +See also TQMapConstIterator. +.SH "iterator TQMap::insert ( const Key & key, const T & value, bool overwrite = TRUE )" Inserts a new item with the key, \fIkey\fR, and a value of \fIvalue\fR. If there is already an item whose key is \fIkey\fR, that item's value is replaced with \fIvalue\fR, unless \fIoverwrite\fR is FALSE (it is TRUE by default). In this case an iterator to this item is returned, else an iterator to the new item is returned. -.SH "TQPair<iterator, bool> QMap::insert ( const value_type & x )" +.SH "TQPair<iterator, bool> TQMap::insert ( const value_type & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Inserts the (key, value) pair \fIx\fR into the map. \fIx\fR is a TQPair whose \fCfirst\fR element is a key to be inserted and whose \fCsecond\fR element is the associated value to be inserted. Returns a pair whose \fCfirst\fR element is an iterator pointing to the inserted item and whose \fCsecond\fR element is a bool indicating TRUE if \fIx\fR was inserted and FALSE if it was not inserted, e.g. because it was already present. .PP See also replace(). -.SH "bool QMap::isEmpty () const" +.SH "bool TQMap::isEmpty () const" Returns TRUE if the map contains no items; otherwise returns FALSE. .PP See also count(). -.SH "QValueList<Key> QMap::keys () const" +.SH "TQValueList<Key> TQMap::keys () const" Returns a list of all the keys in the map, in order. -.SH "QMap<Key, T> & QMap::operator= ( const QMap<Key, T> & m )" +.SH "TQMap<Key, T> & TQMap::operator= ( const TQMap<Key, T> & m )" Assigns \fIm\fR to this map and returns a reference to this map. .PP -All iterators of the current map become invalidated by this operation. The cost of such an assignment is O(1), because QMap is implicitly shared. -.SH "QMap<Key, T> & QMap::operator= ( const std::map<Key, T> & m )" +All iterators of the current map become invalidated by this operation. The cost of such an assignment is O(1), because TQMap is implicitly shared. +.SH "TQMap<Key, T> & TQMap::operator= ( const std::map<Key, T> & m )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Assigns \fIm\fR to this map and returns a reference to this map. .PP All iterators of the current map become invalidated by this operation. -.SH "T & QMap::operator[] ( const Key & k )" +.SH "T & TQMap::operator[] ( const Key & k )" Returns the value associated with the key \fIk\fR. If no such key is present, an empty item is inserted with this key and a reference to the empty item is returned. .PP You can use this operator both for reading and writing: .PP .nf .br - QMap<TQString, TQString> map; + TQMap<TQString, TQString> map; .br map["Clinton"] = "Bill"; .br stream << map["Clinton"]; .br .fi -.SH "const T & QMap::operator[] ( const Key & k ) const" +.SH "const T & TQMap::operator[] ( const Key & k ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP \fBWarning:\fR This function differs from the non-const version of the same function. It will \fInot\fR insert an empty value if the key \fIk\fR does not exist. This may lead to logic errors in your program. You should check if the element exists before calling this function. .PP Returns the value associated with the key \fIk\fR. If no such key is present, a reference to an empty item is returned. -.SH "void QMap::remove ( iterator it )" +.SH "void TQMap::remove ( iterator it )" Removes the item associated with the iterator \fIit\fR from the map. .PP See also clear(). -.SH "void QMap::remove ( const Key & k )" +.SH "void TQMap::remove ( const Key & k )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Removes the item with the key \fIk\fR from the map. -.SH "iterator QMap::replace ( const Key & k, const T & v )" +.SH "iterator TQMap::replace ( const Key & k, const T & v )" Replaces the value of the element with key \fIk\fR, with the value \fIv\fR. .PP See also insert() and remove(). -.SH "size_type QMap::size () const" +.SH "size_type TQMap::size () const" Returns the number of items in the map. .PP This function is provided for STL compatibility. It is equivalent to count(). .PP See also empty(). -.SH "QValueList<T> QMap::values () const" +.SH "TQValueList<T> TQMap::values () const" Returns a list of all the values in the map, in key order. .SH RELATED FUNCTION DOCUMENTATION -.SH "QDataStream & operator<< ( QDataStream & s, const QMap<Key, T> & m )" +.SH "QDataStream & operator<< ( QDataStream & s, const TQMap<Key, T> & m )" Writes the map \fIm\fR to the stream \fIs\fR. The types \fIKey\fR and \fIT\fR must implement the streaming operator as well. -.SH "QDataStream & operator>> ( QDataStream & s, QMap<Key, T> & m )" +.SH "QDataStream & operator>> ( QDataStream & s, TQMap<Key, T> & m )" Reads the map \fIm\fR from the stream \fIs\fR. The types \fIKey\fR and \fIT\fR must implement the streaming operator as well. .SH "SEE ALSO" -.BR http://doc.trolltech.com/ntqmap.html +.BR http://doc.trolltech.com/tqmap.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqmapconstiterator.3qt b/doc/man/man3/tqmapconstiterator.3qt index 5d204c7cf..49596eba2 100644 --- a/doc/man/man3/tqmapconstiterator.3qt +++ b/doc/man/man3/tqmapconstiterator.3qt @@ -1,5 +1,5 @@ '\" t -.TH QMapConstIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQMapConstIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,9 +7,9 @@ .ad l .nh .SH NAME -QMapConstIterator \- Iterator for QMap +TQMapConstIterator \- Iterator for TQMap .SH SYNOPSIS -\fC#include <ntqmap.h>\fR +\fC#include <tqmap.h>\fR .PP .SS "Public Members" .in +1c @@ -26,22 +26,22 @@ QMapConstIterator \- Iterator for QMap .BI "typedef const T & \fBreference\fR" .br .ti -1c -.BI "\fBQMapConstIterator\fR ()" +.BI "\fBTQMapConstIterator\fR ()" .br .ti -1c -.BI "\fBQMapConstIterator\fR ( QMapNode<K, T> * p )" +.BI "\fBTQMapConstIterator\fR ( TQMapNode<K, T> * p )" .br .ti -1c -.BI "\fBQMapConstIterator\fR ( const QMapConstIterator<K, T> & it )" +.BI "\fBTQMapConstIterator\fR ( const TQMapConstIterator<K, T> & it )" .br .ti -1c -.BI "\fBQMapConstIterator\fR ( const QMapIterator<K, T> & it )" +.BI "\fBTQMapConstIterator\fR ( const TQMapIterator<K, T> & it )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QMapConstIterator<K, T> & it ) const" +.BI "bool \fBoperator==\fR ( const TQMapConstIterator<K, T> & it ) const" .br .ti -1c -.BI "bool \fBoperator!=\fR ( const QMapConstIterator<K, T> & it ) const" +.BI "bool \fBoperator!=\fR ( const TQMapConstIterator<K, T> & it ) const" .br .ti -1c .BI "const T & \fBoperator*\fR () const" @@ -53,70 +53,70 @@ QMapConstIterator \- Iterator for QMap .BI "const T & \fBdata\fR () const" .br .ti -1c -.BI "QMapConstIterator<K, T> & \fBoperator++\fR ()" +.BI "TQMapConstIterator<K, T> & \fBoperator++\fR ()" .br .ti -1c -.BI "QMapConstIterator<K, T> \fBoperator++\fR ( int )" +.BI "TQMapConstIterator<K, T> \fBoperator++\fR ( int )" .br .ti -1c -.BI "QMapConstIterator<K, T> & \fBoperator--\fR ()" +.BI "TQMapConstIterator<K, T> & \fBoperator--\fR ()" .br .ti -1c -.BI "QMapConstIterator<K, T> \fBoperator--\fR ( int )" +.BI "TQMapConstIterator<K, T> \fBoperator--\fR ( int )" .br .in -1c .SH DESCRIPTION -The QMapConstIterator class provides an iterator for QMap. +The TQMapConstIterator class provides an iterator for TQMap. .PP -In contrast to QMapIterator, this class is used to iterate over a const map. It does not allow you to modify the values of the map because this would break the const semantics. +In contrast to TQMapIterator, this class is used to iterate over a const map. It does not allow you to modify the values of the map because this would break the const semantics. .PP -For more information on QMap iterators, see QMapIterator and the QMap example. +For more information on TQMap iterators, see TQMapIterator and the TQMap example. .PP -See also QMap, QMapIterator, TQt Template Library Classes, and Non-GUI Classes. +See also TQMap, TQMapIterator, TQt Template Library Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QMapConstIterator::iterator_category" +.SH "TQMapConstIterator::iterator_category" The type of iterator category, \fCstd::bidirectional_iterator_tag\fR. -.SH "QMapConstIterator::pointer" +.SH "TQMapConstIterator::pointer" Const pointer to value_type. -.SH "QMapConstIterator::reference" +.SH "TQMapConstIterator::reference" Const reference to value_type. -.SH "QMapConstIterator::value_type" +.SH "TQMapConstIterator::value_type" The type of const value. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QMapConstIterator::QMapConstIterator ()" +.SH "TQMapConstIterator::TQMapConstIterator ()" Constructs an uninitialized iterator. -.SH "QMapConstIterator::QMapConstIterator ( QMapNode<K, T> * p )" +.SH "TQMapConstIterator::TQMapConstIterator ( TQMapNode<K, T> * p )" Constructs an iterator starting at node \fIp\fR. -.SH "QMapConstIterator::QMapConstIterator ( const QMapConstIterator<K, T> & it )" +.SH "TQMapConstIterator::TQMapConstIterator ( const TQMapConstIterator<K, T> & it )" Constructs a copy of the iterator, \fIit\fR. -.SH "QMapConstIterator::QMapConstIterator ( const QMapIterator<K, T> & it )" +.SH "TQMapConstIterator::TQMapConstIterator ( const TQMapIterator<K, T> & it )" Constructs a copy of the iterator, \fIit\fR. -.SH "const T & QMapConstIterator::data () const" +.SH "const T & TQMapConstIterator::data () const" Returns a const reference to the current item's data. -.SH "const K & QMapConstIterator::key () const" +.SH "const K & TQMapConstIterator::key () const" Returns a const reference to the current item's key. -.SH "bool QMapConstIterator::operator!= ( const QMapConstIterator<K, T> & it ) const" +.SH "bool TQMapConstIterator::operator!= ( const TQMapConstIterator<K, T> & it ) const" Compares the iterator to the \fIit\fR iterator and returns FALSE if they point to the same item; otherwise returns TRUE. -.SH "const T & QMapConstIterator::operator* () const" +.SH "const T & TQMapConstIterator::operator* () const" Dereference operator. Returns a const reference to the current item's data. The same as data(). -.SH "QMapConstIterator<K, T> & QMapConstIterator::operator++ ()" +.SH "TQMapConstIterator<K, T> & TQMapConstIterator::operator++ ()" Prefix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the map. Incrementing the iterator returned by end() causes undefined results. -.SH "QMapConstIterator<K, T> QMapConstIterator::operator++ ( int )" +.SH "TQMapConstIterator<K, T> TQMapConstIterator::operator++ ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the map. Incrementing the iterator returned by end() causes undefined results. -.SH "QMapConstIterator<K, T> & QMapConstIterator::operator-- ()" +.SH "TQMapConstIterator<K, T> & TQMapConstIterator::operator-- ()" Prefix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the map. Decrementing the iterator returned by begin() causes undefined results. -.SH "QMapConstIterator<K, T> QMapConstIterator::operator-- ( int )" +.SH "TQMapConstIterator<K, T> TQMapConstIterator::operator-- ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the map. Decrementing the iterator returned by begin() causes undefined results. -.SH "bool QMapConstIterator::operator== ( const QMapConstIterator<K, T> & it ) const" +.SH "bool TQMapConstIterator::operator== ( const TQMapConstIterator<K, T> & it ) const" Compares the iterator to the \fIit\fR iterator and returns TRUE if they point to the same item; otherwise returns FALSE. .SH "SEE ALSO" -.BR http://doc.trolltech.com/qmapconstiterator.html +.BR http://doc.trolltech.com/tqmapconstiterator.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqmapiterator.3qt b/doc/man/man3/tqmapiterator.3qt index 0b3d6dfe6..fe3f39cd3 100644 --- a/doc/man/man3/tqmapiterator.3qt +++ b/doc/man/man3/tqmapiterator.3qt @@ -1,5 +1,5 @@ '\" t -.TH QMapIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQMapIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,9 +7,9 @@ .ad l .nh .SH NAME -QMapIterator \- Iterator for QMap +TQMapIterator \- Iterator for TQMap .SH SYNOPSIS -\fC#include <ntqmap.h>\fR +\fC#include <tqmap.h>\fR .PP .SS "Public Members" .in +1c @@ -26,19 +26,19 @@ QMapIterator \- Iterator for QMap .BI "typedef T & \fBreference\fR" .br .ti -1c -.BI "\fBQMapIterator\fR ()" +.BI "\fBTQMapIterator\fR ()" .br .ti -1c -.BI "\fBQMapIterator\fR ( QMapNode<K, T> * p )" +.BI "\fBTQMapIterator\fR ( TQMapNode<K, T> * p )" .br .ti -1c -.BI "\fBQMapIterator\fR ( const QMapIterator<K, T> & it )" +.BI "\fBTQMapIterator\fR ( const TQMapIterator<K, T> & it )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QMapIterator<K, T> & it ) const" +.BI "bool \fBoperator==\fR ( const TQMapIterator<K, T> & it ) const" .br .ti -1c -.BI "bool \fBoperator!=\fR ( const QMapIterator<K, T> & it ) const" +.BI "bool \fBoperator!=\fR ( const TQMapIterator<K, T> & it ) const" .br .ti -1c .BI "T & \fBoperator*\fR ()" @@ -56,78 +56,78 @@ QMapIterator \- Iterator for QMap .BI "const T & \fBdata\fR () const" .br .ti -1c -.BI "QMapIterator<K, T> & \fBoperator++\fR ()" +.BI "TQMapIterator<K, T> & \fBoperator++\fR ()" .br .ti -1c -.BI "QMapIterator<K, T> \fBoperator++\fR ( int )" +.BI "TQMapIterator<K, T> \fBoperator++\fR ( int )" .br .ti -1c -.BI "QMapIterator<K, T> & \fBoperator--\fR ()" +.BI "TQMapIterator<K, T> & \fBoperator--\fR ()" .br .ti -1c -.BI "QMapIterator<K, T> \fBoperator--\fR ( int )" +.BI "TQMapIterator<K, T> \fBoperator--\fR ( int )" .br .in -1c .SH DESCRIPTION -The QMapIterator class provides an iterator for QMap. +The TQMapIterator class provides an iterator for TQMap. .PP -You cannot create an iterator by yourself. Instead, you must ask a map to give you one. An iterator is as big as a pointer; on 32-bit machines that means 4 bytes, on 64-bit machines, 8 bytes. That makes copying iterators very fast. Iterators behave in a similar way to pointers, and they are almost as fast as pointers. See the QMap example. +You cannot create an iterator by yourself. Instead, you must ask a map to give you one. An iterator is as big as a pointer; on 32-bit machines that means 4 bytes, on 64-bit machines, 8 bytes. That makes copying iterators very fast. Iterators behave in a similar way to pointers, and they are almost as fast as pointers. See the TQMap example. .PP -QMap is highly optimized for performance and memory usage, but the trade-off is that you must be more careful. The only way to traverse a map is to use iterators. QMap does not know about its iterators, and the iterators don't even know to which map they belong. That makes things fast but a bit dangerous because it is up to you to make sure that the iterators you are using are still valid. QDictIterator will be able to give warnings, whereas QMapIterator may end up in an undefined state. +TQMap is highly optimized for performance and memory usage, but the trade-off is that you must be more careful. The only way to traverse a map is to use iterators. TQMap does not know about its iterators, and the iterators don't even know to which map they belong. That makes things fast but a bit dangerous because it is up to you to make sure that the iterators you are using are still valid. QDictIterator will be able to give warnings, whereas TQMapIterator may end up in an undefined state. .PP -For every Iterator there is also a ConstIterator. You must use the ConstIterator to access a QMap in a const environment or if the reference or pointer to the map is itself const. Its semantics are the same, but it only returns const references to the item it points to. +For every Iterator there is also a ConstIterator. You must use the ConstIterator to access a TQMap in a const environment or if the reference or pointer to the map is itself const. Its semantics are the same, but it only returns const references to the item it points to. .PP -See also QMap, QMapConstIterator, TQt Template Library Classes, and Non-GUI Classes. +See also TQMap, TQMapConstIterator, TQt Template Library Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QMapIterator::iterator_category" +.SH "TQMapIterator::iterator_category" The type of iterator category, \fCstd::bidirectional_iterator_tag\fR. -.SH "QMapIterator::pointer" +.SH "TQMapIterator::pointer" Pointer to value_type. -.SH "QMapIterator::reference" +.SH "TQMapIterator::reference" Reference to value_type. -.SH "QMapIterator::value_type" +.SH "TQMapIterator::value_type" The type of value. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QMapIterator::QMapIterator ()" +.SH "TQMapIterator::TQMapIterator ()" Creates an uninitialized iterator. -.SH "QMapIterator::QMapIterator ( QMapNode<K, T> * p )" +.SH "TQMapIterator::TQMapIterator ( TQMapNode<K, T> * p )" Constructs an iterator starting at node \fIp\fR. -.SH "QMapIterator::QMapIterator ( const QMapIterator<K, T> & it )" +.SH "TQMapIterator::TQMapIterator ( const TQMapIterator<K, T> & it )" Constructs a copy of the iterator, \fIit\fR. -.SH "T & QMapIterator::data ()" +.SH "T & TQMapIterator::data ()" Returns a reference to the current item's data. -.SH "const T & QMapIterator::data () const" +.SH "const T & TQMapIterator::data () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const reference to the current item's data. -.SH "const K & QMapIterator::key () const" +.SH "const K & TQMapIterator::key () const" Returns a const reference to the current item's key. -.SH "bool QMapIterator::operator!= ( const QMapIterator<K, T> & it ) const" +.SH "bool TQMapIterator::operator!= ( const TQMapIterator<K, T> & it ) const" Compares the iterator to the \fIit\fR iterator and returns FALSE if they point to the same item; otherwise returns TRUE. -.SH "T & QMapIterator::operator* ()" +.SH "T & TQMapIterator::operator* ()" Dereference operator. Returns a reference to the current item's data. The same as data(). -.SH "const T & QMapIterator::operator* () const" +.SH "const T & TQMapIterator::operator* () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Dereference operator. Returns a const reference to the current item's data. The same as data(). -.SH "QMapIterator<K, T> & QMapIterator::operator++ ()" +.SH "TQMapIterator<K, T> & TQMapIterator::operator++ ()" Prefix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the map. Incrementing the iterator returned by end() causes undefined results. -.SH "QMapIterator<K, T> QMapIterator::operator++ ( int )" +.SH "TQMapIterator<K, T> TQMapIterator::operator++ ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the map. Incrementing the iterator returned by end() causes undefined results. -.SH "QMapIterator<K, T> & QMapIterator::operator-- ()" +.SH "TQMapIterator<K, T> & TQMapIterator::operator-- ()" Prefix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the map. Decrementing the iterator returned by begin() causes undefined results. -.SH "QMapIterator<K, T> QMapIterator::operator-- ( int )" +.SH "TQMapIterator<K, T> TQMapIterator::operator-- ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the map. Decrementing the iterator returned by begin() causes undefined results. -.SH "bool QMapIterator::operator== ( const QMapIterator<K, T> & it ) const" +.SH "bool TQMapIterator::operator== ( const TQMapIterator<K, T> & it ) const" Compares the iterator to the \fIit\fR iterator and returns TRUE if they point to the same item; otherwise returns FALSE. .SH "SEE ALSO" -.BR http://doc.trolltech.com/qmapiterator.html +.BR http://doc.trolltech.com/tqmapiterator.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqmemarray.3qt b/doc/man/man3/tqmemarray.3qt index 7a5a42eb5..207ef97f9 100644 --- a/doc/man/man3/tqmemarray.3qt +++ b/doc/man/man3/tqmemarray.3qt @@ -163,7 +163,7 @@ QMemArray uses explicit sharing with a reference count. If more than one array s .PP The benefit of sharing is that a program does not need to duplicate data when it is not required, which results in lower memory use and less copying of data. .PP -An alternative to QMemArray is QValueVector. The QValueVector class also provides an array of objects, but can deal with objects that have constructors (specifically a copy constructor and a default constructor). QValueVector provides an STL-compatible syntax and is implicitly shared. +An alternative to QMemArray is TQValueVector. The TQValueVector class also provides an array of objects, but can deal with objects that have constructors (specifically a copy constructor and a default constructor). TQValueVector provides an STL-compatible syntax and is implicitly shared. .PP Example: .PP @@ -329,11 +329,11 @@ This can be used to both read and set an element. .PP See also operator[](). .SH "Iterator QMemArray::begin ()" -Returns an iterator pointing at the beginning of this array. This iterator can be used in the same way as the iterators of QValueList and QMap, for example. +Returns an iterator pointing at the beginning of this array. This iterator can be used in the same way as the iterators of TQValueList and TQMap, for example. .SH "ConstIterator QMemArray::begin () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP -Returns a const iterator pointing at the beginning of this array. This iterator can be used in the same way as the iterators of QValueList and QMap, for example. +Returns a const iterator pointing at the beginning of this array. This iterator can be used in the same way as the iterators of TQValueList and TQMap, for example. .SH "int QMemArray::bsearch ( const type & v ) const" In a sorted array (as sorted by sort()), finds the first occurrence of \fIv\fR by using a binary search. For a sorted array this is generally much faster than find(), which does a linear search. .PP @@ -382,11 +382,11 @@ Deep copy. Dereferences the current array and obtains a copy of the array data \ .PP See also copy(). .SH "Iterator QMemArray::end ()" -Returns an iterator pointing behind the last element of this array. This iterator can be used in the same way as the iterators of QValueList and QMap, for example. +Returns an iterator pointing behind the last element of this array. This iterator can be used in the same way as the iterators of TQValueList and TQMap, for example. .SH "ConstIterator QMemArray::end () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP -Returns a const iterator pointing behind the last element of this array. This iterator can be used in the same way as the iterators of QValueList and QMap, for example. +Returns a const iterator pointing behind the last element of this array. This iterator can be used in the same way as the iterators of TQValueList and TQMap, for example. .SH "bool QMemArray::fill ( const type & v, int size = -1 )" Fills the array with the value \fIv\fR. If \fIsize\fR is specified as different from -1, then the array will be resized before being filled. .PP diff --git a/doc/man/man3/tqnetworkprotocol.3qt b/doc/man/man3/tqnetworkprotocol.3qt index 5960ccbe4..d3e58000c 100644 --- a/doc/man/man3/tqnetworkprotocol.3qt +++ b/doc/man/man3/tqnetworkprotocol.3qt @@ -78,7 +78,7 @@ Inherited by QFtp, QHttp, and QLocalFs. .BI "void \fBstart\fR ( QNetworkOperation * op )" .br .ti -1c -.BI "void \fBnewChildren\fR ( const QValueList<QUrlInfo> & i, QNetworkOperation * op )" +.BI "void \fBnewChildren\fR ( const TQValueList<QUrlInfo> & i, QNetworkOperation * op )" .br .ti -1c .BI "void \fBnewChild\fR ( const QUrlInfo & i, QNetworkOperation * op )" @@ -276,7 +276,7 @@ When a protocol emits this signal, QNetworkProtocol is smart enough to let the Q This signal is emitted if a new child (file) has been read. QNetworkProtocol automatically connects it to a slot which creates a list of QUrlInfo objects (with just one QUrlInfo \fIi\fR) and emits the newChildren() signal with this list. \fIop\fR is the pointer to the operation object which contains all the information about the operation that has finished, including the state, etc. .PP This is just a convenience signal useful for implementing your own network protocol. In all other cases connect to the newChildren() signal with its list of QUrlInfo objects. -.SH "void QNetworkProtocol::newChildren ( const QValueList<QUrlInfo> & i, QNetworkOperation * op )\fC [signal]\fR" +.SH "void QNetworkProtocol::newChildren ( const TQValueList<QUrlInfo> & i, QNetworkOperation * op )\fC [signal]\fR" This signal is emitted after listChildren() was called and new children (files) have been read from the list of files. \fIi\fR holds the information about the new children. \fIop\fR is the pointer to the operation object which contains all the information about the operation, including the state, etc. .PP When a protocol emits this signal, QNetworkProtocol is smart enough to let the QUrlOperator, which is used by the network protocol, emit its corresponding signal. diff --git a/doc/man/man3/tqpair.3qt b/doc/man/man3/tqpair.3qt index 88e7ba520..00f83cdbf 100644 --- a/doc/man/man3/tqpair.3qt +++ b/doc/man/man3/tqpair.3qt @@ -9,7 +9,7 @@ .SH NAME TQPair \- Value-based template class that provides a pair of elements .SH SYNOPSIS -\fC#include <ntqpair.h>\fR +\fC#include <tqpair.h>\fR .PP .SS "Public Members" .in +1c @@ -20,10 +20,10 @@ TQPair \- Value-based template class that provides a pair of elements .BI "typedef T2 \fBsecond_type\fR" .br .ti -1c -.BI "\fBQPair\fR ()" +.BI "\fBTQPair\fR ()" .br .ti -1c -.BI "\fBQPair\fR ( const T1 & t1, const T2 & t2 )" +.BI "\fBTQPair\fR ( const T1 & t1, const T2 & t2 )" .br .ti -1c .BI "TQPair<T1, T2> & \fBoperator=\fR ( const TQPair<T1, T2> & other )" @@ -75,7 +75,7 @@ This is a template convenience function. It is used to create a TQPair<> object that contains \fIt1\fR and \fIt2\fR. .SH "SEE ALSO" -.BR http://doc.trolltech.com/ntqpair.html +.BR http://doc.trolltech.com/tqpair.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqptrcollection.3qt b/doc/man/man3/tqptrcollection.3qt index 265af59c1..101c81cb3 100644 --- a/doc/man/man3/tqptrcollection.3qt +++ b/doc/man/man3/tqptrcollection.3qt @@ -54,7 +54,7 @@ Inherited by QAsciiCache, QAsciiDict, QCache, QDict, QIntCache, QIntDict, QPtrLi .SH DESCRIPTION The QPtrCollection class is the base class of most pointer-based TQt collections. .PP -The QPtrCollection class is an abstract base class for the TQt collection classes QDict, QPtrList, etc. TQt also includes value based collections, e.g. QValueList, QMap, etc. +The QPtrCollection class is an abstract base class for the TQt collection classes QDict, QPtrList, etc. TQt also includes value based collections, e.g. TQValueList, TQMap, etc. .PP A QPtrCollection only knows about the number of objects in the collection and the deletion strategy (see setAutoDelete()). .PP diff --git a/doc/man/man3/tqptrlist.3qt b/doc/man/man3/tqptrlist.3qt index eb3dbdc7b..2b40eccc6 100644 --- a/doc/man/man3/tqptrlist.3qt +++ b/doc/man/man3/tqptrlist.3qt @@ -168,7 +168,7 @@ Inherited by TQObjectList and QStrList. .SH DESCRIPTION The QPtrList class is a template class that provides a list. .PP -QValueList is an STL-compatible alternative to this class. +TQValueList is an STL-compatible alternative to this class. .PP Define a template instance QPtrList<X> to create a list that operates on pointers to X (X*). .PP diff --git a/doc/man/man3/tqptrqueue.3qt b/doc/man/man3/tqptrqueue.3qt index 7dc08ccf3..98c8e0e93 100644 --- a/doc/man/man3/tqptrqueue.3qt +++ b/doc/man/man3/tqptrqueue.3qt @@ -71,7 +71,7 @@ QPtrQueue \- Template class that provides a queue .SH DESCRIPTION The QPtrQueue class is a template class that provides a queue. .PP -QValueVector can be used as an STL-compatible alternative to this class. +TQValueVector can be used as an STL-compatible alternative to this class. .PP A template instance QPtrQueue<X> is a queue that operates on pointers to X (X*). .PP diff --git a/doc/man/man3/tqptrstack.3qt b/doc/man/man3/tqptrstack.3qt index 8964b2c82..e6607756a 100644 --- a/doc/man/man3/tqptrstack.3qt +++ b/doc/man/man3/tqptrstack.3qt @@ -71,7 +71,7 @@ QPtrStack \- Template class that provides a stack .SH DESCRIPTION The QPtrStack class is a template class that provides a stack. .PP -QValueStack is an STL-compatible alternative to this class. +TQValueStack is an STL-compatible alternative to this class. .PP Define a template instance QPtrStack<X> to create a stack that operates on pointers to X, (X*). .PP diff --git a/doc/man/man3/tqptrvector.3qt b/doc/man/man3/tqptrvector.3qt index a2f364211..e2aaeede6 100644 --- a/doc/man/man3/tqptrvector.3qt +++ b/doc/man/man3/tqptrvector.3qt @@ -115,7 +115,7 @@ Inherits QPtrCollection. .SH DESCRIPTION The QPtrVector class is a template collection class that provides a vector (array). .PP -QValueVector is an STL-compatible alternative to this class. +TQValueVector is an STL-compatible alternative to this class. .PP QPtrVector is implemented as a template class. Defines a template instance QPtrVector<X> to create a vector that contains pointers to X (X*). .PP diff --git a/doc/man/man3/tqsplitter.3qt b/doc/man/man3/tqsplitter.3qt index 7f73a1dcf..59ab39e3a 100644 --- a/doc/man/man3/tqsplitter.3qt +++ b/doc/man/man3/tqsplitter.3qt @@ -61,10 +61,10 @@ Inherits QFrame. .BI "void \fBrefresh\fR ()" .br .ti -1c -.BI "QValueList<int> \fBsizes\fR () const" +.BI "TQValueList<int> \fBsizes\fR () const" .br .ti -1c -.BI "void \fBsetSizes\fR ( QValueList<int> list )" +.BI "void \fBsetSizes\fR ( TQValueList<int> list )" .br .ti -1c .BI "int \fBhandleWidth\fR () const" @@ -239,7 +239,7 @@ Examples: .)l fileiconview/mainwindow.cpp, listviews/listviews.cpp, and splitter/splitter.cpp. .SH "void QSplitter::setRubberband ( int p )\fC [virtual protected]\fR" Displays a rubber band at position \fIp\fR. If \fIp\fR is negative, the rubber band is removed. -.SH "void QSplitter::setSizes ( QValueList<int> list )" +.SH "void QSplitter::setSizes ( TQValueList<int> list )" Sets the size parameters to the values given in the \fIlist\fR. If the splitter is horizontal, the values set the widths of each widget going from left to right. If the splitter is vertical, the values set the heights of each widget going from top to bottom. Extra values in the \fIlist\fR are ignored. .PP If \fIlist\fR contains too few values, the result is undefined but the program will still be well-behaved. @@ -247,7 +247,7 @@ If \fIlist\fR contains too few values, the result is undefined but the program w Note that the values in \fIlist\fR should be the height/width that the widgets should be resized to. .PP See also sizes(). -.SH "QValueList<int> QSplitter::sizes () const" +.SH "TQValueList<int> QSplitter::sizes () const" Returns a list of the size parameters of all the widgets in this splitter. .PP If the splitter's orientation is horizontal, the list is a list of widget widths; if the orientation is vertical, the list is a list of widget heights. @@ -258,9 +258,9 @@ Note that if you want to iterate over the list, you should iterate over a copy, .PP .nf .br - QValueList<int> list = mySplitter.sizes(); + TQValueList<int> list = mySplitter.sizes(); .br - QValueList<int>::Iterator it = list.begin(); + TQValueList<int>::Iterator it = list.begin(); .br while( it != list.end() ) { .br diff --git a/doc/man/man3/tqsqlquery.3qt b/doc/man/man3/tqsqlquery.3qt index d77a24120..731c8243a 100644 --- a/doc/man/man3/tqsqlquery.3qt +++ b/doc/man/man3/tqsqlquery.3qt @@ -124,7 +124,7 @@ Inherited by TQSqlCursor. .BI "QVariant \fBboundValue\fR ( int pos ) const" .br .ti -1c -.BI "QMap<TQString, QVariant> \fBboundValues\fR () const" +.BI "TQMap<TQString, QVariant> \fBboundValues\fR () const" .br .ti -1c .BI "TQString \fBexecutedQuery\fR () const" @@ -339,7 +339,7 @@ Returns the value for the \fIplaceholder\fR. This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns the value for the placeholder at position \fIpos\fR. -.SH "QMap<TQString, QVariant> TQSqlQuery::boundValues () const" +.SH "TQMap<TQString, QVariant> TQSqlQuery::boundValues () const" Returns a map of the bound values. .PP The bound values can be examined in the following way: @@ -352,9 +352,9 @@ The bound values can be examined in the following way: .br // Examine the bound values - bound using named binding .br - QMap<TQString, QVariant>::ConstIterator it; + TQMap<TQString, QVariant>::ConstIterator it; .br - QMap<TQString, QVariant> vals = query.boundValues(); + TQMap<TQString, QVariant> vals = query.boundValues(); .br for ( it = vals.begin(); it != vals.end(); ++it ) .br @@ -365,9 +365,9 @@ The bound values can be examined in the following way: .br // Examine the bound values - bound using positional binding .br - QValueList<QVariant>::ConstIterator it; + TQValueList<QVariant>::ConstIterator it; .br - QValueList<QVariant> list = query.boundValues().values(); + TQValueList<QVariant> list = query.boundValues().values(); .br int i = 0; .br diff --git a/doc/man/man3/tqsqlrecordinfo.3qt b/doc/man/man3/tqsqlrecordinfo.3qt index 78b21788d..78caa3fd6 100644 --- a/doc/man/man3/tqsqlrecordinfo.3qt +++ b/doc/man/man3/tqsqlrecordinfo.3qt @@ -35,9 +35,9 @@ TQSqlRecordInfo \- Encapsulates a set of database field meta data .SH DESCRIPTION The TQSqlRecordInfo class encapsulates a set of database field meta data. .PP -This class is a QValueList that holds a set of database field meta data. Use contains() to see if a given field name exists in the record, and use find() to get a TQSqlFieldInfo record for a named field. +This class is a TQValueList that holds a set of database field meta data. Use contains() to see if a given field name exists in the record, and use find() to get a TQSqlFieldInfo record for a named field. .PP -See also QValueList, TQSqlFieldInfo, and Database Classes. +See also TQValueList, TQSqlFieldInfo, and Database Classes. .SH MEMBER FUNCTION DOCUMENTATION .SH "TQSqlRecordInfo::TQSqlRecordInfo ()" Constructs an empty record info object diff --git a/doc/man/man3/tqstringlist.3qt b/doc/man/man3/tqstringlist.3qt index c1da5978d..891227c7a 100644 --- a/doc/man/man3/tqstringlist.3qt +++ b/doc/man/man3/tqstringlist.3qt @@ -13,7 +13,7 @@ All the functions in this class are reentrant when TQt is built with thread supp .PP \fC#include <ntqstringlist.h>\fR .PP -Inherits QValueList<TQString>. +Inherits TQValueList<TQString>. .PP .SS "Public Members" .in +1c @@ -24,7 +24,7 @@ Inherits QValueList<TQString>. .BI "\fBQStringList\fR ( const QStringList & l )" .br .ti -1c -.BI "\fBQStringList\fR ( const QValueList<TQString> & l )" +.BI "\fBQStringList\fR ( const TQValueList<TQString> & l )" .br .ti -1c .BI "\fBQStringList\fR ( const TQString & i )" @@ -69,7 +69,7 @@ Inherits QValueList<TQString>. .SH DESCRIPTION The QStringList class provides a list of strings. .PP -It is used to store and manipulate strings that logically belong together. Essentially QStringList is a QValueList of TQString objects. Unlike QStrList, which stores pointers to characters, QStringList holds real TQString objects. It is the class of choice whenever you work with Unicode strings. QStringList is part of the TQt Template Library. +It is used to store and manipulate strings that logically belong together. Essentially QStringList is a TQValueList of TQString objects. Unlike QStrList, which stores pointers to characters, QStringList holds real TQString objects. It is the class of choice whenever you work with Unicode strings. QStringList is part of the TQt Template Library. .PP Like TQString itself, QStringList objects are implicitly shared, so passing them around as value-parameters is both fast and safe. .PP @@ -169,7 +169,7 @@ Creates an empty string list. .SH "QStringList::QStringList ( const QStringList & l )" Creates a copy of the list \fIl\fR. This function is very fast because QStringList is implicitly shared. In most situations this acts like a deep copy, for example, if this list or the original one or some other list referencing the same shared data is modified, the modifying list first makes a copy, i.e. copy-on-write. In a threaded environment you may require a real deep copy . -.SH "QStringList::QStringList ( const QValueList<TQString> & l )" +.SH "QStringList::QStringList ( const TQValueList<TQString> & l )" Constructs a new string list that is a copy of \fIl\fR. .SH "QStringList::QStringList ( const TQString & i )" Constructs a string list consisting of the single string \fIi\fR. Longer lists are easily created as follows: @@ -277,7 +277,7 @@ Sorts the list of strings in ascending case-sensitive order. .PP Sorting is very fast. It uses the TQt Template Library's efficient HeapSort implementation that has a time complexity of O(n*log n). .PP -If you want to sort your strings in an arbitrary order consider using a QMap. For example you could use a QMap<TQString,TQString> to create a case-insensitive ordering (e.g. mapping the lowercase text to the text), or a QMap<int,TQString> to sort the strings by some integer index, etc. +If you want to sort your strings in an arbitrary order consider using a TQMap. For example you could use a TQMap<TQString,TQString> to create a case-insensitive ordering (e.g. mapping the lowercase text to the text), or a TQMap<int,TQString> to sort the strings by some integer index, etc. .PP Example: themes/themes.cpp. .SH "QStringList QStringList::split ( const QRegExp & sep, const TQString & str, bool allowEmptyEntries = FALSE )\fC [static]\fR" diff --git a/doc/man/man3/tqstylesheet.3qt b/doc/man/man3/tqstylesheet.3qt index 2ec054934..19e069432 100644 --- a/doc/man/man3/tqstylesheet.3qt +++ b/doc/man/man3/tqstylesheet.3qt @@ -28,7 +28,7 @@ Inherits TQObject. .BI "const QStyleSheetItem * \fBitem\fR ( const TQString & name ) const" .br .ti -1c -.BI "virtual QTextCustomItem * \fBtag\fR ( const TQString & name, const QMap<TQString, TQString> & attr, const TQString & context, const QMimeSourceFactory & factory, bool emptyTag, QTextDocument * doc ) const" +.BI "virtual QTextCustomItem * \fBtag\fR ( const TQString & name, const TQMap<TQString, TQString> & attr, const TQString & context, const QMimeSourceFactory & factory, bool emptyTag, QTextDocument * doc ) const" .br .ti -1c .BI "virtual void \fBscaleFont\fR ( QFont & font, int logicalSize ) const" @@ -187,7 +187,7 @@ See also QStyleSheetItem::logicalFontSize(), QStyleSheetItem::logicalFontSizeSte Sets the application-wide default style sheet to \fIsheet\fR, deleting any style sheet previously set. The ownership is transferred to QStyleSheet. .PP See also defaultSheet(). -.SH "QTextCustomItem * QStyleSheet::tag ( const TQString & name, const QMap<TQString, TQString> & attr, const TQString & context, const QMimeSourceFactory & factory, bool emptyTag, QTextDocument * doc ) const\fC [virtual]\fR" +.SH "QTextCustomItem * QStyleSheet::tag ( const TQString & name, const TQMap<TQString, TQString> & attr, const TQString & context, const QMimeSourceFactory & factory, bool emptyTag, QTextDocument * doc ) const\fC [virtual]\fR" \fBThis function is under development and is subject to change.\fR .PP Generates an internal object for the tag called \fIname\fR, given the attributes \fIattr\fR, and using additional information provided by the mime source factory \fIfactory\fR. diff --git a/doc/man/man3/tqtextcodecplugin.3qt b/doc/man/man3/tqtextcodecplugin.3qt index 3cd95f8da..8226705cb 100644 --- a/doc/man/man3/tqtextcodecplugin.3qt +++ b/doc/man/man3/tqtextcodecplugin.3qt @@ -28,7 +28,7 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "virtual QTextCodec * \fBcreateForName\fR ( const TQString & name ) = 0" .br .ti -1c -.BI "virtual QValueList<int> \fBmibEnums\fR () const = 0" +.BI "virtual TQValueList<int> \fBmibEnums\fR () const = 0" .br .ti -1c .BI "virtual QTextCodec * \fBcreateForMib\fR ( int mib ) = 0" @@ -61,7 +61,7 @@ See also mibEnums(). Creates a QTextCodec object for the codec called \fIname\fR. .PP See also names(). -.SH "QValueList<int> QTextCodecPlugin::mibEnums () const\fC [pure virtual]\fR" +.SH "TQValueList<int> QTextCodecPlugin::mibEnums () const\fC [pure virtual]\fR" Returns the list of mib enums supported by this plugin. .PP See also createForMib(). diff --git a/doc/man/man3/tqtranslator.3qt b/doc/man/man3/tqtranslator.3qt index cc41b06f3..5a84db4ef 100644 --- a/doc/man/man3/tqtranslator.3qt +++ b/doc/man/man3/tqtranslator.3qt @@ -64,7 +64,7 @@ Inherits TQObject. .BI "void \fBunsqueeze\fR ()" .br .ti -1c -.BI "QValueList<QTranslatorMessage> \fBmessages\fR () const" +.BI "TQValueList<QTranslatorMessage> \fBmessages\fR () const" .br .ti -1c .BI "bool \fBisEmpty\fR () const" @@ -222,16 +222,16 @@ This is an overloaded member function, provided for convenience. It behaves esse Loads the .qm file data \fIdata\fR of length \fIlen\fR into the translator. Returns TRUE if the data is loaded successfully; otherwise returns FALSE. .PP The data is not copied. The caller must be able to guarantee that \fIdata\fR will not be deleted or modified. -.SH "QValueList<QTranslatorMessage> QTranslator::messages () const" +.SH "TQValueList<QTranslatorMessage> QTranslator::messages () const" Returns a list of the messages in the translator. This function is rather slow. Because it is seldom called, it's optimized for simplicity and small size, rather than speed. .PP If you want to iterate over the list, you should iterate over a copy, e.g. .PP .nf .br - QValueList<QTranslatorMessage> list = myTranslator.messages(); + TQValueList<QTranslatorMessage> list = myTranslator.messages(); .br - QValueList<QTranslatorMessage>::Iterator it = list.begin(); + TQValueList<QTranslatorMessage>::Iterator it = list.begin(); .br while ( it != list.end() ) { .br diff --git a/doc/man/man3/tqurloperator.3qt b/doc/man/man3/tqurloperator.3qt index 36c60f027..6e2f17b8a 100644 --- a/doc/man/man3/tqurloperator.3qt +++ b/doc/man/man3/tqurloperator.3qt @@ -73,7 +73,7 @@ Inherits TQObject and QUrl. .SS "Signals" .in +1c .ti -1c -.BI "void \fBnewChildren\fR ( const QValueList<QUrlInfo> & i, QNetworkOperation * op )" +.BI "void \fBnewChildren\fR ( const TQValueList<QUrlInfo> & i, QNetworkOperation * op )" .br .ti -1c .BI "void \fBfinished\fR ( QNetworkOperation * op )" @@ -281,7 +281,7 @@ The path of this QUrlOperator must to point to a directory (not a file) because Returns the name filter of the URL. .PP See also QUrlOperator::setNameFilter() and QDir::nameFilter(). -.SH "void QUrlOperator::newChildren ( const QValueList<QUrlInfo> & i, QNetworkOperation * op )\fC [signal]\fR" +.SH "void QUrlOperator::newChildren ( const TQValueList<QUrlInfo> & i, QNetworkOperation * op )\fC [signal]\fR" This signal is emitted after listChildren() was called and new children (i.e. files) have been read from a list of files. \fIi\fR holds the information about the new files. \fIop\fR is a pointer to the operation object which contains all the information about the operation, including the state. .PP See also QNetworkOperation and QNetworkProtocol. diff --git a/doc/man/man3/tqvaluelist.3qt b/doc/man/man3/tqvaluelist.3qt index a24de76fe..a01a41ce6 100644 --- a/doc/man/man3/tqvaluelist.3qt +++ b/doc/man/man3/tqvaluelist.3qt @@ -1,5 +1,5 @@ '\" t -.TH QValueList 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQValueList 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,21 +7,21 @@ .ad l .nh .SH NAME -QValueList \- Value-based template class that provides lists +TQValueList \- Value-based template class that provides lists .SH SYNOPSIS All the functions in this class are reentrant when TQt is built with thread support.</p> .PP -\fC#include <ntqvaluelist.h>\fR +\fC#include <tqvaluelist.h>\fR .PP -Inherited by TQCanvasItemList, QStringList, and QValueStack. +Inherited by TQCanvasItemList, QStringList, and TQValueStack. .PP .SS "Public Members" .in +1c .ti -1c -.BI "typedef QValueListIterator<T> \fBiterator\fR" +.BI "typedef TQValueListIterator<T> \fBiterator\fR" .br .ti -1c -.BI "typedef QValueListConstIterator<T> \fBconst_iterator\fR" +.BI "typedef TQValueListConstIterator<T> \fBconst_iterator\fR" .br .ti -1c .BI "typedef T \fBvalue_type\fR" @@ -42,31 +42,31 @@ Inherited by TQCanvasItemList, QStringList, and QValueStack. .BI "typedef size_t \fBsize_type\fR" .br .ti -1c -.BI "\fBQValueList\fR ()" +.BI "\fBTQValueList\fR ()" .br .ti -1c -.BI "\fBQValueList\fR ( const QValueList<T> & l )" +.BI "\fBTQValueList\fR ( const TQValueList<T> & l )" .br .ti -1c -.BI "\fBQValueList\fR ( const std::list<T> & l )" +.BI "\fBTQValueList\fR ( const std::list<T> & l )" .br .ti -1c -.BI "\fB~QValueList\fR ()" +.BI "\fB~TQValueList\fR ()" .br .ti -1c -.BI "QValueList<T> & \fBoperator=\fR ( const QValueList<T> & l )" +.BI "TQValueList<T> & \fBoperator=\fR ( const TQValueList<T> & l )" .br .ti -1c -.BI "QValueList<T> & \fBoperator=\fR ( const std::list<T> & l )" +.BI "TQValueList<T> & \fBoperator=\fR ( const std::list<T> & l )" .br .ti -1c .BI "bool \fBoperator==\fR ( const std::list<T> & l ) const" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QValueList<T> & l ) const" +.BI "bool \fBoperator==\fR ( const TQValueList<T> & l ) const" .br .ti -1c -.BI "bool \fBoperator!=\fR ( const QValueList<T> & l ) const" +.BI "bool \fBoperator!=\fR ( const TQValueList<T> & l ) const" .br .ti -1c .BI "iterator \fBbegin\fR ()" @@ -96,7 +96,7 @@ Inherited by TQCanvasItemList, QStringList, and QValueStack. .BI "void \fBclear\fR ()" .br .ti -1c -.BI "QValueList<T> & \fBoperator<<\fR ( const T & x )" +.BI "TQValueList<T> & \fBoperator<<\fR ( const T & x )" .br .ti -1c .BI "size_type \fBsize\fR () const" @@ -138,10 +138,10 @@ Inherited by TQCanvasItemList, QStringList, and QValueStack. .BI "void \fBinsert\fR ( iterator pos, size_type n, const T & x )" .br .ti -1c -.BI "QValueList<T> \fBoperator+\fR ( const QValueList<T> & l ) const" +.BI "TQValueList<T> \fBoperator+\fR ( const TQValueList<T> & l ) const" .br .ti -1c -.BI "QValueList<T> & \fBoperator+=\fR ( const QValueList<T> & l )" +.BI "TQValueList<T> & \fBoperator+=\fR ( const TQValueList<T> & l )" .br .ti -1c .BI "iterator \fBfromLast\fR ()" @@ -207,34 +207,34 @@ Inherited by TQCanvasItemList, QStringList, and QValueStack. .BI "size_type \fBcount\fR () const" .br .ti -1c -.BI "QValueList<T> & \fBoperator+=\fR ( const T & x )" +.BI "TQValueList<T> & \fBoperator+=\fR ( const T & x )" .br .ti -1c -.BI "typedef QValueListIterator<T> \fBIterator\fR" +.BI "typedef TQValueListIterator<T> \fBIterator\fR" .br .ti -1c -.BI "typedef QValueListConstIterator<T> \fBConstIterator\fR" +.BI "typedef TQValueListConstIterator<T> \fBConstIterator\fR" .br .in -1c .SH RELATED FUNCTION DOCUMENTATION .in +1c .ti -1c -.BI "QDataStream & \fBoperator>>\fR ( QDataStream & s, QValueList<T> & l )" +.BI "QDataStream & \fBoperator>>\fR ( QDataStream & s, TQValueList<T> & l )" .br .ti -1c -.BI "QDataStream & \fBoperator<<\fR ( QDataStream & s, const QValueList<T> & l )" +.BI "QDataStream & \fBoperator<<\fR ( QDataStream & s, const TQValueList<T> & l )" .br .in -1c .SH DESCRIPTION -The QValueList class is a value-based template class that provides lists. +The TQValueList class is a value-based template class that provides lists. .PP -QValueList is a TQt implementation of an STL-like list container. It can be used in your application if the standard \fClist\fR is not available for your target platform(s). QValueList is part of the TQt Template Library. +TQValueList is a TQt implementation of an STL-like list container. It can be used in your application if the standard \fClist\fR is not available for your target platform(s). TQValueList is part of the TQt Template Library. .PP -QValueList<T> defines a template instance to create a list of values that all have the class T. Note that QValueList does not store pointers to the members of the list; it holds a copy of every member. This is why these kinds of classes are called "value based"; QPtrList and QDict are "pointer based". +TQValueList<T> defines a template instance to create a list of values that all have the class T. Note that TQValueList does not store pointers to the members of the list; it holds a copy of every member. This is why these kinds of classes are called "value based"; QPtrList and QDict are "pointer based". .PP -QValueList contains and manages a collection of objects of type T and provides iterators that allow the contained objects to be addressed. QValueList owns the contained items. For more relaxed ownership semantics, see QPtrCollection and friends which are pointer-based containers. +TQValueList contains and manages a collection of objects of type T and provides iterators that allow the contained objects to be addressed. TQValueList owns the contained items. For more relaxed ownership semantics, see QPtrCollection and friends which are pointer-based containers. .PP -Some classes cannot be used within a QValueList, for example, all classes derived from TQObject and thus all classes that implement widgets. Only values can be used in a QValueList. To qualify as a value the class must provide: +Some classes cannot be used within a TQValueList, for example, all classes derived from TQObject and thus all classes that implement widgets. Only values can be used in a TQValueList. To qualify as a value the class must provide: .TP a copy constructor; .TP @@ -246,7 +246,7 @@ Note that C++ defaults to field-by-field assignment operators and copy construct .PP In addition, some compilers (e.g. Sun CC) might require that the class provides an equality operator (operator==()). .PP -QValueList's function naming is consistent with the other TQt classes (e.g. count(), isEmpty()). QValueList also provides extra functions for compatibility with STL algorithms, such as size() and empty(). Programmers already familiar with the STL \fClist\fR may prefer to use the STL-compatible functions. +TQValueList's function naming is consistent with the other TQt classes (e.g. count(), isEmpty()). TQValueList also provides extra functions for compatibility with STL algorithms, such as size() and empty(). Programmers already familiar with the STL \fClist\fR may prefer to use the STL-compatible functions. .PP Example: .PP @@ -287,7 +287,7 @@ Example: }; .br .br - typedef QValueList<Employee> EmployeeList; + typedef TQValueList<Employee> EmployeeList; .br EmployeeList list; .br @@ -337,11 +337,11 @@ Another way to find an item in the list is by using the tqFind() algorithm. For .PP .nf .br - QValueList<int> list; + TQValueList<int> list; .br ... .br - QValueList<int>::iterator it = tqFind( list.begin(), list.end(), 3 ); + TQValueList<int>::iterator it = tqFind( list.begin(), list.end(), 3 ); .br if ( it != list.end() ) .br @@ -353,7 +353,7 @@ It is safe to have multiple iterators a the list at the same time. If some membe .PP .nf .br - QValueList<int> list; + TQValueList<int> list; .br list.append( 1 ); .br @@ -375,15 +375,15 @@ It is safe to have multiple iterators a the list at the same time. If some membe .br ... .br - QValueList<double> dlist; + TQValueList<double> dlist; .br double d = dlist.last(); // undefined .br .fi .PP -Because QValueList is value-based there is no need to be careful about deleting items in the list. The list holds its own copies and will free them if the corresponding member or the list itself is deleted. You can force the list to free all of its items with clear(). +Because TQValueList is value-based there is no need to be careful about deleting items in the list. The list holds its own copies and will free them if the corresponding member or the list itself is deleted. You can force the list to free all of its items with clear(). .PP -QValueList is shared implicitly, which means it can be copied in constant time, i.e. O(1). If multiple QValueList instances share the same data and one needs to modify its contents, this modifying instance makes a copy and modifies its private copy; therefore it does not affect the other instances; this takes O(n) time. This is often called "copy on write". If a QValueList is being used in a multi-threaded program, you must protect all access to the list. See QMutex. +TQValueList is shared implicitly, which means it can be copied in constant time, i.e. O(1). If multiple TQValueList instances share the same data and one needs to modify its contents, this modifying instance makes a copy and modifies its private copy; therefore it does not affect the other instances; this takes O(n) time. This is often called "copy on write". If a TQValueList is being used in a multi-threaded program, you must protect all access to the list. See QMutex. .PP There are several ways to insert items into the list. The prepend() and append() functions insert items at the beginning and the end of the list respectively. The insert() function comes in several flavors and can be used to add one or more items at specific positions within the list. .PP @@ -395,7 +395,7 @@ Example: .PP .nf .br - QValueList<int> list; + TQValueList<int> list; .br list.append( 5 ); .br @@ -409,177 +409,177 @@ Example: .br .fi .PP -See also QValueListIterator, TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. +See also TQValueListIterator, TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QValueList::ConstIterator" -This iterator is an instantiation of QValueListConstIterator for the same type as this QValueList. In other words, if you instantiate QValueList<int>, ConstIterator is a QValueListConstIterator<int>. Several member function use it, such as QValueList::begin(), which returns an iterator pointing to the first item in the list. +.SH "TQValueList::ConstIterator" +This iterator is an instantiation of TQValueListConstIterator for the same type as this TQValueList. In other words, if you instantiate TQValueList<int>, ConstIterator is a TQValueListConstIterator<int>. Several member function use it, such as TQValueList::begin(), which returns an iterator pointing to the first item in the list. .PP Functionally, this is almost the same as Iterator. The only difference is you cannot use ConstIterator for non-const operations, and that the compiler can often generate better code if you use ConstIterator. .PP -See also QValueListIterator and Iterator. -.SH "QValueList::Iterator" -This iterator is an instantiation of QValueListIterator for the same type as this QValueList. In other words, if you instantiate QValueList<int>, Iterator is a QValueListIterator<int>. Several member function use it, such as QValueList::begin(), which returns an iterator pointing to the first item in the list. +See also TQValueListIterator and Iterator. +.SH "TQValueList::Iterator" +This iterator is an instantiation of TQValueListIterator for the same type as this TQValueList. In other words, if you instantiate TQValueList<int>, Iterator is a TQValueListIterator<int>. Several member function use it, such as TQValueList::begin(), which returns an iterator pointing to the first item in the list. .PP Functionally, this is almost the same as ConstIterator. The only difference is that you cannot use ConstIterator for non-const operations, and that the compiler can often generate better code if you use ConstIterator. .PP -See also QValueListIterator and ConstIterator. -.SH "QValueList::const_iterator" -The list's const iterator type, QValueListConstIterator. -.SH "QValueList::const_pointer" +See also TQValueListIterator and ConstIterator. +.SH "TQValueList::const_iterator" +The list's const iterator type, TQValueListConstIterator. +.SH "TQValueList::const_pointer" The const pointer to T type. -.SH "QValueList::const_reference" +.SH "TQValueList::const_reference" The const reference to T type. -.SH "QValueList::iterator" -The list's iterator type, QValueListIterator. -.SH "QValueList::pointer" +.SH "TQValueList::iterator" +The list's iterator type, TQValueListIterator. +.SH "TQValueList::pointer" The pointer to T type. -.SH "QValueList::reference" +.SH "TQValueList::reference" The reference to T type. -.SH "QValueList::size_type" +.SH "TQValueList::size_type" An unsigned integral type, used to represent various sizes. -.SH "QValueList::value_type" +.SH "TQValueList::value_type" The type of the object stored in the list, T. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QValueList::QValueList ()" +.SH "TQValueList::TQValueList ()" Constructs an empty list. -.SH "QValueList::QValueList ( const QValueList<T> & l )" +.SH "TQValueList::TQValueList ( const TQValueList<T> & l )" Constructs a copy of \fIl\fR. .PP -This operation takes O(1) time because QValueList is implicitly shared. +This operation takes O(1) time because TQValueList is implicitly shared. .PP The first modification to a list will take O(n) time. -.SH "QValueList::QValueList ( const std::list<T> & l )" +.SH "TQValueList::TQValueList ( const std::list<T> & l )" Contructs a copy of \fIl\fR. .PP This constructor is provided for compatibility with STL containers. -.SH "QValueList::~QValueList ()" -Destroys the list. References to the values in the list and all iterators of this list become invalidated. Note that it is impossible for an iterator to check whether or not it is valid: QValueList is highly tuned for performance, not for error checking. -.SH "iterator QValueList::append ( const T & x )" +.SH "TQValueList::~TQValueList ()" +Destroys the list. References to the values in the list and all iterators of this list become invalidated. Note that it is impossible for an iterator to check whether or not it is valid: TQValueList is highly tuned for performance, not for error checking. +.SH "iterator TQValueList::append ( const T & x )" Inserts \fIx\fR at the end of the list. .PP See also insert() and prepend(). .PP Examples: .)l checklists/checklists.cpp and fonts/simple-qfont-demo/viewer.cpp. -.SH "const_iterator QValueList::at ( size_type i ) const" +.SH "const_iterator TQValueList::at ( size_type i ) const" Returns an iterator pointing to the item at position \fIi\fR in the list, or an undefined value if the index is out of range. .PP -\fBWarning:\fR This function uses a linear search and can be extremely slow for large lists. QValueList is not optimized for random item access. If you need random access use a different container, such as QValueVector. -.SH "iterator QValueList::at ( size_type i )" +\fBWarning:\fR This function uses a linear search and can be extremely slow for large lists. TQValueList is not optimized for random item access. If you need random access use a different container, such as TQValueVector. +.SH "iterator TQValueList::at ( size_type i )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator pointing to the item at position \fIi\fR in the list, or an undefined value if the index is out of range. -.SH "reference QValueList::back ()" +.SH "reference TQValueList::back ()" Returns a reference to the last item. If the list contains no last item (i.e. empty() returns TRUE), the return value is undefined. .PP This function is provided for STL compatibility. It is equivalent to last(). .PP See also front(). -.SH "const_reference QValueList::back () const" +.SH "const_reference TQValueList::back () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "const_iterator QValueList::begin () const" +.SH "const_iterator TQValueList::begin () const" Returns an iterator pointing to the first item in the list. This iterator equals end() if the list is empty. .PP See also first(), end(), and constBegin(). .PP Examples: .)l canvas/canvas.cpp, chart/canvasview.cpp, chart/element.cpp, checklists/checklists.cpp, sql/overview/insert/main.cpp, table/statistics/statistics.cpp, and themes/themes.cpp. -.SH "iterator QValueList::begin ()" +.SH "iterator TQValueList::begin ()" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator pointing to the first item in the list. This iterator equals end() if the list is empty. .PP See also first() and end(). -.SH "void QValueList::clear ()" +.SH "void TQValueList::clear ()" Removes all items from the list. .PP See also remove(). -.SH "const_iterator QValueList::constBegin () const" +.SH "const_iterator TQValueList::constBegin () const" Returns an iterator pointing to the first item in the list. This iterator equals constEnd() if the list is empty. .PP See also begin(). -.SH "const_iterator QValueList::constEnd () const" +.SH "const_iterator TQValueList::constEnd () const" Returns an iterator pointing \fIpast\fR the last item in the list. This iterator equals constBegin() if the list is empty. .PP See also end(). -.SH "size_type QValueList::contains ( const T & x ) const" +.SH "size_type TQValueList::contains ( const T & x ) const" Returns the number of occurrences of the value \fIx\fR in the list. -.SH "size_type QValueList::count () const" +.SH "size_type TQValueList::count () const" Returns the number of items in the list. .PP See also isEmpty(). .PP Examples: .)l chart/element.cpp, fileiconview/qfileiconview.cpp, and table/statistics/statistics.cpp. -.SH "bool QValueList::empty () const" +.SH "bool TQValueList::empty () const" Returns TRUE if the list contains no items; otherwise returns FALSE. .PP See also size(). -.SH "iterator QValueList::end ()" +.SH "iterator TQValueList::end ()" Returns an iterator pointing \fIpast\fR the last item in the list. This iterator equals begin() if the list is empty. .PP See also last(), begin(), and constEnd(). .PP Examples: .)l canvas/canvas.cpp, chart/canvasview.cpp, chart/element.cpp, checklists/checklists.cpp, sql/overview/insert/main.cpp, table/statistics/statistics.cpp, and themes/themes.cpp. -.SH "const_iterator QValueList::end () const" +.SH "const_iterator TQValueList::end () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator pointing \fIpast\fR the last item in the list. This iterator equals begin() if the list is empty. .PP See also last() and begin(). -.SH "iterator QValueList::erase ( iterator it )" +.SH "iterator TQValueList::erase ( iterator it )" Removes the item pointed to by \fIit\fR from the list. No iterators other than \fIit\fR or other iterators pointing at the same item as \fIit\fR are invalidated. Returns an iterator to the next item after \fIit\fR, or end() if there is no such item. .PP This function is provided for STL compatibility. It is equivalent to remove(). -.SH "iterator QValueList::erase ( iterator first, iterator last )" +.SH "iterator TQValueList::erase ( iterator first, iterator last )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Deletes all items from \fIfirst\fR to \fIlast\fR (not including \fIlast\fR). No iterators are invalidated, except those pointing to the removed items themselves. Returns \fIlast\fR. -.SH "iterator QValueList::find ( const T & x )" +.SH "iterator TQValueList::find ( const T & x )" Returns an iterator pointing to the first occurrence of \fIx\fR in the list. .PP Returns end() is no item matched. -.SH "const_iterator QValueList::find ( const T & x ) const" +.SH "const_iterator TQValueList::find ( const T & x ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator pointing to the first occurrence of \fIx\fR in the list. .PP Returns end() if no item matched. -.SH "iterator QValueList::find ( iterator it, const T & x )" +.SH "iterator TQValueList::find ( iterator it, const T & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Finds the first occurrence of \fIx\fR in the list starting at the position given by \fIit\fR. .PP Returns end() if no item matched. -.SH "const_iterator QValueList::find ( const_iterator it, const T & x ) const" +.SH "const_iterator TQValueList::find ( const_iterator it, const T & x ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Finds the first occurrence of \fIx\fR in the list starting at the position given by \fIit\fR. .PP Returns end() if no item matched. -.SH "int QValueList::findIndex ( const T & x ) const" +.SH "int TQValueList::findIndex ( const T & x ) const" Returns the index of the first occurrence of the value \fIx\fR. Returns -1 if no item matched. -.SH "T & QValueList::first ()" +.SH "T & TQValueList::first ()" Returns a reference to the first item. If the list contains no first item (i.e. isEmpty() returns TRUE), the return value is undefined. .PP See also last(). .PP Example: network/mail/smtp.cpp. -.SH "const T & QValueList::first () const" +.SH "const T & TQValueList::first () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "const_iterator QValueList::fromLast () const" +.SH "const_iterator TQValueList::fromLast () const" Returns an iterator to the last item in the list, or end() if there is no last item. .PP Use the end() function instead. For example: .PP .nf .br - QValueList<int> l; + TQValueList<int> l; .br ... .br - QValueList<int>::iterator it = l.end(); + TQValueList<int>::iterator it = l.end(); .br --it; .br @@ -588,7 +588,7 @@ Use the end() function instead. For example: // ... .br .fi -.SH "iterator QValueList::fromLast ()" +.SH "iterator TQValueList::fromLast ()" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns an iterator to the last item in the list, or end() if there is no last item. @@ -597,11 +597,11 @@ Use the end() function instead. For example: .PP .nf .br - QValueList<int> l; + TQValueList<int> l; .br ... .br - QValueList<int>::iterator it = l.end(); + TQValueList<int>::iterator it = l.end(); .br --it; .br @@ -610,15 +610,15 @@ Use the end() function instead. For example: // ... .br .fi -.SH "reference QValueList::front ()" +.SH "reference TQValueList::front ()" Returns a reference to the first item. If the list contains no first item (i.e. empty() returns TRUE), the return value is undefined. .PP This function is provided for STL compatibility. It is equivalent to first(). .PP See also back(). -.SH "const_reference QValueList::front () const" +.SH "const_reference TQValueList::front () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "iterator QValueList::insert ( iterator it, const T & x )" +.SH "iterator TQValueList::insert ( iterator it, const T & x )" Inserts the value \fIx\fR in front of the item pointed to by the iterator, \fIit\fR. .PP Returns an iterator pointing at the inserted item. @@ -626,112 +626,112 @@ Returns an iterator pointing at the inserted item. See also append() and prepend(). .PP Example: themes/themes.cpp. -.SH "void QValueList::insert ( iterator pos, size_type n, const T & x )" +.SH "void TQValueList::insert ( iterator pos, size_type n, const T & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Inserts \fIn\fR copies of \fIx\fR before position \fIpos\fR. -.SH "bool QValueList::isEmpty () const" +.SH "bool TQValueList::isEmpty () const" Returns TRUE if the list contains no items; otherwise returns FALSE. .PP See also count(). .PP Examples: .)l fonts/simple-qfont-demo/viewer.cpp and network/mail/smtp.cpp. -.SH "T & QValueList::last ()" +.SH "T & TQValueList::last ()" Returns a reference to the last item. If the list contains no last item (i.e. empty() returns TRUE), the return value is undefined. -.SH "const T & QValueList::last () const" +.SH "const T & TQValueList::last () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "bool QValueList::operator!= ( const QValueList<T> & l ) const" +.SH "bool TQValueList::operator!= ( const TQValueList<T> & l ) const" Compares both lists. .PP Returns TRUE if this list and \fIl\fR are unequal; otherwise returns FALSE. -.SH "QValueList<T> QValueList::operator+ ( const QValueList<T> & l ) const" +.SH "TQValueList<T> TQValueList::operator+ ( const TQValueList<T> & l ) const" Creates a new list and fills it with the items of this list. Then the items of \fIl\fR are appended. Returns the new list. -.SH "QValueList<T> & QValueList::operator+= ( const QValueList<T> & l )" +.SH "TQValueList<T> & TQValueList::operator+= ( const TQValueList<T> & l )" Appends the items of \fIl\fR to this list. Returns a reference to this list. -.SH "QValueList<T> & QValueList::operator+= ( const T & x )" +.SH "TQValueList<T> & TQValueList::operator+= ( const T & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Appends the value \fIx\fR to the list. Returns a reference to the list. -.SH "QValueList<T> & QValueList::operator<< ( const T & x )" +.SH "TQValueList<T> & TQValueList::operator<< ( const T & x )" Adds the value \fIx\fR to the end of the list. .PP Returns a reference to the list. -.SH "QValueList<T> & QValueList::operator= ( const QValueList<T> & l )" +.SH "TQValueList<T> & TQValueList::operator= ( const TQValueList<T> & l )" Assigns \fIl\fR to this list and returns a reference to this list. .PP -All iterators of the current list become invalidated by this operation. The cost of such an assignment is O(1) since QValueList is implicitly shared. -.SH "QValueList<T> & QValueList::operator= ( const std::list<T> & l )" +All iterators of the current list become invalidated by this operation. The cost of such an assignment is O(1) since TQValueList is implicitly shared. +.SH "TQValueList<T> & TQValueList::operator= ( const std::list<T> & l )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Assigns the contents of \fIl\fR to the list. .PP All iterators of the current list become invalidated by this operation. -.SH "bool QValueList::operator== ( const QValueList<T> & l ) const" +.SH "bool TQValueList::operator== ( const TQValueList<T> & l ) const" Compares both lists. .PP Returns TRUE if this list and \fIl\fR are equal; otherwise returns FALSE. -.SH "bool QValueList::operator== ( const std::list<T> & l ) const" +.SH "bool TQValueList::operator== ( const std::list<T> & l ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns TRUE if this list and \fIl\fR are equal; otherwise returns FALSE. .PP This operator is provided for compatibility with STL containers. -.SH "const T & QValueList::operator[] ( size_type i ) const" +.SH "const T & TQValueList::operator[] ( size_type i ) const" Returns a const reference to the item with index \fIi\fR in the list. It is up to you to check whether this item really exists. You can do that easily with the count() function. However this operator does not check whether \fIi\fR is in range and will deliver undefined results if it does not exist. .PP -\fBWarning:\fR This function uses a linear search and can be extremely slow for large lists. QValueList is not optimized for random item access. If you need random access use a different container, such as QValueVector. -.SH "T & QValueList::operator[] ( size_type i )" +\fBWarning:\fR This function uses a linear search and can be extremely slow for large lists. TQValueList is not optimized for random item access. If you need random access use a different container, such as TQValueVector. +.SH "T & TQValueList::operator[] ( size_type i )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a non-const reference to the item with index \fIi\fR. -.SH "void QValueList::pop_back ()" +.SH "void TQValueList::pop_back ()" Removes the last item. If there is no last item, this operation is undefined. .PP This function is provided for STL compatibility. -.SH "void QValueList::pop_front ()" +.SH "void TQValueList::pop_front ()" Removes the first item. If there is no first item, this operation is undefined. .PP This function is provided for STL compatibility. -.SH "iterator QValueList::prepend ( const T & x )" +.SH "iterator TQValueList::prepend ( const T & x )" Inserts \fIx\fR at the beginning of the list. .PP See also insert() and append(). -.SH "void QValueList::push_back ( const T & x )" +.SH "void TQValueList::push_back ( const T & x )" Inserts \fIx\fR at the end of the list. .PP This function is provided for STL compatibility. It is equivalent to append(). -.SH "void QValueList::push_front ( const T & x )" +.SH "void TQValueList::push_front ( const T & x )" Inserts \fIx\fR at the beginning of the list. .PP This function is provided for STL compatibility. It is equivalent to prepend(). .PP Example: toplevel/options.ui.h. -.SH "iterator QValueList::remove ( iterator it )" +.SH "iterator TQValueList::remove ( iterator it )" Removes the item pointed to by \fIit\fR from the list. No iterators other than \fIit\fR or other iterators pointing at the same item as \fIit\fR are invalidated. Returns an iterator to the next item after \fIit\fR, or end() if there is no such item. .PP See also clear(). -.SH "uint QValueList::remove ( const T & x )" +.SH "uint TQValueList::remove ( const T & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Removes all items that have value \fIx\fR and returns the number of removed items. -.SH "size_type QValueList::size () const" +.SH "size_type TQValueList::size () const" Returns the number of items in the list. .PP This function is provided for STL compatibility. It is equivalent to count(). .PP See also empty(). .SH RELATED FUNCTION DOCUMENTATION -.SH "QDataStream & operator<< ( QDataStream & s, const QValueList<T> & l )" +.SH "QDataStream & operator<< ( QDataStream & s, const TQValueList<T> & l )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Writes a list, \fIl\fR, to the stream \fIs\fR. The type T stored in the list must implement the streaming operator. -.SH "QDataStream & operator>> ( QDataStream & s, QValueList<T> & l )" +.SH "QDataStream & operator>> ( QDataStream & s, TQValueList<T> & l )" Reads a list, \fIl\fR, from the stream \fIs\fR. The type T stored in the list must implement the streaming operator. .SH "SEE ALSO" -.BR http://doc.trolltech.com/ntqvaluelist.html +.BR http://doc.trolltech.com/tqvaluelist.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqvaluelistconstiterator.3qt b/doc/man/man3/tqvaluelistconstiterator.3qt index 6032bddff..35c19fcf7 100644 --- a/doc/man/man3/tqvaluelistconstiterator.3qt +++ b/doc/man/man3/tqvaluelistconstiterator.3qt @@ -1,5 +1,5 @@ '\" t -.TH QValueListConstIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQValueListConstIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,11 +7,11 @@ .ad l .nh .SH NAME -QValueListConstIterator \- Const iterator for QValueList +TQValueListConstIterator \- Const iterator for TQValueList .SH SYNOPSIS All the functions in this class are reentrant when TQt is built with thread support.</p> .PP -\fC#include <ntqvaluelist.h>\fR +\fC#include <tqvaluelist.h>\fR .PP .SS "Public Members" .in +1c @@ -25,84 +25,84 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "typedef const T & \fBreference\fR" .br .ti -1c -.BI "\fBQValueListConstIterator\fR ()" +.BI "\fBTQValueListConstIterator\fR ()" .br .ti -1c -.BI "\fBQValueListConstIterator\fR ( const QValueListConstIterator<T> & it )" +.BI "\fBTQValueListConstIterator\fR ( const TQValueListConstIterator<T> & it )" .br .ti -1c -.BI "\fBQValueListConstIterator\fR ( const QValueListIterator<T> & it )" +.BI "\fBTQValueListConstIterator\fR ( const TQValueListIterator<T> & it )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QValueListConstIterator<T> & it ) const" +.BI "bool \fBoperator==\fR ( const TQValueListConstIterator<T> & it ) const" .br .ti -1c -.BI "bool \fBoperator!=\fR ( const QValueListConstIterator<T> & it ) const" +.BI "bool \fBoperator!=\fR ( const TQValueListConstIterator<T> & it ) const" .br .ti -1c .BI "const T & \fBoperator*\fR () const" .br .ti -1c -.BI "QValueListConstIterator<T> & \fBoperator++\fR ()" +.BI "TQValueListConstIterator<T> & \fBoperator++\fR ()" .br .ti -1c -.BI "QValueListConstIterator<T> \fBoperator++\fR ( int )" +.BI "TQValueListConstIterator<T> \fBoperator++\fR ( int )" .br .ti -1c -.BI "QValueListConstIterator<T> & \fBoperator--\fR ()" +.BI "TQValueListConstIterator<T> & \fBoperator--\fR ()" .br .ti -1c -.BI "QValueListConstIterator<T> \fBoperator--\fR ( int )" +.BI "TQValueListConstIterator<T> \fBoperator--\fR ( int )" .br .in -1c .SH DESCRIPTION -The QValueListConstIterator class provides a const iterator for QValueList. +The TQValueListConstIterator class provides a const iterator for TQValueList. .PP -In contrast to QValueListIterator, this class is used to iterate over a const list. It does not allow modification of the values of the list since that would break const semantics. +In contrast to TQValueListIterator, this class is used to iterate over a const list. It does not allow modification of the values of the list since that would break const semantics. .PP -You can create the appropriate const iterator type by using the \fCconst_iterator\fR typedef provided by QValueList. +You can create the appropriate const iterator type by using the \fCconst_iterator\fR typedef provided by TQValueList. .PP -For more information on QValueList iterators, see QValueListIterator. +For more information on TQValueList iterators, see TQValueListIterator. .PP -See also QValueListIterator, QValueList, TQt Template Library Classes, and Non-GUI Classes. +See also TQValueListIterator, TQValueList, TQt Template Library Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QValueListConstIterator::pointer" +.SH "TQValueListConstIterator::pointer" Pointer to value_type. -.SH "QValueListConstIterator::reference" +.SH "TQValueListConstIterator::reference" Reference to value_type. -.SH "QValueListConstIterator::value_type" +.SH "TQValueListConstIterator::value_type" The type of value. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QValueListConstIterator::QValueListConstIterator ()" +.SH "TQValueListConstIterator::TQValueListConstIterator ()" Creates un uninitialized iterator. -.SH "QValueListConstIterator::QValueListConstIterator ( const QValueListConstIterator<T> & it )" +.SH "TQValueListConstIterator::TQValueListConstIterator ( const TQValueListConstIterator<T> & it )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Constructs a copy of the iterator \fIit\fR. -.SH "QValueListConstIterator::QValueListConstIterator ( const QValueListIterator<T> & it )" +.SH "TQValueListConstIterator::TQValueListConstIterator ( const TQValueListIterator<T> & it )" Constructs a copy of the iterator \fIit\fR. -.SH "bool QValueListConstIterator::operator!= ( const QValueListConstIterator<T> & it ) const" +.SH "bool TQValueListConstIterator::operator!= ( const TQValueListConstIterator<T> & it ) const" Compares this iterator with \fIit\fR and returns TRUE if they point to different items; otherwise returns FALSE. -.SH "const T & QValueListConstIterator::operator* () const" +.SH "const T & TQValueListConstIterator::operator* () const" Asterisk operator. Returns a reference to the current iterator item. -.SH "QValueListConstIterator<T> & QValueListConstIterator::operator++ ()" +.SH "TQValueListConstIterator<T> & TQValueListConstIterator::operator++ ()" Prefix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the list. Incrementing the iterator returned by end() causes undefined results. -.SH "QValueListConstIterator<T> QValueListConstIterator::operator++ ( int )" +.SH "TQValueListConstIterator<T> TQValueListConstIterator::operator++ ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the list. Incrementing the iterator returned by end() causes undefined results. -.SH "QValueListConstIterator<T> & QValueListConstIterator::operator-- ()" +.SH "TQValueListConstIterator<T> & TQValueListConstIterator::operator-- ()" Prefix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the list. Decrementing the iterator returned by begin() causes undefined results. -.SH "QValueListConstIterator<T> QValueListConstIterator::operator-- ( int )" +.SH "TQValueListConstIterator<T> TQValueListConstIterator::operator-- ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the list. Decrementing the iterator returned by begin() causes undefined results. -.SH "bool QValueListConstIterator::operator== ( const QValueListConstIterator<T> & it ) const" +.SH "bool TQValueListConstIterator::operator== ( const TQValueListConstIterator<T> & it ) const" Compares this iterator with \fIit\fR and returns TRUE if they point to the same item; otherwise returns FALSE. .SH "SEE ALSO" -.BR http://doc.trolltech.com/qvaluelistconstiterator.html +.BR http://doc.trolltech.com/tqvaluelistconstiterator.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqvaluelistiterator.3qt b/doc/man/man3/tqvaluelistiterator.3qt index f652ca180..a7345817f 100644 --- a/doc/man/man3/tqvaluelistiterator.3qt +++ b/doc/man/man3/tqvaluelistiterator.3qt @@ -1,5 +1,5 @@ '\" t -.TH QValueListIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQValueListIterator 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,11 +7,11 @@ .ad l .nh .SH NAME -QValueListIterator \- Iterator for QValueList +TQValueListIterator \- Iterator for TQValueList .SH SYNOPSIS All the functions in this class are reentrant when TQt is built with thread support.</p> .PP -\fC#include <ntqvaluelist.h>\fR +\fC#include <tqvaluelist.h>\fR .PP .SS "Public Members" .in +1c @@ -25,16 +25,16 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "typedef T & \fBreference\fR" .br .ti -1c -.BI "\fBQValueListIterator\fR ()" +.BI "\fBTQValueListIterator\fR ()" .br .ti -1c -.BI "\fBQValueListIterator\fR ( const QValueListIterator<T> & it )" +.BI "\fBTQValueListIterator\fR ( const TQValueListIterator<T> & it )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QValueListIterator<T> & it ) const" +.BI "bool \fBoperator==\fR ( const TQValueListIterator<T> & it ) const" .br .ti -1c -.BI "bool \fBoperator!=\fR ( const QValueListIterator<T> & it ) const" +.BI "bool \fBoperator!=\fR ( const TQValueListIterator<T> & it ) const" .br .ti -1c .BI "const T & \fBoperator*\fR () const" @@ -43,34 +43,34 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "T & \fBoperator*\fR ()" .br .ti -1c -.BI "QValueListIterator<T> & \fBoperator++\fR ()" +.BI "TQValueListIterator<T> & \fBoperator++\fR ()" .br .ti -1c -.BI "QValueListIterator<T> \fBoperator++\fR ( int )" +.BI "TQValueListIterator<T> \fBoperator++\fR ( int )" .br .ti -1c -.BI "QValueListIterator<T> & \fBoperator--\fR ()" +.BI "TQValueListIterator<T> & \fBoperator--\fR ()" .br .ti -1c -.BI "QValueListIterator<T> \fBoperator--\fR ( int )" +.BI "TQValueListIterator<T> \fBoperator--\fR ( int )" .br .ti -1c -.BI "QValueListIterator<T> & \fBoperator+=\fR ( int j )" +.BI "TQValueListIterator<T> & \fBoperator+=\fR ( int j )" .br .ti -1c -.BI "QValueListIterator<T> & \fBoperator-=\fR ( int j )" +.BI "TQValueListIterator<T> & \fBoperator-=\fR ( int j )" .br .in -1c .SH DESCRIPTION -The QValueListIterator class provides an iterator for QValueList. +The TQValueListIterator class provides an iterator for TQValueList. .PP An iterator is a class for accessing the items of a container class: a generalization of the index in an array. A pointer into a "const char *" and an index into an "int[]" are both iterators, and the general idea is to provide that functionality for any data structure. .PP -The QValueListIterator class is an iterator for QValueList instantiations. You can create the appropriate iterator type by using the \fCiterator\fR typedef provided by QValueList. +The TQValueListIterator class is an iterator for TQValueList instantiations. You can create the appropriate iterator type by using the \fCiterator\fR typedef provided by TQValueList. .PP -The only way to access the items in a QValueList is to use an iterator. +The only way to access the items in a TQValueList is to use an iterator. .PP -Example (see QValueList for the complete code): +Example (see TQValueList for the complete code): .PP .nf .br @@ -97,57 +97,57 @@ Example (see QValueList for the complete code): .br .fi .PP -QValueList is highly optimized for performance and memory usage. This means that you must be careful: QValueList does not know about all its iterators and the iterators don't know to which list they belong. This makes things very fast, but if you're not careful, you can get spectacular bugs. Always make sure iterators are valid before dereferencing them or using them as parameters to generic algorithms in the STL or the QTL. +TQValueList is highly optimized for performance and memory usage. This means that you must be careful: TQValueList does not know about all its iterators and the iterators don't know to which list they belong. This makes things very fast, but if you're not careful, you can get spectacular bugs. Always make sure iterators are valid before dereferencing them or using them as parameters to generic algorithms in the STL or the QTL. .PP Using an invalid iterator is undefined (your application will probably crash). Many TQt functions return const value lists; to iterate over these you should make a copy and iterate over the copy. .PP -For every Iterator there is a ConstIterator. When accessing a QValueList in a const environment or if the reference or pointer to the list is itself const, then you must use the ConstIterator. Its semantics are the same as the Iterator, but it only returns const references. +For every Iterator there is a ConstIterator. When accessing a TQValueList in a const environment or if the reference or pointer to the list is itself const, then you must use the ConstIterator. Its semantics are the same as the Iterator, but it only returns const references. .PP -See also QValueList, QValueListConstIterator, TQt Template Library Classes, and Non-GUI Classes. +See also TQValueList, TQValueListConstIterator, TQt Template Library Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QValueListIterator::pointer" +.SH "TQValueListIterator::pointer" Pointer to value_type. -.SH "QValueListIterator::reference" +.SH "TQValueListIterator::reference" Reference to value_type. -.SH "QValueListIterator::value_type" +.SH "TQValueListIterator::value_type" The type of value, T. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QValueListIterator::QValueListIterator ()" +.SH "TQValueListIterator::TQValueListIterator ()" Creates un uninitialized iterator. -.SH "QValueListIterator::QValueListIterator ( const QValueListIterator<T> & it )" +.SH "TQValueListIterator::TQValueListIterator ( const TQValueListIterator<T> & it )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Constructs a copy of the iterator \fIit\fR. -.SH "bool QValueListIterator::operator!= ( const QValueListIterator<T> & it ) const" +.SH "bool TQValueListIterator::operator!= ( const TQValueListIterator<T> & it ) const" Compares this iterator and \fIit\fR and returns TRUE if they point to different items; otherwise returns FALSE. -.SH "T & QValueListIterator::operator* ()" +.SH "T & TQValueListIterator::operator* ()" Asterisk operator. Returns a reference to the current iterator item. -.SH "const T & QValueListIterator::operator* () const" +.SH "const T & TQValueListIterator::operator* () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Asterisk operator. Returns a reference to the current iterator item. -.SH "QValueListIterator<T> & QValueListIterator::operator++ ()" +.SH "TQValueListIterator<T> & TQValueListIterator::operator++ ()" Prefix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the list. Incrementing the iterator returned by end() causes undefined results. -.SH "QValueListIterator<T> QValueListIterator::operator++ ( int )" +.SH "TQValueListIterator<T> TQValueListIterator::operator++ ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix ++ makes the succeeding item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the end of the list. Incrementing the iterator returned by end() causes undefined results. -.SH "QValueListIterator<T> & QValueListIterator::operator+= ( int j )" +.SH "TQValueListIterator<T> & TQValueListIterator::operator+= ( int j )" Postfix -- jumps \fIj\fR steps forward in the list. The iterator cannot check whether it reached the end of the list. Jumping past the end() causes undefined results. -.SH "QValueListIterator<T> & QValueListIterator::operator-- ()" +.SH "TQValueListIterator<T> & TQValueListIterator::operator-- ()" Prefix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the list. Decrementing the iterator returned by begin() causes undefined results. -.SH "QValueListIterator<T> QValueListIterator::operator-- ( int )" +.SH "TQValueListIterator<T> TQValueListIterator::operator-- ( int )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Postfix -- makes the previous item current and returns an iterator pointing to the new current item. The iterator cannot check whether it reached the beginning of the list. Decrementing the iterator returned by begin() causes undefined results. -.SH "QValueListIterator<T> & QValueListIterator::operator-= ( int j )" +.SH "TQValueListIterator<T> & TQValueListIterator::operator-= ( int j )" Postfix -- jumps \fIj\fR steps backward in the list. The iterator cannot check whether it reached the beginning of the list. Jumping past begin() causes undefined results. -.SH "bool QValueListIterator::operator== ( const QValueListIterator<T> & it ) const" +.SH "bool TQValueListIterator::operator== ( const TQValueListIterator<T> & it ) const" Compares this iterator and \fIit\fR and returns TRUE if they point to the same item; otherwise returns FALSE. .SH "SEE ALSO" -.BR http://doc.trolltech.com/qvaluelistiterator.html +.BR http://doc.trolltech.com/tqvaluelistiterator.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqvaluestack.3qt b/doc/man/man3/tqvaluestack.3qt index b36a89092..ba24f2b80 100644 --- a/doc/man/man3/tqvaluestack.3qt +++ b/doc/man/man3/tqvaluestack.3qt @@ -1,5 +1,5 @@ '\" t -.TH QValueStack 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQValueStack 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,21 +7,21 @@ .ad l .nh .SH NAME -QValueStack \- Value-based template class that provides a stack +TQValueStack \- Value-based template class that provides a stack .SH SYNOPSIS All the functions in this class are reentrant when TQt is built with thread support.</p> .PP -\fC#include <ntqvaluestack.h>\fR +\fC#include <tqvaluestack.h>\fR .PP -Inherits QValueList<T>. +Inherits TQValueList<T>. .PP .SS "Public Members" .in +1c .ti -1c -.BI "\fBQValueStack\fR ()" +.BI "\fBTQValueStack\fR ()" .br .ti -1c -.BI "\fB~QValueStack\fR ()" +.BI "\fB~TQValueStack\fR ()" .br .ti -1c .BI "void \fBpush\fR ( const T & d )" @@ -37,11 +37,11 @@ Inherits QValueList<T>. .br .in -1c .SH DESCRIPTION -The QValueStack class is a value-based template class that provides a stack. +The TQValueStack class is a value-based template class that provides a stack. .PP -Define a template instance QValueStack<X> to create a stack of values that all have the class X. QValueStack is part of the TQt Template Library. +Define a template instance TQValueStack<X> to create a stack of values that all have the class X. TQValueStack is part of the TQt Template Library. .PP -Note that QValueStack does not store pointers to the members of the stack; it holds a copy of every member. That is why these kinds of classes are called "value based"; QPtrStack, QPtrList, QDict, etc., are "pointer based". +Note that TQValueStack does not store pointers to the members of the stack; it holds a copy of every member. That is why these kinds of classes are called "value based"; QPtrStack, QPtrList, QDict, etc., are "pointer based". .PP A stack is a last in, first out (LIFO) structure. Items are added to the top of the stack with push() and retrieved from the top with pop(). The top() function provides access to the topmost item without removing it. .PP @@ -49,7 +49,7 @@ Example: .PP .nf .br - QValueStack<int> stack; + TQValueStack<int> stack; .br stack.push( 1 ); .br @@ -72,9 +72,9 @@ Example: .br .fi .PP -QValueStack is a specialized QValueList provided for convenience. All of QValueList's functionality also applies to QPtrStack, for example the facility to iterate over all elements using QValueStack<T>::Iterator. See QValueListIterator for further details. +TQValueStack is a specialized TQValueList provided for convenience. All of TQValueList's functionality also applies to QPtrStack, for example the facility to iterate over all elements using TQValueStack<T>::Iterator. See TQValueListIterator for further details. .PP -Some classes cannot be used within a QValueStack, for example everything derived from TQObject and thus all classes that implement widgets. Only values can be used in a QValueStack. To qualify as a value, the class must provide +Some classes cannot be used within a TQValueStack, for example everything derived from TQObject and thus all classes that implement widgets. Only values can be used in a TQValueStack. To qualify as a value, the class must provide .TP a copy constructor; .TP @@ -86,37 +86,37 @@ Note that C++ defaults to field-by-field assignment operators and copy construct .PP See also TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QValueStack::QValueStack ()" +.SH "TQValueStack::TQValueStack ()" Constructs an empty stack. -.SH "QValueStack::~QValueStack ()" -Destroys the stack. References to the values in the stack and all iterators of this stack become invalidated. Because QValueStack is highly tuned for performance, you won't see warnings if you use invalid iterators because it is impossible for an iterator to check whether or not it is valid. -.SH "T QValueStack::pop ()" +.SH "TQValueStack::~TQValueStack ()" +Destroys the stack. References to the values in the stack and all iterators of this stack become invalidated. Because TQValueStack is highly tuned for performance, you won't see warnings if you use invalid iterators because it is impossible for an iterator to check whether or not it is valid. +.SH "T TQValueStack::pop ()" Removes the top item from the stack and returns it. .PP See also top() and push(). -.SH "void QValueStack::push ( const T & d )" +.SH "void TQValueStack::push ( const T & d )" Adds element, \fId\fR, to the top of the stack. Last in, first out. .PP This function is equivalent to append(). .PP See also pop() and top(). -.SH "T & QValueStack::top ()" +.SH "T & TQValueStack::top ()" Returns a reference to the top item of the stack or the item referenced by end() if no such item exists. Note that you must not change the value the end() iterator points to. .PP This function is equivalent to last(). .PP -See also pop(), push(), and QValueList::fromLast(). -.SH "const T & QValueStack::top () const" +See also pop(), push(), and TQValueList::fromLast(). +.SH "const T & TQValueStack::top () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a reference to the top item of the stack or the item referenced by end() if no such item exists. .PP This function is equivalent to last(). .PP -See also pop(), push(), and QValueList::fromLast(). +See also pop(), push(), and TQValueList::fromLast(). .SH "SEE ALSO" -.BR http://doc.trolltech.com/ntqvaluestack.html +.BR http://doc.trolltech.com/tqvaluestack.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the diff --git a/doc/man/man3/tqvaluevector.3qt b/doc/man/man3/tqvaluevector.3qt index a291ab580..2e8dba809 100644 --- a/doc/man/man3/tqvaluevector.3qt +++ b/doc/man/man3/tqvaluevector.3qt @@ -1,5 +1,5 @@ '\" t -.TH QValueVector 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- +.TH TQValueVector 3qt "2 February 2007" "Trolltech AS" \" -*- nroff -*- .\" Copyright 1992-2007 Trolltech ASA. All rights reserved. See the .\" license file included in the distribution for a complete license .\" statement. @@ -7,11 +7,11 @@ .ad l .nh .SH NAME -QValueVector \- Value-based template class that provides a dynamic array +TQValueVector \- Value-based template class that provides a dynamic array .SH SYNOPSIS All the functions in this class are reentrant when TQt is built with thread support.</p> .PP -\fC#include <ntqvaluevector.h>\fR +\fC#include <tqvaluevector.h>\fR .PP .SS "Public Members" .in +1c @@ -43,28 +43,28 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "typedef ptrdiff_t \fBdifference_type\fR" .br .ti -1c -.BI "\fBQValueVector\fR ()" +.BI "\fBTQValueVector\fR ()" .br .ti -1c -.BI "\fBQValueVector\fR ( const QValueVector<T> & v )" +.BI "\fBTQValueVector\fR ( const TQValueVector<T> & v )" .br .ti -1c -.BI "\fBQValueVector\fR ( size_type n, const T & val = T ( ) )" +.BI "\fBTQValueVector\fR ( size_type n, const T & val = T ( ) )" .br .ti -1c -.BI "\fBQValueVector\fR ( std::vector<T> & v )" +.BI "\fBTQValueVector\fR ( std::vector<T> & v )" .br .ti -1c -.BI "\fBQValueVector\fR ( const std::vector<T> & v )" +.BI "\fBTQValueVector\fR ( const std::vector<T> & v )" .br .ti -1c -.BI "\fB~QValueVector\fR ()" +.BI "\fB~TQValueVector\fR ()" .br .ti -1c -.BI "QValueVector<T> & \fBoperator=\fR ( const QValueVector<T> & v )" +.BI "TQValueVector<T> & \fBoperator=\fR ( const TQValueVector<T> & v )" .br .ti -1c -.BI "QValueVector<T> & \fBoperator=\fR ( const std::vector<T> & v )" +.BI "TQValueVector<T> & \fBoperator=\fR ( const std::vector<T> & v )" .br .ti -1c .BI "size_type \fBsize\fR () const" @@ -145,10 +145,10 @@ All the functions in this class are reentrant when TQt is built with thread supp .BI "iterator \fBerase\fR ( iterator first, iterator last )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QValueVector<T> & x )" +.BI "bool \fBoperator==\fR ( const TQValueVector<T> & x )" .br .ti -1c -.BI "bool \fBoperator==\fR ( const QValueVector<T> & x ) const" +.BI "bool \fBoperator==\fR ( const TQValueVector<T> & x ) const" .br .ti -1c .BI "typedef T \fBValueType\fR" @@ -182,17 +182,17 @@ All the functions in this class are reentrant when TQt is built with thread supp .br .in -1c .SH DESCRIPTION -The QValueVector class is a value-based template class that provides a dynamic array. +The TQValueVector class is a value-based template class that provides a dynamic array. .PP -QValueVector is a TQt implementation of an STL-like vector container. It can be used in your application if the standard \fCvector\fR is not available for your target platforms. QValueVector is part of the TQt Template Library. +TQValueVector is a TQt implementation of an STL-like vector container. It can be used in your application if the standard \fCvector\fR is not available for your target platforms. TQValueVector is part of the TQt Template Library. .PP -QValueVector<T> defines a template instance to create a vector of values that all have the class T. QValueVector does not store pointers to the members of the vector; it holds a copy of every member. QValueVector is said to be value based; in contrast, QPtrList and QDict are pointer based. +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 member. TQValueVector is said to be value based; in contrast, QPtrList and QDict are pointer based. .PP -QValueVector contains and manages a collection of objects of type T and provides random access iterators that allow the contained objects to be addressed. QValueVector owns the contained elements. For more relaxed ownership semantics, see QPtrCollection and friends, which are pointer-based containers. +TQValueVector contains and manages a collection of objects of type T and provides random access iterators that allow the contained objects to be addressed. TQValueVector owns the contained elements. For more relaxed ownership semantics, see QPtrCollection and friends, which are pointer-based containers. .PP -QValueVector provides good performance if you append or remove elements from the end of the vector. If you insert or remove elements from anywhere but the end, performance is very bad. The reason for this is that elements must to be copied into new positions. +TQValueVector provides good performance if you append or remove elements from the end of the vector. If you insert or remove elements from anywhere but the end, performance is very bad. The reason for this is that elements must to be copied into new positions. .PP -Some classes cannot be used within a QValueVector: for example, all classes derived from TQObject and thus all classes that implement widgets. Only values can be used in a QValueVector. To qualify as a value the class must provide: +Some classes cannot be used within a TQValueVector: for example, all classes derived from TQObject and thus all classes that implement widgets. Only values can be used in a TQValueVector. To qualify as a value the class must provide: .TP a copy constructor; .TP @@ -202,13 +202,13 @@ a default constructor, i.e., a constructor that does not take any arguments. .PP Note that C++ defaults to field-by-field assignment operators and copy constructors if no explicit version is supplied. In many cases this is sufficient. .PP -QValueVector uses an STL-like syntax to manipulate and address the objects it contains. See this document for more information. +TQValueVector uses an STL-like syntax to manipulate and address the objects it contains. See this document for more information. .PP Example: .PP .nf .br - #include <ntqvaluevector.h> + #include <tqvaluevector.h> .br #include <ntqstring.h> .br @@ -249,7 +249,7 @@ Example: .br { .br - typedef QValueVector<Employee> EmployeeVector; + typedef TQValueVector<Employee> EmployeeVector; .br EmployeeVector vec( 3 ); // vector of 3 Employees .br @@ -306,12 +306,12 @@ The fastest way to access an element of a vector is by using operator[]. This fu .PP .nf .br - QValueVector<int> vec1; // an empty vector + TQValueVector<int> vec1; // an empty vector .br vec1[10] = 4; // WARNING: undefined, probably a crash .br .br - QValueVector<TQString> vec2(25); // initialize with 25 elements + TQValueVector<TQString> vec2(25); // initialize with 25 elements .br vec2[10] = "Dave"; // OK .br @@ -321,7 +321,7 @@ Whenever inserting, removing or referencing elements in a vector, always make su .PP .nf .br - void func( QValueVector<int>& vec ) + void func( TQValueVector<int>& vec ) .br { .br @@ -341,11 +341,11 @@ Another way to find an element in the vector is by using the std::find() or tqFi .PP .nf .br - QValueVector<int> vec; + TQValueVector<int> vec; .br ... .br - QValueVector<int>::const_iterator it = tqFind( vec.begin(), vec.end(), 3 ); + TQValueVector<int>::const_iterator it = tqFind( vec.begin(), vec.end(), 3 ); .br if ( it != vector.end() ) .br @@ -353,11 +353,11 @@ Another way to find an element in the vector is by using the std::find() or tqFi .br .fi .PP -It is safe to have multiple iterators on the vector at the same time. Since QValueVector manages memory dynamically, all iterators can become invalid if a memory reallocation occurs. For example, if some member of the vector is removed, iterators that point to the removed element and to all following elements become invalidated. Inserting into the middle of the vector will invalidate all iterators. For convenience, the function back() returns a reference to the last element in the vector, and front() returns a reference to the first element. If the vector is empty(), both back() and front() have undefined behavior (your application will crash or do unpredictable things). Use back() and front() with caution, for example: +It is safe to have multiple iterators on the vector at the same time. Since TQValueVector manages memory dynamically, all iterators can become invalid if a memory reallocation occurs. For example, if some member of the vector is removed, iterators that point to the removed element and to all following elements become invalidated. Inserting into the middle of the vector will invalidate all iterators. For convenience, the function back() returns a reference to the last element in the vector, and front() returns a reference to the first element. If the vector is empty(), both back() and front() have undefined behavior (your application will crash or do unpredictable things). Use back() and front() with caution, for example: .PP .nf .br - QValueVector<int> vec( 3 ); + TQValueVector<int> vec( 3 ); .br vec.push_back( 1 ); .br @@ -379,23 +379,23 @@ It is safe to have multiple iterators on the vector at the same time. Since QVal .br ... .br - QValueVector<double> dvec; + TQValueVector<double> dvec; .br double d = dvec.back(); // undefined behavior .br .fi .PP -Because QValueVector manages memory dynamically, it is recommended that you contruct a vector with an initial size. Inserting and removing elements happens fastest when: +Because TQValueVector manages memory dynamically, it is recommended that you contruct a vector with an initial size. Inserting and removing elements happens fastest when: .TP Inserting or removing elements happens at the end() of the vector; .TP The vector does not need to allocate additional memory. .PP -By creating a QValueVector with a sufficiently large initial size, there will be less memory allocations. Do not use an initial size that is too big, since it will still take time to construct all the empty entries, and the extra space will be wasted if it is never used. +By creating a TQValueVector with a sufficiently large initial size, there will be less memory allocations. Do not use an initial size that is too big, since it will still take time to construct all the empty entries, and the extra space will be wasted if it is never used. .PP -Because QValueVector is value-based there is no need to be careful about deleting elements in the vector. The vector holds its own copies and will free them if the corresponding member or the vector itself is deleted. You can force the vector to free all of its items with clear(). +Because TQValueVector is value-based there is no need to be careful about deleting elements in the vector. The vector holds its own copies and will free them if the corresponding member or the vector itself is deleted. You can force the vector to free all of its items with clear(). .PP -QValueVector is shared implicitly, which means it can be copied in constant time. If multiple QValueVector instances share the same data and one needs to modify its contents, this modifying instance makes a copy and modifies its private copy; it thus does not affect the other instances. This is often called "copy on write". If a QValueVector is being used in a multi-threaded program, you must protect all access to the vector. See QMutex. +TQValueVector is shared implicitly, which means it can be copied in constant time. If multiple TQValueVector instances share the same data and one needs to modify its contents, this modifying instance makes a copy and modifies its private copy; it thus does not affect the other instances. This is often called "copy on write". If a TQValueVector is being used in a multi-threaded program, you must protect all access to the vector. See QMutex. .PP There are several ways to insert elements into the vector. The push_back() function insert elements into the end of the vector, and is usually fastest. The insert() function can be used to add elements at specific positions within the vector. .PP @@ -407,7 +407,7 @@ Example: .PP .nf .br - QValueVector<int> v( 4 ); + TQValueVector<int> v( 4 ); .br v.push_back( 5 ); .br @@ -421,188 +421,188 @@ Example: .br .fi .PP -QValueVector stores its elements in contiguous memory. This means that you can use a QValueVector in any situation that requires an array. +TQValueVector stores its elements in contiguous memory. This means that you can use a TQValueVector in any situation that requires an array. .PP See also TQt Template Library Classes, Implicitly and Explicitly Shared Classes, and Non-GUI Classes. .SS "Member Type Documentation" -.SH "QValueVector::ConstIterator" +.SH "TQValueVector::ConstIterator" The vector's const iterator type. -.SH "QValueVector::Iterator" +.SH "TQValueVector::Iterator" The vector's iterator type. -.SH "QValueVector::ValueType" +.SH "TQValueVector::ValueType" The type of the object stored in the vector. -.SH "QValueVector::const_iterator" +.SH "TQValueVector::const_iterator" The vector's const iterator type. -.SH "QValueVector::const_pointer" +.SH "TQValueVector::const_pointer" The const pointer to T type. -.SH "QValueVector::const_reference" +.SH "TQValueVector::const_reference" The const reference to T type. -.SH "QValueVector::difference_type" +.SH "TQValueVector::difference_type" A signed integral type used to represent the distance between two iterators. -.SH "QValueVector::iterator" +.SH "TQValueVector::iterator" The vector's iterator type. -.SH "QValueVector::pointer" +.SH "TQValueVector::pointer" The pointer to T type. -.SH "QValueVector::reference" +.SH "TQValueVector::reference" The reference to T type. -.SH "QValueVector::size_type" +.SH "TQValueVector::size_type" An unsigned integral type, used to represent various sizes. -.SH "QValueVector::value_type" +.SH "TQValueVector::value_type" The type of the object stored in the vector. .SH MEMBER FUNCTION DOCUMENTATION -.SH "QValueVector::QValueVector ()" -Constructs an empty vector without any elements. To create a vector which reserves an initial amount of space for elements, use \fCQValueVector(size_type n)\fR. -.SH "QValueVector::QValueVector ( const QValueVector<T> & v )" +.SH "TQValueVector::TQValueVector ()" +Constructs an empty vector without any elements. To create a vector which reserves an initial amount of space for elements, use \fCTQValueVector(size_type n)\fR. +.SH "TQValueVector::TQValueVector ( const TQValueVector<T> & v )" Constructs a copy of \fIv\fR. .PP -This operation costs O(1) time because QValueVector is implicitly shared. +This operation costs O(1) time because TQValueVector is implicitly shared. .PP The first modification to the vector does takes O(n) time, because the elements must be copied. -.SH "QValueVector::QValueVector ( size_type n, const T & val = T ( ) )" +.SH "TQValueVector::TQValueVector ( size_type n, const T & val = T ( ) )" Constructs a vector with an initial size of \fIn\fR elements. Each element is initialized with the value of \fIval\fR. -.SH "QValueVector::QValueVector ( std::vector<T> & v )" +.SH "TQValueVector::TQValueVector ( std::vector<T> & v )" Constructs a copy of \fIv\fR. -.SH "QValueVector::QValueVector ( const std::vector<T> & v )" +.SH "TQValueVector::TQValueVector ( const std::vector<T> & v )" This operation costs O(n) time because \fIv\fR is copied. -.SH "QValueVector::~QValueVector ()" -Destroys the vector, destroying all elements and freeing the allocated memory. References to the values in the vector and all iterators of this vector become invalidated. Note that it is impossible for an iterator to check whether or not it is valid: QValueVector is tuned for performance, not for error checking. -.SH "void QValueVector::append ( const T & x )" +.SH "TQValueVector::~TQValueVector ()" +Destroys the vector, destroying all elements and freeing the allocated memory. References to the values in the vector and all iterators of this vector become invalidated. Note that it is impossible for an iterator to check whether or not it is valid: TQValueVector is tuned for performance, not for error checking. +.SH "void TQValueVector::append ( const T & x )" Appends a copy of \fIx\fR to the end of the vector. .PP See also push_back() and insert(). -.SH "reference QValueVector::at ( size_type i, bool * ok = 0 )" +.SH "reference TQValueVector::at ( size_type i, bool * ok = 0 )" Returns a reference to the element with index \fIi\fR. If \fIok\fR is non-null, and the index \fIi\fR is out of range, *\fIok\fR is set to FALSE and the returned reference is undefined. If the index \fIi\fR is within the range of the vector, and \fIok\fR is non-null, *\fIok\fR is set to TRUE and the returned reference is well defined. -.SH "const_reference QValueVector::at ( size_type i, bool * ok = 0 ) const" +.SH "const_reference TQValueVector::at ( size_type i, bool * ok = 0 ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const reference to the element with index \fIi\fR. If \fIok\fR is non-null, and the index \fIi\fR is out of range, *\fIok\fR is set to FALSE and the returned reference is undefined. If the index \fIi\fR is within the range of the vector, and \fIok\fR is non-null, *\fIok\fR is set to TRUE and the returned reference is well defined. -.SH "reference QValueVector::back ()" +.SH "reference TQValueVector::back ()" Returns a reference to the last element in the vector. If there is no last element, this function has undefined behavior. .PP See also empty() and front(). -.SH "const_reference QValueVector::back () const" +.SH "const_reference TQValueVector::back () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const reference to the last element in the vector. If there is no last element, this function has undefined behavior. .PP See also empty() and front(). -.SH "iterator QValueVector::begin ()" +.SH "iterator TQValueVector::begin ()" Returns an iterator pointing to the beginning of the vector. If the vector is empty(), the returned iterator will equal end(). -.SH "const_iterator QValueVector::begin () const" +.SH "const_iterator TQValueVector::begin () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const iterator pointing to the beginning of the vector. If the vector is empty(), the returned iterator will equal end(). -.SH "size_type QValueVector::capacity () const" +.SH "size_type TQValueVector::capacity () const" Returns the maximum number of elements that can be stored in the vector without forcing memory reallocation. If memory reallocation takes place, some or all iterators may become invalidated. -.SH "void QValueVector::clear ()" +.SH "void TQValueVector::clear ()" Removes all the elements from the vector. -.SH "const_iterator QValueVector::constBegin () const" +.SH "const_iterator TQValueVector::constBegin () const" Returns a const iterator pointing to the beginning of the vector. If the vector is empty(), the returned iterator will equal end(). .PP See also constEnd(). -.SH "const_iterator QValueVector::constEnd () const" +.SH "const_iterator TQValueVector::constEnd () const" Returns a const iterator pointing behind the last element of the vector. .PP See also constBegin(). -.SH "size_type QValueVector::count () const" +.SH "size_type TQValueVector::count () const" Returns the number of items in the vector. .PP See also isEmpty(). -.SH "bool QValueVector::empty () const" +.SH "bool TQValueVector::empty () const" Returns TRUE if the vector is empty; otherwise returns FALSE. Equivalent to size()==0, only faster. .PP This function is provided for STL compatibility. It is equivalent to isEmpty(). .PP See also size(). -.SH "iterator QValueVector::end ()" +.SH "iterator TQValueVector::end ()" Returns an iterator pointing behind the last element of the vector. -.SH "const_iterator QValueVector::end () const" +.SH "const_iterator TQValueVector::end () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const iterator pointing behind the last element of the vector. -.SH "iterator QValueVector::erase ( iterator pos )" +.SH "iterator TQValueVector::erase ( iterator pos )" Removes the element at position \fIpos\fR and returns the position of the next element. -.SH "iterator QValueVector::erase ( iterator first, iterator last )" +.SH "iterator TQValueVector::erase ( iterator first, iterator last )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Removes all elements from \fIfirst\fR up to but not including \fIlast\fR and returns the position of the next element. -.SH "reference QValueVector::first ()" +.SH "reference TQValueVector::first ()" Returns a reference to the first item in the vector. If there is no first item, this function has undefined behavior. .PP See also empty() and last(). -.SH "const_reference QValueVector::first () const" +.SH "const_reference TQValueVector::first () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "reference QValueVector::front ()" +.SH "reference TQValueVector::front ()" Returns a reference to the first element in the vector. If there is no first element, this function has undefined behavior. .PP See also empty() and back(). -.SH "const_reference QValueVector::front () const" +.SH "const_reference TQValueVector::front () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const reference to the first element in the vector. If there is no first element, this function has undefined behavior. .PP See also empty() and back(). -.SH "iterator QValueVector::insert ( iterator pos, const T & x )" +.SH "iterator TQValueVector::insert ( iterator pos, const T & x )" Inserts a copy of \fIx\fR at the position immediately before \fIpos\fR. .PP See also push_back(). -.SH "iterator QValueVector::insert ( iterator pos, size_type n, const T & x )" +.SH "iterator TQValueVector::insert ( iterator pos, size_type n, const T & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Inserts \fIn\fR copies of \fIx\fR immediately before position x. .PP See also push_back(). -.SH "bool QValueVector::isEmpty () const" +.SH "bool TQValueVector::isEmpty () const" Returns TRUE if the vector is empty; returns FALSE otherwise. .PP See also count(). -.SH "reference QValueVector::last ()" +.SH "reference TQValueVector::last ()" Returns a reference to the last item in the vector. If there is no last item, this function has undefined behavior. .PP See also empty() and first(). -.SH "const_reference QValueVector::last () const" +.SH "const_reference TQValueVector::last () const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. -.SH "QValueVector<T> & QValueVector::operator= ( const QValueVector<T> & v )" +.SH "TQValueVector<T> & TQValueVector::operator= ( const TQValueVector<T> & v )" Assigns \fIv\fR to this vector and returns a reference to this vector. .PP -All iterators of the current vector become invalidated by this operation. The cost of such an assignment is O(1) since QValueVector is implicitly shared. -.SH "QValueVector<T> & QValueVector::operator= ( const std::vector<T> & v )" +All iterators of the current vector become invalidated by this operation. The cost of such an assignment is O(1) since TQValueVector is implicitly shared. +.SH "TQValueVector<T> & TQValueVector::operator= ( const std::vector<T> & v )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Assigns \fIv\fR to this vector and returns a reference to this vector. .PP All iterators of the current vector become invalidated by this operation. The cost of this assignment is O(n) since \fIv\fR is copied. -.SH "bool QValueVector::operator== ( const QValueVector<T> & x ) const" +.SH "bool TQValueVector::operator== ( const TQValueVector<T> & x ) const" Returns TRUE if each element in this vector equals each corresponding element in \fIx\fR; otherwise returns FALSE. -.SH "bool QValueVector::operator== ( const QValueVector<T> & x )" +.SH "bool TQValueVector::operator== ( const TQValueVector<T> & x )" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns TRUE if each element in this vector equals each corresponding element in \fIx\fR; otherwise returns FALSE. -.SH "reference QValueVector::operator[] ( size_type i )" +.SH "reference TQValueVector::operator[] ( size_type i )" Returns a reference to the element at index \fIi\fR. If \fIi\fR is out of range, this function has undefined behavior. .PP See also at(). -.SH "const_reference QValueVector::operator[] ( size_type i ) const" +.SH "const_reference TQValueVector::operator[] ( size_type i ) const" This is an overloaded member function, provided for convenience. It behaves essentially like the above function. .PP Returns a const reference to the element at index \fIi\fR. If \fIi\fR is out of range, this function has undefined behavior. .PP See also at(). -.SH "void QValueVector::pop_back ()" +.SH "void TQValueVector::pop_back ()" Removes the last item from the vector. .PP This function is provided for STL compatibility. -.SH "void QValueVector::push_back ( const T & x )" +.SH "void TQValueVector::push_back ( const T & x )" Appends a copy of \fIx\fR to the end of the vector. This is the fastest way to add new elements. .PP This function is provided for STL compatibility. It is equivalent to append(). .PP See also insert(). -.SH "void QValueVector::reserve ( size_type n )" +.SH "void TQValueVector::reserve ( size_type n )" Increases the vector's capacity. If \fIn\fR is less than or equal to capacity(), nothing happens. Otherwise, additional memory is allocated so that capacity() will be increased to a value greater than or equal to \fIn\fR. All iterators will then become invalidated. Note that the vector's size() and the values of existing elements remain unchanged. -.SH "void QValueVector::resize ( size_type n, const T & val = T ( ) )" +.SH "void TQValueVector::resize ( size_type n, const T & val = T ( ) )" Changes the size of the vector to \fIn\fR. If \fIn\fR is greater than the current size(), elements are added to the end and initialized with the value of \fIval\fR. If \fIn\fR is less than size(), elements are removed from the end. If \fIn\fR is equal to size() nothing happens. -.SH "size_type QValueVector::size () const" +.SH "size_type TQValueVector::size () const" Returns the number of elements in the vector. .PP This function is provided for STL compatibility. It is equivalent to count(). @@ -610,7 +610,7 @@ This function is provided for STL compatibility. It is equivalent to count(). See also empty(). .SH "SEE ALSO" -.BR http://doc.trolltech.com/ntqvaluevector.html +.BR http://doc.trolltech.com/tqvaluevector.html .BR http://www.trolltech.com/faq/tech.html .SH COPYRIGHT Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the 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<QVariant> & val )" +.BI "\fBQVariant\fR ( const TQValueList<QVariant> & val )" .br .ti -1c -.BI "\fBQVariant\fR ( const QMap<TQString, QVariant> & val )" +.BI "\fBQVariant\fR ( const TQMap<TQString, QVariant> & 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<QVariant> \fBtoList\fR () const" +.BI "const TQValueList<QVariant> \fBtoList\fR () const" .br .ti -1c -.BI "const QMap<TQString, QVariant> \fBtoMap\fR () const" +.BI "const TQMap<TQString, QVariant> \fBtoMap\fR () const" .br .ti -1c .BI "QSizePolicy \fBtoSizePolicy\fR () const" .br .ti -1c -.BI "QValueListConstIterator<TQString> stringListBegin () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator<TQString> stringListBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator<TQString> stringListEnd () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator<TQString> stringListEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator<QVariant> listBegin () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator<QVariant> listBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QValueListConstIterator<QVariant> listEnd () const \fI(obsolete)\fR" +.BI "TQValueListConstIterator<QVariant> listEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator<TQString, QVariant> mapBegin () const \fI(obsolete)\fR" +.BI "TQMapConstIterator<TQString, QVariant> mapBegin () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator<TQString, QVariant> mapEnd () const \fI(obsolete)\fR" +.BI "TQMapConstIterator<TQString, QVariant> mapEnd () const \fI(obsolete)\fR" .br .ti -1c -.BI "QMapConstIterator<TQString, QVariant> mapFind ( const TQString & key ) const \fI(obsolete)\fR" +.BI "TQMapConstIterator<TQString, QVariant> 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<QVariant> & \fBasList\fR ()" +.BI "TQValueList<QVariant> & \fBasList\fR ()" .br .ti -1c -.BI "QMap<TQString, QVariant> & \fBasMap\fR ()" +.BI "TQMap<TQString, QVariant> & \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 QValueList<QVariant>s and QMap<TQString,QVariant>s 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 TQValueList<QVariant>s and TQMap<TQString,QVariant>s 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<QVariant> +\fCQVariant::List\fR - a TQValueList<QVariant> .TP \fCQVariant::LongLong\fR - a long long .TP \fCQVariant::ULongLong\fR - an unsigned long long .TP -\fCQVariant::Map\fR - a QMap<TQString,QVariant> +\fCQVariant::Map\fR - a TQMap<TQString,QVariant> .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<QVariant> & val )" +.SH "QVariant::QVariant ( const TQValueList<QVariant> & val )" Constructs a new variant with a list value, \fIval\fR. -.SH "QVariant::QVariant ( const QMap<TQString, QVariant> & val )" +.SH "QVariant::QVariant ( const TQMap<TQString, QVariant> & 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> & QVariant::asList ()" +.SH "TQValueList<QVariant> & 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<QVariant> list = myVariant.asList(); + TQValueList<QVariant> list = myVariant.asList(); .br - QValueList<QVariant>::Iterator it = list.begin(); + TQValueList<QVariant>::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<TQString, QVariant> & QVariant::asMap ()" +.SH "TQMap<TQString, QVariant> & 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<TQString, QVariant> map = myVariant.asMap(); + TQMap<TQString, QVariant> map = myVariant.asMap(); .br - QMap<TQString, QVariant>::Iterator it = map.begin(); + TQMap<TQString, QVariant>::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> QVariant::listBegin () const" +.SH "TQValueListConstIterator<QVariant> 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> QVariant::listEnd () const" +.SH "TQValueListConstIterator<QVariant> 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<TQString, QVariant> QVariant::mapBegin () const" +.SH "TQMapConstIterator<TQString, QVariant> 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<TQString, QVariant> QVariant::mapEnd () const" +.SH "TQMapConstIterator<TQString, QVariant> 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<TQString, QVariant> QVariant::mapFind ( const TQString & key ) const" +.SH "TQMapConstIterator<TQString, QVariant> 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<TQString> QVariant::stringListBegin () const" +.SH "TQValueListConstIterator<TQString> 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<TQString> QVariant::stringListEnd () const" +.SH "TQValueListConstIterator<TQString> 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> QVariant::toList () const" -Returns the variant as a QValueList<QVariant> if the variant has type() List or StringList; otherwise returns an empty list. +.SH "const TQValueList<QVariant> QVariant::toList () const" +Returns the variant as a TQValueList<QVariant> 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<QVariant> list = myVariant.toList(); + TQValueList<QVariant> list = myVariant.toList(); .br - QValueList<QVariant>::Iterator it = list.begin(); + TQValueList<QVariant>::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<TQString, QVariant> QVariant::toMap () const" -Returns the variant as a QMap<TQString,QVariant> if the variant has type() Map; otherwise returns an empty map. +.SH "const TQMap<TQString, QVariant> QVariant::toMap () const" +Returns the variant as a TQMap<TQString,QVariant> 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<TQString, QVariant> map = myVariant.toMap(); + TQMap<TQString, QVariant> map = myVariant.toMap(); .br - QMap<TQString, QVariant>::Iterator it = map.begin(); + TQMap<TQString, QVariant>::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<QVariant>". 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<QVariant>". 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. |