1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
'\" t
.TH TQDictIterator 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
TQDictIterator \- Iterator for TQDict collections
.SH SYNOPSIS
\fC#include <tqdict.h>\fR
.PP
.SS "Public Members"
.in +1c
.ti -1c
.BI "\fBTQDictIterator\fR ( const TQDict<type> & dict )"
.br
.ti -1c
.BI "\fB~TQDictIterator\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 "TQString \fBcurrentKey\fR () const"
.br
.ti -1c
.BI "type * \fBoperator()\fR ()"
.br
.ti -1c
.BI "type * \fBoperator++\fR ()"
.br
.in -1c
.SH DESCRIPTION
The TQDictIterator class provides an iterator for TQDict collections.
.PP
TQDictIterator is implemented as a template class. Define a template instance TQDictIterator<X> to create a dictionary iterator that operates on TQDict<X> (dictionary of X*).
.PP
The traversal order is arbitrary; when we speak of the "first"," last" and "next" item we are talking in terms of this arbitrary order.
.PP
Multiple iterators may independently traverse the same dictionary. A TQDict knows about all the iterators that are operating on the dictionary. When an item is removed from the dictionary, TQDict updates all iterators that are referring to the removed item to point to the next item in the (arbitrary) traversal order.
.PP
Example:
.PP
.nf
.br
TQDict<TQLineEdit> fields;
.br
fields.insert( "forename", new TQLineEdit( this ) );
.br
fields.insert( "surname", new TQLineEdit( this ) );
.br
fields.insert( "age", new TQLineEdit( this ) );
.br
.br
fields["forename"]->setText( "Homer" );
.br
fields["surname"]->setText( "Simpson" );
.br
fields["age"]->setText( "45" );
.br
.br
TQDictIterator<TQLineEdit> it( fields );
.br
for( ; it.current(); ++it )
.br
cout << it.currentKey() << ": " << it.current()->text() << endl;
.br
cout << endl;
.br
.br
// Output (random order):
.br
// age: 45
.br
// surname: Simpson
.br
// forename: Homer
.br
.fi
In the example we insert some pointers to line edits into a dictionary, then iterate over the dictionary printing the strings associated with the line edits.
.PP
See also TQDict, Collection Classes, and Non-GUI Classes.
.SH MEMBER FUNCTION DOCUMENTATION
.SH "TQDictIterator::TQDictIterator ( const TQDict<type> & dict )"
Constructs an iterator for \fIdict\fR. The current iterator item is set to point to the first item in the dictionary, \fIdict\fR. First in this context means first in the arbitrary traversal order.
.SH "TQDictIterator::~TQDictIterator ()"
Destroys the iterator.
.SH "uint TQDictIterator::count () const"
Returns the number of items in the dictionary over which the iterator is operating.
.PP
See also isEmpty().
.SH "type * TQDictIterator::current () const"
Returns a pointer to the current iterator item's value.
.SH "TQString TQDictIterator::currentKey () const"
Returns the current iterator item's key.
.SH "bool TQDictIterator::isEmpty () const"
Returns TRUE if the dictionary is empty, i.e. count() == 0; otherwise returns FALSE.
.PP
See also count().
.SH "TQDictIterator::operator type * () const"
Cast operator. Returns a pointer to the current iterator item. Same as current().
.SH "type * TQDictIterator::operator() ()"
Makes the next 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 * TQDictIterator::operator++ ()"
Prefix ++ makes the next 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 * TQDictIterator::toFirst ()"
Resets the iterator, making the first item the first current item. First in this context means first in the arbitrary traversal order. Returns a pointer to this item.
.PP
If the dictionary is empty it sets the current item to 0 and
returns 0.
.SH "SEE ALSO"
.BR http://doc.trolltech.com/tqdictiterator.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 [email protected] .
Please include the name of the manual page (tqdictiterator.3qt) and the Qt
version (3.3.8).
|
