Home
last modified time | relevance | path

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

1234

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dstable_partition.h41 if (__pred(*++__m)) in __stable_partition_impl()
62 if (__pred(*__i)) in __stable_partition_impl()
91 __first, __m, __pred, __len2, __p, __fit); in __stable_partition_impl()
98 while (__pred(*__m1)) in __stable_partition_impl()
127 if (!__pred(*__first)) in __stable_partition_impl()
168 if (__pred(*++__m)) in __stable_partition_impl()
192 if (__pred(*__i)) in __stable_partition_impl()
225 while (!__pred(*--__m1)) in __stable_partition_impl()
243 while (__pred(*__m1)) in __stable_partition_impl()
274 if (!__pred(*__first)) in __stable_partition_impl()
[all …]
H A Dpartition.h27 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_ta… in __partition_impl() argument
33 if (!__pred(*__first)) in __partition_impl()
41 if (__pred(*__p)) in __partition_impl()
52 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, in __partition_impl() argument
64 if (!__pred(*__first)) in __partition_impl()
72 } while (!__pred(*__last)); in __partition_impl()
81 … _ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_category) { in __partition() argument
83 std::move(__first), std::move(__last), __pred, __iter_category); in __partition()
89 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) in partition() argument
92 …auto __result = std::__partition<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred,… in partition()
H A Dis_permutation.h99 _BinaryPredicate&& __pred) {
102 if (!__pred(*__first1, *__first2))
118 __pred, __identity(), __identity());
127 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
152 __pred, __proj1, __proj2);
161 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
167 __pred, __proj1, __proj2,
180 __pred, __proj1, __proj2,
190 _BinaryPredicate __pred) {
226 _ForwardIterator2 __last2, _BinaryPredicate __pred) {
[all …]
H A Dfind_end.h45 _Pred& __pred, in __find_end_impl() argument
76 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __find_end_impl()
99 _Pred& __pred, in __find_end() argument
117 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
152 _Pred& __pred, in __find_end() argument
175 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
184 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(*--__m2))) { in __find_end()
195 _BinaryPredicate& __pred) { in __find_end_classic() argument
202 __pred, in __find_end_classic()
214 _BinaryPredicate __pred) { in find_end() argument
[all …]
H A Dsearch_n.h36 _Pred& __pred, in __search_n_forward_impl() argument
47 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl()
63 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) in __search_n_forward_impl()
78 _Pred& __pred, in __search_n_random_access_impl() argument
97 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_random_access_impl()
110 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) in __search_n_random_access_impl()
129 _Pred& __pred,
135 __pred,
149 _Pred& __pred,
156 __pred,
[all …]
H A Dranges_is_partitioned.h36 bool __is_parititioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_parititioned_impl()
38 if (!std::invoke(__pred, std::invoke(__proj, *__first))) in __is_parititioned_impl()
47 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __is_parititioned_impl()
58 bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
59 return __is_parititioned_impl(std::move(__first), std::move(__last), __pred, __proj);
66 bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
67 return __is_parititioned_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dsearch.h39 _Pred& __pred, in __search_forward_impl() argument
51 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
66 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __search_forward_impl()
86 _Pred& __pred, in __search_random_access_impl() argument
110 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl()
126 _Pred& __pred,
143 __pred,
158 _Pred& __pred,
167 __pred,
176 _BinaryPredicate __pred) { in search() argument
[all …]
H A Dranges_remove_if.h38 subrange<_Iter> __remove_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __remove_if_impl() argument
39 auto __new_end = ranges::__find_if_impl(__first, __last, __pred, __proj); in __remove_if_impl()
45 if (!std::invoke(__pred, std::invoke(__proj, *__i))) { in __remove_if_impl()
60 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
61 return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj);
69 borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
70 return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dequal.h26 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in equal() argument
28 if (!__pred(*__first1, *__first2)) in equal()
45 _BinaryPredicate __pred, input_iterator_tag, input_iterator_tag) { in __equal() argument
47 if (!__pred(*__first1, *__first2)) in __equal()
55 _RandomAccessIterator2 __last2, _BinaryPredicate __pred, random_access_iterator_tag, in __equal() argument
60 _BinaryPredicate&>(__first1, __last1, __first2, __pred); in __equal()
66 _BinaryPredicate __pred) { in equal() argument
68 …__first1, __last1, __first2, __last2, __pred, typename iterator_traits<_InputIterator1>::iterator_… in equal()
H A Dranges_none_of.h35 bool __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl()
37 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __none_of_impl()
46 bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
47 return __none_of_impl(std::move(__first), std::move(__last), __pred, __proj);
53 bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
54 return __none_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dranges_all_of.h35 bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __all_of_impl()
37 if (!std::invoke(__pred, std::invoke(__proj, *__first))) in __all_of_impl()
46 bool operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
47 return __all_of_impl(std::move(__first), std::move(__last), __pred, __proj);
53 bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
54 return __all_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dranges_any_of.h35 bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __any_of_impl()
37 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __any_of_impl()
46 bool operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
47 return __any_of_impl(std::move(__first), std::move(__last), __pred, __proj);
53 bool operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
54 return __any_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dmake_projected.h32 _Pred& __pred; // Can be a unary or a binary predicate. member
35 …_LIBCPP_CONSTEXPR _ProjectedPred(_Pred& __pred_arg, _Proj& __proj_arg) : __pred(__pred_arg), __pro… in _ProjectedPred()
42 return std::__invoke(__pred, std::__invoke(__proj, std::forward<_Tp>(__v))); in operator()
51 return std::__invoke(__pred, in operator()
77 __make_projected(_Pred& __pred, _Proj& __proj) {
78 return _ProjectedPred<_Pred, _Proj>(__pred, __proj);
90 __make_projected(_Pred& __pred, _Proj&) {
91 return __pred;
H A Dranges_count_if.h36 _Pred& __pred, _Proj& __proj) { in __count_if_impl() argument
39 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __count_if_impl()
50 …iter_difference_t<_Iter> operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj =… in operator()
51 return ranges::__count_if_impl(std::move(__first), std::move(__last), __pred, __proj);
57 range_difference_t<_Range> operator()(_Range&& __r, _Predicate __pred, _Proj __proj = {}) const { in operator()
58 return ranges::__count_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
H A Dranges_find_if.h35 _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& __proj) { in __find_if_impl() argument
37 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __find_if_impl()
49 _Ip operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
50 return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj);
56 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
57 return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
H A Dranges_stable_partition.h49 _Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl()
52 auto&& __projected_pred = std::__make_projected(__pred, __proj); in __stable_partition_fn_impl()
63 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
64 return __stable_partition_fn_impl(__first, __last, __pred, __proj);
71 borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
72 return __stable_partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dranges_partition_point.h42 …static _Iter __partition_point_fn_impl(_Iter&& __first, _Sent&& __last, _Pred& __pred, _Proj& __pr… in __partition_point_fn_impl()
49 if (std::invoke(__pred, std::invoke(__proj, *__mid))) { in __partition_point_fn_impl()
64 _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
65 return __partition_point_fn_impl(std::move(__first), std::move(__last), __pred, __proj);
71 borrowed_iterator_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
72 return __partition_point_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dranges_partition.h46 …subrange<__uncvref_t<_Iter>> __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, … in __partition_fn_impl()
47 auto&& __projected_pred = std::__make_projected(__pred, __proj); in __partition_fn_impl()
57 subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
58 return __partition_fn_impl(__first, __last, __pred, __proj);
65 borrowed_subrange_t<_Range> operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
66 return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dranges_adjacent_find.h37 _Iter __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find_impl()
43 if (std::invoke(__pred, std::invoke(__proj, *__first), std::invoke(__proj, *__i))) in __adjacent_find_impl()
54 _Iter operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
55 return __adjacent_find_impl(std::move(__first), std::move(__last), __pred, __proj);
63 …borrowed_iterator_t<_Range> operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) con… in operator()
64 return __adjacent_find_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
H A Dunique_copy.h41 _BinaryPredicate&& __pred, in __unique_copy() argument
48 if (!__pred(__t, *__first)) { in __unique_copy()
63 _BinaryPredicate&& __pred, in __unique_copy() argument
70 if (!__pred(*__i, *__first)) { in __unique_copy()
85 _BinaryPredicate&& __pred, in __unique_copy() argument
90 if (!__pred(*__result, *__first)) in __unique_copy()
99 …_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) { in unique_copy() argument
110 std::move(__first), std::move(__last), std::move(__result), __pred, __algo_tag()) in unique_copy()
H A Dranges_replace_if.h34 _Iter __replace_if_impl(_Iter __first, _Sent __last, _Pred& __pred, const _Type& __new_value, _Proj… in __replace_if_impl() argument
36 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __replace_if_impl()
51 …_Iter operator()(_Iter __first, _Sent __last, _Pred __pred, const _Type& __new_value, _Proj __proj… in operator()
52 …return ranges::__replace_if_impl(std::move(__first), std::move(__last), __pred, __new_value, __pro…
61 operator()(_Range&& __range, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const { in operator()
62 …return ranges::__replace_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __new_value…
H A Dranges_search_n.h43 …_Iter1 __first, _Sent1 __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj)… in __ranges_search_n_impl()
58 __pred, in __ranges_search_n_impl()
68 __pred, in __ranges_search_n_impl()
82 _Pred __pred = {}, in operator()
84 return __ranges_search_n_impl(__first, __last, __count, __value, __pred, __proj);
93 _Pred __pred = {}, in operator()
106 …nges_search_n_impl(ranges::begin(__range), ranges::end(__range), __count, __value, __pred, __proj);
H A Dranges_remove_copy_if.h43 __remove_copy_if_impl(_InIter __first, _Sent __last, _OutIter __result, _Pred& __pred, _Proj& __pro… in __remove_copy_if_impl() argument
45 if (!std::invoke(__pred, std::invoke(__proj, *__first))) { in __remove_copy_if_impl()
63 …operator()(_InIter __first, _Sent __last, _OutIter __result, _Pred __pred, _Proj __proj = {}) cons… in operator()
64 …:__remove_copy_if_impl(std::move(__first), std::move(__last), std::move(__result), __pred, __proj);
73 operator()(_Range&& __range, _OutIter __result, _Pred __pred, _Proj __proj = {}) const { in operator()
75 ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __proj);
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dalgorithm_impl.h43 return std::any_of(__first, __last, __pred); in __brick_any_of()
534 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return __pred(__it[__i]); }); in __brick_find_if()
540 _Predicate __pred) noexcept in __pattern_find_if() argument
862 … [&__value, &__pred](const _Tp& __val) { return !__pred(__val, __value); }); in __pattern_search_n()
1010 _UnaryPredicate __pred, in __brick_copy_if() argument
1034 *__mask = __pred(*__first); in __brick_calc_mask_1()
1344 …[&__pred](bool& __x, _ReferenceType __y, _ReferenceType __z) { __x = !__pred(__y, __z); }, _IsVect… in __pattern_unique()
1792 [&__pred](_RandomAccessIterator __it, _SizeType __i) { return !__pred(__it[__i]); }); in __brick_is_partitioned()
1859 if (__pred(*__i)) in __pattern_is_partitioned()
2694 … __b, __e, __it, [&__pred](bool& __x, _ReferenceType __y) { __x = !__pred(__y); }, _IsVector{}); in __pattern_remove_if()
[all …]
H A Dunseq_backend_simd.h73 if (__pred(__first[__i])) in __simd_or()
84 if (__pred(*(__first + __i))) in __simd_or()
173 if (__pred(__first1[__i], __first2[__i])) in __simd_first()
211 if (__pred(*(__first1), *(__first2))) in __simd_first()
225 if (__pred(*(__index + __i))) in __simd_count()
276 if (__pred(__first[__i])) in __simd_copy_if()
309 __mask[__i] = __pred(__first[__i]); in __simd_calc_mask_1()
437 if (__pred(*__first, *(__first + 1))) in __simd_adjacent_find()
768 if (__pred(__first[__i])) in __simd_partition_copy()
835 [&__pred](_RandomAccessIterator __it, _DifferenceType __i) { return __pred(__it[__i]); }); in __simd_remove_if()
[all …]

1234