Home
last modified time | relevance | path

Searched refs:__pred (Results 1 – 25 of 49) sorted by relevance

12

/freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/
Dstable_partition.h29 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, in __stable_partition() argument
39 if (__pred(*++__m)) in __stable_partition()
60 if (__pred(*__i)) in __stable_partition()
89 …_ForwardIterator __first_false = _VSTD::__stable_partition<_PredRef>(__first, __m, __pred, __len2,… in __stable_partition()
96 while (__pred(*__m1)) in __stable_partition()
104 …__second_false = _VSTD::__stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit); in __stable_partition()
115 __stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, in __stable_partition() argument
124 if (!__pred(*__first)) in __stable_partition()
141 (__first, __last, __pred, __len, __p, forward_iterator_tag()); in __stable_partition()
146 __stable_partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, in __stable_partition() argument
[all …]
Dis_permutation.h31 _BinaryPredicate __pred) { in is_permutation() argument
34 if (!__pred(*__first1, *__first2)) in is_permutation()
51 if (__pred(*__match, *__i)) in is_permutation()
57 if (__pred(*__i, *__j)) in is_permutation()
64 if (__pred(*__i, *__j)) in is_permutation()
85 … _ForwardIterator2 __last2, _BinaryPredicate __pred, forward_iterator_tag, forward_iterator_tag) { in __is_permutation() argument
88 if (!__pred(*__first1, *__first2)) in __is_permutation()
109 if (__pred(*__match, *__i)) in __is_permutation()
115 if (__pred(*__i, *__j)) in __is_permutation()
122 if (__pred(*__i, *__j)) in __is_permutation()
[all …]
Dpartition.h29 __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_… in __partition() argument
35 if (!__pred(*__first)) in __partition()
41 if (__pred(*__p)) in __partition()
52 __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, in __partition() argument
61 if (!__pred(*__first)) in __partition()
69 } while (!__pred(*__last)); in __partition()
78 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) in partition() argument
81 … (__first, __last, __pred, typename iterator_traits<_ForwardIterator>::iterator_category()); in partition()
Dfind_end.h30 … _BinaryPredicate __pred, forward_iterator_tag, in __find_end() argument
40 if (__pred(*__first1, *__first2)) in __find_end()
55 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first in __find_end()
67 …_BidirectionalIterator2 __last2, _BinaryPredicate __pred, bidirectional_iterator_tag, bidirectiona… in __find_end() argument
79 if (__pred(*--__l1, *__l2)) in __find_end()
90 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1 in __find_end()
101 …_RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, random_access… in __find_end() argument
117 if (__pred(*--__l1, *__l2)) in __find_end()
126 if (!__pred(*--__m1, *--__m2)) { in __find_end()
136 _BinaryPredicate __pred) { in find_end() argument
[all …]
Dsearch_n.h29 … _Size __count, const _Tp& __value_, _BinaryPredicate __pred, in __search_n() argument
38 if (__pred(*__first, __value_)) in __search_n()
50 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first in __search_n()
63 … const _Tp& __value_, _BinaryPredicate __pred, in __search_n() argument
76 if (__pred(*__first, __value_)) in __search_n()
87 if (!__pred(*__m, __value_)) // if there is a mismatch, restart with a new __first in __search_n()
99 …or __first, _ForwardIterator __last, _Size __count, const _Tp& __value_, _BinaryPredicate __pred) { in search_n() argument
101 __first, __last, _VSTD::__convert_to_integral(__count), __value_, __pred, in search_n()
Dunique_copy.h29 …y(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred, in __unique_copy() argument
39 if (!__pred(__t, *__first)) in __unique_copy()
52 …orwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred, in __unique_copy() argument
62 if (!__pred(*__i, *__first)) in __unique_copy()
75 …(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred, in __unique_copy() argument
82 if (!__pred(*__result, *__first)) in __unique_copy()
92 …y(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) in unique_copy() argument
95 (__first, __last, __result, __pred, in unique_copy()
Dequal.h29 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in equal() argument
31 if (!__pred(*__first1, *__first2)) in equal()
48 _BinaryPredicate __pred, input_iterator_tag, input_iterator_tag) { in __equal() argument
50 if (!__pred(*__first1, *__first2)) in __equal()
58 _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, in __equal() argument
63 … typename add_lvalue_reference<_BinaryPredicate>::type>(__first1, __last1, __first2, __pred); in __equal()
69 _BinaryPredicate __pred) { in equal() argument
71 …__first1, __last1, __first2, __last2, __pred, typename iterator_traits<_InputIterator1>::iterator_… in equal()
Dsearch.h32 … _BinaryPredicate __pred, forward_iterator_tag, forward_iterator_tag) { in __search() argument
40 if (__pred(*__first1, *__first2)) in __search()
52 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1 in __search()
64 _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, in __search() argument
81 if (__pred(*__first1, *__first2)) in __search()
92 if (!__pred(*__m1, *__m2)) { in __search()
103 _BinaryPredicate __pred) { in search() argument
105 __first1, __last1, __first2, __last2, __pred, in search()
Dfind_first_of.h30 … _ForwardIterator2 __last2, _BinaryPredicate __pred) { in __find_first_of_ce() argument
33 if (__pred(*__first1, *__j)) in __find_first_of_ce()
41 _ForwardIterator2 __last2, _BinaryPredicate __pred) { in find_first_of() argument
42 return _VSTD::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
Dis_partitioned.h25 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) in is_partitioned() argument
28 if (!__pred(*__first)) in is_partitioned()
34 if (__pred(*__first)) in is_partitioned()
Dmismatch.h30 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in mismatch() argument
32 if (!__pred(*__first1, *__first2)) in mismatch()
51 _BinaryPredicate __pred) { in mismatch() argument
53 if (!__pred(*__first1, *__first2)) in mismatch()
Dremove_if.h28 remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) in remove_if() argument
31 (__first, __last, __pred); in remove_if()
37 if (!__pred(*__i)) in remove_if()
Dunique.h32 unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) in unique() argument
35 (__first, __last, __pred); in unique()
42 if (!__pred(*__first, *__i)) in unique()
Dnone_of.h26 none_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in none_of() argument
28 if (__pred(*__first)) in none_of()
Dall_of.h26 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in all_of() argument
28 if (!__pred(*__first)) in all_of()
Dany_of.h26 any_of(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in any_of() argument
28 if (__pred(*__first)) in any_of()
Dfind_if_not.h26 find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in find_if_not() argument
28 if (!__pred(*__first)) in find_if_not()
Dfind_if.h26 find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { in find_if() argument
28 if (__pred(*__first)) in find_if()
Dreplace_if.h26 replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_v… in replace_if() argument
29 if (__pred(*__first)) in replace_if()
/freebsd-12-stable/contrib/llvm-project/libcxx/include/__functional/
Dunary_negate.h31 explicit unary_negate(const _Predicate& __pred) in unary_negate() argument
32 : __pred_(__pred) {} in unary_negate()
41 not1(const _Predicate& __pred) {return unary_negate<_Predicate>(__pred);} in not1() argument
Dbinary_negate.h33 binary_negate(const _Predicate& __pred) : __pred_(__pred) {} in binary_negate() argument
44 not2(const _Predicate& __pred) {return binary_negate<_Predicate>(__pred);} in not2() argument
/freebsd-12-stable/contrib/llvm-project/libcxx/include/
Dcondition_variable139 void wait(_Lock& __lock, _Predicate __pred);
152 _Predicate __pred);
165 _Predicate __pred);
209 condition_variable_any::wait(_Lock& __lock, _Predicate __pred)
211 while (!__pred())
233 _Predicate __pred)
235 while (!__pred())
237 return __pred();
255 _Predicate __pred)
258 _VSTD::move(__pred));
/freebsd-12-stable/contrib/libstdc++/include/debug/
Dfunctions.h229 _Predicate __pred, std::forward_iterator_tag) in __check_sorted_aux() argument
236 if (__pred(*__next, *__first)) in __check_sorted_aux()
256 _Predicate __pred) in __check_sorted() argument
260 return __check_sorted_aux(__first, __last, __pred, in __check_sorted()
283 const _Tp& __value, _Pred __pred) in __check_partitioned() argument
285 while (__first != __last && __pred(*__first, __value)) in __check_partitioned()
287 while (__first != __last && !__pred(*__first, __value)) in __check_partitioned()
Dsafe_sequence.h112 _M_invalidate_if(_Predicate __pred);
126 _M_invalidate_if(_Predicate __pred) in _M_invalidate_if() argument
138 if (__pred(__victim->base())) in _M_invalidate_if()
149 if (__pred(__victim->base())) in _M_invalidate_if()
/freebsd-12-stable/contrib/llvm-project/libcxx/include/experimental/
Dfunctional158 _BMSkipTable(size_t __sz, _Value __default, _Hash __hf, _BinaryPredicate __pred)
159 : __default_value_(__default), __table(__sz, __hf, __pred) {}
189 _BMSkipTable(size_t /*__sz*/, _Value __default, _Hash /*__hf*/, _BinaryPredicate /*__pred*/)
224 _Hash __hf = _Hash(), _BinaryPredicate __pred = _BinaryPredicate())
225 : __first_(__f), __last_(__l), __pred_(__pred),
301 …void __compute_bm_prefix ( _Iterator __f, _Iterator __l, _BinaryPredicate __pred, _Container &__pr…
309 while ( __k > 0 && !__pred ( __f[__k], __f[__i] ))
312 if ( __pred ( __f[__k], __f[__i] ))
319 _BinaryPredicate __pred)
327 __compute_bm_prefix(__f, __l, __pred, __scratch);
[all …]

12