391 lines
30 KiB
HTML
391 lines
30 KiB
HTML
<?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: QMultiHash Class Reference</title>
|
|
<link rel="stylesheet" type="text/css" href="style/style.css" />
|
|
<script src="scripts/jquery.js" type="text/javascript"></script>
|
|
<script src="scripts/functions.js" type="text/javascript"></script>
|
|
<link rel="stylesheet" type="text/css" href="style/superfish.css" />
|
|
<link rel="stylesheet" type="text/css" href="style/narrow.css" />
|
|
<!--[if IE]>
|
|
<meta name="MSSmartTagsPreventParsing" content="true">
|
|
<meta http-equiv="imagetoolbar" content="no">
|
|
<![endif]-->
|
|
<!--[if lt IE 7]>
|
|
<link rel="stylesheet" type="text/css" href="style/style_ie6.css">
|
|
<![endif]-->
|
|
<!--[if IE 7]>
|
|
<link rel="stylesheet" type="text/css" href="style/style_ie7.css">
|
|
<![endif]-->
|
|
<!--[if IE 8]>
|
|
<link rel="stylesheet" type="text/css" href="style/style_ie8.css">
|
|
<![endif]-->
|
|
|
|
<script src="scripts/superfish.js" type="text/javascript"></script>
|
|
<script src="scripts/narrow.js" type="text/javascript"></script>
|
|
|
|
</head>
|
|
<body class="" onload="CheckEmptyAndLoadList();">
|
|
<div class="header" id="qtdocheader">
|
|
<div class="content">
|
|
<div id="nav-logo">
|
|
<a href="index.html">Home</a></div>
|
|
<a href="index.html" class="qtref"><span>Qt Reference Documentation</span></a>
|
|
<div id="narrowsearch"></div>
|
|
<div id="nav-topright">
|
|
<ul>
|
|
<li class="nav-topright-home"><a href="http://qt.digia.com/">Qt HOME</a></li>
|
|
<li class="nav-topright-dev"><a href="http://qt-project.org/">DEV</a></li>
|
|
<li class="nav-topright-doc nav-topright-doc-active"><a href="http://qt-project.org/doc/">
|
|
DOC</a></li>
|
|
<li class="nav-topright-blog"><a href="http://blog.qt.digia.com/">BLOG</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="shortCut">
|
|
<ul>
|
|
<li class="shortCut-topleft-inactive"><span><a href="index.html">Qt 4.8</a></span></li>
|
|
<li class="shortCut-topleft-active"><a href="http://qt-project.org/doc/">ALL VERSIONS </a></li>
|
|
</ul>
|
|
</div>
|
|
<ul class="sf-menu" id="narrowmenu">
|
|
<li><a href="#">API Lookup</a>
|
|
<ul>
|
|
<li><a href="classes.html">Class index</a></li>
|
|
<li><a href="functions.html">Function index</a></li>
|
|
<li><a href="modules.html">Modules</a></li>
|
|
<li><a href="namespaces.html">Namespaces</a></li>
|
|
<li><a href="qtglobal.html">Global Declarations</a></li>
|
|
<li><a href="qdeclarativeelements.html">QML elements</a></li>
|
|
</ul>
|
|
</li>
|
|
<li><a href="#">Qt Topics</a>
|
|
<ul>
|
|
<li><a href="qt-basic-concepts.html">Programming with Qt</a></li>
|
|
<li><a href="qtquick.html">Device UIs & Qt Quick</a></li>
|
|
<li><a href="qt-gui-concepts.html">UI Design with Qt</a></li>
|
|
<li><a href="supported-platforms.html">Supported Platforms</a></li>
|
|
<li><a href="technology-apis.html">Qt and Key Technologies</a></li>
|
|
<li><a href="best-practices.html">How-To's and Best Practices</a></li>
|
|
</ul>
|
|
</li>
|
|
<li><a href="#">Examples</a>
|
|
<ul>
|
|
<li><a href="all-examples.html">Examples</a></li>
|
|
<li><a href="tutorials.html">Tutorials</a></li>
|
|
<li><a href="demos.html">Demos</a></li>
|
|
<li><a href="qdeclarativeexamples.html">QML Examples</a></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
<div class="wrapper">
|
|
<div class="hd">
|
|
<span></span>
|
|
</div>
|
|
<div class="bd group">
|
|
<div class="sidebar">
|
|
<div class="searchlabel">
|
|
Search index:</div>
|
|
<div class="search" id="sidebarsearch">
|
|
<form id="qtdocsearch" action="" onsubmit="return false;">
|
|
<fieldset>
|
|
<input type="text" name="searchstring" id="pageType" value="" />
|
|
<div id="resultdialog">
|
|
<a href="#" id="resultclose">Close</a>
|
|
<p id="resultlinks" class="all"><a href="#" id="showallresults">All</a> | <a href="#" id="showapiresults">API</a> | <a href="#" id="showarticleresults">Articles</a> | <a href="#" id="showexampleresults">Examples</a></p>
|
|
<p id="searchcount" class="all"><span id="resultcount"></span><span id="apicount"></span><span id="articlecount"></span><span id="examplecount"></span> results:</p>
|
|
<ul id="resultlist" class="all">
|
|
</ul>
|
|
</div>
|
|
</fieldset>
|
|
</form>
|
|
</div>
|
|
<div class="box first bottombar" id="lookup">
|
|
<h2 title="API Lookup"><span></span>
|
|
API Lookup</h2>
|
|
<div id="list001" class="list">
|
|
<ul id="ul001" >
|
|
<li class="defaultLink"><a href="classes.html">Class index</a></li>
|
|
<li class="defaultLink"><a href="functions.html">Function index</a></li>
|
|
<li class="defaultLink"><a href="modules.html">Modules</a></li>
|
|
<li class="defaultLink"><a href="namespaces.html">Namespaces</a></li>
|
|
<li class="defaultLink"><a href="qtglobal.html">Global Declarations</a></li>
|
|
<li class="defaultLink"><a href="qdeclarativeelements.html">QML elements</a></li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
<div class="box bottombar" id="topics">
|
|
<h2 title="Qt Topics"><span></span>
|
|
Qt Topics</h2>
|
|
<div id="list002" class="list">
|
|
<ul id="ul002" >
|
|
<li class="defaultLink"><a href="qt-basic-concepts.html">Programming with Qt</a></li>
|
|
<li class="defaultLink"><a href="qtquick.html">Device UIs & Qt Quick</a></li>
|
|
<li class="defaultLink"><a href="qt-gui-concepts.html">UI Design with Qt</a></li>
|
|
<li class="defaultLink"><a href="supported-platforms.html">Supported Platforms</a></li>
|
|
<li class="defaultLink"><a href="technology-apis.html">Qt and Key Technologies</a></li>
|
|
<li class="defaultLink"><a href="best-practices.html">How-To's and Best Practices</a></li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
<div class="box" id="examples">
|
|
<h2 title="Examples"><span></span>
|
|
Examples</h2>
|
|
<div id="list003" class="list">
|
|
<ul id="ul003">
|
|
<li class="defaultLink"><a href="all-examples.html">Examples</a></li>
|
|
<li class="defaultLink"><a href="tutorials.html">Tutorials</a></li>
|
|
<li class="defaultLink"><a href="demos.html">Demos</a></li>
|
|
<li class="defaultLink"><a href="qdeclarativeexamples.html">QML Examples</a></li>
|
|
</ul>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="wrap">
|
|
<div class="toolbar">
|
|
<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>QMultiHash</li>
|
|
</ul>
|
|
</div>
|
|
<div class="toolbuttons toolblock">
|
|
<ul>
|
|
<li id="smallA" class="t_button">A</li>
|
|
<li id="medA" class="t_button active">A</li>
|
|
<li id="bigA" class="t_button">A</li>
|
|
<li id="print" class="t_button"><a href="javascript:this.print();">
|
|
<span>Print</span></a></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">QMultiHash Class Reference</h1>
|
|
<!-- $$$QMultiHash-brief -->
|
|
<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>
|
|
<!-- @@@QMultiHash -->
|
|
<pre class="cpp"> <span class="preprocessor">#include <QMultiHash></span></pre><p><b>Inherits: </b><a href="qhash.html">QHash<Key, T></a>.</p>
|
|
<p><b>Note:</b> All functions in this class are <a href="threads-reentrancy.html#reentrant">reentrant</a>.</p>
|
|
<ul>
|
|
<li><a href="qmultihash-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="qmultihash.html#QMultiHash">QMultiHash</a></b> ()</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#QMultiHash-2">QMultiHash</a></b> ( const QHash<Key, T> & <i>other</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#constFind">constFind</a></b> ( const Key & <i>key</i>, const T & <i>value</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#constFind-2">constFind</a></b> ( const Key & <i>key</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#contains">contains</a></b> ( const Key & <i>key</i>, const T & <i>value</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> bool </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#contains-2">contains</a></b> ( const Key & <i>key</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#count">count</a></b> ( const Key & <i>key</i>, const T & <i>value</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#count-2">count</a></b> ( const Key & <i>key</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#count-3">count</a></b> () const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#find">find</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#find-2">find</a></b> ( const Key & <i>key</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#find-3">find</a></b> ( const Key & <i>key</i>, const T & <i>value</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::const_iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#find-4">find</a></b> ( const Key & <i>key</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#insert">insert</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#remove">remove</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> int </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#remove-2">remove</a></b> ( const Key & <i>key</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QHash<Key, T>::iterator </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#replace">replace</a></b> ( const Key & <i>key</i>, const T & <i>value</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> void </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#swap">swap</a></b> ( QMultiHash<Key, T> & <i>other</i> )</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QMultiHash </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#operator-2b">operator+</a></b> ( const QMultiHash & <i>other</i> ) const</td></tr>
|
|
<tr><td class="memItemLeft rightAlign topAlign"> QMultiHash & </td><td class="memItemRight bottomAlign"><b><a href="qmultihash.html#operator-2b-eq">operator+=</a></b> ( const QMultiHash & <i>other</i> )</td></tr>
|
|
</table>
|
|
<ul>
|
|
<li class="fn">40 public functions inherited from <a href="qhash.html#public-functions">QHash</a></li>
|
|
</ul>
|
|
<a name="details"></a>
|
|
<!-- $$$QMultiHash-description -->
|
|
<div class="descr">
|
|
<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</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 class="cpp"> <span class="type">QMultiHash</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> hash1<span class="operator">,</span> hash2<span class="operator">,</span> hash3;
|
|
|
|
hash1<span class="operator">.</span><a href="qmultihash.html#insert">insert</a>(<span class="string">"plenty"</span><span class="operator">,</span> <span class="number">100</span>);
|
|
hash1<span class="operator">.</span><a href="qmultihash.html#insert">insert</a>(<span class="string">"plenty"</span><span class="operator">,</span> <span class="number">2000</span>);
|
|
<span class="comment">// hash1.size() == 2</span>
|
|
|
|
hash2<span class="operator">.</span><a href="qmultihash.html#insert">insert</a>(<span class="string">"plenty"</span><span class="operator">,</span> <span class="number">5000</span>);
|
|
<span class="comment">// hash2.size() == 1</span>
|
|
|
|
hash3 <span class="operator">=</span> hash1 <span class="operator">+</span> hash2;
|
|
<span class="comment">// hash3.size() == 3</span></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 class="cpp"> <span class="type"><a href="qlist.html">QList</a></span><span class="operator"><</span><span class="type">int</span><span class="operator">></span> values <span class="operator">=</span> hash<span class="operator">.</span><a href="qhash.html#values">values</a>(<span class="string">"plenty"</span>);
|
|
<span class="keyword">for</span> (<span class="type">int</span> i <span class="operator">=</span> <span class="number">0</span>; i <span class="operator"><</span> values<span class="operator">.</span>size(); <span class="operator">+</span><span class="operator">+</span>i)
|
|
cout <span class="operator"><</span><span class="operator"><</span> values<span class="operator">.</span>at(i) <span class="operator"><</span><span class="operator"><</span> 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 call <a href="qmultihash.html#find">find</a>() to get the STL-style iterator for the first item with a key and iterate from there:</p>
|
|
<pre class="cpp"> <span class="type">QMultiHash</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="qmultihash.html#find">find</a>(<span class="string">"plenty"</span>);
|
|
<span class="keyword">while</span> (i <span class="operator">!</span><span class="operator">=</span> hash<span class="operator">.</span>end() <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">"plenty"</span>) {
|
|
cout <span class="operator"><</span><span class="operator"><</span> i<span class="operator">.</span>value() <span class="operator"><</span><span class="operator"><</span> endl;
|
|
<span class="operator">+</span><span class="operator">+</span>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="qsourcelocation.html#qHash">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>
|
|
</div>
|
|
<p><b>See also </b><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>
|
|
<!-- @@@QMultiHash -->
|
|
<div class="func">
|
|
<h2>Member Function Documentation</h2>
|
|
<!-- $$$QMultiHash[overload1]$$$QMultiHash -->
|
|
<h3 class="fn"><a name="QMultiHash"></a>QMultiHash::<span class="name">QMultiHash</span> ()</h3>
|
|
<p>Constructs an empty hash.</p>
|
|
<!-- @@@QMultiHash -->
|
|
<!-- $$$QMultiHash$$$QMultiHashconstQHash<Key,T>& -->
|
|
<h3 class="fn"><a name="QMultiHash-2"></a>QMultiHash::<span class="name">QMultiHash</span> ( const <span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>> & <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><b>See also </b><a href="qhash.html#operator-eq">operator=</a>().</p>
|
|
<!-- @@@QMultiHash -->
|
|
<!-- $$$constFind[overload1]$$$constFindconstKey&constT& -->
|
|
<h3 class="fn"><a name="constFind"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::const_iterator</span> QMultiHash::<span class="name">constFind</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> ) const</h3>
|
|
<p>Returns an iterator pointing to the item with the <i>key</i> and the <i>value</i> in the hash.</p>
|
|
<p>If the hash contains no such item, the function returns <a href="qhash.html#constEnd">constEnd</a>().</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<p><b>See also </b><a href="qhash.html#constFind">QHash::constFind</a>().</p>
|
|
<!-- @@@constFind -->
|
|
<!-- $$$constFind$$$constFindconstKey& -->
|
|
<h3 class="fn"><a name="constFind-2"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::const_iterator</span> QMultiHash::<span class="name">constFind</span> ( const <span class="type">Key</span> & <i>key</i> ) const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#constFind">QHash::constFind</a>().</p>
|
|
<!-- @@@constFind -->
|
|
<!-- $$$contains[overload1]$$$containsconstKey&constT& -->
|
|
<h3 class="fn"><a name="contains"></a><span class="type">bool</span> QMultiHash::<span class="name">contains</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> ) const</h3>
|
|
<p>Returns true if the hash contains an item with the <i>key</i> and <i>value</i>; otherwise returns false.</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<p><b>See also </b><a href="qhash.html#contains">QHash::contains</a>().</p>
|
|
<!-- @@@contains -->
|
|
<!-- $$$contains$$$containsconstKey& -->
|
|
<h3 class="fn"><a name="contains-2"></a><span class="type">bool</span> QMultiHash::<span class="name">contains</span> ( const <span class="type">Key</span> & <i>key</i> ) const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#contains">QHash::contains</a>().</p>
|
|
<!-- @@@contains -->
|
|
<!-- $$$count[overload1]$$$countconstKey&constT& -->
|
|
<h3 class="fn"><a name="count"></a><span class="type">int</span> QMultiHash::<span class="name">count</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> ) const</h3>
|
|
<p>Returns the number of items with the <i>key</i> and <i>value</i>.</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<p><b>See also </b><a href="qhash.html#count">QHash::count</a>().</p>
|
|
<!-- @@@count -->
|
|
<!-- $$$count$$$countconstKey& -->
|
|
<h3 class="fn"><a name="count-2"></a><span class="type">int</span> QMultiHash::<span class="name">count</span> ( const <span class="type">Key</span> & <i>key</i> ) const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#count">QHash::count</a>().</p>
|
|
<!-- @@@count -->
|
|
<!-- $$$count$$$count -->
|
|
<h3 class="fn"><a name="count-3"></a><span class="type">int</span> QMultiHash::<span class="name">count</span> () const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#count">QHash::count</a>().</p>
|
|
<!-- @@@count -->
|
|
<!-- $$$find[overload1]$$$findconstKey&constT& -->
|
|
<h3 class="fn"><a name="find"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::iterator</span> QMultiHash::<span class="name">find</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> )</h3>
|
|
<p>Returns an iterator pointing to the item with the <i>key</i> and <i>value</i>. If the hash contains no such item, the function returns <a href="qhash.html#end">end</a>().</p>
|
|
<p>If the hash contains multiple items with the <i>key</i> and <i>value</i>, the iterator returned points to the most recently inserted item.</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<p><b>See also </b><a href="qhash.html#find">QHash::find</a>().</p>
|
|
<!-- @@@find -->
|
|
<!-- $$$find$$$findconstKey& -->
|
|
<h3 class="fn"><a name="find-2"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::iterator</span> QMultiHash::<span class="name">find</span> ( const <span class="type">Key</span> & <i>key</i> )</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#find">QHash::find</a>().</p>
|
|
<!-- @@@find -->
|
|
<!-- $$$find$$$findconstKey&constT& -->
|
|
<h3 class="fn"><a name="find-3"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::const_iterator</span> QMultiHash::<span class="name">find</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> ) const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<!-- @@@find -->
|
|
<!-- $$$find$$$findconstKey& -->
|
|
<h3 class="fn"><a name="find-4"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::const_iterator</span> QMultiHash::<span class="name">find</span> ( const <span class="type">Key</span> & <i>key</i> ) const</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#find">QHash::find</a>().</p>
|
|
<!-- @@@find -->
|
|
<!-- $$$insert[overload1]$$$insertconstKey&constT& -->
|
|
<h3 class="fn"><a name="insert"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::iterator</span> QMultiHash::<span class="name">insert</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> )</h3>
|
|
<p>Inserts a new item with the <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><b>See also </b><a href="qmultihash.html#replace">replace</a>().</p>
|
|
<!-- @@@insert -->
|
|
<!-- $$$remove[overload1]$$$removeconstKey&constT& -->
|
|
<h3 class="fn"><a name="remove"></a><span class="type">int</span> QMultiHash::<span class="name">remove</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> )</h3>
|
|
<p>Removes all the items that have the <i>key</i> and the value <i>value</i> from the hash. Returns the number of items removed.</p>
|
|
<p>This function was introduced in Qt 4.3.</p>
|
|
<p><b>See also </b><a href="qhash.html#remove">QHash::remove</a>().</p>
|
|
<!-- @@@remove -->
|
|
<!-- $$$remove$$$removeconstKey& -->
|
|
<h3 class="fn"><a name="remove-2"></a><span class="type">int</span> QMultiHash::<span class="name">remove</span> ( const <span class="type">Key</span> & <i>key</i> )</h3>
|
|
<p>This is an overloaded function.</p>
|
|
<p><b>See also </b><a href="qhash.html#remove">QHash::remove</a>().</p>
|
|
<!-- @@@remove -->
|
|
<!-- $$$replace[overload1]$$$replaceconstKey&constT& -->
|
|
<h3 class="fn"><a name="replace"></a><span class="type"><a href="qhash.html">QHash</a></span><<span class="type">Key</span>, <span class="type">T</span>><span class="type">::iterator</span> QMultiHash::<span class="name">replace</span> ( const <span class="type">Key</span> & <i>key</i>, const <span class="type">T</span> & <i>value</i> )</h3>
|
|
<p>Inserts a new item with the <i>key</i> and a value of <i>value</i>.</p>
|
|
<p>If there is already an item with the <i>key</i>, that item's value is replaced with <i>value</i>.</p>
|
|
<p>If there are multiple items with the <i>key</i>, the most recently inserted item's value is replaced with <i>value</i>.</p>
|
|
<p><b>See also </b><a href="qmultihash.html#insert">insert</a>().</p>
|
|
<!-- @@@replace -->
|
|
<!-- $$$swap[overload1]$$$swapQMultiHash<Key,T>& -->
|
|
<h3 class="fn"><a name="swap"></a><span class="type">void</span> QMultiHash::<span class="name">swap</span> ( <span class="type">QMultiHash</span><<span class="type">Key</span>, <span class="type">T</span>> & <i>other</i> )</h3>
|
|
<p>Swaps hash <i>other</i> with this hash. This operation is very fast and never fails.</p>
|
|
<p>This function was introduced in Qt 4.8.</p>
|
|
<!-- @@@swap -->
|
|
<!-- $$$operator+[overload1]$$$operator+constQMultiHash& -->
|
|
<h3 class="fn"><a name="operator-2b"></a><span class="type">QMultiHash</span> QMultiHash::<span class="name">operator+</span> ( const <span class="type">QMultiHash</span> & <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><b>See also </b><a href="qmultihash.html#operator-2b-eq">operator+=</a>().</p>
|
|
<!-- @@@operator+ -->
|
|
<!-- $$$operator+=[overload1]$$$operator+=constQMultiHash& -->
|
|
<h3 class="fn"><a name="operator-2b-eq"></a><span class="type">QMultiHash</span> & QMultiHash::<span class="name">operator+=</span> ( const <span class="type">QMultiHash</span> & <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><b>See also </b><a href="qmultihash.html#insert">insert</a>().</p>
|
|
<!-- @@@operator+= -->
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="ft">
|
|
<span></span>
|
|
</div>
|
|
</div>
|
|
<div class="footer">
|
|
<p>
|
|
<acronym title="Copyright">©</acronym> 2015 The Qt Company Ltd.
|
|
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>
|
|
Qt and respective logos are trademarks of The Qt Company Ltd
|
|
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>
|
|
|
|
<script src="scripts/functions.js" type="text/javascript"></script>
|
|
</body>
|
|
</html>
|