<!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"/> <meta http-equiv="X-UA-Compatible" content="IE=9"/> <meta name="generator" content="Doxygen 1.8.13"/> <meta name="viewport" content="width=device-width, initial-scale=1"/> <title>libstdc++: hash_map Source File</title> <link href="tabs.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="jquery.js"></script> <script type="text/javascript" src="dynsections.js"></script> <link href="navtree.css" rel="stylesheet" type="text/css"/> <script type="text/javascript" src="resize.js"></script> <script type="text/javascript" src="navtreedata.js"></script> <script type="text/javascript" src="navtree.js"></script> <script type="text/javascript"> $(document).ready(initResizable); </script> <link href="doxygen.css" rel="stylesheet" type="text/css" /> </head> <body> <div id="top"><!-- do not remove this div, it is closed by doxygen! --> <div id="titlearea"> <table cellspacing="0" cellpadding="0"> <tbody> <tr style="height: 56px;"> <td id="projectalign" style="padding-left: 0.5em;"> <div id="projectname">libstdc++ </div> </td> </tr> </tbody> </table> </div> <!-- end header part --> <!-- Generated by Doxygen 1.8.13 --> </div><!-- top --> <div id="side-nav" class="ui-resizable side-nav-resizable"> <div id="nav-tree"> <div id="nav-tree-contents"> <div id="nav-sync" class="sync"></div> </div> </div> <div id="splitbar" style="-moz-user-select:none;" class="ui-resizable-handle"> </div> </div> <script type="text/javascript"> $(document).ready(function(){initNavTree('a00683_source.html','');}); </script> <div id="doc-content"> <div class="header"> <div class="headertitle"> <div class="title">hash_map</div> </div> </div><!--header--> <div class="contents"> <a href="a00683.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> // Hashing map implementation -*- C++ -*-</div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> // Copyright (C) 2001-2015 Free Software Foundation, Inc.</div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> //</div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> // This file is part of the GNU ISO C++ Library. This library is free</div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> // software; you can redistribute it and/or modify it under the</div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> // terms of the GNU General Public License as published by the</div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> // Free Software Foundation; either version 3, or (at your option)</div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> // any later version.</div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> // This library is distributed in the hope that it will be useful,</div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> // but WITHOUT ANY WARRANTY; without even the implied warranty of</div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> // GNU General Public License for more details.</div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> // Under Section 7 of GPL version 3, you are granted additional</div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> // permissions described in the GCC Runtime Library Exception, version</div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> // 3.1, as published by the Free Software Foundation.</div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> // You should have received a copy of the GNU General Public License and</div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> // a copy of the GCC Runtime Library Exception along with this program;</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> // <http://www.gnu.org/licenses/>.</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> </div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> /*</div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  * Copyright (c) 1996</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  * Silicon Graphics Computer Systems, Inc.</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  *</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  * in supporting documentation. Silicon Graphics makes no</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  *</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  *</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  * Copyright (c) 1994</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  * Hewlett-Packard Company</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  *</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  * Permission to use, copy, modify, distribute and sell this software</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  * and its documentation for any purpose is hereby granted without fee,</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  * provided that the above copyright notice appear in all copies and</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  * that both that copyright notice and this permission notice appear</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  * in supporting documentation. Hewlett-Packard Company makes no</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  * representations about the suitability of this software for any</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  * purpose. It is provided "as is" without express or implied warranty.</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  *</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  */</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> </div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> /** @file backward/hash_map</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  * This file is a GNU extension to the Standard C++ Library (possibly</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  * containing extensions from the HP/SGI STL subset).</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  */</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> </div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> #ifndef _BACKWARD_HASH_MAP</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> #define _BACKWARD_HASH_MAP 1</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> #ifndef _GLIBCXX_PERMIT_BACKWARD_HASH</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> #include "backward_warning.h"</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> #endif</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> #include <bits/c++config.h></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> #include <backward/hashtable.h></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> #include <bits/concept_check.h></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> </div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  using std::equal_to;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  using std::allocator;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  using std::pair;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  using std::_Select1st;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  /**</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  * This is an SGI extension.</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  * @ingroup SGIextensions</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  * @doctodo</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  */</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  template<class _Key, class _Tp, class _HashFn = hash<_Key>,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  class _EqualKey = equal_to<_Key>, class _Alloc = allocator<_Tp> ></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  class hash_map</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  private:</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  typedef hashtable<pair<const _Key, _Tp>,_Key, _HashFn,</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  _Select1st<pair<const _Key, _Tp> >,</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  _EqualKey, _Alloc> _Ht;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _Ht _M_ht;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  public:</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  typedef typename _Ht::key_type key_type;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  typedef _Tp data_type;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  typedef _Tp mapped_type;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  typedef typename _Ht::value_type value_type;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  typedef typename _Ht::hasher hasher;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  typedef typename _Ht::key_equal key_equal;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  typedef typename _Ht::size_type size_type;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  typedef typename _Ht::difference_type difference_type;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  typedef typename _Ht::pointer pointer;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  typedef typename _Ht::const_pointer const_pointer;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  typedef typename _Ht::reference reference;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  typedef typename _Ht::const_reference const_reference;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  typedef typename _Ht::iterator iterator;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  typedef typename _Ht::const_iterator const_iterator;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  typedef typename _Ht::allocator_type allocator_type;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  hasher</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  hash_funct() const</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  { return _M_ht.hash_funct(); }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  key_equal</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  key_eq() const</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  { return _M_ht.key_eq(); }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  allocator_type</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  get_allocator() const</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  { return _M_ht.get_allocator(); }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  hash_map()</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  : _M_ht(100, hasher(), key_equal(), allocator_type()) {}</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  explicit</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  hash_map(size_type __n)</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> </div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  hash_map(size_type __n, const hasher& __hf)</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  : _M_ht(__n, __hf, key_equal(), allocator_type()) {}</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  : _M_ht(__n, __hf, __eql, __a) {}</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  template<class _InputIterator></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  hash_map(_InputIterator __f, _InputIterator __l)</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  : _M_ht(100, hasher(), key_equal(), allocator_type())</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  { _M_ht.insert_unique(__f, __l); }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  template<class _InputIterator></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  hash_map(_InputIterator __f, _InputIterator __l, size_type __n)</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  : _M_ht(__n, hasher(), key_equal(), allocator_type())</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  { _M_ht.insert_unique(__f, __l); }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  template<class _InputIterator></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  hash_map(_InputIterator __f, _InputIterator __l, size_type __n,</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  const hasher& __hf)</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  : _M_ht(__n, __hf, key_equal(), allocator_type())</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  { _M_ht.insert_unique(__f, __l); }</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  template<class _InputIterator></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  hash_map(_InputIterator __f, _InputIterator __l, size_type __n,</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  const hasher& __hf, const key_equal& __eql,</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  : _M_ht(__n, __hf, __eql, __a)</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  { _M_ht.insert_unique(__f, __l); }</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> </div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  size_type</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  size() const</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  { return _M_ht.size(); }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  size_type</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  max_size() const</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  { return _M_ht.max_size(); }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  bool</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  empty() const</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  { return _M_ht.empty(); }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  void</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  swap(hash_map& __hs)</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  { _M_ht.swap(__hs._M_ht); }</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  template<class _K1, class _T1, class _HF, class _EqK, class _Al></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  friend bool</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  operator== (const hash_map<_K1, _T1, _HF, _EqK, _Al>&,</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  const hash_map<_K1, _T1, _HF, _EqK, _Al>&);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  iterator</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  begin()</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  { return _M_ht.begin(); }</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  iterator</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  end()</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  { return _M_ht.end(); }</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  const_iterator</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  begin() const</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  { return _M_ht.begin(); }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  const_iterator</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  end() const</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  { return _M_ht.end(); }</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  pair<iterator, bool></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  insert(const value_type& __obj)</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  { return _M_ht.insert_unique(__obj); }</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  template<class _InputIterator></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  void</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  insert(_InputIterator __f, _InputIterator __l)</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  { _M_ht.insert_unique(__f, __l); }</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> </div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  pair<iterator, bool></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  insert_noresize(const value_type& __obj)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  { return _M_ht.insert_unique_noresize(__obj); }</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> </div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  iterator</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  find(const key_type& __key)</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  { return _M_ht.find(__key); }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  const_iterator</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  find(const key_type& __key) const</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  { return _M_ht.find(__key); }</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  _Tp&</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  operator[](const key_type& __key)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  size_type</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  count(const key_type& __key) const</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  { return _M_ht.count(__key); }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  pair<iterator, iterator></div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  equal_range(const key_type& __key)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  { return _M_ht.equal_range(__key); }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> </div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  pair<const_iterator, const_iterator></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  equal_range(const key_type& __key) const</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  { return _M_ht.equal_range(__key); }</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  size_type</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  erase(const key_type& __key)</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  {return _M_ht.erase(__key); }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  void</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  erase(iterator __it)</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  { _M_ht.erase(__it); }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  void</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  erase(iterator __f, iterator __l)</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  { _M_ht.erase(__f, __l); }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  void</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  clear()</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  { _M_ht.clear(); }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  void</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  resize(size_type __hint)</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  { _M_ht.resize(__hint); }</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> </div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  size_type</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  bucket_count() const</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  { return _M_ht.bucket_count(); }</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> </div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  size_type</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  max_bucket_count() const</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  { return _M_ht.max_bucket_count(); }</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> </div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  size_type</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  elems_in_bucket(size_type __n) const</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  { return _M_ht.elems_in_bucket(__n); }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  };</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> </div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  inline bool</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  operator==(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  { return __hm1._M_ht == __hm2._M_ht; }</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> </div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  inline bool</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  operator!=(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  { return !(__hm1 == __hm2); }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  inline void</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  swap(hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  { __hm1.swap(__hm2); }</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> </div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  /**</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  * This is an SGI extension.</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  * @ingroup SGIextensions</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  * @doctodo</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  */</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  template<class _Key, class _Tp,</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  class _HashFn = hash<_Key>,</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  class _EqualKey = equal_to<_Key>,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  class _Alloc = allocator<_Tp> ></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  class hash_multimap</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  {</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  // concept requirements</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  __glibcxx_class_requires(_Key, _SGIAssignableConcept)</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  __glibcxx_class_requires3(_HashFn, size_t, _Key, _UnaryFunctionConcept)</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  __glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept)</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  private:</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  typedef hashtable<pair<const _Key, _Tp>, _Key, _HashFn,</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  _Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc></div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  _Ht;</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  _Ht _M_ht;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  public:</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  typedef typename _Ht::key_type key_type;</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  typedef _Tp data_type;</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  typedef _Tp mapped_type;</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  typedef typename _Ht::value_type value_type;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  typedef typename _Ht::hasher hasher;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  typedef typename _Ht::key_equal key_equal;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  typedef typename _Ht::size_type size_type;</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  typedef typename _Ht::difference_type difference_type;</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  typedef typename _Ht::pointer pointer;</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  typedef typename _Ht::const_pointer const_pointer;</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  typedef typename _Ht::reference reference;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  typedef typename _Ht::const_reference const_reference;</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  typedef typename _Ht::iterator iterator;</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  typedef typename _Ht::const_iterator const_iterator;</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  typedef typename _Ht::allocator_type allocator_type;</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  </div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  hasher</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  hash_funct() const</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  { return _M_ht.hash_funct(); }</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> </div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  key_equal</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  key_eq() const</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  { return _M_ht.key_eq(); }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  allocator_type</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  get_allocator() const</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  { return _M_ht.get_allocator(); }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  hash_multimap()</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  : _M_ht(100, hasher(), key_equal(), allocator_type()) {}</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> </div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  explicit</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  hash_multimap(size_type __n)</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  hash_multimap(size_type __n, const hasher& __hf)</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  : _M_ht(__n, __hf, key_equal(), allocator_type()) {}</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql,</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  : _M_ht(__n, __hf, __eql, __a) {}</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  template<class _InputIterator></div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  hash_multimap(_InputIterator __f, _InputIterator __l)</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  : _M_ht(100, hasher(), key_equal(), allocator_type())</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  { _M_ht.insert_equal(__f, __l); }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> </div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  template<class _InputIterator></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n)</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  : _M_ht(__n, hasher(), key_equal(), allocator_type())</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  { _M_ht.insert_equal(__f, __l); }</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  template<class _InputIterator></div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  const hasher& __hf)</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  : _M_ht(__n, __hf, key_equal(), allocator_type())</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  { _M_ht.insert_equal(__f, __l); }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  template<class _InputIterator></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  const hasher& __hf, const key_equal& __eql,</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  const allocator_type& __a = allocator_type())</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  : _M_ht(__n, __hf, __eql, __a)</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  { _M_ht.insert_equal(__f, __l); }</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> </div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  size_type</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  size() const</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  { return _M_ht.size(); }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> </div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  size_type</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  max_size() const</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  { return _M_ht.max_size(); }</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> </div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  bool</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  empty() const</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  { return _M_ht.empty(); }</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> </div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  void</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  swap(hash_multimap& __hs)</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  { _M_ht.swap(__hs._M_ht); }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  template<class _K1, class _T1, class _HF, class _EqK, class _Al></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  friend bool</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  operator==(const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&,</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  iterator</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  begin()</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  { return _M_ht.begin(); }</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span> </div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  iterator</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  end()</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  { return _M_ht.end(); }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> </div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  const_iterator</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  begin() const</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  { return _M_ht.begin(); }</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  const_iterator</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  end() const</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  { return _M_ht.end(); }</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  iterator</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  insert(const value_type& __obj)</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  { return _M_ht.insert_equal(__obj); }</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  template<class _InputIterator></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  void</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  insert(_InputIterator __f, _InputIterator __l)</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  { _M_ht.insert_equal(__f,__l); }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  iterator</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  insert_noresize(const value_type& __obj)</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  { return _M_ht.insert_equal_noresize(__obj); }</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> </div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  iterator</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  find(const key_type& __key)</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  { return _M_ht.find(__key); }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  const_iterator</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  find(const key_type& __key) const</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  { return _M_ht.find(__key); }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  size_type</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  count(const key_type& __key) const</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  { return _M_ht.count(__key); }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> </div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  pair<iterator, iterator></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  equal_range(const key_type& __key)</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  { return _M_ht.equal_range(__key); }</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  pair<const_iterator, const_iterator></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  equal_range(const key_type& __key) const</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  { return _M_ht.equal_range(__key); }</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> </div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  size_type</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  erase(const key_type& __key)</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  { return _M_ht.erase(__key); }</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span> </div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  void</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  erase(iterator __it)</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  { _M_ht.erase(__it); }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  void</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  erase(iterator __f, iterator __l)</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  { _M_ht.erase(__f, __l); }</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  void</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  clear()</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  { _M_ht.clear(); }</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> </div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  void</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  resize(size_type __hint)</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  { _M_ht.resize(__hint); }</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> </div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  size_type</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  bucket_count() const</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  { return _M_ht.bucket_count(); }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  size_type</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  max_bucket_count() const</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  { return _M_ht.max_bucket_count(); }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  size_type</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  elems_in_bucket(size_type __n) const</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  { return _M_ht.elems_in_bucket(__n); }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  };</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  inline bool</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  { return __hm1._M_ht == __hm2._M_ht; }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  inline bool</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  operator!=(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  { return !(__hm1 == __hm2); }</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span> </div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc></div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  inline void</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  swap(hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  { __hm1.swap(__hm2); }</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span> </div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> } // namespace</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span> </div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> namespace std _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> {</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> _GLIBCXX_BEGIN_NAMESPACE_VERSION</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  // Specialization of insert_iterator so that it will work for hash_map</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  // and hash_multimap.</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  class insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn, </div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  _EqKey, _Alloc> ></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  protected:</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  typedef __gnu_cxx::hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  _Container;</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  _Container* container;</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  public:</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  typedef _Container container_type;</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  typedef output_iterator_tag iterator_category;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  typedef void value_type;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  typedef void difference_type;</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  typedef void pointer;</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  typedef void reference;</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  </div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  insert_iterator(_Container& __x)</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  : container(&__x) {}</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> </div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  insert_iterator(_Container& __x, typename _Container::iterator)</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  : container(&__x) {}</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span> </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  operator=(const typename _Container::value_type& __value)</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  {</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  container->insert(__value);</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  return *this;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  }</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> </div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  operator*()</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  { return *this; }</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  operator++() { return *this; }</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> </div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  operator++(int)</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  { return *this; }</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  };</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  class insert_iterator<__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn,</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  _EqKey, _Alloc> ></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  {</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  protected:</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  typedef __gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, _EqKey, _Alloc></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  _Container;</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  _Container* container;</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  typename _Container::iterator iter;</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> </div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  public:</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  typedef _Container container_type;</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  typedef output_iterator_tag iterator_category;</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  typedef void value_type;</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  typedef void difference_type;</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  typedef void pointer;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  typedef void reference;</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> </div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  insert_iterator(_Container& __x)</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  : container(&__x) {}</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  insert_iterator(_Container& __x, typename _Container::iterator)</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  : container(&__x) {}</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> </div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  operator=(const typename _Container::value_type& __value)</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  {</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  container->insert(__value);</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  return *this;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  }</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  operator*()</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  { return *this; }</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> </div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  operator++()</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  { return *this; }</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span> </div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  insert_iterator<_Container>&</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  operator++(int)</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  { return *this; }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  };</div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> _GLIBCXX_END_NAMESPACE_VERSION</div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> } // namespace</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> </div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> #endif</div></div><!-- fragment --></div><!-- contents --> </div><!-- doc-content --> <!-- start footer part --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <ul> <li class="navelem"><a class="el" href="dir_3a83f109ff04170a1f8448445d1bdcba.html">include</a></li><li class="navelem"><a class="el" href="dir_15b520e14b00fe097b0d5bef618fa2fe.html">backward</a></li><li class="navelem"><a class="el" href="a00683.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.8.13 </li> </ul> </div> </body> </html>