~oif-team/ubuntu/natty/qt4-x11/xi2.1

<td width="1">  </td><td class="postheader" valign="center"><a href="index.html"><font color="#004faf">Home</font></a> · <a href="namespaces.html"><font color="#004faf">All Namespaces</font></a> · <a href="classes.html"><font color="#004faf">All Classes</font></a> · <a href="mainclasses.html"><font color="#004faf">Main Classes</font></a> · <a href="groups.html"><font color="#004faf">Grouped Classes</font></a> · <a href="modules.html"><font color="#004faf">Modules</font></a> · <a href="functions.html"><font color="#004faf">Functions</font></a></td>

<td align="right" valign="top" width="230"></td></tr></table><h1 class="title">iterator Class Reference<br /><span class="small-subtitle">(QSet::iterator)<br />[<a href="qtcore.html">QtCore</a> module]</span>

<td width="1">  </td><td class="postheader" valign="center"><a href="index.html"><font color="#004faf">Home</font></a> · <a href="classes.html"><font color="#004faf">All Classes</font></a> · <a href="functions.html"><font color="#004faf">All Functions</font></a> · <a href="overviews.html"><font color="#004faf">Overviews</font></a></td><td class="searchBar" align="right" valign="center"><form action="http://www.google.com/cse" id="cse-search-box"><div><input type="hidden" name="cx" value="000136343326384750312:dhbxnqlakyu" /><input type="hidden" name="ie" value="UTF-8" /><input type="text" name="q" size="31" /><input type="submit" name="sa" value="Search" /></div></form></td>

</tr></table><h1 class="title">iterator Class Reference<br /><span class="small-subtitle">(QSet::iterator)<br />[<a href="qtcore.html">QtCore</a> module]</span>

</h1>

<p>The QSet::iterator class provides an STL-style non-const iterator for <a href="qset.html">QSet</a>. <a href="#details">More...</a></p>

<pre> #include <<a href="qset.html">QSet</a>></pre><p>This class was introduced in Qt 4.2.</p>

<ul>

<li><a href="qset-iterator-members.html">List of all members, including inherited members</a></li>

</ul>

<hr />

<h3>Public Types</h3>

<ul>

<li><div class="fn"></div>typedef <b><a href="qset-iterator.html#iterator_category-typedef">iterator_category</a></b></li>

</ul>

<h2>Public Types</h2>

<tr><td class="memItemLeft" align="right" valign="top">typedef </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#iterator_category-typedef">iterator_category</a></b></td></tr>

</table>

<hr />

<h3>Public Functions</h3>

<ul>

<li><div class="fn"></div><b><a href="qset-iterator.html#iterator">iterator</a></b> ()</li>

<li><div class="fn"></div><b><a href="qset-iterator.html#iterator-3">iterator</a></b> ( const iterator & <i>other</i> )</li>

<li><div class="fn"></div>bool <b><a href="qset-iterator.html#operator-not-eq">operator!=</a></b> ( const iterator & <i>other</i> ) const</li>

<li><div class="fn"></div>bool <b><a href="qset-iterator.html#operator-not-eq-2">operator!=</a></b> ( const const_iterator & <i>other</i> ) const</li>

<li><div class="fn"></div>const T & <b><a href="qset-iterator.html#operator-2a">operator*</a></b> () const</li>

<li><div class="fn"></div>iterator <b><a href="qset-iterator.html#operator-2b">operator+</a></b> ( int <i>j</i> ) const</li>

<li><div class="fn"></div>iterator & <b><a href="qset-iterator.html#operator-2b-2b">operator++</a></b> ()</li>

<li><div class="fn"></div>iterator <b><a href="qset-iterator.html#operator-2b-2b-2">operator++</a></b> ( int )</li>

<li><div class="fn"></div>iterator & <b><a href="qset-iterator.html#operator-2b-eq">operator+=</a></b> ( int <i>j</i> )</li>

<li><div class="fn"></div>iterator <b><a href="qset-iterator.html#operator-">operator-</a></b> ( int <i>j</i> ) const</li>

<li><div class="fn"></div>iterator & <b><a href="qset-iterator.html#operator--">operator--</a></b> ()</li>

<li><div class="fn"></div>iterator <b><a href="qset-iterator.html#operator---2">operator--</a></b> ( int )</li>

