Home
last modified time | relevance | path

Searched refs:_Proj (Results 1 – 25 of 70) sorted by relevance

123

/src/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_find_last.h39 template <class _Iter, class _Sent, class _Pred, class _Proj>
41 __find_last_impl(_Iter __first, _Sent __last, _Pred __pred, _Proj& __proj) { in __find_last_impl()
86 template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, class _Type, class _Proj = identity>
87 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*>
89 operator()(_Iter __first, _Sent __last, const _Type& __value, _Proj __proj = {}) { in operator()
93 template <forward_range _Range, class _Type, class _Proj = identity>
94 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
96 operator()(_Range&& __range, const _Type& __value, _Proj __proj = {}) { in operator()
115 class _Proj = identity,
116 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
[all …]
H A Dmake_projected.h30 template <class _Pred, class _Proj>
33 _Proj& __proj;
35 _LIBCPP_CONSTEXPR _LIBCPP_HIDE_FROM_ABI _ProjectedPred(_Pred& __pred_arg, _Proj& __proj_arg) in _ProjectedPred()
39 …typename __invoke_of<_Pred&, decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_Tp>()))>…
47 decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_T1>())),
48 … decltype(std::__invoke(std::declval<_Proj&>(), std::declval<_T2>()))>::type _LIBCPP_CONSTEXPR
58 class _Proj,
59 …__enable_if_t<!(!is_member_pointer<__decay_t<_Pred> >::value && __is_identity<__decay_t<_Proj> >::…
60 …HIDE_FROM_ABI _LIBCPP_CONSTEXPR _ProjectedPred<_Pred, _Proj> __make_projected(_Pred& __pred, _Proj… in __make_projected()
61 return _ProjectedPred<_Pred, _Proj>(__pred, __proj); in __make_projected()
[all …]
H A Dfind.h44 template <class _Iter, class _Sent, class _Tp, class _Proj>
46 __find(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __find()
56 class _Proj,
57 …__enable_if_t<__is_identity<_Proj>::value && __libcpp_is_trivially_equality_comparable<_Tp, _Up>::…
60 … _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj&) { in __find() argument
69 class _Proj,
70 …__enable_if_t<__is_identity<_Proj>::value && __libcpp_is_trivially_equality_comparable<_Tp, _Up>::…
73 … _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp* __find(_Tp* __first, _Tp* __last, const _Up& __value, _Proj&) { in __find() argument
84 class _Proj,
85 …__enable_if_t<__is_identity<_Proj>::value && !__libcpp_is_trivially_equality_comparable<_Tp, _Up>:…
[all …]
H A Dranges_adjacent_find.h37 template <class _Iter, class _Sent, class _Proj, class _Pred>
39 __adjacent_find_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __adjacent_find_impl()
54 … class _Proj = identity,
55 …indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_…
57 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
62 class _Proj = identity,
63 …ndirect_binary_predicate<projected<iterator_t<_Range>, _Proj>, projected<iterator_t<_Range>, _Proj…
66 operator()(_Range&& __range, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
H A Dranges_any_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
36 …BI constexpr static bool __any_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __any_of_impl()
46 class _Proj = identity,
47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
49 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
54 class _Proj = identity,
55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_all_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
36 …BI constexpr static bool __all_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __all_of_impl()
46 class _Proj = identity,
47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
49 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
54 class _Proj = identity,
55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
57 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_none_of.h35 template <class _Iter, class _Sent, class _Proj, class _Pred>
37 __none_of_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __none_of_impl()
47 class _Proj = identity,
48 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
50 operator()(_Iter __first, _Sent __last, _Pred __pred = {}, _Proj __proj = {}) const { in operator()
55 class _Proj = identity,
56 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
58 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_find_if.h36 template <class _Ip, class _Sp, class _Pred, class _Proj>
37 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __find_if_impl(_Ip __first, _Sp __last, _Pred& __pred, _Proj& _… in __find_if_impl()
49 class _Proj = identity,
50 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred>
52 operator()(_Ip __first, _Sp __last, _Pred __pred, _Proj __proj = {}) const { in operator()
56 …template <input_range _Rp, class _Proj = identity, indirect_unary_predicate<projected<iterator_t<_…
58 operator()(_Rp&& __r, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_min.h41 class _Proj = identity,
42 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
47 _Proj __proj = {}) const {
52 class _Proj = identity,
53 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
55 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
62 class _Proj = identity,
63 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
66 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_heap.h40 template <class _Iter, class _Sent, class _Proj, class _Comp>
42 __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl()
52 class _Proj = identity,
53 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
55 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 class _Proj = identity,
61 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
63 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_stable_sort.h45 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 …ABI static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl()
55 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
56 requires sortable<_Iter, _Comp, _Proj>
57 …_LIBCPP_HIDE_FROM_ABI _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __pro… in operator()
61 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
62 requires sortable<iterator_t<_Range>, _Comp, _Proj>
64 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_partitioned.h36 template <class _Iter, class _Sent, class _Proj, class _Pred>
38 __is_partitioned_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __is_partitioned_impl()
58 class _Proj = identity,
59 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
66 class _Proj = identity,
67 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_count_if.h36 template <class _Iter, class _Sent, class _Proj, class _Pred>
38 __count_if_impl(_Iter __first, _Sent __last, _Pred& __pred, _Proj& __proj) { in __count_if_impl()
51 class _Proj = identity,
52 indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate>
54 operator()(_Iter __first, _Sent __last, _Predicate __pred, _Proj __proj = {}) const { in operator()
59 class _Proj = identity,
60 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Predicate>
62 operator()(_Range&& __r, _Predicate __pred, _Proj __proj = {}) const { in operator()
H A Dranges_is_heap_until.h41 template <class _Iter, class _Sent, class _Proj, class _Comp>
43 __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl()
52 class _Proj = identity,
53 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
55 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 class _Proj = identity,
61 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
63 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_min_element.h37 template <class _Ip, class _Sp, class _Proj, class _Comp>
38 …_FROM_ABI constexpr _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) { in __min_element_impl()
53 class _Proj = identity,
54 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
56 operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 class _Proj = identity,
62 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
64 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_max.h42 class _Proj = identity,
43 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
48 _Proj __proj = {}) const {
53 class _Proj = identity,
54 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
56 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 class _Proj = identity,
66 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
69 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_stable_partition.h48 template <class _Iter, class _Sent, class _Proj, class _Pred>
50 __stable_partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __stable_partition_fn_impl()
62 class _Proj = identity,
63 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
65 …_LIBCPP_HIDE_FROM_ABI subrange<_Iter> operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj … in operator()
70 class _Proj = identity,
71 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
74 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_for_each.h42 template <class _Iter, class _Sent, class _Proj, class _Func>
44 __for_each_impl(_Iter __first, _Sent __last, _Func& __func, _Proj& __proj) { in __for_each_impl()
53 class _Proj = identity,
54 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func>
56 operator()(_Iter __first, _Sent __last, _Func __func, _Proj __proj = {}) const { in operator()
61 class _Proj = identity,
62 indirectly_unary_invocable<projected<iterator_t<_Range>, _Proj>> _Func>
64 operator()(_Range&& __range, _Func __func, _Proj __proj = {}) const { in operator()
H A Dranges_sort.h45 template <class _Iter, class _Sent, class _Comp, class _Proj>
47 __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl()
56 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
57 requires sortable<_Iter, _Comp, _Proj>
59 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
63 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
64 requires sortable<iterator_t<_Range>, _Comp, _Proj>
66 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_make_heap.h46 template <class _Iter, class _Sent, class _Comp, class _Proj>
48 __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl()
57 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
58 requires sortable<_Iter, _Comp, _Proj>
60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
64 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
65 requires sortable<iterator_t<_Range>, _Comp, _Proj>
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_partition.h46 template <class _Iter, class _Sent, class _Proj, class _Pred>
48 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) { in __partition_fn_impl()
58 class _Proj = identity,
59 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
61 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const { in operator()
66 class _Proj = identity,
67 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
70 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const { in operator()
H A Dranges_pop_heap.h46 template <class _Iter, class _Sent, class _Comp, class _Proj>
48 __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl()
58 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
59 requires sortable<_Iter, _Comp, _Proj>
61 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
65 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
66 requires sortable<iterator_t<_Range>, _Comp, _Proj>
68 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_push_heap.h46 template <class _Iter, class _Sent, class _Comp, class _Proj>
48 __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_heap_fn_impl()
57 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
58 requires sortable<_Iter, _Comp, _Proj>
60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
64 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
65 requires sortable<iterator_t<_Range>, _Comp, _Proj>
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_sort_heap.h46 template <class _Iter, class _Sent, class _Comp, class _Proj>
48 __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl()
57 …cess_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
58 requires sortable<_Iter, _Comp, _Proj>
60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
64 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
65 requires sortable<iterator_t<_Range>, _Comp, _Proj>
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
/src/contrib/llvm-project/libcxx/include/__iterator/
H A Dprojected.h26 template <class _It, class _Proj>
29 using value_type = remove_cvref_t<indirect_result_t<_Proj&, _It>>;
30 indirect_result_t<_Proj&, _It> operator*() const; // not defined
34 template <weakly_incrementable _It, class _Proj>
35 struct __projected_impl<_It, _Proj> {
37 using value_type = remove_cvref_t<indirect_result_t<_Proj&, _It>>;
39 indirect_result_t<_Proj&, _It> operator*() const; // not defined
46 template <indirectly_readable _It, indirectly_regular_unary_invocable<_It> _Proj>
47 using projected = typename __projected_impl<_It, _Proj>::__type;

123