Lines Matching full:__comp
2618 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2624 if (__comp(*__i, *__first))
2644 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2646 return __comp(__b, __a) ? __b : __a;
2662 min(initializer_list<_Tp> __t, _Compare __comp)
2664 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2682 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2688 if (__comp(*__first, *__i))
2709 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2711 return __comp(__a, __b) ? __b : __a;
2727 max(initializer_list<_Tp> __t, _Compare __comp)
2729 return *_VSTD::max_element(__t.begin(), __t.end(), __comp);
2747 clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp)
2749 _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp");
2750 return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v;
2768 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2775 if (__comp(*__first, *__result.first))
2784 if (__comp(*__i, *__result.first))
2786 else if (!__comp(*__i, *__result.second))
2792 if (__comp(*__first, *__i))
2794 if (__comp(*__first, *__result.first))
2796 if (!__comp(*__i, *__result.second))
2801 if (__comp(*__i, *__result.first))
2803 if (!__comp(*__first, *__result.second))
2827 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
2829 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
2846 minmax(initializer_list<_Tp> __t, _Compare __comp)
2856 if (__comp(*__first, __result.first))
2866 if (__comp(*__first, __prev)) {
2867 if ( __comp(*__first, __result.first)) __result.first = *__first;
2868 if (!__comp(__prev, __result.second)) __result.second = __prev;
2871 if ( __comp(__prev, __result.first)) __result.first = __prev;
2872 if (!__comp(*__first, __result.second)) __result.second = *__first;
3715 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3722 if (__comp(*__i, *__first))
3743 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3745 return _VSTD::is_sorted_until(__first, __last, __comp) == __last;
3855 __selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3862 (__first, __last, __comp);
3870 __insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3880 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3889 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3893 __sort3<_Compare>(__first, __first+1, __j, __comp);
3896 if (__comp(*__i, *__j))
3905 } while (__j != __first && __comp(__t, *--__k));
3914 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3922 if (__comp(*--__last, *__first))
3926 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3929 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3932 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3937 __sort3<_Compare>(__first, __first+1, __j, __comp);
3942 if (__comp(*__i, *__j))
3951 } while (__j != __first && __comp(__t, *--__k));
3964 typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3978 if (__comp(*__first1, *--__i2))
3982 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3998 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4015 if (__comp(*--__last, *__first))
4019 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
4022 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
4025 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
4030 _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp);
4045 __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp);
4051 __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp);
4062 if (!__comp(*__i, *__m)) // if *__first == *__m
4074 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
4080 if (__comp(*__first, *__i))
4095 while (!__comp(*__first, *__i))
4097 while (__comp(*__first, *--__j))
4107 // _VSTD::__sort<_Compare>(__i, __last, __comp);
4111 if (__comp(*__j, *__m))
4130 while (__comp(*__i, *__m))
4133 while (!__comp(*--__j, *__m))
4147 if (__i != __m && __comp(*__m, *__i))
4156 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
4157 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
4176 _VSTD::__sort<_Compare>(__first, __i, __comp);
4177 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4182 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4183 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4193 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4197 __debug_less<_Compare> __c(__comp);
4201 __sort<_Comp_ref>(__first, __last, __comp);
4232 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp)
4235 _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp);
4276 __lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4285 if (__comp(*__m, __value_))
4299 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4303 __debug_less<_Compare> __c(__comp);
4307 return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
4324 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4333 if (__comp(__value_, *__m))
4347 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4351 __debug_less<_Compare> __c(__comp);
4355 return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
4372 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4381 if (__comp(*__m, __value_))
4386 else if (__comp(__value_, *__m))
4396 __lower_bound<_Compare>(__first, __m, __value_, __comp),
4397 __upper_bound<_Compare>(++__mp1, __last, __value_, __comp)
4407 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4411 __debug_less<_Compare> __c(__comp);
4415 return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
4433 __binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4435 __first = __lower_bound<_Compare>(__first, __last, __value_, __comp);
4436 return __first != __last && !__comp(__value_, *__first);
4442 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4446 __debug_less<_Compare> __c(__comp);
4450 return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
4468 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4474 if (__comp(*__first2, *__first1))
4492 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4496 __debug_less<_Compare> __c(__comp);
4500 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4521 _OutputIterator __result, _Compare __comp)
4531 if (__comp(*__first2, *__first1))
4548 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4560 __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp);
4571 _RBi(__last), __invert<_Compare>(__comp));
4578 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4590 (__first, __middle, __last, __comp, __len1, __len2, __buff);
4596 if (__comp(*__middle, *__first))
4617 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4632 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4644 __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4645 // __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4653 __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4654 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4667 _Compare __comp)
4679 __debug_less<_Compare> __c(__comp);
4684 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
4704 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
4725 if (__comp(*__first2, *__first1))
4744 _OutputIterator __result, _Compare __comp)
4754 if (__comp(*__first2, *__first1))
4771 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4777 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4792 if (__comp(*--__last1, *__first1))
4811 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4816 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4817 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4818 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
4829 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4841 if (__comp(*--__last, *__first))
4847 __insertion_sort<_Compare>(__first, __last, __comp);
4856 __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff);
4858 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4860 __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
4865 // __first, __comp);
4868 __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
4869 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4870 __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4876 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4890 __debug_less<_Compare> __c(__comp);
4894 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4910 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4920 if (__comp(*__pp, *__cp))
4926 if (__comp(*__pp, *__cp))
4948 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4950 return _VSTD::is_heap_until(__first, __last, __comp) == __last;
4965 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4973 if (__comp(*__ptr, *--__last))
4984 } while (__comp(*__ptr, __t));
4993 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4997 __debug_less<_Compare> __c(__comp);
5001 __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first);
5018 _Compare __comp,
5034 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
5041 if (__comp(*__child_i, *__start))
5059 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
5066 } while (!__comp(*__child_i, __top));
5073 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
5079 __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
5086 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5090 __debug_less<_Compare> __c(__comp);
5094 __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
5110 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5119 __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start);
5127 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5131 __debug_less<_Compare> __c(__comp);
5135 __make_heap<_Comp_ref>(__first, __last, __comp);
5151 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5155 __pop_heap<_Compare>(__first, __last, __comp, __n);
5161 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5165 __debug_less<_Compare> __c(__comp);
5169 __sort_heap<_Comp_ref>(__first, __last, __comp);
5186 _Compare __comp)
5188 __make_heap<_Compare>(__first, __middle, __comp);
5192 if (__comp(*__i, *__first))
5195 __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5198 __sort_heap<_Compare>(__first, __middle, __comp);
5205 _Compare __comp)
5209 __comp);
5213 __partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
5231 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5238 __make_heap<_Compare>(__result_first, __r, __comp);
5241 if (__comp(*__first, *__result_first))
5244 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5246 __sort_heap<_Compare>(__result_first, __r, __comp);
5255 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5259 __debug_less<_Compare> __c(__comp);
5263 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
5281 __nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5298 if (__comp(*--__last, *__first))
5304 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp);
5310 __selection_sort<_Compare>(__first, __last, __comp);
5316 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp);
5325 if (!__comp(*__i, *__m)) // if *__first == *__m
5337 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5343 if (__comp(*__first, *__i))
5358 while (!__comp(*__first, *__i))
5360 while (__comp(*__first, *--__j))
5373 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5377 if (__comp(*__j, *__m))
5394 while (__comp(*__i, *__m))
5397 while (!__comp(*--__j, *__m))
5411 if (__i != __m && __comp(*__m, *__i))
5428 if (__comp(*__j, *__m))
5442 if (__comp(*__j, *__m))
5455 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5460 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5469 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5473 __debug_less<_Compare> __c(__comp);
5477 __nth_element<_Comp_ref>(__first, __nth, __last, __comp);
5494 _Compare __comp)
5498 if (__first1 == __last1 || __comp(*__first2, *__first1))
5500 if (!__comp(*__first1, *__first2))
5510 _Compare __comp)
5514 __debug_less<_Compare> __c(__comp);
5518 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5537 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5543 if (__comp(*__first2, *__first1))
5551 if (!__comp(*__first1, *__first2))
5563 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5567 __debug_less<_Compare> __c(__comp);
5571 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5591 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5595 if (__comp(*__first1, *__first2))
5599 if (!__comp(*__first2, *__first1))
5615 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5619 __debug_less<_Compare> __c(__comp);
5623 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5643 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5649 if (__comp(*__first1, *__first2))
5657 if (!__comp(*__first2, *__first1))
5669 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5673 __debug_less<_Compare> __c(__comp);
5677 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5697 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5703 if (__comp(*__first1, *__first2))
5711 if (__comp(*__first2, *__first1))
5728 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5732 __debug_less<_Compare> __c(__comp);
5736 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5756 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5760 if (__first1 == __last1 || __comp(*__first1, *__first2))
5762 if (__comp(*__first2, *__first1))
5772 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5776 __debug_less<_Compare> __c(__comp);
5780 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5799 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5807 if (__comp(*--__i, *__ip1))
5810 while (!__comp(*__i, *--__j))
5827 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5831 __debug_less<_Compare> __c(__comp);
5835 return __next_permutation<_Comp_ref>(__first, __last, __comp);
5852 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5860 if (__comp(*__ip1, *--__i))
5863 while (!__comp(*--__j, *__i))
5880 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5884 __debug_less<_Compare> __c(__comp);
5888 return __prev_permutation<_Comp_ref>(__first, __last, __comp);
