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
236
|
<?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" />
<!-- qiterator.qdoc -->
<title>Qt 4.8: QMutableHashIterator 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>QMutableHashIterator</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">QMutableHashIterator Class Reference</h1>
<!-- $$$QMutableHashIterator-brief -->
<p>The QMutableHashIterator class provides a Java-style non-const iterator for <a href="qhash.html">QHash</a> and <a href="qmultihash.html">QMultiHash</a>. <a href="#details">More...</a></p>
<!-- @@@QMutableHashIterator -->
<pre class="cpp"> <span class="preprocessor">#include <QMutableHashIterator></span></pre><ul>
<li><a href="qmutablehashiterator-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="qmutablehashiterator.html#QMutableHashIterator">QMutableHashIterator</a></b> ( QHash<Key, T> & <i>hash</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#dtor.QMutableHashIterator">~QMutableHashIterator</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#findNext">findNext</a></b> ( const T & <i>value</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#findPrevious">findPrevious</a></b> ( const T & <i>value</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#hasNext">hasNext</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#hasPrevious">hasPrevious</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const Key & </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#key">key</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> Item </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#next">next</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> Item </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#peekNext">peekNext</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> Item </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#peekPrevious">peekPrevious</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> Item </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#previous">previous</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#remove">remove</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#setValue">setValue</a></b> ( const T & <i>value</i> )</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#toBack">toBack</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#toFront">toFront</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> const T & </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#value">value</a></b> () const</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> T & </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#value-2">value</a></b> ()</td></tr>
<tr><td class="memItemLeft rightAlign topAlign"> QMutableHashIterator & </td><td class="memItemRight bottomAlign"><b><a href="qmutablehashiterator.html#operator-eq">operator=</a></b> ( QHash<Key, T> & <i>hash</i> )</td></tr>
</table>
<a name="details"></a>
<!-- $$$QMutableHashIterator-description -->
<div class="descr">
<h2>Detailed Description</h2>
<p>The QMutableHashIterator class provides a Java-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> has both <a href="containers.html#java-style-iterators">Java-style iterators</a> and <a href="containers.html#stl-style-iterators">STL-style iterators</a>. The Java-style iterators are more high-level and easier to use than the STL-style iterators; on the other hand, they are slightly less efficient.</p>
<p>QMutableHashIterator<Key, T> allows you to iterate over a <a href="qhash.html">QHash</a> (or a <a href="qmultihash.html">QMultiHash</a>) and modify the hash. If you don't want to modify the hash (or have a const <a href="qhash.html">QHash</a>), use the slightly faster <a href="qhashiterator.html">QHashIterator</a> instead.</p>
<p>The QMutableHashIterator constructor takes a <a href="qhash.html">QHash</a> as argument. After construction, the iterator is located at the very beginning of the hash (before the first item). Here's how to iterate over all the elements sequentially:</p>
<pre class="cpp"> <span class="type"><a href="qhash.html">QHash</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">,</span> <span class="type"><a href="qwidget.html">QWidget</a></span> <span class="operator">*</span><span class="operator">></span> hash;
<span class="operator">.</span><span class="operator">.</span><span class="operator">.</span>
<span class="type">QMutableHashIterator</span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type"><a href="qwidget.html">QWidget</a></span> <span class="operator">*</span><span class="operator">></span> i(hash);
<span class="keyword">while</span> (i<span class="operator">.</span>hasNext()) {
i<span class="operator">.</span>next();
<a href="qtglobal.html#qDebug">qDebug</a>() <span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span>key() <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>value();
}</pre>
<p>The <a href="qmutablehashiterator.html#next">next</a>() function returns the next item in the hash and advances the iterator. The <a href="qmutablehashiterator.html#key">key</a>() and <a href="qmutablehashiterator.html#value">value</a>() functions return the key and value of the last item that was jumped over.</p>
<p>Unlike STL-style iterators, Java-style iterators point <i>between</i> items rather than directly <i>at</i> items. The first call to <a href="qmutablehashiterator.html#next">next</a>() advances the iterator to the position between the first and second item, and returns the first item; the second call to <a href="qmutablehashiterator.html#next">next</a>() advances the iterator to the position between the second and third item; and so on.</p>
<p class="centerAlign"><img src="images/javaiterators1.png" alt="" /></p><p>Here's how to iterate over the elements in reverse order:</p>
<pre class="cpp"> <span class="type">QMutableHashIterator</span><span class="operator"><</span><span class="type">int</span><span class="operator">,</span> <span class="type"><a href="qwidget.html">QWidget</a></span> <span class="operator">*</span><span class="operator">></span> i(hash);
i<span class="operator">.</span><a href="qmutablehashiterator.html#toBack">toBack</a>();
<span class="keyword">while</span> (i<span class="operator">.</span>hasPrevious()) {
i<span class="operator">.</span>previous();
<a href="qtglobal.html#qDebug">qDebug</a>() <span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span>key() <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>value();
}</pre>
<p>If you want to find all occurrences of a particular value, use <a href="qmutablehashiterator.html#findNext">findNext</a>() or <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>() in a loop. For example:</p>
<pre class="cpp"> <span class="type">QMutableHashIterator</span><span class="operator"><</span><span class="type">int</span><span class="operator">,</span> <span class="type"><a href="qwidget.html">QWidget</a></span> <span class="operator">*</span><span class="operator">></span> i(hash);
<span class="keyword">while</span> (i<span class="operator">.</span>findNext(widget)) {
<a href="qtglobal.html#qDebug">qDebug</a>() <span class="operator"><</span><span class="operator"><</span> <span class="string">"Found widget "</span> <span class="operator"><</span><span class="operator"><</span> widget <span class="operator"><</span><span class="operator"><</span> <span class="string">" under key "</span>
<span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span>key();
}</pre>
<p>If you want to remove items as you iterate over the hash, use <a href="qmutablehashiterator.html#remove">remove</a>(). If you want to modify the value of an item, use <a href="qmutablehashiterator.html#setValue">setValue</a>().</p>
<p>Example:</p>
<pre class="cpp"> <span class="type">QMutableHashIterator</span><span class="operator"><</span><span class="type"><a href="qstring.html">QString</a></span><span class="operator">,</span> <span class="type"><a href="qstring.html">QString</a></span><span class="operator">></span> i(hash);
<span class="keyword">while</span> (i<span class="operator">.</span>hasNext()) {
i<span class="operator">.</span>next();
<span class="keyword">if</span> (i<span class="operator">.</span>key() <span class="operator">=</span><span class="operator">=</span> i<span class="operator">.</span>value())
i<span class="operator">.</span>remove();
}</pre>
<p>The example removes all (key, value) pairs where the key and the value are the same.</p>
<p>Only one mutable iterator can be active on a given hash at any time. Furthermore, no changes should be done directly to the hash while the iterator is active (as opposed to through the iterator), since this could invalidate the iterator and lead to undefined behavior.</p>
</div>
<p><b>See also </b><a href="qhashiterator.html">QHashIterator</a> and <a href="qhash-iterator.html">QHash::iterator</a>.</p>
<!-- @@@QMutableHashIterator -->
<div class="func">
<h2>Member Function Documentation</h2>
<!-- $$$QMutableHashIterator[overload1]$$$QMutableHashIteratorQHash<Key,T>& -->
<h3 class="fn"><a name="QMutableHashIterator"></a>QMutableHashIterator::<span class="name">QMutableHashIterator</span> ( <span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>> & <i>hash</i> )</h3>
<p>Constructs an iterator for traversing <i>hash</i>. The iterator is set to be at the front of the hash (before the first item).</p>
<p><b>See also </b><a href="qmutablehashiterator.html#operator-eq">operator=</a>().</p>
<!-- @@@QMutableHashIterator -->
<!-- $$$~QMutableHashIterator[overload1]$$$~QMutableHashIterator -->
<h3 class="fn"><a name="dtor.QMutableHashIterator"></a>QMutableHashIterator::<span class="name">~QMutableHashIterator</span> ()</h3>
<p>Destroys the iterator.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#operator-eq">operator=</a>().</p>
<!-- @@@~QMutableHashIterator -->
<!-- $$$findNext[overload1]$$$findNextconstT& -->
<h3 class="fn"><a name="findNext"></a><span class="type">bool</span> QMutableHashIterator::<span class="name">findNext</span> ( const <span class="type">T</span> & <i>value</i> )</h3>
<p>Searches for <i>value</i> starting from the current iterator position forward. Returns true if a (key, value) pair with value <i>value</i> is found; otherwise returns false.</p>
<p>After the call, if <i>value</i> was found, the iterator is positioned just after the matching item; otherwise, the iterator is positioned at the back of the container.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#findPrevious">findPrevious</a>().</p>
<!-- @@@findNext -->
<!-- $$$findPrevious[overload1]$$$findPreviousconstT& -->
<h3 class="fn"><a name="findPrevious"></a><span class="type">bool</span> QMutableHashIterator::<span class="name">findPrevious</span> ( const <span class="type">T</span> & <i>value</i> )</h3>
<p>Searches for <i>value</i> starting from the current iterator position backward. Returns true if a (key, value) pair with value <i>value</i> is found; otherwise returns false.</p>
<p>After the call, if <i>value</i> was found, the iterator is positioned just before the matching item; otherwise, the iterator is positioned at the front of the container.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#findNext">findNext</a>().</p>
<!-- @@@findPrevious -->
<!-- $$$hasNext[overload1]$$$hasNext -->
<h3 class="fn"><a name="hasNext"></a><span class="type">bool</span> QMutableHashIterator::<span class="name">hasNext</span> () const</h3>
<p>Returns true if there is at least one item ahead of the iterator, i.e. the iterator is <i>not</i> at the back of the container; otherwise returns false.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasPrevious">hasPrevious</a>() and <a href="qmutablehashiterator.html#next">next</a>().</p>
<!-- @@@hasNext -->
<!-- $$$hasPrevious[overload1]$$$hasPrevious -->
<h3 class="fn"><a name="hasPrevious"></a><span class="type">bool</span> QMutableHashIterator::<span class="name">hasPrevious</span> () const</h3>
<p>Returns true if there is at least one item behind the iterator, i.e. the iterator is <i>not</i> at the front of the container; otherwise returns false.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasNext">hasNext</a>() and <a href="qmutablehashiterator.html#previous">previous</a>().</p>
<!-- @@@hasPrevious -->
<!-- $$$key[overload1]$$$key -->
<h3 class="fn"><a name="key"></a>const <span class="type">Key</span> & QMutableHashIterator::<span class="name">key</span> () const</h3>
<p>Returns the key of the last item that was jumped over using one of the traversal functions (<a href="qmutablehashiterator.html#next">next</a>(), <a href="qmutablehashiterator.html#previous">previous</a>(), <a href="qmutablehashiterator.html#findNext">findNext</a>(), <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>()).</p>
<p>After a call to <a href="qmutablehashiterator.html#next">next</a>() or <a href="qmutablehashiterator.html#findNext">findNext</a>(), key() is equivalent to <a href="qmutablehashiterator.html#peekPrevious">peekPrevious</a>().key(). After a call to <a href="qmutablehashiterator.html#previous">previous</a>() or <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>(), key() is equivalent to <a href="qmutablehashiterator.html#peekNext">peekNext</a>().key().</p>
<p><b>See also </b><a href="qmutablehashiterator.html#value">value</a>().</p>
<!-- @@@key -->
<!-- $$$next[overload1]$$$next -->
<h3 class="fn"><a name="next"></a><span class="type">Item</span> QMutableHashIterator::<span class="name">next</span> ()</h3>
<p>Returns the next item and advances the iterator by one position.</p>
<p>Call <a href="qmutablehashiterator.html#key">key</a>() on the return value to obtain the item's key, and <a href="qmutablehashiterator.html#value">value</a>() to obtain the value.</p>
<p>Calling this function on an iterator located at the back of the container leads to undefined results.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasNext">hasNext</a>(), <a href="qmutablehashiterator.html#peekNext">peekNext</a>(), and <a href="qmutablehashiterator.html#previous">previous</a>().</p>
<!-- @@@next -->
<!-- $$$peekNext[overload1]$$$peekNext -->
<h3 class="fn"><a name="peekNext"></a><span class="type">Item</span> QMutableHashIterator::<span class="name">peekNext</span> () const</h3>
<p>Returns a reference to the next item without moving the iterator.</p>
<p>Call <a href="qmutablehashiterator.html#key">key</a>() on the return value to obtain the item's key, and <a href="qmutablehashiterator.html#value">value</a>() to obtain the value.</p>
<p>Calling this function on an iterator located at the back of the container leads to undefined results.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasNext">hasNext</a>(), <a href="qmutablehashiterator.html#next">next</a>(), and <a href="qmutablehashiterator.html#peekPrevious">peekPrevious</a>().</p>
<!-- @@@peekNext -->
<!-- $$$peekPrevious[overload1]$$$peekPrevious -->
<h3 class="fn"><a name="peekPrevious"></a><span class="type">Item</span> QMutableHashIterator::<span class="name">peekPrevious</span> () const</h3>
<p>Returns the previous item without moving the iterator.</p>
<p>Call <a href="qmutablehashiterator.html#key">key</a>() on the return value to obtain the item's key, and <a href="qmutablehashiterator.html#value">value</a>() to obtain the value.</p>
<p>Calling this function on an iterator located at the front of the container leads to undefined results.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasPrevious">hasPrevious</a>(), <a href="qmutablehashiterator.html#previous">previous</a>(), and <a href="qmutablehashiterator.html#peekNext">peekNext</a>().</p>
<!-- @@@peekPrevious -->
<!-- $$$previous[overload1]$$$previous -->
<h3 class="fn"><a name="previous"></a><span class="type">Item</span> QMutableHashIterator::<span class="name">previous</span> ()</h3>
<p>Returns the previous item and moves the iterator back by one position.</p>
<p>Call <a href="qmutablehashiterator.html#key">key</a>() on the return value to obtain the item's key, and <a href="qmutablehashiterator.html#value">value</a>() to obtain the value.</p>
<p>Calling this function on an iterator located at the front of the container leads to undefined results.</p>
<p><b>See also </b><a href="qmutablehashiterator.html#hasPrevious">hasPrevious</a>(), <a href="qmutablehashiterator.html#peekPrevious">peekPrevious</a>(), and <a href="qmutablehashiterator.html#next">next</a>().</p>
<!-- @@@previous -->
<!-- $$$remove[overload1]$$$remove -->
<h3 class="fn"><a name="remove"></a><span class="type">void</span> QMutableHashIterator::<span class="name">remove</span> ()</h3>
<p>Removes the last item that was jumped over using one of the traversal functions (<a href="qmutablehashiterator.html#next">next</a>(), <a href="qmutablehashiterator.html#previous">previous</a>(), <a href="qmutablehashiterator.html#findNext">findNext</a>(), <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>()).</p>
<p><b>See also </b><a href="qmutablehashiterator.html#setValue">setValue</a>().</p>
<!-- @@@remove -->
<!-- $$$setValue[overload1]$$$setValueconstT& -->
<h3 class="fn"><a name="setValue"></a><span class="type">void</span> QMutableHashIterator::<span class="name">setValue</span> ( const <span class="type">T</span> & <i>value</i> )</h3>
<p>Replaces the value of the last item that was jumped over using one of the traversal functions with <i>value</i>.</p>
<p>The traversal functions are <a href="qmutablehashiterator.html#next">next</a>(), <a href="qmutablehashiterator.html#previous">previous</a>(), <a href="qmutablehashiterator.html#findNext">findNext</a>(), and <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>().</p>
<p><b>See also </b><a href="qmutablehashiterator.html#key">key</a>(), <a href="qmutablehashiterator.html#value">value</a>(), and <a href="qmutablehashiterator.html#remove">remove</a>().</p>
<!-- @@@setValue -->
<!-- $$$toBack[overload1]$$$toBack -->
<h3 class="fn"><a name="toBack"></a><span class="type">void</span> QMutableHashIterator::<span class="name">toBack</span> ()</h3>
<p>Moves the iterator to the back of the container (after the last item).</p>
<p><b>See also </b><a href="qmutablehashiterator.html#toFront">toFront</a>() and <a href="qmutablehashiterator.html#previous">previous</a>().</p>
<!-- @@@toBack -->
<!-- $$$toFront[overload1]$$$toFront -->
<h3 class="fn"><a name="toFront"></a><span class="type">void</span> QMutableHashIterator::<span class="name">toFront</span> ()</h3>
<p>Moves the iterator to the front of the container (before the first item).</p>
<p><b>See also </b><a href="qmutablehashiterator.html#toBack">toBack</a>() and <a href="qmutablehashiterator.html#next">next</a>().</p>
<!-- @@@toFront -->
<!-- $$$value[overload1]$$$value -->
<h3 class="fn"><a name="value"></a>const <span class="type">T</span> & QMutableHashIterator::<span class="name">value</span> () const</h3>
<p>Returns the value of the last item that was jumped over using one of the traversal functions (<a href="qmutablehashiterator.html#next">next</a>(), <a href="qmutablehashiterator.html#previous">previous</a>(), <a href="qmutablehashiterator.html#findNext">findNext</a>(), <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>()).</p>
<p>After a call to <a href="qmutablehashiterator.html#next">next</a>() or <a href="qmutablehashiterator.html#findNext">findNext</a>(), value() is equivalent to <a href="qmutablehashiterator.html#peekPrevious">peekPrevious</a>().value(). After a call to <a href="qmutablehashiterator.html#previous">previous</a>() or <a href="qmutablehashiterator.html#findPrevious">findPrevious</a>(), value() is equivalent to <a href="qmutablehashiterator.html#peekNext">peekNext</a>().value().</p>
<p><b>See also </b><a href="qmutablehashiterator.html#key">key</a>() and <a href="qmutablehashiterator.html#setValue">setValue</a>().</p>
<!-- @@@value -->
<!-- $$$value$$$value -->
<h3 class="fn"><a name="value-2"></a><span class="type">T</span> & QMutableHashIterator::<span class="name">value</span> ()</h3>
<p>This is an overloaded function.</p>
<p>Returns a non-const reference to the value of the last item that was jumped over using one of the traversal functions.</p>
<!-- @@@value -->
<!-- $$$operator=[overload1]$$$operator=QHash<Key,T>& -->
<h3 class="fn"><a name="operator-eq"></a><span class="type">QMutableHashIterator</span> & QMutableHashIterator::<span class="name">operator=</span> ( <span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>> & <i>hash</i> )</h3>
<p>Makes the iterator operate on <i>hash</i>. The iterator is set to be at the front of the hash (before the first item).</p>
<p><b>See also </b><a href="qmutablehashiterator.html#toFront">toFront</a>() and <a href="qmutablehashiterator.html#toBack">toBack</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>
|
