std::unordered_multimap (3cxx)

Public Types

typedef _Hashtable::key_type key_type

typedef _Hashtable::value_type value_type

typedef _Hashtable::mapped_type mapped_type

typedef _Hashtable::hasher hasher

typedef _Hashtable::key_equal key_equal

typedef _Hashtable::allocator_type allocator_type

typedef _Hashtable::pointer pointer

typedef _Hashtable::const_pointer const_pointer

typedef _Hashtable::reference reference

typedef _Hashtable::const_reference const_reference

typedef _Hashtable::iterator iterator

typedef _Hashtable::const_iterator const_iterator

typedef _Hashtable::local_iterator local_iterator

typedef

_Hashtable::const_local_iterator const_local_iterator"

typedef _Hashtable::size_type size_type

typedef _Hashtable::difference_type difference_type

Public Member Functions

unordered_multimap (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

template<typename _InputIterator > unordered_multimap (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

unordered_multimap (const unordered_multimap &)=default

unordered_multimap (unordered_multimap &&)=default

unordered_multimap (const allocator_type &__a)

unordered_multimap (const unordered_multimap &__ummap, const allocator_type &__a)

unordered_multimap (unordered_multimap &&__ummap, const allocator_type &__a)

unordered_multimap (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

iterator begin () noexcept

local_iterator begin (size_type __n)

size_type bucket (const key_type &__key) const

size_type bucket_count () const noexcept

size_type bucket_size (size_type __n) const

void clear () noexcept

size_type count (const key_type &__x) const

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

local_iterator end (size_type __n)

size_type erase (const key_type &__x)

iterator erase (const_iterator __first, const_iterator __last)

allocator_type get_allocator () const noexcept

hasher hash_function () const

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

void insert (initializer_list< value_type > __l)

key_equal key_eq () const

float load_factor () const noexcept

size_type max_bucket_count () const noexcept

float max_load_factor () const noexcept

void max_load_factor (float __z)

size_type max_size () const noexcept

unordered_multimap & operator= (const unordered_multimap &)=default

unordered_multimap & operator= (unordered_multimap &&)=default

unordered_multimap & operator= (initializer_list< value_type > __l)

void rehash (size_type __n)

void reserve (size_type __n)

size_type size () const noexcept

void swap (unordered_multimap &__x) noexcept(noexcept(_M_h.swap(__x._M_h)))

const_iterator begin () const noexcept

const_iterator cbegin () const noexcept

const_iterator end () const noexcept

const_iterator cend () 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 __hint, const value_type &__x)

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

iterator erase (const_iterator __position)

iterator erase (iterator __it)

iterator find (const key_type &__x)

const_iterator find (const key_type &__x) const

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

std::pair< const_iterator,

const_iterator > equal_range (const key_type &__x) const "

const_local_iterator begin (size_type __n) const

const_local_iterator cbegin (size_type __n) const

const_local_iterator end (size_type __n) const

const_local_iterator cend (size_type __n) const

Friends

template<typename _Key1 , typename _Tp1 , typename _Hash1 , typename _Pred1 , typename _Alloc1 > bool operator== (const unordered_multimap< _Key1, _Tp1, _Hash1, _Pred1, _Alloc1 > &, const unordered_multimap< _Key1, _Tp1, _Hash1, _Pred1, _Alloc1 > &)

template<class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >>class std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >

A standard container composed of equivalent keys (possibly containing multiple of each key value) that associates values of another type with the keys.

Template Parameters:

_Key Type of key objects.

_Tp Type of mapped objects.

_Hash Hashing function object type, defaults to hash<_Value>.

_Pred Predicate function object type, defaults to equal_to<_Value>.

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

Meets the requirements of a container, and unordered associative container

The resulting value type of the container is std::pair<const _Key, _Tp>.

Base is _Hashtable, dispatched at compile time via template alias __ummap_hashtable.

Definition at line 810 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::allocator_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBallocator_type\fP

Public typedefs.

Definition at line 824 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef \fB_Hashtable::const_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_iterator\fP

Iterator-related typedefs.

Definition at line 834 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef \fB_Hashtable::const_local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_local_iterator\fP

Iterator-related typedefs.

Definition at line 836 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::const_pointer \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_pointer\fP

Iterator-related typedefs.

Definition at line 830 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::const_reference \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_reference\fP

Iterator-related typedefs.

Definition at line 832 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::difference_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBdifference_type\fP

Iterator-related typedefs.

Definition at line 838 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::hasher \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBhasher\fP

Public typedefs.

Definition at line 822 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef \fB_Hashtable::iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBiterator\fP

Iterator-related typedefs.

Definition at line 833 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::key_equal \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBkey_equal\fP

Public typedefs.

Definition at line 823 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::key_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBkey_type\fP

Public typedefs.

Definition at line 819 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef \fB_Hashtable::local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBlocal_iterator\fP

Iterator-related typedefs.

Definition at line 835 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::mapped_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBmapped_type\fP

Public typedefs.

Definition at line 821 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::pointer \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBpointer\fP

Iterator-related typedefs.

Definition at line 829 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::reference \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBreference\fP

Iterator-related typedefs.

Definition at line 831 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::size_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBsize_type\fP

Iterator-related typedefs.

Definition at line 837 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> typedef _Hashtable::value_type \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBvalue_type\fP

Public typedefs.

Definition at line 820 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (\fBsize_type\fP__n = \fC10\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP, \fC [explicit]\fP

Default constructor creates no elements.

Parameters:

__n Initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Definition at line 851 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (_InputIterator__f, _InputIterator__l, \fBsize_type\fP__n = \fC0\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP

Builds an unordered_multimap from a range.

Parameters:

__first An input iterator.

__last An input iterator.

__n Minimal initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Create an unordered_multimap consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).

Definition at line 872 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &)\fC [default]\fP

Copy constructor.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (\fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &&)\fC [default]\fP

Move constructor.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (const \fBallocator_type\fP &__a)\fC [inline]\fP, \fC [explicit]\fP

Creates an unordered_multimap with no elements.

Parameters:

__a An allocator object.

Definition at line 891 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_multimap\fP (initializer_list< \fBvalue_type\fP >__l, \fBsize_type\fP__n = \fC0\fP, const \fBhasher\fP &__hf = \fC\fBhasher\fP()\fP, const \fBkey_equal\fP &__eql = \fC\fBkey_equal\fP()\fP, const \fBallocator_type\fP &__a = \fC\fBallocator_type\fP()\fP)\fC [inline]\fP

Builds an unordered_multimap from an initializer_list.

Parameters:

__l An initializer_list.

__n Minimal initial number of buckets.

__hf A hash functor.

__eql A key equality functor.

__a An allocator object.

Create an unordered_multimap consisting of copies of the elements in the list. This is linear in N (where N is __l.size()).

Definition at line 926 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::begin ()\fC [inline]\fP, \fC [noexcept]\fP

Returns a read/write iterator that points to the first element in the unordered_multimap.

Definition at line 990 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::begin () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.

Definition at line 999 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBlocal_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::begin (\fBsize_type\fP__n)\fC [inline]\fP

Returns a read/write iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read/write local iterator.

Definition at line 1339 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::begin (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1350 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the number of buckets of the unordered_multimap.

Definition at line 1306 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::cbegin () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.

Definition at line 1003 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::cbegin (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to the first bucket element.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1354 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::cend () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points one past the last element in the unordered_multimap.

Definition at line 1025 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::cend (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1380 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP

Erases all elements in an unordered_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 1222 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::count (const \fBkey_type\fP &__x) const\fC [inline]\fP

Finds the number of elements.

Parameters:

__x Key to count.

Returns:

Number of elements with specified key.

Definition at line 1283 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename... _Args> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::emplace (_Args &&...__args)\fC [inline]\fP

Attempts to build and insert a std::pair into the unordered_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 pair.

This function attempts to build and insert a (key, value) pair into the unordered_multimap.

Insertion requires amortized constant time.

Definition at line 1048 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename... _Args> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::emplace_hint (\fBconst_iterator\fP__pos, _Args &&...__args)\fC [inline]\fP

Attempts to build and insert a std::pair into the unordered_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 element with key of the std::pair built from __args.

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.

See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html for more on hinting.

Insertion requires amortized constant time.

Definition at line 1074 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> bool \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP

Returns true if the unordered_multimap is empty.

Definition at line 970 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::end ()\fC [inline]\fP, \fC [noexcept]\fP

Returns a read/write iterator that points one past the last element in the unordered_multimap.

Definition at line 1012 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::end () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a read-only (constant) iterator that points one past the last element in the unordered_multimap.

Definition at line 1021 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBlocal_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::end (\fBsize_type\fP__n)\fC [inline]\fP

Returns a read/write iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read/write local iterator.

Definition at line 1365 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_local_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::end (\fBsize_type\fP__n) const\fC [inline]\fP

Returns a read-only (constant) iterator pointing to one past the last bucket elements.

Parameters:

__n The bucket index.

Returns:

A read-only local iterator.

Definition at line 1376 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<\fBiterator\fP, \fBiterator\fP> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range (const \fBkey_type\fP &__x)\fC [inline]\fP

Finds a subsequence matching given key.

Parameters:

__x Key to be located.

Returns:

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

Definition at line 1294 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBstd::pair\fP<\fBconst_iterator\fP, \fBconst_iterator\fP> \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range (const \fBkey_type\fP &__x) const\fC [inline]\fP

Finds a subsequence matching given key.

Parameters:

__x Key to be located.

Returns:

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

Definition at line 1298 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP__position)\fC [inline]\fP

Erases an element from an unordered_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 an unordered_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 1172 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (\fBiterator\fP__it)\fC [inline]\fP

Erases an element from an unordered_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 an unordered_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 1177 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (const \fBkey_type\fP &__x)\fC [inline]\fP

Erases elements according to the provided key.

Parameters:

__x Key of elements to be erased.

Returns:

The number of elements erased.

This function erases all the elements located by the given key from an unordered_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 1193 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP__first, \fBconst_iterator\fP__last)\fC [inline]\fP

Erases a [__first,__last) range of elements from an unordered_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 an unordered_multimap. Note that this function only erases the elements, 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 1212 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x)\fC [inline]\fP

Tries to locate an element in an unordered_multimap.

Parameters:

__x Key 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 element. If unsuccessful it returns the past-the-end ( end() ) iterator.

Definition at line 1269 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBconst_iterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x) const\fC [inline]\fP

Tries to locate an element in an unordered_multimap.

Parameters:

__x Key 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 element. If unsuccessful it returns the past-the-end ( end() ) iterator.

Definition at line 1273 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBallocator_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the allocator object with which the unordered_multimap was constructed.

Definition at line 963 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBhasher\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::hash_function () const\fC [inline]\fP

Returns the hash functor object with which the unordered_multimap was constructed.

Definition at line 1245 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (const \fBvalue_type\fP &__x)\fC [inline]\fP

Inserts a std::pair into the unordered_multimap.

Parameters:

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

Returns:

An iterator that points to the inserted pair.

Insertion requires amortized constant time.

Definition at line 1088 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (_Pair &&__x)\fC [inline]\fP

Inserts a std::pair into the unordered_multimap.

Parameters:

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

Returns:

An iterator that points to the inserted pair.

Insertion requires amortized constant time.

Definition at line 1095 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, const \fBvalue_type\fP &__x)\fC [inline]\fP

