std::multimap (3cxx)

Public Types

typedef _Alloc allocator_type

typedef _Rep_type::const_iterator const_iterator

typedef

_Alloc_traits::const_pointer const_pointer"

typedef

_Alloc_traits::const_reference const_reference"

typedef

_Rep_type::const_reverse_iterator const_reverse_iterator"

typedef _Rep_type::difference_type difference_type

typedef _Rep_type::iterator iterator

typedef _Compare key_compare

typedef _Key key_type

typedef _Tp mapped_type

typedef _Alloc_traits::pointer pointer

typedef _Alloc_traits::reference reference

typedef _Rep_type::reverse_iterator reverse_iterator

typedef _Rep_type::size_type size_type

typedef std::pair< const _Key,

_Tp > value_type"

Public Member Functions

multimap ()

multimap (const _Compare &__comp, const allocator_type &__a=allocator_type())

multimap (const multimap &__x)

multimap (multimap &&__x) noexcept(is_nothrow_copy_constructible< _Compare >::value)

multimap (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())

multimap (const allocator_type &__a)

multimap (const multimap &__m, const allocator_type &__a)

multimap (multimap &&__m, const allocator_type &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())

multimap (initializer_list< value_type > __l, const allocator_type &__a)

template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last, const allocator_type &__a)

template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last)

template<typename _InputIterator > multimap (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())

iterator begin () noexcept

const_iterator begin () const noexcept

const_iterator cbegin () const noexcept

const_iterator cend () const noexcept

void clear () noexcept

size_type count (const key_type &__x) const

const_reverse_iterator crbegin () const noexcept

const_reverse_iterator crend () const noexcept

template<typename... _Args> iterator emplace (_Args &&...__args)

template<typename... _Args> iterator emplace_hint (const_iterator __pos, _Args &&...__args)

bool empty () const noexcept

iterator end () noexcept

const_iterator end () const noexcept

std::pair< iterator, iterator > equal_range (const key_type &__x)

std::pair< const_iterator,

const_iterator > equal_range (const key_type &__x) const "

iterator erase (const_iterator __position)

_GLIBCXX_ABI_TAG_CXX11 iterator erase (iterator __position)

size_type erase (const key_type &__x)

iterator erase (const_iterator __first, const_iterator __last)

iterator find (const key_type &__x)

const_iterator find (const key_type &__x) const

allocator_type get_allocator () const noexcept

iterator insert (const value_type &__x)

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> iterator insert (_Pair &&__x)

iterator insert (const_iterator __position, const value_type &__x)

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> iterator insert (const_iterator __position, _Pair &&__x)

template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last)

void insert (initializer_list< value_type > __l)

key_compare key_comp () const

iterator lower_bound (const key_type &__x)

const_iterator lower_bound (const key_type &__x) const

size_type max_size () const noexcept

multimap & operator= (const multimap &__x)

multimap & operator= (multimap &&__x) noexcept(_Alloc_traits::_S_nothrow_move())

multimap & operator= (initializer_list< value_type > __l)

reverse_iterator rbegin () noexcept

const_reverse_iterator rbegin () const noexcept

reverse_iterator rend () noexcept

const_reverse_iterator rend () const noexcept

size_type size () const noexcept

void swap (multimap &__x) noexcept(_Alloc_traits::_S_nothrow_swap())

iterator upper_bound (const key_type &__x)

const_iterator upper_bound (const key_type &__x) const

value_compare value_comp () const

Friends

template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool operator< (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &)

template<typename _K1 , typename _T1 , typename _C1 , typename _A1 > bool operator== (const multimap< _K1, _T1, _C1, _A1 > &, const multimap< _K1, _T1, _C1, _A1 > &)

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.

Template Parameters:

_Key Type of key objects.

_Tp Type of mapped objects.

_Compare Comparison function object type, defaults to less<_Key>.

_Alloc Allocator type, defaults to allocator<pair<const _Key, _Tp>.

Meets the requirements of a container, a reversible container, and an associative container (using equivalent keys). For a multimap<Key,T> the key_type is Key, the mapped_type is T, and the value_type is std::pair<const Key,T>.

Multimaps support bidirectional iterators.

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).

Definition at line 95 of file stl_multimap.h.

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

Default constructor creates no elements.

Definition at line 160 of file stl_multimap.h.

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

Creates a multimap with no elements.

Parameters:

__comp A comparison object.

__a An allocator object.

Definition at line 169 of file stl_multimap.h.

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

