|
libstdc++
|
Go to the source code of this file.
Namespaces | |
| namespace | std |
Typedefs | |
| template<typename _Key , typename _Tp , typename _Hash = std::hash<_Key>, typename _Pred = std::equal_to<_Key>> | |
| using | std::pmr::unordered_map = std::unordered_map< _Key, _Tp, _Hash, _Pred, polymorphic_allocator< pair< const _Key, _Tp > > > |
| template<typename _Key , typename _Tp , typename _Hash = std::hash<_Key>, typename _Pred = std::equal_to<_Key>> | |
| using | std::pmr::unordered_multimap = std::unordered_multimap< _Key, _Tp, _Hash, _Pred, polymorphic_allocator< pair< const _Key, _Tp > > > |
This is a Standard C++ Library header.
Definition in file unordered_map.
| #define __glibcxx_want_allocator_traits_is_always_equal |
Definition at line 51 of file unordered_map.
| #define __glibcxx_want_associative_heterogeneous_erasure |
Definition at line 59 of file unordered_map.
| #define __glibcxx_want_associative_heterogeneous_insertion |
Definition at line 60 of file unordered_map.
| #define __glibcxx_want_containers_ranges |
Definition at line 52 of file unordered_map.
| #define __glibcxx_want_erase_if |
Definition at line 53 of file unordered_map.
| #define __glibcxx_want_generic_unordered_lookup |
Definition at line 54 of file unordered_map.
| #define __glibcxx_want_node_extract |
Definition at line 55 of file unordered_map.
| #define __glibcxx_want_nonmember_container_access |
Definition at line 56 of file unordered_map.
| #define __glibcxx_want_tuple_like |
Definition at line 58 of file unordered_map.
| #define __glibcxx_want_unordered_map_try_emplace |
Definition at line 57 of file unordered_map.
| using std::pmr::unordered_map = typedef std::unordered_map<_Key, _Tp, _Hash, _Pred, polymorphic_allocator<pair<const _Key, _Tp> >> |
Definition at line 72 of file unordered_map.
| using std::pmr::unordered_multimap = typedef std::unordered_multimap<_Key, _Tp, _Hash, _Pred, polymorphic_allocator<pair<const _Key, _Tp> >> |
Definition at line 77 of file unordered_map.