std::unordered_map (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_map (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())

template<typename _InputIterator > unordered_map (_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_map (const unordered_map &)=default

unordered_map (unordered_map &&)=default

unordered_map (const allocator_type &__a)

unordered_map (const unordered_map &__umap, const allocator_type &__a)

unordered_map (unordered_map &&__umap, const allocator_type &__a)

unordered_map (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> std::pair< iterator, bool > 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_map & operator= (const unordered_map &)=default

unordered_map & operator= (unordered_map &&)=default

unordered_map & operator= (initializer_list< value_type > __l)

void rehash (size_type __n)

void reserve (size_type __n)

size_type size () const noexcept

void swap (unordered_map &__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

std::pair< iterator, bool > insert (const value_type &__x)

template<typename _Pair , typename = typename std::enable_if<std::is_constructible<value_type, _Pair&&>::value>::type> std::pair< iterator, bool > 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 "

mapped_type & operator[] (const key_type &__k)

mapped_type & operator[] (key_type &&__k)

mapped_type & at (const key_type &__k)

const mapped_type & at (const key_type &__k) 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_map< _Key1, _Tp1, _Hash1, _Pred1, _Alloc1 > &, const unordered_map< _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_map< _Key, _Tp, _Hash, _Pred, _Alloc >

A standard container composed of unique keys (containing at most one 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 __umap_hashtable.

Definition at line 98 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBallocator_type\fP

Public typedefs.

Definition at line 112 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_iterator\fP

Iterator-related typedefs.

Definition at line 122 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_local_iterator\fP

Iterator-related typedefs.

Definition at line 124 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_pointer\fP

Iterator-related typedefs.

Definition at line 118 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBconst_reference\fP

Iterator-related typedefs.

Definition at line 120 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBdifference_type\fP

Iterator-related typedefs.

Definition at line 126 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBhasher\fP

Public typedefs.

Definition at line 110 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBiterator\fP

Iterator-related typedefs.

Definition at line 121 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBkey_equal\fP

Public typedefs.

Definition at line 111 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBkey_type\fP

Public typedefs.

Definition at line 107 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBlocal_iterator\fP

Iterator-related typedefs.

Definition at line 123 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBmapped_type\fP

Public typedefs.

Definition at line 109 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBpointer\fP

Iterator-related typedefs.

Definition at line 117 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBreference\fP

Iterator-related typedefs.

Definition at line 119 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBsize_type\fP

Iterator-related typedefs.

Definition at line 125 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBvalue_type\fP

Public typedefs.

Definition at line 108 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\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 139 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\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_map 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_map consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).

Definition at line 160 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\fP (const \fBunordered_map\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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\fP (\fBunordered_map\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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\fP (const \fBallocator_type\fP &__a)\fC [inline]\fP, \fC [explicit]\fP

Creates an unordered_map with no elements.

Parameters:

__a An allocator object.

Definition at line 179 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::\fBunordered_map\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_map 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_map consisting of copies of the elements in the list. This is linear in N (where N is __l.size()).

Definition at line 214 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> >> \fBmapped_type\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::at (const \fBkey_type\fP &__k)\fC [inline]\fP

Access to unordered_map data.

Parameters:

__k The key for which data should be retrieved.

Returns:

A reference to the data whose key is equal to __k, if such a data is present in the unordered_map.

Exceptions:

std::out_of_range If no such data is present.

Definition at line 643 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> >> const \fBmapped_type\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::at (const \fBkey_type\fP &__k) const\fC [inline]\fP

Access to unordered_map data.

Parameters:

__k The key for which data should be retrieved.

Returns:

A reference to the data whose key is equal to __k, if such a data is present in the unordered_map.

Exceptions:

std::out_of_range If no such data is present.

Definition at line 647 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_map\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_map.

Definition at line 278 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_map\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_map.

Definition at line 287 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_map\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 688 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_map\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 699 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::bucket_count () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the number of buckets of the unordered_map.

Definition at line 655 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_map\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_map.

Definition at line 291 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_map\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 703 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_map\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_map.

Definition at line 313 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_map\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 729 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::clear ()\fC [inline]\fP, \fC [noexcept]\fP

Erases all elements in an unordered_map. 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 527 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_map\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.

This function only makes sense for unordered_multimap; for unordered_map the result will either be 0 (not present) or 1 (present).

Definition at line 591 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> \fBstd::pair\fP<\fBiterator\fP, bool> \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::emplace (_Args &&...__args)\fC [inline]\fP

Attempts to build and insert a std::pair into the unordered_map.

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:

A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted.

This function attempts to build and insert a (key, value) pair into the unordered_map. An unordered_map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the unordered_map.

Insertion requires amortized constant time.

Definition at line 340 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_map\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_map.

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 (may or may not be that std::pair).

This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument emplace() does. 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 370 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::empty () const\fC [inline]\fP, \fC [noexcept]\fP

Returns true if the unordered_map is empty.

Definition at line 258 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_map\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_map.

Definition at line 300 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_map\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_map.

Definition at line 309 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_map\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 714 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_map\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 725 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_map\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.

This function probably only makes sense for unordered_multimap.

Definition at line 604 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_map\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.

This function probably only makes sense for unordered_multimap.

Definition at line 608 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (\fBconst_iterator\fP__position)\fC [inline]\fP

Erases an element from an unordered_map.

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_map. 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 477 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::erase (\fBiterator\fP__it)\fC [inline]\fP

Erases an element from an unordered_map.

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_map. 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 482 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_map\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 element to be erased.

Returns:

The number of elements erased.

This function erases all the elements located by the given key from an unordered_map. For an unordered_map the result of this function can only be 0 (not present) or 1 (present). 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 499 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_map\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_map.

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_map. 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 517 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x)\fC [inline]\fP

Tries to locate an element in an unordered_map.

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 573 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::find (const \fBkey_type\fP &__x) const\fC [inline]\fP

Tries to locate an element in an unordered_map.

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 577 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::get_allocator () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the allocator object with which the unordered_map was constructed.

Definition at line 251 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::hash_function () const\fC [inline]\fP

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

Definition at line 549 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, bool> \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (const \fBvalue_type\fP &__x)\fC [inline]\fP

Attempts to insert a std::pair into the unordered_map.

Parameters:

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

Returns:

A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted.

This function attempts to insert a (key, value) pair into the unordered_map. An unordered_map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the unordered_map.

Insertion requires amortized constant time.

Definition at line 392 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> \fBstd::pair\fP<\fBiterator\fP, bool> \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (_Pair &&__x)\fC [inline]\fP

Attempts to insert a std::pair into the unordered_map.

Parameters:

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

Returns:

A pair, of which the first element is an iterator that points to the possibly inserted pair, and the second is a bool that is true if the pair was actually inserted.

This function attempts to insert a (key, value) pair into the unordered_map. An unordered_map relies on unique keys and thus a pair is only inserted if its first element (the key) is not already present in the unordered_map.

Insertion requires amortized constant time.

Definition at line 399 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, const \fBvalue_type\fP &__x)\fC [inline]\fP

Attempts to insert a std::pair into the unordered_map.

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

This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. 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 426 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::insert (\fBconst_iterator\fP__hint, _Pair &&__x)\fC [inline]\fP

Attempts to insert a std::pair into the unordered_map.

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

This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does. 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 433 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_map\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 448 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_map\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_map.

Parameters:

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

Complexity similar to that of the range constructor.

Definition at line 459 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::key_eq () const\fC [inline]\fP

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

Definition at line 555 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_map\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 737 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_map\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_map.

Definition at line 660 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor () const\fC [inline]\fP, \fC [noexcept]\fP

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

Definition at line 743 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_load_factor (float__z)\fC [inline]\fP

Change the unordered_map maximum load factor.

Parameters:

__z The new maximum load factor.

Definition at line 751 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::max_size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the maximum size of the unordered_map.

Definition at line 268 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_map\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (const \fBunordered_map\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_map\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (\fBunordered_map\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_map\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator= (initializer_list< \fBvalue_type\fP >__l)\fC [inline]\fP

Unordered_map list assignment operator.

Parameters:

__l An initializer_list.

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

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

Definition at line 242 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> >> \fBmapped_type\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator[] (const \fBkey_type\fP &__k)\fC [inline]\fP

Subscript ( [] ) access to unordered_map data.

Parameters:

__k The key for which data should be retrieved.

Returns:

A reference to the data of the (key,data) pair.

Allows for easy lookup with the subscript ( [] )operator. Returns data associated with the key specified in subscript. If the key does not exist, a pair with that key is created using default values, which is then returned.

Lookup requires constant time.

Definition at line 626 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> >> \fBmapped_type\fP& \fBstd::unordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::operator[] (\fBkey_type\fP &&__k)\fC [inline]\fP

Subscript ( [] ) access to unordered_map data.

Parameters:

__k The key for which data should be retrieved.

Returns:

A reference to the data of the (key,data) pair.

Allows for easy lookup with the subscript ( [] )operator. Returns data associated with the key specified in subscript. If the key does not exist, a pair with that key is created using default values, which is then returned.

Lookup requires constant time.

Definition at line 630 of file unordered_map.h.

References std::move().

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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::rehash (\fBsize_type\fP__n)\fC [inline]\fP

May rehash the unordered_map.

Parameters:

__n The new number of buckets.

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

Definition at line 762 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::reserve (\fBsize_type\fP__n)\fC [inline]\fP

Prepare the unordered_map for a specified number of elements.

Parameters:

__n Number of elements required.

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

Definition at line 773 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::size () const\fC [inline]\fP, \fC [noexcept]\fP

Returns the size of the unordered_map.

Definition at line 263 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_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc >::swap (\fBunordered_map\fP< _Key, _Tp, _Hash, _Pred, _Alloc > &__x)\fC [inline]\fP, \fC [noexcept]\fP

Swaps data with another unordered_map.

Parameters:

__x An unordered_map of the same element and allocator types.

This exchanges the elements between two unordered_map 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 540 of file unordered_map.h.

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