<li><div class="fn"></div>iterator & <b><a href="qset-iterator.html#operator--eq">operator-=</a></b> ( int <i>j</i> )</li>

<li><div class="fn"></div>const T * <b><a href="qset-iterator.html#operator--gt">operator-></a></b> () const</li>

<li><div class="fn"></div>iterator & <b><a href="qset-iterator.html#operator-eq">operator=</a></b> ( const iterator & <i>other</i> )</li>

<li><div class="fn"></div>bool <b><a href="qset-iterator.html#operator-eq-eq">operator==</a></b> ( const iterator & <i>other</i> ) const</li>

<li><div class="fn"></div>bool <b><a href="qset-iterator.html#operator-eq-eq-2">operator==</a></b> ( const const_iterator & <i>other</i> ) const</li>

</ul>

<h2>Public Functions</h2>

<tr><td class="memItemLeft" align="right" valign="top"></td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#iterator">iterator</a></b> ()</td></tr>

<tr><td class="memItemLeft" align="right" valign="top"></td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#iterator-3">iterator</a></b> ( const iterator & <i>other</i> )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-not-eq">operator!=</a></b> ( const iterator & <i>other</i> ) const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-not-eq-2">operator!=</a></b> ( const const_iterator & <i>other</i> ) const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">const T & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-2a">operator*</a></b> () const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-2b">operator+</a></b> ( int <i>j</i> ) const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-2b-2b">operator++</a></b> ()</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-2b-2b-2">operator++</a></b> ( int )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-2b-eq">operator+=</a></b> ( int <i>j</i> )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-">operator-</a></b> ( int <i>j</i> ) const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator--">operator--</a></b> ()</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator---2">operator--</a></b> ( int )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator--eq">operator-=</a></b> ( int <i>j</i> )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">const T * </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator--gt">operator-></a></b> () const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">iterator & </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-eq">operator=</a></b> ( const iterator & <i>other</i> )</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-eq-eq">operator==</a></b> ( const iterator & <i>other</i> ) const</td></tr>

<tr><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><b><a href="qset-iterator.html#operator-eq-eq-2">operator==</a></b> ( const const_iterator & <i>other</i> ) const</td></tr>

</table>

<hr />

<h2>Detailed Description</h2>

<p>See also <a href="qset-const-iterator.html">QSet::const_iterator</a> and <a href="qmutablesetiterator.html">QMutableSetIterator</a>.</p>

<hr />

<h2>Member Type Documentation</h2>

<h3 class="fn"><a name="iterator_category-typedef"></a>typedef iterator::iterator_category</h3>

<p>Synonyms for <i>std::bidirectional_iterator_tag</i> indicating these iterators are bidirectional iterators.</p>

<hr />

<h2>Member Function Documentation</h2>

<h3 class="fn"><a name="iterator"></a>iterator::iterator ()</h3>

<p>Constructs an uninitialized iterator.</p>

<p>Functions like operator*() and operator++() should not be called on an uninitialized iterator. Use operator=() to assign a value to it before using it.</p>

<p>See also <a href="qset.html#begin">QSet::begin</a>() and <a href="qset.html#end">QSet::end</a>().</p>

<h3 class="fn"><a name="iterator-3"></a>iterator::iterator ( const iterator & <i>other</i> )</h3>

<p>Constructs a copy of <i>other</i>.</p>

100

<h3 class="fn"><a name="operator-not-eq"></a>bool iterator::operator!= ( const iterator & <i>other</i> ) const</h3>

101

<p>Returns true if <i>other</i> points to a different item than this iterator; otherwise returns false.</p>

102

<p>See also <a href="qset-iterator.html#operator-eq-eq">operator==</a>().</p>

103

<h3 class="fn"><a name="operator-not-eq-2"></a>bool iterator::operator!= ( const <a href="qset-const-iterator.html">const_iterator</a> & <i>other</i> ) const</h3>

104

<p>This is an overloaded function.</p>

105

106

<h3 class="fn"><a name="operator-2a"></a>const T & iterator::operator* () const</h3>

100

107

<p>Returns a reference to the current item.</p>

101

108

<p>See also <a href="qset-iterator.html#operator--gt">operator-></a>().</p>

109

102

110

