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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en_US" lang="en_US">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<!-- qhash.cpp -->
<title>Qt 4.8: iterator Class Reference</title>
<link rel="stylesheet" type="text/css" href="style/offline.css" />
</head>
<body>
<div class="header" id="qtdocheader">
<div class="content">
<a href="index.html" class="qtref"><span>Qt Reference Documentation</span></a>
</div>
<div class="breadcrumb toolblock">
<ul>
<li class="first"><a href="index.html">Home</a></li>
<!-- Breadcrumbs go here -->
<li><a href="modules.html">Modules</a></li>
<li><a href="qtcore.html">QtCore</a></li>
<li>iterator</li>
</ul>
</div>
</div>
<div class="content mainContent">
<div class="toc">
<h3><a name="toc">Contents</a></h3>
<ul>
<li class="level1"><a href="#public-functions">Public Functions</a></li>
<li class="level1"><a href="#details">Detailed Description</a></li>
</ul>
</div>
<h1 class="title">iterator Class Reference</h1>
<span class="small-subtitle">(QHash::iterator)<br/></span>
<!-- $$$iterator-brief -->
<p>The QHash::iterator class provides an STL-style non-const iterator for <a href="qhash.html">QHash</a> and <a href="qmultihash.html">QMultiHash</a>. <a href="#details">More...</a></p>
<!-- @@@iterator -->
<pre class="cpp"> <span class="preprocessor">#include <<a href="qhash.html">QHash</a>></span></pre><ul>
<li><a href="qhash-iterator-members.html">List of all members, including inherited members</a></li>
</ul>
<a name="public-functions"></a>
<h2>Public Functions</h2>
<table class="alignedsummary">
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#iterator">iterator</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const Key & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#key">key</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#value">value</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-not-eq">operator!=</a></b> ( const iterator & <i>other</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-not-eq-2">operator!=</a></b> ( const const_iterator & <i>other</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-2a">operator*</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-2b">operator+</a></b> ( int <i>j</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-2b-2b">operator++</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-2b-2b-2">operator++</a></b> ( int )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-2b-eq">operator+=</a></b> ( int <i>j</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-">operator-</a></b> ( int <i>j</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator--">operator--</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator---2">operator--</a></b> ( int )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> iterator & </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator--eq">operator-=</a></b> ( int <i>j</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T * </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator--gt">operator-></a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-eq-eq">operator==</a></b> ( const iterator & <i>other</i> ) const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qhash-iterator.html#operator-eq-eq-2">operator==</a></b> ( const const_iterator & <i>other</i> ) const</td></tr>
</table>
<a name="details"></a>
<!-- $$$iterator-description -->
<div class="descr">
<h2>Detailed Description</h2>
<p>The QHash::iterator class provides an STL-style non-const iterator for <a href="qhash.html">QHash</a> and <a href="qmultihash.html">QMultiHash</a>.</p>
<p><a href="qhash.html">QHash</a> features both <a href="containers.html#stl-style-iterators">STL-style iterators</a> and <a href="containers.html#java-style-iterators">Java-style iterators</a>. The STL-style iterators are more low-level and more cumbersome to use; on the other hand, they are slightly faster and, for developers who already know STL, have the advantage of familiarity.</p>
<p><a href="qhash.html">QHash</a><Key, T>::iterator allows you to iterate over a <a href="qhash.html">QHash</a> (or <a href="qmultihash.html">QMultiHash</a>) and to modify the value (but not the key) associated with a particular key. If you want to iterate over a const <a href="qhash.html">QHash</a>, you should use <a href="qhash-const-iterator.html">QHash::const_iterator</a>. It is generally good practice to use <a href="qhash-const-iterator.html">QHash::const_iterator</a> on a non-const <a href="qhash.html">QHash</a> as well, unless you need to change the <a href="qhash.html">QHash</a> through the iterator. Const iterators are slightly faster, and can improve code readability.</p>
<p>The default QHash::iterator constructor creates an uninitialized iterator. You must initialize it using a <a href="qhash.html">QHash</a> function like <a href="qhash.html#begin">QHash::begin</a>(), <a href="qhash.html#end">QHash::end</a>(), or <a href="qhash.html#find">QHash::find</a>() before you can start iterating. Here's a typical loop that prints all the (key, value) pairs stored in a hash:</p>
<pre class="cpp"> <span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span> hash;
hash<span class="operator">.</span><a href="qhash.html#insert">insert</a>(<span class="string">"January"</span><span class="operator">,</span> <span class="number">1</span>);
hash<span class="operator">.</span><a href="qhash.html#insert">insert</a>(<span class="string">"February"</span><span class="operator">,</span> <span class="number">2</span>);
<span class="operator">.</span><span class="operator">.</span><span class="operator">.</span>
hash<span class="operator">.</span><a href="qhash.html#insert">insert</a>(<span class="string">"December"</span><span class="operator">,</span> <span class="number">12</span>);
<span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span><span class="operator">::</span>iterator i;
<span class="keyword">for</span> (i <span class="operator">=</span> hash<span class="operator">.</span>begin(); i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end(); <span class="operator">+</span><span class="operator">+</span>i)
cout <span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span><a href="qhash-iterator.html#key">key</a>() <span class="operator"><</span><span class="operator"><</span> <span class="string">": "</span> <span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span><a href="qhash-iterator.html#value">value</a>() <span class="operator"><</span><span class="operator"><</span> endl;</pre>
<p>Unlike <a href="qmap.html">QMap</a>, which orders its items by key, <a href="qhash.html">QHash</a> stores its items in an arbitrary order. The only guarantee is that items that share the same key (because they were inserted using <a href="qhash.html#insertMulti">QHash::insertMulti</a>()) will appear consecutively, from the most recently to the least recently inserted value.</p>
<p>Let's see a few examples of things we can do with a QHash::iterator that we cannot do with a <a href="qhash-const-iterator.html">QHash::const_iterator</a>. Here's an example that increments every value stored in the <a href="qhash.html">QHash</a> by 2:</p>
<pre class="cpp"> <span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span><span class="operator">::</span>iterator i;
<span class="keyword">for</span> (i <span class="operator">=</span> hash<span class="operator">.</span>begin(); i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end(); <span class="operator">+</span><span class="operator">+</span>i)
i<span class="operator">.</span><a href="qhash-iterator.html#value">value</a>() <span class="operator">+</span><span class="operator">=</span> <span class="number">2</span>;</pre>
<p>Here's an example that removes all the items whose key is a string that starts with an underscore character:</p>
<pre class="cpp"> <span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span><span class="operator">::</span>iterator i <span class="operator">=</span> hash<span class="operator">.</span><a href="qhash.html#begin">begin</a>();
<span class="keyword">while</span> (i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end()) {
<span class="keyword">if</span> (i<span class="operator">.</span>key()<span class="operator">.</span>startsWith(<span class="string">"_"</span>))
i <span class="operator">=</span> hash<span class="operator">.</span>erase(i);
<span class="keyword">else</span>
<span class="operator">+</span><span class="operator">+</span>i;
}</pre>
<p>The call to <a href="qhash.html#erase">QHash::erase</a>() removes the item pointed to by the iterator from the hash, and returns an iterator to the next item. Here's another way of removing an item while iterating:</p>
<pre class="cpp"> <span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span><span class="operator">::</span>iterator i <span class="operator">=</span> hash<span class="operator">.</span><a href="qhash.html#begin">begin</a>();
<span class="keyword">while</span> (i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end()) {
<span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type">int</span><span class="operator">></span><span class="operator">::</span>iterator prev <span class="operator">=</span> i;
<span class="operator">+</span><span class="operator">+</span>i;
<span class="keyword">if</span> (prev<span class="operator">.</span>key()<span class="operator">.</span>startsWith(<span class="string">"_"</span>))
hash<span class="operator">.</span>erase(prev);
}</pre>
<p>It might be tempting to write code like this:</p>
<pre class="cpp"> <span class="comment">// WRONG</span>
<span class="keyword">while</span> (i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end()) {
<span class="keyword">if</span> (i<span class="operator">.</span>key()<span class="operator">.</span>startsWith(<span class="string">"_"</span>))
hash<span class="operator">.</span>erase(i);
<span class="operator">+</span><span class="operator">+</span>i;
}</pre>
<p>However, this will potentially crash in <tt>++i</tt>, because <tt>i</tt> is a dangling iterator after the call to <a href="qhash.html#erase">erase</a>().</p>
<p>Multiple iterators can be used on the same hash. However, be aware that any modification performed directly on the <a href="qhash.html">QHash</a> has the potential of dramatically changing the order in which the items are stored in the hash, as they might cause <a href="qhash.html">QHash</a> to rehash its internal data structure. There is one notable exception: <a href="qhash.html#erase">QHash::erase</a>(). This function can safely be called while iterating, and won't affect the order of items in the hash. If you need to keep iterators over a long period of time, we recommend that you use <a href="qmap.html">QMap</a> rather than <a href="qhash.html">QHash</a>.</p>
</div>
<p><b>See also </b><a href="qhash-const-iterator.html">QHash::const_iterator</a> and <a href="qmutablehashiterator.html">QMutableHashIterator</a>.</p>
<!-- @@@iterator -->
<div class="func">
<h2>Member Function Documentation</h2>
<!-- $$$iterator[overload1]$$$iterator -->
<h3 class="fn"><a name="iterator"></a>iterator::<span class="name">iterator</span> ()</h3>
<p>Constructs an uninitialized iterator.</p>
<p>Functions like <a href="qhash-iterator.html#key">key</a>(), <a href="qhash-iterator.html#value">value</a>(), and operator++() must not be called on an uninitialized iterator. Use operator=() to assign a value to it before using it.</p>
<p><b>See also </b><a href="qhash.html#begin">QHash::begin</a>() and <a href="qhash.html#end">QHash::end</a>().</p>
<!-- @@@iterator -->
<!-- $$$key[overload1]$$$key -->
<h3 class="fn"><a name="key"></a>const <span class="type">Key</span> & iterator::<span class="name">key</span> () const</h3>
<p>Returns the current item's key as a const reference.</p>
<p>There is no direct way of changing an item's key through an iterator, although it can be done by calling <a href="qhash.html#erase">QHash::erase</a>() followed by <a href="qhash.html#insert">QHash::insert</a>() or <a href="qhash.html#insertMulti">QHash::insertMulti</a>().</p>
<p><b>See also </b><a href="qhash-iterator.html#value">value</a>().</p>
<!-- @@@key -->
<!-- $$$value[overload1]$$$value -->
<h3 class="fn"><a name="value"></a><span class="type">T</span> & iterator::<span class="name">value</span> () const</h3>
<p>Returns a modifiable reference to the current item's value.</p>
<p>You can change the value of an item by using value() on the left side of an assignment, for example:</p>
<pre class="cpp"> <span class="keyword">if</span> (i<span class="operator">.</span>key() <span class="operator">=</span><span class="operator">=</span> <span class="string">"Hello"</span>)
i<span class="operator">.</span>value() <span class="operator">=</span> <span class="string">"Bonjour"</span>;</pre>
<p><b>See also </b><a href="qhash-iterator.html#key">key</a>() and <a href="qhash-iterator.html#operator-2a">operator*</a>().</p>
<!-- @@@value -->
<!-- $$$operator!=[overload1]$$$operator!=constiterator& -->
<h3 class="fn"><a name="operator-not-eq"></a><span class="type">bool</span> iterator::<span class="name">operator!=</span> ( const <span class="type">iterator</span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> points to a different item than this iterator; otherwise returns false.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-eq-eq">operator==</a>().</p>
<!-- @@@operator!= -->
<!-- $$$operator!=$$$operator!=constconst_iterator& -->
<h3 class="fn"><a name="operator-not-eq-2"></a><span class="type">bool</span> iterator::<span class="name">operator!=</span> ( const <span class="type"><a href="qhash-const-iterator.html">const_iterator</a></span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> points to a different item than this iterator; otherwise returns false.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-eq-eq">operator==</a>().</p>
<!-- @@@operator!= -->
<!-- $$$operator*[overload1]$$$operator* -->
<h3 class="fn"><a name="operator-2a"></a><span class="type">T</span> & iterator::<span class="name">operator*</span> () const</h3>
<p>Returns a modifiable reference to the current item's value.</p>
<p>Same as <a href="qhash-iterator.html#value">value</a>().</p>
<p><b>See also </b><a href="qhash-iterator.html#key">key</a>().</p>
<!-- @@@operator* -->
<!-- $$$operator+[overload1]$$$operator+int -->
<h3 class="fn"><a name="operator-2b"></a><span class="type">iterator</span> iterator::<span class="name">operator+</span> ( <span class="type">int</span> <i>j</i> ) const</h3>
<p>Returns an iterator to the item at <i>j</i> positions forward from this iterator. (If <i>j</i> is negative, the iterator goes backward.)</p>
<p>This operation can be slow for large <i>j</i> values.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-">operator-</a>().</p>
<!-- @@@operator+ -->
<!-- $$$operator++[overload1]$$$operator++ -->
<h3 class="fn"><a name="operator-2b-2b"></a><span class="type">iterator</span> & iterator::<span class="name">operator++</span> ()</h3>
<p>The prefix ++ operator (<tt>++i</tt>) advances the iterator to the next item in the hash and returns an iterator to the new current item.</p>
<p>Calling this function on <a href="qhash.html#end">QHash::end</a>() leads to undefined results.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator--">operator--</a>().</p>
<!-- @@@operator++ -->
<!-- $$$operator++$$$operator++int -->
<h3 class="fn"><a name="operator-2b-2b-2"></a><span class="type">iterator</span> iterator::<span class="name">operator++</span> ( <span class="type">int</span> )</h3>
<p>This is an overloaded function.</p>
<p>The postfix ++ operator (<tt>i++</tt>) advances the iterator to the next item in the hash and returns an iterator to the previously current item.</p>
<!-- @@@operator++ -->
<!-- $$$operator+=[overload1]$$$operator+=int -->
<h3 class="fn"><a name="operator-2b-eq"></a><span class="type">iterator</span> & iterator::<span class="name">operator+=</span> ( <span class="type">int</span> <i>j</i> )</h3>
<p>Advances the iterator by <i>j</i> items. (If <i>j</i> is negative, the iterator goes backward.)</p>
<p><b>See also </b><a href="qhash-iterator.html#operator--eq">operator-=</a>() and <a href="qhash-iterator.html#operator-2b">operator+</a>().</p>
<!-- @@@operator+= -->
<!-- $$$operator-[overload1]$$$operator-int -->
<h3 class="fn"><a name="operator-"></a><span class="type">iterator</span> iterator::<span class="name">operator-</span> ( <span class="type">int</span> <i>j</i> ) const</h3>
<p>Returns an iterator to the item at <i>j</i> positions backward from this iterator. (If <i>j</i> is negative, the iterator goes forward.)</p>
<p>This operation can be slow for large <i>j</i> values.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-2b">operator+</a>().</p>
<!-- @@@operator- -->
<!-- $$$operator--[overload1]$$$operator-- -->
<h3 class="fn"><a name="operator--"></a><span class="type">iterator</span> & iterator::<span class="name">operator--</span> ()</h3>
<p>The prefix -- operator (<tt>--i</tt>) makes the preceding item current and returns an iterator pointing to the new current item.</p>
<p>Calling this function on <a href="qhash.html#begin">QHash::begin</a>() leads to undefined results.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-2b-2b">operator++</a>().</p>
<!-- @@@operator-- -->
<!-- $$$operator--$$$operator--int -->
<h3 class="fn"><a name="operator---2"></a><span class="type">iterator</span> iterator::<span class="name">operator--</span> ( <span class="type">int</span> )</h3>
<p>This is an overloaded function.</p>
<p>The postfix -- operator (<tt>i--</tt>) makes the preceding item current and returns an iterator pointing to the previously current item.</p>
<!-- @@@operator-- -->
<!-- $$$operator-=[overload1]$$$operator-=int -->
<h3 class="fn"><a name="operator--eq"></a><span class="type">iterator</span> & iterator::<span class="name">operator-=</span> ( <span class="type">int</span> <i>j</i> )</h3>
<p>Makes the iterator go back by <i>j</i> items. (If <i>j</i> is negative, the iterator goes forward.)</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-2b-eq">operator+=</a>() and <a href="qhash-iterator.html#operator-">operator-</a>().</p>
<!-- @@@operator-= -->
<!-- $$$operator->[overload1]$$$operator-> -->
<h3 class="fn"><a name="operator--gt"></a><span class="type">T</span> * iterator::<span class="name">operator-></span> () const</h3>
<p>Returns a pointer to the current item's value.</p>
<p><b>See also </b><a href="qhash-iterator.html#value">value</a>().</p>
<!-- @@@operator-> -->
<!-- $$$operator==[overload1]$$$operator==constiterator& -->
<h3 class="fn"><a name="operator-eq-eq"></a><span class="type">bool</span> iterator::<span class="name">operator==</span> ( const <span class="type">iterator</span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> points to the same item as this iterator; otherwise returns false.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-not-eq">operator!=</a>().</p>
<!-- @@@operator== -->
<!-- $$$operator==$$$operator==constconst_iterator& -->
<h3 class="fn"><a name="operator-eq-eq-2"></a><span class="type">bool</span> iterator::<span class="name">operator==</span> ( const <span class="type"><a href="qhash-const-iterator.html">const_iterator</a></span> & <i>other</i> ) const</h3>
<p>Returns true if <i>other</i> points to the same item as this iterator; otherwise returns false.</p>
<p><b>See also </b><a href="qhash-iterator.html#operator-not-eq">operator!=</a>().</p>
<!-- @@@operator== -->
</div>
<div class="ft">
<span></span>
</div>
</div>
<div class="footer">
<p>
<acronym title="Copyright">©</acronym> 2012 Nokia Corporation and/or its
subsidiaries. Documentation contributions included herein are the copyrights of
their respective owners.</p>
<br />
<p>
The documentation provided herein is licensed under the terms of the
<a href="http://www.gnu.org/licenses/fdl.html">GNU Free Documentation
License version 1.3</a> as published by the Free Software Foundation.</p>
<p>
Documentation sources may be obtained from <a href="http://www.qt-project.org">
www.qt-project.org</a>.</p>
<br />
<p>
Nokia, Qt and their respective logos are trademarks of Nokia Corporation
in Finland and/or other countries worldwide. All other trademarks are property
of their respective owners. <a title="Privacy Policy"
href="http://en.gitorious.org/privacy_policy/">Privacy Policy</a></p>
</div>
</body>
</html>
|
