| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | stable_partition.h | 38 _Predicate __pred, in __stable_partition_impl()
50 if (__pred(*++__m)) { in __stable_partition_impl()
68 if (__pred(*__i)) { in __stable_partition_impl()
94 std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__first, __m, __pred, __len2, __p, __fit); in __stable_partition_impl()
101 while (__pred(*__m1)) { in __stable_partition_impl()
108 __second_false = std::__stable_partition_impl<_AlgPolicy, _Predicate&>(__m1, __last, __pred, __len_half, __p, __fit); in __stable_partition_impl()
119 __stable_partition_impl(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) {
128 if (!__pred(*__first)) in __stable_partition_impl()
145 std::move(__first), std::move(__last), __pred, __len, __p, forward_iterator_tag()); in __stable_partition_impl()
152 _Predicate __pred, in __stable_partition_impl()
33 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,_Distance __len,_Pair __p,forward_iterator_tag __fit) __stable_partition_impl() argument
122 __stable_partition_impl(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred,forward_iterator_tag) __stable_partition_impl() argument
157 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,_Distance __len,_Pair __p,bidirectional_iterator_tag __bit) __stable_partition_impl() argument
268 __stable_partition_impl(_BidirectionalIterator __first,_BidirectionalIterator __last,_Predicate __pred,bidirectional_iterator_tag) __stable_partition_impl() argument
312 __stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate && __pred,_IterCategory __iter_category) __stable_partition() argument
320 stable_partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) stable_partition() argument
[all...] |
| H A D | ranges_find_last.h | 41 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl() argument
49 if (__pred(std::invoke(__proj, *__it))) { in __find_last_impl()
53 if (__pred(std::invoke(__proj, *__first))) { in __find_last_impl()
61 if (__pred(std::invoke(__proj, *__first))) { in __find_last_impl()
106 _Pred& __pred; member
109 return std::invoke(__pred, std::forward<_Elem>(__elem)); in decltype()
118 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) { in operator()
119 …return ranges::__find_last_impl(std::move(__first), std::move(__last), __op<_Pred>{__pred}, __proj…
126 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) { in operator()
127 …anges::__find_last_impl(ranges::begin(__range), ranges::end(__range), __op<_Pred>{__pred}, __proj);
[all …]
|
| H A D | partition.h | 29 __partition_impl(_ForwardIterator __first, _Sentinel __last, _Predicate __pred, forward_iterator_tag) { in __partition_impl()
33 if (!__pred(*__first)) in __partition_impl()
40 if (__pred(*__p)) { in __partition_impl()
50 __partition_impl(_BidirectionalIterator __first, _Sentinel __sentinel, _Predicate __pred, bidirectional_iterator_tag) {
58 if (!__pred(*__first)) in __partition_impl()
65 } while (!__pred(*__last)); in __partition_impl()
73 __partition(_ForwardIterator __first, _Sentinel __last, _Predicate&& __pred, _IterCategory __iter_category) { in __partition_impl()
75 std::move(__first), std::move(__last), __pred, __iter_category); in __partition_impl()
80 partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { in __partition() argument
82 auto __result = std::__partition<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred, _IterCategor in __partition()
26 __partition_impl(_ForwardIterator __first,_Sentinel __last,_Predicate __pred,forward_iterator_tag) __partition_impl() argument
51 __partition_impl(_BidirectionalIterator __first,_Sentinel __sentinel,_Predicate __pred,bidirectional_iterator_tag) __partition_impl() argument
88 partition(_ForwardIterator __first,_ForwardIterator __last,_Predicate __pred) partition() argument
[all...] |
| H A D | is_permutation.h | 77 _Pred&& __pred,
86 if (std::__invoke(__pred, std::__invoke(__proj1, *__match), std::__invoke(__proj1, *__i)))
94 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
103 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj1, *__j)))
117 …ardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __pred) {
120 if (!__pred(*__first1, *__first2))
139 __pred,
158 _Pred&& __pred,
164 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
184 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
[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()
119 __search_n_impl(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _… in __search_n_impl() argument
121 __first, __last, __count, __value, __pred, __proj, __last - __first); in __search_n_impl()
134 __search_n_impl(_Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred,… in __search_n_impl() argument
135 …return std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, … in __search_n_impl()
[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()
111 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,… in __ends_with_fn_impl_with_offset()
120 std::ref(__pred), in __ends_with_fn_impl_with_offset()
141 _Pred __pred = {}, in operator()
145 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
[all …]
|
| H A D | find_end.h | 44 _Pred& __pred, in __find_end_impl() argument
58 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __find_end_impl()
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()
127 … if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) { 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
[all …]
|
| 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()
131 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
142 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
158 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
159 …return std::__search_forward_impl<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __pred,… in __search_impl()
[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 | mismatch.h | 41 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop() argument
43 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch_loop()
53 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch() argument
54 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
115 __equal_to __pred; in __mismatch_vectorized() local
117 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj, __proj); in __mismatch_vectorized()
141 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __pr… in __mismatch() argument
143 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
154 …utIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __pred) { in mismatch() argument
157 …iter(__first1), std::__unwrap_iter(__last1), std::__unwrap_iter(__first2), __pred, __proj, __proj); in mismatch()
[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_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_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_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 | unique_copy.h | 44 _BinaryPredicate&& __pred, in __unique_copy()
51 if (!__pred(__t, *__first)) { in __unique_copy()
66 _BinaryPredicate&& __pred, in __unique_copy()
73 if (!__pred(*__i, *__first)) { in __unique_copy()
88 _BinaryPredicate&& __pred, in __unique_copy()
93 if (!__pred(*__result, *__first)) in __unique_copy()
102 unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred) { in unique_copy()
113 std::move(__first), std::move(__last), std::move(__result), __pred, __algo_tag())
41 __unique_copy(_InputIterator __first,_Sent __last,_OutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__read_from_tmp_value_tag) __unique_copy() argument
63 __unique_copy(_ForwardIterator __first,_Sent __last,_OutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__reread_from_input_tag) __unique_copy() argument
85 __unique_copy(_InputIterator __first,_Sent __last,_InputAndOutputIterator __result,_BinaryPredicate && __pred,__unique_copy_tags::__reread_from_output_tag) __unique_copy() argument
99 unique_copy(_InputIterator __first,_InputIterator __last,_OutputIterator __result,_BinaryPredicate __pred) unique_copy() argument
|
| 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 {
62 return __partition_fn_impl(__first, __last, __pred, __proj);
70 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
71 return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_impl.h | |
| H A D | unseq_backend_simd.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__ranges/ |
| H A D | take_while_view.h | 61 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 take_while_view(_View __base, _Pred __pred)
62 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {}
116 _LIBCPP_HIDE_FROM_ABI constexpr explicit __sentinel(sentinel_t<_Base> __end, const _Pred* __pred)
117 : __end_(std::move(__end)), __pred_(__pred) {}
142 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) const
143 noexcept(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 return /*-------------*/ take_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred));
150 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const
152 return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred)));
70 take_while_view(_View __base,_Pred __pred) take_while_view() argument
125 __sentinel(sentinel_t<_Base> __end,const _Pred * __pred) __sentinel() argument
[all...] |
| H A D | drop_while_view.h | 57 _LIBCPP_HIDE_FROM_ABI constexpr _LIBCPP_EXPLICIT_SINCE_CXX23 drop_while_view(_View __base, _Pred __pred) in base()
58 : __base_(std::move(__base)), __pred_(std::in_place, std::move(__pred)) {} in base()
108 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Range&& __range, _Pred&& __pred) const
109 noexcept(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 return /*-------------*/ drop_while_view(std::forward<_Range>(__range), std::forward<_Pred>(__pred));
116 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI constexpr auto operator()(_Pred&& __pred) const
118 return __range_adaptor_closure_t(std::__bind_back(*this, std::forward<_Pred>(__pred)));
54 drop_while_view(_View __base,_Pred __pred) drop_while_view() argument
|
| /freebsd/contrib/llvm-project/libcxx/include/ |
| H A D | condition_variable | 160 _LIBCPP_HIDE_FROM_ABI void wait(_Lock& __lock, _Predicate __pred);
168 wait_until(_Lock& __lock, const chrono::time_point<_Clock, _Duration>& __t, _Predicate __pred);
174 …DE_FROM_ABI wait_for(_Lock& __lock, const chrono::duration<_Rep, _Period>& __d, _Predicate __pred);
179 …BILITY_SYNC _LIBCPP_HIDE_FROM_ABI bool wait(_Lock& __lock, stop_token __stoken, _Predicate __pred);
183 …, stop_token __stoken, const chrono::time_point<_Clock, _Duration>& __abs_time, _Predicate __pred);
187 …__lock, stop_token __stoken, const chrono::duration<_Rep, _Period>& __rel_time, _Predicate __pred);
229 inline void condition_variable_any::wait(_Lock& __lock, _Predicate __pred) {
230 while (!__pred())
245 …y::wait_until(_Lock& __lock, const chrono::time_point<_Clock, _Duration>& __t, _Predicate __pred) {
246 while (!__pred())
[all …]
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/ |
| H A D | any_of.h | 48 _LIBCPP_HIDE_FROM_ABI bool __simd_or(_Index __first, _DifferenceType __n, _Pred __pred) noexcept { in __simd_or() argument
55 if (__pred(*(__first + __i))) in __simd_or()
75 …&& __policy, _ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) const noexcept { in operator()
79 …__first, __last, [&__policy, &__pred](_ForwardIterator __brick_first, _ForwardIterator __brick_las… in operator()
81 …_res = _AnyOfUnseq()(std::__remove_parallel_policy(__policy), __brick_first, __brick_last, __pred); in operator()
87 return __pstl::__simd_or(__first, __last - __first, __pred); in operator()
89 return std::any_of(__first, __last, __pred); in operator()
|