libstdc++
|
#include <unordered_map>
Public Types | |
using | insert_return_type = typename _Hashtable::insert_return_type |
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_map ()=default | |
template<typename _InputIterator > | |
unordered_map (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) | |
template<typename _InputIterator > | |
unordered_map (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) | |
template<typename _InputIterator > | |
unordered_map (_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_map (const allocator_type &__a) | |
unordered_map (const unordered_map &)=default | |
unordered_map (const unordered_map &__umap, const allocator_type &__a) | |
unordered_map (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) | |
unordered_map (initializer_list< value_type > __l, size_type __n, const hasher &__hf, 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()) | |
unordered_map (size_type __n, const allocator_type &__a) | |
unordered_map (size_type __n, const hasher &__hf, const allocator_type &__a) | |
unordered_map (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) | |
unordered_map (unordered_map &&)=default | |
unordered_map (unordered_map &&__umap, const allocator_type &__a) noexcept(noexcept(_Hashtable(std::move(__umap._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> | |
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) |
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, node_type &&__nh) |
void | insert (initializer_list< value_type > __l) |
insert_return_type | insert (node_type &&__nh) |
template<typename _Obj > | |
pair< iterator, bool > | insert_or_assign (const key_type &__k, _Obj &&__obj) |
template<typename _Obj > | |
iterator | insert_or_assign (const_iterator __hint, const key_type &__k, _Obj &&__obj) |
template<typename _Obj > | |
iterator | insert_or_assign (const_iterator __hint, key_type &&__k, _Obj &&__obj) |
template<typename _Obj > | |
pair< iterator, bool > | insert_or_assign (key_type &&__k, _Obj &&__obj) |
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_map & | operator= (const unordered_map &)=default |
unordered_map & | operator= (initializer_list< value_type > __l) |
unordered_map & | operator= (unordered_map &&)=default |
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))) |
template<typename... _Args> | |
pair< iterator, bool > | try_emplace (const key_type &__k, _Args &&... __args) |
template<typename... _Args> | |
iterator | try_emplace (const_iterator __hint, const key_type &__k, _Args &&... __args) |
template<typename... _Args> | |
iterator | try_emplace (const_iterator __hint, key_type &&__k, _Args &&... __args) |
template<typename... _Args> | |
pair< iterator, bool > | try_emplace (key_type &&__k, _Args &&... __args) |
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) |
std::pair< iterator, bool > | insert (value_type &&__x) |
template<typename _Pair > | |
__enable_if_t< is_constructible< value_type, _Pair && >::value, pair< iterator, bool > > | 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)) |
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<typename , typename , typename > | |
class | std::_Hash_merge_helper |
A standard container composed of unique keys (containing at most one 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 __umap_hashtable.
Definition at line 109 of file unordered_map.h.
typedef _Hashtable::allocator_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::allocator_type |
Public typedefs.
Definition at line 123 of file unordered_map.h.
typedef _Hashtable::const_iterator std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::const_iterator |
Iterator-related typedefs.
Definition at line 133 of file unordered_map.h.
typedef _Hashtable::const_local_iterator std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::const_local_iterator |
Iterator-related typedefs.
Definition at line 135 of file unordered_map.h.
typedef _Hashtable::const_pointer std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::const_pointer |
Iterator-related typedefs.
Definition at line 129 of file unordered_map.h.
typedef _Hashtable::const_reference std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::const_reference |
Iterator-related typedefs.
Definition at line 131 of file unordered_map.h.
typedef _Hashtable::difference_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::difference_type |
Iterator-related typedefs.
Definition at line 137 of file unordered_map.h.
typedef _Hashtable::hasher std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::hasher |
Public typedefs.
Definition at line 121 of file unordered_map.h.
using std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::insert_return_type = typename _Hashtable::insert_return_type |
Definition at line 142 of file unordered_map.h.
typedef _Hashtable::iterator std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::iterator |
Iterator-related typedefs.
Definition at line 132 of file unordered_map.h.
typedef _Hashtable::key_equal std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::key_equal |
Public typedefs.
Definition at line 122 of file unordered_map.h.
typedef _Hashtable::key_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::key_type |
Public typedefs.
Definition at line 118 of file unordered_map.h.
typedef _Hashtable::local_iterator std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::local_iterator |
Iterator-related typedefs.
Definition at line 134 of file unordered_map.h.
typedef _Hashtable::mapped_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::mapped_type |
Public typedefs.
Definition at line 120 of file unordered_map.h.
using std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::node_type = typename _Hashtable::node_type |
Definition at line 141 of file unordered_map.h.
typedef _Hashtable::pointer std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::pointer |
Iterator-related typedefs.
Definition at line 128 of file unordered_map.h.
typedef _Hashtable::reference std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::reference |
Iterator-related typedefs.
Definition at line 130 of file unordered_map.h.
typedef _Hashtable::size_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::size_type |
Iterator-related typedefs.
Definition at line 136 of file unordered_map.h.
typedef _Hashtable::value_type std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::value_type |
Public typedefs.
Definition at line 119 of file unordered_map.h.
|
default |
Default constructor.
|
inlineexplicit |
Default constructor creates no elements.
__n | Minimal initial number of buckets. |
__hf | A hash functor. |
__eql | A key equality functor. |
__a | An allocator object. |
Definition at line 158 of file unordered_map.h.
|
inline |
Builds an unordered_map 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_map consisting of copies of the elements from [__first,__last). This is linear in N (where N is distance(__first,__last)).
Definition at line 179 of file unordered_map.h.
|
default |
Copy constructor.
|
default |
Move constructor.
|
inlineexplicit |
Creates an unordered_map with no elements.
__a | An allocator object. |
Definition at line 198 of file unordered_map.h.
|
inline |
Definition at line 207 of file unordered_map.h.
|
inlinenoexcept |
Definition at line 217 of file unordered_map.h.
|
inline |
Builds an unordered_map 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_map consisting of copies of the elements in the list. This is linear in N (where N is __l.size()).
Definition at line 234 of file unordered_map.h.
|
inline |
Definition at line 242 of file unordered_map.h.
|
inline |
Definition at line 246 of file unordered_map.h.
|
inline |
Definition at line 252 of file unordered_map.h.
|
inline |
Definition at line 259 of file unordered_map.h.
|
inline |
Definition at line 265 of file unordered_map.h.
|
inline |
Definition at line 271 of file unordered_map.h.
|
inline |
Access to unordered_map data.
__k | The key for which data should be retrieved. |
std::out_of_range | If no such data is present. |
Definition at line 1003 of file unordered_map.h.
|
inline |
Access to unordered_map data.
__k | The key for which data should be retrieved. |
std::out_of_range | If no such data is present. |
Definition at line 1007 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_map.
Definition at line 341 of file unordered_map.h.
|
inlinenoexcept |
Returns a read/write iterator that points to the first element in the unordered_map.
Definition at line 332 of file unordered_map.h.
|
inline |
Returns a read/write iterator pointing to the first bucket element.
__n | The bucket index. |
Definition at line 1048 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 1059 of file unordered_map.h.
|
inline |
Definition at line 1038 of file unordered_map.h.
|
inlinenoexcept |
Returns the number of buckets of the unordered_map.
Definition at line 1015 of file unordered_map.h.
|
inline |
Definition at line 1029 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points to the first element in the unordered_map.
Definition at line 345 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 1063 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_map.
Definition at line 367 of file unordered_map.h.
Referenced by std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::insert_or_assign(), and std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::try_emplace().
|
inline |
Returns a read-only (constant) iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1089 of file unordered_map.h.
|
inlinenoexcept |
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 797 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 932 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 927 of file unordered_map.h.
|
inline |
Finds the number of elements.
__x | Key to count. |
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 914 of file unordered_map.h.
|
inline |
Finds the number of elements.
__x | Key to count. |
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 908 of file unordered_map.h.
|
inline |
Attempts to build and insert a std::pair into the unordered_map.
__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_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 395 of file unordered_map.h.
|
inline |
Attempts to build and insert a std::pair into the unordered_map.
__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). |
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 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 426 of file unordered_map.h.
|
inlinenoexcept |
Returns true if the unordered_map is empty.
Definition at line 312 of file unordered_map.h.
|
inlinenoexcept |
Returns a read-only (constant) iterator that points one past the last element in the unordered_map.
Definition at line 363 of file unordered_map.h.
|
inlinenoexcept |
Returns a read/write iterator that points one past the last element in the unordered_map.
Definition at line 354 of file unordered_map.h.
Referenced by std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::extract().
|
inline |
Returns a read/write iterator pointing to one past the last bucket elements.
__n | The bucket index. |
Definition at line 1074 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 1085 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function probably only makes sense for unordered_multimap.
Definition at line 954 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function probably only makes sense for unordered_multimap.
Definition at line 966 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function probably only makes sense for unordered_multimap.
Definition at line 948 of file unordered_map.h.
|
inline |
Finds a subsequence matching given key.
__x | Key to be located. |
This function probably only makes sense for unordered_multimap.
Definition at line 960 of file unordered_map.h.
|
inline |
Erases elements according to the provided key.
__x | Key of element to be 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 769 of file unordered_map.h.
|
inline |
Erases a [__first,__last) range of elements from an unordered_map.
__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_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 787 of file unordered_map.h.
|
inline |
Erases an element from an unordered_map.
__position | An iterator pointing to the element to be erased. |
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 747 of file unordered_map.h.
|
inline |
Erases an element from an unordered_map.
__position | An iterator pointing to the element to be erased. |
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 752 of file unordered_map.h.
|
inline |
Extract a node.
Definition at line 440 of file unordered_map.h.
|
inline |
Extract a node.
Definition at line 432 of file unordered_map.h.
References std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::end().
|
inline |
Tries to locate an element in an unordered_map.
__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 881 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_map.
__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 892 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_map.
__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 875 of file unordered_map.h.
|
inline |
Tries to locate an element in an unordered_map.
__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 886 of file unordered_map.h.
|
inlinenoexcept |
Returns the allocator object used by the unordered_map.
Definition at line 305 of file unordered_map.h.
|
inline |
Returns the hash functor object with which the unordered_map was constructed.
Definition at line 851 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 623 of file unordered_map.h.
|
inline |
Attempts to insert a std::pair into the unordered_map.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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 570 of file unordered_map.h.
|
inline |
Attempts to insert a std::pair into the unordered_map.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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 558 of file unordered_map.h.
|
inline |
Attempts to insert a std::pair into the unordered_map.
__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). |
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 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 608 of file unordered_map.h.
|
inline |
Attempts to insert a std::pair into the unordered_map.
__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). |
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 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 597 of file unordered_map.h.
|
inline |
Attempts to insert a std::pair into the unordered_map.
__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). |
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 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 603 of file unordered_map.h.
References std::move().
|
inline |
Re-insert an extracted node.
Definition at line 450 of file unordered_map.h.
References std::move().
|
inline |
Attempts to insert a list of elements into the unordered_map.
__l | A std::initializer_list<value_type> of elements to be inserted. |
Complexity similar to that of the range constructor.
Definition at line 634 of file unordered_map.h.
|
inline |
Re-insert an extracted node.
Definition at line 445 of file unordered_map.h.
References std::move().
|
inline |
Attempts to insert a std::pair into the unordered_map.
__x | Pair to be inserted (see std::make_pair for easy creation of pairs). |
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 564 of file unordered_map.h.
References std::move().
|
inline |
Attempts to insert a std::pair into the unordered_map.
__k | Key to use for finding a possibly existing pair in the map. |
__obj | Argument used to generate the .second for a pair instance. |
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. If the pair was already in the unordered_map, the .second of the pair is assigned from __obj.
Insertion requires amortized constant time.
Definition at line 661 of file unordered_map.h.
References std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::cend().
|
inline |
Attempts to insert a std::pair into the unordered_map.
__hint | An iterator that serves as a hint as to where the pair should be inserted. |
__k | Key to use for finding a possibly existing pair in the unordered_map. |
__obj | Argument used to generate the .second for a pair instance. |
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument insert() does.
If the pair was already in the unordered map, the .second of the pair is assigned from __obj. 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 710 of file unordered_map.h.
|
inline |
Definition at line 722 of file unordered_map.h.
|
inline |
Definition at line 673 of file unordered_map.h.
|
inline |
Returns the key comparison object with which the unordered_map was constructed.
Definition at line 857 of file unordered_map.h.
|
inlinenoexcept |
Returns the average number of elements per bucket.
Definition at line 1097 of file unordered_map.h.
|
inlinenoexcept |
Returns the maximum number of buckets of the unordered_map.
Definition at line 1020 of file unordered_map.h.
|
inlinenoexcept |
Returns a positive number that the unordered_map tries to keep the load factor less than or equal to.
Definition at line 1103 of file unordered_map.h.
|
inline |
Change the unordered_map maximum load factor.
__z | The new maximum load factor. |
Definition at line 1111 of file unordered_map.h.
|
inlinenoexcept |
Returns the maximum size of the unordered_map.
Definition at line 322 of file unordered_map.h.
|
inline |
Definition at line 829 of file unordered_map.h.
|
inline |
Definition at line 821 of file unordered_map.h.
|
inline |
Definition at line 842 of file unordered_map.h.
|
inline |
Definition at line 834 of file unordered_map.h.
|
default |
Copy assignment operator.
|
inline |
Unordered_map list assignment operator.
__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.
Definition at line 297 of file unordered_map.h.
|
default |
Move assignment operator.
|
inline |
Subscript ( [] ) access to unordered_map data.
__k | The key for which data should be retrieved. |
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 986 of file unordered_map.h.
|
inline |
Subscript ( [] ) access to unordered_map data.
__k | The key for which data should be retrieved. |
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 990 of file unordered_map.h.
References std::move().
|
inline |
May rehash the unordered_map.
__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 1122 of file unordered_map.h.
|
inline |
Prepare the unordered_map for a specified number of elements.
__n | Number of elements required. |
Same as rehash(ceil(n / max_load_factor())).
Definition at line 1133 of file unordered_map.h.
|
inlinenoexcept |
Returns the size of the unordered_map.
Definition at line 317 of file unordered_map.h.
|
inlinenoexcept |
Swaps data with another unordered_map.
__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 811 of file unordered_map.h.
|
inline |
Attempts to build and insert a std::pair into the unordered_map.
__k | Key to use for finding a possibly existing pair in the unordered_map. |
__args | Arguments used to generate the .second for a new pair instance. |
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. If a pair is not inserted, this function has no effect.
Insertion requires amortized constant time.
Definition at line 478 of file unordered_map.h.
References std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc >::cend().
|
inline |
Attempts to build and insert a std::pair into the unordered_map.
__hint | An iterator that serves as a hint as to where the pair should be inserted. |
__k | Key to use for finding a possibly existing pair in the unordered_map. |
__args | Arguments used to generate the .second for a new pair instance. |
This function is not concerned about whether the insertion took place, and thus does not return a boolean like the single-argument emplace() does. However, if insertion did not take place, this function has no effect. 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 522 of file unordered_map.h.
|
inline |
Definition at line 532 of file unordered_map.h.
|
inline |
Definition at line 486 of file unordered_map.h.
|
friend |
Definition at line 817 of file unordered_map.h.