Home
last modified time | relevance | path

Searched defs:__comp (Results 1 – 25 of 43) sorted by relevance

12

/freebsd-13-stable/contrib/llvm-project/libcxx/include/__algorithm/
HDstable_sort.h42 _Compare __comp) { in __insertion_sort_move()
77 _Compare __comp) { in __merge_move_construct()
115 _Compare __comp) { in __merge_move_assign()
147 _Compare __comp, in __stable_sort_move()
195 _Compare __comp, in __stable_sort()
239 __stable_sort_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __stable_sort_impl()
260 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in stable_sort()
HDnth_element.h33 …andomAccessIterator& __i, _RandomAccessIterator& __j, _RandomAccessIterator __m, _Compare __comp) { in __nth_element_find_guard()
49 …cessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) { in __nth_element()
231 …essIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare& __comp) { in __nth_element_impl()
247 …cessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) { in nth_element()
HDlower_bound.h35 _Comp& __comp, in __lower_bound_bisecting()
62 __lower_bound_onesided(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp,… in __lower_bound_onesided()
88 __lower_bound(_ForwardIterator __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& _… in __lower_bound()
95 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in lower_bound()
HDmin_element.h32 __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element()
45 …_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) { in __min_element()
52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in min_element()
HDpush_heap.h34 _Compare&& __comp, in __sift_up()
60 __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __push_heap()
67 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in push_heap()
HDminmax_element.h32 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) in _MinmaxElementLessFunc()
43 __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __minmax_element_impl()
83 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in minmax_element()
HDpartial_sort.h36 …andomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp) { in __partial_sort_impl()
58 …RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare& __comp) { in __partial_sort()
74 …sIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) { in partial_sort()
HDinplace_merge.h76 _Compare&& __comp) { in __half_inplace_merge()
99 _Compare&& __comp, in __buffered_inplace_merge()
130 _Compare&& __comp, in __inplace_merge()
208 …rator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare&& __comp) { in __inplace_merge()
225 …terator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) { in inplace_merge()
HDset_intersection.h95 _Compare&& __comp, in __set_intersection()
140 _Compare&& __comp, in __set_intersection()
166 …_first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_intersection()
185 _Compare __comp) { in set_intersection()
HDmin.h29 min(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) { in min()
43 min(initializer_list<_Tp> __t, _Compare __comp) { in min()
HDmax_element.h25 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in __max_element()
39 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in max_element()
HDmax.h29 max(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) { in max()
43 max(initializer_list<_Tp> __t, _Compare __comp) { in max()
HDis_sorted_until.h25 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in __is_sorted_until()
39 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in is_sorted_until()
HDminmax.h28 minmax(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp)… in minmax()
42 minmax(initializer_list<_Tp> __t, _Compare __comp) { in minmax()
HDsort_heap.h34 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __sort_heap()
46 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in sort_heap()
HDmake_heap.h31 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __make_heap()
46 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in make_heap()
HDprev_permutation.h32 __prev_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp) { in __prev_permutation()
59 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in prev_permutation()
HDnext_permutation.h32 __next_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp) { in __next_permutation()
59 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { in next_permutation()
HDlexicographical_compare.h29 _Compare __comp) { in __lexicographical_compare()
45 _Compare __comp) { in lexicographical_compare()
HDis_heap_until.h25 __is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __is_heap_until()
50 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in is_heap_until()
HDpop_heap.h37 _Compare& __comp, in __pop_heap()
63 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in pop_heap()
HDsift_down.h30 _Compare&& __comp, in __sift_down()
85 _Compare&& __comp, in __floyd_sift_down()
HDupper_bound.h35 __upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __upper_bound()
52 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in upper_bound()
HDincludes.h36 _Comp&& __comp, in __includes()
55 _Compare __comp) { in includes()
HDmerge.h31 _Compare __comp) { in __merge()
53 _Compare __comp) { in merge()

12