libstdc++: std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc (original) (raw)
#include <[unordered_map](a00236%5Fsource.html)>
| Public Types | |
|---|---|
| using | node_type = typename _Hashtable::node_type |
| 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 ()=default | |
| template<typename _InputIterator > | |
| unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) | |
| template<typename _InputIterator > | |
| unordered_multimap (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multimap (const allocator_type &__a) | |
| unordered_multimap (const unordered_multimap &)=default | |
| unordered_multimap (const unordered_multimap &__ummap, const allocator_type &__a) | |
| unordered_multimap (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) | |
| unordered_multimap (initializer_list< value_type > __l, size_type __n, const hasher &__hf, 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()) | |
| unordered_multimap (size_type __n, const allocator_type &__a) | |
| unordered_multimap (size_type __n, const hasher &__hf, const allocator_type &__a) | |
| unordered_multimap (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
| unordered_multimap (unordered_multimap &&)=default | |
| unordered_multimap (unordered_multimap &&__ummap, const allocator_type &__a) noexcept(noexcept(_Hashtable(std::move(__ummap._M_h), __a))) | |
| 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 |
| 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) |
| node_type | extract (const key_type &__key) |
| node_type | extract (const_iterator __pos) |
| allocator_type | get_allocator () const noexcept |
| hasher | hash_function () const |
| template<typename _InputIterator > | |
| void | insert (_InputIterator __first, _InputIterator __last) |
| iterator | insert (const_iterator __hint, node_type &&__nh) |
| void | insert (initializer_list< value_type > __l) |
| iterator | insert (node_type &&__nh) |
| 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 |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_map< _Key, _Tp, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_map< _Key, _Tp, _H2, _P2, _Alloc > &__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > &&__source) |
| template<typename _H2 , typename _P2 > | |
| void | merge (unordered_multimap< _Key, _Tp, _H2, _P2, _Alloc > &__source) |
| unordered_multimap & | operator= (const unordered_multimap &)=default |
| unordered_multimap & | operator= (initializer_list< value_type > __l) |
| unordered_multimap & | operator= (unordered_multimap &&)=default |
| 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) |
| iterator | insert (value_type &&__x) |
| template<typename _Pair > | |
| __enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > | insert (_Pair &&__x) |
| iterator | insert (const_iterator __hint, const value_type &__x) |
| iterator | insert (const_iterator __hint, value_type &&__x) |
| template<typename _Pair > | |
| __enable_if_t< is_constructible< value_type, _Pair && >::value, iterator > | insert (const_iterator __hint, _Pair &&__x) |
| iterator | erase (const_iterator __position) |
| iterator | erase (iterator __position) |
| iterator | find (const key_type &__x) |
| template<typename _Kt > | |
| auto | find (const _Kt &__x) -> decltype(_M_h._M_find_tr(__x)) |
| const_iterator | find (const key_type &__x) const |
| template<typename _Kt > | |
| auto | find (const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x)) |
| size_type | count (const key_type &__x) const |
| template<typename _Kt > | |
| auto | count (const _Kt &__x) const -> decltype(_M_h._M_count_tr(__x)) |
| bool | contains (const key_type &__x) const |
| template<typename _Kt > | |
| auto | contains (const _Kt &__x) const -> decltype(_M_h._M_find_tr(__x), void(), true) |
| std::pair< iterator, iterator > | equal_range (const key_type &__x) |
| template<typename _Kt > | |
| auto | equal_range (const _Kt &__x) -> decltype(_M_h._M_equal_range_tr(__x)) |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__x) const |
| template<typename _Kt > | |
| auto | equal_range (const _Kt &__x) const -> decltype(_M_h._M_equal_range_tr(__x)) |
| 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<typename , typename , typename > | |
| class | std::_Hash_merge_helper |
template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = 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.
Since
C++11
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 1255 of file unordered_map.h.
◆ allocator_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ const_iterator
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ const_local_iterator
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
typedef _Hashtable::const_local_iterator std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_local_iterator
◆ const_pointer
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ const_reference
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ difference_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ hasher
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ iterator
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ key_equal
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ key_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ local_iterator
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ mapped_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ node_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ pointer
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ reference
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ size_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ value_type
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Default constructor.
◆ unordered_multimap() [2/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Default constructor creates no elements.
Parameters
| __n | Mnimal initial number of buckets. |
|---|---|
| __hf | A hash functor. |
| __eql | A key equality functor. |
| __a | An allocator object. |
Definition at line 1303 of file unordered_map.h.
◆ unordered_multimap() [3/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _InputIterator >
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 1324 of file unordered_map.h.
◆ unordered_multimap() [4/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Copy constructor.
◆ unordered_multimap() [5/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Move constructor.
◆ unordered_multimap() [6/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Creates an unordered_multimap with no elements.
Parameters
Definition at line 1343 of file unordered_map.h.
◆ unordered_multimap() [7/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ unordered_multimap() [8/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ unordered_multimap() [9/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1379 of file unordered_map.h.
◆ unordered_multimap() [10/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ unordered_multimap() [11/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ unordered_multimap() [12/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _InputIterator >
◆ unordered_multimap() [13/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _InputIterator >
◆ unordered_multimap() [14/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ unordered_multimap() [15/15]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ begin() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.
Definition at line 1486 of file unordered_map.h.
◆ begin() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read/write iterator that points to the first element in the unordered_multimap.
Definition at line 1477 of file unordered_map.h.
◆ begin() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read/write iterator pointing to the first bucket element.
Parameters
Returns
A read/write local iterator.
Definition at line 1949 of file unordered_map.h.
◆ begin() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator pointing to the first bucket element.
Parameters
Returns
A read-only local iterator.
Definition at line 1960 of file unordered_map.h.
◆ bucket()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ bucket_count()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the number of buckets of the unordered_multimap.
Definition at line 1916 of file unordered_map.h.
◆ bucket_size()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ cbegin() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.
Definition at line 1490 of file unordered_map.h.
◆ cbegin() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator pointing to the first bucket element.
Parameters
Returns
A read-only local iterator.
Definition at line 1964 of file unordered_map.h.
◆ cend() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ cend() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
Parameters
Returns
A read-only local iterator.
Definition at line 1990 of file unordered_map.h.
◆ clear()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1741 of file unordered_map.h.
◆ contains() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::contains ( const _Kt & __x) const -> decltype(_M_h._M_find_tr(__x), void(), true) | inline |
|---|
Finds whether an element with the given key exists.
Parameters
| __x | Key of elements to be located. |
|---|
Returns
True if there is any element with the specified key.
Definition at line 1874 of file unordered_map.h.
◆ contains() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Finds whether an element with the given key exists.
Parameters
| __x | Key of elements to be located. |
|---|
Returns
True if there is any element with the specified key.
Definition at line 1869 of file unordered_map.h.
◆ count() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::count ( const _Kt & __x) const -> decltype(_M_h._M_count_tr(__x)) | inline |
|---|
Finds the number of elements.
Parameters
Returns
Number of elements with specified key.
Definition at line 1856 of file unordered_map.h.
◆ count() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Finds the number of elements.
Parameters
Returns
Number of elements with specified key.
Definition at line 1850 of file unordered_map.h.
◆ emplace()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename... _Args>
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 1535 of file unordered_map.h.
◆ emplace_hint()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename... _Args>
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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires amortized constant time.
Definition at line 1562 of file unordered_map.h.
◆ empty()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns true if the unordered_multimap is empty.
Definition at line 1457 of file unordered_map.h.
◆ end() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator that points one past the last element in the unordered_multimap.
Definition at line 1508 of file unordered_map.h.
◆ end() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ end() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read/write iterator pointing to one past the last bucket elements.
Parameters
Returns
A read/write local iterator.
Definition at line 1975 of file unordered_map.h.
◆ end() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
Parameters
Returns
A read-only local iterator.
Definition at line 1986 of file unordered_map.h.
◆ equal_range() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __x) -> decltype(_M_h._M_equal_range_tr(__x)) | inline |
|---|
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1894 of file unordered_map.h.
◆ equal_range() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::equal_range ( const _Kt & __x) const -> decltype(_M_h._M_equal_range_tr(__x)) | inline |
|---|
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1906 of file unordered_map.h.
◆ equal_range() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1888 of file unordered_map.h.
◆ equal_range() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Finds a subsequence matching given key.
Parameters
Returns
Pair of iterators that possibly points to the subsequence matching given key.
Definition at line 1900 of file unordered_map.h.
◆ erase() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1712 of file unordered_map.h.
◆ erase() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1731 of file unordered_map.h.
◆ erase() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1691 of file unordered_map.h.
◆ erase() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1696 of file unordered_map.h.
◆ extract() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ extract() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ find() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const _Kt & __x) -> decltype(_M_h._M_find_tr(__x)) | inline |
|---|
Tries to locate an element in an unordered_multimap.
Parameters
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 1827 of file unordered_map.h.
◆ find() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Kt >
| auto std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::find ( const _Kt & __x) const -> decltype(_M_h._M_find_tr(__x)) | inline |
|---|
Tries to locate an element in an unordered_multimap.
Parameters
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 1838 of file unordered_map.h.
◆ find() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Tries to locate an element in an unordered_multimap.
Parameters
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 1821 of file unordered_map.h.
◆ find() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Tries to locate an element in an unordered_multimap.
Parameters
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 1832 of file unordered_map.h.
◆ get_allocator()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the allocator object used by the unordered_multimap.
Definition at line 1450 of file unordered_map.h.
◆ hash_function()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the hash functor object with which the unordered_multimap was constructed.
Definition at line 1797 of file unordered_map.h.
◆ insert() [1/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _InputIterator >
| void std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert ( _InputIterator __first, _InputIterator __last ) | inline |
|---|
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 1636 of file unordered_map.h.
◆ insert() [2/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Pair >
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 1585 of file unordered_map.h.
◆ insert() [3/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1576 of file unordered_map.h.
◆ insert() [4/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _Pair >
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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires amortized constant time.
Definition at line 1621 of file unordered_map.h.
◆ insert() [5/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires amortized constant time.
Definition at line 1610 of file unordered_map.h.
◆ insert() [6/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ insert() [7/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 https://gcc.gnu.org/onlinedocs/libstdc++/manual/associative.html#containers.associative.insert_hints for more on hinting.
Insertion requires amortized constant time.
Definition at line 1616 of file unordered_map.h.
References std::move().
◆ insert() [8/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1648 of file unordered_map.h.
◆ insert() [9/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ insert() [10/10]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1580 of file unordered_map.h.
References std::move().
◆ key_eq()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the key comparison object with which the unordered_multimap was constructed.
Definition at line 1803 of file unordered_map.h.
◆ load_factor()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the average number of elements per bucket.
Definition at line 1998 of file unordered_map.h.
◆ max_bucket_count()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the maximum number of buckets of the unordered_multimap.
Definition at line 1921 of file unordered_map.h.
◆ max_load_factor() [1/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equal to.
Definition at line 2004 of file unordered_map.h.
◆ max_load_factor() [2/2]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Change the unordered_multimap maximum load factor.
Parameters
| __z | The new maximum load factor. |
|---|
Definition at line 2012 of file unordered_map.h.
◆ max_size()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Returns the maximum size of the unordered_multimap.
Definition at line 1467 of file unordered_map.h.
◆ merge() [1/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _H2 , typename _P2 >
◆ merge() [2/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _H2 , typename _P2 >
◆ merge() [3/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _H2 , typename _P2 >
◆ merge() [4/4]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename _H2 , typename _P2 >
◆ operator=() [1/3]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Copy assignment operator.
◆ operator=() [2/3]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Unordered_multimap list assignment operator.
Parameters
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.
Definition at line 1442 of file unordered_map.h.
◆ operator=() [3/3]
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
Move assignment operator.
◆ rehash()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 2023 of file unordered_map.h.
◆ reserve()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 2034 of file unordered_map.h.
◆ size()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
◆ swap()
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
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 1755 of file unordered_map.h.
◆ std::_Hash_merge_helper
template<typename _Key , typename _Tp , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>, typename _Alloc = allocator<std::pair<const _Key, _Tp>>>
template<typename , typename , typename >
| friend class std::_Hash_merge_helper | friend |
|---|
The documentation for this class was generated from the following file: