Home
last modified time | relevance | path

Searched refs:_Comp (Results 1 – 25 of 47) sorted by relevance

12

/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dranges_sort.h42 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 _Iter __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl()
53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
54 requires sortable<_Iter, _Comp, _Proj>
56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
61 requires sortable<iterator_t<_Range>, _Comp, _Proj>
63 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_sort_heap.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 _Iter __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
62 requires sortable<iterator_t<_Range>, _Comp, _Proj>
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_make_heap.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 _Iter __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_heap_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
62 requires sortable<iterator_t<_Range>, _Comp, _Proj>
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_push_heap.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 _Iter __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_heap_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
62 requires sortable<iterator_t<_Range>, _Comp, _Proj>
64 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_stable_sort.h42 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 static _Iter __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl()
53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
54 requires sortable<_Iter, _Comp, _Proj>
56 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
60 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
61 requires sortable<iterator_t<_Range>, _Comp, _Proj>
63 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_pop_heap.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 _Iter __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl()
55 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
56 requires sortable<_Iter, _Comp, _Proj>
58 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
62 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
63 requires sortable<iterator_t<_Range>, _Comp, _Proj>
65 borrowed_iterator_t<_Range> operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_nth_element.h42 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 …_Iter __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj… in __nth_element_fn_impl()
53 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
54 requires sortable<_Iter, _Comp, _Proj>
56 …_Iter operator()(_Iter __first, _Iter __nth, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) c… in operator()
60 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
61 requires sortable<iterator_t<_Range>, _Comp, _Proj>
63 borrowed_iterator_t<_Range> operator()(_Range&& __r, iterator_t<_Range> __nth, _Comp __comp = {}, in operator()
H A Dranges_partial_sort.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 …_Iter __partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __… in __partial_sort_fn_impl()
50 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
51 requires sortable<_Iter, _Comp, _Proj>
53 …_Iter operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}… in operator()
57 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
58 requires sortable<iterator_t<_Range>, _Comp, _Proj>
60 …borrowed_iterator_t<_Range> operator()(_Range&& __r, iterator_t<_Range> __middle, _Comp __comp = {… in operator()
H A Dranges_inplace_merge.h42 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 …__inplace_merge_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp&& __comp, _Proj&& __proj) { in __inplace_merge_impl()
54 class _Comp = ranges::less,
56 requires sortable<_Iter, _Comp, _Proj>
58 …operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) cons… in operator()
63 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
66 _Comp,
68 …operator()(_Range&& __range, iterator_t<_Range> __middle, _Comp __comp = {}, _Proj __proj = {}) co… in operator()
H A Dranges_partial_sort_copy.h47 class _Comp = ranges::less, class _Proj1 = identity, class _Proj2 = identity>
48 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> &&
49 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
53 _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
61 template <input_range _Range1, random_access_range _Range2, class _Comp = ranges::less,
64 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
65 indirect_strict_weak_order<_Comp, projected<iterator_t<_Range1>, _Proj1>,
69 operator()(_Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, in operator()
H A Dranges_merge.h47 class _Comp,
57 _Comp&& __comp, in __merge_impl()
81 class _Comp = less,
84 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
91 _Comp __comp = {}, in operator()
101 class _Comp = less,
108 _Comp,
116 _Comp __comp = {}, in operator()
H A Dranges_is_heap_until.h39 template <class _Iter, class _Sent, class _Proj, class _Comp>
41 static _Iter __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl()
49 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
51 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
56 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
58 …borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) con… in operator()
H A Dranges_min_element.h34 template <class _Ip, class _Sp, class _Proj, class _Comp>
36 _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Proj& __proj) { in __min_element_impl()
50 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
52 _Ip operator()(_Ip __first, _Sp __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
57 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
59 borrowed_iterator_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_next_permutation.h42 …template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
43 requires sortable<_Iter, _Comp, _Proj>
45 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
51 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
52 requires sortable<iterator_t<_Range>, _Comp, _Proj>
54 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_prev_permutation.h44 class _Comp = ranges::less, class _Proj = identity>
45 requires sortable<_Iter, _Comp, _Proj>
47 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
54 class _Comp = ranges::less, class _Proj = identity>
55 requires sortable<iterator_t<_Range>, _Comp, _Proj>
57 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_heap.h38 template <class _Iter, class _Sent, class _Proj, class _Comp>
40 static bool __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl()
49 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
51 bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
56 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
58 bool operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_sorted_until.h33 template <class _Iter, class _Sent, class _Proj, class _Comp>
35 _Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_sorted_until_impl()
51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
53 _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
59 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
61 …borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) con… in operator()
H A Dranges_min.h40 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
42 …const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
47 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
49 _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
55 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
58 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_set_difference.h49 class _Comp = less,
52 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
59 _Comp __comp = {}, in operator()
71 class _Comp = less,
74 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
80 _Comp __comp = {}, in operator()
H A Dranges_lexicographical_compare.h34 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, class _Comp>
38 _Comp& __comp, in __lexicographical_compare_impl()
57 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
61 _Comp __comp = {}, in operator()
76 projected<iterator_t<_Range2>, _Proj2>> _Comp = ranges::less>
78 …bool operator()(_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _P… in operator()
H A Dranges_max.h41 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
43 …const _Tp& operator()(const _Tp& __a, const _Tp& __b, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
48 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
50 _Tp operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
58 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
61 range_value_t<_Rp> operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_set_union.h51 class _Comp = ranges::less,
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
61 _Comp __comp = {}, in operator()
78 class _Comp = ranges::less,
85 _Comp,
95 _Comp __comp = {}, in operator()
H A Dranges_set_symmetric_difference.h48 class _Comp = ranges::less,
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
58 _Comp __comp = {}, in operator()
75 class _Comp = ranges::less,
82 _Comp,
92 _Comp __comp = {}, in operator()
H A Dranges_set_intersection.h49 class _Comp = less,
52 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
59 _Comp __comp = {}, in operator()
76 class _Comp = less,
83 _Comp,
93 _Comp __comp = {}, in operator()
H A Dminmax_element.h25 template <class _Comp, class _Proj>
27 _Comp& __comp_;
32 _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) : __comp_(__comp), __proj_(__proj) {} in _MinmaxElementLessFunc()
41 template <class _Iter, class _Sent, class _Proj, class _Comp>
43 pair<_Iter, _Iter> __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj)… in __minmax_element_impl()
44 auto __less = _MinmaxElementLessFunc<_Comp, _Proj>(__comp, __proj); in __minmax_element_impl()

12