Inserts a std::pair into the unordered_multimap.

Parameters:

__hint 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 element with key of __x (may or may not be the pair passed in).

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.

See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html for more on hinting.

Insertion requires amortized constant time.

Definition at line 1120 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> \fBiterator\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, _Pair &&__x)\fC [inline]\fP

Inserts a std::pair into the unordered_multimap.

Parameters:

__hint 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 element with key of __x (may or may not be the pair passed in).

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.

See http://gcc.gnu.org/onlinedocs/libstdc++/manual/bk01pt07ch17.html for more on hinting.

Insertion requires amortized constant time.

Definition at line 1127 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> template<typename _InputIterator > void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _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 1142 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP

Attempts to insert a list of elements into the unordered_multimap.

Parameters:

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

Complexity similar to that of the range constructor.

Definition at line 1154 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBkey_equal\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::key_eq () const\fC [inline]\fP

Returns the key comparison object with which the unordered_multimap was constructed.

Definition at line 1251 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> float \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::load_factor () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the average number of elements per bucket.

Definition at line 1388 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the maximum number of buckets of the unordered_multimap.

Definition at line 1311 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> float \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor () const\fC [inline]\fP, \fC [noexcept]\fP

Returns a positive number that the unordered_multimap tries to keep the load factor less than or equal to.

