.TH "std::multimap< _Key, _Tp, _Compare, _Alloc >" 3cxx "Fri Dec 19 2014" "libstdc++" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::multimap< _Key, _Tp, _Compare, _Alloc > \- 
.SH SYNOPSIS
.br
.PP
.SS "Public Types"

.in +1c
.ti -1c
.RI "typedef _Alloc \fBallocator_type\fP"
.br
.ti -1c
.RI "typedef _Rep_type::const_iterator \fBconst_iterator\fP"
.br
.ti -1c
.RI "typedef 
.br
_Pair_alloc_type::const_pointer \fBconst_pointer\fP"
.br
.ti -1c
.RI "typedef 
.br
_Pair_alloc_type::const_reference \fBconst_reference\fP"
.br
.ti -1c
.RI "typedef 
.br
\fB_Rep_type::const_reverse_iterator\fP \fBconst_reverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Rep_type::difference_type \fBdifference_type\fP"
.br
.ti -1c
.RI "typedef _Rep_type::iterator \fBiterator\fP"
.br
.ti -1c
.RI "typedef _Compare \fBkey_compare\fP"
.br
.ti -1c
.RI "typedef _Key \fBkey_type\fP"
.br
.ti -1c
.RI "typedef _Tp \fBmapped_type\fP"
.br
.ti -1c
.RI "typedef _Pair_alloc_type::pointer \fBpointer\fP"
.br
.ti -1c
.RI "typedef _Pair_alloc_type::reference \fBreference\fP"
.br
.ti -1c
.RI "typedef \fB_Rep_type::reverse_iterator\fP \fBreverse_iterator\fP"
.br
.ti -1c
.RI "typedef _Rep_type::size_type \fBsize_type\fP"
.br
.ti -1c
.RI "typedef \fBstd::pair\fP< const _Key, 
.br
_Tp > \fBvalue_type\fP"
.br
.in -1c
.SS "Public Member Functions"

