<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: unordered_map.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a01103.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">unordered_map.h</div> </div>
</div>
<div class="contents">
<a href="a01103.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// unordered_map implementation -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2010, 2011 Free Software Foundation, Inc.</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00006"></a>00006 <span class="comment">// software; you can redistribute it and/or modify it under the</span>
<a name="l00007"></a>00007 <span class="comment">// terms of the GNU General Public License as published by the</span>
<a name="l00008"></a>00008 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00009"></a>00009 <span class="comment">// any later version.</span>
<a name="l00010"></a>00010
<a name="l00011"></a>00011 <span class="comment">// This library is distributed in the hope that it will be useful,</span>
<a name="l00012"></a>00012 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00013"></a>00013 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00014"></a>00014 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00015"></a>00015
<a name="l00016"></a>00016 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00017"></a>00017 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00018"></a>00018 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00021"></a>00021 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00022"></a>00022 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00023"></a>00023 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00024"></a>00024 <span class="comment"></span>
<a name="l00025"></a>00025 <span class="comment">/** @file bits/unordered_map.h</span>
<a name="l00026"></a>00026 <span class="comment"> * This is an internal header file, included by other library headers.</span>
<a name="l00027"></a>00027 <span class="comment"> * Do not attempt to use it directly. @headername{unordered_map}</span>
<a name="l00028"></a>00028 <span class="comment"> */</span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="preprocessor">#ifndef _UNORDERED_MAP_H</span>
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#define _UNORDERED_MAP_H</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span>
<a name="l00033"></a>00033 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00034"></a>00034 {
<a name="l00035"></a>00035 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="comment">// NB: When we get typedef templates these class definitions</span>
<a name="l00038"></a>00038 <span class="comment">// will be unnecessary.</span>
<a name="l00039"></a>00039 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp,
<a name="l00040"></a>00040 <span class="keyword">class </span>_Hash = hash<_Key>,
<a name="l00041"></a>00041 <span class="keyword">class </span>_Pred = <a class="code" href="a00462.html" title="One of the comparison functors.">std::equal_to<_Key></a>,
<a name="l00042"></a>00042 <span class="keyword">class </span>_Alloc = <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<std::pair<const _Key, _Tp></a> >,
<a name="l00043"></a>00043 <span class="keywordtype">bool</span> __cache_hash_code = <span class="keyword">false</span>>
<a name="l00044"></a>00044 <span class="keyword">class </span>__unordered_map
<a name="l00045"></a>00045 : <span class="keyword">public</span> _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
<a name="l00046"></a>00046 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
<a name="l00047"></a>00047 _Hash, __detail::_Mod_range_hashing,
<a name="l00048"></a>00048 __detail::_Default_ranged_hash,
<a name="l00049"></a>00049 __detail::_Prime_rehash_policy,
<a name="l00050"></a>00050 __cache_hash_code, false, true>
<a name="l00051"></a>00051 {
<a name="l00052"></a>00052 <span class="keyword">typedef</span> _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc,
<a name="l00053"></a>00053 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
<a name="l00054"></a>00054 _Hash, __detail::_Mod_range_hashing,
<a name="l00055"></a>00055 __detail::_Default_ranged_hash,
<a name="l00056"></a>00056 __detail::_Prime_rehash_policy,
<a name="l00057"></a>00057 __cache_hash_code, <span class="keyword">false</span>, <span class="keyword">true</span>>
<a name="l00058"></a>00058 _Base;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 <span class="keyword">public</span>:
<a name="l00061"></a>00061 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::value_type value_type;
<a name="l00062"></a>00062 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::size_type size_type;
<a name="l00063"></a>00063 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::hasher hasher;
<a name="l00064"></a>00064 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::key_equal key_equal;
<a name="l00065"></a>00065 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::allocator_type allocator_type;
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">explicit</span>
<a name="l00068"></a>00068 __unordered_map(size_type __n = 10,
<a name="l00069"></a>00069 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00070"></a>00070 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00071"></a>00071 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00072"></a>00072 : _Base(__n, __hf, __detail::_Mod_range_hashing(),
<a name="l00073"></a>00073 __detail::_Default_ranged_hash(),
<a name="l00074"></a>00074 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00075"></a>00075 { }
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00078"></a>00078 __unordered_map(_InputIterator __f, _InputIterator __l,
<a name="l00079"></a>00079 size_type __n = 0,
<a name="l00080"></a>00080 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00081"></a>00081 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00082"></a>00082 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00083"></a>00083 : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(),
<a name="l00084"></a>00084 __detail::_Default_ranged_hash(),
<a name="l00085"></a>00085 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00086"></a>00086 { }
<a name="l00087"></a>00087
<a name="l00088"></a>00088 __unordered_map(initializer_list<value_type> __l,
<a name="l00089"></a>00089 size_type __n = 0,
<a name="l00090"></a>00090 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00091"></a>00091 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00092"></a>00092 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00093"></a>00093 : _Base(__l.<a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>(), __l.<a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __n, __hf,
<a name="l00094"></a>00094 __detail::_Mod_range_hashing(),
<a name="l00095"></a>00095 __detail::_Default_ranged_hash(),
<a name="l00096"></a>00096 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00097"></a>00097 { }
<a name="l00098"></a>00098
<a name="l00099"></a>00099 __unordered_map&
<a name="l00100"></a>00100 operator=(initializer_list<value_type> __l)
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 this->clear();
<a name="l00103"></a>00103 this->insert(__l.begin(), __l.end());
<a name="l00104"></a>00104 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00105"></a>00105 }
<a name="l00106"></a>00106 };
<a name="l00107"></a>00107
<a name="l00108"></a>00108 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp,
<a name="l00109"></a>00109 <span class="keyword">class </span>_Hash = hash<_Key>,
<a name="l00110"></a>00110 <span class="keyword">class </span>_Pred = <a class="code" href="a00462.html" title="One of the comparison functors.">std::equal_to<_Key></a>,
<a name="l00111"></a>00111 <span class="keyword">class </span>_Alloc = <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<std::pair<const _Key, _Tp></a> >,
<a name="l00112"></a>00112 <span class="keywordtype">bool</span> __cache_hash_code = <span class="keyword">false</span>>
<a name="l00113"></a>00113 <span class="keyword">class </span>__unordered_multimap
<a name="l00114"></a>00114 : <span class="keyword">public</span> _Hashtable<_Key, std::pair<const _Key, _Tp>,
<a name="l00115"></a>00115 _Alloc,
<a name="l00116"></a>00116 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
<a name="l00117"></a>00117 _Hash, __detail::_Mod_range_hashing,
<a name="l00118"></a>00118 __detail::_Default_ranged_hash,
<a name="l00119"></a>00119 __detail::_Prime_rehash_policy,
<a name="l00120"></a>00120 __cache_hash_code, false, false>
<a name="l00121"></a>00121 {
<a name="l00122"></a>00122 <span class="keyword">typedef</span> _Hashtable<_Key, std::pair<const _Key, _Tp>,
<a name="l00123"></a>00123 _Alloc,
<a name="l00124"></a>00124 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
<a name="l00125"></a>00125 _Hash, __detail::_Mod_range_hashing,
<a name="l00126"></a>00126 __detail::_Default_ranged_hash,
<a name="l00127"></a>00127 __detail::_Prime_rehash_policy,
<a name="l00128"></a>00128 __cache_hash_code, <span class="keyword">false</span>, <span class="keyword">false</span>>
<a name="l00129"></a>00129 _Base;
<a name="l00130"></a>00130
<a name="l00131"></a>00131 <span class="keyword">public</span>:
<a name="l00132"></a>00132 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::value_type value_type;
<a name="l00133"></a>00133 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::size_type size_type;
<a name="l00134"></a>00134 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::hasher hasher;
<a name="l00135"></a>00135 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::key_equal key_equal;
<a name="l00136"></a>00136 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::allocator_type allocator_type;
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <span class="keyword">explicit</span>
<a name="l00139"></a>00139 __unordered_multimap(size_type __n = 10,
<a name="l00140"></a>00140 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00141"></a>00141 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00142"></a>00142 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00143"></a>00143 : _Base(__n, __hf, __detail::_Mod_range_hashing(),
<a name="l00144"></a>00144 __detail::_Default_ranged_hash(),
<a name="l00145"></a>00145 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00146"></a>00146 { }
<a name="l00147"></a>00147
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00150"></a>00150 __unordered_multimap(_InputIterator __f, _InputIterator __l,
<a name="l00151"></a>00151 size_type __n = 0,
<a name="l00152"></a>00152 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00153"></a>00153 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00154"></a>00154 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00155"></a>00155 : _Base(__f, __l, __n, __hf, __detail::_Mod_range_hashing(),
<a name="l00156"></a>00156 __detail::_Default_ranged_hash(),
<a name="l00157"></a>00157 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00158"></a>00158 { }
<a name="l00159"></a>00159
<a name="l00160"></a>00160 __unordered_multimap(initializer_list<value_type> __l,
<a name="l00161"></a>00161 size_type __n = 0,
<a name="l00162"></a>00162 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00163"></a>00163 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00164"></a>00164 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00165"></a>00165 : _Base(__l.<a class="code" href="a01137.html#a374103e627e735969f3357b0f771bc0d" title="Return an iterator pointing to the first element of the initilizer_list.">begin</a>(), __l.<a class="code" href="a01137.html#a6dd13574db6c6bda00577c2e1687960a" title="Return an iterator pointing to one past the last element of the initilizer_list.">end</a>(), __n, __hf,
<a name="l00166"></a>00166 __detail::_Mod_range_hashing(),
<a name="l00167"></a>00167 __detail::_Default_ranged_hash(),
<a name="l00168"></a>00168 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a)
<a name="l00169"></a>00169 { }
<a name="l00170"></a>00170
<a name="l00171"></a>00171 __unordered_multimap&
<a name="l00172"></a>00172 operator=(initializer_list<value_type> __l)
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174 this->clear();
<a name="l00175"></a>00175 this->insert(__l.begin(), __l.end());
<a name="l00176"></a>00176 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178 };
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00181"></a>00181 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00182"></a>00182 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00183"></a>00183 swap(__unordered_map<_Key, _Tp, _Hash, _Pred,
<a name="l00184"></a>00184 _Alloc, __cache_hash_code>& __x,
<a name="l00185"></a>00185 __unordered_map<_Key, _Tp, _Hash, _Pred,
<a name="l00186"></a>00186 _Alloc, __cache_hash_code>& __y)
<a name="l00187"></a>00187 { __x.swap(__y); }
<a name="l00188"></a>00188
<a name="l00189"></a>00189 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00190"></a>00190 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00191"></a>00191 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00192"></a>00192 swap(__unordered_multimap<_Key, _Tp, _Hash, _Pred,
<a name="l00193"></a>00193 _Alloc, __cache_hash_code>& __x,
<a name="l00194"></a>00194 __unordered_multimap<_Key, _Tp, _Hash, _Pred,
<a name="l00195"></a>00195 _Alloc, __cache_hash_code>& __y)
<a name="l00196"></a>00196 { __x.swap(__y); }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00199"></a>00199 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00200"></a>00200 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00201"></a>00201 operator==(<span class="keyword">const</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00202"></a>00202 __cache_hash_code>& __x,
<a name="l00203"></a>00203 <span class="keyword">const</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00204"></a>00204 __cache_hash_code>& __y)
<a name="l00205"></a>00205 { <span class="keywordflow">return</span> __x._M_equal(__y); }
<a name="l00206"></a>00206
<a name="l00207"></a>00207 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00208"></a>00208 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00209"></a>00209 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00210"></a>00210 operator!=(<span class="keyword">const</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00211"></a>00211 __cache_hash_code>& __x,
<a name="l00212"></a>00212 <span class="keyword">const</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00213"></a>00213 __cache_hash_code>& __y)
<a name="l00214"></a>00214 { <span class="keywordflow">return</span> !(__x == __y); }
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00217"></a>00217 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00218"></a>00218 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00219"></a>00219 operator==(<span class="keyword">const</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00220"></a>00220 __cache_hash_code>& __x,
<a name="l00221"></a>00221 <span class="keyword">const</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00222"></a>00222 __cache_hash_code>& __y)
<a name="l00223"></a>00223 { <span class="keywordflow">return</span> __x._M_equal(__y); }
<a name="l00224"></a>00224
<a name="l00225"></a>00225 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp, <span class="keyword">class </span>_Hash, <span class="keyword">class </span>_Pred, <span class="keyword">class </span>_Alloc,
<a name="l00226"></a>00226 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00227"></a>00227 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00228"></a>00228 operator!=(<span class="keyword">const</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00229"></a>00229 __cache_hash_code>& __x,
<a name="l00230"></a>00230 <span class="keyword">const</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc,
<a name="l00231"></a>00231 __cache_hash_code>& __y)
<a name="l00232"></a>00232 { <span class="keywordflow">return</span> !(__x == __y); }
<a name="l00233"></a>00233 <span class="comment"></span>
<a name="l00234"></a>00234 <span class="comment"> /**</span>
<a name="l00235"></a>00235 <span class="comment"> * @brief A standard container composed of unique keys (containing</span>
<a name="l00236"></a>00236 <span class="comment"> * at most one of each key value) that associates values of another type</span>
<a name="l00237"></a>00237 <span class="comment"> * with the keys.</span>
<a name="l00238"></a>00238 <span class="comment"> *</span>
<a name="l00239"></a>00239 <span class="comment"> * @ingroup unordered_associative_containers</span>
<a name="l00240"></a>00240 <span class="comment"> *</span>
<a name="l00241"></a>00241 <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span>
<a name="l00242"></a>00242 <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></span>
<a name="l00243"></a>00243 <span class="comment"> *</span>
<a name="l00244"></a>00244 <span class="comment"> * @param Key Type of key objects.</span>
<a name="l00245"></a>00245 <span class="comment"> * @param Tp Type of mapped objects.</span>
<a name="l00246"></a>00246 <span class="comment"> * @param Hash Hashing function object type, defaults to hash<Value>.</span>
<a name="l00247"></a>00247 <span class="comment"> * @param Pred Predicate function object type, defaults to equal_to<Value>.</span>
<a name="l00248"></a>00248 <span class="comment"> * @param Alloc Allocator type, defaults to allocator<Key>.</span>
<a name="l00249"></a>00249 <span class="comment"> *</span>
<a name="l00250"></a>00250 <span class="comment"> * The resulting value type of the container is std::pair<const Key, Tp>.</span>
<a name="l00251"></a>00251 <span class="comment"> */</span>
<a name="l00252"></a>00252 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp,
<a name="l00253"></a>00253 <span class="keyword">class </span>_Hash = hash<_Key>,
<a name="l00254"></a>00254 <span class="keyword">class </span>_Pred = <a class="code" href="a00462.html" title="One of the comparison functors.">std::equal_to<_Key></a>,
<a name="l00255"></a>00255 <span class="keyword">class </span>_Alloc = <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<std::pair<const _Key, _Tp></a> > >
<a name="l00256"></a><a class="code" href="a00733.html">00256</a> <span class="keyword">class </span><a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map</a>
<a name="l00257"></a>00257 : <span class="keyword">public</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>
<a name="l00258"></a>00258 {
<a name="l00259"></a>00259 <span class="keyword">typedef</span> __unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
<a name="l00260"></a>00260
<a name="l00261"></a>00261 <span class="keyword">public</span>:
<a name="l00262"></a>00262 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Base::value_type</a> value_type;
<a name="l00263"></a>00263 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::size_type size_type;
<a name="l00264"></a>00264 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::hasher hasher;
<a name="l00265"></a>00265 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::key_equal key_equal;
<a name="l00266"></a>00266 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::allocator_type allocator_type;
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keyword">explicit</span>
<a name="l00269"></a>00269 <a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map</a>(size_type __n = 10,
<a name="l00270"></a>00270 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00271"></a>00271 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00272"></a>00272 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00273"></a>00273 : _Base(__n, __hf, __eql, __a)
<a name="l00274"></a>00274 { }
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00277"></a>00277 <a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map</a>(_InputIterator __f, _InputIterator __l,
<a name="l00278"></a>00278 size_type __n = 0,
<a name="l00279"></a>00279 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00280"></a>00280 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00281"></a>00281 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00282"></a>00282 : _Base(__f, __l, __n, __hf, __eql, __a)
<a name="l00283"></a>00283 { }
<a name="l00284"></a>00284
<a name="l00285"></a>00285 <a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map</a>(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l,
<a name="l00286"></a>00286 size_type __n = 0,
<a name="l00287"></a>00287 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00288"></a>00288 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00289"></a>00289 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00290"></a>00290 : _Base(__l.begin(), __l.end(), __n, __hf, __eql, __a)
<a name="l00291"></a>00291 { }
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map</a>&
<a name="l00294"></a>00294 operator=(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l)
<a name="l00295"></a>00295 {
<a name="l00296"></a>00296 this->clear();
<a name="l00297"></a>00297 this->insert(__l.begin(), __l.end());
<a name="l00298"></a>00298 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00299"></a>00299 }
<a name="l00300"></a>00300 };
<a name="l00301"></a>00301 <span class="comment"></span>
<a name="l00302"></a>00302 <span class="comment"> /**</span>
<a name="l00303"></a>00303 <span class="comment"> * @brief A standard container composed of equivalent keys</span>
<a name="l00304"></a>00304 <span class="comment"> * (possibly containing multiple of each key value) that associates</span>
<a name="l00305"></a>00305 <span class="comment"> * values of another type with the keys.</span>
<a name="l00306"></a>00306 <span class="comment"> *</span>
<a name="l00307"></a>00307 <span class="comment"> * @ingroup unordered_associative_containers</span>
<a name="l00308"></a>00308 <span class="comment"> *</span>
<a name="l00309"></a>00309 <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, and</span>
<a name="l00310"></a>00310 <span class="comment"> * <a href="tables.html#xx">unordered associative container</a></span>
<a name="l00311"></a>00311 <span class="comment"> *</span>
<a name="l00312"></a>00312 <span class="comment"> * @param Key Type of key objects.</span>
<a name="l00313"></a>00313 <span class="comment"> * @param Tp Type of mapped objects.</span>
<a name="l00314"></a>00314 <span class="comment"> * @param Hash Hashing function object type, defaults to hash<Value>.</span>
<a name="l00315"></a>00315 <span class="comment"> * @param Pred Predicate function object type, defaults to equal_to<Value>.</span>
<a name="l00316"></a>00316 <span class="comment"> * @param Alloc Allocator type, defaults to allocator<Key>.</span>
<a name="l00317"></a>00317 <span class="comment"> *</span>
<a name="l00318"></a>00318 <span class="comment"> * The resulting value type of the container is std::pair<const Key, Tp>.</span>
<a name="l00319"></a>00319 <span class="comment"> */</span>
<a name="l00320"></a>00320 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp,
<a name="l00321"></a>00321 <span class="keyword">class </span>_Hash = <a class="code" href="a00498.html" title="Primary class template hash.">hash<_Key></a>,
<a name="l00322"></a>00322 <span class="keyword">class </span>_Pred = <a class="code" href="a00462.html" title="One of the comparison functors.">std::equal_to<_Key></a>,
<a name="l00323"></a>00323 <span class="keyword">class </span>_Alloc = <a class="code" href="a00246.html" title="The standard allocator, as per [20.4].Further details: http://gcc.gnu.org/onlinedocs/libstdc++/manual...">std::allocator<std::pair<const _Key, _Tp></a> > >
<a name="l00324"></a><a class="code" href="a00734.html">00324</a> <span class="keyword">class </span><a class="code" href="a00734.html" title="A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...">unordered_multimap</a>
<a name="l00325"></a>00325 : <span class="keyword">public</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>
<a name="l00326"></a>00326 {
<a name="l00327"></a>00327 <span class="keyword">typedef</span> __unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> _Base;
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="keyword">public</span>:
<a name="l00330"></a>00330 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Base::value_type</a> value_type;
<a name="l00331"></a>00331 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::size_type size_type;
<a name="l00332"></a>00332 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::hasher hasher;
<a name="l00333"></a>00333 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::key_equal key_equal;
<a name="l00334"></a>00334 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Base::allocator_type allocator_type;
<a name="l00335"></a>00335
<a name="l00336"></a>00336 <span class="keyword">explicit</span>
<a name="l00337"></a>00337 <a class="code" href="a00734.html" title="A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...">unordered_multimap</a>(size_type __n = 10,
<a name="l00338"></a>00338 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00339"></a>00339 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00340"></a>00340 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00341"></a>00341 : _Base(__n, __hf, __eql, __a)
<a name="l00342"></a>00342 { }
<a name="l00343"></a>00343
<a name="l00344"></a>00344 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00345"></a>00345 <a class="code" href="a00734.html" title="A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...">unordered_multimap</a>(_InputIterator __f, _InputIterator __l,
<a name="l00346"></a>00346 size_type __n = 0,
<a name="l00347"></a>00347 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00348"></a>00348 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00349"></a>00349 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00350"></a>00350 : _Base(__f, __l, __n, __hf, __eql, __a)
<a name="l00351"></a>00351 { }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 <a class="code" href="a00734.html" title="A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...">unordered_multimap</a>(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l,
<a name="l00354"></a>00354 size_type __n = 0,
<a name="l00355"></a>00355 <span class="keyword">const</span> hasher& __hf = hasher(),
<a name="l00356"></a>00356 <span class="keyword">const</span> key_equal& __eql = key_equal(),
<a name="l00357"></a>00357 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00358"></a>00358 : _Base(__l.begin(), __l.end(), __n, __hf, __eql, __a)
<a name="l00359"></a>00359 { }
<a name="l00360"></a>00360
<a name="l00361"></a>00361 <a class="code" href="a00734.html" title="A standard container composed of equivalent keys (possibly containing multiple of each key value) tha...">unordered_multimap</a>&
<a name="l00362"></a>00362 operator=(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l)
<a name="l00363"></a>00363 {
<a name="l00364"></a>00364 this->clear();
<a name="l00365"></a>00365 this->insert(__l.begin(), __l.end());
<a name="l00366"></a>00366 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00367"></a>00367 }
<a name="l00368"></a>00368 };
<a name="l00369"></a>00369
<a name="l00370"></a>00370 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00371"></a>00371 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00372"></a>00372 swap(<a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc></a>& __x,
<a name="l00373"></a>00373 <a class="code" href="a00733.html" title="A standard container composed of unique keys (containing at most one of each key value) that associat...">unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc></a>& __y)
<a name="l00374"></a>00374 { __x.swap(__y); }
<a name="l00375"></a>00375
<a name="l00376"></a>00376 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00377"></a>00377 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00378"></a>00378 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
<a name="l00379"></a>00379 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
<a name="l00380"></a>00380 { __x.swap(__y); }
<a name="l00381"></a>00381
<a name="l00382"></a>00382 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00383"></a>00383 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00384"></a>00384 operator==(<span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
<a name="l00385"></a>00385 <span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
<a name="l00386"></a>00386 { <span class="keywordflow">return</span> __x._M_equal(__y); }
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00389"></a>00389 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00390"></a>00390 operator!=(<span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
<a name="l00391"></a>00391 <span class="keyword">const</span> unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
<a name="l00392"></a>00392 { <span class="keywordflow">return</span> !(__x == __y); }
<a name="l00393"></a>00393
<a name="l00394"></a>00394 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00395"></a>00395 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00396"></a>00396 operator==(<span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
<a name="l00397"></a>00397 <span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
<a name="l00398"></a>00398 { <span class="keywordflow">return</span> __x._M_equal(__y); }
<a name="l00399"></a>00399
<a name="l00400"></a>00400 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _Hash, <span class="keyword">class</span> _Pred, <span class="keyword">class</span> _Alloc>
<a name="l00401"></a>00401 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00402"></a>00402 operator!=(<span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
<a name="l00403"></a>00403 <span class="keyword">const</span> unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
<a name="l00404"></a>00404 { <span class="keywordflow">return</span> !(__x == __y); }
<a name="l00405"></a>00405
<a name="l00406"></a>00406 _GLIBCXX_END_NAMESPACE_CONTAINER
<a name="l00407"></a>00407 } <span class="comment">// namespace std</span>
<a name="l00408"></a>00408
<a name="l00409"></a>00409 <span class="preprocessor">#endif </span><span class="comment">/* _UNORDERED_MAP_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01103.html">unordered_map.h</a> </li>
<li class="footer">Generated by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </li>
</ul>
</div>
</body>
</html>