Definition at line 1394 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor (float__z)\fC [inline]\fP

Change the unordered_multimap maximum load factor.

Parameters:

__z The new maximum load factor.

Definition at line 1402 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the maximum size of the unordered_multimap.

Definition at line 980 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBunordered_multimap\fP& \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (const \fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &)\fC [default]\fP

Copy assignment operator.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBunordered_multimap\fP& \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (\fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &&)\fC [default]\fP

Move assignment operator.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBunordered_multimap\fP& \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP

Unordered_multimap list assignment operator.

Parameters:

__l An initializer_list.

This function fills an unordered_multimap with copies of the elements in the initializer list __l.

Note that the assignment completely changes the unordered_multimap and that the resulting unordered_multimap's size is the same as the number of elements assigned. Old data may be lost.

Definition at line 954 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::rehash (\fBsize_type\fP__n)\fC [inline]\fP

May rehash the unordered_multimap.

Parameters:

__n The new number of buckets.

Rehash will occur only if the new number of buckets respect the unordered_multimap maximum load factor.

Definition at line 1413 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::reserve (\fBsize_type\fP__n)\fC [inline]\fP

Prepare the unordered_multimap for a specified number of elements.

Parameters:

__n Number of elements required.

Same as rehash(ceil(n / max_load_factor())).

Definition at line 1424 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> \fBsize_type\fP \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the size of the unordered_multimap.

Definition at line 975 of file unordered_map.h.

template<class _Key , class _Tp , class _Hash = hash<_Key>, class _Pred = std::equal_to<_Key>, class _Alloc = std::allocator<std::pair<const _Key, _Tp> >> void \fBstd::unordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::swap (\fBunordered_multimap\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x)\fC [inline]\fP, \fC [noexcept]\fP

Swaps data with another unordered_multimap.

Parameters:

__x An unordered_multimap of the same element and allocator types.

This exchanges the elements between two unordered_multimap in constant time. Note that the global std::swap() function is specialized such that std::swap(m1,m2) will feed to this function.

Definition at line 1236 of file unordered_map.h.

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