.in +1c
.ti -1c
.RI "\fBmultimap\fP ()"
.br
.ti -1c
.RI "\fBmultimap\fP (const _Compare &__comp, const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "\fBmultimap\fP (const \fBmultimap\fP &__x)"
.br
.ti -1c
.RI "\fBmultimap\fP (\fBmultimap\fP &&__x) noexcept(is_nothrow_copy_constructible< _Compare >::value)"
.br
.ti -1c
.RI "\fBmultimap\fP (initializer_list< \fBvalue_type\fP > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBmultimap\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "template<typename _InputIterator > \fBmultimap\fP (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())"
.br
.ti -1c
.RI "iterator \fBbegin\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_iterator \fBcbegin\fP () const noexcept"
.br
.ti -1c
.RI "const_iterator \fBcend\fP () const noexcept"
.br
.ti -1c
.RI "void \fBclear\fP () noexcept"
.br
.ti -1c
.RI "size_type \fBcount\fP (const key_type &__x) const "
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBcrend\fP () const noexcept"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace\fP (_Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "template<typename\&.\&.\&. _Args> iterator \fBemplace_hint\fP (const_iterator __pos, _Args &&\&.\&.\&.__args)"
.br
.ti -1c
.RI "bool \fBempty\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBend\fP () noexcept"
.br
.ti -1c
.RI "const_iterator \fBend\fP () const noexcept"
.br
.ti -1c
.RI "\fBstd::pair\fP< iterator, iterator > \fBequal_range\fP (const key_type &__x)"
.br
.ti -1c
.RI "\fBstd::pair\fP< const_iterator, 
.br
const_iterator > \fBequal_range\fP (const key_type &__x) const "
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __position)"
.br
.ti -1c
.RI "_GLIBCXX_ABI_TAG_CXX11 iterator \fBerase\fP (iterator __position)"
.br
.ti -1c
.RI "size_type \fBerase\fP (const key_type &__x)"
.br
.ti -1c
.RI "iterator \fBerase\fP (const_iterator __first, const_iterator __last)"
.br
.ti -1c
.RI "iterator \fBfind\fP (const key_type &__x)"
.br
.ti -1c
.RI "const_iterator \fBfind\fP (const key_type &__x) const "
.br
.ti -1c
.RI "allocator_type \fBget_allocator\fP () const noexcept"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const \fBvalue_type\fP &__x)"
.br
.ti -1c
.RI "template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> iterator \fBinsert\fP (_Pair &&__x)"
.br
.ti -1c
.RI "iterator \fBinsert\fP (const_iterator __position, const \fBvalue_type\fP &__x)"
.br
.ti -1c
.RI "template<typename _Pair , typename  = typename std::enable_if<std::is_constructible<value_type,						    _Pair&&>::value>::type> iterator \fBinsert\fP (const_iterator __position, _Pair &&__x)"
.br
.ti -1c
.RI "template<typename _InputIterator > void \fBinsert\fP (_InputIterator __first, _InputIterator __last)"
.br
.ti -1c
.RI "void \fBinsert\fP (initializer_list< \fBvalue_type\fP > __l)"
.br
.ti -1c
.RI "key_compare \fBkey_comp\fP () const "
.br
.ti -1c
.RI "iterator \fBlower_bound\fP (const key_type &__x)"
.br
.ti -1c
.RI "const_iterator \fBlower_bound\fP (const key_type &__x) const "
.br
.ti -1c
.RI "size_type \fBmax_size\fP () const noexcept"
.br
.ti -1c
.RI "\fBmultimap\fP & \fBoperator=\fP (const \fBmultimap\fP &__x)"
.br
.ti -1c
.RI "\fBmultimap\fP & \fBoperator=\fP (\fBmultimap\fP &&__x)"
.br
.ti -1c
.RI "\fBmultimap\fP & \fBoperator=\fP (initializer_list< \fBvalue_type\fP > __l)"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrbegin\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrbegin\fP () const noexcept"
.br
.ti -1c
.RI "\fBreverse_iterator\fP \fBrend\fP () noexcept"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fP \fBrend\fP () const noexcept"
.br
.ti -1c
.RI "size_type \fBsize\fP () const noexcept"
.br
.ti -1c
.RI "void \fBswap\fP (\fBmultimap\fP &__x)"
.br
.ti -1c
.RI "iterator \fBupper_bound\fP (const key_type &__x)"
.br
.ti -1c
.RI "const_iterator \fBupper_bound\fP (const key_type &__x) const "
.br
.ti -1c
.RI "value_compare \fBvalue_comp\fP () const "
.br
.in -1c
.SS "Friends"

.in +1c
.ti -1c
.RI "template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool \fBoperator<\fP (const \fBmultimap\fP< _K1, _T1, _C1, _A1 > &, const \fBmultimap\fP< _K1, _T1, _C1, _A1 > &)"
.br
.ti -1c
.RI "template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool \fBoperator==\fP (const \fBmultimap\fP< _K1, _T1, _C1, _A1 > &, const \fBmultimap\fP< _K1, _T1, _C1, _A1 > &)"
.br
.in -1c
.SH "Detailed Description"
.PP 

.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >>class std::multimap< _Key, _Tp, _Compare, _Alloc >"
A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time\&. 


.PP
\fBTemplate Parameters:\fP
.RS 4
\fI_Key\fP Type of key objects\&. 
.br
\fI_Tp\fP Type of mapped objects\&. 
.br
\fI_Compare\fP Comparison function object type, defaults to less<_Key>\&. 
.br
\fI_Alloc\fP Allocator type, defaults to allocator<pair<const _Key, _Tp>\&.
.RE
.PP
Meets the requirements of a \fCcontainer\fP, a \fCreversible container\fP, and an \fCassociative container\fP (using equivalent keys)\&. For a \fCmultimap<Key,T>\fP the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>\&.
.PP
Multimaps support bidirectional iterators\&.
.PP
The private tree data is declared exactly the same way for map and multimap; the distinction is made entirely in how the tree functions are called (*_unique versus *_equal, same as the standard)\&. 
.PP
Definition at line 95 of file stl_multimap\&.h\&.
.SH "Constructor & Destructor Documentation"
.PP 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP ()\fC [inline]\fP"

