Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/libc++/include/ext/
H A Dhash_set349 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
358 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
369 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
379 hash_set<_Value, _Hash, _Pred, _Alloc>::hash_set(
401 swap(hash_set<_Value, _Hash, _Pred, _Alloc>& __x,
402 hash_set<_Value, _Hash, _Pred, _Alloc>& __y)
553 hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
561 hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
571 hash_multiset<_Value, _Hash, _Pred, _Alloc>::hash_multiset(
623 swap(hash_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
[all …]
H A Dhash_map259 template <class _Tp, class _Pred,
260 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value
263 : private _Pred
267 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
284 template <class _Tp, class _Pred>
285 class __hash_map_equal<_Tp, _Pred, false>
287 _Pred __pred_;
607 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
615 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
625 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::hash_map(
[all …]
/freebsd-12.1/contrib/libstdc++/include/debug/
H A 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); \
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
209 _GLIBCXX_DEBUG_VERIFY(std::__is_heap(_First, _Last, _Pred), \
[all …]
H A 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)
H A Dfunctions.h280 template<typename _ForwardIterator, typename _Tp, typename _Pred>
283 const _Tp& __value, _Pred __pred) in __check_partitioned()
/freebsd-12.1/contrib/libc++/include/
H A Dunordered_set758 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
769 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
783 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
797 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(
903 unordered_set<_Value, _Hash, _Pred, _Alloc>&
913 unordered_set<_Value, _Hash, _Pred, _Alloc>&
914 unordered_set<_Value, _Hash, _Pred, _Alloc>::operator=(
937 swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
938 unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
1472 unordered_multiset<_Value, _Hash, _Pred, _Alloc>&
[all …]
H A Dunordered_map492 template <class _Key, class _Cp, class _Pred,
493 bool = is_empty<_Pred>::value && !__libcpp_is_final<_Pred>::value>
495 : private _Pred
501 : _Pred() {}
503 __unordered_map_equal(const _Pred& __p)
505 : _Pred(__p) {}
521 swap(static_cast<_Pred&>(*this), static_cast<_Pred&>(__y));
525 template <class _Key, class _Cp, class _Pred>
528 _Pred __pred_;
535 __unordered_map_equal(const _Pred& __p)
[all …]
H A D__tuple394 template <bool ..._Pred>
395 using __all = is_same<__all_dummy<_Pred...>, __all_dummy<((void)_Pred, true)...>>;
H A Dlist1075 template <class _Pred> void remove_if(_Pred __pred);
2161 template <class _Pred>
2163 list<_Tp, _Alloc>::remove_if(_Pred __pred)
H A Dtype_traits561 template <class _Pred>
562 struct __lazy_and_impl<true, _Pred> : integral_constant<bool, _Pred::type::value> {};
590 template <class _Pred>
591 struct __lazy_not : integral_constant<bool, !_Pred::type::value> {};
/freebsd-12.1/contrib/libstdc++/include/tr1/
H A 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,
157 swap(unordered_multiset<_Value, _Hash, _Pred,
[all …]
H A 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,
159 swap(unordered_multimap<_Key, _Tp, _Hash, _Pred,
[all …]
/freebsd-12.1/contrib/libc++/include/experimental/
H A Dunordered_set48 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
49 using unordered_set = _VSTD::unordered_set<_Value, _Hash, _Pred,
53 class _Hash = hash<_Value>, class _Pred = equal_to<_Value>>
54 using unordered_multiset = _VSTD::unordered_multiset<_Value, _Hash, _Pred,
H A Dunordered_map54 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
55 using unordered_map = _VSTD::unordered_map<_Key, _Value, _Hash, _Pred,
59 class _Hash = hash<_Key>, class _Pred = equal_to<_Key>>
60 using unordered_multimap = _VSTD::unordered_multimap<_Key, _Value, _Hash, _Pred,