Multimap copy constructor.

Parameters:

__x A multimap of identical element and allocator types.

The newly-created multimap uses a copy of the allocation object used by __x.

Definition at line 180 of file stl_multimap.h.

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

Multimap move constructor.

Parameters:

__x A multimap of identical element and allocator types.

The newly-created multimap contains the exact contents of __x. The contents of __x are a valid, but unspecified multimap.

Definition at line 191 of file stl_multimap.h.

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

Builds a multimap from an initializer_list.

Parameters:

__l An initializer_list.

__comp A comparison functor.

__a An allocator object.

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 __l.size()).

Definition at line 205 of file stl_multimap.h.

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 allocator_type &__a)\fC [inline]\fP, \fC [explicit]\fP

Allocator-extended default constructor.

Definition at line 213 of file stl_multimap.h.

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 > &__m, const allocator_type &__a)\fC [inline]\fP

Allocator-extended copy constructor.

Definition at line 217 of file stl_multimap.h.

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 > &&__m, const allocator_type &__a)\fC [inline]\fP, \fC [noexcept]\fP

Allocator-extended move constructor.

Definition at line 221 of file stl_multimap.h.

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 allocator_type &__a)\fC [inline]\fP

Allocator-extended initialier-list constructor.

Definition at line 227 of file stl_multimap.h.

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 allocator_type &__a)\fC [inline]\fP

Allocator-extended range constructor.

Definition at line 233 of file stl_multimap.h.

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

Builds a multimap from a range.

Parameters:

__first An input iterator.

__last An input iterator.

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)).

Definition at line 249 of file stl_multimap.h.

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

Builds a multimap from a range.

Parameters:

__first An input iterator.

__last An input iterator.

__comp A comparison functor.

__a An allocator object.

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)).

Definition at line 265 of file stl_multimap.h.

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.

Definition at line 350 of file stl_multimap.h.

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.

Definition at line 359 of file stl_multimap.h.

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.

Definition at line 423 of file stl_multimap.h.

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.

Definition at line 432 of file stl_multimap.h.

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.

Definition at line 736 of file stl_multimap.h.

Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=().

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

Finds the number of elements with given key.

Parameters:

__x Key of (key, value) pairs to be located.

Returns:

Number of elements with specified key.

Definition at line 793 of file stl_multimap.h.

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.

Definition at line 441 of file stl_multimap.h.

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.

Definition at line 450 of file stl_multimap.h.

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

Build and insert a std::pair into the multimap.

Parameters:

__args Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor).

Returns:

An iterator that points to the inserted (key,value) pair.

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.

Insertion requires logarithmic time.

Definition at line 490 of file stl_multimap.h.

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

Builds and inserts a std::pair into the multimap.

Parameters:

__pos An iterator that serves as a hint as to where the pair should be inserted.

__args Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor).

Returns:

An iterator that points to the inserted (key,value) pair.

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.

For more on hinting, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html

Insertion requires logarithmic time (if the hint is not taken).

Definition at line 517 of file stl_multimap.h.

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.

Definition at line 457 of file stl_multimap.h.

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.

Definition at line 368 of file stl_multimap.h.

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.

Definition at line 377 of file stl_multimap.h.

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

Finds a subsequence matching given key.

Parameters:

__x Key of (key, value) pairs to be located.

Returns:

Pair of iterators that possibly points to the subsequence matching given key.

This function is equivalent to

std::make_pair(c.lower_bound(val),
               c.upper_bound(val))

(but is faster than making the calls separately).

Definition at line 860 of file stl_multimap.h.

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

Finds a subsequence matching given key.

Parameters:

__x Key of (key, value) pairs to be located.

Returns:

Pair of read-only (constant) iterators that possibly points to the subsequence matching given key.

This function is equivalent to

std::make_pair(c.lower_bound(val),
               c.upper_bound(val))

(but is faster than making the calls separately).

Definition at line 877 of file stl_multimap.h.

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

Erases an element from a multimap.

Parameters:

__position An iterator pointing to the element to be erased.

Returns:

An iterator pointing to the element immediately following position prior to the element being erased. If no such element exists, end() is returned.

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.

Definition at line 631 of file stl_multimap.h.

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

Erases elements according to the provided key.

Parameters:

__x Key of element to be erased.

Returns:

The number of elements erased.

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.

Definition at line 667 of file stl_multimap.h.

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

Erases a [first,last) range of elements from a multimap.

Parameters:

__first Iterator pointing to the start of the range to be erased.

__last Iterator pointing to the end of the range to be erased .

Returns:

The iterator __last.

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.

Definition at line 688 of file stl_multimap.h.

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

Tries to locate an element in a multimap.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Iterator pointing to sought-after element, or end() if not found.

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 ( end() ) iterator.

Definition at line 769 of file stl_multimap.h.

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

Tries to locate an element in a multimap.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Read-only (constant) iterator pointing to sought-after element, or end() if not found.

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 ( end() ) iterator.

Definition at line 784 of file stl_multimap.h.

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

Get a copy of the memory allocation object.

Definition at line 340 of file stl_multimap.h.

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

Inserts a std::pair into the multimap.

Parameters:

__x Pair to be inserted (see std::make_pair for easy creation of pairs).

Returns:

An iterator that points to the inserted (key,value) pair.

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.

Insertion requires logarithmic time.

Definition at line 537 of file stl_multimap.h.

Referenced by std::multimap< _Key, _Tp, _Compare, _Alloc >::insert(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::operator=().

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

Inserts a std::pair into the multimap.

Parameters:

__position An iterator that serves as a hint as to where the pair should be inserted.

__x Pair to be inserted (see std::make_pair for easy creation of pairs).

Returns:

An iterator that points to the inserted (key,value) pair.

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.

For more on hinting, see: http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html

Insertion requires logarithmic time (if the hint is not taken).

Definition at line 571 of file stl_multimap.h.

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

A template function that attempts to insert a range of elements.

Parameters:

__first Iterator pointing to the start of the range to be inserted.

__last Iterator pointing to the end of the range.

Complexity similar to that of the range constructor.

Definition at line 598 of file stl_multimap.h.

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

Attempts to insert a list of std::pairs into the multimap.

Parameters:

__l A std::initializer_list<value_type> of pairs to be inserted.

Complexity similar to that of the range constructor.

Definition at line 610 of file stl_multimap.h.

References std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().

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.

Definition at line 745 of file stl_multimap.h.

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

Finds the beginning of a subsequence matching given key.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Iterator pointing to first element equal to or greater than key, or end().

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.

Definition at line 808 of file stl_multimap.h.

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

Finds the beginning of a subsequence matching given key.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Read-only (constant) iterator pointing to first element equal to or greater than key, or end().

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().

Definition at line 823 of file stl_multimap.h.

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.

Definition at line 467 of file stl_multimap.h.

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

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.

Parameters:

__x A multimap of identical element and allocator types.

All the elements of __x are copied, but unlike the copy constructor, the allocator object is not copied.

Definition at line 288 of file stl_multimap.h.

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, \fC [noexcept]\fP

Multimap move assignment operator.

Parameters:

__x A multimap of identical element and allocator types.

The contents of __x are moved into this multimap (without copying if the allocators compare equal or get moved on assignment). Afterwards __x is in a valid, but unspecified state.

Definition at line 304 of file stl_multimap.h.

References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().

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

Multimap list assignment operator.

Parameters:

__l An initializer_list.

This function fills a multimap with copies of the elements in the initializer list __l.

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.

Definition at line 330 of file stl_multimap.h.

References std::multimap< _Key, _Tp, _Compare, _Alloc >::clear(), and std::multimap< _Key, _Tp, _Compare, _Alloc >::insert().

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.

Definition at line 386 of file stl_multimap.h.

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.

Definition at line 395 of file stl_multimap.h.

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.

Definition at line 404 of file stl_multimap.h.

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.

Definition at line 413 of file stl_multimap.h.

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.

Definition at line 462 of file stl_multimap.h.

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, \fC [noexcept]\fP

Swaps data with another multimap.

Parameters:

__x A multimap of the same element and allocator types.

This exchanges the elements between two multimaps in constant time. (It is only swapping a pointer, an integer, and an instance of the Compare 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.

Definition at line 723 of file stl_multimap.h.

Referenced by std::swap().

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

Finds the end of a subsequence matching given key.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Iterator pointing to the first element greater than key, or end().

Definition at line 833 of file stl_multimap.h.

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

Finds the end of a subsequence matching given key.

Parameters:

__x Key of (key, value) pair to be located.

Returns:

Read-only (constant) iterator pointing to first iterator greater than key, or end().

Definition at line 843 of file stl_multimap.h.

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.

Definition at line 753 of file stl_multimap.h.

Generated automatically by Doxygen for libstdc++ from the source code.