Home
last modified time | relevance | path

Searched refs:__comp (Results 1 – 25 of 95) sorted by relevance

1234

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dnth_element.h39 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
64 if (__comp(*--__last, *__first)) in __nth_element()
89 if (!__comp(*__i, *__m)) // if *__first == *__m in __nth_element()
104 } else if (__comp(*__first, *__i)) { in __nth_element()
118 while (!__comp(*__first, *__i)) { in __nth_element()
129 } while (__comp(*__first, *__j)); in __nth_element()
154 while (__comp(*__i, *__m)) { in __nth_element()
166 } while (!__comp(*__j, *__m)); in __nth_element()
179 if (__i != __m && __comp(*__m, *__i)) { in __nth_element()
196 if (__comp(*__j, *__m)) { in __nth_element()
[all …]
H A Dsort.h112 _Comp __comp) { in __sort5() argument
116 if (__comp(*__x5, *__x4)) { in __sort5()
118 if (__comp(*__x4, *__x3)) { in __sort5()
294 if (__comp(*__i, *__j)) {
368 __comp);
449 _Compare __comp,
794 __comp);
961 __less<_Type> __comp;
967 __less<_Type> __comp;
974 __less<_Type> __comp;
[all …]
H A Dstable_sort.h42 _Compare __comp) { in __insertion_sort_move() argument
55 if (__comp(*__first1, *--__i2)) { in __insertion_sort_move()
77 _Compare __comp) { in __merge_move_construct() argument
96 if (__comp(*__first2, *__first1)) { in __merge_move_construct()
115 _Compare __comp) { in __merge_move_assign() argument
124 if (__comp(*__first2, *__first1)) { in __merge_move_assign()
139 _Compare __comp,
147 _Compare __comp, in __stable_sort_move() argument
162 if (__comp(*--__last1, *__first1)) { in __stable_sort_move()
195 _Compare __comp, in __stable_sort() argument
[all …]
H A Dpartial_sort.h36 …andomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp) { in __partial_sort_impl() argument
41 std::__make_heap<_AlgPolicy>(__first, __middle, __comp); in __partial_sort_impl()
46 if (__comp(*__i, *__first)) { in __partial_sort_impl()
48 std::__sift_down<_AlgPolicy>(__first, __comp, __len, __first); in __partial_sort_impl()
51 std::__sort_heap<_AlgPolicy>(std::move(__first), std::move(__middle), __comp); in __partial_sort_impl()
58 …RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare& __comp) { in __partial_sort() argument
65 …_sort_impl<_AlgPolicy>(__first, __middle, __last, static_cast<__comp_ref_type<_Compare> >(__comp)); in __partial_sort()
74 …sIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) { in partial_sort() argument
78 …artial_sort<_ClassicAlgPolicy>(std::move(__first), std::move(__middle), std::move(__last), __comp); in partial_sort()
H A Dlexicographical_compare_three_way.h38 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
39 -> decltype(__comp(*__first1, *__first2)) {
54 auto __c = __comp(*__first1, *__first2);
68 …__first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp& __comp)
69 -> decltype(__comp(*__first1, *__first2)) {
82 auto __c = __comp(*__first1, *__first2);
94 … __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Cmp __comp)
95 -> decltype(__comp(*__first1, *__first2)) {
96 static_assert(__comparison_category<decltype(__comp(*__first1, *__first2))>,
100 __three_way_comp_ref_type<_Cmp> __wrapped_comp_ref(__comp);
H A Dinplace_merge.h76 _Compare&& __comp) { in __half_inplace_merge() argument
83 if (__comp(*__first2, *__first1)) { in __half_inplace_merge()
99 _Compare&& __comp, in __buffered_inplace_merge() argument
111 std::__half_inplace_merge<_AlgPolicy>(__buff, __p, __middle, __last, __first, __comp); in __buffered_inplace_merge()
121 _Rv(__p), _Rv(__buff), _RBi(__middle), _RBi(__first), _RBi(__last), _Inverted(__comp)); in __buffered_inplace_merge()
130 _Compare&& __comp, in __inplace_merge() argument
148 if (__comp(*__middle, *__first)) in __inplace_merge()
168 __m1 = std::__upper_bound<_AlgPolicy>(__first, __middle, *__m2, __comp, std::__identity()); in __inplace_merge()
180 __m2 = std::lower_bound(__middle, __last, *__m1, __comp); in __inplace_merge()
191 …std::__inplace_merge<_AlgPolicy>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff… in __inplace_merge()
[all …]
H A Dsift_down.h30 _Compare&& __comp, in __sift_down() argument
47 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
54 if (__comp(*__child_i, *__start)) in __sift_down()
71 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down()
78 } while (!__comp(*__child_i, __top)); in __sift_down()
85 _Compare&& __comp, in __floyd_sift_down() argument
98 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __floyd_sift_down()
H A Dpush_heap.h34 _Compare&& __comp, in __sift_up() argument
42 if (__comp(*__ptr, *--__last)) { in __sift_up()
51 } while (__comp(*__ptr, __t)); in __sift_up()
60 __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __push_heap() argument
62 …t_up<_AlgPolicy, __comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp, __len); in __push_heap()
67 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in push_heap() argument
71 std::__push_heap<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __comp); in push_heap()
H A Dranges_min.h46 _Comp __comp = {}, in operator()
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 Dequal_range.h41 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range() argument
47 if (std::__invoke(__comp, std::__invoke(__proj, *__mid), __value)) { in __equal_range()
50 } else if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) { in __equal_range()
55 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
56 … std::__upper_bound<_AlgPolicy>(++__mp1, __end, __value, __comp, __proj)); in __equal_range()
64 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in equal_range() argument
71 static_cast<__comp_ref_type<_Compare> >(__comp), in equal_range()
H A Dranges_lexicographical_compare.h42 _Comp& __comp, in __lexicographical_compare_impl()
46 …if (__first1 == __last1 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj… in __lexicographical_compare_impl()
48 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) in __lexicographical_compare_impl()
68 _Comp __comp = {}, in operator()
72 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __comp, __proj1,…
82 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
88 __comp,
H A Dranges_max.h47 _Comp __comp = {}, in operator()
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()
60 …hs_swapped = [&](auto&& __lhs, auto&& __rhs) -> bool { return std::invoke(__comp, __rhs, __lhs); };
69 operator()(_Rp&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
77 return std::invoke(__comp, __rhs, __lhs);
83 if (std::invoke(__comp, std::invoke(__proj, __result), std::invoke(__proj, *__first)))
H A Dranges_is_heap.h42 __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 Dranges_is_heap_until.h43 __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 Dranges_min_element.h38 _LIBCPP_HIDE_FROM_ABI constexpr _Ip __min_element_impl(_Ip __first, _Sp __last, _Comp& __comp, _Pro… 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 Dranges_stable_sort.h46 …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 …_LIBCPP_HIDE_FROM_ABI _Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __pro… 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 Dranges_binary_search.h43 …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 Dmin_element.h32 __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element() argument
38 if (std::__invoke(__comp, std::__invoke(__proj, *__i), std::__invoke(__proj, *__first))) in __min_element()
45 …_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) { in __min_element() argument
47 return std::__min_element<_Comp>(std::move(__first), std::move(__last), __comp, __proj); in __min_element()
52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in min_element() argument
58 …turn std::__min_element<__comp_ref_type<_Compare> >(std::move(__first), std::move(__last), __comp); in min_element()
H A Dranges_is_sorted_until.h38 __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 …return ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj…
H A Dranges_make_heap.h48 __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 Dranges_pop_heap.h48 __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 Dranges_push_heap.h48 __push_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __push_heap_fn_impl()
51 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __push_heap_fn_impl()
60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 return __push_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
68 return __push_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
H A Dranges_sort.h47 __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 Dranges_sort_heap.h48 __sort_heap_fn_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __sort_heap_fn_impl()
51 auto&& __projected_comp = std::__make_projected(__comp, __proj); in __sort_heap_fn_impl()
60 operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
61 return __sort_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const { in operator()
68 return __sort_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
/freebsd/contrib/llvm-project/libcxx/include/__debug_utils/
H A Dstrict_weak_ordering_check.h28 …_weak_ordering_sorted(_RandomAccessIterator __first, _RandomAccessIterator __last, _Comp& __comp) { in __check_strict_weak_ordering_sorted() argument
35 (std::is_sorted<_RandomAccessIterator, _Comp_ref>(__first, __last, _Comp_ref(__comp))), in __check_strict_weak_ordering_sorted()
43 while (__q < __size && !__comp(*(__first + __p), *(__first + __q))) { in __check_strict_weak_ordering_sorted()
50 …!__comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
52 …!__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
59 …__comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
61 …!__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
71 (void)__comp; in __check_strict_weak_ordering_sorted()

1234