Home
last modified time | relevance | path

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

12

/external/cronet/buildtools/third_party/libc++/trunk/include/__algorithm/
Dstable_sort.h36 … typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) { in __insertion_sort_move()
68 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) in __merge_move_construct()
110 _OutputIterator __result, _Compare __comp) in __merge_move_assign()
145 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, in __stable_sort_move()
199 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __stable_sort()
246 …__stable_sort_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __stable_sort_impl()
266 void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in stable_sort()
Dnth_element.h31 _RandomAccessIterator __m, _Compare __comp) in __nth_element_find_guard()
46 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) in __nth_element()
228 _Compare& __comp) { in __nth_element_impl()
245 _Compare __comp) { in nth_element()
Dmin_element.h29 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element()
43 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) { in __min_element()
50 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in min_element()
Dpush_heap.h29 void __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp, in __sift_up()
55 void __push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp) { in __push_heap()
62 void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in push_heap()
Dminmax_element.h33 _MinmaxElementLessFunc(_Comp& __comp, _Proj& __proj) : __comp_(__comp), __proj_(__proj) {} in _MinmaxElementLessFunc()
44 pair<_Iter, _Iter> __minmax_element_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj)… in __minmax_element_impl()
85 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in minmax_element()
Dpartial_sort.h35 …andomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp) { in __partial_sort_impl()
60 _Compare& __comp) { in __partial_sort()
78 _Compare __comp) in partial_sort()
Dinplace_merge.h66 _OutputIterator __result, _Compare&& __comp) in __half_inplace_merge()
96 _Compare&& __comp, in __buffered_inplace_merge()
129 _Compare&& __comp, in __inplace_merge()
221 _Compare&& __comp) in __inplace_merge()
239 …terator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) { in inplace_merge()
Dmax_element.h25 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in __max_element()
41 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in max_element()
Dmax.h31 max(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) in max()
51 max(initializer_list<_Tp> __t, _Compare __comp) in max()
Dis_sorted_until.h25 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in __is_sorted_until()
42 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in is_sorted_until()
Dmin.h31 min(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) in min()
51 min(initializer_list<_Tp> __t, _Compare __comp) in min()
Dsort_heap.h30 void __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __sort_heap()
40 void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in sort_heap()
Dminmax.h30 minmax(_LIBCPP_LIFETIMEBOUND const _Tp& __a, _LIBCPP_LIFETIMEBOUND const _Tp& __b, _Compare __comp) in minmax()
49 pair<_Tp, _Tp> minmax(initializer_list<_Tp> __t, _Compare __comp) { in minmax()
Dmake_heap.h28 void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) { in __make_heap()
43 void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in make_heap()
Dprev_permutation.h30 __prev_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp) in __prev_permutation()
62 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in prev_permutation()
Dnext_permutation.h29 __next_permutation(_BidirectionalIterator __first, _Sentinel __last, _Compare&& __comp) in __next_permutation()
61 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in next_permutation()
Dpop_heap.h32 void __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare& __comp, in __pop_heap()
57 void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { in pop_heap()
Dlexicographical_compare.h26 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare()
43 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare()
Dis_heap_until.h25 __is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare&& __comp) in __is_heap_until()
52 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in is_heap_until()
Dsift_down.h26 __sift_down(_RandomAccessIterator __first, _Compare&& __comp, in __sift_down()
82 __floyd_sift_down(_RandomAccessIterator __first, _Compare&& __comp, in __floyd_sift_down()
Dupper_bound.h32 __upper_bound(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __upper_bound()
49 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in upper_bound()
Dincludes.h30 _Comp&& __comp, _Proj1&& __proj1, _Proj2&& __proj2) { in __includes()
47 _Compare __comp) { in includes()
Dlower_bound.h32 _Iter __lower_bound_impl(_Iter __first, _Sent __last, const _Type& __value, _Comp& __comp, _Proj& _… in __lower_bound_impl()
51 …wer_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp) { in lower_bound()
Dset_difference.h33 …t1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) { in __set_difference()
56 _Compare __comp) { in set_difference()
Dequal_range.h38 __equal_range(_Iter __first, _Sent __last, const _Tp& __value, _Compare&& __comp, _Proj&& __proj) { in __equal_range()
62 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value, _Compare __comp)… in equal_range()

12