Home
last modified time | relevance | path

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

123

/llvm-project/libcxx/include/__algorithm/
H A Dstable_sort.h147 _Compare __comp, in __stable_sort_move() argument
42 __insertion_sort_move(_BidirectionalIterator __first1,_BidirectionalIterator __last1,typename iterator_traits<_BidirectionalIterator>::value_type * __first2,_Compare __comp) __insertion_sort_move() argument
77 __merge_move_construct(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,typename iterator_traits<_InputIterator1>::value_type * __result,_Compare __comp) __merge_move_construct() argument
115 __merge_move_assign(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge_move_assign() argument
195 __stable_sort(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp,typename iterator_traits<_RandomAccessIterator>::difference_type __len,typename iterator_traits<_RandomAccessIterator>::value_type * __buff,ptrdiff_t __buff_size) __stable_sort() argument
239 __stable_sort_impl(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare & __comp) __stable_sort_impl() argument
260 stable_sort(_RandomAccessIterator __first,_RandomAccessIterator __last,_Compare __comp) stable_sort() argument
[all...]
H A Dmin_element.h32 __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element() argument
45 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) { in __min_element() argument
52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in min_element() argument
H A Dpush_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()
H A Dnth_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()
H A Dminmax_element.h32 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) in _MinmaxElementLessFunc() argument
43 __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { in __minmax_element_impl() argument
83 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in minmax_element() argument
H A Dpartial_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()
H A Dmin.h29 min(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) { in min() argument
43 min(initializer_list<_Tp> __t, _Compare __comp) { in min() argument
H A Dmax_element.h25 __max_element(_ForwardIterator __first,_ForwardIterator __last,_Compare __comp) __max_element() argument
39 max_element(_ForwardIterator __first,_ForwardIterator __last,_Compare __comp) max_element() argument
H A Dis_sorted_until.h39 return std::__is_sorted_until<__comp_ref_type<_Compare> >(__first, __last, __comp); in is_sorted_until() argument
25 __is_sorted_until(_ForwardIterator __first,_ForwardIterator __last,_Compare __comp) __is_sorted_until() argument
H A Dmax.h29 max(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) { in max() argument
43 max(initializer_list<_Tp> __t, _Compare __comp) { in max() argument
H A Dinplace_merge.h76 __half_inplace_merge(_InputIterator1 __first1,_Sent1 __last1,_InputIterator2 __first2,_Sent2 __last2,_OutputIterator __result,_Compare && __comp) __half_inplace_merge() argument
99 __buffered_inplace_merge(_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare && __comp,typename iterator_traits<_BidirectionalIterator>::difference_type __len1,typename iterator_traits<_BidirectionalIterator>::difference_type __len2,typename iterator_traits<_BidirectionalIterator>::value_type * __buff) __buffered_inplace_merge() argument
130 __inplace_merge(_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare && __comp,typename iterator_traits<_BidirectionalIterator>::difference_type __len1,typename iterator_traits<_BidirectionalIterator>::difference_type __len2,typename iterator_traits<_BidirectionalIterator>::value_type * __buff,ptrdiff_t __buff_size) __inplace_merge() argument
208 __inplace_merge(_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare && __comp) __inplace_merge() argument
225 inplace_merge(_BidirectionalIterator __first,_BidirectionalIterator __middle,_BidirectionalIterator __last,_Compare __comp) inplace_merge() argument
[all...]
H A Dminmax.h28 minmax(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) { in minmax() argument
42 minmax(initializer_list<_Tp> __t, _Compare __comp) { in minmax() argument
H A Dmake_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()
H A Dsort_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()
H A Dnext_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()
H A Dprev_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()
H A Dis_heap_until.h25 __is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __is_heap_until() argument
50 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in is_heap_until() argument
H A Dpop_heap.h37 _Compare& __comp, in __pop_heap()
63 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in pop_heap()
H A Dlexicographical_compare.h29 __lexicographical_compare(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) __lexicographical_compare() argument
45 lexicographical_compare(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) lexicographical_compare() argument
H A Dsift_down.h30 _Compare&& __comp, in __sift_down()
85 _Compare&& __comp, in __floyd_sift_down()
H A Dupper_bound.h35 __upper_bound(_Iter __first,_Sent __last,const _Tp & __value,_Compare && __comp,_Proj && __proj) __upper_bound() argument
52 upper_bound(_ForwardIterator __first,_ForwardIterator __last,const _Tp & __value,_Compare __comp) upper_bound() argument
H A Dincludes.h36 __includes(_Iter1 __first1,_Sent1 __last1,_Iter2 __first2,_Sent2 __last2,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __includes() argument
55 includes(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_Compare __comp) includes() argument
H A Dlower_bound.h32 __lower_bound(_Iter __first,_Sent __last,const _Type & __value,_Comp & __comp,_Proj & __proj) __lower_bound() argument
51 lower_bound(_ForwardIterator __first,_ForwardIterator __last,const _Tp & __value,_Compare __comp) lower_bound() argument
[all...]
H A Dmerge.h53 return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); in merge() argument
31 __merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) __merge() argument
/llvm-project/pstl/include/pstl/internal/
H A Dparallel_backend_utils.h144 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_union_construct()
172 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_intersection_construct()
198 _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_difference_construct()
227 … _ForwardIterator2 __last2, _OutputIterator __result, _Compare __comp, in __set_symmetric_difference_construct()

123