<!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++: stl_map.h 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('a00515_source.html','');});
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_map.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00515.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Map implementation -*- C++ -*-</span></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> <span class="comment">// Copyright (C) 2001-2015 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// terms of the GNU General Public License as published by the</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// any later version.</span></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> <span class="comment">// This library is distributed in the hope that it will be useful,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// GNU General Public License for more details.</span></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> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></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> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></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> <span class="comment">/*</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> *</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * Copyright (c) 1994</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * Hewlett-Packard Company</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> *</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment"> *</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"> *</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment"> * Copyright (c) 1996,1997</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="comment"> *</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * provided that the above copyright notice appear in all copies and</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * that both that copyright notice and this permission notice appear</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * representations about the suitability of this software for any</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> */</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment">/** @file bits/stl_map.h</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * This is an internal header file, included by other library headers.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * Do not attempt to use it directly. @headername{map}</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> */</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> <span class="preprocessor">#ifndef _STL_MAP_H</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="preprocessor">#define _STL_MAP_H 1</span></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> <span class="preprocessor">#include <<a class="code" href="a00332.html">bits/functexcept.h</a>></span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include <<a class="code" href="a00302.html">bits/concept_check.h</a>></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#include <<a class="code" href="a00023.html">initializer_list</a>></span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#include <<a class="code" href="a00155.html">tuple</a>></span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">namespace </span><a class="code" href="a01487.html">std</a> _GLIBCXX_VISIBILITY(default)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> _GLIBCXX_BEGIN_NAMESPACE_CONTAINER</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="comment"></span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="comment"> /**</span></div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="comment"> * @brief A standard container made up of (key,value) pairs, which can be</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="comment"> * retrieved based on a key, in logarithmic time.</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="comment"> *</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> * @ingroup associative_containers</span></div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> *</span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> * @tparam _Key Type of key objects.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> * @tparam _Tp Type of mapped objects.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * @tparam _Compare Comparison function object type, defaults to less<_Key>.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * @tparam _Alloc Allocator type, defaults to </span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * allocator<pair<const _Key, _Tp>.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> *</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * <a href="tables.html#66">reversible container</a>, and an</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> * <a href="tables.html#69">associative container</a> (using unique keys).</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> <span class="comment"> * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the</span></div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment"> * value_type is std::pair<const Key,T>.</span></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="comment"> *</span></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment"> * Maps support bidirectional iterators.</span></div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment"> *</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment"> * The private tree data is declared exactly the same way for map and</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment"> * multimap; the distinction is made entirely in how the tree functions are</span></div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="comment"> * called (*_unique versus *_equal, same as the standard).</span></div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="comment"> */</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">template</span> <<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare = std::less<_Key>,</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typename</span> _Alloc = std::allocator<std::pair<const _Key, _Tp> > ></div><div class="line"><a name="l00096"></a><span class="lineno"><a class="line" href="a06665.html"> 96</a></span>  <span class="keyword">class </span><a class="code" href="a06665.html">map</a></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">typedef</span> _Key key_type;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keyword">typedef</span> _Tp mapped_type;</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typedef</span> <a class="code" href="a06689.html">std::pair<const _Key, _Tp></a> <a class="code" href="a06689.html">value_type</a>;</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">typedef</span> _Compare key_compare;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">typedef</span> _Alloc allocator_type;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  __glibcxx_class_requires(_Tp, _SGIAssignableConcept)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Key, _Key,</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  _BinaryFunctionConcept)</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  __glibcxx_class_requires2(value_type, _Alloc_value_type, _SameTypeConcept)</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keyword">class </span>value_compare</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  : <span class="keyword">public</span> <a class="code" href="a06353.html">std::binary_function</a><value_type, value_type, bool></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a06665.html">map</a><_Key, _Tp, _Compare, _Alloc>;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">protected</span>:</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  _Compare comp;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span> </div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  value_compare(_Compare __c)</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  : comp(__c) { }</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>  <span class="keyword">public</span>:</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> value_type& __x, <span class="keyword">const</span> value_type& __y)<span class="keyword"> const</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> comp(__x.<a class="code" href="a06689.html#a198b03cffc037835dc1dc01c926ce251">first</a>, __y.<a class="code" href="a06689.html#a198b03cffc037835dc1dc01c926ce251">first</a>); }</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  };</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> </div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">private</span>:<span class="comment"></span></div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> /// This turns a red-black tree into a [multi]map. </span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Alloc>::template</a></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  rebind<value_type>::other _Pair_alloc_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>  <span class="keyword">typedef</span> _Rb_tree<key_type, value_type, _Select1st<value_type>,</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  key_compare, _Pair_alloc_type> _Rep_type;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"></span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> /// The actual tree structure.</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"></span> _Rep_type _M_t;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keyword">typedef</span> <a class="code" href="a08925.html">__gnu_cxx::__alloc_traits<_Pair_alloc_type></a> <a class="code" href="a08925.html">_Alloc_traits</a>;</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span> </div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="comment">// many of these are specified differently in ISO, but the following are</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// "functionally equivalent"</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::pointer pointer;</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_pointer const_pointer;</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::reference reference;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc_traits::const_reference const_reference;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::iterator iterator;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator const_iterator;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::size_type size_type;</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::difference_type difference_type;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a06569.html">_Rep_type::reverse_iterator</a> <a class="code" href="a06569.html">reverse_iterator</a>;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a06569.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a06569.html">const_reverse_iterator</a>;</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> </div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// [23.3.1.1] construct/copy/destroy</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// (get_allocator() is also listed in this section)</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment"></span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment"> /**</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="comment"> * @brief Default constructor creates no elements.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment"> */</span></div><div class="line"><a name="l00162"></a><span class="lineno"><a class="line" href="a06665.html#ac4ef9122b867bba653d56f9abde9f101"> 162</a></span>  <a class="code" href="a06665.html#ac4ef9122b867bba653d56f9abde9f101">map</a>()</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  noexcept(is_nothrow_default_constructible<allocator_type>::value</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  && is_nothrow_default_constructible<key_compare>::value)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  : _M_t() { }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="comment"></span></div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="comment"> /**</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="comment"> * @brief Creates a %map with no elements.</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="comment"> * @param __comp A comparison object.</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="comment"> */</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">explicit</span></div><div class="line"><a name="l00175"></a><span class="lineno"><a class="line" href="a06665.html#aa12fa7df574ac42da454cba7581c258e"> 175</a></span>  <a class="code" href="a06665.html#aa12fa7df574ac42da454cba7581c258e">map</a>(<span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  : _M_t(__comp, _Pair_alloc_type(__a)) { }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="comment"></span></div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="comment"> /**</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="comment"> * @brief %Map copy constructor.</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="comment"> * @param __x A %map of identical element and allocator types.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment"> *</span></div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment"> * The newly-created %map uses a copy of the allocation object</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment"> * used by @a __x.</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment"> */</span></div><div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="a06665.html#a824e4206f6a5018174457ce8d46e9402"> 186</a></span>  <a class="code" href="a06665.html#a824e4206f6a5018174457ce8d46e9402">map</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map</a>& __x)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  : _M_t(__x._M_t) { }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="comment"> /**</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment"> * @brief %Map move constructor.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment"> * @param __x A %map of identical element and allocator types.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment"> *</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"> * The newly-created %map contains the exact contents of @a __x.</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> * The contents of @a __x are a valid, but unspecified %map.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> */</span></div><div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="a06665.html#a902da50a674926aa1153fd710bfc9e7c"> 197</a></span>  <a class="code" href="a06665.html#a902da50a674926aa1153fd710bfc9e7c">map</a>(<a class="code" href="a06665.html">map</a>&& __x)</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  noexcept(is_nothrow_copy_constructible<_Compare>::value)</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  : _M_t(<a class="code" href="a01487.html">std</a>::move(__x._M_t)) { }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"></span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment"> /**</span></div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment"> * @brief Builds a %map from an initializer_list.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment"> * @param __comp A comparison object.</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment"> *</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> * Create a %map consisting of copies of the elements in the</span></div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"> * initializer_list @a __l.</span></div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment"> * This is linear in N if the range is already sorted, and NlogN</span></div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="comment"> * otherwise (where N is @a __l.size()).</span></div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="comment"> */</span></div><div class="line"><a name="l00212"></a><span class="lineno"><a class="line" href="a06665.html#a353d38055f6c80e99c699ee4eeec914e"> 212</a></span>  <a class="code" href="a06665.html#a353d38055f6c80e99c699ee4eeec914e">map</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l,</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> _Compare& __comp = _Compare(),</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  : _M_t(__comp, _Pair_alloc_type(__a))</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  { _M_t._M_insert_unique(__l.begin(), __l.end()); }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="comment"></span></div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="comment"> /// Allocator-extended default constructor.</span></div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="comment"></span> <span class="keyword">explicit</span></div><div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="a06665.html#a97d93d27671323c77e27ef2986a4bcb8"> 220</a></span>  <a class="code" href="a06665.html#a97d93d27671323c77e27ef2986a4bcb8">map</a>(<span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  : _M_t(_Compare(), _Pair_alloc_type(__a)) { }</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment"></span></div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment"> /// Allocator-extended copy constructor.</span></div><div class="line"><a name="l00224"></a><span class="lineno"><a class="line" href="a06665.html#ae74f7651afbcb8b1c2d491a7145f3313"> 224</a></span> <span class="comment"></span> <a class="code" href="a06665.html#ae74f7651afbcb8b1c2d491a7145f3313">map</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map</a>& __m, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  : _M_t(__m._M_t, _Pair_alloc_type(__a)) { }</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment"></span></div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment"> /// Allocator-extended move constructor.</span></div><div class="line"><a name="l00228"></a><span class="lineno"><a class="line" href="a06665.html#a95c130beb22f45766110a5b734a5b7a6"> 228</a></span> <span class="comment"></span> <a class="code" href="a06665.html#a95c130beb22f45766110a5b734a5b7a6">map</a>(<a class="code" href="a06665.html">map</a>&& __m, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  noexcept(is_nothrow_copy_constructible<_Compare>::value</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  && _Alloc_traits::_S_always_equal())</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  : _M_t(<a class="code" href="a01487.html">std</a>::move(__m._M_t), _Pair_alloc_type(__a)) { }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment"></span></div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment"> /// Allocator-extended initialier-list constructor.</span></div><div class="line"><a name="l00234"></a><span class="lineno"><a class="line" href="a06665.html#a8310f2293e381afba51e9cc44dd0eeef"> 234</a></span> <span class="comment"></span> <a class="code" href="a06665.html#a8310f2293e381afba51e9cc44dd0eeef">map</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l, <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  : _M_t(_Compare(), _Pair_alloc_type(__a))</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  { _M_t._M_insert_unique(__l.begin(), __l.end()); }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="comment"></span></div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="comment"> /// Allocator-extended range constructor.</span></div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00240"></a><span class="lineno"><a class="line" href="a06665.html#a0d2b5c52350b2b79506ab308b32ca5f1"> 240</a></span>  <a class="code" href="a06665.html#a0d2b5c52350b2b79506ab308b32ca5f1">map</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> allocator_type& __a)</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  : _M_t(_Compare(), _Pair_alloc_type(__a))</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"></span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> <span class="comment"> /**</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment"> * @brief Builds a %map from a range.</span></div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> *</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"> * Create a %map consisting of copies of the elements from</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment"> */</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00257"></a><span class="lineno"><a class="line" href="a06665.html#a6339535802f1937f3dd78ee04d950ea7"> 257</a></span>  <a class="code" href="a06665.html#a6339535802f1937f3dd78ee04d950ea7">map</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  : _M_t()</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment"></span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> /**</span></div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"> * @brief Builds a %map from a range.</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span> <span class="comment"> * @param __first An input iterator.</span></div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment"> * @param __last An input iterator.</span></div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment"> * @param __comp A comparison functor.</span></div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment"> * @param __a An allocator object.</span></div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment"> *</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment"> * Create a %map consisting of copies of the elements from</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment"> * [__first,__last). This is linear in N if the range is</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment"> * already sorted, and NlogN otherwise (where N is</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment"> * distance(__first,__last)).</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment"> */</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00274"></a><span class="lineno"><a class="line" href="a06665.html#ac30882bd54277810ace3d0630cbc3252"> 274</a></span>  <a class="code" href="a06665.html#ac30882bd54277810ace3d0630cbc3252">map</a>(_InputIterator __first, _InputIterator __last,</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">const</span> _Compare& __comp,</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keyword">const</span> allocator_type& __a = allocator_type())</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  : _M_t(__comp, _Pair_alloc_type(__a))</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  { _M_t._M_insert_unique(__first, __last); }</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>  <span class="comment">// FIXME There is no dtor declared, but we should have something</span></div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// generated by Doxygen. I don't know what tags to add to this</span></div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// paragraph to make that happen:</span><span class="comment"></span></div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span> <span class="comment"> /**</span></div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span> <span class="comment"> * The dtor only erases the elements, and note that if the elements</span></div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span> <span class="comment"> * themselves are pointers, the pointed-to memory is not touched in any</span></div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> <span class="comment"> * way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> <span class="comment"> */</span></div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment"></span></div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment"> /**</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span> <span class="comment"> * @brief %Map assignment operator.</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="comment"> * @param __x A %map of identical element and allocator types.</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> <span class="comment"> *</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> <span class="comment"> * All the elements of @a __x are copied, but unlike the copy</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> * constructor, the allocator object is not copied.</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"> */</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <a class="code" href="a06665.html">map</a>&</div><div class="line"><a name="l00297"></a><span class="lineno"><a class="line" href="a06665.html#afc93fe1a99a328079339b2e154c618d8"> 297</a></span>  <a class="code" href="a06665.html#afc93fe1a99a328079339b2e154c618d8">operator=</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map</a>& __x)</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  _M_t = __x._M_t;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span> </div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <span class="comment"> /// Move assignment operator.</span></div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="comment"></span> <a class="code" href="a06665.html">map</a>&</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="a06665.html#afc93fe1a99a328079339b2e154c618d8">operator=</a>(<a class="code" href="a06665.html">map</a>&&) = <span class="keywordflow">default</span>;</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> <span class="comment"></span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment"> /**</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> * @brief %Map list assignment operator.</span></div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"> * @param __l An initializer_list.</span></div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> <span class="comment"> *</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> * This function fills a %map with copies of the elements in the</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> * initializer list @a __l.</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> *</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> * Note that the assignment completely changes the %map and</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"> * that the resulting %map's size is the same as the number</span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> * of elements assigned. Old data may be lost.</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> */</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="a06665.html">map</a>&</div><div class="line"><a name="l00320"></a><span class="lineno"><a class="line" href="a06665.html#ac01f44f3ed4b9dbebcb046b4103f920c"> 320</a></span>  <a class="code" href="a06665.html#ac01f44f3ed4b9dbebcb046b4103f920c">operator=</a>(<a class="code" href="a01601.html">initializer_list<value_type></a> __l)</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  {</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  _M_t._M_assign_unique(__l.begin(), __l.end());</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"></span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> /// Get a copy of the memory allocation object.</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"></span> allocator_type</div><div class="line"><a name="l00329"></a><span class="lineno"><a class="line" href="a06665.html#adc72d6a2972834a9f512d424310468a7"> 329</a></span>  <a class="code" href="a06665.html#adc72d6a2972834a9f512d424310468a7">get_allocator</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  { <span class="keywordflow">return</span> allocator_type(_M_t.get_allocator()); }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> </div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// iterators</span><span class="comment"></span></div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span> <span class="comment"> /**</span></div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> <span class="comment"> * Returns a read/write iterator that points to the first pair in the</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> <span class="comment"> * %map.</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="comment"> * Iteration is done in ascending order according to the keys.</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="comment"> */</span></div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  iterator</div><div class="line"><a name="l00339"></a><span class="lineno"><a class="line" href="a06665.html#af515aec447786d3fcfff02fe18385cbc"> 339</a></span>  <a class="code" href="a06665.html#af515aec447786d3fcfff02fe18385cbc">begin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment"></span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="comment"> /**</span></div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first pair</span></div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> <span class="comment"> * in the %map. Iteration is done in ascending order according to the</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span> <span class="comment"> * keys.</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="comment"> */</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  const_iterator</div><div class="line"><a name="l00348"></a><span class="lineno"><a class="line" href="a06665.html#af46ca23264de805bde6259ab11c9d93c"> 348</a></span>  <a class="code" href="a06665.html#af46ca23264de805bde6259ab11c9d93c">begin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment"></span></div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> /**</span></div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"> * Returns a read/write iterator that points one past the last</span></div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment"> * pair in the %map. Iteration is done in ascending order</span></div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment"> */</span></div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  iterator</div><div class="line"><a name="l00357"></a><span class="lineno"><a class="line" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee"> 357</a></span>  <a class="code" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">end</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> <span class="comment"></span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> <span class="comment"> /**</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="comment"> * pair in the %map. Iteration is done in ascending order according to</span></div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> <span class="comment"> * the keys.</span></div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="comment"> */</span></div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  const_iterator</div><div class="line"><a name="l00366"></a><span class="lineno"><a class="line" href="a06665.html#a50d3bee624167086813c84cc5fbc0f8f"> 366</a></span>  <a class="code" href="a06665.html#a50d3bee624167086813c84cc5fbc0f8f">end</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> <span class="comment"></span></div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="comment"> /**</span></div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="comment"> * Returns a read/write reverse iterator that points to the last pair in</span></div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="comment"> * the %map. Iteration is done in descending order according to the</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment"> * keys.</span></div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="comment"> */</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  reverse_iterator</div><div class="line"><a name="l00375"></a><span class="lineno"><a class="line" href="a06665.html#a4ca3db2d238641b23001310899d884fb"> 375</a></span>  <a class="code" href="a06665.html#a4ca3db2d238641b23001310899d884fb">rbegin</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment"></span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment"> /**</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> * last pair in the %map. Iteration is done in descending order</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> */</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  const_reverse_iterator</div><div class="line"><a name="l00384"></a><span class="lineno"><a class="line" href="a06665.html#a461fb30e5fd8953549843ff651d06ec8"> 384</a></span>  <a class="code" href="a06665.html#a461fb30e5fd8953549843ff651d06ec8">rbegin</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"></span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> /**</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> * Returns a read/write reverse iterator that points to one before the</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> * first pair in the %map. Iteration is done in descending order</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> */</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  reverse_iterator</div><div class="line"><a name="l00393"></a><span class="lineno"><a class="line" href="a06665.html#aa467231586b6bc6388765ec6802aef54"> 393</a></span>  <a class="code" href="a06665.html#aa467231586b6bc6388765ec6802aef54">rend</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="comment"></span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="comment"> /**</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span></div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> <span class="comment"> * before the first pair in the %map. Iteration is done in descending</span></div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="comment"> * order according to the keys.</span></div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> <span class="comment"> */</span></div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  const_reverse_iterator</div><div class="line"><a name="l00402"></a><span class="lineno"><a class="line" href="a06665.html#a21512c1e39cedc32e0275f89f888d4aa"> 402</a></span>  <a class="code" href="a06665.html#a21512c1e39cedc32e0275f89f888d4aa">rend</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</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> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> <span class="comment"> /**</span></div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> <span class="comment"> * Returns a read-only (constant) iterator that points to the first pair</span></div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment"> * in the %map. Iteration is done in ascending order according to the</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="comment"> * keys.</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> <span class="comment"> */</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  const_iterator</div><div class="line"><a name="l00412"></a><span class="lineno"><a class="line" href="a06665.html#af11167910bc728cbeb7997b7e8bd8326"> 412</a></span>  <a class="code" href="a06665.html#af11167910bc728cbeb7997b7e8bd8326">cbegin</a>() const noexcept</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  { <span class="keywordflow">return</span> _M_t.begin(); }</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="comment"></span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="comment"> /**</span></div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="comment"> * pair in the %map. Iteration is done in ascending order according to</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="comment"> * the keys.</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span> <span class="comment"> */</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  const_iterator</div><div class="line"><a name="l00421"></a><span class="lineno"><a class="line" href="a06665.html#a512508ab8aef5dad73ae92751513769e"> 421</a></span>  <a class="code" href="a06665.html#a512508ab8aef5dad73ae92751513769e">cend</a>() const noexcept</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  { <span class="keywordflow">return</span> _M_t.end(); }</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment"></span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment"> /**</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="comment"> * last pair in the %map. Iteration is done in descending order</span></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="comment"> * according to the keys.</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> <span class="comment"> */</span></div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  const_reverse_iterator</div><div class="line"><a name="l00430"></a><span class="lineno"><a class="line" href="a06665.html#a68296cab04aadacb8da0b4bb1a8d8991"> 430</a></span>  <a class="code" href="a06665.html#a68296cab04aadacb8da0b4bb1a8d8991">crbegin</a>() const noexcept</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  { <span class="keywordflow">return</span> _M_t.rbegin(); }</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> <span class="comment"></span></div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="comment"> /**</span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span></div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment"> * before the first pair in the %map. Iteration is done in descending</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment"> * order according to the keys.</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment"> */</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  const_reverse_iterator</div><div class="line"><a name="l00439"></a><span class="lineno"><a class="line" href="a06665.html#adbd5c263f187f16ca9f073e1789a02ff"> 439</a></span>  <a class="code" href="a06665.html#adbd5c263f187f16ca9f073e1789a02ff">crend</a>() const noexcept</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  { <span class="keywordflow">return</span> _M_t.rend(); }</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// capacity</span><span class="comment"></span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment"> /** Returns true if the %map is empty. (Thus begin() would equal</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="comment"> * end().)</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="comment"> */</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00448"></a><span class="lineno"><a class="line" href="a06665.html#a16986a6517197b25e8ad3f7487c8536f"> 448</a></span>  <a class="code" href="a06665.html#a16986a6517197b25e8ad3f7487c8536f">empty</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  { <span class="keywordflow">return</span> _M_t.empty(); }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="comment"></span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="comment"> /** Returns the size of the %map. */</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  size_type</div><div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="a06665.html#ab8dd27409135bbee5bb626cd72e0cddb"> 453</a></span>  <a class="code" href="a06665.html#ab8dd27409135bbee5bb626cd72e0cddb">size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  { <span class="keywordflow">return</span> _M_t.size(); }</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span> <span class="comment"></span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span> <span class="comment"> /** Returns the maximum size of the %map. */</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  size_type</div><div class="line"><a name="l00458"></a><span class="lineno"><a class="line" href="a06665.html#af2c022c3b246d7beb4c6eae4d6ce7ca2"> 458</a></span>  <a class="code" href="a06665.html#af2c022c3b246d7beb4c6eae4d6ce7ca2">max_size</a>() const _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  { <span class="keywordflow">return</span> _M_t.max_size(); }</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="comment">// [23.3.1.2] element access</span><span class="comment"></span></div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span> <span class="comment"> /**</span></div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span> <span class="comment"> * @brief Subscript ( @c [] ) access to %map data.</span></div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="comment"> * @param __k The key for which data should be retrieved.</span></div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="comment"> * @return A reference to the data of the (key,data) %pair.</span></div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span> <span class="comment"> *</span></div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span> <span class="comment"> * Allows for easy lookup with the subscript ( @c [] )</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> <span class="comment"> * operator. Returns data associated with the key specified in</span></div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> <span class="comment"> * subscript. If the key does not exist, a pair with that key</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> <span class="comment"> * is created using default values, which is then returned.</span></div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span> <span class="comment"> *</span></div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> <span class="comment"> * Lookup requires logarithmic time.</span></div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> <span class="comment"> */</span></div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  mapped_type&</div><div class="line"><a name="l00475"></a><span class="lineno"><a class="line" href="a06665.html#a4a4a9f95131baf0713596d672ec36b5f"> 475</a></span>  <a class="code" href="a06665.html#a4a4a9f95131baf0713596d672ec36b5f">operator[]</a>(<span class="keyword">const</span> key_type& __k)</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  {</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span> </div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  iterator __i = <a class="code" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">lower_bound</a>(__k);</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// __i->first is greater than or equivalent to __k.</span></div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">end</a>() || <a class="code" href="a06665.html#a59af09cf176afb26d8e2657581429d3f">key_comp</a>()(__k, (*__i).first))</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  __i = _M_t._M_emplace_hint_unique(__i, <a class="code" href="a01431.html#ga9251cc200339814c062d2bda48994255">std::piecewise_construct</a>,</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="a03329.html">std::tuple<const key_type&></a>(__k),</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="a03329.html">std::tuple<></a>());</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  __i = <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(__i, value_type(__k, mapped_type()));</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">return</span> (*__i).second;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  mapped_type&</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <a class="code" href="a06665.html#a4a4a9f95131baf0713596d672ec36b5f">operator[]</a>(key_type&& __k)</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// concept requirements</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span> </div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  iterator __i = <a class="code" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">lower_bound</a>(__k);</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// __i->first is greater than or equivalent to __k.</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">end</a>() || <a class="code" href="a06665.html#a59af09cf176afb26d8e2657581429d3f">key_comp</a>()(__k, (*__i).first))</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  __i = _M_t._M_emplace_hint_unique(__i, <a class="code" href="a01431.html#ga9251cc200339814c062d2bda48994255">std::piecewise_construct</a>,</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  std::forward_as_tuple(std::move(__k)),</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <a class="code" href="a03329.html">std::tuple<></a>());</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">return</span> (*__i).second;</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> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span> </div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="comment">// DR 464. Suggestion for new member functions in standard containers.</span><span class="comment"></span></div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span> <span class="comment"> /**</span></div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> <span class="comment"> * @brief Access to %map data.</span></div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span> <span class="comment"> * @param __k The key for which data should be retrieved.</span></div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span> <span class="comment"> * @return A reference to the data whose key is equivalent to @a __k, if</span></div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="comment"> * such a data is present in the %map.</span></div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> <span class="comment"> * @throw std::out_of_range If no such data is present.</span></div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment"> */</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  mapped_type&</div><div class="line"><a name="l00520"></a><span class="lineno"><a class="line" href="a06665.html#aaf4942bb42ef39ce49cc232c06416f55"> 520</a></span>  <a class="code" href="a06665.html#aaf4942bb42ef39ce49cc232c06416f55">at</a>(<span class="keyword">const</span> key_type& __k)</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  {</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  iterator __i = <a class="code" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">lower_bound</a>(__k);</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">end</a>() || <a class="code" href="a06665.html#a59af09cf176afb26d8e2657581429d3f">key_comp</a>()(__k, (*__i).first))</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  __throw_out_of_range(__N(<span class="stringliteral">"map::at"</span>));</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">return</span> (*__i).second;</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> </div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">const</span> mapped_type&</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <a class="code" href="a06665.html#aaf4942bb42ef39ce49cc232c06416f55">at</a>(<span class="keyword">const</span> key_type& __k)<span class="keyword"> const</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  const_iterator __i = <a class="code" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">lower_bound</a>(__k);</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keywordflow">if</span> (__i == <a class="code" href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">end</a>() || <a class="code" href="a06665.html#a59af09cf176afb26d8e2657581429d3f">key_comp</a>()(__k, (*__i).first))</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  __throw_out_of_range(__N(<span class="stringliteral">"map::at"</span>));</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span> (*__i).second;</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> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// modifiers</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment"> /**</span></div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the %map.</span></div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment"> *</span></div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span> <span class="comment"> *</span></div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span> <span class="comment"> * @return A pair, of which the first element is an iterator that points</span></div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> <span class="comment"> * to the possibly inserted pair, and the second is a bool that</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span> <span class="comment"> * is true if the pair was actually inserted.</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> <span class="comment"> *</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> <span class="comment"> * This function attempts to build and insert a (key, value) %pair into</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> <span class="comment"> * the %map.</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span> <span class="comment"> * A %map relies on unique keys and thus a %pair is only inserted if its</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span> <span class="comment"> * first element (the key) is not already present in the %map.</span></div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> <span class="comment"> *</span></div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span> <span class="comment"> * Insertion requires logarithmic time.</span></div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span> <span class="comment"> */</span></div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <a class="code" href="a06689.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00559"></a><span class="lineno"><a class="line" href="a06665.html#adbdeb769358f26cc1f0124f5c53df0eb"> 559</a></span>  <a class="code" href="a06665.html#adbdeb769358f26cc1f0124f5c53df0eb">emplace</a>(_Args&&... __args)</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  { <span class="keywordflow">return</span> _M_t._M_emplace_unique(std::forward<_Args>(__args)...); }</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span> <span class="comment"></span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="comment"> /**</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="comment"> * @brief Attempts to build and insert a std::pair into the %map.</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="comment"> *</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="comment"> * @param __pos An iterator that serves as a hint as to where the pair</span></div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="comment"> * should be inserted.</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="comment"> * @param __args Arguments used to generate a new pair instance (see</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="comment"> * std::piecewise_contruct for passing arguments to each</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="comment"> * part of the pair constructor).</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="comment"> * @return An iterator that points to the element with key of the</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> <span class="comment"> * std::pair built from @a __args (may or may not be that</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> <span class="comment"> * std::pair).</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> <span class="comment"> *</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span> <span class="comment"> * This function is not concerned about whether the insertion took place,</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span> <span class="comment"> * and thus does not return a boolean like the single-argument emplace()</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> <span class="comment"> * does.</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> <span class="comment"> * Note that the first parameter is only a hint and can potentially</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment"> * improve the performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> <span class="comment"> *</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> <span class="comment"> * See</span></div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span> <span class="comment"> *</span></div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span></div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span> <span class="comment"> */</span></div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keyword">template</span><<span class="keyword">typename</span>... _Args></div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  iterator</div><div class="line"><a name="l00589"></a><span class="lineno"><a class="line" href="a06665.html#a01e3c11364a0f9f6304581d1dc69bd34"> 589</a></span>  <a class="code" href="a06665.html#a01e3c11364a0f9f6304581d1dc69bd34">emplace_hint</a>(const_iterator __pos, _Args&&... __args)</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>  <span class="keywordflow">return</span> _M_t._M_emplace_hint_unique(__pos,</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  std::forward<_Args>(__args)...);</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  }</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> <span class="comment"></span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> <span class="comment"> /**</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %map.</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span> <span class="comment"></span></div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy</span></div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span> <span class="comment"> * creation of pairs).</span></div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span> <span class="comment"> *</span></div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span> <span class="comment"> * @return A pair, of which the first element is an iterator that </span></div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="comment"> * points to the possibly inserted pair, and the second is </span></div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span> <span class="comment"> * a bool that is true if the pair was actually inserted.</span></div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span> <span class="comment"> *</span></div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span> <span class="comment"> * This function attempts to insert a (key, value) %pair into the %map.</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> <span class="comment"> * A %map relies on unique keys and thus a %pair is only inserted if its</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span> <span class="comment"> * first element (the key) is not already present in the %map.</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span> <span class="comment"> *</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> <span class="comment"> * Insertion requires logarithmic time.</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="comment"> */</span></div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <a class="code" href="a06689.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00613"></a><span class="lineno"><a class="line" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41"> 613</a></span>  <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(<span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique(__x); }</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span> </div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = <span class="keyword">typename</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  std::enable_if<std::is_constructible<value_type,</div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  _Pair&&>::value>::type></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="a06689.html">std::pair<iterator, bool></a></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(_Pair&& __x)</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique(std::forward<_Pair>(__x)); }</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span> </div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="comment"> /**</span></div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> <span class="comment"> * @brief Attempts to insert a list of std::pairs into the %map.</span></div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span> <span class="comment"> * @param __list A std::initializer_list<value_type> of pairs to be</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span> <span class="comment"> *</span></div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span> <span class="comment"> */</span></div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00634"></a><span class="lineno"><a class="line" href="a06665.html#ab228710aaa8c81fc3b7fe37b26fc709a"> 634</a></span>  <a class="code" href="a06665.html#ab228710aaa8c81fc3b7fe37b26fc709a">insert</a>(<a class="code" href="a01601.html">std::initializer_list<value_type></a> __list)</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  { <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(__list.begin(), __list.end()); }</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span> <span class="comment"></span></div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span> <span class="comment"> /**</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="comment"> * @brief Attempts to insert a std::pair into the %map.</span></div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span> <span class="comment"> * @param __position An iterator that serves as a hint as to where the</span></div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> <span class="comment"> * pair should be inserted.</span></div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span> <span class="comment"> * @param __x Pair to be inserted (see std::make_pair for easy creation</span></div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span> <span class="comment"> * of pairs).</span></div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span> <span class="comment"> * @return An iterator that points to the element with key of</span></div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span> <span class="comment"> * @a __x (may or may not be the %pair passed in).</span></div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span> <span class="comment"> *</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span> <span class="comment"></span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> <span class="comment"> * This function is not concerned about whether the insertion</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> <span class="comment"> * took place, and thus does not return a boolean like the</span></div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> <span class="comment"> * single-argument insert() does. Note that the first</span></div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> <span class="comment"> * parameter is only a hint and can potentially improve the</span></div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span> <span class="comment"> * performance of the insertion process. A bad hint would</span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span> <span class="comment"> * cause no gains in efficiency.</span></div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span> <span class="comment"> *</span></div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span> <span class="comment"> * See</span></div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span> <span class="comment"> * https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints</span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> <span class="comment"> * for more on @a hinting.</span></div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span> <span class="comment"> *</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span> <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span> <span class="comment"> */</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  iterator</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00663"></a><span class="lineno"><a class="line" href="a06665.html#aa0d825fbc11a62dc06420646e0c90dd5"> 663</a></span>  <a class="code" href="a06665.html#aa0d825fbc11a62dc06420646e0c90dd5">insert</a>(const_iterator __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(iterator __position, <span class="keyword">const</span> value_type& __x)</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, __x); }</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = <span class="keyword">typename</span></div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  std::enable_if<std::is_constructible<value_type,</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  _Pair&&>::value>::type></div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  iterator</div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <a class="code" href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">insert</a>(const_iterator __position, _Pair&& __x)</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position,</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  std::forward<_Pair>(__x)); }</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span> <span class="comment"></span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span> <span class="comment"> /**</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span> <span class="comment"> * @brief Template function that attempts to insert a range of elements.</span></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span> <span class="comment"> * inserted.</span></div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="comment"> * @param __last Iterator pointing to the end of the range.</span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="comment"> *</span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span> <span class="comment"> * Complexity similar to that of the range constructor.</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span> <span class="comment"> */</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator></div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00689"></a><span class="lineno"><a class="line" href="a06665.html#a3186e7576e4ffc474fd92f66e460d231"> 689</a></span>  <a class="code" href="a06665.html#a3186e7576e4ffc474fd92f66e460d231">insert</a>(_InputIterator __first, _InputIterator __last)</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  { _M_t._M_insert_unique(__first, __last); }</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> </div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span> <span class="comment"> /**</span></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span> <span class="comment"> * @brief Erases an element from a %map.</span></div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> <span class="comment"> * @return An iterator pointing to the element immediately following</span></div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="comment"> * @a position prior to the element being erased. If no such </span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span> <span class="comment"> * element exists, end() is returned.</span></div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> <span class="comment"> *</span></div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span> <span class="comment"> * This function erases an element, pointed to by the given</span></div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span> <span class="comment"> * iterator, from a %map. Note that this function only erases</span></div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="comment"> * the element, and that if the element is itself a pointer,</span></div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span></div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="comment"> * the pointer is the user's responsibility.</span></div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="comment"> */</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  iterator</div><div class="line"><a name="l00709"></a><span class="lineno"><a class="line" href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d"> 709</a></span>  <a class="code" href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d">erase</a>(const_iterator __position)</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  { <span class="keywordflow">return</span> _M_t.erase(__position); }</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> </div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// LWG 2059</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  _GLIBCXX_ABI_TAG_CXX11</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  iterator</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <a class="code" href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d">erase</a>(iterator __position)</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  { <span class="keywordflow">return</span> _M_t.erase(__position); }</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment"> /**</span></div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span> <span class="comment"> * @brief Erases an element from a %map.</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment"> * @param __position An iterator pointing to the element to be erased.</span></div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span> <span class="comment"> *</span></div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="comment"> * This function erases an element, pointed to by the given</span></div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span> <span class="comment"> * iterator, from a %map. Note that this function only erases</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="comment"> * the element, and that if the element is itself a pointer,</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment"> * the pointer is the user's responsibility.</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="comment"> */</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <a class="code" href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d">erase</a>(iterator __position)</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  { _M_t.erase(__position); }</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span> <span class="comment"></span></div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span> <span class="comment"> /**</span></div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span> <span class="comment"> * @brief Erases elements according to the provided key.</span></div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span> <span class="comment"> * @param __x Key of element to be erased.</span></div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> <span class="comment"> * @return The number of elements erased.</span></div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> <span class="comment"> *</span></div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment"> * This function erases all the elements located by the given key from</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="comment"> * a %map.</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span> <span class="comment"> */</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  size_type</div><div class="line"><a name="l00745"></a><span class="lineno"><a class="line" href="a06665.html#a6b510fc380b070d899d73a278cbb8faf"> 745</a></span>  <a class="code" href="a06665.html#a6b510fc380b070d899d73a278cbb8faf">erase</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  { <span class="keywordflow">return</span> _M_t.erase(__x); }</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span> </div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span></div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span></div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span> <span class="comment"> /**</span></div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span> <span class="comment"> * @brief Erases a [first,last) range of elements from a %map.</span></div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span> <span class="comment"> * @return The iterator @a __last.</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span> <span class="comment"> *</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span> <span class="comment"> * This function erases a sequence of elements from a %map.</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span> <span class="comment"> */</span></div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  iterator</div><div class="line"><a name="l00765"></a><span class="lineno"><a class="line" href="a06665.html#aa98a4bd34df51b51262b26f06a657efe"> 765</a></span>  <a class="code" href="a06665.html#aa98a4bd34df51b51262b26f06a657efe">erase</a>(const_iterator __first, const_iterator __last)</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  { <span class="keywordflow">return</span> _M_t.erase(__first, __last); }</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="comment"> /**</span></div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment"> * @brief Erases a [__first,__last) range of elements from a %map.</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment"> * @param __first Iterator pointing to the start of the range to be</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment"> * erased.</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment"> * @param __last Iterator pointing to the end of the range to</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment"> * be erased.</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="comment"> *</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span> <span class="comment"> * This function erases a sequence of elements from a %map.</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span> <span class="comment"> * Note that this function only erases the element, and that if</span></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span></div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment"> */</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <a class="code" href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d">erase</a>(iterator __first, iterator __last)</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  { _M_t.erase(__first, __last); }</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span> <span class="comment"></span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> <span class="comment"> /**</span></div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="comment"> * @brief Swaps data with another %map.</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> <span class="comment"> * @param __x A %map of the same element and allocator types.</span></div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span> <span class="comment"> *</span></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="comment"> * This exchanges the elements between two maps in constant</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span> <span class="comment"> * time. (It is only swapping a pointer, an integer, and an</span></div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> <span class="comment"> * instance of the @c Compare type (which itself is often</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span> <span class="comment"> * stateless and empty), so it should be quite fast.) Note</span></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span> <span class="comment"> * that the global std::swap() function is specialized such</span></div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span> <span class="comment"> * that std::swap(m1,m2) will feed to this function.</span></div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span> <span class="comment"> */</span></div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00797"></a><span class="lineno"><a class="line" href="a06665.html#a49c39598750cfbe89abeeb5c314330b9"> 797</a></span>  <a class="code" href="a06665.html#a49c39598750cfbe89abeeb5c314330b9">swap</a>(<a class="code" href="a06665.html">map</a>& __x)</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span> <span class="preprocessor">#if __cplusplus >= 201103L</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  { _M_t.swap(__x._M_t); }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> <span class="comment"></span></div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span> <span class="comment"> /**</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span> <span class="comment"> * Erases all elements in a %map. Note that this function only</span></div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span> <span class="comment"> * erases the elements, and that if the elements themselves are</span></div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="comment"> * pointers, the pointed-to memory is not touched in any way.</span></div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> <span class="comment"> * Managing the pointer is the user's responsibility.</span></div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span> <span class="comment"> */</span></div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00810"></a><span class="lineno"><a class="line" href="a06665.html#a5c72b2772d31bff52f9454a583547f58"> 810</a></span>  <a class="code" href="a06665.html#a5c72b2772d31bff52f9454a583547f58">clear</a>() _GLIBCXX_NOEXCEPT</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  { _M_t.clear(); }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="comment">// observers</span><span class="comment"></span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> <span class="comment"> /**</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> <span class="comment"> * Returns the key comparison object out of which the %map was</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span> <span class="comment"> * constructed.</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span> <span class="comment"> */</span></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  key_compare</div><div class="line"><a name="l00819"></a><span class="lineno"><a class="line" href="a06665.html#a59af09cf176afb26d8e2657581429d3f"> 819</a></span>  <a class="code" href="a06665.html#a59af09cf176afb26d8e2657581429d3f">key_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> <span class="comment"></span></div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment"> /**</span></div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment"> * Returns a value comparison object, built from the key comparison</span></div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span> <span class="comment"> * object out of which the %map was constructed.</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> <span class="comment"> */</span></div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  value_compare</div><div class="line"><a name="l00827"></a><span class="lineno"><a class="line" href="a06665.html#a2c51f439c6328b72ebdd7e5e558ef847"> 827</a></span>  <a class="code" href="a06665.html#a2c51f439c6328b72ebdd7e5e558ef847">value_comp</a>()<span class="keyword"> const</span></div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> value_compare(_M_t.key_comp()); }</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span> </div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// [23.3.1.3] map operations</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span> <span class="comment"></span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span> <span class="comment"> * @brief Tries to locate an element in a %map.</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> <span class="comment"> * @param __x Key of (key, value) %pair to be located.</span></div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span></div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment"> * found.</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="comment"> *</span></div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> <span class="comment"> * the key matches. If successful the function returns an iterator</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span> <span class="comment"> * pointing to the sought after %pair. If unsuccessful it returns the</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span> <span class="comment"> * past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> <span class="comment"> */</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span> </div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  iterator</div><div class="line"><a name="l00846"></a><span class="lineno"><a class="line" href="a06665.html#abdcd985632d8ad7ddba069aa776e2dfe"> 846</a></span>  <a class="code" href="a06665.html#abdcd985632d8ad7ddba069aa776e2dfe">find</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  { <span class="keywordflow">return</span> _M_t.find(__x); }</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span> </div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00852"></a><span class="lineno"><a class="line" href="a06665.html#a39303b5617b240f3049dbb0d195789f5"> 852</a></span>  <a class="code" href="a06665.html#a39303b5617b240f3049dbb0d195789f5">find</a>(<span class="keyword">const</span> _Kt& __x) -> decltype(_M_t._M_find_tr(__x))</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  { <span class="keywordflow">return</span> _M_t._M_find_tr(__x); }</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span> <span class="comment"> * @brief Tries to locate an element in a %map.</span></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span> <span class="comment"> * @param __x Key of (key, value) %pair to be located.</span></div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span> <span class="comment"> * @return Read-only (constant) iterator pointing to sought-after</span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span> <span class="comment"> * element, or end() if not found.</span></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> <span class="comment"> *</span></div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span> <span class="comment"> * This function takes a key and tries to locate the element with which</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span> <span class="comment"> * the key matches. If successful the function returns a constant</span></div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> <span class="comment"> * iterator pointing to the sought after %pair. If unsuccessful it</span></div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> <span class="comment"> * returns the past-the-end ( @c end() ) iterator.</span></div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span> <span class="comment"> */</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> </div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  const_iterator</div><div class="line"><a name="l00871"></a><span class="lineno"><a class="line" href="a06665.html#a07cdb0ebaf753ec1244849dbff2ec4cf"> 871</a></span>  <a class="code" href="a06665.html#a07cdb0ebaf753ec1244849dbff2ec4cf">find</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x); }</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span> </div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00877"></a><span class="lineno"><a class="line" href="a06665.html#accf5f3477b6615f6b31fcb1adf068dfc"> 877</a></span>  <a class="code" href="a06665.html#accf5f3477b6615f6b31fcb1adf068dfc">find</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span> -> decltype(_M_t._M_find_tr(__x))</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  { <span class="keywordflow">return</span> _M_t._M_find_tr(__x); }</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span> <span class="comment"> * @brief Finds the number of elements with given key.</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span> <span class="comment"> * @param __x Key of (key, value) pairs to be located.</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span> <span class="comment"> * @return Number of elements with specified key.</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span> <span class="comment"> *</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span> <span class="comment"> * This function only makes sense for multimaps; for map the result will</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span> <span class="comment"> * either be 0 (not present) or 1 (present).</span></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> <span class="comment"> */</span></div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  size_type</div><div class="line"><a name="l00892"></a><span class="lineno"><a class="line" href="a06665.html#a44da6d0dc51d80a873cc9405a805c712"> 892</a></span>  <a class="code" href="a06665.html#a44da6d0dc51d80a873cc9405a805c712">count</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x) == _M_t.end() ? 0 : 1; }</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span> </div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00898"></a><span class="lineno"><a class="line" href="a06665.html#a1264d32ee2fd0cfaee914fbafc088b54"> 898</a></span>  <a class="code" href="a06665.html#a1264d32ee2fd0cfaee914fbafc088b54">count</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span> -> decltype(_M_t._M_count_tr(__x))</div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  { <span class="keywordflow">return</span> _M_t._M_count_tr(__x); }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span> <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span> <span class="comment"> * @param __x Key of (key, value) pair to be located.</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> <span class="comment"> * @return Iterator pointing to first element equal to or greater</span></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> <span class="comment"> * than key, or end().</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span> <span class="comment"> *</span></div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> <span class="comment"> * This function returns the first element of a subsequence of elements</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span></div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment"> * pointing to the first element that has a greater value than given key</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span> <span class="comment"> * or end() if no such element exists.</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span> <span class="comment"> */</span></div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  iterator</div><div class="line"><a name="l00916"></a><span class="lineno"><a class="line" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081"> 916</a></span>  <a class="code" href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">lower_bound</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  { <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> </div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00922"></a><span class="lineno"><a class="line" href="a06665.html#a5db81ee7912a625e5d7ead27f0cb4133"> 922</a></span>  <a class="code" href="a06665.html#a5db81ee7912a625e5d7ead27f0cb4133">lower_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span> <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span> <span class="comment"> * @param __x Key of (key, value) pair to be located.</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span> <span class="comment"> * @return Read-only (constant) iterator pointing to first element</span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span> <span class="comment"> * equal to or greater than key, or end().</span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span> <span class="comment"> *</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> <span class="comment"> * This function returns the first element of a subsequence of elements</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span> <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="comment"> * pointing to the first element that has a greater value than given key</span></div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment"> * or end() if no such element exists.</span></div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span> <span class="comment"> */</span></div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  const_iterator</div><div class="line"><a name="l00941"></a><span class="lineno"><a class="line" href="a06665.html#ab801bf5b252cc1b28af052263ce33d7a"> 941</a></span>  <a class="code" href="a06665.html#ab801bf5b252cc1b28af052263ce33d7a">lower_bound</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.lower_bound(__x); }</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span> </div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00947"></a><span class="lineno"><a class="line" href="a06665.html#a2dfc6f822052135a0b48e0dca314ccaf"> 947</a></span>  <a class="code" href="a06665.html#a2dfc6f822052135a0b48e0dca314ccaf">lower_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  { <span class="keywordflow">return</span> const_iterator(_M_t._M_lower_bound_tr(__x)); }</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span> <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span></div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> <span class="comment"> * @param __x Key of (key, value) pair to be located.</span></div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span> <span class="comment"> * @return Iterator pointing to the first element</span></div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> <span class="comment"> * greater than key, or end().</span></div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> <span class="comment"> */</span></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  iterator</div><div class="line"><a name="l00961"></a><span class="lineno"><a class="line" href="a06665.html#a31f6ba9ed7f80198dd444d6d830a3c80"> 961</a></span>  <a class="code" href="a06665.html#a31f6ba9ed7f80198dd444d6d830a3c80">upper_bound</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  { <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span> </div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00967"></a><span class="lineno"><a class="line" href="a06665.html#a58dfea28ca363de5083ec265382de319"> 967</a></span>  <a class="code" href="a06665.html#a58dfea28ca363de5083ec265382de319">upper_bound</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  { <span class="keywordflow">return</span> iterator(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span></div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span> <span class="comment"> * @param __x Key of (key, value) pair to be located.</span></div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span> <span class="comment"> * @return Read-only (constant) iterator pointing to first iterator</span></div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> <span class="comment"> * greater than key, or end().</span></div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> <span class="comment"> */</span></div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  const_iterator</div><div class="line"><a name="l00981"></a><span class="lineno"><a class="line" href="a06665.html#afd9ba5f5b31a79317b1c5ec547b9ec6c"> 981</a></span>  <a class="code" href="a06665.html#afd9ba5f5b31a79317b1c5ec547b9ec6c">upper_bound</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.upper_bound(__x); }</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> </div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keyword">auto</span></div><div class="line"><a name="l00987"></a><span class="lineno"><a class="line" href="a06665.html#abd9ce0ad35c587805de6a54c3e61cd02"> 987</a></span>  <a class="code" href="a06665.html#abd9ce0ad35c587805de6a54c3e61cd02">upper_bound</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  { <span class="keywordflow">return</span> const_iterator(_M_t._M_upper_bound_tr(__x)); }</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <span class="comment"> //@}</span></div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> <span class="comment"> //@{</span></div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span> <span class="comment"> * @param __x Key of (key, value) pairs to be located.</span></div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span></div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span> <span class="comment"> * matching given key.</span></div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span> <span class="comment"> *</span></div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span> <span class="comment"> * This function is equivalent to</span></div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span> <span class="comment"> * @code</span></div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span> <span class="comment"> * std::make_pair(c.lower_bound(val),</span></div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span> <span class="comment"> * c.upper_bound(val))</span></div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span> <span class="comment"> * (but is faster than making the calls separately).</span></div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span> <span class="comment"> *</span></div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span> <span class="comment"> * This function probably only makes sense for multimaps.</span></div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span> <span class="comment"> */</span></div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <a class="code" href="a06689.html">std::pair<iterator, iterator></a></div><div class="line"><a name="l01010"></a><span class="lineno"><a class="line" href="a06665.html#a5e0d4434a099805754b757634f18cc23"> 1010</a></span>  <a class="code" href="a06665.html#a5e0d4434a099805754b757634f18cc23">equal_range</a>(<span class="keyword">const</span> key_type& __x)</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  { <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  <span class="keyword">auto</span></div><div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="a06665.html#ae814e0a8ac259c3119c95716748f7819"> 1016</a></span>  <a class="code" href="a06665.html#ae814e0a8ac259c3119c95716748f7819">equal_range</a>(<span class="keyword">const</span> _Kt& __x)</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  -> decltype(<a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  { <span class="keywordflow">return</span> <a class="code" href="a06689.html">pair<iterator, iterator></a>(_M_t._M_equal_range_tr(__x)); }</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> <span class="comment"></span><span class="comment"></span></div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> <span class="comment"> //@{</span></div><div class="line"><a name="l01023"></a><span class="lineno"> 1023</span> <span class="comment"></span><span class="comment"> /**</span></div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span> <span class="comment"> * @brief Finds a subsequence matching given key.</span></div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span> <span class="comment"> * @param __x Key of (key, value) pairs to be located.</span></div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span> <span class="comment"> * @return Pair of read-only (constant) iterators that possibly points</span></div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span> <span class="comment"> * to the subsequence matching given key.</span></div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span> <span class="comment"> *</span></div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span> <span class="comment"> * This function is equivalent to</span></div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span> <span class="comment"> * @code</span></div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span> <span class="comment"> * std::make_pair(c.lower_bound(val),</span></div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span> <span class="comment"> * c.upper_bound(val))</span></div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span> <span class="comment"> * @endcode</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span> <span class="comment"> * (but is faster than making the calls separately).</span></div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> <span class="comment"> *</span></div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> <span class="comment"> * This function probably only makes sense for multimaps.</span></div><div class="line"><a name="l01037"></a><span class="lineno"> 1037</span> <span class="comment"> */</span></div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <a class="code" href="a06689.html">std::pair<const_iterator, const_iterator></a></div><div class="line"><a name="l01039"></a><span class="lineno"><a class="line" href="a06665.html#ad849929336a71e065e43fdf6a294140e"> 1039</a></span>  <a class="code" href="a06665.html#ad849929336a71e065e43fdf6a294140e">equal_range</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span></div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span> <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.equal_range(__x); }</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span> </div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span> <span class="preprocessor">#if __cplusplus > 201103L</span></div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Kt></div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keyword">auto</span></div><div class="line"><a name="l01045"></a><span class="lineno"><a class="line" href="a06665.html#a14e9a1f958274d603fe083a7b9f50558"> 1045</a></span>  <a class="code" href="a06665.html#a14e9a1f958274d603fe083a7b9f50558">equal_range</a>(<span class="keyword">const</span> _Kt& __x) <span class="keyword">const</span></div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  -> decltype(<a class="code" href="a06689.html">pair<const_iterator, const_iterator></a>(</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  _M_t._M_equal_range_tr(__x)))</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">return</span> <a class="code" href="a06689.html">pair<const_iterator, const_iterator></a>(</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  _M_t._M_equal_range_tr(__x));</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  }</div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span> <span class="comment"> //@}</span></div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span> <span class="comment"></span></div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _K1, <span class="keyword">typename</span> _T1, <span class="keyword">typename</span> _C1, <span class="keyword">typename</span> _A1></div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <a class="code" href="a01487.html#a2cc59dba70d0427b9e006411b37aee81">operator==</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map<_K1, _T1, _C1, _A1></a>&,</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_K1, _T1, _C1, _A1></a>&);</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span> </div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _K1, <span class="keyword">typename</span> _T1, <span class="keyword">typename</span> _C1, <span class="keyword">typename</span> _A1></div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  <span class="keyword">friend</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  operator<(const map<_K1, _T1, _C1, _A1>&,</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_K1, _T1, _C1, _A1></a>&);</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  };</div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="comment"></span></div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span> <span class="comment"> /**</span></div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span> <span class="comment"> * @brief Map equality comparison.</span></div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span> <span class="comment"> * @param __x A %map.</span></div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span> <span class="comment"> * @param __y A %map of the same type as @a x.</span></div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> <span class="comment"> * @return True iff the size and elements of the maps are equal.</span></div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span> <span class="comment"> *</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span> <span class="comment"> * This is an equivalence relation. It is linear in the size of the</span></div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span> <span class="comment"> * maps. Maps are considered equivalent if their sizes are equal,</span></div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span> <span class="comment"> * and if corresponding elements compare equal.</span></div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> <span class="comment"> */</span></div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01078"></a><span class="lineno"><a class="line" href="a01487.html#a2cc59dba70d0427b9e006411b37aee81"> 1078</a></span>  <a class="code" href="a01487.html#a2cc59dba70d0427b9e006411b37aee81">operator==</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  { <span class="keywordflow">return</span> __x._M_t == __y._M_t; }</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span> <span class="comment"></span></div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> <span class="comment"> /**</span></div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span> <span class="comment"> * @brief Map ordering relation.</span></div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span> <span class="comment"> * @param __x A %map.</span></div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span> <span class="comment"> * @param __y A %map of the same type as @a x.</span></div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> <span class="comment"> * @return True iff @a x is lexicographically less than @a y.</span></div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> <span class="comment"> *</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span> <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span></div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="comment"> * maps. The elements must be comparable with @c <.</span></div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span> <span class="comment"> *</span></div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span> <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span></div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span> <span class="comment"> */</span></div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01095"></a><span class="lineno"><a class="line" href="a01487.html#a3cbf6143f4ce61b7174408e06a4181f0"> 1095</a></span>  operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,</div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  { <span class="keywordflow">return</span> __x._M_t < __y._M_t; }</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span> <span class="comment"></span></div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span> <span class="comment"> /// Based on operator==</span></div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01102"></a><span class="lineno"><a class="line" href="a01487.html#a6b5d199f9e89bfca5738b76671a4118b"> 1102</a></span>  <a class="code" href="a01487.html#a6b5d199f9e89bfca5738b76671a4118b">operator!=</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  { <span class="keywordflow">return</span> !(__x == __y); }</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> <span class="comment"></span></div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01109"></a><span class="lineno"><a class="line" href="a01487.html#ac70654ce03713da520f19dc5a9a87edc"> 1109</a></span>  <a class="code" href="a01487.html#ac70654ce03713da520f19dc5a9a87edc">operator></a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  { <span class="keywordflow">return</span> __y < __x; }</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span> <span class="comment"></span></div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01116"></a><span class="lineno"><a class="line" href="a01487.html#a407132a3a46dfa53d8f1e7810ee5b54d"> 1116</a></span>  operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  { <span class="keywordflow">return</span> !(__y < __x); }</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span> <span class="comment"></span></div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span> <span class="comment"> /// Based on operator<</span></div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span></div><div class="line"><a name="l01123"></a><span class="lineno"><a class="line" href="a01487.html#a03f03b3697da916e95a09b1488df52df"> 1123</a></span>  <a class="code" href="a01487.html#a03f03b3697da916e95a09b1488df52df">operator>=</a>(<span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">const</span> <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  { <span class="keywordflow">return</span> !(__x < __y); }</div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span> <span class="comment"></span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span> <span class="comment"> /// See std::map::swap().</span></div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span> <span class="comment"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Tp, <span class="keyword">typename</span> _Compare, <span class="keyword">typename</span> _Alloc></div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span></div><div class="line"><a name="l01130"></a><span class="lineno"><a class="line" href="a01487.html#a82f605b142b76f103be8de2300ad0268"> 1130</a></span>  <a class="code" href="a06665.html#a49c39598750cfbe89abeeb5c314330b9">swap</a>(<a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __x,</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <a class="code" href="a06665.html">map<_Key, _Tp, _Compare, _Alloc></a>& __y)</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  { __x.<a class="code" href="a06665.html#a49c39598750cfbe89abeeb5c314330b9">swap</a>(__y); }</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> </div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span> _GLIBCXX_END_NAMESPACE_CONTAINER</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> } <span class="comment">// namespace std</span></div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> </div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> <span class="preprocessor">#endif </span><span class="comment">/* _STL_MAP_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a06665_html_a461fb30e5fd8953549843ff651d06ec8"><div class="ttname"><a href="a06665.html#a461fb30e5fd8953549843ff651d06ec8">std::map::rbegin</a></div><div class="ttdeci">const_reverse_iterator rbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00384">stl_map.h:384</a></div></div>
<div class="ttc" id="a06665_html_a4ca3db2d238641b23001310899d884fb"><div class="ttname"><a href="a06665.html#a4ca3db2d238641b23001310899d884fb">std::map::rbegin</a></div><div class="ttdeci">reverse_iterator rbegin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00375">stl_map.h:375</a></div></div>
<div class="ttc" id="a06665_html_a97d93d27671323c77e27ef2986a4bcb8"><div class="ttname"><a href="a06665.html#a97d93d27671323c77e27ef2986a4bcb8">std::map::map</a></div><div class="ttdeci">map(const allocator_type &__a)</div><div class="ttdoc">Allocator-extended default constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00220">stl_map.h:220</a></div></div>
<div class="ttc" id="a06665_html_ad849929336a71e065e43fdf6a294140e"><div class="ttname"><a href="a06665.html#ad849929336a71e065e43fdf6a294140e">std::map::equal_range</a></div><div class="ttdeci">std::pair< const_iterator, const_iterator > equal_range(const key_type &__x) const</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01039">stl_map.h:1039</a></div></div>
<div class="ttc" id="a06665_html_a59af09cf176afb26d8e2657581429d3f"><div class="ttname"><a href="a06665.html#a59af09cf176afb26d8e2657581429d3f">std::map::key_comp</a></div><div class="ttdeci">key_compare key_comp() const</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00819">stl_map.h:819</a></div></div>
<div class="ttc" id="a06665_html_ac4ef9122b867bba653d56f9abde9f101"><div class="ttname"><a href="a06665.html#ac4ef9122b867bba653d56f9abde9f101">std::map::map</a></div><div class="ttdeci">map() noexcept(is_nothrow_default_constructible< allocator_type >::value &&is_nothrow_default_constructible< key_compare >::value)</div><div class="ttdoc">Default constructor creates no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00162">stl_map.h:162</a></div></div>
<div class="ttc" id="a06665_html_ab8dd27409135bbee5bb626cd72e0cddb"><div class="ttname"><a href="a06665.html#ab8dd27409135bbee5bb626cd72e0cddb">std::map::size</a></div><div class="ttdeci">size_type size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00453">stl_map.h:453</a></div></div>
<div class="ttc" id="a06665_html_a14e9a1f958274d603fe083a7b9f50558"><div class="ttname"><a href="a06665.html#a14e9a1f958274d603fe083a7b9f50558">std::map::equal_range</a></div><div class="ttdeci">auto equal_range(const _Kt &__x) const -> decltype(pair< const_iterator, const_iterator >(_M_t._M_equal_range_tr(__x)))</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01045">stl_map.h:1045</a></div></div>
<div class="ttc" id="a06665_html_adc72d6a2972834a9f512d424310468a7"><div class="ttname"><a href="a06665.html#adc72d6a2972834a9f512d424310468a7">std::map::get_allocator</a></div><div class="ttdeci">allocator_type get_allocator() const noexcept</div><div class="ttdoc">Get a copy of the memory allocation object. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00329">stl_map.h:329</a></div></div>
<div class="ttc" id="a06665_html_a58dfea28ca363de5083ec265382de319"><div class="ttname"><a href="a06665.html#a58dfea28ca363de5083ec265382de319">std::map::upper_bound</a></div><div class="ttdeci">auto upper_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00967">stl_map.h:967</a></div></div>
<div class="ttc" id="a01487_html_a6b5d199f9e89bfca5738b76671a4118b"><div class="ttname"><a href="a01487.html#a6b5d199f9e89bfca5738b76671a4118b">std::operator!=</a></div><div class="ttdeci">bool operator!=(const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)</div><div class="ttdoc">Based on operator==. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01102">stl_map.h:1102</a></div></div>
<div class="ttc" id="a01487_html_a03f03b3697da916e95a09b1488df52df"><div class="ttname"><a href="a01487.html#a03f03b3697da916e95a09b1488df52df">std::operator>=</a></div><div class="ttdeci">bool operator>=(const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)</div><div class="ttdoc">Based on operator<. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01123">stl_map.h:1123</a></div></div>
<div class="ttc" id="a00023_html"><div class="ttname"><a href="a00023.html">initializer_list</a></div></div>
<div class="ttc" id="a06665_html_aa98a4bd34df51b51262b26f06a657efe"><div class="ttname"><a href="a06665.html#aa98a4bd34df51b51262b26f06a657efe">std::map::erase</a></div><div class="ttdeci">iterator erase(const_iterator __first, const_iterator __last)</div><div class="ttdoc">Erases a [first,last) range of elements from a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00765">stl_map.h:765</a></div></div>
<div class="ttc" id="a06665_html_ae814e0a8ac259c3119c95716748f7819"><div class="ttname"><a href="a06665.html#ae814e0a8ac259c3119c95716748f7819">std::map::equal_range</a></div><div class="ttdeci">auto equal_range(const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01016">stl_map.h:1016</a></div></div>
<div class="ttc" id="a06665_html_a16986a6517197b25e8ad3f7487c8536f"><div class="ttname"><a href="a06665.html#a16986a6517197b25e8ad3f7487c8536f">std::map::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00448">stl_map.h:448</a></div></div>
<div class="ttc" id="a06665_html_aaf4942bb42ef39ce49cc232c06416f55"><div class="ttname"><a href="a06665.html#aaf4942bb42ef39ce49cc232c06416f55">std::map::at</a></div><div class="ttdeci">mapped_type & at(const key_type &__k)</div><div class="ttdoc">Access to map data. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00520">stl_map.h:520</a></div></div>
<div class="ttc" id="a06665_html_abd9ce0ad35c587805de6a54c3e61cd02"><div class="ttname"><a href="a06665.html#abd9ce0ad35c587805de6a54c3e61cd02">std::map::upper_bound</a></div><div class="ttdeci">auto upper_bound(const _Kt &__x) const -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x)))</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00987">stl_map.h:987</a></div></div>
<div class="ttc" id="a01601_html"><div class="ttname"><a href="a01601.html">std::initializer_list</a></div><div class="ttdoc">initializer_list </div><div class="ttdef"><b>Definition:</b> <a href="a00023_source.html#l00047">initializer_list:47</a></div></div>
<div class="ttc" id="a06665_html_a3a5341d2ce3f2ffa4426d29110ca8e41"><div class="ttname"><a href="a06665.html#a3a5341d2ce3f2ffa4426d29110ca8e41">std::map::insert</a></div><div class="ttdeci">std::pair< iterator, bool > insert(const value_type &__x)</div><div class="ttdoc">Attempts to insert a std::pair into the map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00613">stl_map.h:613</a></div></div>
<div class="ttc" id="a06665_html_a50d3bee624167086813c84cc5fbc0f8f"><div class="ttname"><a href="a06665.html#a50d3bee624167086813c84cc5fbc0f8f">std::map::end</a></div><div class="ttdeci">const_iterator end() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00366">stl_map.h:366</a></div></div>
<div class="ttc" id="a00155_html"><div class="ttname"><a href="a00155.html">tuple</a></div></div>
<div class="ttc" id="a06665_html_afc93fe1a99a328079339b2e154c618d8"><div class="ttname"><a href="a06665.html#afc93fe1a99a328079339b2e154c618d8">std::map::operator=</a></div><div class="ttdeci">map & operator=(const map &__x)</div><div class="ttdoc">Map assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00297">stl_map.h:297</a></div></div>
<div class="ttc" id="a06665_html_ab228710aaa8c81fc3b7fe37b26fc709a"><div class="ttname"><a href="a06665.html#ab228710aaa8c81fc3b7fe37b26fc709a">std::map::insert</a></div><div class="ttdeci">void insert(std::initializer_list< value_type > __list)</div><div class="ttdoc">Attempts to insert a list of std::pairs into the map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00634">stl_map.h:634</a></div></div>
<div class="ttc" id="a06665_html_a01e3c11364a0f9f6304581d1dc69bd34"><div class="ttname"><a href="a06665.html#a01e3c11364a0f9f6304581d1dc69bd34">std::map::emplace_hint</a></div><div class="ttdeci">iterator emplace_hint(const_iterator __pos, _Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00589">stl_map.h:589</a></div></div>
<div class="ttc" id="a06665_html_af2c022c3b246d7beb4c6eae4d6ce7ca2"><div class="ttname"><a href="a06665.html#af2c022c3b246d7beb4c6eae4d6ce7ca2">std::map::max_size</a></div><div class="ttdeci">size_type max_size() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00458">stl_map.h:458</a></div></div>
<div class="ttc" id="a06665_html_a07cdb0ebaf753ec1244849dbff2ec4cf"><div class="ttname"><a href="a06665.html#a07cdb0ebaf753ec1244849dbff2ec4cf">std::map::find</a></div><div class="ttdeci">const_iterator find(const key_type &__x) const</div><div class="ttdoc">Tries to locate an element in a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00871">stl_map.h:871</a></div></div>
<div class="ttc" id="a06665_html_af11167910bc728cbeb7997b7e8bd8326"><div class="ttname"><a href="a06665.html#af11167910bc728cbeb7997b7e8bd8326">std::map::cbegin</a></div><div class="ttdeci">const_iterator cbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00412">stl_map.h:412</a></div></div>
<div class="ttc" id="a06665_html_a21512c1e39cedc32e0275f89f888d4aa"><div class="ttname"><a href="a06665.html#a21512c1e39cedc32e0275f89f888d4aa">std::map::rend</a></div><div class="ttdeci">const_reverse_iterator rend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00402">stl_map.h:402</a></div></div>
<div class="ttc" id="a06665_html_a512508ab8aef5dad73ae92751513769e"><div class="ttname"><a href="a06665.html#a512508ab8aef5dad73ae92751513769e">std::map::cend</a></div><div class="ttdeci">const_iterator cend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00421">stl_map.h:421</a></div></div>
<div class="ttc" id="a06665_html_a4a4a9f95131baf0713596d672ec36b5f"><div class="ttname"><a href="a06665.html#a4a4a9f95131baf0713596d672ec36b5f">std::map::operator[]</a></div><div class="ttdeci">mapped_type & operator[](const key_type &__k)</div><div class="ttdoc">Subscript ( [] ) access to map data. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00475">stl_map.h:475</a></div></div>
<div class="ttc" id="a06665_html_a824e4206f6a5018174457ce8d46e9402"><div class="ttname"><a href="a06665.html#a824e4206f6a5018174457ce8d46e9402">std::map::map</a></div><div class="ttdeci">map(const map &__x)</div><div class="ttdoc">Map copy constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00186">stl_map.h:186</a></div></div>
<div class="ttc" id="a06665_html_af515aec447786d3fcfff02fe18385cbc"><div class="ttname"><a href="a06665.html#af515aec447786d3fcfff02fe18385cbc">std::map::begin</a></div><div class="ttdeci">iterator begin() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00339">stl_map.h:339</a></div></div>
<div class="ttc" id="a06665_html_a1264d32ee2fd0cfaee914fbafc088b54"><div class="ttname"><a href="a06665.html#a1264d32ee2fd0cfaee914fbafc088b54">std::map::count</a></div><div class="ttdeci">auto count(const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))</div><div class="ttdoc">Finds the number of elements with given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00898">stl_map.h:898</a></div></div>
<div class="ttc" id="a08925_html"><div class="ttname"><a href="a08925.html">__gnu_cxx::__alloc_traits</a></div><div class="ttdoc">Uniform interface to C++98 and C++0x allocators. </div><div class="ttdef"><b>Definition:</b> <a href="a14749_source.html#l00095">ext/alloc_traits.h:95</a></div></div>
<div class="ttc" id="a06665_html_a5db81ee7912a625e5d7ead27f0cb4133"><div class="ttname"><a href="a06665.html#a5db81ee7912a625e5d7ead27f0cb4133">std::map::lower_bound</a></div><div class="ttdeci">auto lower_bound(const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00922">stl_map.h:922</a></div></div>
<div class="ttc" id="a06665_html_a49c39598750cfbe89abeeb5c314330b9"><div class="ttname"><a href="a06665.html#a49c39598750cfbe89abeeb5c314330b9">std::map::swap</a></div><div class="ttdeci">void swap(map &__x) noexcept(_Alloc_traits::_S_nothrow_swap())</div><div class="ttdoc">Swaps data with another map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00797">stl_map.h:797</a></div></div>
<div class="ttc" id="a06665_html_a95c130beb22f45766110a5b734a5b7a6"><div class="ttname"><a href="a06665.html#a95c130beb22f45766110a5b734a5b7a6">std::map::map</a></div><div class="ttdeci">map(map &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())</div><div class="ttdoc">Allocator-extended move constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00228">stl_map.h:228</a></div></div>
<div class="ttc" id="a01487_html"><div class="ttname"><a href="a01487.html">std</a></div><div class="ttdoc">ISO C++ entities toplevel namespace is std. </div></div>
<div class="ttc" id="a06665_html_ae74f7651afbcb8b1c2d491a7145f3313"><div class="ttname"><a href="a06665.html#ae74f7651afbcb8b1c2d491a7145f3313">std::map::map</a></div><div class="ttdeci">map(const map &__m, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended copy constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00224">stl_map.h:224</a></div></div>
<div class="ttc" id="a06665_html_a31f6ba9ed7f80198dd444d6d830a3c80"><div class="ttname"><a href="a06665.html#a31f6ba9ed7f80198dd444d6d830a3c80">std::map::upper_bound</a></div><div class="ttdeci">iterator upper_bound(const key_type &__x)</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00961">stl_map.h:961</a></div></div>
<div class="ttc" id="a06569_html"><div class="ttname"><a href="a06569.html">std::reverse_iterator</a></div><div class="ttdef"><b>Definition:</b> <a href="a00503_source.html#l00097">stl_iterator.h:97</a></div></div>
<div class="ttc" id="a00332_html"><div class="ttname"><a href="a00332.html">functexcept.h</a></div></div>
<div class="ttc" id="a06665_html_a39303b5617b240f3049dbb0d195789f5"><div class="ttname"><a href="a06665.html#a39303b5617b240f3049dbb0d195789f5">std::map::find</a></div><div class="ttdeci">auto find(const _Kt &__x) -> decltype(_M_t._M_find_tr(__x))</div><div class="ttdoc">Tries to locate an element in a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00852">stl_map.h:852</a></div></div>
<div class="ttc" id="a06665_html_a6339535802f1937f3dd78ee04d950ea7"><div class="ttname"><a href="a06665.html#a6339535802f1937f3dd78ee04d950ea7">std::map::map</a></div><div class="ttdeci">map(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Builds a map from a range. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00257">stl_map.h:257</a></div></div>
<div class="ttc" id="a03329_html"><div class="ttname"><a href="a03329.html">std::tuple</a></div><div class="ttdoc">Primary class template, tuple. </div><div class="ttdef"><b>Definition:</b> <a href="a00155_source.html#l00463">tuple:463</a></div></div>
<div class="ttc" id="a06665_html_ab801bf5b252cc1b28af052263ce33d7a"><div class="ttname"><a href="a06665.html#ab801bf5b252cc1b28af052263ce33d7a">std::map::lower_bound</a></div><div class="ttdeci">const_iterator lower_bound(const key_type &__x) const</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00941">stl_map.h:941</a></div></div>
<div class="ttc" id="a06665_html_a6b510fc380b070d899d73a278cbb8faf"><div class="ttname"><a href="a06665.html#a6b510fc380b070d899d73a278cbb8faf">std::map::erase</a></div><div class="ttdeci">size_type erase(const key_type &__x)</div><div class="ttdoc">Erases elements according to the provided key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00745">stl_map.h:745</a></div></div>
<div class="ttc" id="a06665_html_a0d2b5c52350b2b79506ab308b32ca5f1"><div class="ttname"><a href="a06665.html#a0d2b5c52350b2b79506ab308b32ca5f1">std::map::map</a></div><div class="ttdeci">map(_InputIterator __first, _InputIterator __last, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended range constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00240">stl_map.h:240</a></div></div>
<div class="ttc" id="a06665_html_ac01f44f3ed4b9dbebcb046b4103f920c"><div class="ttname"><a href="a06665.html#ac01f44f3ed4b9dbebcb046b4103f920c">std::map::operator=</a></div><div class="ttdeci">map & operator=(initializer_list< value_type > __l)</div><div class="ttdoc">Map list assignment operator. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00320">stl_map.h:320</a></div></div>
<div class="ttc" id="a06665_html_aa0d825fbc11a62dc06420646e0c90dd5"><div class="ttname"><a href="a06665.html#aa0d825fbc11a62dc06420646e0c90dd5">std::map::insert</a></div><div class="ttdeci">iterator insert(const_iterator __position, const value_type &__x)</div><div class="ttdoc">Attempts to insert a std::pair into the map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00663">stl_map.h:663</a></div></div>
<div class="ttc" id="a06665_html_a353d38055f6c80e99c699ee4eeec914e"><div class="ttname"><a href="a06665.html#a353d38055f6c80e99c699ee4eeec914e">std::map::map</a></div><div class="ttdeci">map(initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a map from an initializer_list. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00212">stl_map.h:212</a></div></div>
<div class="ttc" id="a01431_html_ga9251cc200339814c062d2bda48994255"><div class="ttname"><a href="a01431.html#ga9251cc200339814c062d2bda48994255">std::piecewise_construct</a></div><div class="ttdeci">constexpr piecewise_construct_t piecewise_construct</div><div class="ttdoc">piecewise_construct </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00079">stl_pair.h:79</a></div></div>
<div class="ttc" id="a06689_html"><div class="ttname"><a href="a06689.html">std::pair</a></div><div class="ttdoc">Struct holding two objects of arbitrary type. </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00096">stl_pair.h:96</a></div></div>
<div class="ttc" id="a06665_html_afd9ba5f5b31a79317b1c5ec547b9ec6c"><div class="ttname"><a href="a06665.html#afd9ba5f5b31a79317b1c5ec547b9ec6c">std::map::upper_bound</a></div><div class="ttdeci">const_iterator upper_bound(const key_type &__x) const</div><div class="ttdoc">Finds the end of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00981">stl_map.h:981</a></div></div>
<div class="ttc" id="a06665_html_ac30882bd54277810ace3d0630cbc3252"><div class="ttname"><a href="a06665.html#ac30882bd54277810ace3d0630cbc3252">std::map::map</a></div><div class="ttdeci">map(_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Builds a map from a range. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00274">stl_map.h:274</a></div></div>
<div class="ttc" id="a06665_html"><div class="ttname"><a href="a06665.html">std::map</a></div><div class="ttdoc">A standard container made up of (key,value) pairs, which can be retrieved based on a key...</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00096">stl_map.h:96</a></div></div>
<div class="ttc" id="a06665_html_a8310f2293e381afba51e9cc44dd0eeef"><div class="ttname"><a href="a06665.html#a8310f2293e381afba51e9cc44dd0eeef">std::map::map</a></div><div class="ttdeci">map(initializer_list< value_type > __l, const allocator_type &__a)</div><div class="ttdoc">Allocator-extended initialier-list constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00234">stl_map.h:234</a></div></div>
<div class="ttc" id="a06353_html"><div class="ttname"><a href="a06353.html">std::binary_function</a></div><div class="ttdef"><b>Definition:</b> <a href="a00497_source.html#l00118">stl_function.h:118</a></div></div>
<div class="ttc" id="a06665_html_a5e0d4434a099805754b757634f18cc23"><div class="ttname"><a href="a06665.html#a5e0d4434a099805754b757634f18cc23">std::map::equal_range</a></div><div class="ttdeci">std::pair< iterator, iterator > equal_range(const key_type &__x)</div><div class="ttdoc">Finds a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01010">stl_map.h:1010</a></div></div>
<div class="ttc" id="a06665_html_af46ca23264de805bde6259ab11c9d93c"><div class="ttname"><a href="a06665.html#af46ca23264de805bde6259ab11c9d93c">std::map::begin</a></div><div class="ttdeci">const_iterator begin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00348">stl_map.h:348</a></div></div>
<div class="ttc" id="a06665_html_adbb7e90f8d6bece7f9ffb6b76c9ab081"><div class="ttname"><a href="a06665.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">std::map::lower_bound</a></div><div class="ttdeci">iterator lower_bound(const key_type &__x)</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00916">stl_map.h:916</a></div></div>
<div class="ttc" id="a01487_html_ac70654ce03713da520f19dc5a9a87edc"><div class="ttname"><a href="a01487.html#ac70654ce03713da520f19dc5a9a87edc">std::operator></a></div><div class="ttdeci">bool operator>(const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)</div><div class="ttdoc">Based on operator<. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01109">stl_map.h:1109</a></div></div>
<div class="ttc" id="a06665_html_a68296cab04aadacb8da0b4bb1a8d8991"><div class="ttname"><a href="a06665.html#a68296cab04aadacb8da0b4bb1a8d8991">std::map::crbegin</a></div><div class="ttdeci">const_reverse_iterator crbegin() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00430">stl_map.h:430</a></div></div>
<div class="ttc" id="a06665_html_a902da50a674926aa1153fd710bfc9e7c"><div class="ttname"><a href="a06665.html#a902da50a674926aa1153fd710bfc9e7c">std::map::map</a></div><div class="ttdeci">map(map &&__x) noexcept(is_nothrow_copy_constructible< _Compare >::value)</div><div class="ttdoc">Map move constructor. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00197">stl_map.h:197</a></div></div>
<div class="ttc" id="a06665_html_adbdeb769358f26cc1f0124f5c53df0eb"><div class="ttname"><a href="a06665.html#adbdeb769358f26cc1f0124f5c53df0eb">std::map::emplace</a></div><div class="ttdeci">std::pair< iterator, bool > emplace(_Args &&... __args)</div><div class="ttdoc">Attempts to build and insert a std::pair into the map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00559">stl_map.h:559</a></div></div>
<div class="ttc" id="a01487_html_a2cc59dba70d0427b9e006411b37aee81"><div class="ttname"><a href="a01487.html#a2cc59dba70d0427b9e006411b37aee81">std::operator==</a></div><div class="ttdeci">bool operator==(const map< _Key, _Tp, _Compare, _Alloc > &__x, const map< _Key, _Tp, _Compare, _Alloc > &__y)</div><div class="ttdoc">Map equality comparison. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l01078">stl_map.h:1078</a></div></div>
<div class="ttc" id="a06665_html_a5dfaf89a89106d147fd055c313a291ee"><div class="ttname"><a href="a06665.html#a5dfaf89a89106d147fd055c313a291ee">std::map::end</a></div><div class="ttdeci">iterator end() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00357">stl_map.h:357</a></div></div>
<div class="ttc" id="a06665_html_aa467231586b6bc6388765ec6802aef54"><div class="ttname"><a href="a06665.html#aa467231586b6bc6388765ec6802aef54">std::map::rend</a></div><div class="ttdeci">reverse_iterator rend() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00393">stl_map.h:393</a></div></div>
<div class="ttc" id="a06665_html_ac9ea51e48199ff9a87ea1b855789e53d"><div class="ttname"><a href="a06665.html#ac9ea51e48199ff9a87ea1b855789e53d">std::map::erase</a></div><div class="ttdeci">iterator erase(const_iterator __position)</div><div class="ttdoc">Erases an element from a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00709">stl_map.h:709</a></div></div>
<div class="ttc" id="a06665_html_a2dfc6f822052135a0b48e0dca314ccaf"><div class="ttname"><a href="a06665.html#a2dfc6f822052135a0b48e0dca314ccaf">std::map::lower_bound</a></div><div class="ttdeci">auto lower_bound(const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))</div><div class="ttdoc">Finds the beginning of a subsequence matching given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00947">stl_map.h:947</a></div></div>
<div class="ttc" id="a06665_html_a5c72b2772d31bff52f9454a583547f58"><div class="ttname"><a href="a06665.html#a5c72b2772d31bff52f9454a583547f58">std::map::clear</a></div><div class="ttdeci">void clear() noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00810">stl_map.h:810</a></div></div>
<div class="ttc" id="a06665_html_adbd5c263f187f16ca9f073e1789a02ff"><div class="ttname"><a href="a06665.html#adbd5c263f187f16ca9f073e1789a02ff">std::map::crend</a></div><div class="ttdeci">const_reverse_iterator crend() const noexcept</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00439">stl_map.h:439</a></div></div>
<div class="ttc" id="a06665_html_accf5f3477b6615f6b31fcb1adf068dfc"><div class="ttname"><a href="a06665.html#accf5f3477b6615f6b31fcb1adf068dfc">std::map::find</a></div><div class="ttdeci">auto find(const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x))</div><div class="ttdoc">Tries to locate an element in a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00877">stl_map.h:877</a></div></div>
<div class="ttc" id="a06665_html_a2c51f439c6328b72ebdd7e5e558ef847"><div class="ttname"><a href="a06665.html#a2c51f439c6328b72ebdd7e5e558ef847">std::map::value_comp</a></div><div class="ttdeci">value_compare value_comp() const</div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00827">stl_map.h:827</a></div></div>
<div class="ttc" id="a06665_html_aa12fa7df574ac42da454cba7581c258e"><div class="ttname"><a href="a06665.html#aa12fa7df574ac42da454cba7581c258e">std::map::map</a></div><div class="ttdeci">map(const _Compare &__comp, const allocator_type &__a=allocator_type())</div><div class="ttdoc">Creates a map with no elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00175">stl_map.h:175</a></div></div>
<div class="ttc" id="a00302_html"><div class="ttname"><a href="a00302.html">concept_check.h</a></div></div>
<div class="ttc" id="a06689_html_a198b03cffc037835dc1dc01c926ce251"><div class="ttname"><a href="a06689.html#a198b03cffc037835dc1dc01c926ce251">std::pair::first</a></div><div class="ttdeci">_T1 first</div><div class="ttdoc">second_type is the second bound type </div><div class="ttdef"><b>Definition:</b> <a href="a00527_source.html#l00101">stl_pair.h:101</a></div></div>
<div class="ttc" id="a06665_html_a3186e7576e4ffc474fd92f66e460d231"><div class="ttname"><a href="a06665.html#a3186e7576e4ffc474fd92f66e460d231">std::map::insert</a></div><div class="ttdeci">void insert(_InputIterator __first, _InputIterator __last)</div><div class="ttdoc">Template function that attempts to insert a range of elements. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00689">stl_map.h:689</a></div></div>
<div class="ttc" id="a06665_html_abdcd985632d8ad7ddba069aa776e2dfe"><div class="ttname"><a href="a06665.html#abdcd985632d8ad7ddba069aa776e2dfe">std::map::find</a></div><div class="ttdeci">iterator find(const key_type &__x)</div><div class="ttdoc">Tries to locate an element in a map. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00846">stl_map.h:846</a></div></div>
<div class="ttc" id="a06665_html_a44da6d0dc51d80a873cc9405a805c712"><div class="ttname"><a href="a06665.html#a44da6d0dc51d80a873cc9405a805c712">std::map::count</a></div><div class="ttdeci">size_type count(const key_type &__x) const</div><div class="ttdoc">Finds the number of elements with given key. </div><div class="ttdef"><b>Definition:</b> <a href="a00515_source.html#l00892">stl_map.h:892</a></div></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_599c955538774c0249d4ddd97c0a9ae8.html">bits</a></li><li class="navelem"><a class="el" href="a00515.html">stl_map.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li>
</ul>
</div>
</body>
</html>
