</TD><TD VAlign=top> <A href="ReversibleContainer.html">Reversible Container</A></TD><TD VAlign=top>Returns a <tt>const_reverse_iterator</tt> pointing to the end of the   reversed multimap.</TD></TR><TR><TD VAlign=top><tt>size_type size() const</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>Returns the size of the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>size_type max_size() const</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>Returns the largest possible size of the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>bool empty() const</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top><tt>true</tt> if the <tt>multimap</tt>'s size is <tt>0</tt>.</TD></TR><TR><TD VAlign=top><tt>key_compare key_comp() const</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Returns the <tt>key_compare</tt> object used by the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>value_compare value_comp() const</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Returns the <tt>value_compare</tt> object used by the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>multimap()</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>Creates an empty <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>multimap(const key_compare&amp; comp)</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Creates an empty <tt>multimap</tt>, using <tt>comp</tt> as the <tt>key_compare</tt> object.</TD></TR><TR><TD VAlign=top><pre>template &lt;class <A href="InputIterator.html">InputIterator</A>&gt;multimap(InputIterator f, InputIterator l)<A href="#2">[2]</A></pre></TD><TD VAlign=top> <A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A></TD><TD VAlign=top>Creates a multimap with a copy of a range.</TD></TR><TR><TD VAlign=top><pre>template &lt;class <A href="InputIterator.html">InputIterator</A>&gt;multimap(InputIterator f, InputIterator l,         const key_compare&amp; comp) <A href="#2">[2]</A></pre></TD><TD VAlign=top> <A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A></TD><TD VAlign=top>Creates a multimap with a copy of a range, using <tt>comp</tt> as the <tt>key_compare</tt>   object.</TD></TR><TR><TD VAlign=top><tt>multimap(const multimap&amp;)</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>The copy constructor.</TD></TR><TR><TD VAlign=top><tt>multimap&amp; operator=(const multimap&amp;)</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>The assignment operator</TD></TR><TR><TD VAlign=top><tt>void swap(multimap&amp;)</tt></TD><TD VAlign=top> <A href="Container.html">Container</A></TD><TD VAlign=top>Swaps the contents of two multimaps.</TD></TR><TR><TD VAlign=top><tt>iterator insert(const value_type&amp; x)</tt></TD><TD VAlign=top> <A href="MultipleAssociativeContainer.html">Multiple Associative Container</A></TD><TD VAlign=top>Inserts <tt>x</tt> into the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><pre>iterator insert(iterator pos,                 const value_type&amp; x)</pre></TD><TD VAlign=top> <A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A></TD><TD VAlign=top>Inserts <tt>x</tt> into the <tt>multimap</tt>, using <tt>pos</tt> as a hint to where it will be   inserted.</TD></TR><TR><TD VAlign=top><pre>template &lt;class <A href="InputIterator.html">InputIterator</A>&gt;void insert(InputIterator, InputIterator)<A href="#2">[2]</A></pre></TD><TD VAlign=top> <A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A></TD><TD VAlign=top>Inserts a range into the <tt>multimap</tt>.</TD></TR><TR><TD VAlign=top><tt>void erase(iterator pos)</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Erases the element pointed to by <tt>pos</tt>.</TD></TR><TR><TD VAlign=top><tt>size_type erase(const key_type&amp; k)</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Erases the element whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>void erase(iterator first, iterator last)</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Erases all elements in a range.</TD></TR><TR><TD VAlign=top><tt>void clear()</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Erases all of the elements.</TD></TR><TR><TD VAlign=top><tt>iterator find(const key_type&amp; k)</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Finds an element whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>const_iterator find(const key_type&amp; k) const</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Finds an element whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>size_type count(const key_type&amp; k)</tt></TD><TD VAlign=top> <A href="AssociativeContainer.html">Associative Container</A></TD><TD VAlign=top>Counts the number of elements whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>iterator lower_bound(const key_type&amp; k)</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds the first element whose key is not less than <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>const_iterator lower_bound(const key_type&amp; k) const</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds the first element whose key is not less than <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>iterator upper_bound(const key_type&amp; k)</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds the first element whose key greater than <tt>k</tt>.</TD></TR><TR><TD VAlign=top><tt>const_iterator upper_bound(const key_type&amp; k) const</tt></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds the first element whose key greater than <tt>k</tt>.</TD></TR><TR><TD VAlign=top><pre>pair&lt;iterator, iterator&gt;equal_range(const key_type&amp; k)</pre></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds a range containing all elements whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><pre>pair&lt;const_iterator, const_iterator&gt; equal_range(const key_type&amp; k) const</pre></TD><TD VAlign=top> <A href="SortedAssociativeContainer.html">Sorted Associative Container</A></TD><TD VAlign=top>Finds a range containing all elements whose key is <tt>k</tt>.</TD></TR><TR><TD VAlign=top><pre>bool operator==(const multimap&amp;,                 const multimap&amp;)</pre></TD><TD VAlign=top> <A href="ForwardContainer.html">Forward Container</A></TD><TD VAlign=top>Tests two multimaps for equality.  This is a global function, not   a member function.</TD></TR><TR><TD VAlign=top><pre>bool operator&lt;(const multimap&amp;,                const multimap&amp;)</pre></TD><TD VAlign=top> <A href="ForwardContainer.html">Forward Container</A></TD><TD VAlign=top>Lexicographical comparison.  This is a global function, not   a member function.</TD></tr></table><h3>New members</h3>All of <tt>multimap</tt>'s members are defined in the<A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A> and <A href="PairAssociativeContainer.html">Pair Associative Container</A>requirements.  <tt>Multimap</tt> does not introduce any new members.<h3>Notes</h3><P><A name="1">[1]</A><tt>Multimap::iterator</tt> is not a mutable iterator, because<tt>multimap::value_type</tt> is not <A href="Assignable.html">Assignable</A>.  That is, if <tt>i</tt> is oftype <tt>multimap::iterator</tt> and <tt>p</tt> is of type<tt>multimap::value_type</tt>, then <tt>*i = p</tt> is not a validexpression.  However, <tt>multimap::iterator</tt> isn't a constantiterator either, because it can be used to modify the object that itpoints to.  Using the same notation as above, <tt>(*i).second = p</tt>is a valid expression.  The same point applies to<tt>multimap::reverse_iterator</tt>.<P><A name="2">[2]</A>This member function relies on <i>member template</i> functions, whichat present (early 1998) are not supported by all compilers.  If yourcompiler supports member templates, you can call this function withany type of <A href="InputIterator.html">input iterator</A>.  If yourcompiler does not yet support member templates, though, then thearguments must either be of type <tt>const value_type*</tt> or of type<tt>multimap::const_iterator</tt>.<h3>See also</h3><A href="AssociativeContainer.html">Associative Container</A>, <A href="SortedAssociativeContainer.html">Sorted Associative Container</A>, <A href="PairAssociativeContainer.html">Pair Associative Container</A>, <A href="MultipleSortedAssociativeContainer.html">Multiple Sorted Associative Container</A>, <tt><A href="set.html">set</A></tt>, <tt><A href="Map.html">map</A></tt><tt><A href="multiset.html">multiset</A></tt>, <tt><A href="hash_set.html">hash_set</A></tt>, <tt><A href="hash_map.html">hash_map</A></tt>, <tt><A href="hash_multiset.html">hash_multiset</A></tt>, <tt><A href="hash_multimap.html">hash_multimap</A></tt><!--start footer--> <HR SIZE="6"><A href="http://www.sgi.com/"><IMG SRC="surf.gif" HEIGHT="54" WIDTH="54"         ALT="[Silicon Surf]"></A><A HREF="index.html"><IMG SRC="stl_home.gif"         HEIGHT="54" WIDTH="54" ALT="[STL Home]"></A><BR><FONT SIZE="-2"><A href="http://www.sgi.com/Misc/sgi_info.html" TARGET="_top">Copyright &copy; 1999 Silicon Graphics, Inc.</A> All Rights Reserved.</FONT><FONT SIZE="-3"><a href="http://www.sgi.com/Misc/external.list.html" TARGET="_top">TrademarkInformation</A></FONT><P></BODY></HTML>