libstdc++
|
#include <unordered_map>
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 |
A standard container composed of equivalent keys (possibly containing multiple of each key value) that associates values of another type with the keys.
_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 1254 of file unordered_map.h.
typedef _Hashtable::allocator_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::allocator_type |
Public typedefs.
Definition at line 1268 of file unordered_map.h.
typedef _Hashtable::const_iterator std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_iterator |
Iterator-related typedefs.
Definition at line 1278 of file unordered_map.h.
typedef _Hashtable::const_local_iterator std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_local_iterator |
Iterator-related typedefs.
Definition at line 1280 of file unordered_map.h.
typedef _Hashtable::const_pointer std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_pointer |
Iterator-related typedefs.
Definition at line 1274 of file unordered_map.h.
typedef _Hashtable::const_reference std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::const_reference |
Iterator-related typedefs.
Definition at line 1276 of file unordered_map.h.
typedef _Hashtable::difference_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::difference_type |
Iterator-related typedefs.
Definition at line 1282 of file unordered_map.h.
typedef _Hashtable::hasher std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::hasher |
Public typedefs.
Definition at line 1266 of file unordered_map.h.
typedef _Hashtable::iterator std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::iterator |
Iterator-related typedefs.
Definition at line 1277 of file unordered_map.h.
typedef _Hashtable::key_equal std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::key_equal |
Public typedefs.
Definition at line 1267 of file unordered_map.h.
typedef _Hashtable::key_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::key_type |
Public typedefs.
Definition at line 1263 of file unordered_map.h.
typedef _Hashtable::local_iterator std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::local_iterator |
Iterator-related typedefs.
Definition at line 1279 of file unordered_map.h.
typedef _Hashtable::mapped_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::mapped_type |
Public typedefs.
Definition at line 1265 of file unordered_map.h.
using std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::node_type = typename _Hashtable::node_type |
Definition at line 1286 of file unordered_map.h.
typedef _Hashtable::pointer std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::pointer |
Iterator-related typedefs.
Definition at line 1273 of file unordered_map.h.
typedef _Hashtable::reference std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::reference |
Iterator-related typedefs.
Definition at line 1275 of file unordered_map.h.
typedef _Hashtable::size_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::size_type |
Iterator-related typedefs.
Definition at line 1281 of file unordered_map.h.
typedef _Hashtable::value_type std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::value_type |
Public typedefs.
Definition at line 1264 of file unordered_map.h.
|
default |
Default constructor.
|
inlineexplicit |
Default constructor creates no elements.
__n | Mnimal initial number of buckets. |
__hf | A hash functor. |
__eql | A key equality functor. |
__a | An allocator object. |
Definition at line 1302 of file unordered_map.h.
|
inline |
Builds an unordered_multimap from a range.
__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 1323 of file unordered_map.h.
|
default |
Copy constructor.
|
default |
Move constructor.
|
inlineexplicit |
Creates an unordered_multimap with no elements.
__a | An allocator object. |
Definition at line 1342 of file unordered_map.h.
|
inline |
Definition at line 1351 of file unordered_map.h.
|
inlinenoexcept |
Definition at line 1361 of file unordered_map.h.
|
inline |
Builds an unordered_multimap from an initializer_list.
__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 1378 of file unordered_map.h.
|
inline |
Definition at line 1386 of file unordered_map.h.
|
inline |
Definition at line 1390 of file unordered_map.h.
|
inline |
Definition at line 1396 of file unordered_map.h.
|
inline |
Definition at line 1403 of file unordered_map.h.
|
inline |
Definition at line 1409 of file unordered_map.h.
|
inline |
Definition at line 1415 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.
Definition at line 1485 of file unordered_map.h.
|
inlinenoexcept |
Returns a read/write iterator that points to the first element in the unordered_multimap.
Definition at line 1476 of file unordered_map.h.
|
inline |
Returns a read/write iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1948 of file unordered_map.h.
|
inline |
Returns a read-only (constant) iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1959 of file unordered_map.h.
|
inline |
Definition at line 1938 of file unordered_map.h.
|
inlinenoexcept |
Returns the number of buckets of the unordered_multimap.
Definition at line 1915 of file unordered_map.h.
|
inline |
Definition at line 1929 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_multimap.
Definition at line 1489 of file unordered_map.h.
|
inline |
Returns a read-only (constant) iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1963 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_multimap.
Definition at line 1511 of file unordered_map.h.
Referenced by std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::insert().
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1989 of file unordered_map.h.
|
inlinenoexcept |
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 1740 of file unordered_map.h.
|
inline |
Finds whether an element with the given key exists.
__x | Key of elements to be located. |
Definition at line 1873 of file unordered_map.h.
|
inline |
Finds whether an element with the given key exists.
__x | Key of elements to be located. |
Definition at line 1868 of file unordered_map.h.
|
inline |
Finds the number of elements.
__x | Key to count. |
Definition at line 1855 of file unordered_map.h.
|
inline |
Finds the number of elements.
__x | Key to count. |
Definition at line 1849 of file unordered_map.h.
|
inline |
Attempts to build and insert a std::pair into the unordered_multimap.
__args | Arguments used to generate a new pair instance (see std::piecewise_contruct for passing arguments to each part of the pair constructor). |
This function attempts to build and insert a (key, value) pair into the unordered_multimap.
Insertion requires amortized constant time.
Definition at line 1534 of file unordered_map.h.
|
inline |
Attempts to build and insert a std::pair into the unordered_multimap.
__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). |
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 1561 of file unordered_map.h.
|
inlinenoexcept |
Returns true if the unordered_multimap is empty.
Definition at line 1456 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_multimap.
Definition at line 1507 of file unordered_map.h.
|
inlinenoexcept |
Returns a read/write iterator that points one past the last element in the unordered_multimap.
Definition at line 1498 of file unordered_map.h.
|
inline |
Returns a read/write iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1974 of file unordered_map.h.
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1985 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1893 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1905 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1887 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
Definition at line 1899 of file unordered_map.h.
|
inline |
Erases elements according to the provided key.
__x | Key of elements to be 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 1711 of file unordered_map.h.
|
inline |
Erases a [__first,__last) range of elements from an unordered_multimap.
__first | Iterator pointing to the start of the range to be erased. |
__last | Iterator pointing to the end of the range to be erased. |
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 1730 of file unordered_map.h.
|
inline |
Erases an element from an unordered_multimap.
__position | An iterator pointing to the element to be erased. |
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 1690 of file unordered_map.h.
|
inline |
Erases an element from an unordered_multimap.
__position | An iterator pointing to the element to be erased. |
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 1695 of file unordered_map.h.
|
inline |
Extract a node.
Definition at line 1661 of file unordered_map.h.
|
inline |
Extract a node.
Definition at line 1653 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_multimap.
__x | Key to be located. |
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 1826 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_multimap.
__x | Key to be located. |
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 1837 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_multimap.
__x | Key to be located. |
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 1820 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_multimap.
__x | Key to be located. |
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 1831 of file unordered_map.h.
|
inlinenoexcept |
Returns the allocator object used by the unordered_multimap.
Definition at line 1449 of file unordered_map.h.
|
inline |
Returns the hash functor object with which the unordered_multimap was constructed.
Definition at line 1796 of file unordered_map.h.
|
inline |
A template function that attempts to insert a range of elements.
__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 1635 of file unordered_map.h.
|
inline |
Inserts a std::pair into the unordered_multimap.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires amortized constant time.
Definition at line 1584 of file unordered_map.h.
|
inline |
Inserts a std::pair into the unordered_multimap.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires amortized constant time.
Definition at line 1575 of file unordered_map.h.
|
inline |
Inserts a std::pair into the unordered_multimap.
__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). |
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 1620 of file unordered_map.h.
|
inline |
Inserts a std::pair into the unordered_multimap.
__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). |
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 1609 of file unordered_map.h.
|
inline |
Re-insert an extracted node.
Definition at line 1671 of file unordered_map.h.
References std::move().
|
inline |
Inserts a std::pair into the unordered_multimap.
__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). |
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 1615 of file unordered_map.h.
References std::move().
|
inline |
Attempts to insert a list of elements into the unordered_multimap.
__l | A std::initializer_list<value_type> of elements to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 1647 of file unordered_map.h.
|
inline |
Re-insert an extracted node.
Definition at line 1666 of file unordered_map.h.
References std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc >::cend(), and std::move().
|
inline |
Inserts a std::pair into the unordered_multimap.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
Insertion requires amortized constant time.
Definition at line 1579 of file unordered_map.h.
References std::move().
|
inline |
Returns the key comparison object with which the unordered_multimap was constructed.
Definition at line 1802 of file unordered_map.h.
|
inlinenoexcept |
Returns the average number of elements per bucket.
Definition at line 1997 of file unordered_map.h.
|
inlinenoexcept |
Returns the maximum number of buckets of the unordered_multimap.
Definition at line 1920 of file unordered_map.h.
|
inlinenoexcept |
Returns a positive number that the unordered_multimap tries to keep the load factor less than or equal to.
Definition at line 2003 of file unordered_map.h.
|
inline |
Change the unordered_multimap maximum load factor.
__z | The new maximum load factor. |
Definition at line 2011 of file unordered_map.h.
|
inlinenoexcept |
Returns the maximum size of the unordered_multimap.
Definition at line 1466 of file unordered_map.h.
|
inline |
Definition at line 1787 of file unordered_map.h.
|
inline |
Definition at line 1778 of file unordered_map.h.
|
inline |
Definition at line 1773 of file unordered_map.h.
|
inline |
Definition at line 1764 of file unordered_map.h.
|
default |
Copy assignment operator.
|
inline |
Unordered_multimap list assignment operator.
__l | An initializer_list. |
This function fills an unordered_multimap with copies of the elements in the initializer list __l.
Note that the assignment completely changes the unordered_multimap and that the resulting unordered_multimap's size is the same as the number of elements assigned.
Definition at line 1441 of file unordered_map.h.
|
default |
Move assignment operator.
|
inline |
May rehash the unordered_multimap.
__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 2022 of file unordered_map.h.
|
inline |
Prepare the unordered_multimap for a specified number of elements.
__n | Number of elements required. |
Same as rehash(ceil(n / max_load_factor())).
Definition at line 2033 of file unordered_map.h.
|
inlinenoexcept |
Returns the size of the unordered_multimap.
Definition at line 1461 of file unordered_map.h.
|
inlinenoexcept |
Swaps data with another unordered_multimap.
__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 1754 of file unordered_map.h.
|
friend |
Definition at line 1760 of file unordered_map.h.