Go to the source code of this file.
|
| template<typename _Key , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>> |
| using | std::experimental::fundamentals_v2::pmr::unordered_multiset = std::unordered_multiset< _Key, _Hash, _Pred, polymorphic_allocator< _Key > > |
| |
| template<typename _Key , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>> |
| using | std::experimental::fundamentals_v2::pmr::unordered_set = std::unordered_set< _Key, _Hash, _Pred, polymorphic_allocator< _Key > > |
| |
|
| template<typename _Key , typename _Hash , typename _CPred , typename _Alloc , typename _Predicate > |
| void | std::experimental::erase_if (unordered_multiset< _Key, _Hash, _CPred, _Alloc > &__cont, _Predicate __pred) |
| |
| template<typename _Key , typename _Hash , typename _CPred , typename _Alloc , typename _Predicate > |
| void | std::experimental::erase_if (unordered_set< _Key, _Hash, _CPred, _Alloc > &__cont, _Predicate __pred) |
| |
This is a TS C++ Library header.
Definition in file experimental/unordered_set.
◆ _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
| #define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET |
◆ unordered_multiset
template<typename _Key , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>>
◆ unordered_set
template<typename _Key , typename _Hash = hash<_Key>, typename _Pred = equal_to<_Key>>