|
| | unordered_multimap ()=default |
| |
| template<typename _InputIterator> |
| | unordered_multimap (_InputIterator __first, _InputIterator __last, const allocator_type &__a) |
| |
| 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, 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) |
| |
| 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= (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 |
| |
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<_Key>. |
| _Pred | Predicate function object type, defaults to equal_to<_Key>. |
| _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 1381 of file unordered_map.h.
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 1450 of file unordered_map.h.
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 1951 of file unordered_map.h.
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 1719 of file unordered_map.h.
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 1746 of file unordered_map.h.
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 1922 of file unordered_map.h.
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 1941 of file unordered_map.h.
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 1901 of file unordered_map.h.
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 1906 of file unordered_map.h.
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 2045 of file unordered_map.h.
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 2056 of file unordered_map.h.
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 2039 of file unordered_map.h.
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 2050 of file unordered_map.h.
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 1820 of file unordered_map.h.
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 1805 of file unordered_map.h.
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 1794 of file unordered_map.h.
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 1800 of file unordered_map.h.
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 1626 of file unordered_map.h.
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 1965 of file unordered_map.h.
1.13.2