.PP
Default constructor creates no elements\&. 
.PP
Definition at line 157 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (const _Compare &__comp, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP, \fC [explicit]\fP"

.PP
Creates a multimap with no elements\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__comp\fP A comparison object\&. 
.br
\fI__a\fP An allocator object\&. 
.RE
.PP

.PP
Definition at line 166 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (const \fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &__x)\fC [inline]\fP"

.PP
Multimap copy constructor\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A multimap of identical element and allocator types\&.
.RE
.PP
The newly-created multimap uses a copy of the allocation object used by \fI__x\fP\&. 
.PP
Definition at line 177 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (\fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &&__x)\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Multimap move constructor\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A multimap of identical element and allocator types\&.
.RE
.PP
The newly-created multimap contains the exact contents of \fI__x\fP\&. The contents of \fI__x\fP are a valid, but unspecified multimap\&. 
.PP
Definition at line 188 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (initializer_list< \fBvalue_type\fP >__l, const _Compare &__comp = \fC_Compare()\fP, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a multimap from an initializer_list\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__l\fP An initializer_list\&. 
.br
\fI__comp\fP A comparison functor\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create a multimap consisting of copies of the elements from the initializer_list\&. This is linear in N if the list is already sorted, and NlogN otherwise (where N is \fI__l\&.size()\fP)\&. 
.PP
Definition at line 202 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (_InputIterator__first, _InputIterator__last)\fC [inline]\fP"

.PP
Builds a multimap from a range\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP An input iterator\&. 
.br
\fI__last\fP An input iterator\&.
.RE
.PP
Create a multimap consisting of copies of the elements from [__first,__last)\&. This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last))\&. 
.PP
Definition at line 219 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::\fBmultimap\fP (_InputIterator__first, _InputIterator__last, const _Compare &__comp, const allocator_type &__a = \fCallocator_type()\fP)\fC [inline]\fP"

.PP
Builds a multimap from a range\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP An input iterator\&. 
.br
\fI__last\fP An input iterator\&. 
.br
\fI__comp\fP A comparison functor\&. 
.br
\fI__a\fP An allocator object\&.
.RE
.PP
Create a multimap consisting of copies of the elements from [__first,__last)\&. This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(__first,__last))\&. 
.PP
Definition at line 235 of file stl_multimap\&.h\&.
.SH "Member Function Documentation"
.PP 
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write iterator that points to the first pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 314 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points to the first pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 323 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points to the first pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 387 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points one past the last pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 396 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP"
Erases all elements in a multimap\&. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 697 of file stl_multimap\&.h\&.
.PP
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::count (const key_type &__x) const\fC [inline]\fP"

.PP
Finds the number of elements with given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Number of elements with specified key\&. 
.RE
.PP

.PP
Definition at line 754 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::crbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to the last pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 405 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::crend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 414 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename\&.\&.\&. _Args> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::emplace (_Args &&\&.\&.\&.__args)\fC [inline]\fP"

.PP
Build and insert a std::pair into the multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__args\fP Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor)\&.
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted (key,value) pair\&.
.RE
.PP
This function builds and inserts a (key, value) pair into the multimap\&. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 454 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename\&.\&.\&. _Args> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::emplace_hint (const_iterator__pos, _Args &&\&.\&.\&.__args)\fC [inline]\fP"

.PP
Builds and inserts a std::pair into the multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__pos\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__args\fP Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted (key,value) pair\&.
.RE
.PP
This function inserts a (key, value) pair into the multimap\&. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
For more on \fIhinting\fP, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 481 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> bool \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns true if the multimap is empty\&. 
.PP
Definition at line 421 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write iterator that points one past the last pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 332 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) iterator that points one past the last pair in the multimap\&. Iteration is done in ascending order according to the keys\&. 
.PP
Definition at line 341 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<iterator, iterator> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const key_type &__x)\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&. 
.PP
Definition at line 821 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<const_iterator, const_iterator> \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::equal_range (const key_type &__x) const\fC [inline]\fP"

.PP
Finds a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pairs to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Pair of read-only (constant) iterators that possibly points to the subsequence matching given key\&.
.RE
.PP
This function is equivalent to 
.PP
.nf
std::make_pair(c\&.lower_bound(val),
               c\&.upper_bound(val))

.fi
.PP
 (but is faster than making the calls separately)\&. 
.PP
Definition at line 838 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator__position)\fC [inline]\fP"

.PP
Erases an element from a multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator pointing to the element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator pointing to the element immediately following \fIposition\fP prior to the element being erased\&. If no such element exists, end() is returned\&.
.RE
.PP
This function erases an element, pointed to by the given iterator, from a multimap\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 595 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::erase (const key_type &__x)\fC [inline]\fP"

.PP
Erases elements according to the provided key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of element to be erased\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
The number of elements erased\&.
.RE
.PP
This function erases all elements located by the given key from a multimap\&. Note that this function only erases the element, and that if the element is itself a pointer, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 631 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::erase (const_iterator__first, const_iterator__last)\fC [inline]\fP"

.PP
Erases a [first,last) range of elements from a multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be erased\&. 
.br
\fI__last\fP Iterator pointing to the end of the range to be erased \&. 
.RE
.PP
\fBReturns:\fP
.RS 4
The iterator \fI__last\fP\&.
.RE
.PP
This function erases a sequence of elements from a multimap\&. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
Definition at line 652 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::find (const key_type &__x)\fC [inline]\fP"

.PP
Tries to locate an element in a multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns an iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 730 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::find (const key_type &__x) const\fC [inline]\fP"

.PP
Tries to locate an element in a multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to sought-after element, or end() if not found\&.
.RE
.PP
This function takes a key and tries to locate the element with which the key matches\&. If successful the function returns a constant iterator pointing to the sought after pair\&. If unsuccessful it returns the past-the-end ( \fCend()\fP ) iterator\&. 
.PP
Definition at line 745 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> allocator_type \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP"

.PP
Get a copy of the memory allocation object\&. 
.PP
Definition at line 304 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::insert (const \fBvalue_type\fP &__x)\fC [inline]\fP"

