Home
last modified time | relevance | path

Searched refs:__proj (Results 1 – 25 of 67) sorted by relevance

123

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dranges_min.h42 …const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
43 return std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)) ? __b : __a;
49 _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
51 return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp, __proj);
58 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 return *ranges::__min_element_impl(__first, __last, __comp, __proj);
69 if (std::invoke(__comp, std::invoke(__proj, *__first), std::invoke(__proj, __result)))
H A Dranges_clamp.h41 _Proj __proj = {}) const {
42 …_LIBCPP_ASSERT(!bool(std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __low))),
45 if (std::invoke(__comp, std::invoke(__proj, __value), std::invoke(__proj, __low)))
47 else if (std::invoke(__comp, std::invoke(__proj, __high), std::invoke(__proj, __value)))
H A Dranges_max.h43 …const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
44 return std::invoke(__comp, std::invoke(__proj, __a), std::invoke(__proj, __b)) ? __b : __a;
50 _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
54 return *ranges::__min_element_impl(__il.begin(), __il.end(), __comp_lhs_rhs_swapped, __proj);
61 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
69 …*ranges::__min_element_impl(std::move(__first), std::move(__last), __comp_lhs_rhs_swapped, __proj);
73 if (std::invoke(__comp, std::invoke(__proj, __result), std::invoke(__proj, *__first)))
H A Dsearch_n.h37 _Proj& __proj) { 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()
79 _Proj& __proj, 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()
130 _Proj& __proj,
136 __proj,
150 _Proj& __proj,
157 __proj);
[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 Dranges_min_element.h36 _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) { in __min_element_impl() argument
42 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) in __min_element_impl()
52 _Ip operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
53 return ranges::__min_element_impl(__first, __last, __comp, __proj);
59 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 return ranges::__min_element_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_is_sorted_until.h35 _Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_sorted_until_impl() argument
40 if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) in __is_sorted_until_impl()
53 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
54 return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj);
61 …borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) con… in operator()
62 …eturn ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __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 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 Dranges_minmax.h48 operator()(const _Type& __a, const _Type& __b, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
49 if (std::invoke(__comp, std::invoke(__proj, __b), std::invoke(__proj, __a)))
57 …esult<_Type> operator()(initializer_list<_Type> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 auto __iters = std::__minmax_element_impl(__il.begin(), __il.end(), __comp, __proj);
67 …esult<range_value_t<_Range>> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
75 auto __result = std::__minmax_element_impl(__first, __last, __comp, __proj);
81 return std::invoke(__comp, std::invoke(__proj, std::forward<decltype(__a)>(__a)),
82 std::invoke(__proj, std::forward<decltype(__b)>(__b)));
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 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_binary_search.h37 …()(_Iter __first, _Sent __last, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
38 auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
39 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__first));
45 bool operator()(_Range&& __r, const _Type& __value, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
48 auto __ret = std::__lower_bound_impl<_RangeAlgPolicy>(__first, __last, __value, __comp, __proj);
49 return __ret != __last && !std::invoke(__comp, __value, std::invoke(__proj, *__first));
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_is_heap_until.h41 static _Iter __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl()
43 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __is_heap_until_fn_impl()
51 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
52 return __is_heap_until_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
58 …borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) con… in operator()
59 return __is_heap_until_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
H A Dranges_sort.h44 _Iter __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl()
47 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __sort_fn_impl()
56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
57 return __sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
63 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
64 return __sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_sort_heap.h45 _Iter __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl()
48 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __sort_heap_fn_impl()
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
58 return __sort_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 return __sort_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_make_heap.h45 _Iter __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl()
48 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __make_heap_fn_impl()
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
58 return __make_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 return __make_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_push_heap.h45 _Iter __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_heap_fn_impl()
48 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __push_heap_fn_impl()
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
58 return __push_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 return __push_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_is_heap.h40 static bool __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()
51 bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
52 return __is_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
58 bool operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 return __is_heap_fn_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj);
H A Dranges_stable_sort.h44 static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl()
47 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __stable_sort_fn_impl()
56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
57 return __stable_sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
63 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
64 return __stable_sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __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_pop_heap.h45 _Iter __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl()
49 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __pop_heap_fn_impl()
58 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 return __pop_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
65 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
66 return __pop_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);

123