| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | stable_partition.h | 38 _Predicate __pred, in __stable_partition_impl() argument 50 if (__pred(*++__m)) { in __stable_partition_impl() 68 if (__pred(*__i)) { in __stable_partition_impl() 101 while (__pred(*__m1)) { in __stable_partition_impl() 128 if (!__pred(*__first)) in __stable_partition_impl() 152 _Predicate __pred, in __stable_partition_impl() argument 167 if (__pred(*++__m)) { in __stable_partition_impl() 188 if (__pred(*__i)) { in __stable_partition_impl() 218 while (!__pred(*--__m1)) { in __stable_partition_impl() 234 while (__pred(*__m1)) { in __stable_partition_impl() [all …]
|
| H A D | partition.h | 29 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_ta… in __partition_impl() argument 33 if (!__pred(*__first)) in __partition_impl() 40 if (__pred(*__p)) { in __partition_impl() 50 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, bidirecti… in __partition_impl() argument 58 if (!__pred(*__first)) in __partition_impl() 65 } while (!__pred(*__last)); in __partition_impl() 73 __partition(_ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_c… in __partition() argument 75 std::move(__first), std::move(__last), __pred, __iter_category); in __partition() 80 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in partition() argument 82 …auto __result = std::__partition<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred,… in partition()
|
| H A D | pstl_any_all_none_of.h | 42 …&& __policy, _ForwardIterator&& __first, _ForwardIterator&& __last, _Predicate&& __pred) noexcept { in __any_of() argument 53 std::move(__pred)); in __any_of() 62 …ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in any_of() argument 64 auto __res = std::__any_of(__policy, std::move(__first), std::move(__last), std::move(__pred)); in any_of() 79 …olicy&& __policy, _ForwardIterator&& __first, _ForwardIterator&& __last, _Pred&& __pred) noexcept { in __all_of() argument 92 std::move(__pred)); in __all_of() 101 all_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred… in all_of() argument 103 auto __res = std::__all_of(__policy, std::move(__first), std::move(__last), std::move(__pred)); in all_of() 129 std::move(__pred)); in __none_of() 138 …_of(_ExecutionPolicy&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Pred __pred) { in none_of() argument [all …]
|
| H A D | is_permutation.h | 77 _Pred&& __pred, 94 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j))) 120 if (!__pred(*__first1, *__first2)) 139 __pred, 158 _Pred&& __pred, 201 _Pred&& __pred, 212 __pred, 232 _Pred&& __pred, 240 __pred, 288 _BinaryPredicate __pred) { [all …]
|
| H A D | ranges_ends_with.h | 47 _Pred& __pred, in __ends_with_fn_impl_bidirectional() 55 … __rbegin1, __rend1, __rbegin2, __rend2, std::ref(__pred), std::ref(__proj1), std::ref(__proj2)); in __ends_with_fn_impl_bidirectional() 64 _Pred& __pred, in __ends_with_fn_impl() 69 …return __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __… in __ends_with_fn_impl() 84 __pred, in __ends_with_fn_impl() 104 _Pred& __pred, in __ends_with_fn_impl_with_offset() 120 std::ref(__pred), in __ends_with_fn_impl_with_offset() 141 _Pred __pred = {}, in operator() 156 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator() 171 __pred, [all …]
|
| H A D | find_end.h | 44 _Pred& __pred, in __find_end_impl() argument 75 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __find_end_impl() 96 _Pred& __pred, in __find_end() argument 114 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end() 147 _Pred& __pred, in __find_end() argument 170 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end() 179 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(*--__m2))) { in __find_end() 192 _BinaryPredicate& __pred) { in __find_end_classic() argument 199 __pred, in __find_end_classic() 213 _BinaryPredicate __pred) { in find_end() argument [all …]
|
| H A D | search_n.h | 35 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument 45 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl() 61 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_forward_impl() 72 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument 89 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_random_access_impl() 102 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_random_access_impl() 117 _Pred& __pred, 121 __first, __last, __count, __value, __pred, __proj, __last - __first); 130 _Pred& __pred, 134 …return std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, … [all …]
|
| H A D | ranges_is_partitioned.h | 38 __is_partitioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_partitioned_impl() 40 if (!std::invoke(__pred, std::invoke(__proj, *__first))) in __is_partitioned_impl() 49 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __is_partitioned_impl() 61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator() 62 return __is_partitioned_impl(std::move(__first), std::move(__last), __pred, __proj); 69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 70 return __is_partitioned_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | search.h | 40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument 50 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl() 65 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_forward_impl() 88 _Pred& __pred, in __search_random_access_impl() argument 101 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_random_access_impl() 112 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl() 126 _Pred& __pred, 141 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); 150 _Pred& __pred, 165 _BinaryPredicate __pred) { in search() argument [all …]
|
| H A D | ranges_remove_if.h | 41 __remove_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __remove_if_impl() argument 42 auto __new_end = ranges::__find_if_impl(__first, __last, __pred, __proj); in __remove_if_impl() 48 if (!std::invoke(__pred, std::invoke(__proj, *__i))) { in __remove_if_impl() 63 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator() 64 return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj); 72 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 73 return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | make_projected.h | 32 _Pred& __pred; // Can be a unary or a binary predicate. member 36 : __pred(__pred_arg), __proj(__proj_arg) {} in _ProjectedPred() 42 return std::__invoke(__pred, std::__invoke(__proj, std::forward<_Tp>(__v))); in operator() 52 …__pred, std::__invoke(__proj, std::forward<_T1>(__lhs)), std::__invoke(__proj, std::forward<_T2>(_… in operator() 60 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ProjectedPred<_Pred, _Proj> __make_projected(_Pred& __pred… in __make_projected() argument 61 return _ProjectedPred<_Pred, _Proj>(__pred, __proj); in __make_projected() 71 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _Pred& __make_projected(_Pred& __pred, _Proj&) { in __make_projected() argument 72 return __pred; in __make_projected()
|
| H A D | ranges_all_of.h | 36 …BI constexpr static bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __all_of_impl() 38 if (!std::invoke(__pred, std::invoke(__proj, *__first))) in __all_of_impl() 49 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator() 50 return __all_of_impl(std::move(__first), std::move(__last), __pred, __proj); 57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 58 return __all_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_any_of.h | 36 …BI constexpr static bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __any_of_impl() 38 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __any_of_impl() 49 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator() 50 return __any_of_impl(std::move(__first), std::move(__last), __pred, __proj); 57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 58 return __any_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_none_of.h | 37 __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl() 39 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __none_of_impl() 50 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator() 51 return __none_of_impl(std::move(__first), std::move(__last), __pred, __proj); 58 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 59 return __none_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_find_if.h | 37 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& _… in __find_if_impl() argument 39 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __find_if_impl() 52 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator() 53 return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj); 58 operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator() 59 return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
|
| H A D | ranges_count_if.h | 38 __count_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __count_if_impl() argument 41 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __count_if_impl() 54 operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const { in operator() 55 return ranges::__count_if_impl(std::move(__first), std::move(__last), __pred, __proj); 62 operator()(_Range&& __r, _Predicate __pred, _Proj __proj = {}) const { in operator() 63 return ranges::__count_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
|
| H A D | equal.h | 40 …tIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate& __pred) { in __equal_iter_impl() argument 42 if (!__pred(*__first1, *__first2)) in __equal_iter_impl() 60 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in equal() argument 62 … std::__unwrap_iter(__first1), std::__unwrap_iter(__last1), std::__unwrap_iter(__first2), __pred); in equal() 78 _BinaryPredicate __pred, in __equal() argument 82 if (!__pred(*__first1, *__first2)) in __equal() 119 _BinaryPredicate __pred, in __equal() argument 130 __pred, in __equal() 141 _BinaryPredicate __pred) { in equal() argument 147 __pred, in equal()
|
| H A D | ranges_partition.h | 48 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __partition_fn_impl() 49 auto&& __projected_pred = std::__make_projected(__pred, __proj); in __partition_fn_impl() 61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator() 62 return __partition_fn_impl(__first, __last, __pred, __proj); 70 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 71 return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_partition_point.h | 44 __partition_point_fn_impl(_Iter&& __first, _Sent&& __last, _Pred& __pred, _Proj& __proj) { in __partition_point_fn_impl() 51 if (std::invoke(__pred, std::invoke(__proj, *__mid))) { in __partition_point_fn_impl() 67 …_LIBCPP_HIDE_FROM_ABI constexpr _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj … in operator() 68 return __partition_point_fn_impl(std::move(__first), std::move(__last), __pred, __proj); 75 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 76 return __partition_point_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_stable_partition.h | 50 __stable_partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl() 53 auto&& __projected_pred = std::__make_projected(__pred, __proj); in __stable_partition_fn_impl() 65 …_LIBCPP_HIDE_FROM_ABI subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj … in operator() 66 return __stable_partition_fn_impl(__first, __last, __pred, __proj); 74 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator() 75 return __stable_partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | unique_copy.h | 44 _BinaryPredicate&& __pred, in __unique_copy() argument 51 if (!__pred(__t, *__first)) { in __unique_copy() 66 _BinaryPredicate&& __pred, in __unique_copy() argument 73 if (!__pred(*__i, *__first)) { in __unique_copy() 88 _BinaryPredicate&& __pred, in __unique_copy() argument 93 if (!__pred(*__result, *__first)) in __unique_copy() 102 …_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) { in unique_copy() argument 113 std::move(__first), std::move(__last), std::move(__result), __pred, __algo_tag()) in unique_copy()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/ |
| H A D | any_of.h | 49 _LIBCPP_HIDE_FROM_ABI bool __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept { in __simd_or() argument 56 if (__pred(*(__first + __i))) in __simd_or() 74 …l_any_of(__cpu_backend_tag, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in __pstl_any_of() argument 78 __first, __last, [&__pred](_ForwardIterator __brick_first, _ForwardIterator __brick_last) { in __pstl_any_of() 80 __cpu_backend_tag{}, __brick_first, __brick_last, __pred); in __pstl_any_of() 86 return std::__simd_or(__first, __last - __first, __pred); in __pstl_any_of() 88 return std::any_of(__first, __last, __pred); in __pstl_any_of()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | take_while_view.h | 61 …PP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 take_while_view(_View __base, _Pred __pred) in take_while_view() argument 62 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {} in take_while_view() 116 _LIBCPP_HIDE_FROM_ABI constexpr explicit __sentinel(sentinel_t<_Base> __end, const _Pred* __pred) in __sentinel() argument 117 : __end_(std::move(__end)), __pred_(__pred) {} in __sentinel() 142 …[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) co… 143 …oexcept(noexcept(/**/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)))) 144 … -> decltype(/*--*/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))) { 145 …turn /*-------------*/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)); 150 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const in operator() 152 return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred))); in operator()
|
| H A D | drop_while_view.h | 57 …PP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 drop_while_view(_View __base, _Pred __pred) in drop_while_view() argument 58 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {} in drop_while_view() 108 …[[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) co… 109 …oexcept(noexcept(/**/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)))) 110 … -> decltype(/*--*/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred))) { 111 …turn /*-------------*/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred)); 116 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const in operator() 118 return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred))); in operator()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/ |
| H A D | condition_variable | 162 _LIBCPP_HIDE_FROM_ABI void wait(_Lock& __lock, _Predicate __pred); 232 while (!__pred()) 248 while (!__pred()) 250 return __pred(); 270 return __pred(); 291 if (__pred()) 307 return __pred(); 315 _Predicate __pred) { 317 return __pred(); 323 if (__pred()) [all …]
|