.BI "\fBQValueListIterator\fR ( const QValueListIterator<T> & it )"
.br
.ti -1c
.BI "bool \fBoperator==\fR ( const QValueListIterator<T> & it ) const"
.br
.ti -1c
.BI "bool \fBoperator!=\fR ( const QValueListIterator<T> & it ) const"
.br
.ti -1c
.BI "const T & \fBoperator*\fR () const"
.br
.ti -1c
.BI "T & \fBoperator*\fR ()"
.br
.ti -1c
.BI "QValueListIterator<T> & \fBoperator++\fR ()"
.br
.ti -1c
.BI "QValueListIterator<T> \fBoperator++\fR ( int )"
.br
.ti -1c
.BI "QValueListIterator<T> & \fBoperator--\fR ()"
.br
.ti -1c
.BI "QValueListIterator<T> \fBoperator--\fR ( int )"
.br
.ti -1c
.BI "QValueListIterator<T> & \fBoperator+=\fR ( int j )"
.br
.ti -1c
.BI "QValueListIterator<T> & \fBoperator-=\fR ( int j )"
.br
.in -1c
.SH DESCRIPTION
The QValueListIterator class provides an iterator for QValueList.
.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.
.PP
The only way to access the items in a QValueList is to use an iterator.
.PP
Example (see QValueList for the complete code):
.PP
.nf
.br
EmployeeList::iterator it;
.br
for ( it = list.begin(); it != list.end(); ++it )
.br
cout << (*it).surname().latin1() << ", " <<
.br
(*it).forename().latin1() << " earns " <<
.br
(*it).salary() << endl;
.br
.br
// Output:
.br
// Doe, John earns 50000
.br
// Williams, Jane earns 80000
.br
// Hawthorne, Mary earns 90000
.br
// Jones, Tom earns 60000
.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.
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.
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.
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 )"
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 )"
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.
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 )"
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 )"
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"
Compares this iterator and \fIit\fR and returns TRUE if they point to
