Home
last modified time | relevance | path

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

123

/freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/
Dnth_element.h31 _RandomAccessIterator __m, _Compare __comp) in __nth_element_find_guard() argument
38 if (__comp(*__j, *__m)) { in __nth_element_find_guard()
46 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) in __nth_element() argument
62 if (__comp(*--__last, *__first)) in __nth_element()
68 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp); in __nth_element()
74 _VSTD::__selection_sort<_Compare>(__first, __last, __comp); in __nth_element()
80 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp); in __nth_element()
89 if (!__comp(*__i, *__m)) // if *__first == *__m in __nth_element()
92 if (_VSTD::__nth_element_find_guard<_Compare>(__i, __j, __m, __comp)) { in __nth_element()
100 if (!__comp(*__first, *--__j)) { // we need a guard if *__first == *(__last-1) in __nth_element()
[all …]
Dsort.h129 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __selection_sort() argument
136 (__first, __last, __comp); in __selection_sort()
144 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __insertion_sort() argument
154 for (_BidirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j) in __insertion_sort()
163 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_3() argument
167 _VSTD::__sort3<_Compare>(__first, __first+1, __j, __comp); in __insertion_sort_3()
170 if (__comp(*__i, *__j)) in __insertion_sort_3()
179 } while (__j != __first && __comp(__t, *--__k)); in __insertion_sort_3()
188 …rtion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_incomplete() argument
196 if (__comp(*--__last, *__first)) in __insertion_sort_incomplete()
[all …]
Dstable_sort.h35 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) in __merge_move_construct() argument
56 if (__comp(*__first2, *__first1)) in __merge_move_construct()
75 _OutputIterator __result, _Compare __comp) in __merge_move_assign() argument
85 if (__comp(*__first2, *__first1)) in __merge_move_assign()
102 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
108 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, in __stable_sort_move() argument
123 if (__comp(*--__last1, *__first1)) in __stable_sort_move()
142 _VSTD::__insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp); in __stable_sort_move()
147 _VSTD::__stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2); in __stable_sort_move()
148 … _VSTD::__stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2); in __stable_sort_move()
[all …]
Dminmax_element.h29 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in minmax_element() argument
38 if (__comp(*__first, *__result.first)) in minmax_element()
47 if (__comp(*__i, *__result.first)) in minmax_element()
49 else if (!__comp(*__i, *__result.second)) in minmax_element()
55 if (__comp(*__first, *__i)) in minmax_element()
57 if (__comp(*__first, *__result.first)) in minmax_element()
59 if (!__comp(*__i, *__result.second)) in minmax_element()
64 if (__comp(*__i, *__result.first)) in minmax_element()
66 if (!__comp(*__first, *__result.second)) in minmax_element()
Dminmax.h31 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) in minmax() argument
33 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) : in minmax()
52 minmax(initializer_list<_Tp> __t, _Compare __comp) in minmax() argument
62 if (__comp(*__first, __result.first)) in minmax()
72 if (__comp(*__first, __prev)) { in minmax()
73 if ( __comp(*__first, __result.first)) __result.first = *__first; in minmax()
74 if (!__comp(__prev, __result.second)) __result.second = __prev; in minmax()
77 if ( __comp(__prev, __result.first)) __result.first = __prev; in minmax()
78 if (!__comp(*__first, __result.second)) __result.second = *__first; in minmax()
Dinplace_merge.h57 _OutputIterator __result, _Compare __comp) in __half_inplace_merge() argument
67 if (__comp(*__first2, *__first1)) in __half_inplace_merge()
84 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __buffered_inplace_merge() argument
96 _VSTD::__half_inplace_merge<_Compare>(__buff, __p, __middle, __last, __first, __comp); in __buffered_inplace_merge()
108 _RBi(__last), _Inverted(__comp)); in __buffered_inplace_merge()
115 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __inplace_merge() argument
127 (__first, __middle, __last, __comp, __len1, __len2, __buff); in __inplace_merge()
133 if (__comp(*__middle, *__first)) in __inplace_merge()
154 __m1 = _VSTD::__upper_bound<_Compare>(__first, __middle, *__m2, __comp); in __inplace_merge()
169 __m2 = _VSTD::__lower_bound<_Compare>(__middle, __last, *__m1, __comp); in __inplace_merge()
[all …]
Dpartial_sort.h33 _Compare __comp) in __partial_sort() argument
35 _VSTD::__make_heap<_Compare>(__first, __middle, __comp); in __partial_sort()
39 if (__comp(*__i, *__first)) in __partial_sort()
42 _VSTD::__sift_down<_Compare>(__first, __middle, __comp, __len, __first); in __partial_sort()
45 _VSTD::__sort_heap<_Compare>(__first, __middle, __comp); in __partial_sort()
52 _Compare __comp) in partial_sort() argument
55 _VSTD::__partial_sort<_Comp_ref>(__first, __middle, __last, __comp); in partial_sort()
Dpartial_sort_copy.h33 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in __partial_sort_copy() argument
40 _VSTD::__make_heap<_Compare>(__result_first, __r, __comp); in __partial_sort_copy()
43 if (__comp(*__first, *__result_first)) in __partial_sort_copy()
46 _VSTD::__sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first); in __partial_sort_copy()
48 _VSTD::__sort_heap<_Compare>(__result_first, __r, __comp); in __partial_sort_copy()
57 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in partial_sort_copy() argument
60 …turn _VSTD::__partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp); in partial_sort_copy()
Dequal_range.h31 …qual_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __equal_range() argument
40 if (__comp(*__m, __value_)) in __equal_range()
45 else if (__comp(__value_, *__m)) in __equal_range()
55 _VSTD::__lower_bound<_Compare>(__first, __m, __value_, __comp), in __equal_range()
56 _VSTD::__upper_bound<_Compare>(++__mp1, __last, __value_, __comp) in __equal_range()
67 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in equal_range() argument
70 return _VSTD::__equal_range<_Comp_ref>(__first, __last, __value_, __comp); in equal_range()
Dsift_down.h28 _Compare __comp, in __sift_down() argument
44 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { in __sift_down()
51 if (__comp(*__child_i, *__start)) in __sift_down()
69 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) { in __sift_down()
76 } while (!__comp(*__child_i, __top)); in __sift_down()
Dprev_permutation.h30 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __prev_permutation() argument
38 if (__comp(*__ip1, *--__i)) in __prev_permutation()
41 while (!__comp(*--__j, *__i)) in __prev_permutation()
58 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in prev_permutation() argument
61 return _VSTD::__prev_permutation<_Comp_ref>(__first, __last, __comp); in prev_permutation()
Dnext_permutation.h30 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __next_permutation() argument
38 if (__comp(*--__i, *__ip1)) in __next_permutation()
41 while (!__comp(*__i, *--__j)) in __next_permutation()
58 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in next_permutation() argument
61 return _VSTD::__next_permutation<_Comp_ref>(__first, __last, __comp); in next_permutation()
Dbinary_search.h30 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __binary_search() argument
32 __first = _VSTD::__lower_bound<_Compare>(__first, __last, __value_, __comp); in __binary_search()
33 return __first != __last && !__comp(__value_, *__first); in __binary_search()
40 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in binary_search() argument
43 return _VSTD::__binary_search<_Comp_ref>(__first, __last, __value_, __comp); in binary_search()
Dincludes.h29 _Compare __comp) in __includes() argument
33 if (__first1 == __last1 || __comp(*__first2, *__first1)) in __includes()
35 if (!__comp(*__first1, *__first2)) in __includes()
46 _Compare __comp) in includes() argument
49 return _VSTD::__includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in includes()
Dlexicographical_compare.h29 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare() argument
33 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
35 if (__comp(*__first2, *__first1)) in __lexicographical_compare()
46 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare() argument
49 … return _VSTD::__lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp); in lexicographical_compare()
Dpush_heap.h29 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __sift_up() argument
37 if (__comp(*__ptr, *--__last)) in __sift_up()
48 } while (__comp(*__ptr, __t)); in __sift_up()
57 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in push_heap() argument
60 _VSTD::__sift_up<_Comp_ref>(__first, __last, __comp, __last - __first); in push_heap()
Dset_intersection.h29 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection() argument
33 if (__comp(*__first1, *__first2)) in __set_intersection()
37 if (!__comp(*__first2, *__first1)) in __set_intersection()
53 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_intersection() argument
56 …eturn _VSTD::__set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_intersection()
Dset_difference.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_difference() argument
36 if (__comp(*__first1, *__first2)) in __set_difference()
44 if (!__comp(*__first2, *__first1)) in __set_difference()
56 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_difference() argument
59 … return _VSTD::__set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_difference()
Dset_union.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_union() argument
36 if (__comp(*__first2, *__first1)) in __set_union()
43 if (!__comp(*__first1, *__first2)) in __set_union()
56 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_union() argument
59 return _VSTD::__set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_union()
Dset_symmetric_difference.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_symmetric_difference() argument
36 if (__comp(*__first1, *__first2)) in __set_symmetric_difference()
44 if (__comp(*__first2, *__first1)) in __set_symmetric_difference()
61 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_symmetric_difference() argument
64 …STD::__set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp); in set_symmetric_difference()
Dclamp.h31 clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp) in clamp() argument
33 _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp"); in clamp()
34 return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v; in clamp()
Dsort_heap.h30 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __sort_heap() argument
34 _VSTD::__pop_heap<_Compare>(__first, __last, __comp, __n); in __sort_heap()
40 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in sort_heap() argument
43 _VSTD::__sort_heap<_Comp_ref>(__first, __last, __comp); in sort_heap()
Dpop_heap.h31 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pop_heap() argument
37 _VSTD::__sift_down<_Compare>(__first, __last, __comp, __len - 1, __first); in __pop_heap()
44 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in pop_heap() argument
47 _VSTD::__pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first); in pop_heap()
/freebsd-12-stable/contrib/libstdc++/include/bits/
Dstl_heap.h88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, in __is_heap() argument
94 if (__comp(__first[__parent], __first[__child])) in __is_heap()
110 _StrictWeakOrdering __comp) in __is_heap() argument
111 { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } in __is_heap()
163 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap() argument
167 && __comp(*(__first + __parent), __value)) in __push_heap()
190 _Compare __comp) in push_heap() argument
201 __glibcxx_requires_heap_pred(__first, __last - 1, __comp); in push_heap()
204 _DistanceType(0), _ValueType(*(__last - 1)), __comp); in push_heap()
273 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap() argument
[all …]
Dstl_algo.h121 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median() argument
125 if (__comp(__a, __b)) in __median()
126 if (__comp(__b, __c)) in __median()
128 else if (__comp(__a, __c)) in __median()
132 else if (__comp(__a, __c)) in __median()
134 else if (__comp(__b, __c)) in __median()
2274 _Tp __pivot, _Compare __comp) in __unguarded_partition() argument
2278 while (__comp(*__first, __pivot)) in __unguarded_partition()
2281 while (__comp(__pivot, *__last)) in __unguarded_partition()
2326 _Compare __comp) in __unguarded_linear_insert() argument
[all …]

123