.PP
Inserts a std::pair into the multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted (key,value) pair\&.
.RE
.PP
This function inserts a (key, value) pair into the multimap\&. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted\&.
.PP
Insertion requires logarithmic time\&. 
.PP
Definition at line 501 of file stl_multimap\&.h\&.
.PP
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::insert(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::insert (const_iterator__position, const \fBvalue_type\fP &__x)\fC [inline]\fP"

.PP
Inserts a std::pair into the multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__position\fP An iterator that serves as a hint as to where the pair should be inserted\&. 
.br
\fI__x\fP Pair to be inserted (see std::make_pair for easy creation of pairs)\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
An iterator that points to the inserted (key,value) pair\&.
.RE
.PP
This function inserts a (key, value) pair into the multimap\&. Contrary to a std::map the multimap does not rely on unique keys and thus multiple pairs with the same key can be inserted\&. Note that the first parameter is only a hint and can potentially improve the performance of the insertion process\&. A bad hint would cause no gains in efficiency\&.
.PP
For more on \fIhinting\fP, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html
.PP
Insertion requires logarithmic time (if the hint is not taken)\&. 
.PP
Definition at line 535 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > void \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::insert (_InputIterator__first, _InputIterator__last)\fC [inline]\fP"

.PP
A template function that attempts to insert a range of elements\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__first\fP Iterator pointing to the start of the range to be inserted\&. 
.br
\fI__last\fP Iterator pointing to the end of the range\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.PP
Definition at line 562 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::insert (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP"

.PP
Attempts to insert a list of std::pairs into the multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__l\fP A std::initializer_list<value_type> of pairs to be inserted\&.
.RE
.PP
Complexity similar to that of the range constructor\&. 
.PP
Definition at line 574 of file stl_multimap\&.h\&.
.PP
References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> key_compare \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::key_comp () const\fC [inline]\fP"
Returns the key comparison object out of which the multimap was constructed\&. 
.PP
Definition at line 706 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const key_type &__x)\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful it returns an iterator pointing to the first element that has a greater value than given key or end() if no such element exists\&. 
.PP
Definition at line 769 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::lower_bound (const key_type &__x) const\fC [inline]\fP"

.PP
Finds the beginning of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first element equal to or greater than key, or end()\&.
.RE
.PP
This function returns the first element of a subsequence of elements that matches the given key\&. If unsuccessful the iterator will point to the next greatest element or, if no such greater element exists, to end()\&. 
.PP
Definition at line 784 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns the maximum size of the multimap\&. 
.PP
Definition at line 431 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmultimap\fP& \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::operator= (const \fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &__x)\fC [inline]\fP"

.PP
Multimap assignment operator\&. The dtor only erases the elements, and note that if the elements themselves are pointers, the pointed-to memory is not touched in any way\&. Managing the pointer is the user's responsibility\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A multimap of identical element and allocator types\&.
.RE
.PP
All the elements of \fI__x\fP are copied, but unlike the copy constructor, the allocator object is not copied\&. 
.PP
Definition at line 258 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmultimap\fP& \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::operator= (\fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &&__x)\fC [inline]\fP"

.PP
Multimap move assignment operator\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A multimap of identical element and allocator types\&.
.RE
.PP
The contents of \fI__x\fP are moved into this multimap (without copying)\&. \fI__x\fP is a valid, but unspecified multimap\&. 
.PP
Definition at line 273 of file stl_multimap\&.h\&.
.PP
References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::swap()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBmultimap\fP& \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::operator= (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP"

.PP
Multimap list assignment operator\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__l\fP An initializer_list\&.
.RE
.PP
This function fills a multimap with copies of the elements in the initializer list \fI__l\fP\&.
.PP
Note that the assignment completely changes the multimap and that the resulting multimap's size is the same as the number of elements assigned\&. Old data may be lost\&. 
.PP
Definition at line 294 of file stl_multimap\&.h\&.
.PP
References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::insert()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBreverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::rbegin ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write reverse iterator that points to the last pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 350 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::rbegin () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to the last pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 359 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBreverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::rend ()\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read/write reverse iterator that points to one before the first pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 368 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_reverse_iterator\fP \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::rend () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns a read-only (constant) reverse iterator that points to one before the first pair in the multimap\&. Iteration is done in descending order according to the keys\&. 
.PP
Definition at line 377 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> size_type \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP"
Returns the size of the multimap\&. 
.PP
Definition at line 426 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::swap (\fBmultimap\fP< _Key, _Tp, _Compare, _Alloc > &__x)\fC [inline]\fP"

.PP
Swaps data with another multimap\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP A multimap of the same element and allocator types\&.
.RE
.PP
This exchanges the elements between two multimaps in constant time\&. (It is only swapping a pointer, an integer, and an instance of the \fCCompare\fP type (which itself is often stateless and empty), so it should be quite fast\&.) Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function\&. 
.PP
Definition at line 687 of file stl_multimap\&.h\&.
.PP
Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=(), and std::swap()\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type &__x)\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Iterator pointing to the first element greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 794 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> const_iterator \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::upper_bound (const key_type &__x) const\fC [inline]\fP"

.PP
Finds the end of a subsequence matching given key\&. 
.PP
\fBParameters:\fP
.RS 4
\fI__x\fP Key of (key, value) pair to be located\&. 
.RE
.PP
\fBReturns:\fP
.RS 4
Read-only (constant) iterator pointing to first iterator greater than key, or end()\&. 
.RE
.PP

.PP
Definition at line 804 of file stl_multimap\&.h\&.
.SS "template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>, typename _Alloc = std::allocator<std::pair<const _Key, _Tp> >> value_compare \fBstd::multimap\fP< _Key, _Tp, _Compare, _Alloc >::value_comp () const\fC [inline]\fP"
Returns a value comparison object, built from the key comparison object out of which the multimap was constructed\&. 
.PP
Definition at line 714 of file stl_multimap\&.h\&.

.SH "Author"
.PP 
Generated automatically by Doxygen for libstdc++ from the source code\&.