<!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++: hashtable_policy.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('a00904.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">hashtable_policy.h</div> </div>
</div>
<div class="contents">
<a href="a00904.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Internal policy header for unordered_set and unordered_map -*- 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/hashtable_policy.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.</span>
<a name="l00028"></a>00028 <span class="comment"> * @headername{unordered_map,unordered_set}</span>
<a name="l00029"></a>00029 <span class="comment"> */</span>
<a name="l00030"></a>00030
<a name="l00031"></a>00031 <span class="preprocessor">#ifndef _HASHTABLE_POLICY_H</span>
<a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#define _HASHTABLE_POLICY_H 1</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span>
<a name="l00034"></a>00034 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00035"></a>00035 {
<a name="l00036"></a>00036 <span class="keyword">namespace </span>__detail
<a name="l00037"></a>00037 {
<a name="l00038"></a>00038 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="comment">// Helper function: return distance(first, last) for forward</span>
<a name="l00041"></a>00041 <span class="comment">// iterators, or 0 for input iterators.</span>
<a name="l00042"></a>00042 <span class="keyword">template</span><<span class="keyword">class</span> _Iterator>
<a name="l00043"></a>00043 <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type
<a name="l00044"></a>00044 __distance_fw(_Iterator __first, _Iterator __last,
<a name="l00045"></a>00045 <a class="code" href="a00525.html" title="Marking input iterators.">std::input_iterator_tag</a>)
<a name="l00046"></a>00046 { <span class="keywordflow">return</span> 0; }
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="keyword">template</span><<span class="keyword">class</span> _Iterator>
<a name="l00049"></a>00049 <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type
<a name="l00050"></a>00050 __distance_fw(_Iterator __first, _Iterator __last,
<a name="l00051"></a>00051 <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a>)
<a name="l00052"></a>00052 { <span class="keywordflow">return</span> <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__first, __last); }
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="keyword">template</span><<span class="keyword">class</span> _Iterator>
<a name="l00055"></a>00055 <span class="keyword">inline</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::difference_type
<a name="l00056"></a>00056 __distance_fw(_Iterator __first, _Iterator __last)
<a name="l00057"></a>00057 {
<a name="l00058"></a>00058 <span class="keyword">typedef</span> <span class="keyword">typename</span> std::iterator_traits<_Iterator>::iterator_category _Tag;
<a name="l00059"></a>00059 <span class="keywordflow">return</span> __distance_fw(__first, __last, _Tag());
<a name="l00060"></a>00060 }
<a name="l00061"></a>00061
<a name="l00062"></a>00062 <span class="comment">// Auxiliary types used for all instantiations of _Hashtable: nodes</span>
<a name="l00063"></a>00063 <span class="comment">// and iterators.</span>
<a name="l00064"></a>00064
<a name="l00065"></a>00065 <span class="comment">// Nodes, used to wrap elements stored in the hash table. A policy</span>
<a name="l00066"></a>00066 <span class="comment">// template parameter of class template _Hashtable controls whether</span>
<a name="l00067"></a>00067 <span class="comment">// nodes also store a hash code. In some cases (e.g. strings) this</span>
<a name="l00068"></a>00068 <span class="comment">// may be a performance win.</span>
<a name="l00069"></a>00069 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00070"></a>00070 <span class="keyword">struct </span>_Hash_node;
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keyword">template</span><<span class="keyword">typename</span> _Value>
<a name="l00073"></a>00073 <span class="keyword">struct </span>_Hash_node<_Value, true>
<a name="l00074"></a>00074 {
<a name="l00075"></a>00075 _Value _M_v;
<a name="l00076"></a>00076 std::size_t _M_hash_code;
<a name="l00077"></a>00077 _Hash_node* _M_next;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <span class="keyword">template</span><<span class="keyword">typename</span>... _Args>
<a name="l00080"></a>00080 _Hash_node(_Args&&... __args)
<a name="l00081"></a>00081 : _M_v(std::<a class="code" href="a01137.html#ae3a272cdca779619a1d3fc561fde11e7" title="forward (as per N3143)">forward</a><_Args>(__args)...),
<a name="l00082"></a>00082 _M_hash_code(), _M_next() { }
<a name="l00083"></a>00083 };
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keyword">template</span><<span class="keyword">typename</span> _Value>
<a name="l00086"></a>00086 <span class="keyword">struct </span>_Hash_node<_Value, false>
<a name="l00087"></a>00087 {
<a name="l00088"></a>00088 _Value _M_v;
<a name="l00089"></a>00089 _Hash_node* _M_next;
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="keyword">template</span><<span class="keyword">typename</span>... _Args>
<a name="l00092"></a>00092 _Hash_node(_Args&&... __args)
<a name="l00093"></a>00093 : _M_v(std::<a class="code" href="a01137.html#ae3a272cdca779619a1d3fc561fde11e7" title="forward (as per N3143)">forward</a><_Args>(__args)...),
<a name="l00094"></a>00094 _M_next() { }
<a name="l00095"></a>00095 };
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="comment">// Local iterators, used to iterate within a bucket but not between</span>
<a name="l00098"></a>00098 <span class="comment">// buckets.</span>
<a name="l00099"></a>00099 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00100"></a>00100 <span class="keyword">struct </span>_Node_iterator_base
<a name="l00101"></a>00101 {
<a name="l00102"></a>00102 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
<a name="l00103"></a>00103 : _M_cur(__p) { }
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="keywordtype">void</span>
<a name="l00106"></a>00106 _M_incr()
<a name="l00107"></a>00107 { _M_cur = _M_cur->_M_next; }
<a name="l00108"></a>00108
<a name="l00109"></a>00109 _Hash_node<_Value, __cache>* _M_cur;
<a name="l00110"></a>00110 };
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00113"></a>00113 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00114"></a>00114 operator==(<span class="keyword">const</span> _Node_iterator_base<_Value, __cache>& __x,
<a name="l00115"></a>00115 <span class="keyword">const</span> _Node_iterator_base<_Value, __cache>& __y)
<a name="l00116"></a>00116 { <span class="keywordflow">return</span> __x._M_cur == __y._M_cur; }
<a name="l00117"></a>00117
<a name="l00118"></a>00118 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00119"></a>00119 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00120"></a>00120 operator!=(<span class="keyword">const</span> _Node_iterator_base<_Value, __cache>& __x,
<a name="l00121"></a>00121 <span class="keyword">const</span> _Node_iterator_base<_Value, __cache>& __y)
<a name="l00122"></a>00122 { <span class="keywordflow">return</span> __x._M_cur != __y._M_cur; }
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache>
<a name="l00125"></a>00125 <span class="keyword">struct </span>_Node_iterator
<a name="l00126"></a>00126 : <span class="keyword">public</span> _Node_iterator_base<_Value, __cache>
<a name="l00127"></a>00127 {
<a name="l00128"></a>00128 <span class="keyword">typedef</span> _Value value_type;
<a name="l00129"></a>00129 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00437.html" title="conditional">std::conditional</a><__constant_iterators,
<a name="l00130"></a>00130 <span class="keyword">const</span> _Value*, _Value*>::type
<a name="l00131"></a>00131 pointer;
<a name="l00132"></a>00132 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00437.html" title="conditional">std::conditional</a><__constant_iterators,
<a name="l00133"></a>00133 <span class="keyword">const</span> _Value&, _Value&>::type
<a name="l00134"></a>00134 reference;
<a name="l00135"></a>00135 <span class="keyword">typedef</span> std::ptrdiff_t difference_type;
<a name="l00136"></a>00136 <span class="keyword">typedef</span> <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a> iterator_category;
<a name="l00137"></a>00137
<a name="l00138"></a>00138 _Node_iterator()
<a name="l00139"></a>00139 : _Node_iterator_base<_Value, __cache>(0) { }
<a name="l00140"></a>00140
<a name="l00141"></a>00141 <span class="keyword">explicit</span>
<a name="l00142"></a>00142 _Node_iterator(_Hash_node<_Value, __cache>* __p)
<a name="l00143"></a>00143 : _Node_iterator_base<_Value, __cache>(__p) { }
<a name="l00144"></a>00144
<a name="l00145"></a>00145 reference
<a name="l00146"></a>00146 <a class="code" href="a01166.html#ga02bdbe21b5a753599173b4e2c77b5497" title="Return new complex value x times y.">operator*</a>()<span class="keyword"> const</span>
<a name="l00147"></a>00147 <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_v; }
<a name="l00148"></a>00148
<a name="l00149"></a>00149 pointer
<a name="l00150"></a>00150 operator->()<span class="keyword"> const</span>
<a name="l00151"></a>00151 <span class="keyword"> </span>{ <span class="keywordflow">return</span> std::__addressof(this->_M_cur->_M_v); }
<a name="l00152"></a>00152
<a name="l00153"></a>00153 _Node_iterator&
<a name="l00154"></a>00154 operator++()
<a name="l00155"></a>00155 {
<a name="l00156"></a>00156 this->_M_incr();
<a name="l00157"></a>00157 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159
<a name="l00160"></a>00160 _Node_iterator
<a name="l00161"></a>00161 operator++(<span class="keywordtype">int</span>)
<a name="l00162"></a>00162 {
<a name="l00163"></a>00163 _Node_iterator __tmp(*<span class="keyword">this</span>);
<a name="l00164"></a>00164 this->_M_incr();
<a name="l00165"></a>00165 <span class="keywordflow">return</span> __tmp;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167 };
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache>
<a name="l00170"></a>00170 <span class="keyword">struct </span>_Node_const_iterator
<a name="l00171"></a>00171 : <span class="keyword">public</span> _Node_iterator_base<_Value, __cache>
<a name="l00172"></a>00172 {
<a name="l00173"></a>00173 <span class="keyword">typedef</span> _Value value_type;
<a name="l00174"></a>00174 <span class="keyword">typedef</span> <span class="keyword">const</span> _Value* pointer;
<a name="l00175"></a>00175 <span class="keyword">typedef</span> <span class="keyword">const</span> _Value& reference;
<a name="l00176"></a>00176 <span class="keyword">typedef</span> std::ptrdiff_t difference_type;
<a name="l00177"></a>00177 <span class="keyword">typedef</span> <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a> iterator_category;
<a name="l00178"></a>00178
<a name="l00179"></a>00179 _Node_const_iterator()
<a name="l00180"></a>00180 : _Node_iterator_base<_Value, __cache>(0) { }
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keyword">explicit</span>
<a name="l00183"></a>00183 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
<a name="l00184"></a>00184 : _Node_iterator_base<_Value, __cache>(__p) { }
<a name="l00185"></a>00185
<a name="l00186"></a>00186 _Node_const_iterator(<span class="keyword">const</span> _Node_iterator<_Value, __constant_iterators,
<a name="l00187"></a>00187 __cache>& __x)
<a name="l00188"></a>00188 : _Node_iterator_base<_Value, __cache>(__x._M_cur) { }
<a name="l00189"></a>00189
<a name="l00190"></a>00190 reference
<a name="l00191"></a>00191 <a class="code" href="a01166.html#ga02bdbe21b5a753599173b4e2c77b5497" title="Return new complex value x times y.">operator*</a>()<span class="keyword"> const</span>
<a name="l00192"></a>00192 <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur->_M_v; }
<a name="l00193"></a>00193
<a name="l00194"></a>00194 pointer
<a name="l00195"></a>00195 operator->()<span class="keyword"> const</span>
<a name="l00196"></a>00196 <span class="keyword"> </span>{ <span class="keywordflow">return</span> std::__addressof(this->_M_cur->_M_v); }
<a name="l00197"></a>00197
<a name="l00198"></a>00198 _Node_const_iterator&
<a name="l00199"></a>00199 operator++()
<a name="l00200"></a>00200 {
<a name="l00201"></a>00201 this->_M_incr();
<a name="l00202"></a>00202 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00203"></a>00203 }
<a name="l00204"></a>00204
<a name="l00205"></a>00205 _Node_const_iterator
<a name="l00206"></a>00206 operator++(<span class="keywordtype">int</span>)
<a name="l00207"></a>00207 {
<a name="l00208"></a>00208 _Node_const_iterator __tmp(*<span class="keyword">this</span>);
<a name="l00209"></a>00209 this->_M_incr();
<a name="l00210"></a>00210 <span class="keywordflow">return</span> __tmp;
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212 };
<a name="l00213"></a>00213
<a name="l00214"></a>00214 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00215"></a>00215 <span class="keyword">struct </span>_Hashtable_iterator_base
<a name="l00216"></a>00216 {
<a name="l00217"></a>00217 _Hashtable_iterator_base(_Hash_node<_Value, __cache>* __node,
<a name="l00218"></a>00218 _Hash_node<_Value, __cache>** __bucket)
<a name="l00219"></a>00219 : _M_cur_node(__node), _M_cur_bucket(__bucket) { }
<a name="l00220"></a>00220
<a name="l00221"></a>00221 <span class="keywordtype">void</span>
<a name="l00222"></a>00222 _M_incr()
<a name="l00223"></a>00223 {
<a name="l00224"></a>00224 _M_cur_node = _M_cur_node->_M_next;
<a name="l00225"></a>00225 <span class="keywordflow">if</span> (!_M_cur_node)
<a name="l00226"></a>00226 _M_incr_bucket();
<a name="l00227"></a>00227 }
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keywordtype">void</span>
<a name="l00230"></a>00230 _M_incr_bucket();
<a name="l00231"></a>00231
<a name="l00232"></a>00232 _Hash_node<_Value, __cache>* _M_cur_node;
<a name="l00233"></a>00233 _Hash_node<_Value, __cache>** _M_cur_bucket;
<a name="l00234"></a>00234 };
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="comment">// Global iterators, used for arbitrary iteration within a hash</span>
<a name="l00237"></a>00237 <span class="comment">// table. Larger and more expensive than local iterators.</span>
<a name="l00238"></a>00238 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00239"></a>00239 <span class="keywordtype">void</span>
<a name="l00240"></a>00240 _Hashtable_iterator_base<_Value, __cache>::
<a name="l00241"></a>00241 _M_incr_bucket()
<a name="l00242"></a>00242 {
<a name="l00243"></a>00243 ++_M_cur_bucket;
<a name="l00244"></a>00244
<a name="l00245"></a>00245 <span class="comment">// This loop requires the bucket array to have a non-null sentinel.</span>
<a name="l00246"></a>00246 <span class="keywordflow">while</span> (!*_M_cur_bucket)
<a name="l00247"></a>00247 ++_M_cur_bucket;
<a name="l00248"></a>00248 _M_cur_node = *_M_cur_bucket;
<a name="l00249"></a>00249 }
<a name="l00250"></a>00250
<a name="l00251"></a>00251 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00252"></a>00252 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00253"></a>00253 operator==(<span class="keyword">const</span> _Hashtable_iterator_base<_Value, __cache>& __x,
<a name="l00254"></a>00254 <span class="keyword">const</span> _Hashtable_iterator_base<_Value, __cache>& __y)
<a name="l00255"></a>00255 { <span class="keywordflow">return</span> __x._M_cur_node == __y._M_cur_node; }
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __cache>
<a name="l00258"></a>00258 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00259"></a>00259 operator!=(<span class="keyword">const</span> _Hashtable_iterator_base<_Value, __cache>& __x,
<a name="l00260"></a>00260 <span class="keyword">const</span> _Hashtable_iterator_base<_Value, __cache>& __y)
<a name="l00261"></a>00261 { <span class="keywordflow">return</span> __x._M_cur_node != __y._M_cur_node; }
<a name="l00262"></a>00262
<a name="l00263"></a>00263 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache>
<a name="l00264"></a>00264 <span class="keyword">struct </span>_Hashtable_iterator
<a name="l00265"></a>00265 : <span class="keyword">public</span> _Hashtable_iterator_base<_Value, __cache>
<a name="l00266"></a>00266 {
<a name="l00267"></a>00267 <span class="keyword">typedef</span> _Value value_type;
<a name="l00268"></a>00268 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00437.html" title="conditional">std::conditional</a><__constant_iterators,
<a name="l00269"></a>00269 <span class="keyword">const</span> _Value*, _Value*>::type
<a name="l00270"></a>00270 pointer;
<a name="l00271"></a>00271 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00437.html" title="conditional">std::conditional</a><__constant_iterators,
<a name="l00272"></a>00272 <span class="keyword">const</span> _Value&, _Value&>::type
<a name="l00273"></a>00273 reference;
<a name="l00274"></a>00274 <span class="keyword">typedef</span> std::ptrdiff_t difference_type;
<a name="l00275"></a>00275 <span class="keyword">typedef</span> <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a> iterator_category;
<a name="l00276"></a>00276
<a name="l00277"></a>00277 _Hashtable_iterator()
<a name="l00278"></a>00278 : _Hashtable_iterator_base<_Value, __cache>(0, 0) { }
<a name="l00279"></a>00279
<a name="l00280"></a>00280 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
<a name="l00281"></a>00281 _Hash_node<_Value, __cache>** __b)
<a name="l00282"></a>00282 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
<a name="l00283"></a>00283
<a name="l00284"></a>00284 <span class="keyword">explicit</span>
<a name="l00285"></a>00285 _Hashtable_iterator(_Hash_node<_Value, __cache>** __b)
<a name="l00286"></a>00286 : _Hashtable_iterator_base<_Value, __cache>(*__b, __b) { }
<a name="l00287"></a>00287
<a name="l00288"></a>00288 reference
<a name="l00289"></a>00289 <a class="code" href="a01166.html#ga02bdbe21b5a753599173b4e2c77b5497" title="Return new complex value x times y.">operator*</a>()<span class="keyword"> const</span>
<a name="l00290"></a>00290 <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur_node->_M_v; }
<a name="l00291"></a>00291
<a name="l00292"></a>00292 pointer
<a name="l00293"></a>00293 operator->()<span class="keyword"> const</span>
<a name="l00294"></a>00294 <span class="keyword"> </span>{ <span class="keywordflow">return</span> std::__addressof(this->_M_cur_node->_M_v); }
<a name="l00295"></a>00295
<a name="l00296"></a>00296 _Hashtable_iterator&
<a name="l00297"></a>00297 operator++()
<a name="l00298"></a>00298 {
<a name="l00299"></a>00299 this->_M_incr();
<a name="l00300"></a>00300 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302
<a name="l00303"></a>00303 _Hashtable_iterator
<a name="l00304"></a>00304 operator++(<span class="keywordtype">int</span>)
<a name="l00305"></a>00305 {
<a name="l00306"></a>00306 _Hashtable_iterator __tmp(*<span class="keyword">this</span>);
<a name="l00307"></a>00307 this->_M_incr();
<a name="l00308"></a>00308 <span class="keywordflow">return</span> __tmp;
<a name="l00309"></a>00309 }
<a name="l00310"></a>00310 };
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keyword">template</span><<span class="keyword">typename</span> _Value, <span class="keywordtype">bool</span> __constant_iterators, <span class="keywordtype">bool</span> __cache>
<a name="l00313"></a>00313 <span class="keyword">struct </span>_Hashtable_const_iterator
<a name="l00314"></a>00314 : <span class="keyword">public</span> _Hashtable_iterator_base<_Value, __cache>
<a name="l00315"></a>00315 {
<a name="l00316"></a>00316 <span class="keyword">typedef</span> _Value value_type;
<a name="l00317"></a>00317 <span class="keyword">typedef</span> <span class="keyword">const</span> _Value* pointer;
<a name="l00318"></a>00318 <span class="keyword">typedef</span> <span class="keyword">const</span> _Value& reference;
<a name="l00319"></a>00319 <span class="keyword">typedef</span> std::ptrdiff_t difference_type;
<a name="l00320"></a>00320 <span class="keyword">typedef</span> <a class="code" href="a00474.html" title="Forward iterators support a superset of input iterator operations.">std::forward_iterator_tag</a> iterator_category;
<a name="l00321"></a>00321
<a name="l00322"></a>00322 _Hashtable_const_iterator()
<a name="l00323"></a>00323 : _Hashtable_iterator_base<_Value, __cache>(0, 0) { }
<a name="l00324"></a>00324
<a name="l00325"></a>00325 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
<a name="l00326"></a>00326 _Hash_node<_Value, __cache>** __b)
<a name="l00327"></a>00327 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
<a name="l00328"></a>00328
<a name="l00329"></a>00329 <span class="keyword">explicit</span>
<a name="l00330"></a>00330 _Hashtable_const_iterator(_Hash_node<_Value, __cache>** __b)
<a name="l00331"></a>00331 : _Hashtable_iterator_base<_Value, __cache>(*__b, __b) { }
<a name="l00332"></a>00332
<a name="l00333"></a>00333 _Hashtable_const_iterator(<span class="keyword">const</span> _Hashtable_iterator<_Value,
<a name="l00334"></a>00334 __constant_iterators, __cache>& __x)
<a name="l00335"></a>00335 : _Hashtable_iterator_base<_Value, __cache>(__x._M_cur_node,
<a name="l00336"></a>00336 __x._M_cur_bucket) { }
<a name="l00337"></a>00337
<a name="l00338"></a>00338 reference
<a name="l00339"></a>00339 <a class="code" href="a01166.html#ga02bdbe21b5a753599173b4e2c77b5497" title="Return new complex value x times y.">operator*</a>()<span class="keyword"> const</span>
<a name="l00340"></a>00340 <span class="keyword"> </span>{ <span class="keywordflow">return</span> this->_M_cur_node->_M_v; }
<a name="l00341"></a>00341
<a name="l00342"></a>00342 pointer
<a name="l00343"></a>00343 operator->()<span class="keyword"> const</span>
<a name="l00344"></a>00344 <span class="keyword"> </span>{ <span class="keywordflow">return</span> std::__addressof(this->_M_cur_node->_M_v); }
<a name="l00345"></a>00345
<a name="l00346"></a>00346 _Hashtable_const_iterator&
<a name="l00347"></a>00347 operator++()
<a name="l00348"></a>00348 {
<a name="l00349"></a>00349 this->_M_incr();
<a name="l00350"></a>00350 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00351"></a>00351 }
<a name="l00352"></a>00352
<a name="l00353"></a>00353 _Hashtable_const_iterator
<a name="l00354"></a>00354 operator++(<span class="keywordtype">int</span>)
<a name="l00355"></a>00355 {
<a name="l00356"></a>00356 _Hashtable_const_iterator __tmp(*<span class="keyword">this</span>);
<a name="l00357"></a>00357 this->_M_incr();
<a name="l00358"></a>00358 <span class="keywordflow">return</span> __tmp;
<a name="l00359"></a>00359 }
<a name="l00360"></a>00360 };
<a name="l00361"></a>00361
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="comment">// Many of class template _Hashtable's template parameters are policy</span>
<a name="l00364"></a>00364 <span class="comment">// classes. These are defaults for the policies.</span>
<a name="l00365"></a>00365
<a name="l00366"></a>00366 <span class="comment">// Default range hashing function: use division to fold a large number</span>
<a name="l00367"></a>00367 <span class="comment">// into the range [0, N).</span>
<a name="l00368"></a>00368 <span class="keyword">struct </span>_Mod_range_hashing
<a name="l00369"></a>00369 {
<a name="l00370"></a>00370 <span class="keyword">typedef</span> std::size_t first_argument_type;
<a name="l00371"></a>00371 <span class="keyword">typedef</span> std::size_t second_argument_type;
<a name="l00372"></a>00372 <span class="keyword">typedef</span> std::size_t result_type;
<a name="l00373"></a>00373
<a name="l00374"></a>00374 result_type
<a name="l00375"></a>00375 operator()(first_argument_type __num, second_argument_type __den)<span class="keyword"> const</span>
<a name="l00376"></a>00376 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __num % __den; }
<a name="l00377"></a>00377 };
<a name="l00378"></a>00378
<a name="l00379"></a>00379 <span class="comment">// Default ranged hash function H. In principle it should be a</span>
<a name="l00380"></a>00380 <span class="comment">// function object composed from objects of type H1 and H2 such that</span>
<a name="l00381"></a>00381 <span class="comment">// h(k, N) = h2(h1(k), N), but that would mean making extra copies of</span>
<a name="l00382"></a>00382 <span class="comment">// h1 and h2. So instead we'll just use a tag to tell class template</span>
<a name="l00383"></a>00383 <span class="comment">// hashtable to do that composition.</span>
<a name="l00384"></a>00384 <span class="keyword">struct </span>_Default_ranged_hash { };
<a name="l00385"></a>00385
<a name="l00386"></a>00386 <span class="comment">// Default value for rehash policy. Bucket size is (usually) the</span>
<a name="l00387"></a>00387 <span class="comment">// smallest prime that keeps the load factor small enough.</span>
<a name="l00388"></a>00388 <span class="keyword">struct </span>_Prime_rehash_policy
<a name="l00389"></a>00389 {
<a name="l00390"></a>00390 _Prime_rehash_policy(<span class="keywordtype">float</span> __z = 1.0)
<a name="l00391"></a>00391 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0) { }
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keywordtype">float</span>
<a name="l00394"></a>00394 max_load_factor()<span class="keyword"> const</span>
<a name="l00395"></a>00395 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_max_load_factor; }
<a name="l00396"></a>00396
<a name="l00397"></a>00397 <span class="comment">// Return a bucket size no smaller than n.</span>
<a name="l00398"></a>00398 std::size_t
<a name="l00399"></a>00399 _M_next_bkt(std::size_t __n) <span class="keyword">const</span>;
<a name="l00400"></a>00400
<a name="l00401"></a>00401 <span class="comment">// Return a bucket count appropriate for n elements</span>
<a name="l00402"></a>00402 std::size_t
<a name="l00403"></a>00403 _M_bkt_for_elements(std::size_t __n) <span class="keyword">const</span>;
<a name="l00404"></a>00404
<a name="l00405"></a>00405 <span class="comment">// __n_bkt is current bucket count, __n_elt is current element count,</span>
<a name="l00406"></a>00406 <span class="comment">// and __n_ins is number of elements to be inserted. Do we need to</span>
<a name="l00407"></a>00407 <span class="comment">// increase bucket count? If so, return make_pair(true, n), where n</span>
<a name="l00408"></a>00408 <span class="comment">// is the new bucket count. If not, return make_pair(false, 0).</span>
<a name="l00409"></a>00409 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<bool, std::size_t></a>
<a name="l00410"></a>00410 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
<a name="l00411"></a>00411 std::size_t __n_ins) <span class="keyword">const</span>;
<a name="l00412"></a>00412
<a name="l00413"></a>00413 <span class="keyword">enum</span> { _S_n_primes = <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> long) != 8 ? 256 : 256 + 48 };
<a name="l00414"></a>00414
<a name="l00415"></a>00415 <span class="keywordtype">float</span> _M_max_load_factor;
<a name="l00416"></a>00416 <span class="keywordtype">float</span> _M_growth_factor;
<a name="l00417"></a>00417 <span class="keyword">mutable</span> std::size_t _M_next_resize;
<a name="l00418"></a>00418 };
<a name="l00419"></a>00419
<a name="l00420"></a>00420 <span class="keyword">extern</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __prime_list[];
<a name="l00421"></a>00421
<a name="l00422"></a>00422 <span class="comment">// XXX This is a hack. There's no good reason for any of</span>
<a name="l00423"></a>00423 <span class="comment">// _Prime_rehash_policy's member functions to be inline.</span>
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="comment">// Return a prime no smaller than n.</span>
<a name="l00426"></a>00426 <span class="keyword">inline</span> std::size_t
<a name="l00427"></a>00427 _Prime_rehash_policy::
<a name="l00428"></a>00428 _M_next_bkt(std::size_t __n)<span class="keyword"> const</span>
<a name="l00429"></a>00429 <span class="keyword"> </span>{
<a name="l00430"></a>00430 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>* __p = <a class="code" href="a01186.html#gabe324553abc3238696e8e2660bfa5c66" title="Finds the first position in which val could be inserted without changing the ordering.">std::lower_bound</a>(__prime_list, __prime_list
<a name="l00431"></a>00431 + _S_n_primes, __n);
<a name="l00432"></a>00432 _M_next_resize =
<a name="l00433"></a>00433 <span class="keyword">static_cast<</span>std::size_t<span class="keyword">></span>(__builtin_ceil(*__p * _M_max_load_factor));
<a name="l00434"></a>00434 <span class="keywordflow">return</span> *__p;
<a name="l00435"></a>00435 }
<a name="l00436"></a>00436
<a name="l00437"></a>00437 <span class="comment">// Return the smallest prime p such that alpha p >= n, where alpha</span>
<a name="l00438"></a>00438 <span class="comment">// is the load factor.</span>
<a name="l00439"></a>00439 <span class="keyword">inline</span> std::size_t
<a name="l00440"></a>00440 _Prime_rehash_policy::
<a name="l00441"></a>00441 _M_bkt_for_elements(std::size_t __n)<span class="keyword"> const</span>
<a name="l00442"></a>00442 <span class="keyword"> </span>{
<a name="l00443"></a>00443 <span class="keyword">const</span> <span class="keywordtype">float</span> __min_bkts = __n / _M_max_load_factor;
<a name="l00444"></a>00444 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>* __p = <a class="code" href="a01186.html#gabe324553abc3238696e8e2660bfa5c66" title="Finds the first position in which val could be inserted without changing the ordering.">std::lower_bound</a>(__prime_list, __prime_list
<a name="l00445"></a>00445 + _S_n_primes, __min_bkts);
<a name="l00446"></a>00446 _M_next_resize =
<a name="l00447"></a>00447 <span class="keyword">static_cast<</span>std::size_t<span class="keyword">></span>(__builtin_ceil(*__p * _M_max_load_factor));
<a name="l00448"></a>00448 <span class="keywordflow">return</span> *__p;
<a name="l00449"></a>00449 }
<a name="l00450"></a>00450
<a name="l00451"></a>00451 <span class="comment">// Finds the smallest prime p such that alpha p > __n_elt + __n_ins.</span>
<a name="l00452"></a>00452 <span class="comment">// If p > __n_bkt, return make_pair(true, p); otherwise return</span>
<a name="l00453"></a>00453 <span class="comment">// make_pair(false, 0). In principle this isn't very different from</span>
<a name="l00454"></a>00454 <span class="comment">// _M_bkt_for_elements.</span>
<a name="l00455"></a>00455
<a name="l00456"></a>00456 <span class="comment">// The only tricky part is that we're caching the element count at</span>
<a name="l00457"></a>00457 <span class="comment">// which we need to rehash, so we don't have to do a floating-point</span>
<a name="l00458"></a>00458 <span class="comment">// multiply for every insertion.</span>
<a name="l00459"></a>00459
<a name="l00460"></a>00460 <span class="keyword">inline</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<bool, std::size_t></a>
<a name="l00461"></a>00461 _Prime_rehash_policy::
<a name="l00462"></a>00462 _M_need_rehash(std::size_t __n_bkt, std::size_t __n_elt,
<a name="l00463"></a>00463 std::size_t __n_ins)<span class="keyword"> const</span>
<a name="l00464"></a>00464 <span class="keyword"> </span>{
<a name="l00465"></a>00465 <span class="keywordflow">if</span> (__n_elt + __n_ins > _M_next_resize)
<a name="l00466"></a>00466 {
<a name="l00467"></a>00467 <span class="keywordtype">float</span> __min_bkts = ((float(__n_ins) + float(__n_elt))
<a name="l00468"></a>00468 / _M_max_load_factor);
<a name="l00469"></a>00469 <span class="keywordflow">if</span> (__min_bkts > __n_bkt)
<a name="l00470"></a>00470 {
<a name="l00471"></a>00471 __min_bkts = <a class="code" href="a01184.html#gaacf2fd7d602b70d56279425df06bd02c" title="This does what you think it does.">std::max</a>(__min_bkts, _M_growth_factor * __n_bkt);
<a name="l00472"></a>00472 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>* __p =
<a name="l00473"></a>00473 <a class="code" href="a01186.html#gabe324553abc3238696e8e2660bfa5c66" title="Finds the first position in which val could be inserted without changing the ordering.">std::lower_bound</a>(__prime_list, __prime_list + _S_n_primes,
<a name="l00474"></a>00474 __min_bkts);
<a name="l00475"></a>00475 _M_next_resize = <span class="keyword">static_cast<</span>std::size_t<span class="keyword">></span>
<a name="l00476"></a>00476 (__builtin_ceil(*__p * _M_max_load_factor));
<a name="l00477"></a>00477 <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(<span class="keyword">true</span>, *__p);
<a name="l00478"></a>00478 }
<a name="l00479"></a>00479 <span class="keywordflow">else</span>
<a name="l00480"></a>00480 {
<a name="l00481"></a>00481 _M_next_resize = <span class="keyword">static_cast<</span>std::size_t<span class="keyword">></span>
<a name="l00482"></a>00482 (__builtin_ceil(__n_bkt * _M_max_load_factor));
<a name="l00483"></a>00483 <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(<span class="keyword">false</span>, 0);
<a name="l00484"></a>00484 }
<a name="l00485"></a>00485 }
<a name="l00486"></a>00486 <span class="keywordflow">else</span>
<a name="l00487"></a>00487 <span class="keywordflow">return</span> <a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(<span class="keyword">false</span>, 0);
<a name="l00488"></a>00488 }
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="comment">// Base classes for std::_Hashtable. We define these base classes</span>
<a name="l00491"></a>00491 <span class="comment">// because in some cases we want to do different things depending</span>
<a name="l00492"></a>00492 <span class="comment">// on the value of a policy class. In some cases the policy class</span>
<a name="l00493"></a>00493 <span class="comment">// affects which member functions and nested typedefs are defined;</span>
<a name="l00494"></a>00494 <span class="comment">// we handle that by specializing base class templates. Several of</span>
<a name="l00495"></a>00495 <span class="comment">// the base class templates need to access other members of class</span>
<a name="l00496"></a>00496 <span class="comment">// template _Hashtable, so we use the "curiously recurring template</span>
<a name="l00497"></a>00497 <span class="comment">// pattern" for them.</span>
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="comment">// class template _Map_base. If the hashtable has a value type of</span>
<a name="l00500"></a>00500 <span class="comment">// the form pair<T1, T2> and a key extraction policy that returns the</span>
<a name="l00501"></a>00501 <span class="comment">// first part of the pair, the hashtable gets a mapped_type typedef.</span>
<a name="l00502"></a>00502 <span class="comment">// If it satisfies those criteria and also has unique keys, then it</span>
<a name="l00503"></a>00503 <span class="comment">// also gets an operator[].</span>
<a name="l00504"></a>00504 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value, <span class="keyword">typename</span> _Ex, <span class="keywordtype">bool</span> __unique,
<a name="l00505"></a>00505 <span class="keyword">typename</span> _Hashtable>
<a name="l00506"></a>00506 <span class="keyword">struct </span>_Map_base { };
<a name="l00507"></a>00507
<a name="l00508"></a>00508 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00509"></a>00509 <span class="keyword">struct </span>_Map_base<_Key, _Pair, std::_Select1st<_Pair>, false, _Hashtable>
<a name="l00510"></a>00510 {
<a name="l00511"></a>00511 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair::second_type mapped_type;
<a name="l00512"></a>00512 };
<a name="l00513"></a>00513
<a name="l00514"></a>00514 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00515"></a>00515 <span class="keyword">struct </span>_Map_base<_Key, _Pair, std::_Select1st<_Pair>, true, _Hashtable>
<a name="l00516"></a>00516 {
<a name="l00517"></a>00517 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair::second_type mapped_type;
<a name="l00518"></a>00518
<a name="l00519"></a>00519 mapped_type&
<a name="l00520"></a>00520 <a class="code" href="a01137.html#aa9196cd4f340e5c6fa2db1d3e974026d" title="Array-indexing support.">operator[]</a>(<span class="keyword">const</span> _Key& __k);
<a name="l00521"></a>00521
<a name="l00522"></a>00522 mapped_type&
<a name="l00523"></a>00523 <a class="code" href="a01137.html#aa9196cd4f340e5c6fa2db1d3e974026d" title="Array-indexing support.">operator[]</a>(_Key&& __k);
<a name="l00524"></a>00524
<a name="l00525"></a>00525 <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00526"></a>00526 <span class="comment">// DR 761. unordered_map needs an at() member function.</span>
<a name="l00527"></a>00527 mapped_type&
<a name="l00528"></a>00528 at(<span class="keyword">const</span> _Key& __k);
<a name="l00529"></a>00529
<a name="l00530"></a>00530 <span class="keyword">const</span> mapped_type&
<a name="l00531"></a>00531 at(<span class="keyword">const</span> _Key& __k) <span class="keyword">const</span>;
<a name="l00532"></a>00532 };
<a name="l00533"></a>00533
<a name="l00534"></a>00534 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00535"></a>00535 <span class="keyword">typename</span> _Map_base<_Key, _Pair, std::_Select1st<_Pair>,
<a name="l00536"></a>00536 <span class="keyword">true</span>, _Hashtable>::mapped_type&
<a name="l00537"></a>00537 _Map_base<_Key, _Pair, std::_Select1st<_Pair>, <span class="keyword">true</span>, _Hashtable>::
<a name="l00538"></a>00538 operator[](<span class="keyword">const</span> _Key& __k)
<a name="l00539"></a>00539 {
<a name="l00540"></a>00540 _Hashtable* __h = <span class="keyword">static_cast<</span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00541"></a>00541 <span class="keyword">typename</span> _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
<a name="l00542"></a>00542 std::size_t __n = __h->_M_bucket_index(__k, __code,
<a name="l00543"></a>00543 __h->_M_bucket_count);
<a name="l00544"></a>00544
<a name="l00545"></a>00545 <span class="keyword">typename</span> _Hashtable::_Node* __p =
<a name="l00546"></a>00546 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
<a name="l00547"></a>00547 <span class="keywordflow">if</span> (!__p)
<a name="l00548"></a>00548 <span class="keywordflow">return</span> __h->_M_insert_bucket(<a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(__k, mapped_type()),
<a name="l00549"></a>00549 __n, __code)->second;
<a name="l00550"></a>00550 <span class="keywordflow">return</span> (__p->_M_v).second;
<a name="l00551"></a>00551 }
<a name="l00552"></a>00552
<a name="l00553"></a>00553 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00554"></a>00554 <span class="keyword">typename</span> _Map_base<_Key, _Pair, std::_Select1st<_Pair>,
<a name="l00555"></a>00555 <span class="keyword">true</span>, _Hashtable>::mapped_type&
<a name="l00556"></a>00556 _Map_base<_Key, _Pair, std::_Select1st<_Pair>, <span class="keyword">true</span>, _Hashtable>::
<a name="l00557"></a>00557 operator[](_Key&& __k)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 _Hashtable* __h = <span class="keyword">static_cast<</span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00560"></a>00560 <span class="keyword">typename</span> _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
<a name="l00561"></a>00561 std::size_t __n = __h->_M_bucket_index(__k, __code,
<a name="l00562"></a>00562 __h->_M_bucket_count);
<a name="l00563"></a>00563
<a name="l00564"></a>00564 <span class="keyword">typename</span> _Hashtable::_Node* __p =
<a name="l00565"></a>00565 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
<a name="l00566"></a>00566 <span class="keywordflow">if</span> (!__p)
<a name="l00567"></a>00567 <span class="keywordflow">return</span> __h->_M_insert_bucket(<a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">std::make_pair</a>(std::move(__k),
<a name="l00568"></a>00568 mapped_type()),
<a name="l00569"></a>00569 __n, __code)->second;
<a name="l00570"></a>00570 <span class="keywordflow">return</span> (__p->_M_v).second;
<a name="l00571"></a>00571 }
<a name="l00572"></a>00572
<a name="l00573"></a>00573 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00574"></a>00574 <span class="keyword">typename</span> _Map_base<_Key, _Pair, std::_Select1st<_Pair>,
<a name="l00575"></a>00575 <span class="keyword">true</span>, _Hashtable>::mapped_type&
<a name="l00576"></a>00576 _Map_base<_Key, _Pair, std::_Select1st<_Pair>, <span class="keyword">true</span>, _Hashtable>::
<a name="l00577"></a>00577 at(<span class="keyword">const</span> _Key& __k)
<a name="l00578"></a>00578 {
<a name="l00579"></a>00579 _Hashtable* __h = <span class="keyword">static_cast<</span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00580"></a>00580 <span class="keyword">typename</span> _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
<a name="l00581"></a>00581 std::size_t __n = __h->_M_bucket_index(__k, __code,
<a name="l00582"></a>00582 __h->_M_bucket_count);
<a name="l00583"></a>00583
<a name="l00584"></a>00584 <span class="keyword">typename</span> _Hashtable::_Node* __p =
<a name="l00585"></a>00585 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
<a name="l00586"></a>00586 <span class="keywordflow">if</span> (!__p)
<a name="l00587"></a>00587 __throw_out_of_range(__N(<span class="stringliteral">"_Map_base::at"</span>));
<a name="l00588"></a>00588 <span class="keywordflow">return</span> (__p->_M_v).second;
<a name="l00589"></a>00589 }
<a name="l00590"></a>00590
<a name="l00591"></a>00591 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> _Hashtable>
<a name="l00592"></a>00592 <span class="keyword">const</span> <span class="keyword">typename</span> _Map_base<_Key, _Pair, std::_Select1st<_Pair>,
<a name="l00593"></a>00593 <span class="keyword">true</span>, _Hashtable>::mapped_type&
<a name="l00594"></a>00594 _Map_base<_Key, _Pair, std::_Select1st<_Pair>, <span class="keyword">true</span>, _Hashtable>::
<a name="l00595"></a>00595 at(<span class="keyword">const</span> _Key& __k) <span class="keyword">const</span>
<a name="l00596"></a>00596 {
<a name="l00597"></a>00597 <span class="keyword">const</span> _Hashtable* __h = <span class="keyword">static_cast<</span><span class="keyword">const </span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00598"></a>00598 <span class="keyword">typename</span> _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
<a name="l00599"></a>00599 std::size_t __n = __h->_M_bucket_index(__k, __code,
<a name="l00600"></a>00600 __h->_M_bucket_count);
<a name="l00601"></a>00601
<a name="l00602"></a>00602 <span class="keyword">typename</span> _Hashtable::_Node* __p =
<a name="l00603"></a>00603 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
<a name="l00604"></a>00604 <span class="keywordflow">if</span> (!__p)
<a name="l00605"></a>00605 __throw_out_of_range(__N(<span class="stringliteral">"_Map_base::at"</span>));
<a name="l00606"></a>00606 <span class="keywordflow">return</span> (__p->_M_v).second;
<a name="l00607"></a>00607 }
<a name="l00608"></a>00608
<a name="l00609"></a>00609 <span class="comment">// class template _Rehash_base. Give hashtable the max_load_factor</span>
<a name="l00610"></a>00610 <span class="comment">// functions and reserve iff the rehash policy is _Prime_rehash_policy.</span>
<a name="l00611"></a>00611 <span class="keyword">template</span><<span class="keyword">typename</span> _RehashPolicy, <span class="keyword">typename</span> _Hashtable>
<a name="l00612"></a>00612 <span class="keyword">struct </span>_Rehash_base { };
<a name="l00613"></a>00613
<a name="l00614"></a>00614 <span class="keyword">template</span><<span class="keyword">typename</span> _Hashtable>
<a name="l00615"></a>00615 <span class="keyword">struct </span>_Rehash_base<_Prime_rehash_policy, _Hashtable>
<a name="l00616"></a>00616 {
<a name="l00617"></a>00617 <span class="keywordtype">float</span>
<a name="l00618"></a>00618 max_load_factor()<span class="keyword"> const</span>
<a name="l00619"></a>00619 <span class="keyword"> </span>{
<a name="l00620"></a>00620 <span class="keyword">const</span> _Hashtable* __this = <span class="keyword">static_cast<</span><span class="keyword">const </span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00621"></a>00621 <span class="keywordflow">return</span> __this->__rehash_policy().max_load_factor();
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623
<a name="l00624"></a>00624 <span class="keywordtype">void</span>
<a name="l00625"></a>00625 max_load_factor(<span class="keywordtype">float</span> __z)
<a name="l00626"></a>00626 {
<a name="l00627"></a>00627 _Hashtable* __this = <span class="keyword">static_cast<</span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00628"></a>00628 __this->__rehash_policy(_Prime_rehash_policy(__z));
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630
<a name="l00631"></a>00631 <span class="keywordtype">void</span>
<a name="l00632"></a>00632 reserve(std::size_t __n)
<a name="l00633"></a>00633 {
<a name="l00634"></a>00634 _Hashtable* __this = <span class="keyword">static_cast<</span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00635"></a>00635 __this->rehash(__builtin_ceil(__n / max_load_factor()));
<a name="l00636"></a>00636 }
<a name="l00637"></a>00637 };
<a name="l00638"></a>00638
<a name="l00639"></a>00639 <span class="comment">// Class template _Hash_code_base. Encapsulates two policy issues that</span>
<a name="l00640"></a>00640 <span class="comment">// aren't quite orthogonal.</span>
<a name="l00641"></a>00641 <span class="comment">// (1) the difference between using a ranged hash function and using</span>
<a name="l00642"></a>00642 <span class="comment">// the combination of a hash function and a range-hashing function.</span>
<a name="l00643"></a>00643 <span class="comment">// In the former case we don't have such things as hash codes, so</span>
<a name="l00644"></a>00644 <span class="comment">// we have a dummy type as placeholder.</span>
<a name="l00645"></a>00645 <span class="comment">// (2) Whether or not we cache hash codes. Caching hash codes is</span>
<a name="l00646"></a>00646 <span class="comment">// meaningless if we have a ranged hash function.</span>
<a name="l00647"></a>00647 <span class="comment">// We also put the key extraction and equality comparison function</span>
<a name="l00648"></a>00648 <span class="comment">// objects here, for convenience.</span>
<a name="l00649"></a>00649
<a name="l00650"></a>00650 <span class="comment">// Primary template: unused except as a hook for specializations.</span>
<a name="l00651"></a>00651 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,
<a name="l00652"></a>00652 <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,
<a name="l00653"></a>00653 <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash,
<a name="l00654"></a>00654 <span class="keywordtype">bool</span> __cache_hash_code>
<a name="l00655"></a>00655 <span class="keyword">struct </span>_Hash_code_base;
<a name="l00656"></a>00656
<a name="l00657"></a>00657 <span class="comment">// Specialization: ranged hash function, no caching hash codes. H1</span>
<a name="l00658"></a>00658 <span class="comment">// and H2 are provided but ignored. We define a dummy hash code type.</span>
<a name="l00659"></a>00659 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,
<a name="l00660"></a>00660 <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,
<a name="l00661"></a>00661 <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash>
<a name="l00662"></a>00662 <span class="keyword">struct </span>_Hash_code_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2,
<a name="l00663"></a>00663 _Hash, false>
<a name="l00664"></a>00664 {
<a name="l00665"></a>00665 <span class="keyword">protected</span>:
<a name="l00666"></a>00666 _Hash_code_base(<span class="keyword">const</span> _ExtractKey& __ex, <span class="keyword">const</span> _Equal& __eq,
<a name="l00667"></a>00667 <span class="keyword">const</span> _H1&, <span class="keyword">const</span> _H2&, <span class="keyword">const</span> _Hash& __h)
<a name="l00668"></a>00668 : _M_extract(__ex), _M_eq(__eq), _M_ranged_hash(__h) { }
<a name="l00669"></a>00669
<a name="l00670"></a>00670 <span class="keyword">typedef</span> <span class="keywordtype">void</span>* _Hash_code_type;
<a name="l00671"></a>00671
<a name="l00672"></a>00672 _Hash_code_type
<a name="l00673"></a>00673 _M_hash_code(<span class="keyword">const</span> _Key& __key)<span class="keyword"> const</span>
<a name="l00674"></a>00674 <span class="keyword"> </span>{ <span class="keywordflow">return</span> 0; }
<a name="l00675"></a>00675
<a name="l00676"></a>00676 std::size_t
<a name="l00677"></a>00677 _M_bucket_index(<span class="keyword">const</span> _Key& __k, _Hash_code_type,
<a name="l00678"></a>00678 std::size_t __n)<span class="keyword"> const</span>
<a name="l00679"></a>00679 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ranged_hash(__k, __n); }
<a name="l00680"></a>00680
<a name="l00681"></a>00681 std::size_t
<a name="l00682"></a>00682 _M_bucket_index(<span class="keyword">const</span> _Hash_node<_Value, false>* __p,
<a name="l00683"></a>00683 std::size_t __n)<span class="keyword"> const</span>
<a name="l00684"></a>00684 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ranged_hash(_M_extract(__p->_M_v), __n); }
<a name="l00685"></a>00685
<a name="l00686"></a>00686 <span class="keywordtype">bool</span>
<a name="l00687"></a>00687 _M_compare(<span class="keyword">const</span> _Key& __k, _Hash_code_type,
<a name="l00688"></a>00688 _Hash_node<_Value, false>* __n)<span class="keyword"> const</span>
<a name="l00689"></a>00689 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_eq(__k, _M_extract(__n->_M_v)); }
<a name="l00690"></a>00690
<a name="l00691"></a>00691 <span class="keywordtype">void</span>
<a name="l00692"></a>00692 _M_store_code(_Hash_node<_Value, false>*, _Hash_code_type)<span class="keyword"> const</span>
<a name="l00693"></a>00693 <span class="keyword"> </span>{ }
<a name="l00694"></a>00694
<a name="l00695"></a>00695 <span class="keywordtype">void</span>
<a name="l00696"></a>00696 _M_copy_code(_Hash_node<_Value, false>*,
<a name="l00697"></a>00697 <span class="keyword">const</span> _Hash_node<_Value, false>*)<span class="keyword"> const</span>
<a name="l00698"></a>00698 <span class="keyword"> </span>{ }
<a name="l00699"></a>00699
<a name="l00700"></a>00700 <span class="keywordtype">void</span>
<a name="l00701"></a>00701 _M_swap(_Hash_code_base& __x)
<a name="l00702"></a>00702 {
<a name="l00703"></a>00703 std::swap(_M_extract, __x._M_extract);
<a name="l00704"></a>00704 std::swap(_M_eq, __x._M_eq);
<a name="l00705"></a>00705 std::swap(_M_ranged_hash, __x._M_ranged_hash);
<a name="l00706"></a>00706 }
<a name="l00707"></a>00707
<a name="l00708"></a>00708 <span class="keyword">protected</span>:
<a name="l00709"></a>00709 _ExtractKey _M_extract;
<a name="l00710"></a>00710 _Equal _M_eq;
<a name="l00711"></a>00711 _Hash _M_ranged_hash;
<a name="l00712"></a>00712 };
<a name="l00713"></a>00713
<a name="l00714"></a>00714
<a name="l00715"></a>00715 <span class="comment">// No specialization for ranged hash function while caching hash codes.</span>
<a name="l00716"></a>00716 <span class="comment">// That combination is meaningless, and trying to do it is an error.</span>
<a name="l00717"></a>00717
<a name="l00718"></a>00718
<a name="l00719"></a>00719 <span class="comment">// Specialization: ranged hash function, cache hash codes. This</span>
<a name="l00720"></a>00720 <span class="comment">// combination is meaningless, so we provide only a declaration</span>
<a name="l00721"></a>00721 <span class="comment">// and no definition.</span>
<a name="l00722"></a>00722 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,
<a name="l00723"></a>00723 <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,
<a name="l00724"></a>00724 <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2, <span class="keyword">typename</span> _Hash>
<a name="l00725"></a>00725 <span class="keyword">struct </span>_Hash_code_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2,
<a name="l00726"></a>00726 _Hash, true>;
<a name="l00727"></a>00727
<a name="l00728"></a>00728 <span class="comment">// Specialization: hash function and range-hashing function, no</span>
<a name="l00729"></a>00729 <span class="comment">// caching of hash codes. H is provided but ignored. Provides</span>
<a name="l00730"></a>00730 <span class="comment">// typedef and accessor required by TR1.</span>
<a name="l00731"></a>00731 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,
<a name="l00732"></a>00732 <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,
<a name="l00733"></a>00733 <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2>
<a name="l00734"></a>00734 <span class="keyword">struct </span>_Hash_code_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2,
<a name="l00735"></a>00735 _Default_ranged_hash, false>
<a name="l00736"></a>00736 {
<a name="l00737"></a>00737 <span class="keyword">typedef</span> _H1 hasher;
<a name="l00738"></a>00738
<a name="l00739"></a>00739 hasher
<a name="l00740"></a>00740 hash_function()<span class="keyword"> const</span>
<a name="l00741"></a>00741 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1; }
<a name="l00742"></a>00742
<a name="l00743"></a>00743 <span class="keyword">protected</span>:
<a name="l00744"></a>00744 _Hash_code_base(<span class="keyword">const</span> _ExtractKey& __ex, <span class="keyword">const</span> _Equal& __eq,
<a name="l00745"></a>00745 <span class="keyword">const</span> _H1& __h1, <span class="keyword">const</span> _H2& __h2,
<a name="l00746"></a>00746 <span class="keyword">const</span> _Default_ranged_hash&)
<a name="l00747"></a>00747 : _M_extract(__ex), _M_eq(__eq), _M_h1(__h1), _M_h2(__h2) { }
<a name="l00748"></a>00748
<a name="l00749"></a>00749 <span class="keyword">typedef</span> std::size_t _Hash_code_type;
<a name="l00750"></a>00750
<a name="l00751"></a>00751 _Hash_code_type
<a name="l00752"></a>00752 _M_hash_code(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span>
<a name="l00753"></a>00753 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1(__k); }
<a name="l00754"></a>00754
<a name="l00755"></a>00755 std::size_t
<a name="l00756"></a>00756 _M_bucket_index(<span class="keyword">const</span> _Key&, _Hash_code_type __c,
<a name="l00757"></a>00757 std::size_t __n)<span class="keyword"> const</span>
<a name="l00758"></a>00758 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2(__c, __n); }
<a name="l00759"></a>00759
<a name="l00760"></a>00760 std::size_t
<a name="l00761"></a>00761 _M_bucket_index(<span class="keyword">const</span> _Hash_node<_Value, false>* __p,
<a name="l00762"></a>00762 std::size_t __n)<span class="keyword"> const</span>
<a name="l00763"></a>00763 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2(_M_h1(_M_extract(__p->_M_v)), __n); }
<a name="l00764"></a>00764
<a name="l00765"></a>00765 <span class="keywordtype">bool</span>
<a name="l00766"></a>00766 _M_compare(<span class="keyword">const</span> _Key& __k, _Hash_code_type,
<a name="l00767"></a>00767 _Hash_node<_Value, false>* __n)<span class="keyword"> const</span>
<a name="l00768"></a>00768 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_eq(__k, _M_extract(__n->_M_v)); }
<a name="l00769"></a>00769
<a name="l00770"></a>00770 <span class="keywordtype">void</span>
<a name="l00771"></a>00771 _M_store_code(_Hash_node<_Value, false>*, _Hash_code_type)<span class="keyword"> const</span>
<a name="l00772"></a>00772 <span class="keyword"> </span>{ }
<a name="l00773"></a>00773
<a name="l00774"></a>00774 <span class="keywordtype">void</span>
<a name="l00775"></a>00775 _M_copy_code(_Hash_node<_Value, false>*,
<a name="l00776"></a>00776 <span class="keyword">const</span> _Hash_node<_Value, false>*)<span class="keyword"> const</span>
<a name="l00777"></a>00777 <span class="keyword"> </span>{ }
<a name="l00778"></a>00778
<a name="l00779"></a>00779 <span class="keywordtype">void</span>
<a name="l00780"></a>00780 _M_swap(_Hash_code_base& __x)
<a name="l00781"></a>00781 {
<a name="l00782"></a>00782 std::swap(_M_extract, __x._M_extract);
<a name="l00783"></a>00783 std::swap(_M_eq, __x._M_eq);
<a name="l00784"></a>00784 std::swap(_M_h1, __x._M_h1);
<a name="l00785"></a>00785 std::swap(_M_h2, __x._M_h2);
<a name="l00786"></a>00786 }
<a name="l00787"></a>00787
<a name="l00788"></a>00788 <span class="keyword">protected</span>:
<a name="l00789"></a>00789 _ExtractKey _M_extract;
<a name="l00790"></a>00790 _Equal _M_eq;
<a name="l00791"></a>00791 _H1 _M_h1;
<a name="l00792"></a>00792 _H2 _M_h2;
<a name="l00793"></a>00793 };
<a name="l00794"></a>00794
<a name="l00795"></a>00795 <span class="comment">// Specialization: hash function and range-hashing function,</span>
<a name="l00796"></a>00796 <span class="comment">// caching hash codes. H is provided but ignored. Provides</span>
<a name="l00797"></a>00797 <span class="comment">// typedef and accessor required by TR1.</span>
<a name="l00798"></a>00798 <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Value,
<a name="l00799"></a>00799 <span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Equal,
<a name="l00800"></a>00800 <span class="keyword">typename</span> _H1, <span class="keyword">typename</span> _H2>
<a name="l00801"></a>00801 <span class="keyword">struct </span>_Hash_code_base<_Key, _Value, _ExtractKey, _Equal, _H1, _H2,
<a name="l00802"></a>00802 _Default_ranged_hash, true>
<a name="l00803"></a>00803 {
<a name="l00804"></a>00804 <span class="keyword">typedef</span> _H1 hasher;
<a name="l00805"></a>00805
<a name="l00806"></a>00806 hasher
<a name="l00807"></a>00807 hash_function()<span class="keyword"> const</span>
<a name="l00808"></a>00808 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1; }
<a name="l00809"></a>00809
<a name="l00810"></a>00810 <span class="keyword">protected</span>:
<a name="l00811"></a>00811 _Hash_code_base(<span class="keyword">const</span> _ExtractKey& __ex, <span class="keyword">const</span> _Equal& __eq,
<a name="l00812"></a>00812 <span class="keyword">const</span> _H1& __h1, <span class="keyword">const</span> _H2& __h2,
<a name="l00813"></a>00813 <span class="keyword">const</span> _Default_ranged_hash&)
<a name="l00814"></a>00814 : _M_extract(__ex), _M_eq(__eq), _M_h1(__h1), _M_h2(__h2) { }
<a name="l00815"></a>00815
<a name="l00816"></a>00816 <span class="keyword">typedef</span> std::size_t _Hash_code_type;
<a name="l00817"></a>00817
<a name="l00818"></a>00818 _Hash_code_type
<a name="l00819"></a>00819 _M_hash_code(<span class="keyword">const</span> _Key& __k)<span class="keyword"> const</span>
<a name="l00820"></a>00820 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h1(__k); }
<a name="l00821"></a>00821
<a name="l00822"></a>00822 std::size_t
<a name="l00823"></a>00823 _M_bucket_index(<span class="keyword">const</span> _Key&, _Hash_code_type __c,
<a name="l00824"></a>00824 std::size_t __n)<span class="keyword"> const</span>
<a name="l00825"></a>00825 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2(__c, __n); }
<a name="l00826"></a>00826
<a name="l00827"></a>00827 std::size_t
<a name="l00828"></a>00828 _M_bucket_index(<span class="keyword">const</span> _Hash_node<_Value, true>* __p,
<a name="l00829"></a>00829 std::size_t __n)<span class="keyword"> const</span>
<a name="l00830"></a>00830 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_h2(__p->_M_hash_code, __n); }
<a name="l00831"></a>00831
<a name="l00832"></a>00832 <span class="keywordtype">bool</span>
<a name="l00833"></a>00833 _M_compare(<span class="keyword">const</span> _Key& __k, _Hash_code_type __c,
<a name="l00834"></a>00834 _Hash_node<_Value, true>* __n)<span class="keyword"> const</span>
<a name="l00835"></a>00835 <span class="keyword"> </span>{ <span class="keywordflow">return</span> __c == __n->_M_hash_code && _M_eq(__k, _M_extract(__n->_M_v)); }
<a name="l00836"></a>00836
<a name="l00837"></a>00837 <span class="keywordtype">void</span>
<a name="l00838"></a>00838 _M_store_code(_Hash_node<_Value, true>* __n, _Hash_code_type __c)<span class="keyword"> const</span>
<a name="l00839"></a>00839 <span class="keyword"> </span>{ __n->_M_hash_code = __c; }
<a name="l00840"></a>00840
<a name="l00841"></a>00841 <span class="keywordtype">void</span>
<a name="l00842"></a>00842 _M_copy_code(_Hash_node<_Value, true>* __to,
<a name="l00843"></a>00843 <span class="keyword">const</span> _Hash_node<_Value, true>* __from)<span class="keyword"> const</span>
<a name="l00844"></a>00844 <span class="keyword"> </span>{ __to->_M_hash_code = __from->_M_hash_code; }
<a name="l00845"></a>00845
<a name="l00846"></a>00846 <span class="keywordtype">void</span>
<a name="l00847"></a>00847 _M_swap(_Hash_code_base& __x)
<a name="l00848"></a>00848 {
<a name="l00849"></a>00849 std::swap(_M_extract, __x._M_extract);
<a name="l00850"></a>00850 std::swap(_M_eq, __x._M_eq);
<a name="l00851"></a>00851 std::swap(_M_h1, __x._M_h1);
<a name="l00852"></a>00852 std::swap(_M_h2, __x._M_h2);
<a name="l00853"></a>00853 }
<a name="l00854"></a>00854
<a name="l00855"></a>00855 <span class="keyword">protected</span>:
<a name="l00856"></a>00856 _ExtractKey _M_extract;
<a name="l00857"></a>00857 _Equal _M_eq;
<a name="l00858"></a>00858 _H1 _M_h1;
<a name="l00859"></a>00859 _H2 _M_h2;
<a name="l00860"></a>00860 };
<a name="l00861"></a>00861
<a name="l00862"></a>00862
<a name="l00863"></a>00863 <span class="comment">// Class template _Equality_base. This is for implementing equality</span>
<a name="l00864"></a>00864 <span class="comment">// comparison for unordered containers, per N3068, by John Lakos and</span>
<a name="l00865"></a>00865 <span class="comment">// Pablo Halpern. Algorithmically, we follow closely the reference</span>
<a name="l00866"></a>00866 <span class="comment">// implementations therein.</span>
<a name="l00867"></a>00867 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keywordtype">bool</span> __unique_keys,
<a name="l00868"></a>00868 <span class="keyword">typename</span> _Hashtable>
<a name="l00869"></a>00869 <span class="keyword">struct </span>_Equality_base;
<a name="l00870"></a>00870
<a name="l00871"></a>00871 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Hashtable>
<a name="l00872"></a>00872 <span class="keyword">struct </span>_Equality_base<_ExtractKey, true, _Hashtable>
<a name="l00873"></a>00873 {
<a name="l00874"></a>00874 <span class="keywordtype">bool</span> _M_equal(<span class="keyword">const</span> _Hashtable&) <span class="keyword">const</span>;
<a name="l00875"></a>00875 };
<a name="l00876"></a>00876
<a name="l00877"></a>00877 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Hashtable>
<a name="l00878"></a>00878 <span class="keywordtype">bool</span>
<a name="l00879"></a>00879 _Equality_base<_ExtractKey, true, _Hashtable>::
<a name="l00880"></a>00880 _M_equal(<span class="keyword">const</span> _Hashtable& __other)<span class="keyword"> const</span>
<a name="l00881"></a>00881 <span class="keyword"> </span>{
<a name="l00882"></a>00882 <span class="keyword">const</span> _Hashtable* __this = <span class="keyword">static_cast<</span><span class="keyword">const </span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00883"></a>00883
<a name="l00884"></a>00884 <span class="keywordflow">if</span> (__this->size() != __other.size())
<a name="l00885"></a>00885 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00886"></a>00886
<a name="l00887"></a>00887 <span class="keywordflow">for</span> (<span class="keyword">auto</span> __itx = __this->begin(); __itx != __this->end(); ++__itx)
<a name="l00888"></a>00888 {
<a name="l00889"></a>00889 <span class="keyword">const</span> <span class="keyword">auto</span> __ity = __other.find(_ExtractKey()(*__itx));
<a name="l00890"></a>00890 <span class="keywordflow">if</span> (__ity == __other.end() || !bool(*__ity == *__itx))
<a name="l00891"></a>00891 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00892"></a>00892 }
<a name="l00893"></a>00893 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00894"></a>00894 }
<a name="l00895"></a>00895
<a name="l00896"></a>00896 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Hashtable>
<a name="l00897"></a>00897 <span class="keyword">struct </span>_Equality_base<_ExtractKey, false, _Hashtable>
<a name="l00898"></a>00898 {
<a name="l00899"></a>00899 <span class="keywordtype">bool</span> _M_equal(<span class="keyword">const</span> _Hashtable&) <span class="keyword">const</span>;
<a name="l00900"></a>00900
<a name="l00901"></a>00901 <span class="keyword">private</span>:
<a name="l00902"></a>00902 <span class="keyword">template</span><<span class="keyword">typename</span> _Uiterator>
<a name="l00903"></a>00903 <span class="keyword">static</span> <span class="keywordtype">bool</span>
<a name="l00904"></a>00904 _S_is_permutation(_Uiterator, _Uiterator, _Uiterator);
<a name="l00905"></a>00905 };
<a name="l00906"></a>00906
<a name="l00907"></a>00907 <span class="comment">// See std::is_permutation in N3068.</span>
<a name="l00908"></a>00908 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Hashtable>
<a name="l00909"></a>00909 <span class="keyword">template</span><<span class="keyword">typename</span> _Uiterator>
<a name="l00910"></a>00910 <span class="keywordtype">bool</span>
<a name="l00911"></a>00911 _Equality_base<_ExtractKey, false, _Hashtable>::
<a name="l00912"></a>00912 _S_is_permutation(_Uiterator __first1, _Uiterator __last1,
<a name="l00913"></a>00913 _Uiterator __first2)
<a name="l00914"></a>00914 {
<a name="l00915"></a>00915 <span class="keywordflow">for</span> (; __first1 != __last1; ++__first1, ++__first2)
<a name="l00916"></a>00916 <span class="keywordflow">if</span> (!(*__first1 == *__first2))
<a name="l00917"></a>00917 <span class="keywordflow">break</span>;
<a name="l00918"></a>00918
<a name="l00919"></a>00919 <span class="keywordflow">if</span> (__first1 == __last1)
<a name="l00920"></a>00920 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00921"></a>00921
<a name="l00922"></a>00922 _Uiterator __last2 = __first2;
<a name="l00923"></a>00923 <a class="code" href="a01137.html#abe7a9a9a314d1ccbcfdd361b22e1e960" title="A generalization of pointer arithmetic.">std::advance</a>(__last2, <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__first1, __last1));
<a name="l00924"></a>00924
<a name="l00925"></a>00925 <span class="keywordflow">for</span> (_Uiterator __it1 = __first1; __it1 != __last1; ++__it1)
<a name="l00926"></a>00926 {
<a name="l00927"></a>00927 _Uiterator __tmp = __first1;
<a name="l00928"></a>00928 <span class="keywordflow">while</span> (__tmp != __it1 && !<span class="keywordtype">bool</span>(*__tmp == *__it1))
<a name="l00929"></a>00929 ++__tmp;
<a name="l00930"></a>00930
<a name="l00931"></a>00931 <span class="comment">// We've seen this one before.</span>
<a name="l00932"></a>00932 <span class="keywordflow">if</span> (__tmp != __it1)
<a name="l00933"></a>00933 <span class="keywordflow">continue</span>;
<a name="l00934"></a>00934
<a name="l00935"></a>00935 std::ptrdiff_t __n2 = 0;
<a name="l00936"></a>00936 <span class="keywordflow">for</span> (__tmp = __first2; __tmp != __last2; ++__tmp)
<a name="l00937"></a>00937 <span class="keywordflow">if</span> (*__tmp == *__it1)
<a name="l00938"></a>00938 ++__n2;
<a name="l00939"></a>00939
<a name="l00940"></a>00940 <span class="keywordflow">if</span> (!__n2)
<a name="l00941"></a>00941 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00942"></a>00942
<a name="l00943"></a>00943 std::ptrdiff_t __n1 = 0;
<a name="l00944"></a>00944 <span class="keywordflow">for</span> (__tmp = __it1; __tmp != __last1; ++__tmp)
<a name="l00945"></a>00945 <span class="keywordflow">if</span> (*__tmp == *__it1)
<a name="l00946"></a>00946 ++__n1;
<a name="l00947"></a>00947
<a name="l00948"></a>00948 <span class="keywordflow">if</span> (__n1 != __n2)
<a name="l00949"></a>00949 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00950"></a>00950 }
<a name="l00951"></a>00951 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00952"></a>00952 }
<a name="l00953"></a>00953
<a name="l00954"></a>00954 <span class="keyword">template</span><<span class="keyword">typename</span> _ExtractKey, <span class="keyword">typename</span> _Hashtable>
<a name="l00955"></a>00955 <span class="keywordtype">bool</span>
<a name="l00956"></a>00956 _Equality_base<_ExtractKey, false, _Hashtable>::
<a name="l00957"></a>00957 _M_equal(<span class="keyword">const</span> _Hashtable& __other)<span class="keyword"> const</span>
<a name="l00958"></a>00958 <span class="keyword"> </span>{
<a name="l00959"></a>00959 <span class="keyword">const</span> _Hashtable* __this = <span class="keyword">static_cast<</span><span class="keyword">const </span>_Hashtable*<span class="keyword">></span>(<span class="keyword">this</span>);
<a name="l00960"></a>00960
<a name="l00961"></a>00961 <span class="keywordflow">if</span> (__this->size() != __other.size())
<a name="l00962"></a>00962 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00963"></a>00963
<a name="l00964"></a>00964 <span class="keywordflow">for</span> (<span class="keyword">auto</span> __itx = __this->begin(); __itx != __this->end();)
<a name="l00965"></a>00965 {
<a name="l00966"></a>00966 <span class="keyword">const</span> <span class="keyword">auto</span> __xrange = __this->equal_range(_ExtractKey()(*__itx));
<a name="l00967"></a>00967 <span class="keyword">const</span> <span class="keyword">auto</span> __yrange = __other.equal_range(_ExtractKey()(*__itx));
<a name="l00968"></a>00968
<a name="l00969"></a>00969 <span class="keywordflow">if</span> (<a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__xrange.first, __xrange.second)
<a name="l00970"></a>00970 != <a class="code" href="a01137.html#ae528703a7890e085ad7aecd06bf9aec9" title="A generalization of pointer arithmetic.">std::distance</a>(__yrange.first, __yrange.second))
<a name="l00971"></a>00971 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00972"></a>00972
<a name="l00973"></a>00973 <span class="keywordflow">if</span> (!_S_is_permutation(__xrange.first,
<a name="l00974"></a>00974 __xrange.second,
<a name="l00975"></a>00975 __yrange.first))
<a name="l00976"></a>00976 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00977"></a>00977
<a name="l00978"></a>00978 __itx = __xrange.second;
<a name="l00979"></a>00979 }
<a name="l00980"></a>00980 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00981"></a>00981 }
<a name="l00982"></a>00982
<a name="l00983"></a>00983 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00984"></a>00984 } <span class="comment">// namespace __detail</span>
<a name="l00985"></a>00985 } <span class="comment">// namespace std</span>
<a name="l00986"></a>00986
<a name="l00987"></a>00987 <span class="preprocessor">#endif // _HASHTABLE_POLICY_H</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00904.html">hashtable_policy.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>
