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