~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="classes.html"><font color="#004faf">All Classes</font></a> · <a href="mainclasses.html"><font color="#004faf">Main Classes</font></a> · <a href="annotated.html"><font color="#004faf">Annotated</font></a> · <a href="groups.html"><font color="#004faf">Grouped Classes</font></a> · <a href="functions.html"><font color="#004faf">Functions</font></a></td>

<td align="right" valign="top" width="230"><img src="images/trolltech-logo.png" align="right" width="203" height="32" border="0" /></td></tr></table><h1 align="center">QMultiHash Class Reference</h1>

<p>The QMultiHash class is a convenience <a href="qhash.html">QHash</a> subclass that provides multi-valued hashes. <a href="#details">More...</a></p>

<pre>#include <QMultiHash></pre><p>Part of the <a href="qtcore.html">QtCore</a> module.</p>

<p>Inherits <a href="qhash.html">QHash<Key, T></a>.</p>

<p><b>Note:</b> All the functions in this class are <a href="threads.html#reentrant">reentrant</a>.</p>

<ul>

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

</ul>

<h3>Public Functions</h3>

<ul>

<li><div class="fn"/><b><a href="qmultihash.html#QMultiHash">QMultiHash</a></b> ()</li>

<li><div class="fn"/><b><a href="qmultihash.html#QMultiHash-2">QMultiHash</a></b> ( const QHash<Key, T> & <i>other</i> )</li>

<li><div class="fn"/>QHash<Key, T>::iterator <b><a href="qmultihash.html#insert">insert</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</li>

<li><div class="fn"/>QHash<Key, T>::iterator <b><a href="qmultihash.html#replace">replace</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</li>

<li><div class="fn"/>QMultiHash <b><a href="qmultihash.html#operator-2b">operator+</a></b> ( const QMultiHash & <i>other</i> ) const</li>

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

</ul>

<ul>

<li><div class="fn"/>36 public functions inherited from <a href="qhash.html#public-functions">QHash</a></li>

</ul>

<hr />

<h2>Detailed Description</h2>

<p>The QMultiHash class is a convenience <a href="qhash.html">QHash</a> subclass that provides multi-valued hashes.</p>

<p>QMultiHash<Key, T> is one of Qt's generic <a href="containers.html#container-classes">container classes</a>. It inherits <a href="qhash.html">QHash</a> and extends it with a few convenience functions that make it more suitable than <a href="qhash.html">QHash</a> for storing multi-valued hashes. A multi-valued hash is a hash that allows multiple values with the same key; <a href="qhash.html">QHash</a> normally doesn't allow that, unless you call <a href="qhash.html#insertMulti">QHash::insertMulti</a>().</p>

<p>Because QMultiHash inherits <a href="qhash.html">QHash</a>, all of <a href="qhash.html">QHash</a>'s functionality also applies to QMultiHash. For example, you can use <a href="qhash.html#isEmpty">isEmpty</a>() to test whether the hash is empty, and you can traverse a QMultiHash using <a href="qhash.html">QHash</a>'s iterator classes (for example, <a href="qhashiterator.html">QHashIterator</a>). But in addition, it provides an <a href="qmultihash.html#insert">insert</a>() function that corresponds to <a href="qhash.html#insertMulti">QHash::insertMulti</a>(), and a <a href="qmultihash.html#replace">replace</a>() function that corresponds to <a href="qhash.html#insert">QHash::insert</a>(). It also provides convenient operator+() and operator+=().</p>

<p>Example:</p>

<pre>  QMultiHash<QString, int> hash1, hash2, hash3;

hash1.insert("plenty", 100);

hash1.insert("plenty", 2000);

// hash1.size() == 2

hash2.insert("plenty", 5000);

// hash2.size() == 1

hash3 = hash1 + hash2;

// hash3.size() == 3</pre>

<p>Unlike <a href="qhash.html">QHash</a>, QMultiHash provides no operator[]. Use <a href="qhash.html#value">value</a>() or <a href="qmultihash.html#replace">replace</a>() if you want to access the most recently inserted item with a certain key.</p>

