Home
last modified time | relevance | path

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

123

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_make_heap.h44 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 __make_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __make_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 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 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_sort_heap.h44 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_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 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 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_stable_sort.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 __stable_sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __stable_sort_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 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 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_push_heap.h44 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_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 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 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_sort.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 __sort_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 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 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_pop_heap.h44 template <class _Iter, class _Sent, class _Comp, class _Proj>
46 __pop_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __pop_heap_fn_impl()
56 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
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_partial_sort.h45 template <class _Iter, class _Sent, class _Comp, class _Proj>
47 …__partial_sort_fn_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp& __comp, _Proj& __proj) { in __partial_sort_fn_impl()
52 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
53 requires sortable<_Iter, _Comp, _Proj>
55 …operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) cons… in operator()
59 template <random_access_range _Range, class _Comp = ranges::less, class _Proj = identity>
60 requires sortable<iterator_t<_Range>, _Comp, _Proj>
62 …operator()(_Range&& __r, iterator_t<_Range> __middle, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_nth_element.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 __nth_element_fn_impl(_Iter __first, _Iter __nth, _Sent __last, _Comp& __comp, _Proj& __proj) { in __nth_element_fn_impl()
54 …template <random_access_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
55 requires sortable<_Iter, _Comp, _Proj>
57 operator()(_Iter __first, _Iter __nth, _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 operator()(_Range&& __r, iterator_t<_Range> __nth, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_inplace_merge.h43 template <class _Iter, class _Sent, class _Comp, class _Proj>
45 …__inplace_merge_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp&& __comp, _Proj&& __proj) { in __inplace_merge_impl()
52 …template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
53 requires sortable<_Iter, _Comp, _Proj>
55 …operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) cons… in operator()
60 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
61 requires sortable<iterator_t<_Range>, _Comp, _Proj>
63 …operator()(_Range&& __range, iterator_t<_Range> __middle, _Comp __comp = {}, _Proj __proj = {}) co… in operator()
H A Dranges_partial_sort_copy.h50 class _Comp = ranges::less,
53 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> &&
54 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
60 _Comp __comp = {}, in operator()
76 class _Comp = ranges::less,
80 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
81 indirect_strict_weak_order<_Comp,
86 …_Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj… in operator()
H A Dthree_way_comp_ref_type.h26 template <class _Comp>
28 _Comp& __comp_;
29 _LIBCPP_HIDE_FROM_ABI constexpr __debug_three_way_comp(_Comp& __c) : __comp_(__c) {} in __debug_three_way_comp()
63 template <class _Comp>
64 using __three_way_comp_ref_type _LIBCPP_NODEBUG = __debug_three_way_comp<_Comp>;
66 template <class _Comp>
67 using __three_way_comp_ref_type _LIBCPP_NODEBUG = _Comp&;
H A Dranges_merge.h48 class _Comp = less,
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
58 _Comp __comp = {}, in operator()
67 class _Comp = less,
70 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
75 _Comp __comp = {}, in operator()
94 class _Comp,
105 _Comp&& __comp, in __merge_impl()
H A Dranges_is_heap.h38 template <class _Iter, class _Sent, class _Proj, class _Comp>
40 __is_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_fn_impl()
51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
53 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 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_next_permutation.h44 …template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
45 requires sortable<_Iter, _Comp, _Proj>
47 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
53 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
54 requires sortable<iterator_t<_Range>, _Comp, _Proj>
56 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_prev_permutation.h44 …template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, cla…
45 requires sortable<_Iter, _Comp, _Proj>
47 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
53 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
54 requires sortable<iterator_t<_Range>, _Comp, _Proj>
56 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_heap_until.h39 template <class _Iter, class _Sent, class _Proj, class _Comp>
41 __is_heap_until_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_heap_until_fn_impl()
51 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
53 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 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_is_sorted_until.h36 template <class _Iter, class _Sent, class _Proj, class _Comp>
38 __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __is_sorted_until_impl()
54 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
56 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
62 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
64 operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_min.h41 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
45 _Comp __comp = {}, in operator()
52 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
54 operator()(initializer_list<_Tp> __il, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
62 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
65 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dranges_set_difference.h50 class _Comp = less,
53 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
60 _Comp __comp = {}, in operator()
71 class _Comp = less,
74 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
79 _Comp __comp = {}, in operator()
H A Dranges_max.h42 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
46 _Comp __comp = {}, in operator()
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()
65 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
68 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
H A Dminmax_element.h26 template <class _Comp, class _Proj>
28 _Comp& __comp_;
32 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) in _MinmaxElementLessFunc()
41 template <class _Iter, class _Sent, class _Proj, class _Comp>
43 __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()
H A Dranges_set_union.h51 class _Comp = ranges::less,
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
61 _Comp __comp = {}, in operator()
77 class _Comp = ranges::less,
80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
85 _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()
74 class _Comp = ranges::less,
77 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
84 _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()
75 class _Comp = less,
78 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
85 _Comp __comp = {}, in operator()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dminmax_element.h26 template <class _Comp, class _Proj>
28 _Comp& __comp_;
32 …_LIBCPP_HIDE_FROM_ABI _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) : __comp_(__comp), __pr… in _MinmaxElementLessFunc()
40 template <class _Iter, class _Sent, class _Proj, class _Comp>
42 __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __minmax_element_impl()
43 auto __less = _MinmaxElementLessFunc<_Comp, _Proj>(__comp, __proj); in __minmax_element_impl()

123