| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | nth_element.h | 33 _RandomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp) { in __nth_element_find_guard()
39 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
49 _RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) { in __nth_element()
64 if (__comp(*--__last, *__first)) in __nth_element()
69 std::__sort3<_AlgPolicy, _Compare>(__first, ++__m, --__last, __comp); in __nth_element()
74 std::__selection_sort<_AlgPolicy, _Compare>(__first, __last, __comp); in __nth_element()
80 unsigned __n_swaps = std::__sort3<_AlgPolicy, _Compare>(__first, __m, --__lm1, __comp); in __nth_element()
89 if (!__comp(*__i, *__m)) // if *__first == *__m in __nth_element()
92 if (std::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { in __nth_element()
100 if (!__comp(*__firs in __nth_element()
30 __nth_element_find_guard(_RandomAccessIterator & __i,_RandomAccessIterator & __j,_RandomAccessIterator __m,_Compare __comp) __nth_element_find_guard() argument
45 __nth_element(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp) __nth_element() argument
227 __nth_element_impl(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare & __comp) __nth_element_impl() argument
244 nth_element(_RandomAccessIterator __first,_RandomAccessIterator __nth,_RandomAccessIterator __last,_Compare __comp) nth_element() argument
[all...] |
| H A D | sort.h | 112 _Comp __comp) { in __sort5() argument
115 std::__sort4<_AlgPolicy, _Comp>(__x1, __x2, __x3, __x4, __comp); in __sort5()
116 if (__comp(*__x5, *__x4)) { in __sort5()
118 if (__comp(*__x4, *__x3)) { in __sort5()
120 if (__comp(*__x3, *__x2)) { in __sort5()
122 if (__comp(*__x2, *__x1)) { in __sort5()
271 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
274 _BidirectionalIterator __i = std::__min_element<_Compare>(__first, __last, __comp);
284 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) {
294 if (__comp(*__i, *__j)) {
[all …]
|
| H A D | stable_sort.h | 42 _Compare __comp) { in __insertion_sort_move() argument
55 if (__comp(*__first1, *--__i2)) { in __insertion_sort_move()
58 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 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()
[all …]
|
| H A D | lexicographical_compare_three_way.h | 38 …__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 D | partial_sort.h | 36 …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 D | inplace_merge.h | 76 _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
143 …return std::__buffered_inplace_merge<_AlgPolicy>(__first, __middle, __last, __comp, __len1, __len2… in __inplace_merge()
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()
[all …]
|
| H A D | lower_bound.h | 35 _Comp& __comp, in __lower_bound_bisecting() argument
41 if (std::__invoke(__comp, std::__invoke(__proj, *__m), __value)) { in __lower_bound_bisecting()
62 __lower_bound_onesided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp,… in __lower_bound_onesided() argument
64 if (__first == __last || !std::__invoke(__comp, std::__invoke(__proj, *__first), __value)) in __lower_bound_onesided()
73 if (__it == __last || !std::__invoke(__comp, std::__invoke(__proj, *__it), __value)) { in __lower_bound_onesided()
78 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound_onesided()
88 __lower_bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& _… in __lower_bound() argument
90 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound()
95 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in lower_bound() argument
98 return std::__lower_bound<_ClassicAlgPolicy>(__first, __last, __value, __comp, __proj); in lower_bound()
|
| H A D | sift_down.h | 30 _Compare&& __comp, in __sift_down()
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()
29 __sift_down(_RandomAccessIterator __first,_Compare && __comp,typename iterator_traits<_RandomAccessIterator>::difference_type __len,_RandomAccessIterator __start) __sift_down() argument
|
| H A D | push_heap.h | 34 _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 D | ranges_min.h | 46 _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 D | ranges_lexicographical_compare.h | 42 _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 D | equal_range.h | 41 __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 D | ranges_max.h | 47 _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 D | ranges_make_heap.h | 48 __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 {
61 return __make_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
68 return __make_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_push_heap.h | 48 __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 {
61 return __push_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
68 return __push_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_sort.h | 47 __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 {
60 return __sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
66 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
67 return __sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_sort_heap.h | 48 __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 {
61 return __sort_heap_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
67 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
68 return __sort_heap_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_stable_sort.h | 46 _LIBCPP_HIDE_FROM_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 __proj = {}) const {
58 return __stable_sort_fn_impl(std::move(__first), std::move(__last), __comp, __proj);
64 operator()(_Range&& __r, _Comp __comp = {}, _Proj __proj = {}) const {
65 return __stable_sort_fn_impl(ranges::begin(__r), ranges::end(__r), __comp, __proj);
|
| H A D | ranges_is_heap.h | 42 __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 D | ranges_is_heap_until.h | 43 __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);
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/ |
| H A D | parallel_merge.h | |
| H A D | parallel_stable_sort.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__debug_utils/ |
| H A D | strict_weak_ordering_check.h | 28 __check_strict_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()
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | parallel_backend_utils.h | |
| H A D | algorithm_impl.h | |