<p>If you want to retrieve all the values for a single key, you can use values(const Key &key), which returns a <a href="qlist.html">QList</a><T>:</p>

<pre>  QList<int> values = hash.values("plenty");

for (int i = 0; i < values.size(); ++i)

cout << values.at(i) << endl;</pre>

<p>The items that share the same key are available from most recently to least recently inserted.</p>

<p>A more efficient approach is to use QHashIterator::findNextKey() or QMutableHashIterator::findNextKey():</p>

<pre>  QHashIterator<QString, int> i(hash);

while (i.findNextKey("plenty"))

cout << i.value() << endl;</pre>

<p>If you prefer the STL-style iterators, you can call <a href="qhash.html#find">find</a>() to get the iterator for the first item with a key and iterate from there:</p>

<pre>  QMultiHash<QString, int>::iterator i = hash.find("plenty");

while (i != hash.end() && i.key() == "plenty") {

cout << i.value() << endl;

++i;

}</pre>

<p>QMultiHash's key and value data types must be <a href="containers.html#assignable-data-types">assignable data types</a>. You cannot, for example, store a <a href="qwidget.html">QWidget</a> as a value; instead, store a <a href="qwidget.html">QWidget</a> *. In addition, QMultiHash's key type must provide operator==(), and there must also be a global <a href="qhash.html#qHashx">qHash</a>() function that returns a hash value for an argument of the key's type. See the <a href="qhash.html">QHash</a> documentation for details.</p>

<p>See also <a href="qhash.html">QHash</a>, <a href="qhashiterator.html">QHashIterator</a>, <a href="qmutablehashiterator.html">QMutableHashIterator</a>, and <a href="qmultimap.html">QMultiMap</a>.</p>

<hr />

<h2>Member Function Documentation</h2>

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

<p>Constructs an empty hash.</p>

<h3 class="fn"><a name="QMultiHash-2"></a>QMultiHash::QMultiHash ( const <a href="qhash.html">QHash</a><Key, T> & <i>other</i> )</h3>

<p>Constructs a copy of <i>other</i> (which can be a <a href="qhash.html">QHash</a> or a <a href="qmultihash.html">QMultiHash</a>).</p>

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

<h3 class="fn"><a name="insert"></a><a href="qhash.html">QHash</a><Key, T>::iterator QMultiHash::insert ( const Key & <i>key</i>, const T & <i>value</i> )</h3>

<p>Inserts a new item with the key <i>key</i> and a value of <i>value</i>.</p>

<p>If there is already an item with the same key in the hash, this function will simply create a new one. (This behavior is different from <a href="qmultihash.html#replace">replace</a>(), which overwrites the value of an existing item.)</p>

<p>See also <a href="qmultihash.html#replace">replace</a>().</p>

<h3 class="fn"><a name="replace"></a><a href="qhash.html">QHash</a><Key, T>::iterator QMultiHash::replace ( const Key & <i>key</i>, const T & <i>value</i> )</h3>

<p>Inserts a new item with the key <i>key</i> and a value of <i>value</i>.</p>

<p>If there is already an item with the key <i>key</i>, that item's value is replaced with <i>value</i>.</p>

<p>If there are multiple items with the key <i>key</i>, the most recently inserted item's value is replaced with <i>value</i>.</p>

<p>See also <a href="qmultihash.html#insert">insert</a>().</p>

<h3 class="fn"><a name="operator-2b"></a>QMultiHash QMultiHash::operator+ ( const QMultiHash & <i>other</i> ) const</h3>

<p>Returns a hash that contains all the items in this hash in addition to all the items in <i>other</i>. If a key is common to both hashes, the resulting hash will contain the key multiple times.</p>

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

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

<p>Inserts all the items in the <i>other</i> hash into this hash and returns a reference to this hash.</p>

<p>See also <a href="qmultihash.html#insert">insert</a>().</p>

100

101

102

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

103

104

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

105

</html>

Older »