Home
last modified time | relevance | path

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

12

/freebsd-12-stable/contrib/libstdc++/include/bits/
Dstl_heap.h88 __is_heap(_RandomAccessIterator __first, _StrictWeakOrdering __comp, in __is_heap()
110 _StrictWeakOrdering __comp) in __is_heap()
163 _Distance __topIndex, _Tp __value, _Compare __comp) in __push_heap()
190 _Compare __comp) in push_heap()
273 _Distance __len, _Tp __value, _Compare __comp) in __adjust_heap()
297 _RandomAccessIterator __result, _Tp __value, _Compare __comp) in __pop_heap()
320 _RandomAccessIterator __last, _Compare __comp) in pop_heap()
385 _Compare __comp) in make_heap()
449 _Compare __comp) in sort_heap()
Dstl_algo.h121 __median(const _Tp& __a, const _Tp& __b, const _Tp& __c, _Compare __comp) in __median()
2274 _Tp __pivot, _Compare __comp) in __unguarded_partition()
2326 _Compare __comp) in __unguarded_linear_insert()
2374 _RandomAccessIterator __last, _Compare __comp) in __insertion_sort()
2417 _RandomAccessIterator __last, _Compare __comp) in __unguarded_insertion_sort()
2453 _RandomAccessIterator __last, _Compare __comp) in __final_insertion_sort()
2494 _RandomAccessIterator __last, _Compare __comp) in __heap_select()
2578 _Compare __comp) in partial_sort()
2682 _Compare __comp) in partial_sort_copy()
2773 _Size __depth_limit, _Compare __comp) in __introsort_loop()
[all …]
/freebsd-12-stable/contrib/llvm-project/libcxx/include/__algorithm/
Dstable_sort.h35 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) in __merge_move_construct()
75 _OutputIterator __result, _Compare __comp) in __merge_move_assign()
108 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp, in __stable_sort_move()
160 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __stable_sort()
207 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in stable_sort()
Dsort.h129 __selection_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __selection_sort()
144 __insertion_sort(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __insertion_sort()
163 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_3()
188 …rtion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __insertion_sort_incomplete()
238 … typename iterator_traits<_BidirectionalIterator>::value_type* __first2, _Compare __comp) in __insertion_sort_move()
272 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __sort()
467 __less<uintptr_t> __comp; in __sort() local
Dnth_element.h31 _RandomAccessIterator __m, _Compare __comp) in __nth_element_find_guard()
46 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) in __nth_element()
226 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) in nth_element()
Dmax.h30 max(const _Tp& __a, const _Tp& __b, _Compare __comp) in max()
50 max(initializer_list<_Tp> __t, _Compare __comp) in max()
Dmin.h30 min(const _Tp& __a, const _Tp& __b, _Compare __comp) in min()
50 min(initializer_list<_Tp> __t, _Compare __comp) in min()
Dinplace_merge.h57 _OutputIterator __result, _Compare __comp) in __half_inplace_merge()
84 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __buffered_inplace_merge()
115 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1, in __inplace_merge()
204 _Compare __comp) in inplace_merge()
Dpop_heap.h31 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __pop_heap()
44 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in pop_heap()
Dsort_heap.h30 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __sort_heap()
40 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in sort_heap()
Dpush_heap.h29 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp, in __sift_up()
57 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in push_heap()
Dprev_permutation.h30 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __prev_permutation()
58 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in prev_permutation()
Dnext_permutation.h30 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in __next_permutation()
58 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) in next_permutation()
Dbinary_search.h30 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __binary_search()
40 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in binary_search()
Dmake_heap.h29 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in __make_heap()
46 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) in make_heap()
Dminmax.h31 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp) in minmax()
52 minmax(initializer_list<_Tp> __t, _Compare __comp) in minmax()
Dpartial_sort.h33 _Compare __comp) in __partial_sort()
52 _Compare __comp) in partial_sort()
Dincludes.h29 _Compare __comp) in __includes()
46 _Compare __comp) in includes()
Dlexicographical_compare.h29 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in __lexicographical_compare()
46 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) in lexicographical_compare()
Dlower_bound.h28 …ower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __lower_bound()
52 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in lower_bound()
Dupper_bound.h28 …pper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __upper_bound()
52 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in upper_bound()
Dpartial_sort_copy.h33 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in __partial_sort_copy()
57 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) in partial_sort_copy()
Dequal_range.h31 …qual_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in __equal_range()
67 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp) in equal_range()
Dset_union.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_union()
56 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_union()
Dset_symmetric_difference.h30 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in __set_symmetric_difference()
61 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) in set_symmetric_difference()

12