<!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++: hash_map 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('a00899.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">hash_map</div> </div>
</div>
<div class="contents">
<a href="a00899.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Hashing map implementation -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009, 2010</span>
<a name="l00004"></a>00004 <span class="comment">// Free Software Foundation, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00007"></a>00007 <span class="comment">// software; you can redistribute it and/or modify it under the</span>
<a name="l00008"></a>00008 <span class="comment">// terms of the GNU General Public License as published by the</span>
<a name="l00009"></a>00009 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00010"></a>00010 <span class="comment">// any later version.</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment">// This library is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00015"></a>00015 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00018"></a>00018 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00019"></a>00019 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00022"></a>00022 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00023"></a>00023 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00024"></a>00024 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="comment">/*</span>
<a name="l00027"></a>00027 <span class="comment"> * Copyright (c) 1996</span>
<a name="l00028"></a>00028 <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span>
<a name="l00029"></a>00029 <span class="comment"> *</span>
<a name="l00030"></a>00030 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00031"></a>00031 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00032"></a>00032 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00033"></a>00033 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00034"></a>00034 <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span>
<a name="l00035"></a>00035 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00036"></a>00036 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00037"></a>00037 <span class="comment"> *</span>
<a name="l00038"></a>00038 <span class="comment"> *</span>
<a name="l00039"></a>00039 <span class="comment"> * Copyright (c) 1994</span>
<a name="l00040"></a>00040 <span class="comment"> * Hewlett-Packard Company</span>
<a name="l00041"></a>00041 <span class="comment"> *</span>
<a name="l00042"></a>00042 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00043"></a>00043 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00044"></a>00044 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00045"></a>00045 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00046"></a>00046 <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span>
<a name="l00047"></a>00047 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00048"></a>00048 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00049"></a>00049 <span class="comment"> *</span>
<a name="l00050"></a>00050 <span class="comment"> */</span>
<a name="l00051"></a>00051 <span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment">/** @file backward/hash_map</span>
<a name="l00053"></a>00053 <span class="comment"> * This file is a GNU extension to the Standard C++ Library (possibly</span>
<a name="l00054"></a>00054 <span class="comment"> * containing extensions from the HP/SGI STL subset).</span>
<a name="l00055"></a>00055 <span class="comment"> */</span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="preprocessor">#ifndef _BACKWARD_HASH_MAP</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define _BACKWARD_HASH_MAP 1</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span>
<a name="l00060"></a>00060 <span class="preprocessor">#ifndef _GLIBCXX_PERMIT_BACKWARD_HASH</span>
<a name="l00061"></a>00061 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="a00762.html">backward_warning.h</a>"</span>
<a name="l00062"></a>00062 <span class="preprocessor">#endif</span>
<a name="l00063"></a>00063 <span class="preprocessor"></span>
<a name="l00064"></a>00064 <span class="preprocessor">#include <<a class="code" href="a00781.html">bits/c++config.h</a>></span>
<a name="l00065"></a>00065 <span class="preprocessor">#include <<a class="code" href="a00902.html">backward/hashtable.h</a>></span>
<a name="l00066"></a>00066 <span class="preprocessor">#include <<a class="code" href="a00815.html">bits/concept_check.h</a>></span>
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">namespace </span>__gnu_cxx _GLIBCXX_VISIBILITY(default)
<a name="l00069"></a>00069 {
<a name="l00070"></a>00070 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keyword">using</span> <a class="code" href="a00462.html" title="One of the comparison functors.">std::equal_to</a>;
<a name="l00073"></a>00073 <span class="keyword">using</span> <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</a>;
<a name="l00074"></a>00074 <span class="keyword">using</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair</a>;
<a name="l00075"></a>00075 <span class="keyword">using</span> std::_Select1st;
<a name="l00076"></a>00076 <span class="comment"></span>
<a name="l00077"></a>00077 <span class="comment"> /**</span>
<a name="l00078"></a>00078 <span class="comment"> * This is an SGI extension.</span>
<a name="l00079"></a>00079 <span class="comment"> * @ingroup SGIextensions</span>
<a name="l00080"></a>00080 <span class="comment"> * @doctodo</span>
<a name="l00081"></a>00081 <span class="comment"> */</span>
<a name="l00082"></a>00082 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn = hash<_Key>,
<a name="l00083"></a>00083 <span class="keyword">class</span> _EqualKey = equal_to<_Key>, <span class="keyword">class</span> _Alloc = allocator<_Tp> >
<a name="l00084"></a><a class="code" href="a00046.html">00084</a> <span class="keyword">class </span><a class="code" href="a00046.html">hash_map</a>
<a name="l00085"></a>00085 {
<a name="l00086"></a>00086 <span class="keyword">private</span>:
<a name="l00087"></a>00087 <span class="keyword">typedef</span> hashtable<pair<const _Key, _Tp>,_Key, _HashFn,
<a name="l00088"></a>00088 _Select1st<pair<const _Key, _Tp> >,
<a name="l00089"></a>00089 _EqualKey, _Alloc> _Ht;
<a name="l00090"></a>00090
<a name="l00091"></a>00091 _Ht _M_ht;
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="keyword">public</span>:
<a name="l00094"></a>00094 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::key_type key_type;
<a name="l00095"></a>00095 <span class="keyword">typedef</span> _Tp data_type;
<a name="l00096"></a>00096 <span class="keyword">typedef</span> _Tp mapped_type;
<a name="l00097"></a>00097 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::value_type</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>;
<a name="l00098"></a>00098 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::hasher hasher;
<a name="l00099"></a>00099 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::key_equal key_equal;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::size_type size_type;
<a name="l00102"></a>00102 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::difference_type difference_type;
<a name="l00103"></a>00103 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::pointer</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pointer</a>;
<a name="l00104"></a>00104 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::const_pointer</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">const_pointer</a>;
<a name="l00105"></a>00105 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::reference</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">reference</a>;
<a name="l00106"></a>00106 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::const_reference</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">const_reference</a>;
<a name="l00107"></a>00107
<a name="l00108"></a>00108 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::iterator iterator;
<a name="l00109"></a>00109 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::const_iterator const_iterator;
<a name="l00110"></a>00110
<a name="l00111"></a>00111 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::allocator_type allocator_type;
<a name="l00112"></a>00112
<a name="l00113"></a>00113 hasher
<a name="l00114"></a>00114 hash_funct()<span class="keyword"> const</span>
<a name="l00115"></a>00115 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.hash_funct(); }
<a name="l00116"></a>00116
<a name="l00117"></a>00117 key_equal
<a name="l00118"></a>00118 key_eq()<span class="keyword"> const</span>
<a name="l00119"></a>00119 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.key_eq(); }
<a name="l00120"></a>00120
<a name="l00121"></a>00121 allocator_type
<a name="l00122"></a>00122 get_allocator()<span class="keyword"> const</span>
<a name="l00123"></a>00123 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.get_allocator(); }
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <a class="code" href="a00046.html">hash_map</a>()
<a name="l00126"></a>00126 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="keyword">explicit</span>
<a name="l00129"></a>00129 <a class="code" href="a00046.html">hash_map</a>(size_type __n)
<a name="l00130"></a>00130 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <a class="code" href="a00046.html">hash_map</a>(size_type __n, <span class="keyword">const</span> hasher& __hf)
<a name="l00133"></a>00133 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <a class="code" href="a00046.html">hash_map</a>(size_type __n, <span class="keyword">const</span> hasher& __hf, <span class="keyword">const</span> key_equal& __eql,
<a name="l00136"></a>00136 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00137"></a>00137 : _M_ht(__n, __hf, __eql, __a) {}
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00140"></a>00140 <a class="code" href="a00046.html">hash_map</a>(_InputIterator __f, _InputIterator __l)
<a name="l00141"></a>00141 : _M_ht(100, hasher(), key_equal(), allocator_type())
<a name="l00142"></a>00142 { _M_ht.insert_unique(__f, __l); }
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00145"></a>00145 <a class="code" href="a00046.html">hash_map</a>(_InputIterator __f, _InputIterator __l, size_type __n)
<a name="l00146"></a>00146 : _M_ht(__n, hasher(), key_equal(), allocator_type())
<a name="l00147"></a>00147 { _M_ht.insert_unique(__f, __l); }
<a name="l00148"></a>00148
<a name="l00149"></a>00149 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00150"></a>00150 <a class="code" href="a00046.html">hash_map</a>(_InputIterator __f, _InputIterator __l, size_type __n,
<a name="l00151"></a>00151 <span class="keyword">const</span> hasher& __hf)
<a name="l00152"></a>00152 : _M_ht(__n, __hf, key_equal(), allocator_type())
<a name="l00153"></a>00153 { _M_ht.insert_unique(__f, __l); }
<a name="l00154"></a>00154
<a name="l00155"></a>00155 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00156"></a>00156 <a class="code" href="a00046.html">hash_map</a>(_InputIterator __f, _InputIterator __l, size_type __n,
<a name="l00157"></a>00157 <span class="keyword">const</span> hasher& __hf, <span class="keyword">const</span> key_equal& __eql,
<a name="l00158"></a>00158 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00159"></a>00159 : _M_ht(__n, __hf, __eql, __a)
<a name="l00160"></a>00160 { _M_ht.insert_unique(__f, __l); }
<a name="l00161"></a>00161
<a name="l00162"></a>00162 size_type
<a name="l00163"></a>00163 size()<span class="keyword"> const</span>
<a name="l00164"></a>00164 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.size(); }
<a name="l00165"></a>00165
<a name="l00166"></a>00166 size_type
<a name="l00167"></a>00167 max_size()<span class="keyword"> const</span>
<a name="l00168"></a>00168 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.max_size(); }
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keywordtype">bool</span>
<a name="l00171"></a>00171 empty()<span class="keyword"> const</span>
<a name="l00172"></a>00172 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.empty(); }
<a name="l00173"></a>00173
<a name="l00174"></a>00174 <span class="keywordtype">void</span>
<a name="l00175"></a>00175 swap(<a class="code" href="a00046.html">hash_map</a>& __hs)
<a name="l00176"></a>00176 { _M_ht.swap(__hs._M_ht); }
<a name="l00177"></a>00177
<a name="l00178"></a>00178 <span class="keyword">template</span><<span class="keyword">class</span> _K1, <span class="keyword">class</span> _T1, <span class="keyword">class</span> _HF, <span class="keyword">class</span> _EqK, <span class="keyword">class</span> _Al>
<a name="l00179"></a>00179 <span class="keyword">friend</span> <span class="keywordtype">bool</span>
<a name="l00180"></a>00180 operator== (<span class="keyword">const</span> <a class="code" href="a00046.html">hash_map<_K1, _T1, _HF, _EqK, _Al></a>&,
<a name="l00181"></a>00181 <span class="keyword">const</span> <a class="code" href="a00046.html">hash_map<_K1, _T1, _HF, _EqK, _Al></a>&);
<a name="l00182"></a>00182
<a name="l00183"></a>00183 iterator
<a name="l00184"></a>00184 begin()
<a name="l00185"></a>00185 { <span class="keywordflow">return</span> _M_ht.begin(); }
<a name="l00186"></a>00186
<a name="l00187"></a>00187 iterator
<a name="l00188"></a>00188 end()
<a name="l00189"></a>00189 { <span class="keywordflow">return</span> _M_ht.end(); }
<a name="l00190"></a>00190
<a name="l00191"></a>00191 const_iterator
<a name="l00192"></a>00192 begin()<span class="keyword"> const</span>
<a name="l00193"></a>00193 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.begin(); }
<a name="l00194"></a>00194
<a name="l00195"></a>00195 const_iterator
<a name="l00196"></a>00196 end()<span class="keyword"> const</span>
<a name="l00197"></a>00197 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.end(); }
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<iterator, bool></a>
<a name="l00200"></a>00200 insert(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __obj)
<a name="l00201"></a>00201 { <span class="keywordflow">return</span> _M_ht.insert_unique(__obj); }
<a name="l00202"></a>00202
<a name="l00203"></a>00203 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00204"></a>00204 <span class="keywordtype">void</span>
<a name="l00205"></a>00205 insert(_InputIterator __f, _InputIterator __l)
<a name="l00206"></a>00206 { _M_ht.insert_unique(__f, __l); }
<a name="l00207"></a>00207
<a name="l00208"></a>00208 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<iterator, bool></a>
<a name="l00209"></a>00209 insert_noresize(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __obj)
<a name="l00210"></a>00210 { <span class="keywordflow">return</span> _M_ht.insert_unique_noresize(__obj); }
<a name="l00211"></a>00211
<a name="l00212"></a>00212 iterator
<a name="l00213"></a>00213 find(<span class="keyword">const</span> key_type& __key)
<a name="l00214"></a>00214 { <span class="keywordflow">return</span> _M_ht.find(__key); }
<a name="l00215"></a>00215
<a name="l00216"></a>00216 const_iterator
<a name="l00217"></a>00217 find(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00218"></a>00218 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.find(__key); }
<a name="l00219"></a>00219
<a name="l00220"></a>00220 _Tp&
<a name="l00221"></a>00221 operator[](<span class="keyword">const</span> key_type& __key)
<a name="l00222"></a>00222 { <span class="keywordflow">return</span> _M_ht.find_or_insert(<a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>(__key, _Tp())).second; }
<a name="l00223"></a>00223
<a name="l00224"></a>00224 size_type
<a name="l00225"></a>00225 count(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00226"></a>00226 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.count(__key); }
<a name="l00227"></a>00227
<a name="l00228"></a>00228 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<iterator, iterator></a>
<a name="l00229"></a>00229 equal_range(<span class="keyword">const</span> key_type& __key)
<a name="l00230"></a>00230 { <span class="keywordflow">return</span> _M_ht.equal_range(__key); }
<a name="l00231"></a>00231
<a name="l00232"></a>00232 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<const_iterator, const_iterator></a>
<a name="l00233"></a>00233 equal_range(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00234"></a>00234 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.equal_range(__key); }
<a name="l00235"></a>00235
<a name="l00236"></a>00236 size_type
<a name="l00237"></a>00237 erase(<span class="keyword">const</span> key_type& __key)
<a name="l00238"></a>00238 {<span class="keywordflow">return</span> _M_ht.erase(__key); }
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keywordtype">void</span>
<a name="l00241"></a>00241 erase(iterator __it)
<a name="l00242"></a>00242 { _M_ht.erase(__it); }
<a name="l00243"></a>00243
<a name="l00244"></a>00244 <span class="keywordtype">void</span>
<a name="l00245"></a>00245 erase(iterator __f, iterator __l)
<a name="l00246"></a>00246 { _M_ht.erase(__f, __l); }
<a name="l00247"></a>00247
<a name="l00248"></a>00248 <span class="keywordtype">void</span>
<a name="l00249"></a>00249 clear()
<a name="l00250"></a>00250 { _M_ht.clear(); }
<a name="l00251"></a>00251
<a name="l00252"></a>00252 <span class="keywordtype">void</span>
<a name="l00253"></a>00253 resize(size_type __hint)
<a name="l00254"></a>00254 { _M_ht.resize(__hint); }
<a name="l00255"></a>00255
<a name="l00256"></a>00256 size_type
<a name="l00257"></a>00257 bucket_count()<span class="keyword"> const</span>
<a name="l00258"></a>00258 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.bucket_count(); }
<a name="l00259"></a>00259
<a name="l00260"></a>00260 size_type
<a name="l00261"></a>00261 max_bucket_count()<span class="keyword"> const</span>
<a name="l00262"></a>00262 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.max_bucket_count(); }
<a name="l00263"></a>00263
<a name="l00264"></a>00264 size_type
<a name="l00265"></a>00265 elems_in_bucket(size_type __n)<span class="keyword"> const</span>
<a name="l00266"></a>00266 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.elems_in_bucket(__n); }
<a name="l00267"></a>00267 };
<a name="l00268"></a>00268
<a name="l00269"></a>00269 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqlKey, <span class="keyword">class</span> _Alloc>
<a name="l00270"></a>00270 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00271"></a>00271 operator==(<span class="keyword">const</span> <a class="code" href="a00046.html">hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc></a>& __hm1,
<a name="l00272"></a>00272 <span class="keyword">const</span> <a class="code" href="a00046.html">hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc></a>& __hm2)
<a name="l00273"></a>00273 { <span class="keywordflow">return</span> __hm1._M_ht == __hm2._M_ht; }
<a name="l00274"></a>00274
<a name="l00275"></a>00275 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqlKey, <span class="keyword">class</span> _Alloc>
<a name="l00276"></a>00276 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00277"></a>00277 operator!=(<span class="keyword">const</span> hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
<a name="l00278"></a>00278 <span class="keyword">const</span> hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
<a name="l00279"></a>00279 { <span class="keywordflow">return</span> !(__hm1 == __hm2); }
<a name="l00280"></a>00280
<a name="l00281"></a>00281 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqlKey, <span class="keyword">class</span> _Alloc>
<a name="l00282"></a>00282 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00283"></a>00283 swap(hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
<a name="l00284"></a>00284 hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
<a name="l00285"></a>00285 { __hm1.swap(__hm2); }
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="comment"></span>
<a name="l00288"></a>00288 <span class="comment"> /**</span>
<a name="l00289"></a>00289 <span class="comment"> * This is an SGI extension.</span>
<a name="l00290"></a>00290 <span class="comment"> * @ingroup SGIextensions</span>
<a name="l00291"></a>00291 <span class="comment"> * @doctodo</span>
<a name="l00292"></a>00292 <span class="comment"> */</span>
<a name="l00293"></a>00293 <span class="keyword">template</span><<span class="keyword">class </span>_Key, <span class="keyword">class </span>_Tp,
<a name="l00294"></a>00294 <span class="keyword">class </span>_HashFn = hash<_Key>,
<a name="l00295"></a>00295 <span class="keyword">class </span>_EqualKey = equal_to<_Key>,
<a name="l00296"></a>00296 <span class="keyword">class </span>_Alloc = allocator<_Tp> >
<a name="l00297"></a><a class="code" href="a00047.html">00297</a> <span class="keyword">class </span><a class="code" href="a00047.html">hash_multimap</a>
<a name="l00298"></a>00298 {
<a name="l00299"></a>00299 <span class="comment">// concept requirements</span>
<a name="l00300"></a>00300 __glibcxx_class_requires(_Key, _SGIAssignableConcept)
<a name="l00301"></a>00301 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
<a name="l00302"></a>00302 __glibcxx_class_requires3(_HashFn, <span class="keywordtype">size_t</span>, _Key, _UnaryFunctionConcept)
<a name="l00303"></a>00303 __glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept)
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="keyword">private</span>:
<a name="l00306"></a>00306 <span class="keyword">typedef</span> hashtable<pair<const _Key, _Tp>, _Key, _HashFn,
<a name="l00307"></a>00307 _Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>
<a name="l00308"></a>00308 _Ht;
<a name="l00309"></a>00309
<a name="l00310"></a>00310 _Ht _M_ht;
<a name="l00311"></a>00311
<a name="l00312"></a>00312 <span class="keyword">public</span>:
<a name="l00313"></a>00313 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::key_type key_type;
<a name="l00314"></a>00314 <span class="keyword">typedef</span> _Tp data_type;
<a name="l00315"></a>00315 <span class="keyword">typedef</span> _Tp mapped_type;
<a name="l00316"></a>00316 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::value_type</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>;
<a name="l00317"></a>00317 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::hasher hasher;
<a name="l00318"></a>00318 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::key_equal key_equal;
<a name="l00319"></a>00319
<a name="l00320"></a>00320 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::size_type size_type;
<a name="l00321"></a>00321 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::difference_type difference_type;
<a name="l00322"></a>00322 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::pointer</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pointer</a>;
<a name="l00323"></a>00323 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::const_pointer</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">const_pointer</a>;
<a name="l00324"></a>00324 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::reference</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">reference</a>;
<a name="l00325"></a>00325 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">_Ht::const_reference</a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">const_reference</a>;
<a name="l00326"></a>00326
<a name="l00327"></a>00327 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::iterator iterator;
<a name="l00328"></a>00328 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::const_iterator const_iterator;
<a name="l00329"></a>00329
<a name="l00330"></a>00330 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Ht::allocator_type allocator_type;
<a name="l00331"></a>00331
<a name="l00332"></a>00332 hasher
<a name="l00333"></a>00333 hash_funct()<span class="keyword"> const</span>
<a name="l00334"></a>00334 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.hash_funct(); }
<a name="l00335"></a>00335
<a name="l00336"></a>00336 key_equal
<a name="l00337"></a>00337 key_eq()<span class="keyword"> const</span>
<a name="l00338"></a>00338 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.key_eq(); }
<a name="l00339"></a>00339
<a name="l00340"></a>00340 allocator_type
<a name="l00341"></a>00341 get_allocator()<span class="keyword"> const</span>
<a name="l00342"></a>00342 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.get_allocator(); }
<a name="l00343"></a>00343
<a name="l00344"></a>00344 <a class="code" href="a00047.html">hash_multimap</a>()
<a name="l00345"></a>00345 : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
<a name="l00346"></a>00346
<a name="l00347"></a>00347 <span class="keyword">explicit</span>
<a name="l00348"></a>00348 <a class="code" href="a00047.html">hash_multimap</a>(size_type __n)
<a name="l00349"></a>00349 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
<a name="l00350"></a>00350
<a name="l00351"></a>00351 <a class="code" href="a00047.html">hash_multimap</a>(size_type __n, <span class="keyword">const</span> hasher& __hf)
<a name="l00352"></a>00352 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
<a name="l00353"></a>00353
<a name="l00354"></a>00354 <a class="code" href="a00047.html">hash_multimap</a>(size_type __n, <span class="keyword">const</span> hasher& __hf, <span class="keyword">const</span> key_equal& __eql,
<a name="l00355"></a>00355 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00356"></a>00356 : _M_ht(__n, __hf, __eql, __a) {}
<a name="l00357"></a>00357
<a name="l00358"></a>00358 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00359"></a>00359 <a class="code" href="a00047.html">hash_multimap</a>(_InputIterator __f, _InputIterator __l)
<a name="l00360"></a>00360 : _M_ht(100, hasher(), key_equal(), allocator_type())
<a name="l00361"></a>00361 { _M_ht.insert_equal(__f, __l); }
<a name="l00362"></a>00362
<a name="l00363"></a>00363 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00364"></a>00364 <a class="code" href="a00047.html">hash_multimap</a>(_InputIterator __f, _InputIterator __l, size_type __n)
<a name="l00365"></a>00365 : _M_ht(__n, hasher(), key_equal(), allocator_type())
<a name="l00366"></a>00366 { _M_ht.insert_equal(__f, __l); }
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00369"></a>00369 <a class="code" href="a00047.html">hash_multimap</a>(_InputIterator __f, _InputIterator __l, size_type __n,
<a name="l00370"></a>00370 <span class="keyword">const</span> hasher& __hf)
<a name="l00371"></a>00371 : _M_ht(__n, __hf, key_equal(), allocator_type())
<a name="l00372"></a>00372 { _M_ht.insert_equal(__f, __l); }
<a name="l00373"></a>00373
<a name="l00374"></a>00374 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00375"></a>00375 <a class="code" href="a00047.html">hash_multimap</a>(_InputIterator __f, _InputIterator __l, size_type __n,
<a name="l00376"></a>00376 <span class="keyword">const</span> hasher& __hf, <span class="keyword">const</span> key_equal& __eql,
<a name="l00377"></a>00377 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00378"></a>00378 : _M_ht(__n, __hf, __eql, __a)
<a name="l00379"></a>00379 { _M_ht.insert_equal(__f, __l); }
<a name="l00380"></a>00380
<a name="l00381"></a>00381 size_type
<a name="l00382"></a>00382 size()<span class="keyword"> const</span>
<a name="l00383"></a>00383 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.size(); }
<a name="l00384"></a>00384
<a name="l00385"></a>00385 size_type
<a name="l00386"></a>00386 max_size()<span class="keyword"> const</span>
<a name="l00387"></a>00387 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.max_size(); }
<a name="l00388"></a>00388
<a name="l00389"></a>00389 <span class="keywordtype">bool</span>
<a name="l00390"></a>00390 empty()<span class="keyword"> const</span>
<a name="l00391"></a>00391 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.empty(); }
<a name="l00392"></a>00392
<a name="l00393"></a>00393 <span class="keywordtype">void</span>
<a name="l00394"></a>00394 swap(<a class="code" href="a00047.html">hash_multimap</a>& __hs)
<a name="l00395"></a>00395 { _M_ht.swap(__hs._M_ht); }
<a name="l00396"></a>00396
<a name="l00397"></a>00397 <span class="keyword">template</span><<span class="keyword">class</span> _K1, <span class="keyword">class</span> _T1, <span class="keyword">class</span> _HF, <span class="keyword">class</span> _EqK, <span class="keyword">class</span> _Al>
<a name="l00398"></a>00398 <span class="keyword">friend</span> <span class="keywordtype">bool</span>
<a name="l00399"></a>00399 operator==(<span class="keyword">const</span> <a class="code" href="a00047.html">hash_multimap<_K1, _T1, _HF, _EqK, _Al></a>&,
<a name="l00400"></a>00400 <span class="keyword">const</span> <a class="code" href="a00047.html">hash_multimap<_K1, _T1, _HF, _EqK, _Al></a>&);
<a name="l00401"></a>00401
<a name="l00402"></a>00402 iterator
<a name="l00403"></a>00403 begin()
<a name="l00404"></a>00404 { <span class="keywordflow">return</span> _M_ht.begin(); }
<a name="l00405"></a>00405
<a name="l00406"></a>00406 iterator
<a name="l00407"></a>00407 end()
<a name="l00408"></a>00408 { <span class="keywordflow">return</span> _M_ht.end(); }
<a name="l00409"></a>00409
<a name="l00410"></a>00410 const_iterator
<a name="l00411"></a>00411 begin()<span class="keyword"> const</span>
<a name="l00412"></a>00412 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.begin(); }
<a name="l00413"></a>00413
<a name="l00414"></a>00414 const_iterator
<a name="l00415"></a>00415 end()<span class="keyword"> const</span>
<a name="l00416"></a>00416 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.end(); }
<a name="l00417"></a>00417
<a name="l00418"></a>00418 iterator
<a name="l00419"></a>00419 insert(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __obj)
<a name="l00420"></a>00420 { <span class="keywordflow">return</span> _M_ht.insert_equal(__obj); }
<a name="l00421"></a>00421
<a name="l00422"></a>00422 <span class="keyword">template</span><<span class="keyword">class</span> _InputIterator>
<a name="l00423"></a>00423 <span class="keywordtype">void</span>
<a name="l00424"></a>00424 insert(_InputIterator __f, _InputIterator __l)
<a name="l00425"></a>00425 { _M_ht.insert_equal(__f,__l); }
<a name="l00426"></a>00426
<a name="l00427"></a>00427 iterator
<a name="l00428"></a>00428 insert_noresize(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __obj)
<a name="l00429"></a>00429 { <span class="keywordflow">return</span> _M_ht.insert_equal_noresize(__obj); }
<a name="l00430"></a>00430
<a name="l00431"></a>00431 iterator
<a name="l00432"></a>00432 find(<span class="keyword">const</span> key_type& __key)
<a name="l00433"></a>00433 { <span class="keywordflow">return</span> _M_ht.find(__key); }
<a name="l00434"></a>00434
<a name="l00435"></a>00435 const_iterator
<a name="l00436"></a>00436 find(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00437"></a>00437 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.find(__key); }
<a name="l00438"></a>00438
<a name="l00439"></a>00439 size_type
<a name="l00440"></a>00440 count(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00441"></a>00441 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.count(__key); }
<a name="l00442"></a>00442
<a name="l00443"></a>00443 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<iterator, iterator></a>
<a name="l00444"></a>00444 equal_range(<span class="keyword">const</span> key_type& __key)
<a name="l00445"></a>00445 { <span class="keywordflow">return</span> _M_ht.equal_range(__key); }
<a name="l00446"></a>00446
<a name="l00447"></a>00447 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">pair<const_iterator, const_iterator></a>
<a name="l00448"></a>00448 equal_range(<span class="keyword">const</span> key_type& __key)<span class="keyword"> const</span>
<a name="l00449"></a>00449 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.equal_range(__key); }
<a name="l00450"></a>00450
<a name="l00451"></a>00451 size_type
<a name="l00452"></a>00452 erase(<span class="keyword">const</span> key_type& __key)
<a name="l00453"></a>00453 { <span class="keywordflow">return</span> _M_ht.erase(__key); }
<a name="l00454"></a>00454
<a name="l00455"></a>00455 <span class="keywordtype">void</span>
<a name="l00456"></a>00456 erase(iterator __it)
<a name="l00457"></a>00457 { _M_ht.erase(__it); }
<a name="l00458"></a>00458
<a name="l00459"></a>00459 <span class="keywordtype">void</span>
<a name="l00460"></a>00460 erase(iterator __f, iterator __l)
<a name="l00461"></a>00461 { _M_ht.erase(__f, __l); }
<a name="l00462"></a>00462
<a name="l00463"></a>00463 <span class="keywordtype">void</span>
<a name="l00464"></a>00464 clear()
<a name="l00465"></a>00465 { _M_ht.clear(); }
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <span class="keywordtype">void</span>
<a name="l00468"></a>00468 resize(size_type __hint)
<a name="l00469"></a>00469 { _M_ht.resize(__hint); }
<a name="l00470"></a>00470
<a name="l00471"></a>00471 size_type
<a name="l00472"></a>00472 bucket_count()<span class="keyword"> const</span>
<a name="l00473"></a>00473 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.bucket_count(); }
<a name="l00474"></a>00474
<a name="l00475"></a>00475 size_type
<a name="l00476"></a>00476 max_bucket_count()<span class="keyword"> const</span>
<a name="l00477"></a>00477 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.max_bucket_count(); }
<a name="l00478"></a>00478
<a name="l00479"></a>00479 size_type
<a name="l00480"></a>00480 elems_in_bucket(size_type __n)<span class="keyword"> const</span>
<a name="l00481"></a>00481 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_ht.elems_in_bucket(__n); }
<a name="l00482"></a>00482 };
<a name="l00483"></a>00483
<a name="l00484"></a>00484 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HF, <span class="keyword">class</span> _EqKey, <span class="keyword">class</span> _Alloc>
<a name="l00485"></a>00485 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00486"></a>00486 operator==(<span class="keyword">const</span> <a class="code" href="a00047.html">hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc></a>& __hm1,
<a name="l00487"></a>00487 <span class="keyword">const</span> <a class="code" href="a00047.html">hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc></a>& __hm2)
<a name="l00488"></a>00488 { <span class="keywordflow">return</span> __hm1._M_ht == __hm2._M_ht; }
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HF, <span class="keyword">class</span> _EqKey, <span class="keyword">class</span> _Alloc>
<a name="l00491"></a>00491 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00492"></a>00492 operator!=(<span class="keyword">const</span> hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,
<a name="l00493"></a>00493 <span class="keyword">const</span> hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)
<a name="l00494"></a>00494 { <span class="keywordflow">return</span> !(__hm1 == __hm2); }
<a name="l00495"></a>00495
<a name="l00496"></a>00496 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqlKey, <span class="keyword">class</span> _Alloc>
<a name="l00497"></a>00497 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00498"></a>00498 swap(hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
<a name="l00499"></a>00499 hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
<a name="l00500"></a>00500 { __hm1.swap(__hm2); }
<a name="l00501"></a>00501
<a name="l00502"></a>00502 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00503"></a>00503 } <span class="comment">// namespace</span>
<a name="l00504"></a>00504
<a name="l00505"></a>00505 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00506"></a>00506 {
<a name="l00507"></a>00507 _GLIBCXX_BEGIN_NAMESPACE_VERSION
<a name="l00508"></a>00508
<a name="l00509"></a>00509 <span class="comment">// Specialization of insert_iterator so that it will work for hash_map</span>
<a name="l00510"></a>00510 <span class="comment">// and hash_multimap.</span>
<a name="l00511"></a>00511 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqKey, <span class="keyword">class</span> _Alloc>
<a name="l00512"></a>00512 <span class="keyword">class </span>insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn,
<a name="l00513"></a>00513 _EqKey, _Alloc> >
<a name="l00514"></a>00514 {
<a name="l00515"></a>00515 <span class="keyword">protected</span>:
<a name="l00516"></a>00516 <span class="keyword">typedef</span> <a class="code" href="a00046.html">__gnu_cxx::hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc></a>
<a name="l00517"></a>00517 _Container;
<a name="l00518"></a>00518 _Container* container;
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="keyword">public</span>:
<a name="l00521"></a>00521 <span class="keyword">typedef</span> _Container <a class="code" href="a00526.html#a81ef704d3e33bcb38d894a8b1e440771" title="A nested typedef for the type of whatever container you used.">container_type</a>;
<a name="l00522"></a>00522 <span class="keyword">typedef</span> output_iterator_tag <a class="code" href="a00260.html#a3d32527bfebba5c0459df1390cef50a9" title="One of the tag types.">iterator_category</a>;
<a name="l00523"></a>00523 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#af9f36b7adb257959eef192b9282f1284" title="The type "pointed to" by the iterator.">value_type</a>;
<a name="l00524"></a>00524 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#a7fc5091a6bee76d7bfc6ece04e4050f9" title="Distance between iterators is represented as this type.">difference_type</a>;
<a name="l00525"></a>00525 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#a69bffe0bd881194df5ff48fec79066de" title="This type represents a pointer-to-value_type.">pointer</a>;
<a name="l00526"></a>00526 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#abb17838f15d32971ad823036c6593aef" title="This type represents a reference-to-value_type.">reference</a>;
<a name="l00527"></a>00527
<a name="l00528"></a>00528 <a class="code" href="a00526.html#a69916dd7c180bcb5fb6874adaaacc08b">insert_iterator</a>(_Container& __x)
<a name="l00529"></a>00529 : container(&__x) {}
<a name="l00530"></a>00530
<a name="l00531"></a>00531 <a class="code" href="a00526.html#a69916dd7c180bcb5fb6874adaaacc08b">insert_iterator</a>(_Container& __x, <span class="keyword">typename</span> _Container::iterator)
<a name="l00532"></a>00532 : container(&__x) {}
<a name="l00533"></a>00533
<a name="l00534"></a>00534 insert_iterator<_Container>&
<a name="l00535"></a>00535 <a class="code" href="a00526.html#a97b27e02a31008441dd0374c6a1021e4">operator=</a>(<span class="keyword">const</span> <span class="keyword">typename</span> _Container::value_type& __value)
<a name="l00536"></a>00536 {
<a name="l00537"></a>00537 container->insert(__value);
<a name="l00538"></a>00538 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00539"></a>00539 }
<a name="l00540"></a>00540
<a name="l00541"></a>00541 insert_iterator<_Container>&
<a name="l00542"></a>00542 <a class="code" href="a00526.html#a1a406c868feb4c886b002870abeb8546" title="Simply returns *this.">operator*</a>()
<a name="l00543"></a>00543 { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00544"></a>00544
<a name="l00545"></a>00545 insert_iterator<_Container>&
<a name="l00546"></a>00546 <a class="code" href="a00526.html#a66d30004d7402c9067fa8faadd7b8861" title="Simply returns *this. (This iterator does not move.)">operator++</a>() { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00547"></a>00547
<a name="l00548"></a>00548 insert_iterator<_Container>&
<a name="l00549"></a>00549 <a class="code" href="a00526.html#a66d30004d7402c9067fa8faadd7b8861" title="Simply returns *this. (This iterator does not move.)">operator++</a>(<span class="keywordtype">int</span>)
<a name="l00550"></a>00550 { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00551"></a>00551 };
<a name="l00552"></a>00552
<a name="l00553"></a>00553 <span class="keyword">template</span><<span class="keyword">class</span> _Key, <span class="keyword">class</span> _Tp, <span class="keyword">class</span> _HashFn, <span class="keyword">class</span> _EqKey, <span class="keyword">class</span> _Alloc>
<a name="l00554"></a>00554 <span class="keyword">class </span>insert_iterator<__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn,
<a name="l00555"></a>00555 _EqKey, _Alloc> >
<a name="l00556"></a>00556 {
<a name="l00557"></a>00557 <span class="keyword">protected</span>:
<a name="l00558"></a>00558 <span class="keyword">typedef</span> <a class="code" href="a00047.html">__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, _EqKey, _Alloc></a>
<a name="l00559"></a>00559 _Container;
<a name="l00560"></a>00560 _Container* container;
<a name="l00561"></a>00561 <span class="keyword">typename</span> _Container::iterator iter;
<a name="l00562"></a>00562
<a name="l00563"></a>00563 <span class="keyword">public</span>:
<a name="l00564"></a>00564 <span class="keyword">typedef</span> _Container <a class="code" href="a00526.html#a81ef704d3e33bcb38d894a8b1e440771" title="A nested typedef for the type of whatever container you used.">container_type</a>;
<a name="l00565"></a>00565 <span class="keyword">typedef</span> output_iterator_tag <a class="code" href="a00260.html#a3d32527bfebba5c0459df1390cef50a9" title="One of the tag types.">iterator_category</a>;
<a name="l00566"></a>00566 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#af9f36b7adb257959eef192b9282f1284" title="The type "pointed to" by the iterator.">value_type</a>;
<a name="l00567"></a>00567 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#a7fc5091a6bee76d7bfc6ece04e4050f9" title="Distance between iterators is represented as this type.">difference_type</a>;
<a name="l00568"></a>00568 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#a69bffe0bd881194df5ff48fec79066de" title="This type represents a pointer-to-value_type.">pointer</a>;
<a name="l00569"></a>00569 <span class="keyword">typedef</span> <span class="keywordtype">void</span> <a class="code" href="a00260.html#abb17838f15d32971ad823036c6593aef" title="This type represents a reference-to-value_type.">reference</a>;
<a name="l00570"></a>00570
<a name="l00571"></a>00571 <a class="code" href="a00526.html#a69916dd7c180bcb5fb6874adaaacc08b">insert_iterator</a>(_Container& __x)
<a name="l00572"></a>00572 : container(&__x) {}
<a name="l00573"></a>00573
<a name="l00574"></a>00574 <a class="code" href="a00526.html#a69916dd7c180bcb5fb6874adaaacc08b">insert_iterator</a>(_Container& __x, <span class="keyword">typename</span> _Container::iterator)
<a name="l00575"></a>00575 : container(&__x) {}
<a name="l00576"></a>00576
<a name="l00577"></a>00577 insert_iterator<_Container>&
<a name="l00578"></a>00578 <a class="code" href="a00526.html#a97b27e02a31008441dd0374c6a1021e4">operator=</a>(<span class="keyword">const</span> <span class="keyword">typename</span> _Container::value_type& __value)
<a name="l00579"></a>00579 {
<a name="l00580"></a>00580 container->insert(__value);
<a name="l00581"></a>00581 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00582"></a>00582 }
<a name="l00583"></a>00583
<a name="l00584"></a>00584 insert_iterator<_Container>&
<a name="l00585"></a>00585 <a class="code" href="a00526.html#a1a406c868feb4c886b002870abeb8546" title="Simply returns *this.">operator*</a>()
<a name="l00586"></a>00586 { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00587"></a>00587
<a name="l00588"></a>00588 insert_iterator<_Container>&
<a name="l00589"></a>00589 <a class="code" href="a00526.html#a66d30004d7402c9067fa8faadd7b8861" title="Simply returns *this. (This iterator does not move.)">operator++</a>()
<a name="l00590"></a>00590 { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00591"></a>00591
<a name="l00592"></a>00592 insert_iterator<_Container>&
<a name="l00593"></a>00593 <a class="code" href="a00526.html#a66d30004d7402c9067fa8faadd7b8861" title="Simply returns *this. (This iterator does not move.)">operator++</a>(<span class="keywordtype">int</span>)
<a name="l00594"></a>00594 { <span class="keywordflow">return</span> *<span class="keyword">this</span>; }
<a name="l00595"></a>00595 };
<a name="l00596"></a>00596
<a name="l00597"></a>00597 _GLIBCXX_END_NAMESPACE_VERSION
<a name="l00598"></a>00598 } <span class="comment">// namespace</span>
<a name="l00599"></a>00599
<a name="l00600"></a>00600 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a00899.html">hash_map</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>
