<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>libstdc++: stl_map.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">libstdc++</div>
</td>
</tr>
</tbody>
</table>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('a01056.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">stl_map.h</div> </div>
</div>
<div class="contents">
<a href="a01056.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// Map implementation -*- C++ -*-</span>
<a name="l00002"></a>00002
<a name="l00003"></a>00003 <span class="comment">// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010,</span>
<a name="l00004"></a>00004 <span class="comment">// 2011 Free Software Foundation, Inc.</span>
<a name="l00005"></a>00005 <span class="comment">//</span>
<a name="l00006"></a>00006 <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span>
<a name="l00007"></a>00007 <span class="comment">// software; you can redistribute it and/or modify it under the</span>
<a name="l00008"></a>00008 <span class="comment">// terms of the GNU General Public License as published by the</span>
<a name="l00009"></a>00009 <span class="comment">// Free Software Foundation; either version 3, or (at your option)</span>
<a name="l00010"></a>00010 <span class="comment">// any later version.</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="comment">// This library is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment">// but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00015"></a>00015 <span class="comment">// GNU General Public License for more details.</span>
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span>
<a name="l00018"></a>00018 <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span>
<a name="l00019"></a>00019 <span class="comment">// 3.1, as published by the Free Software Foundation.</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="comment">// You should have received a copy of the GNU General Public License and</span>
<a name="l00022"></a>00022 <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span>
<a name="l00023"></a>00023 <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span>
<a name="l00024"></a>00024 <span class="comment">// <http://www.gnu.org/licenses/>.</span>
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="comment">/*</span>
<a name="l00027"></a>00027 <span class="comment"> *</span>
<a name="l00028"></a>00028 <span class="comment"> * Copyright (c) 1994</span>
<a name="l00029"></a>00029 <span class="comment"> * Hewlett-Packard Company</span>
<a name="l00030"></a>00030 <span class="comment"> *</span>
<a name="l00031"></a>00031 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00032"></a>00032 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00033"></a>00033 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00034"></a>00034 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00035"></a>00035 <span class="comment"> * in supporting documentation. Hewlett-Packard Company makes no</span>
<a name="l00036"></a>00036 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00037"></a>00037 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00038"></a>00038 <span class="comment"> *</span>
<a name="l00039"></a>00039 <span class="comment"> *</span>
<a name="l00040"></a>00040 <span class="comment"> * Copyright (c) 1996,1997</span>
<a name="l00041"></a>00041 <span class="comment"> * Silicon Graphics Computer Systems, Inc.</span>
<a name="l00042"></a>00042 <span class="comment"> *</span>
<a name="l00043"></a>00043 <span class="comment"> * Permission to use, copy, modify, distribute and sell this software</span>
<a name="l00044"></a>00044 <span class="comment"> * and its documentation for any purpose is hereby granted without fee,</span>
<a name="l00045"></a>00045 <span class="comment"> * provided that the above copyright notice appear in all copies and</span>
<a name="l00046"></a>00046 <span class="comment"> * that both that copyright notice and this permission notice appear</span>
<a name="l00047"></a>00047 <span class="comment"> * in supporting documentation. Silicon Graphics makes no</span>
<a name="l00048"></a>00048 <span class="comment"> * representations about the suitability of this software for any</span>
<a name="l00049"></a>00049 <span class="comment"> * purpose. It is provided "as is" without express or implied warranty.</span>
<a name="l00050"></a>00050 <span class="comment"> */</span>
<a name="l00051"></a>00051 <span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment">/** @file bits/stl_map.h</span>
<a name="l00053"></a>00053 <span class="comment"> * This is an internal header file, included by other library headers.</span>
<a name="l00054"></a>00054 <span class="comment"> * Do not attempt to use it directly. @headername{map}</span>
<a name="l00055"></a>00055 <span class="comment"> */</span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="preprocessor">#ifndef _STL_MAP_H</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span><span class="preprocessor">#define _STL_MAP_H 1</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span>
<a name="l00060"></a>00060 <span class="preprocessor">#include <<a class="code" href="a00883.html">bits/functexcept.h</a>></span>
<a name="l00061"></a>00061 <span class="preprocessor">#include <<a class="code" href="a00815.html">bits/concept_check.h</a>></span>
<a name="l00062"></a>00062 <span class="preprocessor">#include <<a class="code" href="a00906.html">initializer_list</a>></span>
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">namespace </span>std _GLIBCXX_VISIBILITY(default)
<a name="l00065"></a>00065 {
<a name="l00066"></a>00066 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
<a name="l00067"></a>00067 <span class="comment"></span>
<a name="l00068"></a>00068 <span class="comment"> /**</span>
<a name="l00069"></a>00069 <span class="comment"> * @brief A standard container made up of (key,value) pairs, which can be</span>
<a name="l00070"></a>00070 <span class="comment"> * retrieved based on a key, in logarithmic time.</span>
<a name="l00071"></a>00071 <span class="comment"> *</span>
<a name="l00072"></a>00072 <span class="comment"> * @ingroup associative_containers</span>
<a name="l00073"></a>00073 <span class="comment"> *</span>
<a name="l00074"></a>00074 <span class="comment"> * Meets the requirements of a <a href="tables.html#65">container</a>, a</span>
<a name="l00075"></a>00075 <span class="comment"> * <a href="tables.html#66">reversible container</a>, and an</span>
<a name="l00076"></a>00076 <span class="comment"> * <a href="tables.html#69">associative container</a> (using unique keys).</span>
<a name="l00077"></a>00077 <span class="comment"> * For a @c map<Key,T> the key_type is Key, the mapped_type is T, and the</span>
<a name="l00078"></a>00078 <span class="comment"> * value_type is std::pair<const Key,T>.</span>
<a name="l00079"></a>00079 <span class="comment"> *</span>
<a name="l00080"></a>00080 <span class="comment"> * Maps support bidirectional iterators.</span>
<a name="l00081"></a>00081 <span class="comment"> *</span>
<a name="l00082"></a>00082 <span class="comment"> * The private tree data is declared exactly the same way for map and</span>
<a name="l00083"></a>00083 <span class="comment"> * multimap; the distinction is made entirely in how the tree functions are</span>
<a name="l00084"></a>00084 <span class="comment"> * called (*_unique versus *_equal, same as the standard).</span>
<a name="l00085"></a>00085 <span class="comment"> */</span>
<a name="l00086"></a>00086 <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>,
<a name="l00087"></a>00087 <span class="keyword">typename</span> _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
<a name="l00088"></a><a class="code" href="a00593.html">00088</a> <span class="keyword">class </span><a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>
<a name="l00089"></a>00089 {
<a name="l00090"></a>00090 <span class="keyword">public</span>:
<a name="l00091"></a>00091 <span class="keyword">typedef</span> _Key key_type;
<a name="l00092"></a>00092 <span class="keyword">typedef</span> _Tp mapped_type;
<a name="l00093"></a>00093 <span class="keyword">typedef</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<const _Key, _Tp></a> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>;
<a name="l00094"></a>00094 <span class="keyword">typedef</span> _Compare key_compare;
<a name="l00095"></a>00095 <span class="keyword">typedef</span> _Alloc allocator_type;
<a name="l00096"></a>00096
<a name="l00097"></a>00097 <span class="keyword">private</span>:
<a name="l00098"></a>00098 <span class="comment">// concept requirements</span>
<a name="l00099"></a>00099 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::value_type _Alloc_value_type;
<a name="l00100"></a>00100 __glibcxx_class_requires(_Tp, _SGIAssignableConcept)
<a name="l00101"></a>00101 __glibcxx_class_requires4(_Compare, <span class="keywordtype">bool</span>, _Key, _Key,
<a name="l00102"></a>00102 _BinaryFunctionConcept)
<a name="l00103"></a>00103 __glibcxx_class_requires2(<a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>, _Alloc_value_type, _SameTypeConcept)
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="keyword">public</span>:
<a name="l00106"></a>00106 <span class="keyword">class </span>value_compare
<a name="l00107"></a>00107 : <span class="keyword">public</span> std::<a class="code" href="a00254.html">binary_function</a><value_type, value_type, bool>
<a name="l00108"></a>00108 {
<a name="l00109"></a>00109 <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a><_Key, _Tp, _Compare, _Alloc>;
<a name="l00110"></a>00110 <span class="keyword">protected</span>:
<a name="l00111"></a>00111 _Compare comp;
<a name="l00112"></a>00112
<a name="l00113"></a>00113 value_compare(_Compare __c)
<a name="l00114"></a>00114 : comp(__c) { }
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="keyword">public</span>:
<a name="l00117"></a>00117 <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __x, <span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __y)<span class="keyword"> const</span>
<a name="l00118"></a>00118 <span class="keyword"> </span>{ <span class="keywordflow">return</span> comp(__x.<a class="code" href="a00263.html#a198b03cffc037835dc1dc01c926ce251" title="second_type is the second bound type">first</a>, __y.<a class="code" href="a00263.html#a198b03cffc037835dc1dc01c926ce251" title="second_type is the second bound type">first</a>); }
<a name="l00119"></a>00119 };
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keyword">private</span>:<span class="comment"></span>
<a name="l00122"></a>00122 <span class="comment"> /// This turns a red-black tree into a [multi]map. </span>
<a name="l00123"></a>00123 <span class="comment"></span> <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind<value_type>::other
<a name="l00124"></a>00124 _Pair_alloc_type;
<a name="l00125"></a>00125
<a name="l00126"></a>00126 <span class="keyword">typedef</span> _Rb_tree<key_type, value_type, _Select1st<value_type>,
<a name="l00127"></a>00127 key_compare, _Pair_alloc_type> _Rep_type;
<a name="l00128"></a>00128 <span class="comment"></span>
<a name="l00129"></a>00129 <span class="comment"> /// The actual tree structure.</span>
<a name="l00130"></a>00130 <span class="comment"></span> _Rep_type _M_t;
<a name="l00131"></a>00131
<a name="l00132"></a>00132 <span class="keyword">public</span>:
<a name="l00133"></a>00133 <span class="comment">// many of these are specified differently in ISO, but the following are</span>
<a name="l00134"></a>00134 <span class="comment">// "functionally equivalent"</span>
<a name="l00135"></a>00135 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair_alloc_type::pointer pointer;
<a name="l00136"></a>00136 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair_alloc_type::const_pointer const_pointer;
<a name="l00137"></a>00137 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair_alloc_type::reference reference;
<a name="l00138"></a>00138 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Pair_alloc_type::const_reference const_reference;
<a name="l00139"></a>00139 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::iterator iterator;
<a name="l00140"></a>00140 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::const_iterator const_iterator;
<a name="l00141"></a>00141 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::size_type size_type;
<a name="l00142"></a>00142 <span class="keyword">typedef</span> <span class="keyword">typename</span> _Rep_type::difference_type difference_type;
<a name="l00143"></a>00143 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00693.html">_Rep_type::reverse_iterator</a> <a class="code" href="a00693.html">reverse_iterator</a>;
<a name="l00144"></a>00144 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00693.html">_Rep_type::const_reverse_iterator</a> <a class="code" href="a00693.html">const_reverse_iterator</a>;
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="comment">// [23.3.1.1] construct/copy/destroy</span>
<a name="l00147"></a>00147 <span class="comment">// (get_allocator() is normally listed in this section, but seems to have</span>
<a name="l00148"></a>00148 <span class="comment">// been accidentally omitted in the printed standard)</span><span class="comment"></span>
<a name="l00149"></a>00149 <span class="comment"> /**</span>
<a name="l00150"></a>00150 <span class="comment"> * @brief Default constructor creates no elements.</span>
<a name="l00151"></a>00151 <span class="comment"> */</span>
<a name="l00152"></a><a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced">00152</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>()
<a name="l00153"></a>00153 : _M_t() { }
<a name="l00154"></a>00154 <span class="comment"></span>
<a name="l00155"></a>00155 <span class="comment"> /**</span>
<a name="l00156"></a>00156 <span class="comment"> * @brief Creates a %map with no elements.</span>
<a name="l00157"></a>00157 <span class="comment"> * @param comp A comparison object.</span>
<a name="l00158"></a>00158 <span class="comment"> * @param a An allocator object.</span>
<a name="l00159"></a>00159 <span class="comment"> */</span>
<a name="l00160"></a>00160 <span class="keyword">explicit</span>
<a name="l00161"></a><a class="code" href="a00593.html#aa12fa7df574ac42da454cba7581c258e">00161</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(<span class="keyword">const</span> _Compare& __comp,
<a name="l00162"></a>00162 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00163"></a>00163 : _M_t(__comp, __a) { }
<a name="l00164"></a>00164 <span class="comment"></span>
<a name="l00165"></a>00165 <span class="comment"> /**</span>
<a name="l00166"></a>00166 <span class="comment"> * @brief %Map copy constructor.</span>
<a name="l00167"></a>00167 <span class="comment"> * @param x A %map of identical element and allocator types.</span>
<a name="l00168"></a>00168 <span class="comment"> *</span>
<a name="l00169"></a>00169 <span class="comment"> * The newly-created %map uses a copy of the allocation object</span>
<a name="l00170"></a>00170 <span class="comment"> * used by @a x.</span>
<a name="l00171"></a>00171 <span class="comment"> */</span>
<a name="l00172"></a><a class="code" href="a00593.html#a824e4206f6a5018174457ce8d46e9402">00172</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>& __x)
<a name="l00173"></a>00173 : _M_t(__x._M_t) { }
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00176"></a>00176 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00177"></a>00177 <span class="comment"> * @brief %Map move constructor.</span>
<a name="l00178"></a>00178 <span class="comment"> * @param x A %map of identical element and allocator types.</span>
<a name="l00179"></a>00179 <span class="comment"> *</span>
<a name="l00180"></a>00180 <span class="comment"> * The newly-created %map contains the exact contents of @a x.</span>
<a name="l00181"></a>00181 <span class="comment"> * The contents of @a x are a valid, but unspecified %map.</span>
<a name="l00182"></a>00182 <span class="comment"> */</span>
<a name="l00183"></a><a class="code" href="a00593.html#a926471a36f7b1cc295b8136e1cdad04a">00183</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(<a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>&& __x)
<a name="l00184"></a>00184 : _M_t(std::move(__x._M_t)) { }
<a name="l00185"></a>00185 <span class="comment"></span>
<a name="l00186"></a>00186 <span class="comment"> /**</span>
<a name="l00187"></a>00187 <span class="comment"> * @brief Builds a %map from an initializer_list.</span>
<a name="l00188"></a>00188 <span class="comment"> * @param l An initializer_list.</span>
<a name="l00189"></a>00189 <span class="comment"> * @param comp A comparison object.</span>
<a name="l00190"></a>00190 <span class="comment"> * @param a An allocator object.</span>
<a name="l00191"></a>00191 <span class="comment"> *</span>
<a name="l00192"></a>00192 <span class="comment"> * Create a %map consisting of copies of the elements in the</span>
<a name="l00193"></a>00193 <span class="comment"> * initializer_list @a l.</span>
<a name="l00194"></a>00194 <span class="comment"> * This is linear in N if the range is already sorted, and NlogN</span>
<a name="l00195"></a>00195 <span class="comment"> * otherwise (where N is @a l.size()).</span>
<a name="l00196"></a>00196 <span class="comment"> */</span>
<a name="l00197"></a><a class="code" href="a00593.html#a733dd29c0334764162be9c30130f32f3">00197</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l,
<a name="l00198"></a>00198 <span class="keyword">const</span> _Compare& __c = _Compare(),
<a name="l00199"></a>00199 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00200"></a>00200 : _M_t(__c, __a)
<a name="l00201"></a>00201 { _M_t._M_insert_unique(__l.begin(), __l.end()); }
<a name="l00202"></a>00202 <span class="preprocessor">#endif</span>
<a name="l00203"></a>00203 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00204"></a>00204 <span class="comment"> /**</span>
<a name="l00205"></a>00205 <span class="comment"> * @brief Builds a %map from a range.</span>
<a name="l00206"></a>00206 <span class="comment"> * @param first An input iterator.</span>
<a name="l00207"></a>00207 <span class="comment"> * @param last An input iterator.</span>
<a name="l00208"></a>00208 <span class="comment"> *</span>
<a name="l00209"></a>00209 <span class="comment"> * Create a %map consisting of copies of the elements from [first,last).</span>
<a name="l00210"></a>00210 <span class="comment"> * This is linear in N if the range is already sorted, and NlogN</span>
<a name="l00211"></a>00211 <span class="comment"> * otherwise (where N is distance(first,last)).</span>
<a name="l00212"></a>00212 <span class="comment"> */</span>
<a name="l00213"></a>00213 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00214"></a><a class="code" href="a00593.html#a6fcb6385e0b0e16c06b39dd287a55d4b">00214</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(_InputIterator __first, _InputIterator __last)
<a name="l00215"></a>00215 : _M_t()
<a name="l00216"></a>00216 { _M_t._M_insert_unique(__first, __last); }
<a name="l00217"></a>00217 <span class="comment"></span>
<a name="l00218"></a>00218 <span class="comment"> /**</span>
<a name="l00219"></a>00219 <span class="comment"> * @brief Builds a %map from a range.</span>
<a name="l00220"></a>00220 <span class="comment"> * @param first An input iterator.</span>
<a name="l00221"></a>00221 <span class="comment"> * @param last An input iterator.</span>
<a name="l00222"></a>00222 <span class="comment"> * @param comp A comparison functor.</span>
<a name="l00223"></a>00223 <span class="comment"> * @param a An allocator object.</span>
<a name="l00224"></a>00224 <span class="comment"> *</span>
<a name="l00225"></a>00225 <span class="comment"> * Create a %map consisting of copies of the elements from [first,last).</span>
<a name="l00226"></a>00226 <span class="comment"> * This is linear in N if the range is already sorted, and NlogN</span>
<a name="l00227"></a>00227 <span class="comment"> * otherwise (where N is distance(first,last)).</span>
<a name="l00228"></a>00228 <span class="comment"> */</span>
<a name="l00229"></a>00229 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00230"></a><a class="code" href="a00593.html#a8b7658909eeb1517c943a9ba0131793c">00230</a> <a class="code" href="a00593.html#ad4e3e9bc0175530ca3a78ef3ca9e6ced" title="Default constructor creates no elements.">map</a>(_InputIterator __first, _InputIterator __last,
<a name="l00231"></a>00231 <span class="keyword">const</span> _Compare& __comp,
<a name="l00232"></a>00232 <span class="keyword">const</span> allocator_type& __a = allocator_type())
<a name="l00233"></a>00233 : _M_t(__comp, __a)
<a name="l00234"></a>00234 { _M_t._M_insert_unique(__first, __last); }
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="comment">// FIXME There is no dtor declared, but we should have something</span>
<a name="l00237"></a>00237 <span class="comment">// generated by Doxygen. I don't know what tags to add to this</span>
<a name="l00238"></a>00238 <span class="comment">// paragraph to make that happen:</span><span class="comment"></span>
<a name="l00239"></a>00239 <span class="comment"> /**</span>
<a name="l00240"></a>00240 <span class="comment"> * The dtor only erases the elements, and note that if the elements</span>
<a name="l00241"></a>00241 <span class="comment"> * themselves are pointers, the pointed-to memory is not touched in any</span>
<a name="l00242"></a>00242 <span class="comment"> * way. Managing the pointer is the user's responsibility.</span>
<a name="l00243"></a>00243 <span class="comment"> */</span>
<a name="l00244"></a>00244 <span class="comment"></span>
<a name="l00245"></a>00245 <span class="comment"> /**</span>
<a name="l00246"></a>00246 <span class="comment"> * @brief %Map assignment operator.</span>
<a name="l00247"></a>00247 <span class="comment"> * @param x A %map of identical element and allocator types.</span>
<a name="l00248"></a>00248 <span class="comment"> *</span>
<a name="l00249"></a>00249 <span class="comment"> * All the elements of @a x are copied, but unlike the copy constructor,</span>
<a name="l00250"></a>00250 <span class="comment"> * the allocator object is not copied.</span>
<a name="l00251"></a>00251 <span class="comment"> */</span>
<a name="l00252"></a>00252 <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>&
<a name="l00253"></a><a class="code" href="a00593.html#afc93fe1a99a328079339b2e154c618d8">00253</a> <a class="code" href="a00593.html#afc93fe1a99a328079339b2e154c618d8" title="Map assignment operator.">operator=</a>(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>& __x)
<a name="l00254"></a>00254 {
<a name="l00255"></a>00255 _M_t = __x._M_t;
<a name="l00256"></a>00256 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258
<a name="l00259"></a>00259 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00260"></a>00260 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00261"></a>00261 <span class="comment"> * @brief %Map move assignment operator.</span>
<a name="l00262"></a>00262 <span class="comment"> * @param x A %map of identical element and allocator types.</span>
<a name="l00263"></a>00263 <span class="comment"> *</span>
<a name="l00264"></a>00264 <span class="comment"> * The contents of @a x are moved into this map (without copying).</span>
<a name="l00265"></a>00265 <span class="comment"> * @a x is a valid, but unspecified %map.</span>
<a name="l00266"></a>00266 <span class="comment"> */</span>
<a name="l00267"></a>00267 <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>&
<a name="l00268"></a><a class="code" href="a00593.html#affecc1140938431864686e53a2a3f4bc">00268</a> <a class="code" href="a00593.html#afc93fe1a99a328079339b2e154c618d8" title="Map assignment operator.">operator=</a>(<a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>&& __x)
<a name="l00269"></a>00269 {
<a name="l00270"></a>00270 <span class="comment">// NB: DR 1204.</span>
<a name="l00271"></a>00271 <span class="comment">// NB: DR 675.</span>
<a name="l00272"></a>00272 this-><a class="code" href="a00593.html#a7d8e6b6c3d4981f65ea351244d47f227">clear</a>();
<a name="l00273"></a>00273 this-><a class="code" href="a00593.html#a4931d075622f62026c0a76304bcaee6f" title="Swaps data with another map.">swap</a>(__x);
<a name="l00274"></a>00274 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276 <span class="comment"></span>
<a name="l00277"></a>00277 <span class="comment"> /**</span>
<a name="l00278"></a>00278 <span class="comment"> * @brief %Map list assignment operator.</span>
<a name="l00279"></a>00279 <span class="comment"> * @param l An initializer_list.</span>
<a name="l00280"></a>00280 <span class="comment"> *</span>
<a name="l00281"></a>00281 <span class="comment"> * This function fills a %map with copies of the elements in the</span>
<a name="l00282"></a>00282 <span class="comment"> * initializer list @a l.</span>
<a name="l00283"></a>00283 <span class="comment"> *</span>
<a name="l00284"></a>00284 <span class="comment"> * Note that the assignment completely changes the %map and</span>
<a name="l00285"></a>00285 <span class="comment"> * that the resulting %map's size is the same as the number</span>
<a name="l00286"></a>00286 <span class="comment"> * of elements assigned. Old data may be lost.</span>
<a name="l00287"></a>00287 <span class="comment"> */</span>
<a name="l00288"></a>00288 <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>&
<a name="l00289"></a><a class="code" href="a00593.html#ac01f44f3ed4b9dbebcb046b4103f920c">00289</a> <a class="code" href="a00593.html#afc93fe1a99a328079339b2e154c618d8" title="Map assignment operator.">operator=</a>(<a class="code" href="a00524.html" title="initializer_list">initializer_list<value_type></a> __l)
<a name="l00290"></a>00290 {
<a name="l00291"></a>00291 this-><a class="code" href="a00593.html#a7d8e6b6c3d4981f65ea351244d47f227">clear</a>();
<a name="l00292"></a>00292 this-><a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(__l.begin(), __l.end());
<a name="l00293"></a>00293 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00294"></a>00294 }
<a name="l00295"></a>00295 <span class="preprocessor">#endif</span>
<a name="l00296"></a>00296 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00297"></a>00297 <span class="comment"> /// Get a copy of the memory allocation object.</span>
<a name="l00298"></a>00298 <span class="comment"></span> allocator_type
<a name="l00299"></a><a class="code" href="a00593.html#a05a5e8318918ef6febc91d556bd21f01">00299</a> <a class="code" href="a00593.html#a05a5e8318918ef6febc91d556bd21f01" title="Get a copy of the memory allocation object.">get_allocator</a>()<span class="keyword"> const</span>
<a name="l00300"></a>00300 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.get_allocator(); }
<a name="l00301"></a>00301
<a name="l00302"></a>00302 <span class="comment">// iterators</span><span class="comment"></span>
<a name="l00303"></a>00303 <span class="comment"> /**</span>
<a name="l00304"></a>00304 <span class="comment"> * Returns a read/write iterator that points to the first pair in the</span>
<a name="l00305"></a>00305 <span class="comment"> * %map.</span>
<a name="l00306"></a>00306 <span class="comment"> * Iteration is done in ascending order according to the keys.</span>
<a name="l00307"></a>00307 <span class="comment"> */</span>
<a name="l00308"></a>00308 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00309"></a><a class="code" href="a00593.html#a779d256efbf86c57b2c530a9e3bf42ff">00309</a> <a class="code" href="a00593.html#a779d256efbf86c57b2c530a9e3bf42ff">begin</a>()
<a name="l00310"></a>00310 { <span class="keywordflow">return</span> _M_t.begin(); }
<a name="l00311"></a>00311 <span class="comment"></span>
<a name="l00312"></a>00312 <span class="comment"> /**</span>
<a name="l00313"></a>00313 <span class="comment"> * Returns a read-only (constant) iterator that points to the first pair</span>
<a name="l00314"></a>00314 <span class="comment"> * in the %map. Iteration is done in ascending order according to the</span>
<a name="l00315"></a>00315 <span class="comment"> * keys.</span>
<a name="l00316"></a>00316 <span class="comment"> */</span>
<a name="l00317"></a>00317 const_iterator
<a name="l00318"></a><a class="code" href="a00593.html#ae6ba981acfb1deb72ec85c3c044498bf">00318</a> <a class="code" href="a00593.html#a779d256efbf86c57b2c530a9e3bf42ff">begin</a>()<span class="keyword"> const</span>
<a name="l00319"></a>00319 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.begin(); }
<a name="l00320"></a>00320 <span class="comment"></span>
<a name="l00321"></a>00321 <span class="comment"> /**</span>
<a name="l00322"></a>00322 <span class="comment"> * Returns a read/write iterator that points one past the last</span>
<a name="l00323"></a>00323 <span class="comment"> * pair in the %map. Iteration is done in ascending order</span>
<a name="l00324"></a>00324 <span class="comment"> * according to the keys.</span>
<a name="l00325"></a>00325 <span class="comment"> */</span>
<a name="l00326"></a>00326 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00327"></a><a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">00327</a> <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>()
<a name="l00328"></a>00328 { <span class="keywordflow">return</span> _M_t.end(); }
<a name="l00329"></a>00329 <span class="comment"></span>
<a name="l00330"></a>00330 <span class="comment"> /**</span>
<a name="l00331"></a>00331 <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span>
<a name="l00332"></a>00332 <span class="comment"> * pair in the %map. Iteration is done in ascending order according to</span>
<a name="l00333"></a>00333 <span class="comment"> * the keys.</span>
<a name="l00334"></a>00334 <span class="comment"> */</span>
<a name="l00335"></a>00335 const_iterator
<a name="l00336"></a><a class="code" href="a00593.html#a1878080467a16ce255a4d4fe5db057e3">00336</a> <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>()<span class="keyword"> const</span>
<a name="l00337"></a>00337 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.end(); }
<a name="l00338"></a>00338 <span class="comment"></span>
<a name="l00339"></a>00339 <span class="comment"> /**</span>
<a name="l00340"></a>00340 <span class="comment"> * Returns a read/write reverse iterator that points to the last pair in</span>
<a name="l00341"></a>00341 <span class="comment"> * the %map. Iteration is done in descending order according to the</span>
<a name="l00342"></a>00342 <span class="comment"> * keys.</span>
<a name="l00343"></a>00343 <span class="comment"> */</span>
<a name="l00344"></a>00344 <a class="code" href="a00693.html">reverse_iterator</a>
<a name="l00345"></a><a class="code" href="a00593.html#a17d71594b6b34172aca695a8a993a539">00345</a> <a class="code" href="a00593.html#a17d71594b6b34172aca695a8a993a539">rbegin</a>()
<a name="l00346"></a>00346 { <span class="keywordflow">return</span> _M_t.rbegin(); }
<a name="l00347"></a>00347 <span class="comment"></span>
<a name="l00348"></a>00348 <span class="comment"> /**</span>
<a name="l00349"></a>00349 <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span>
<a name="l00350"></a>00350 <span class="comment"> * last pair in the %map. Iteration is done in descending order</span>
<a name="l00351"></a>00351 <span class="comment"> * according to the keys.</span>
<a name="l00352"></a>00352 <span class="comment"> */</span>
<a name="l00353"></a>00353 const_reverse_iterator
<a name="l00354"></a><a class="code" href="a00593.html#a40bc87b61e6b7521493eda3f687e101c">00354</a> <a class="code" href="a00593.html#a17d71594b6b34172aca695a8a993a539">rbegin</a>()<span class="keyword"> const</span>
<a name="l00355"></a>00355 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.rbegin(); }
<a name="l00356"></a>00356 <span class="comment"></span>
<a name="l00357"></a>00357 <span class="comment"> /**</span>
<a name="l00358"></a>00358 <span class="comment"> * Returns a read/write reverse iterator that points to one before the</span>
<a name="l00359"></a>00359 <span class="comment"> * first pair in the %map. Iteration is done in descending order</span>
<a name="l00360"></a>00360 <span class="comment"> * according to the keys.</span>
<a name="l00361"></a>00361 <span class="comment"> */</span>
<a name="l00362"></a>00362 <a class="code" href="a00693.html">reverse_iterator</a>
<a name="l00363"></a><a class="code" href="a00593.html#a72f3ece6abf4a393d5fc525b6955e048">00363</a> <a class="code" href="a00593.html#a72f3ece6abf4a393d5fc525b6955e048">rend</a>()
<a name="l00364"></a>00364 { <span class="keywordflow">return</span> _M_t.rend(); }
<a name="l00365"></a>00365 <span class="comment"></span>
<a name="l00366"></a>00366 <span class="comment"> /**</span>
<a name="l00367"></a>00367 <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span>
<a name="l00368"></a>00368 <span class="comment"> * before the first pair in the %map. Iteration is done in descending</span>
<a name="l00369"></a>00369 <span class="comment"> * order according to the keys.</span>
<a name="l00370"></a>00370 <span class="comment"> */</span>
<a name="l00371"></a>00371 const_reverse_iterator
<a name="l00372"></a><a class="code" href="a00593.html#a0b26ea90837c47297d8357d0f576718a">00372</a> <a class="code" href="a00593.html#a72f3ece6abf4a393d5fc525b6955e048">rend</a>()<span class="keyword"> const</span>
<a name="l00373"></a>00373 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.rend(); }
<a name="l00374"></a>00374
<a name="l00375"></a>00375 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00376"></a>00376 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00377"></a>00377 <span class="comment"> * Returns a read-only (constant) iterator that points to the first pair</span>
<a name="l00378"></a>00378 <span class="comment"> * in the %map. Iteration is done in ascending order according to the</span>
<a name="l00379"></a>00379 <span class="comment"> * keys.</span>
<a name="l00380"></a>00380 <span class="comment"> */</span>
<a name="l00381"></a>00381 const_iterator
<a name="l00382"></a><a class="code" href="a00593.html#a1da255b882909792928493620cd41796">00382</a> <a class="code" href="a00593.html#a1da255b882909792928493620cd41796">cbegin</a>()<span class="keyword"> const</span>
<a name="l00383"></a>00383 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.begin(); }
<a name="l00384"></a>00384 <span class="comment"></span>
<a name="l00385"></a>00385 <span class="comment"> /**</span>
<a name="l00386"></a>00386 <span class="comment"> * Returns a read-only (constant) iterator that points one past the last</span>
<a name="l00387"></a>00387 <span class="comment"> * pair in the %map. Iteration is done in ascending order according to</span>
<a name="l00388"></a>00388 <span class="comment"> * the keys.</span>
<a name="l00389"></a>00389 <span class="comment"> */</span>
<a name="l00390"></a>00390 const_iterator
<a name="l00391"></a><a class="code" href="a00593.html#a872e08f4afb0f062f499f8b6cd6f9d14">00391</a> <a class="code" href="a00593.html#a872e08f4afb0f062f499f8b6cd6f9d14">cend</a>()<span class="keyword"> const</span>
<a name="l00392"></a>00392 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.end(); }
<a name="l00393"></a>00393 <span class="comment"></span>
<a name="l00394"></a>00394 <span class="comment"> /**</span>
<a name="l00395"></a>00395 <span class="comment"> * Returns a read-only (constant) reverse iterator that points to the</span>
<a name="l00396"></a>00396 <span class="comment"> * last pair in the %map. Iteration is done in descending order</span>
<a name="l00397"></a>00397 <span class="comment"> * according to the keys.</span>
<a name="l00398"></a>00398 <span class="comment"> */</span>
<a name="l00399"></a>00399 const_reverse_iterator
<a name="l00400"></a><a class="code" href="a00593.html#a8962afa390b2d86f5ae58ddb1da1a4c4">00400</a> <a class="code" href="a00593.html#a8962afa390b2d86f5ae58ddb1da1a4c4">crbegin</a>()<span class="keyword"> const</span>
<a name="l00401"></a>00401 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.rbegin(); }
<a name="l00402"></a>00402 <span class="comment"></span>
<a name="l00403"></a>00403 <span class="comment"> /**</span>
<a name="l00404"></a>00404 <span class="comment"> * Returns a read-only (constant) reverse iterator that points to one</span>
<a name="l00405"></a>00405 <span class="comment"> * before the first pair in the %map. Iteration is done in descending</span>
<a name="l00406"></a>00406 <span class="comment"> * order according to the keys.</span>
<a name="l00407"></a>00407 <span class="comment"> */</span>
<a name="l00408"></a>00408 const_reverse_iterator
<a name="l00409"></a><a class="code" href="a00593.html#aa52710913337b029a8df957b77911749">00409</a> <a class="code" href="a00593.html#aa52710913337b029a8df957b77911749">crend</a>()<span class="keyword"> const</span>
<a name="l00410"></a>00410 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.rend(); }
<a name="l00411"></a>00411 <span class="preprocessor">#endif</span>
<a name="l00412"></a>00412 <span class="preprocessor"></span>
<a name="l00413"></a>00413 <span class="comment">// capacity</span><span class="comment"></span>
<a name="l00414"></a>00414 <span class="comment"> /** Returns true if the %map is empty. (Thus begin() would equal</span>
<a name="l00415"></a>00415 <span class="comment"> * end().)</span>
<a name="l00416"></a>00416 <span class="comment"> */</span>
<a name="l00417"></a>00417 <span class="keywordtype">bool</span>
<a name="l00418"></a><a class="code" href="a00593.html#aee625b0bcd31a35355dca6e7bf13c2b9">00418</a> <a class="code" href="a00593.html#aee625b0bcd31a35355dca6e7bf13c2b9">empty</a>()<span class="keyword"> const</span>
<a name="l00419"></a>00419 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.empty(); }
<a name="l00420"></a>00420 <span class="comment"></span>
<a name="l00421"></a>00421 <span class="comment"> /** Returns the size of the %map. */</span>
<a name="l00422"></a>00422 size_type
<a name="l00423"></a><a class="code" href="a00593.html#a0cc395b3f443fdea682c78b7df28cefd">00423</a> <a class="code" href="a00593.html#a0cc395b3f443fdea682c78b7df28cefd">size</a>()<span class="keyword"> const</span>
<a name="l00424"></a>00424 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.size(); }
<a name="l00425"></a>00425 <span class="comment"></span>
<a name="l00426"></a>00426 <span class="comment"> /** Returns the maximum size of the %map. */</span>
<a name="l00427"></a>00427 size_type
<a name="l00428"></a><a class="code" href="a00593.html#ab5a5ad9cdaac470336ce27db0291528e">00428</a> <a class="code" href="a00593.html#ab5a5ad9cdaac470336ce27db0291528e">max_size</a>()<span class="keyword"> const</span>
<a name="l00429"></a>00429 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.max_size(); }
<a name="l00430"></a>00430
<a name="l00431"></a>00431 <span class="comment">// [23.3.1.2] element access</span><span class="comment"></span>
<a name="l00432"></a>00432 <span class="comment"> /**</span>
<a name="l00433"></a>00433 <span class="comment"> * @brief Subscript ( @c [] ) access to %map data.</span>
<a name="l00434"></a>00434 <span class="comment"> * @param k The key for which data should be retrieved.</span>
<a name="l00435"></a>00435 <span class="comment"> * @return A reference to the data of the (key,data) %pair.</span>
<a name="l00436"></a>00436 <span class="comment"> *</span>
<a name="l00437"></a>00437 <span class="comment"> * Allows for easy lookup with the subscript ( @c [] )</span>
<a name="l00438"></a>00438 <span class="comment"> * operator. Returns data associated with the key specified in</span>
<a name="l00439"></a>00439 <span class="comment"> * subscript. If the key does not exist, a pair with that key</span>
<a name="l00440"></a>00440 <span class="comment"> * is created using default values, which is then returned.</span>
<a name="l00441"></a>00441 <span class="comment"> *</span>
<a name="l00442"></a>00442 <span class="comment"> * Lookup requires logarithmic time.</span>
<a name="l00443"></a>00443 <span class="comment"> */</span>
<a name="l00444"></a>00444 mapped_type&
<a name="l00445"></a><a class="code" href="a00593.html#a4a4a9f95131baf0713596d672ec36b5f">00445</a> <a class="code" href="a00593.html#a4a4a9f95131baf0713596d672ec36b5f" title="Subscript ( [] ) access to map data.">operator[]</a>(<span class="keyword">const</span> key_type& __k)
<a name="l00446"></a>00446 {
<a name="l00447"></a>00447 <span class="comment">// concept requirements</span>
<a name="l00448"></a>00448 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
<a name="l00449"></a>00449
<a name="l00450"></a>00450 iterator __i = <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(__k);
<a name="l00451"></a>00451 <span class="comment">// __i->first is greater than or equivalent to __k.</span>
<a name="l00452"></a>00452 <span class="keywordflow">if</span> (__i == <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>() || <a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">key_comp</a>()(__k, (*__i).first))
<a name="l00453"></a>00453 __i = <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(__i, <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>(__k, mapped_type()));
<a name="l00454"></a>00454 <span class="keywordflow">return</span> (*__i).second;
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456
<a name="l00457"></a>00457 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00458"></a>00458 <span class="preprocessor"></span> mapped_type&
<a name="l00459"></a>00459 <a class="code" href="a00593.html#a4a4a9f95131baf0713596d672ec36b5f" title="Subscript ( [] ) access to map data.">operator[]</a>(key_type&& __k)
<a name="l00460"></a>00460 {
<a name="l00461"></a>00461 <span class="comment">// concept requirements</span>
<a name="l00462"></a>00462 __glibcxx_function_requires(_DefaultConstructibleConcept<mapped_type>)
<a name="l00463"></a>00463
<a name="l00464"></a>00464 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __i = <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(__k);
<a name="l00465"></a>00465 <span class="comment">// __i->first is greater than or equivalent to __k.</span>
<a name="l00466"></a>00466 if (__i == <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>() || <a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">key_comp</a>()(__k, (*__i).first))
<a name="l00467"></a>00467 __i = <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(__i, std::<a class="code" href="a01137.html#a9345a6e2e39831b4291cac2e52a15792" title="A convenience wrapper for creating a pair from two objects.">make_pair</a>(std::move(__k), mapped_type()));
<a name="l00468"></a>00468 return (*__i).second;
<a name="l00469"></a>00469 }
<a name="l00470"></a>00470 <span class="preprocessor">#endif</span>
<a name="l00471"></a>00471 <span class="preprocessor"></span>
<a name="l00472"></a>00472 <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00473"></a>00473 <span class="comment">// DR 464. Suggestion for new member functions in standard containers.</span><span class="comment"></span>
<a name="l00474"></a>00474 <span class="comment"> /**</span>
<a name="l00475"></a>00475 <span class="comment"> * @brief Access to %map data.</span>
<a name="l00476"></a>00476 <span class="comment"> * @param k The key for which data should be retrieved.</span>
<a name="l00477"></a>00477 <span class="comment"> * @return A reference to the data whose key is equivalent to @a k, if</span>
<a name="l00478"></a>00478 <span class="comment"> * such a data is present in the %map.</span>
<a name="l00479"></a>00479 <span class="comment"> * @throw std::out_of_range If no such data is present.</span>
<a name="l00480"></a>00480 <span class="comment"> */</span>
<a name="l00481"></a>00481 mapped_type&
<a name="l00482"></a><a class="code" href="a00593.html#aaf4942bb42ef39ce49cc232c06416f55">00482</a> <a class="code" href="a00593.html#aaf4942bb42ef39ce49cc232c06416f55" title="Access to map data.">at</a>(<span class="keyword">const</span> key_type& __k)
<a name="l00483"></a>00483 {
<a name="l00484"></a>00484 iterator __i = <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(__k);
<a name="l00485"></a>00485 <span class="keywordflow">if</span> (__i == <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>() || <a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">key_comp</a>()(__k, (*__i).first))
<a name="l00486"></a>00486 __throw_out_of_range(__N(<span class="stringliteral">"map::at"</span>));
<a name="l00487"></a>00487 <span class="keywordflow">return</span> (*__i).second;
<a name="l00488"></a>00488 }
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <span class="keyword">const</span> mapped_type&
<a name="l00491"></a>00491 <a class="code" href="a00593.html#aaf4942bb42ef39ce49cc232c06416f55" title="Access to map data.">at</a>(<span class="keyword">const</span> key_type& __k)<span class="keyword"> const</span>
<a name="l00492"></a>00492 <span class="keyword"> </span>{
<a name="l00493"></a>00493 const_iterator __i = <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(__k);
<a name="l00494"></a>00494 <span class="keywordflow">if</span> (__i == <a class="code" href="a00593.html#a166bacc060a4cd5b58c9ef00e5765c6a">end</a>() || <a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">key_comp</a>()(__k, (*__i).first))
<a name="l00495"></a>00495 __throw_out_of_range(__N(<span class="stringliteral">"map::at"</span>));
<a name="l00496"></a>00496 <span class="keywordflow">return</span> (*__i).second;
<a name="l00497"></a>00497 }
<a name="l00498"></a>00498
<a name="l00499"></a>00499 <span class="comment">// modifiers</span><span class="comment"></span>
<a name="l00500"></a>00500 <span class="comment"> /**</span>
<a name="l00501"></a>00501 <span class="comment"> * @brief Attempts to insert a std::pair into the %map.</span>
<a name="l00502"></a>00502 <span class="comment"></span>
<a name="l00503"></a>00503 <span class="comment"> * @param x Pair to be inserted (see std::make_pair for easy creation </span>
<a name="l00504"></a>00504 <span class="comment"> * of pairs).</span>
<a name="l00505"></a>00505 <span class="comment"></span>
<a name="l00506"></a>00506 <span class="comment"> * @return A pair, of which the first element is an iterator that </span>
<a name="l00507"></a>00507 <span class="comment"> * points to the possibly inserted pair, and the second is </span>
<a name="l00508"></a>00508 <span class="comment"> * a bool that is true if the pair was actually inserted.</span>
<a name="l00509"></a>00509 <span class="comment"> *</span>
<a name="l00510"></a>00510 <span class="comment"> * This function attempts to insert a (key, value) %pair into the %map.</span>
<a name="l00511"></a>00511 <span class="comment"> * A %map relies on unique keys and thus a %pair is only inserted if its</span>
<a name="l00512"></a>00512 <span class="comment"> * first element (the key) is not already present in the %map.</span>
<a name="l00513"></a>00513 <span class="comment"> *</span>
<a name="l00514"></a>00514 <span class="comment"> * Insertion requires logarithmic time.</span>
<a name="l00515"></a>00515 <span class="comment"> */</span>
<a name="l00516"></a>00516 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a>
<a name="l00517"></a><a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41">00517</a> <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(<span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __x)
<a name="l00518"></a>00518 { <span class="keywordflow">return</span> _M_t._M_insert_unique(__x); }
<a name="l00519"></a>00519
<a name="l00520"></a>00520 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00521"></a>00521 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = <span class="keyword">typename</span>
<a name="l00522"></a>00522 <a class="code" href="a00255.html" title="enable_if">std::enable_if</a><<a class="code" href="a00540.html" title="is_convertible">std::is_convertible</a><_Pair,
<a name="l00523"></a>00523 value_type>::value>::type>
<a name="l00524"></a>00524 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, bool></a>
<a name="l00525"></a>00525 <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(_Pair&& __x)
<a name="l00526"></a>00526 { <span class="keywordflow">return</span> _M_t._M_insert_unique(std::forward<_Pair>(__x)); }
<a name="l00527"></a>00527 <span class="preprocessor">#endif</span>
<a name="l00528"></a>00528 <span class="preprocessor"></span>
<a name="l00529"></a>00529 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00530"></a>00530 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00531"></a>00531 <span class="comment"> * @brief Attempts to insert a list of std::pairs into the %map.</span>
<a name="l00532"></a>00532 <span class="comment"> * @param list A std::initializer_list<value_type> of pairs to be</span>
<a name="l00533"></a>00533 <span class="comment"> * inserted.</span>
<a name="l00534"></a>00534 <span class="comment"> *</span>
<a name="l00535"></a>00535 <span class="comment"> * Complexity similar to that of the range constructor.</span>
<a name="l00536"></a>00536 <span class="comment"> */</span>
<a name="l00537"></a>00537 <span class="keywordtype">void</span>
<a name="l00538"></a><a class="code" href="a00593.html#ab228710aaa8c81fc3b7fe37b26fc709a">00538</a> <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(<a class="code" href="a00524.html" title="initializer_list">std::initializer_list<value_type></a> __list)
<a name="l00539"></a>00539 { <a class="code" href="a00593.html#ab228710aaa8c81fc3b7fe37b26fc709a" title="Attempts to insert a list of std::pairs into the map.">insert</a>(__list.begin(), __list.end()); }
<a name="l00540"></a>00540 <span class="preprocessor">#endif</span>
<a name="l00541"></a>00541 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00542"></a>00542 <span class="comment"> /**</span>
<a name="l00543"></a>00543 <span class="comment"> * @brief Attempts to insert a std::pair into the %map.</span>
<a name="l00544"></a>00544 <span class="comment"> * @param position An iterator that serves as a hint as to where the</span>
<a name="l00545"></a>00545 <span class="comment"> * pair should be inserted.</span>
<a name="l00546"></a>00546 <span class="comment"> * @param x Pair to be inserted (see std::make_pair for easy creation</span>
<a name="l00547"></a>00547 <span class="comment"> * of pairs).</span>
<a name="l00548"></a>00548 <span class="comment"> * @return An iterator that points to the element with key of @a x (may</span>
<a name="l00549"></a>00549 <span class="comment"> * or may not be the %pair passed in).</span>
<a name="l00550"></a>00550 <span class="comment"> *</span>
<a name="l00551"></a>00551 <span class="comment"></span>
<a name="l00552"></a>00552 <span class="comment"> * This function is not concerned about whether the insertion</span>
<a name="l00553"></a>00553 <span class="comment"> * took place, and thus does not return a boolean like the</span>
<a name="l00554"></a>00554 <span class="comment"> * single-argument insert() does. Note that the first</span>
<a name="l00555"></a>00555 <span class="comment"> * parameter is only a hint and can potentially improve the</span>
<a name="l00556"></a>00556 <span class="comment"> * performance of the insertion process. A bad hint would</span>
<a name="l00557"></a>00557 <span class="comment"> * cause no gains in efficiency.</span>
<a name="l00558"></a>00558 <span class="comment"> *</span>
<a name="l00559"></a>00559 <span class="comment"> * See</span>
<a name="l00560"></a>00560 <span class="comment"> * http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html</span>
<a name="l00561"></a>00561 <span class="comment"> * for more on @a hinting.</span>
<a name="l00562"></a>00562 <span class="comment"> *</span>
<a name="l00563"></a>00563 <span class="comment"> * Insertion requires logarithmic time (if the hint is not taken).</span>
<a name="l00564"></a>00564 <span class="comment"> */</span>
<a name="l00565"></a>00565 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00566"></a>00566 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00567"></a><a class="code" href="a00593.html#aa0d825fbc11a62dc06420646e0c90dd5">00567</a> <span class="preprocessor"></span> <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(const_iterator __position, <span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __x)
<a name="l00568"></a>00568 <span class="preprocessor">#else</span>
<a name="l00569"></a>00569 <span class="preprocessor"></span> <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(iterator __position, <span class="keyword">const</span> <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">value_type</a>& __x)
<a name="l00570"></a>00570 <span class="preprocessor">#endif</span>
<a name="l00571"></a>00571 <span class="preprocessor"></span> { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position, __x); }
<a name="l00572"></a>00572
<a name="l00573"></a>00573 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00574"></a>00574 <span class="preprocessor"></span> <span class="keyword">template</span><<span class="keyword">typename</span> _Pair, <span class="keyword">typename</span> = <span class="keyword">typename</span>
<a name="l00575"></a>00575 <a class="code" href="a00255.html" title="enable_if">std::enable_if</a><<a class="code" href="a00540.html" title="is_convertible">std::is_convertible</a><_Pair,
<a name="l00576"></a>00576 value_type>::value>::type>
<a name="l00577"></a>00577 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00578"></a>00578 <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(const_iterator __position, _Pair&& __x)
<a name="l00579"></a>00579 { <span class="keywordflow">return</span> _M_t._M_insert_unique_(__position,
<a name="l00580"></a>00580 std::forward<_Pair>(__x)); }
<a name="l00581"></a>00581 <span class="preprocessor">#endif</span>
<a name="l00582"></a>00582 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00583"></a>00583 <span class="comment"> /**</span>
<a name="l00584"></a>00584 <span class="comment"> * @brief Template function that attempts to insert a range of elements.</span>
<a name="l00585"></a>00585 <span class="comment"> * @param first Iterator pointing to the start of the range to be</span>
<a name="l00586"></a>00586 <span class="comment"> * inserted.</span>
<a name="l00587"></a>00587 <span class="comment"> * @param last Iterator pointing to the end of the range.</span>
<a name="l00588"></a>00588 <span class="comment"> *</span>
<a name="l00589"></a>00589 <span class="comment"> * Complexity similar to that of the range constructor.</span>
<a name="l00590"></a>00590 <span class="comment"> */</span>
<a name="l00591"></a>00591 <span class="keyword">template</span><<span class="keyword">typename</span> _InputIterator>
<a name="l00592"></a>00592 <span class="keywordtype">void</span>
<a name="l00593"></a><a class="code" href="a00593.html#a048c8f90e24147b8fb4d81613dc92aa0">00593</a> <a class="code" href="a00593.html#a3a5341d2ce3f2ffa4426d29110ca8e41" title="Attempts to insert a std::pair into the map.">insert</a>(_InputIterator __first, _InputIterator __last)
<a name="l00594"></a>00594 { _M_t._M_insert_unique(__first, __last); }
<a name="l00595"></a>00595
<a name="l00596"></a>00596 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00597"></a>00597 <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00598"></a>00598 <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span>
<a name="l00599"></a>00599 <span class="comment"> /**</span>
<a name="l00600"></a>00600 <span class="comment"> * @brief Erases an element from a %map.</span>
<a name="l00601"></a>00601 <span class="comment"> * @param position An iterator pointing to the element to be erased.</span>
<a name="l00602"></a>00602 <span class="comment"> * @return An iterator pointing to the element immediately following</span>
<a name="l00603"></a>00603 <span class="comment"> * @a position prior to the element being erased. If no such </span>
<a name="l00604"></a>00604 <span class="comment"> * element exists, end() is returned.</span>
<a name="l00605"></a>00605 <span class="comment"> *</span>
<a name="l00606"></a>00606 <span class="comment"> * This function erases an element, pointed to by the given</span>
<a name="l00607"></a>00607 <span class="comment"> * iterator, from a %map. Note that this function only erases</span>
<a name="l00608"></a>00608 <span class="comment"> * the element, and that if the element is itself a pointer,</span>
<a name="l00609"></a>00609 <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span>
<a name="l00610"></a>00610 <span class="comment"> * the pointer is the user's responsibility.</span>
<a name="l00611"></a>00611 <span class="comment"> */</span>
<a name="l00612"></a>00612 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00613"></a><a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d">00613</a> <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(const_iterator __position)
<a name="l00614"></a>00614 { <span class="keywordflow">return</span> _M_t.erase(__position); }
<a name="l00615"></a>00615
<a name="l00616"></a>00616 <span class="comment">// LWG 2059.</span>
<a name="l00617"></a>00617 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00618"></a>00618 <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(<a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __position)
<a name="l00619"></a>00619 { <span class="keywordflow">return</span> _M_t.erase(__position); }
<a name="l00620"></a>00620 <span class="preprocessor">#else</span>
<a name="l00621"></a>00621 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00622"></a>00622 <span class="comment"> * @brief Erases an element from a %map.</span>
<a name="l00623"></a>00623 <span class="comment"> * @param position An iterator pointing to the element to be erased.</span>
<a name="l00624"></a>00624 <span class="comment"> *</span>
<a name="l00625"></a>00625 <span class="comment"> * This function erases an element, pointed to by the given</span>
<a name="l00626"></a>00626 <span class="comment"> * iterator, from a %map. Note that this function only erases</span>
<a name="l00627"></a>00627 <span class="comment"> * the element, and that if the element is itself a pointer,</span>
<a name="l00628"></a>00628 <span class="comment"> * the pointed-to memory is not touched in any way. Managing</span>
<a name="l00629"></a>00629 <span class="comment"> * the pointer is the user's responsibility.</span>
<a name="l00630"></a>00630 <span class="comment"> */</span>
<a name="l00631"></a>00631 <span class="keywordtype">void</span>
<a name="l00632"></a>00632 <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(iterator __position)
<a name="l00633"></a>00633 { _M_t.erase(__position); }
<a name="l00634"></a>00634 <span class="preprocessor">#endif</span>
<a name="l00635"></a>00635 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00636"></a>00636 <span class="comment"> /**</span>
<a name="l00637"></a>00637 <span class="comment"> * @brief Erases elements according to the provided key.</span>
<a name="l00638"></a>00638 <span class="comment"> * @param x Key of element to be erased.</span>
<a name="l00639"></a>00639 <span class="comment"> * @return The number of elements erased.</span>
<a name="l00640"></a>00640 <span class="comment"> *</span>
<a name="l00641"></a>00641 <span class="comment"> * This function erases all the elements located by the given key from</span>
<a name="l00642"></a>00642 <span class="comment"> * a %map.</span>
<a name="l00643"></a>00643 <span class="comment"> * Note that this function only erases the element, and that if</span>
<a name="l00644"></a>00644 <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span>
<a name="l00645"></a>00645 <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span>
<a name="l00646"></a>00646 <span class="comment"> */</span>
<a name="l00647"></a>00647 size_type
<a name="l00648"></a><a class="code" href="a00593.html#a6b510fc380b070d899d73a278cbb8faf">00648</a> <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(<span class="keyword">const</span> key_type& __x)
<a name="l00649"></a>00649 { <span class="keywordflow">return</span> _M_t.erase(__x); }
<a name="l00650"></a>00650
<a name="l00651"></a>00651 <span class="preprocessor">#ifdef __GXX_EXPERIMENTAL_CXX0X__</span>
<a name="l00652"></a>00652 <span class="preprocessor"></span> <span class="comment">// _GLIBCXX_RESOLVE_LIB_DEFECTS</span>
<a name="l00653"></a>00653 <span class="comment">// DR 130. Associative erase should return an iterator.</span><span class="comment"></span>
<a name="l00654"></a>00654 <span class="comment"> /**</span>
<a name="l00655"></a>00655 <span class="comment"> * @brief Erases a [first,last) range of elements from a %map.</span>
<a name="l00656"></a>00656 <span class="comment"> * @param first Iterator pointing to the start of the range to be</span>
<a name="l00657"></a>00657 <span class="comment"> * erased.</span>
<a name="l00658"></a>00658 <span class="comment"> * @param last Iterator pointing to the end of the range to be erased.</span>
<a name="l00659"></a>00659 <span class="comment"> * @return The iterator @a last.</span>
<a name="l00660"></a>00660 <span class="comment"> *</span>
<a name="l00661"></a>00661 <span class="comment"> * This function erases a sequence of elements from a %map.</span>
<a name="l00662"></a>00662 <span class="comment"> * Note that this function only erases the element, and that if</span>
<a name="l00663"></a>00663 <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span>
<a name="l00664"></a>00664 <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span>
<a name="l00665"></a>00665 <span class="comment"> */</span>
<a name="l00666"></a>00666 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00667"></a><a class="code" href="a00593.html#aa98a4bd34df51b51262b26f06a657efe">00667</a> <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(const_iterator __first, const_iterator __last)
<a name="l00668"></a>00668 { <span class="keywordflow">return</span> _M_t.erase(__first, __last); }
<a name="l00669"></a>00669 <span class="preprocessor">#else</span>
<a name="l00670"></a>00670 <span class="preprocessor"></span><span class="comment"> /**</span>
<a name="l00671"></a>00671 <span class="comment"> * @brief Erases a [first,last) range of elements from a %map.</span>
<a name="l00672"></a>00672 <span class="comment"> * @param first Iterator pointing to the start of the range to be</span>
<a name="l00673"></a>00673 <span class="comment"> * erased.</span>
<a name="l00674"></a>00674 <span class="comment"> * @param last Iterator pointing to the end of the range to be erased.</span>
<a name="l00675"></a>00675 <span class="comment"> *</span>
<a name="l00676"></a>00676 <span class="comment"> * This function erases a sequence of elements from a %map.</span>
<a name="l00677"></a>00677 <span class="comment"> * Note that this function only erases the element, and that if</span>
<a name="l00678"></a>00678 <span class="comment"> * the element is itself a pointer, the pointed-to memory is not touched</span>
<a name="l00679"></a>00679 <span class="comment"> * in any way. Managing the pointer is the user's responsibility.</span>
<a name="l00680"></a>00680 <span class="comment"> */</span>
<a name="l00681"></a>00681 <span class="keywordtype">void</span>
<a name="l00682"></a>00682 <a class="code" href="a00593.html#ac9ea51e48199ff9a87ea1b855789e53d" title="Erases an element from a map.">erase</a>(<a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __first, <a class="code" href="a00260.html" title="Common iterator class.">iterator</a> __last)
<a name="l00683"></a>00683 { _M_t.erase(__first, __last); }
<a name="l00684"></a>00684 <span class="preprocessor">#endif</span>
<a name="l00685"></a>00685 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00686"></a>00686 <span class="comment"> /**</span>
<a name="l00687"></a>00687 <span class="comment"> * @brief Swaps data with another %map.</span>
<a name="l00688"></a>00688 <span class="comment"> * @param x A %map of the same element and allocator types.</span>
<a name="l00689"></a>00689 <span class="comment"> *</span>
<a name="l00690"></a>00690 <span class="comment"> * This exchanges the elements between two maps in constant</span>
<a name="l00691"></a>00691 <span class="comment"> * time. (It is only swapping a pointer, an integer, and an</span>
<a name="l00692"></a>00692 <span class="comment"> * instance of the @c Compare type (which itself is often</span>
<a name="l00693"></a>00693 <span class="comment"> * stateless and empty), so it should be quite fast.) Note</span>
<a name="l00694"></a>00694 <span class="comment"> * that the global std::swap() function is specialized such</span>
<a name="l00695"></a>00695 <span class="comment"> * that std::swap(m1,m2) will feed to this function.</span>
<a name="l00696"></a>00696 <span class="comment"> */</span>
<a name="l00697"></a>00697 <span class="keywordtype">void</span>
<a name="l00698"></a><a class="code" href="a00593.html#a4931d075622f62026c0a76304bcaee6f">00698</a> <a class="code" href="a00593.html#a4931d075622f62026c0a76304bcaee6f" title="Swaps data with another map.">swap</a>(<a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map</a>& __x)
<a name="l00699"></a>00699 { _M_t.swap(__x._M_t); }
<a name="l00700"></a>00700 <span class="comment"></span>
<a name="l00701"></a>00701 <span class="comment"> /**</span>
<a name="l00702"></a>00702 <span class="comment"> * Erases all elements in a %map. Note that this function only</span>
<a name="l00703"></a>00703 <span class="comment"> * erases the elements, and that if the elements themselves are</span>
<a name="l00704"></a>00704 <span class="comment"> * pointers, the pointed-to memory is not touched in any way.</span>
<a name="l00705"></a>00705 <span class="comment"> * Managing the pointer is the user's responsibility.</span>
<a name="l00706"></a>00706 <span class="comment"> */</span>
<a name="l00707"></a>00707 <span class="keywordtype">void</span>
<a name="l00708"></a><a class="code" href="a00593.html#a7d8e6b6c3d4981f65ea351244d47f227">00708</a> <a class="code" href="a00593.html#a7d8e6b6c3d4981f65ea351244d47f227">clear</a>()
<a name="l00709"></a>00709 { _M_t.clear(); }
<a name="l00710"></a>00710
<a name="l00711"></a>00711 <span class="comment">// observers</span><span class="comment"></span>
<a name="l00712"></a>00712 <span class="comment"> /**</span>
<a name="l00713"></a>00713 <span class="comment"> * Returns the key comparison object out of which the %map was</span>
<a name="l00714"></a>00714 <span class="comment"> * constructed.</span>
<a name="l00715"></a>00715 <span class="comment"> */</span>
<a name="l00716"></a>00716 key_compare
<a name="l00717"></a><a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">00717</a> <a class="code" href="a00593.html#a93ee6c81ab7a89a16b03bdb64ac3147d">key_comp</a>()<span class="keyword"> const</span>
<a name="l00718"></a>00718 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.key_comp(); }
<a name="l00719"></a>00719 <span class="comment"></span>
<a name="l00720"></a>00720 <span class="comment"> /**</span>
<a name="l00721"></a>00721 <span class="comment"> * Returns a value comparison object, built from the key comparison</span>
<a name="l00722"></a>00722 <span class="comment"> * object out of which the %map was constructed.</span>
<a name="l00723"></a>00723 <span class="comment"> */</span>
<a name="l00724"></a>00724 value_compare
<a name="l00725"></a><a class="code" href="a00593.html#adbc41ecf217d9ab04c5a3bb9131a53c7">00725</a> <a class="code" href="a00593.html#adbc41ecf217d9ab04c5a3bb9131a53c7">value_comp</a>()<span class="keyword"> const</span>
<a name="l00726"></a>00726 <span class="keyword"> </span>{ <span class="keywordflow">return</span> value_compare(_M_t.key_comp()); }
<a name="l00727"></a>00727
<a name="l00728"></a>00728 <span class="comment">// [23.3.1.3] map operations</span><span class="comment"></span>
<a name="l00729"></a>00729 <span class="comment"> /**</span>
<a name="l00730"></a>00730 <span class="comment"> * @brief Tries to locate an element in a %map.</span>
<a name="l00731"></a>00731 <span class="comment"> * @param x Key of (key, value) %pair to be located.</span>
<a name="l00732"></a>00732 <span class="comment"> * @return Iterator pointing to sought-after element, or end() if not</span>
<a name="l00733"></a>00733 <span class="comment"> * found.</span>
<a name="l00734"></a>00734 <span class="comment"> *</span>
<a name="l00735"></a>00735 <span class="comment"> * This function takes a key and tries to locate the element with which</span>
<a name="l00736"></a>00736 <span class="comment"> * the key matches. If successful the function returns an iterator</span>
<a name="l00737"></a>00737 <span class="comment"> * pointing to the sought after %pair. If unsuccessful it returns the</span>
<a name="l00738"></a>00738 <span class="comment"> * past-the-end ( @c end() ) iterator.</span>
<a name="l00739"></a>00739 <span class="comment"> */</span>
<a name="l00740"></a>00740 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00741"></a><a class="code" href="a00593.html#abdcd985632d8ad7ddba069aa776e2dfe">00741</a> <a class="code" href="a00593.html#abdcd985632d8ad7ddba069aa776e2dfe" title="Tries to locate an element in a map.">find</a>(<span class="keyword">const</span> key_type& __x)
<a name="l00742"></a>00742 { <span class="keywordflow">return</span> _M_t.find(__x); }
<a name="l00743"></a>00743 <span class="comment"></span>
<a name="l00744"></a>00744 <span class="comment"> /**</span>
<a name="l00745"></a>00745 <span class="comment"> * @brief Tries to locate an element in a %map.</span>
<a name="l00746"></a>00746 <span class="comment"> * @param x Key of (key, value) %pair to be located.</span>
<a name="l00747"></a>00747 <span class="comment"> * @return Read-only (constant) iterator pointing to sought-after</span>
<a name="l00748"></a>00748 <span class="comment"> * element, or end() if not found.</span>
<a name="l00749"></a>00749 <span class="comment"> *</span>
<a name="l00750"></a>00750 <span class="comment"> * This function takes a key and tries to locate the element with which</span>
<a name="l00751"></a>00751 <span class="comment"> * the key matches. If successful the function returns a constant</span>
<a name="l00752"></a>00752 <span class="comment"> * iterator pointing to the sought after %pair. If unsuccessful it</span>
<a name="l00753"></a>00753 <span class="comment"> * returns the past-the-end ( @c end() ) iterator.</span>
<a name="l00754"></a>00754 <span class="comment"> */</span>
<a name="l00755"></a>00755 const_iterator
<a name="l00756"></a><a class="code" href="a00593.html#a81e1441727226711d28d30daffea52c1">00756</a> <a class="code" href="a00593.html#abdcd985632d8ad7ddba069aa776e2dfe" title="Tries to locate an element in a map.">find</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span>
<a name="l00757"></a>00757 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x); }
<a name="l00758"></a>00758 <span class="comment"></span>
<a name="l00759"></a>00759 <span class="comment"> /**</span>
<a name="l00760"></a>00760 <span class="comment"> * @brief Finds the number of elements with given key.</span>
<a name="l00761"></a>00761 <span class="comment"> * @param x Key of (key, value) pairs to be located.</span>
<a name="l00762"></a>00762 <span class="comment"> * @return Number of elements with specified key.</span>
<a name="l00763"></a>00763 <span class="comment"> *</span>
<a name="l00764"></a>00764 <span class="comment"> * This function only makes sense for multimaps; for map the result will</span>
<a name="l00765"></a>00765 <span class="comment"> * either be 0 (not present) or 1 (present).</span>
<a name="l00766"></a>00766 <span class="comment"> */</span>
<a name="l00767"></a>00767 size_type
<a name="l00768"></a><a class="code" href="a00593.html#a75d636c433f2022f9cfc834694880cb6">00768</a> <a class="code" href="a00593.html#a75d636c433f2022f9cfc834694880cb6" title="Finds the number of elements with given key.">count</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span>
<a name="l00769"></a>00769 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.find(__x) == _M_t.end() ? 0 : 1; }
<a name="l00770"></a>00770 <span class="comment"></span>
<a name="l00771"></a>00771 <span class="comment"> /**</span>
<a name="l00772"></a>00772 <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span>
<a name="l00773"></a>00773 <span class="comment"> * @param x Key of (key, value) pair to be located.</span>
<a name="l00774"></a>00774 <span class="comment"> * @return Iterator pointing to first element equal to or greater</span>
<a name="l00775"></a>00775 <span class="comment"> * than key, or end().</span>
<a name="l00776"></a>00776 <span class="comment"> *</span>
<a name="l00777"></a>00777 <span class="comment"> * This function returns the first element of a subsequence of elements</span>
<a name="l00778"></a>00778 <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span>
<a name="l00779"></a>00779 <span class="comment"> * pointing to the first element that has a greater value than given key</span>
<a name="l00780"></a>00780 <span class="comment"> * or end() if no such element exists.</span>
<a name="l00781"></a>00781 <span class="comment"> */</span>
<a name="l00782"></a>00782 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00783"></a><a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081">00783</a> <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(<span class="keyword">const</span> key_type& __x)
<a name="l00784"></a>00784 { <span class="keywordflow">return</span> _M_t.lower_bound(__x); }
<a name="l00785"></a>00785 <span class="comment"></span>
<a name="l00786"></a>00786 <span class="comment"> /**</span>
<a name="l00787"></a>00787 <span class="comment"> * @brief Finds the beginning of a subsequence matching given key.</span>
<a name="l00788"></a>00788 <span class="comment"> * @param x Key of (key, value) pair to be located.</span>
<a name="l00789"></a>00789 <span class="comment"> * @return Read-only (constant) iterator pointing to first element</span>
<a name="l00790"></a>00790 <span class="comment"> * equal to or greater than key, or end().</span>
<a name="l00791"></a>00791 <span class="comment"> *</span>
<a name="l00792"></a>00792 <span class="comment"> * This function returns the first element of a subsequence of elements</span>
<a name="l00793"></a>00793 <span class="comment"> * that matches the given key. If unsuccessful it returns an iterator</span>
<a name="l00794"></a>00794 <span class="comment"> * pointing to the first element that has a greater value than given key</span>
<a name="l00795"></a>00795 <span class="comment"> * or end() if no such element exists.</span>
<a name="l00796"></a>00796 <span class="comment"> */</span>
<a name="l00797"></a>00797 const_iterator
<a name="l00798"></a><a class="code" href="a00593.html#a08d1259712c50945a7a37d48d15d461b">00798</a> <a class="code" href="a00593.html#adbb7e90f8d6bece7f9ffb6b76c9ab081" title="Finds the beginning of a subsequence matching given key.">lower_bound</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span>
<a name="l00799"></a>00799 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.lower_bound(__x); }
<a name="l00800"></a>00800 <span class="comment"></span>
<a name="l00801"></a>00801 <span class="comment"> /**</span>
<a name="l00802"></a>00802 <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span>
<a name="l00803"></a>00803 <span class="comment"> * @param x Key of (key, value) pair to be located.</span>
<a name="l00804"></a>00804 <span class="comment"> * @return Iterator pointing to the first element</span>
<a name="l00805"></a>00805 <span class="comment"> * greater than key, or end().</span>
<a name="l00806"></a>00806 <span class="comment"> */</span>
<a name="l00807"></a>00807 <a class="code" href="a00260.html" title="Common iterator class.">iterator</a>
<a name="l00808"></a><a class="code" href="a00593.html#a31f6ba9ed7f80198dd444d6d830a3c80">00808</a> <a class="code" href="a00593.html#a31f6ba9ed7f80198dd444d6d830a3c80" title="Finds the end of a subsequence matching given key.">upper_bound</a>(<span class="keyword">const</span> key_type& __x)
<a name="l00809"></a>00809 { <span class="keywordflow">return</span> _M_t.upper_bound(__x); }
<a name="l00810"></a>00810 <span class="comment"></span>
<a name="l00811"></a>00811 <span class="comment"> /**</span>
<a name="l00812"></a>00812 <span class="comment"> * @brief Finds the end of a subsequence matching given key.</span>
<a name="l00813"></a>00813 <span class="comment"> * @param x Key of (key, value) pair to be located.</span>
<a name="l00814"></a>00814 <span class="comment"> * @return Read-only (constant) iterator pointing to first iterator</span>
<a name="l00815"></a>00815 <span class="comment"> * greater than key, or end().</span>
<a name="l00816"></a>00816 <span class="comment"> */</span>
<a name="l00817"></a>00817 const_iterator
<a name="l00818"></a><a class="code" href="a00593.html#a36edae327724815c820f5c73ab02ef93">00818</a> <a class="code" href="a00593.html#a31f6ba9ed7f80198dd444d6d830a3c80" title="Finds the end of a subsequence matching given key.">upper_bound</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span>
<a name="l00819"></a>00819 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.upper_bound(__x); }
<a name="l00820"></a>00820 <span class="comment"></span>
<a name="l00821"></a>00821 <span class="comment"> /**</span>
<a name="l00822"></a>00822 <span class="comment"> * @brief Finds a subsequence matching given key.</span>
<a name="l00823"></a>00823 <span class="comment"> * @param x Key of (key, value) pairs to be located.</span>
<a name="l00824"></a>00824 <span class="comment"> * @return Pair of iterators that possibly points to the subsequence</span>
<a name="l00825"></a>00825 <span class="comment"> * matching given key.</span>
<a name="l00826"></a>00826 <span class="comment"> *</span>
<a name="l00827"></a>00827 <span class="comment"> * This function is equivalent to</span>
<a name="l00828"></a>00828 <span class="comment"> * @code</span>
<a name="l00829"></a>00829 <span class="comment"> * std::make_pair(c.lower_bound(val),</span>
<a name="l00830"></a>00830 <span class="comment"> * c.upper_bound(val))</span>
<a name="l00831"></a>00831 <span class="comment"> * @endcode</span>
<a name="l00832"></a>00832 <span class="comment"> * (but is faster than making the calls separately).</span>
<a name="l00833"></a>00833 <span class="comment"> *</span>
<a name="l00834"></a>00834 <span class="comment"> * This function probably only makes sense for multimaps.</span>
<a name="l00835"></a>00835 <span class="comment"> */</span>
<a name="l00836"></a>00836 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<iterator, iterator></a>
<a name="l00837"></a><a class="code" href="a00593.html#a5e0d4434a099805754b757634f18cc23">00837</a> <a class="code" href="a00593.html#a5e0d4434a099805754b757634f18cc23" title="Finds a subsequence matching given key.">equal_range</a>(<span class="keyword">const</span> key_type& __x)
<a name="l00838"></a>00838 { <span class="keywordflow">return</span> _M_t.equal_range(__x); }
<a name="l00839"></a>00839 <span class="comment"></span>
<a name="l00840"></a>00840 <span class="comment"> /**</span>
<a name="l00841"></a>00841 <span class="comment"> * @brief Finds a subsequence matching given key.</span>
<a name="l00842"></a>00842 <span class="comment"> * @param x Key of (key, value) pairs to be located.</span>
<a name="l00843"></a>00843 <span class="comment"> * @return Pair of read-only (constant) iterators that possibly points</span>
<a name="l00844"></a>00844 <span class="comment"> * to the subsequence matching given key.</span>
<a name="l00845"></a>00845 <span class="comment"> *</span>
<a name="l00846"></a>00846 <span class="comment"> * This function is equivalent to</span>
<a name="l00847"></a>00847 <span class="comment"> * @code</span>
<a name="l00848"></a>00848 <span class="comment"> * std::make_pair(c.lower_bound(val),</span>
<a name="l00849"></a>00849 <span class="comment"> * c.upper_bound(val))</span>
<a name="l00850"></a>00850 <span class="comment"> * @endcode</span>
<a name="l00851"></a>00851 <span class="comment"> * (but is faster than making the calls separately).</span>
<a name="l00852"></a>00852 <span class="comment"> *</span>
<a name="l00853"></a>00853 <span class="comment"> * This function probably only makes sense for multimaps.</span>
<a name="l00854"></a>00854 <span class="comment"> */</span>
<a name="l00855"></a>00855 <a class="code" href="a00263.html" title="Struct holding two objects of arbitrary type.">std::pair<const_iterator, const_iterator></a>
<a name="l00856"></a><a class="code" href="a00593.html#a21302c19c9b04ed1fe3688c07b565ce0">00856</a> <a class="code" href="a00593.html#a5e0d4434a099805754b757634f18cc23" title="Finds a subsequence matching given key.">equal_range</a>(<span class="keyword">const</span> key_type& __x)<span class="keyword"> const</span>
<a name="l00857"></a>00857 <span class="keyword"> </span>{ <span class="keywordflow">return</span> _M_t.equal_range(__x); }
<a name="l00858"></a>00858
<a name="l00859"></a>00859 <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>
<a name="l00860"></a>00860 <span class="keyword">friend</span> <span class="keywordtype">bool</span>
<a name="l00861"></a>00861 operator==(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_K1, _T1, _C1, _A1></a>&,
<a name="l00862"></a>00862 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_K1, _T1, _C1, _A1></a>&);
<a name="l00863"></a>00863
<a name="l00864"></a>00864 <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>
<a name="l00865"></a>00865 <span class="keyword">friend</span> <span class="keywordtype">bool</span>
<a name="l00866"></a>00866 operator<(const map<_K1, _T1, _C1, _A1>&,
<a name="l00867"></a>00867 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_K1, _T1, _C1, _A1></a>&);
<a name="l00868"></a>00868 };
<a name="l00869"></a>00869 <span class="comment"></span>
<a name="l00870"></a>00870 <span class="comment"> /**</span>
<a name="l00871"></a>00871 <span class="comment"> * @brief Map equality comparison.</span>
<a name="l00872"></a>00872 <span class="comment"> * @param x A %map.</span>
<a name="l00873"></a>00873 <span class="comment"> * @param y A %map of the same type as @a x.</span>
<a name="l00874"></a>00874 <span class="comment"> * @return True iff the size and elements of the maps are equal.</span>
<a name="l00875"></a>00875 <span class="comment"> *</span>
<a name="l00876"></a>00876 <span class="comment"> * This is an equivalence relation. It is linear in the size of the</span>
<a name="l00877"></a>00877 <span class="comment"> * maps. Maps are considered equivalent if their sizes are equal,</span>
<a name="l00878"></a>00878 <span class="comment"> * and if corresponding elements compare equal.</span>
<a name="l00879"></a>00879 <span class="comment"> */</span>
<a name="l00880"></a>00880 <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>
<a name="l00881"></a>00881 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00882"></a><a class="code" href="a01137.html#ac113cd7ecee6a6f870ce1c4ff3890205">00882</a> operator==(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __x,
<a name="l00883"></a>00883 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00884"></a>00884 { <span class="keywordflow">return</span> __x._M_t == __y._M_t; }
<a name="l00885"></a>00885 <span class="comment"></span>
<a name="l00886"></a>00886 <span class="comment"> /**</span>
<a name="l00887"></a>00887 <span class="comment"> * @brief Map ordering relation.</span>
<a name="l00888"></a>00888 <span class="comment"> * @param x A %map.</span>
<a name="l00889"></a>00889 <span class="comment"> * @param y A %map of the same type as @a x.</span>
<a name="l00890"></a>00890 <span class="comment"> * @return True iff @a x is lexicographically less than @a y.</span>
<a name="l00891"></a>00891 <span class="comment"> *</span>
<a name="l00892"></a>00892 <span class="comment"> * This is a total ordering relation. It is linear in the size of the</span>
<a name="l00893"></a>00893 <span class="comment"> * maps. The elements must be comparable with @c <.</span>
<a name="l00894"></a>00894 <span class="comment"> *</span>
<a name="l00895"></a>00895 <span class="comment"> * See std::lexicographical_compare() for how the determination is made.</span>
<a name="l00896"></a>00896 <span class="comment"> */</span>
<a name="l00897"></a>00897 <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>
<a name="l00898"></a>00898 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00899"></a><a class="code" href="a01137.html#aba84ecd69841bee1ee2a1a40d3ee040e">00899</a> operator<(const map<_Key, _Tp, _Compare, _Alloc>& __x,
<a name="l00900"></a>00900 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00901"></a>00901 { <span class="keywordflow">return</span> __x._M_t < __y._M_t; }
<a name="l00902"></a>00902 <span class="comment"></span>
<a name="l00903"></a>00903 <span class="comment"> /// Based on operator==</span>
<a name="l00904"></a>00904 <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>
<a name="l00905"></a>00905 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00906"></a><a class="code" href="a01137.html#aeda2b55f46232c6cbe4e7b07b2616060">00906</a> operator!=(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __x,
<a name="l00907"></a>00907 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00908"></a>00908 { <span class="keywordflow">return</span> !(__x == __y); }
<a name="l00909"></a>00909 <span class="comment"></span>
<a name="l00910"></a>00910 <span class="comment"> /// Based on operator<</span>
<a name="l00911"></a>00911 <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>
<a name="l00912"></a>00912 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00913"></a><a class="code" href="a01137.html#a36a3cda376517d0049738ba769206088">00913</a> operator>(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __x,
<a name="l00914"></a>00914 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00915"></a>00915 { <span class="keywordflow">return</span> __y < __x; }
<a name="l00916"></a>00916 <span class="comment"></span>
<a name="l00917"></a>00917 <span class="comment"> /// Based on operator<</span>
<a name="l00918"></a>00918 <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>
<a name="l00919"></a>00919 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00920"></a><a class="code" href="a01137.html#a7e3942ec15d5c3df4f87af72d6e3c71a">00920</a> operator<=(const map<_Key, _Tp, _Compare, _Alloc>& __x,
<a name="l00921"></a>00921 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00922"></a>00922 { <span class="keywordflow">return</span> !(__y < __x); }
<a name="l00923"></a>00923 <span class="comment"></span>
<a name="l00924"></a>00924 <span class="comment"> /// Based on operator<</span>
<a name="l00925"></a>00925 <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>
<a name="l00926"></a>00926 <span class="keyword">inline</span> <span class="keywordtype">bool</span>
<a name="l00927"></a><a class="code" href="a01137.html#a28b8254e0bf3fe7789b6beff22191416">00927</a> operator>=(<span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __x,
<a name="l00928"></a>00928 <span class="keyword">const</span> <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00929"></a>00929 { <span class="keywordflow">return</span> !(__x < __y); }
<a name="l00930"></a>00930 <span class="comment"></span>
<a name="l00931"></a>00931 <span class="comment"> /// See std::map::swap().</span>
<a name="l00932"></a>00932 <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>
<a name="l00933"></a>00933 <span class="keyword">inline</span> <span class="keywordtype">void</span>
<a name="l00934"></a><a class="code" href="a01137.html#a23a6e86df3e4e55b5e2f6ad5fd8cc9a5">00934</a> <a class="code" href="a00593.html#a4931d075622f62026c0a76304bcaee6f" title="Swaps data with another map.">swap</a>(<a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __x,
<a name="l00935"></a>00935 <a class="code" href="a00593.html" title="A standard container made up of (key,value) pairs, which can be retrieved based on a key...">map<_Key, _Tp, _Compare, _Alloc></a>& __y)
<a name="l00936"></a>00936 { __x.<a class="code" href="a00593.html#a4931d075622f62026c0a76304bcaee6f" title="Swaps data with another map.">swap</a>(__y); }
<a name="l00937"></a>00937
<a name="l00938"></a>00938 _GLIBCXX_END_NAMESPACE_CONTAINER
<a name="l00939"></a>00939 } <span class="comment">// namespace std</span>
<a name="l00940"></a>00940
<a name="l00941"></a>00941 <span class="preprocessor">#endif </span><span class="comment">/* _STL_MAP_H */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="a01056.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.7.4 </li>
</ul>
</div>
</body>
</html>
