You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
169 lines
5.3 KiB
169 lines
5.3 KiB
'\" t
|
|
.TH TQPtrDictIterator 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.
|
|
.\"
|
|
.ad l
|
|
.nh
|
|
.SH NAME
|
|
TQPtrDictIterator \- Iterator for TQPtrDict collections
|
|
.SH SYNOPSIS
|
|
\fC#include <tqptrdict.h>\fR
|
|
.PP
|
|
.SS "Public Members"
|
|
.in +1c
|
|
.ti -1c
|
|
.BI "\fBTQPtrDictIterator\fR ( const TQPtrDict<type> & dict )"
|
|
.br
|
|
.ti -1c
|
|
.BI "\fB~TQPtrDictIterator\fR ()"
|
|
.br
|
|
.ti -1c
|
|
.BI "uint \fBcount\fR () const"
|
|
.br
|
|
.ti -1c
|
|
.BI "bool \fBisEmpty\fR () const"
|
|
.br
|
|
.ti -1c
|
|
.BI "type * \fBtoFirst\fR ()"
|
|
.br
|
|
.ti -1c
|
|
.BI "\fBoperator type *\fR () const"
|
|
.br
|
|
.ti -1c
|
|
.BI "type * \fBcurrent\fR () const"
|
|
.br
|
|
.ti -1c
|
|
.BI "void * \fBcurrentKey\fR () const"
|
|
.br
|
|
.ti -1c
|
|
.BI "type * \fBoperator()\fR ()"
|
|
.br
|
|
.ti -1c
|
|
.BI "type * \fBoperator++\fR ()"
|
|
.br
|
|
.ti -1c
|
|
.BI "type * \fBoperator+=\fR ( uint jump )"
|
|
.br
|
|
.in -1c
|
|
.SH DESCRIPTION
|
|
The TQPtrDictIterator class provides an iterator for TQPtrDict collections.
|
|
.PP
|
|
TQPtrDictIterator is implemented as a template class. Define a template instance TQPtrDictIterator<X> to create a dictionary iterator that operates on TQPtrDict<X> (dictionary of X*).
|
|
.PP
|
|
Example:
|
|
.PP
|
|
.nf
|
|
.br
|
|
TQPtrDict<char> fields;
|
|
.br
|
|
.br
|
|
TQLineEdit *le1 = new TQLineEdit( this );
|
|
.br
|
|
le1->setText( "Simpson" );
|
|
.br
|
|
TQLineEdit *le2 = new TQLineEdit( this );
|
|
.br
|
|
le2->setText( "Homer" );
|
|
.br
|
|
TQLineEdit *le3 = new TQLineEdit( this );
|
|
.br
|
|
le3->setText( "45" );
|
|
.br
|
|
.br
|
|
fields.insert( le1, "Surname" );
|
|
.br
|
|
fields.insert( le2, "Forename" );
|
|
.br
|
|
fields.insert( le3, "Age" );
|
|
.br
|
|
.br
|
|
TQPtrDictIterator<char> it( fields );
|
|
.br
|
|
for( ; it.current(); ++it ) {
|
|
.br
|
|
TQLineEdit *le = (TQLineEdit)it.currentKey();
|
|
.br
|
|
cout << it.current() << ": " << le->text() << endl;
|
|
.br
|
|
}
|
|
.br
|
|
cout << endl;
|
|
.br
|
|
.br
|
|
// Output (random order):
|
|
.br
|
|
// Forename: Homer
|
|
.br
|
|
// Age: 45
|
|
.br
|
|
// Surname: Simpson
|
|
.br
|
|
.fi
|
|
In the example we insert some line edits into a dictionary, associating a string with each. We then iterate over the dictionary printing the associated strings.
|
|
.PP
|
|
Multiple iterators may independently traverse the same dictionary. A TQPtrDict knows about all the iterators that are operating on the dictionary. When an item is removed from the dictionary, TQPtrDict updates all iterators that refer the removed item to point to the next item in the traversing order.
|
|
.PP
|
|
See also TQPtrDict, Collection Classes, and Non-GUI Classes.
|
|
.SH MEMBER FUNCTION DOCUMENTATION
|
|
.SH "TQPtrDictIterator::TQPtrDictIterator ( const TQPtrDict<type> & dict )"
|
|
Constructs an iterator for \fIdict\fR. The current iterator item is set to point on the first item in the \fIdict\fR.
|
|
.SH "TQPtrDictIterator::~TQPtrDictIterator ()"
|
|
Destroys the iterator.
|
|
.SH "uint TQPtrDictIterator::count () const"
|
|
Returns the number of items in the dictionary this iterator operates on.
|
|
.PP
|
|
See also isEmpty().
|
|
.SH "type * TQPtrDictIterator::current () const"
|
|
Returns a pointer to the current iterator item's value.
|
|
.SH "void * TQPtrDictIterator::currentKey () const"
|
|
Returns the current iterator item's key.
|
|
.SH "bool TQPtrDictIterator::isEmpty () const"
|
|
Returns TRUE if the dictionary is empty; otherwise returns FALSE.
|
|
.PP
|
|
See also count().
|
|
.SH "TQPtrDictIterator::operator type * () const"
|
|
Cast operator. Returns a pointer to the current iterator item. Same as current().
|
|
.SH "type * TQPtrDictIterator::operator() ()"
|
|
Makes the succeeding item current and returns the original current item.
|
|
.PP
|
|
If the current iterator item was the last item in the dictionary or if it was 0, 0 is returned.
|
|
.SH "type * TQPtrDictIterator::operator++ ()"
|
|
Prefix ++ makes the succeeding item current and returns the new current item.
|
|
.PP
|
|
If the current iterator item was the last item in the dictionary or if it was 0, 0 is returned.
|
|
.SH "type * TQPtrDictIterator::operator+= ( uint jump )"
|
|
Sets the current item to the item \fIjump\fR positions after the current item and returns a pointer to that item.
|
|
.PP
|
|
If that item is beyond the last item or if the dictionary is empty, it sets the current item to 0 and returns 0.
|
|
.SH "type * TQPtrDictIterator::toFirst ()"
|
|
Sets the current iterator item to point to the first item in the
|
|
dictionary and returns a pointer to the item. If the dictionary is
|
|
empty, it sets the current item to 0 and returns 0.
|
|
|
|
.SH "SEE ALSO"
|
|
.BR http://doc.trolltech.com/tqptrdictiterator.html
|
|
.BR http://www.trolltech.com/faq/tech.html
|
|
.SH COPYRIGHT
|
|
Copyright 1992-2007 Trolltech ASA, http://www.trolltech.com. See the
|
|
license file included in the distribution for a complete license
|
|
statement.
|
|
.SH AUTHOR
|
|
Generated automatically from the source code.
|
|
.SH BUGS
|
|
If you find a bug in Qt, please report it as described in
|
|
.BR http://doc.trolltech.com/bughowto.html .
|
|
Good bug reports help us to help you. Thank you.
|
|
.P
|
|
The definitive TQt documentation is provided in HTML format; it is
|
|
located at $TQTDIR/doc/html and can be read using TQt Assistant or with
|
|
a web browser. This man page is provided as a convenience for those
|
|
users who prefer man pages, although this format is not officially
|
|
supported by Trolltech.
|
|
.P
|
|
If you find errors in this manual page, please report them to
|
|
.BR qt-bugs@trolltech.com .
|
|
Please include the name of the manual page (tqptrdictiterator.3qt) and the Qt
|
|
version (3.3.8).
|