| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_min.h | 47 _Proj __proj = {}) const { 48 return std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)) ? __b : __a; 55 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 58 return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp, __proj); 66 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 71 return *ranges::__min_element_impl(__first, __last, __comp, __proj); 75 if (std::invoke(__comp, std::invoke(__proj, *__first), std::invoke(__proj, __result)))
|
| H A D | ranges_max.h | 48 _Proj __proj = {}) const { 49 return std::invoke(__comp, std::invoke(__proj, __a), std::invoke(__proj, __b)) ? __b : __a; 56 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 61 return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp_lhs_rhs_swapped, __proj); 69 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 79 …*ranges::__min_element_impl(std::move(__first), std::move(__last), __comp_lhs_rhs_swapped, __proj); 83 if (std::invoke(__comp, std::invoke(__proj, __result), std::invoke(__proj, *__first)))
|
| 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() 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() 118 _Proj& __proj, 121 __first, __last, __count, __value, __pred, __proj, __last - __first); 131 _Proj& __proj, 134 …std::__search_n_forward_impl<_ClassicAlgPolicy>(__first, __last, __count, __value, __pred, __proj); 142 auto __proj = __identity(); in search_n() local [all …]
|
| H A D | ranges_min_element.h | 38 …_FROM_ABI constexpr _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) { in __min_element_impl() argument 44 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) in __min_element_impl() 56 operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 57 return ranges::__min_element_impl(__first, __last, __comp, __proj); 64 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 65 return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| 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 | 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() 57 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 58 return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj); 65 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 66 …eturn ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
|
| H A D | ranges_clamp.h | 39 …pe& __value, const _Type& __low, const _Type& __high, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 41 !bool(std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __low))), 44 auto&& __projected = std::invoke(__proj, __value); 45 …if (std::invoke(__comp, std::forward<decltype(__projected)>(__projected), std::invoke(__proj, __lo… 47 …else if (std::invoke(__comp, std::invoke(__proj, __high), std::forward<decltype(__projected)>(__pr…
|
| H A D | ranges_adjacent_find.h | 39 __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find_impl() 45 if (std::invoke(__pred, std::invoke(__proj, *__first), std::invoke(__proj, *__i))) in __adjacent_find_impl() 57 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator() 58 return __adjacent_find_impl(std::move(__first), std::move(__last), __pred, __proj); 66 operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) const { in operator() 67 return __adjacent_find_impl(ranges::begin(__range), ranges::end(__range), __pred, __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() 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 | ranges_find.h | 43 __find_unwrap(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find_unwrap() 47 …td::move(__first), std::__find_impl(std::move(__first_un), std::move(__last_un), __value, __proj)); in __find_unwrap() 49 return std::__find_impl(std::move(__first), std::move(__last), __value, __proj); in __find_unwrap() 56 operator()(_Ip __first, _Sp __last, const _Tp& __value, _Proj __proj = {}) const { in operator() 57 return __find_unwrap(std::move(__first), std::move(__last), __value, __proj); 63 operator()(_Rp&& __r, const _Tp& __value, _Proj __proj = {}) const { in operator() 64 return __find_unwrap(ranges::begin(__r), ranges::end(__r), __value, __proj);
|
| H A D | ranges_minmax.h | 57 _Proj __proj = {}) const { 58 if (std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a))) 67 operator()(initializer_list<_Type> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 70 auto __iters = std::__minmax_element_impl(__il.begin(), __il.end(), __comp, __proj); 79 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 99 auto __result = std::__minmax_element_impl(__first, __last, __comp, __proj); 106 std::invoke(__proj, std::forward<decltype(__a)>(__a)), 107 std::invoke(__proj, std::forward<decltype(__b)>(__b)));
|
| 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 …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() 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_binary_search.h | 43 …operator()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}… in operator() 44 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); 45 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret)); 53 operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 56 auto __ret = std::__lower_bound<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj); 57 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__ret));
|
| H A D | ranges_is_heap.h | 42 __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl() 44 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __is_heap_fn_impl() 55 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 56 return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 63 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 64 return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
|
| H A D | ranges_stable_sort.h | 46 …ABI static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl() 49 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __stable_sort_fn_impl() 57 …ROM_ABI _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 58 return __stable_sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 64 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 65 return __stable_sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __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 | ranges_is_heap_until.h | 43 __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl() 45 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __is_heap_until_fn_impl() 55 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 56 return __is_heap_until_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 63 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 64 return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
|
| H A D | ranges_pop_heap.h | 48 __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl() 52 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __pop_heap_fn_impl() 61 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 62 return __pop_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 68 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 69 return __pop_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_for_each.h | 44 __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { in __for_each_impl() 46 std::invoke(__func, std::invoke(__proj, *__first)); in __for_each_impl() 56 operator()(_Iter __first, _Sent __last, _Func __func, _Proj __proj = {}) const { in operator() 57 return __for_each_impl(std::move(__first), std::move(__last), __func, __proj); 64 operator()(_Range&& __range, _Func __func, _Proj __proj = {}) const { in operator() 65 return __for_each_impl(ranges::begin(__range), ranges::end(__range), __func, __proj);
|
| H A D | ranges_make_heap.h | 48 __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl() 51 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __make_heap_fn_impl() 60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 61 return __make_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 68 return __make_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_sort.h | 47 __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl() 50 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __sort_fn_impl() 59 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 60 return __sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj); 66 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator() 67 return __sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| 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);
|