<h3 class="fn"><a name="operator-2b"></a>iterator iterator::operator+ ( int <i>j</i> ) const</h3>

103

111

<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>

104

112

<p>This operation can be slow for large <i>j</i> values.</p>

105

113

<p>See also <a href="qset-iterator.html#operator-">operator-</a>().</p>

114

106

115

<h3 class="fn"><a name="operator-2b-2b"></a>iterator & iterator::operator++ ()</h3>

107

116

<p>The prefix ++ operator (<tt>++it</tt>) advances the iterator to the next item in the set and returns an iterator to the new current item.</p>

108

117

<p>Calling this function on <a href="qset.html#constEnd">QSet::constEnd</a>() leads to undefined results.</p>

110

119

<h3 class="fn"><a name="operator-2b-2b-2"></a>iterator iterator::operator++ ( int )</h3>

111

120

<p>This is an overloaded function.</p>

112

121

<p>The postfix ++ operator (<tt>it++</tt>) advances the iterator to the next item in the set and returns an iterator to the previously current item.</p>

122

113

123

<h3 class="fn"><a name="operator-2b-eq"></a>iterator & iterator::operator+= ( int <i>j</i> )</h3>

114

124

<p>Advances the iterator by <i>j</i> items. (If <i>j</i> is negative, the iterator goes backward.)</p>

115

125

<p>This operation can be slow for large <i>j</i> values.</p>

116

126

<p>See also <a href="qset-iterator.html#operator--eq">operator-=</a>() and <a href="qset-iterator.html#operator-2b">operator+</a>().</p>

127

117

128

<h3 class="fn"><a name="operator-"></a>iterator iterator::operator- ( int <i>j</i> ) const</h3>

118

129

<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>

119

130

<p>This operation can be slow for large <i>j</i> values.</p>

120

131

<p>See also <a href="qset-iterator.html#operator-2b">operator+</a>().</p>

132

121

133

<h3 class="fn"><a name="operator--"></a>iterator & iterator::operator-- ()</h3>

122

134

<p>The prefix -- operator (<tt>--it</tt>) makes the preceding item current and returns an iterator to the new current item.</p>

123

135

<p>Calling this function on <a href="qset.html#begin">QSet::begin</a>() leads to undefined results.</p>

125

137

<h3 class="fn"><a name="operator---2"></a>iterator iterator::operator-- ( int )</h3>

126

138

<p>This is an overloaded function.</p>

127

139

<p>The postfix -- operator (<tt>it--</tt>) makes the preceding item current and returns an iterator to the previously current item.</p>

140

128

141

<h3 class="fn"><a name="operator--eq"></a>iterator & iterator::operator-= ( int <i>j</i> )</h3>

129

142

<p>Makes the iterator go back by <i>j</i> items. (If <i>j</i> is negative, the iterator goes forward.)</p>

130

143

<p>This operation can be slow for large <i>j</i> values.</p>

131

144

<p>See also <a href="qset-iterator.html#operator-2b-eq">operator+=</a>() and <a href="qset-iterator.html#operator-">operator-</a>().</p>

145

132

146

<h3 class="fn"><a name="operator--gt"></a>const T * iterator::operator-> () const</h3>

133

147

<p>Returns a pointer to the current item.</p>

134

148

<p>See also <a href="qset-iterator.html#operator-2a">operator*</a>().</p>

149

135

150

<h3 class="fn"><a name="operator-eq"></a>iterator & iterator::operator= ( const iterator & <i>other</i> )</h3>

136

151

<p>Assigns <i>other</i> to this iterator.</p>

152

137

153

<h3 class="fn"><a name="operator-eq-eq"></a>bool iterator::operator== ( const iterator & <i>other</i> ) const</h3>

138

154

<p>Returns true if <i>other</i> points to the same item as this iterator; otherwise returns false.</p>

139

155

<p>See also <a href="qset-iterator.html#operator-not-eq">operator!=</a>().</p>

141

157

<p>This is an overloaded function.</p>

142

158

143

159

144

145

<td width="40%" align="center"><a href="trademarks.html">Trademarks</a></td>

146

147

</tr></table></div></address></body>

160

161

<td width="20%" align="center"><a href="trademarks.html">Trademarks</a></td>

162

163

148

164

</html>

Older »