Home
last modified time | relevance | path

Searched refs:_Pred (Results 1 – 12 of 12) sorted by relevance

/openbsd/src/gnu/llvm/libcxx/include/ext/
Dhash_set217 template <class _Value, class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>,
226 typedef _Pred key_equal;
335 template <class _Value, class _Hash, class _Pred, class _Alloc>
336 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n,
343 template <class _Value, class _Hash, class _Pred, class _Alloc>
344 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(size_type __n,
351 template <class _Value, class _Hash, class _Pred, class _Alloc>
353 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
359 template <class _Value, class _Hash, class _Pred, class _Alloc>
361 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
[all …]
Dhash_map261 template <class _Tp, class _Pred,
262 bool = std::is_empty<_Pred>::value && !std::__libcpp_is_final<_Pred>::value
265 : private _Pred
268 _LIBCPP_INLINE_VISIBILITY __hash_map_equal() : _Pred() {}
269 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
270 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return *this;}
273 {return static_cast<const _Pred&>(*this)(__x.first, __y.first);}
276 {return static_cast<const _Pred&>(*this)(__x, __y.first);}
279 {return static_cast<const _Pred&>(*this)(__x.first, __y);}
283 {return static_cast<const _Pred&>(*this)(__x, __y);}
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/debug/
Ddebug.h71 # define __glibcxx_requires_sorted_pred(_First,_Last,_Pred) argument
73 # define __glibcxx_requires_partitioned_pred(_First,_Last,_Value,_Pred) argument
75 # define __glibcxx_requires_heap_pred(_First,_Last,_Pred) argument
124 # define __glibcxx_requires_sorted_pred(_First,_Last,_Pred) \ argument
125 __glibcxx_check_sorted_pred(_First,_Last,_Pred)
128 # define __glibcxx_requires_partitioned_pred(_First,_Last,_Value,_Pred) \ argument
129 __glibcxx_check_partitioned_pred(_First,_Last,_Value,_Pred)
132 # define __glibcxx_requires_heap_pred(_First,_Last,_Pred) \ argument
133 __glibcxx_check_heap_pred(_First,_Last,_Pred)
Dmacros.h150 #define __glibcxx_check_strict_weak_ordering_pred(_First,_Last,_Pred) \ argument
151 _GLIBCXX_DEBUG_ASSERT(_First == _Last || !_Pred(*_First, *_First))
165 #define __glibcxx_check_sorted_pred(_First,_Last,_Pred) \ argument
167 __glibcxx_check_strict_weak_ordering_pred(_First,_Last,_Pred); \
168 _GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_sorted(_First, _Last, _Pred), \
172 ._M_string(#_Pred))
187 #define __glibcxx_check_partitioned_pred(_First,_Last,_Value,_Pred) \ argument
190 _Value, _Pred), \
194 ._M_string(#_Pred) \
207 #define __glibcxx_check_heap_pred(_First,_Last,_Pred) \ argument
[all …]
Dfunctions.h280 template<typename _ForwardIterator, typename _Tp, typename _Pred>
283 const _Tp& __value, _Pred __pred) in __check_partitioned()
/openbsd/src/gnu/llvm/libcxx/include/
Dunordered_map556 template <class _Key, class _Cp, class _Hash, class _Pred,
593 template <class _Key, class _Cp, class _Hash, class _Pred>
594 class __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, false>
629 template <class _Key, class _Cp, class _Hash, class _Pred, bool __b>
632 swap(__unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __x,
633 __unordered_map_hasher<_Key, _Cp, _Hash, _Pred, __b>& __y)
639 template <class _Key, class _Cp, class _Pred, class _Hash,
640 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value>
642 : private _Pred
647 _NOEXCEPT_(is_nothrow_default_constructible<_Pred>::value)
[all …]
Dunordered_set499 template <class _Value, class _Hash, class _Pred, class _Alloc>
502 template <class _Value, class _Hash = hash<_Value>, class _Pred = equal_to<_Value>,
511 typedef __type_identity_t<_Pred> key_equal;
616 …static_assert(sizeof(std::__diagnose_unordered_container_requirements<_Value, _Hash, _Pred>(0)), "…
885 class _Pred = equal_to<__iter_value_type<_InputIterator>>,
890 class = enable_if_t<!__is_allocator<_Pred>::value>,
893 _Hash = _Hash(), _Pred = _Pred(), _Allocator = _Allocator())
894 -> unordered_set<__iter_value_type<_InputIterator>, _Hash, _Pred, _Allocator>;
897 class _Pred = equal_to<_Tp>,
901 class = enable_if_t<!__is_allocator<_Pred>::value>,
[all …]
Dlist1064 template <class _Pred> __remove_return_type remove_if(_Pred __pred);
2043 template <class _Pred>
2045 list<_Tp, _Alloc>::remove_if(_Pred __pred)
/openbsd/src/gnu/gcc/libstdc++-v3/include/tr1/
Dunordered_set48 class _Pred = std::equal_to<_Value>,
53 std::_Identity<_Value>, _Pred,
60 std::_Identity<_Value>, _Pred,
97 class _Pred = std::equal_to<_Value>,
102 std::_Identity<_Value>, _Pred,
109 std::_Identity<_Value>, _Pred,
145 template<class _Value, class _Hash, class _Pred, class _Alloc,
148 swap (unordered_set<_Value, _Hash, _Pred,
150 unordered_set<_Value, _Hash, _Pred,
154 template<class _Value, class _Hash, class _Pred, class _Alloc,
[all …]
Dunordered_map48 class _Pred = std::equal_to<_Key>,
53 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
60 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
97 class _Pred = std::equal_to<_Key>,
103 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
111 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred,
147 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
150 swap(unordered_map<_Key, _Tp, _Hash, _Pred,
152 unordered_map<_Key, _Tp, _Hash, _Pred,
156 template<class _Key, class _Tp, class _Hash, class _Pred, class _Alloc,
[all …]
/openbsd/src/gnu/llvm/libcxx/include/experimental/
Dunordered_set51 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
52 using unordered_set = _VSTD::unordered_set<_Value, _Hash, _Pred,
56 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
57 using unordered_multiset = _VSTD::unordered_multiset<_Value, _Hash, _Pred,
Dunordered_map57 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
58 using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
62 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
63 using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,