| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_find_last.h | 42 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl() argument
50 if (__pred(std::invoke(__proj, *__it))) { in __find_last_impl()
54 if (__pred(std::invoke(__proj, *__first))) { in __find_last_impl()
62 if (__pred(std::invoke(__proj, *__first))) { in __find_last_impl()
89 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) { in operator()
90 …turn ranges::__find_last_impl(std::move(__first), std::move(__last), __op<_Type>{__value}, __proj);
96 operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) { in operator()
97 …nges::__find_last_impl(ranges::begin(__range), ranges::end(__range), __op<_Type>{__value}, __proj);
116 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) { in operator()
117 …eturn ranges::__find_last_impl(std::move(__first), std::move(__last), __op<_Pred>{__pred}, __proj);
[all …]
|
| H A D | ranges_min.h | 46 _Proj __proj = {}) const {
47 return std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)) ? __b : __a;
54 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
57 return *std::__min_element(__il.begin(), __il.end(), __comp, __proj);
65 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
70 return *std::__min_element(__first, __last, __comp, __proj);
74 if (std::invoke(__comp, std::invoke(__proj, *__first), std::invoke(__proj, __result)))
|
| H A D | ranges_max.h | 47 _Proj __proj = {}) const {
48 return std::invoke(__comp, std::invoke(__proj, __a), std::invoke(__proj, __b)) ? __b : __a;
55 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 return *std::__min_element(__il.begin(), __il.end(), __comp_lhs_rhs_swapped, __proj);
68 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
78 … return *std::__min_element(std::move(__first), std::move(__last), __comp_lhs_rhs_swapped, __proj);
82 if (std::invoke(__comp, std::invoke(__proj, __result), std::invoke(__proj, *__first)))
|
| H A D | search_n.h | 36 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
46 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl()
62 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_forward_impl()
73 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument
90 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_random_access_impl()
103 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_random_access_impl()
120 …(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_impl() argument
122 __first, __last, __count, __value, __pred, __proj, __last - __first); in __search_n_impl()
135 …Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_impl() argument
136 …std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, __proj); in __search_n_impl()
[all …]
|
| H A D | lower_bound.h | 35 _Proj& __proj) { in __lower_bound_bisecting() argument
40 if (std::__invoke(__comp, std::__invoke(__proj, *__m), __value)) { in __lower_bound_bisecting()
61 …sided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& __proj) { in __lower_bound_onesided() argument
63 if (__first == __last || !std::__invoke(__comp, std::__invoke(__proj, *__first), __value)) in __lower_bound_onesided()
72 if (__it == __last || !std::__invoke(__comp, std::__invoke(__proj, *__it), __value)) { in __lower_bound_onesided()
77 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound_onesided()
87 …bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& __proj) { in __lower_bound() argument
89 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound()
96 auto __proj = std::__identity(); in lower_bound() local
97 return std::__lower_bound<_ClassicAlgPolicy>(__first, __last, __value, __comp, __proj); in lower_bound()
|
| H A D | ranges_is_partitioned.h | 37 __is_partitioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_partitioned_impl()
39 if (!std::invoke(__pred, std::invoke(__proj, *__first))) in __is_partitioned_impl()
48 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __is_partitioned_impl()
60 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
61 return __is_partitioned_impl(std::move(__first), std::move(__last), __pred, __proj);
68 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
69 return __is_partitioned_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | for_each_n.h | 44 __for_each_n(_InputIterator __first, _Size __orig_n, _Func& __f, _Proj& __proj) { in __for_each_n() argument
48 std::__invoke(__f, std::__invoke(__proj, *__first)); in __for_each_n()
61 __for_each_n(_RandIter __first, _Size __orig_n, _Func& __f, _Proj& __proj) { in __for_each_n() argument
64 std::__for_each(__first, __last, __f, __proj); in __for_each_n()
79 __for_each_n(_SegmentedIterator __first, _Size __orig_n, _Func& __f, _Proj& __proj) { in __for_each_n() argument
82 std::__for_each(__lfirst, __llast, __f, __proj); in __for_each_n()
92 __identity __proj; in for_each_n() local
93 return std::__for_each_n(__first, __orig_n, __f, __proj); in for_each_n()
|
| H A D | ranges_is_sorted_until.h | 38 __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_sorted_until_impl() argument
43 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) in __is_sorted_until_impl()
56 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
57 return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj);
64 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 …eturn ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
|
| 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()
62 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
63 return ranges::__remove_if_impl(std::move(__first), std::move(__last), __pred, __proj);
71 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
72 return ranges::__remove_if_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_clamp.h | 38 …pe& __value, const _Type& __low, const _Type& __high, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
40 !bool(std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __low))),
43 auto&& __projected = std::invoke(__proj, __value);
44 …if (std::invoke(__comp, std::forward<decltype(__projected)>(__projected), std::invoke(__proj, __lo…
46 …else if (std::invoke(__comp, std::invoke(__proj, __high), std::forward<decltype(__projected)>(__pr…
|
| H A D | ranges_find.h | 42 __find_unwrap(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find_unwrap()
46 … std::move(__first), std::__find(std::move(__first_un), std::move(__last_un), __value, __proj)); in __find_unwrap()
48 return std::__find(std::move(__first), std::move(__last), __value, __proj); in __find_unwrap()
55 operator()(_Ip __first, _Sp __last, const _Tp& __value, _Proj __proj = {}) const { in operator()
56 return __find_unwrap(std::move(__first), std::move(__last), __value, __proj);
62 operator()(_Rp&& __r, const _Tp& __value, _Proj __proj = {}) const { in operator()
63 return __find_unwrap(ranges::begin(__r), ranges::end(__r), __value, __proj);
|
| H A D | for_each.h | 32 __for_each(_InputIterator __first, _Sent __last, _Func& __f, _Proj& __proj) { in __for_each() argument
34 std::__invoke(__f, std::__invoke(__proj, *__first)); in __for_each()
44 __for_each(_SegmentedIterator __first, _SegmentedIterator __last, _Func& __func, _Proj& __proj) { in __for_each() argument
47 std::__for_each(__lfirst, __llast, __func, __proj); in __for_each()
56 __identity __proj; in for_each() local
57 std::__for_each(__first, __last, __f, __proj); in for_each()
|
| H A D | ranges_for_each.h | 45 __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { in __for_each_impl()
51 auto __end = std::__for_each_n(std::move(__first), __n, __func, __proj); in __for_each_impl()
54 auto __end = std::__for_each(std::move(__first), std::move(__last), __func, __proj); in __for_each_impl()
65 operator()(_Iter __first, _Sent __last, _Func __func, _Proj __proj = {}) const { in operator()
66 return __for_each_impl(std::move(__first), std::move(__last), __func, __proj);
73 operator()(_Range&& __range, _Func __func, _Proj __proj = {}) const { in operator()
74 return __for_each_impl(ranges::begin(__range), ranges::end(__range), __func, __proj);
|
| H A D | ranges_none_of.h | 36 __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl()
38 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __none_of_impl()
49 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
50 return __none_of_impl(std::move(__first), std::move(__last), __pred, __proj);
57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
58 return __none_of_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_minmax.h | 59 _Proj __proj = {}) const {
60 if (std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)))
69 operator()(initializer_list<_Type> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
72 auto __iters = std::__minmax_element_impl(__il.begin(), __il.end(), __comp, __proj);
81 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
114 auto __result = std::__minmax_element_impl(__first, __last, __comp, __proj);
121 std::invoke(__proj, std::forward<decltype(__a)>(__a)),
122 std::invoke(__proj, std::forward<decltype(__b)>(__b)));
|
| H A D | ranges_binary_search.h | 42 …operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}… in operator()
43 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
44 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
52 operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
55 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
56 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
|
| H A D | ranges_find_if.h | 37 …HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& __proj) { in __find_if_impl() argument
39 if (std::invoke(__pred, std::invoke(__proj, *__first))) in __find_if_impl()
51 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
52 return ranges::__find_if_impl(std::move(__first), std::move(__last), __pred, __proj);
57 operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
58 return ranges::__find_if_impl(ranges::begin(__r), ranges::end(__r), __pred, __proj);
|
| H A D | ranges_is_heap.h | 40 __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl()
42 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __is_heap_fn_impl()
53 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
54 return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
61 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
62 return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
|
| H A D | ranges_make_heap.h | 46 __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl()
49 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __make_heap_fn_impl()
58 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 return __make_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
65 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
66 return __make_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_partition.h | 47 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __partition_fn_impl()
48 auto&& __projected_pred = std::__make_projected(__pred, __proj); in __partition_fn_impl()
60 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
61 return __partition_fn_impl(__first, __last, __pred, __proj);
69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
70 return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| H A D | ranges_sort_heap.h | 46 __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl()
49 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __sort_heap_fn_impl()
58 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 return __sort_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
65 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
66 return __sort_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_partition_point.h | 42 __partition_point_fn_impl(_Iter&& __first, _Sent&& __last, _Pred& __pred, _Proj& __proj) { in __partition_point_fn_impl()
49 if (std::invoke(__pred, std::invoke(__proj, *__mid))) { in __partition_point_fn_impl()
65 …BI constexpr _Iter operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
66 return __partition_point_fn_impl(std::move(__first), std::move(__last), __pred, __proj);
73 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
74 return __partition_point_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/ |
| H A D | lower_bound.h | 36 _Proj& __proj) { in __lower_bound_bisecting() argument
41 if (std::__invoke(__comp, std::__invoke(__proj, *__m), __value)) { in __lower_bound_bisecting()
62 …sided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& __proj) { in __lower_bound_onesided() argument
64 if (__first == __last || !std::__invoke(__comp, std::__invoke(__proj, *__first), __value)) in __lower_bound_onesided()
73 if (__it == __last || !std::__invoke(__comp, std::__invoke(__proj, *__it), __value)) { in __lower_bound_onesided()
78 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound_onesided()
88 …bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& __proj) { in __lower_bound() argument
90 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound()
97 auto __proj = std::__identity(); in lower_bound() local
98 return std::__lower_bound<_ClassicAlgPolicy>(__first, __last, __value, __comp, __proj); in lower_bound()
|
| H A D | search_n.h | 33 … _Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_forward_impl() argument
43 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_forward_impl()
59 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_forward_impl()
70 …_Iter __first, _Sent __last, _SizeT __count, const _Type& __value, _Pred& __pred, _Proj& __proj, _… in __search_n_random_access_impl() argument
87 if (std::__invoke(__pred, std::__invoke(__proj, *__first), __value)) in __search_n_random_access_impl()
100 if (!std::__invoke(__pred, std::__invoke(__proj, *__m), __value)) { in __search_n_random_access_impl()
117 …(_Iter __first, _Sent __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_impl() argument
119 __first, __last, __count, __value, __pred, __proj, __last - __first); in __search_n_impl()
132 …Iter1 __first, _Sent1 __last, _DiffT __count, const _Type& __value, _Pred& __pred, _Proj& __proj) { in __search_n_impl() argument
133 …std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, __proj); in __search_n_impl()
[all …]
|
| H A D | make_projected.h | 32 _Proj& __proj; member
34 …BI _ProjectedPred(_Pred& __pred_arg, _Proj& __proj_arg) : __pred(__pred_arg), __proj(__proj_arg) {} in _ProjectedPred()
40 return std::__invoke(__pred, std::__invoke(__proj, std::forward<_Tp>(__v))); in operator()
49 …__pred, std::__invoke(__proj, std::forward<_T1>(__lhs)), std::__invoke(__proj, std::forward<_T2>(_… in operator()
57 _LIBCPP_HIDE_FROM_ABI _ProjectedPred<_Pred, _Proj> __make_projected(_Pred& __pred, _Proj& __proj) { in __make_projected() argument
58 return _ProjectedPred<_Pred, _Proj>(__pred, __proj); in __make_projected()
|