Lines Matching refs:__comp
2426 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2434 if (__comp(*__i, *__first))
2454 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2456 return __comp(__b, __a) ? __b : __a;
2472 min(initializer_list<_Tp> __t, _Compare __comp)
2474 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2492 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2500 if (__comp(*__first, *__i))
2521 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2523 return __comp(__a, __b) ? __b : __a;
2539 max(initializer_list<_Tp> __t, _Compare __comp)
2541 return *_VSTD::max_element(__t.begin(), __t.end(), __comp);
2559 clamp(const _Tp& __v, const _Tp& __lo, const _Tp& __hi, _Compare __comp)
2561 _LIBCPP_ASSERT(!__comp(__hi, __lo), "Bad bounds passed to std::clamp");
2562 return __comp(__v, __lo) ? __lo : __comp(__hi, __v) ? __hi : __v;
2580 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2589 if (__comp(*__first, *__result.first))
2598 if (__comp(*__i, *__result.first))
2600 else if (!__comp(*__i, *__result.second))
2606 if (__comp(*__first, *__i))
2608 if (__comp(*__first, *__result.first))
2610 if (!__comp(*__i, *__result.second))
2615 if (__comp(*__i, *__result.first))
2617 if (!__comp(*__first, *__result.second))
2641 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
2643 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
2660 minmax(initializer_list<_Tp> __t, _Compare __comp)
2670 if (__comp(*__first, __result.first))
2680 if (__comp(*__first, __prev)) {
2681 if ( __comp(*__first, __result.first)) __result.first = *__first;
2682 if (!__comp(__prev, __result.second)) __result.second = __prev;
2685 if ( __comp(__prev, __result.first)) __result.first = __prev;
2686 if (!__comp(*__first, __result.second)) __result.second = *__first;
3531 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3538 if (__comp(*__i, *__first))
3559 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3561 return _VSTD::is_sorted_until(__first, __last, __comp) == __last;
3672 __selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3679 (__first, __last, __comp);
3687 __insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3697 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3706 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3710 __sort3<_Compare>(__first, __first+1, __j, __comp);
3713 if (__comp(*__i, *__j))
3722 } while (__j != __first && __comp(__t, *--__k));
3731 …rtion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3739 if (__comp(*--__last, *__first))
3743 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3746 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3749 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3754 __sort3<_Compare>(__first, __first+1, __j, __comp);
3759 if (__comp(*__i, *__j))
3768 } while (__j != __first && __comp(__t, *--__k));
3781 … typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3795 if (__comp(*__first1, *--__i2))
3799 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3815 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3832 if (__comp(*--__last, *__first))
3836 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3839 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3842 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3847 _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp);
3862 … __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp);
3868 __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp);
3879 if (!__comp(*__i, *__m)) // if *__first == *__m
3891 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
3897 if (__comp(*__first, *__i))
3912 while (!__comp(*__first, *__i))
3914 while (__comp(*__first, *--__j))
3924 // _VSTD::__sort<_Compare>(__i, __last, __comp);
3928 if (__comp(*__j, *__m))
3947 while (__comp(*__i, *__m))
3950 while (!__comp(*--__j, *__m))
3964 if (__i != __m && __comp(*__m, *__i))
3973 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
3974 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
3993 _VSTD::__sort<_Compare>(__first, __i, __comp);
3994 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
3999 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4000 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4010 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4014 __debug_less<_Compare> __c(__comp);
4018 __sort<_Comp_ref>(__first, __last, __comp);
4049 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp)
4052 _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp);
4093 …ower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4102 if (__comp(*__m, __value_))
4116 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4119 return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
4135 …pper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4144 if (__comp(__value_, *__m))
4158 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4161 return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
4177 …qual_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4186 if (__comp(*__m, __value_))
4191 else if (__comp(__value_, *__m))
4201 __lower_bound<_Compare>(__first, __m, __value_, __comp),
4202 __upper_bound<_Compare>(++__mp1, __last, __value_, __comp)
4212 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4216 __debug_less<_Compare> __c(__comp);
4220 return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
4238 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4240 __first = __lower_bound<_Compare>(__first, __last, __value_, __comp);
4241 return __first != __last && !__comp(__value_, *__first);
4247 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4251 __debug_less<_Compare> __c(__comp);
4255 return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
4273 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4279 if (__comp(*__first2, *__first1))
4297 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4301 __debug_less<_Compare> __c(__comp);
4305 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4326 _OutputIterator __result, _Compare __comp)
4336 if (__comp(*__first2, *__first1))
4353 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4365 __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp);
4376 _RBi(__last), __invert<_Compare>(__comp));
4383 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4395 (__first, __middle, __last, __comp, __len1, __len2, __buff);
4401 if (__comp(*__middle, *__first))
4422 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4437 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4449 … __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4450 // __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __b…
4458 … __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4459 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __…
4472 _Compare __comp)
4484 __debug_less<_Compare> __c(__comp);
4489 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
4509 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
4530 if (__comp(*__first2, *__first1))
4549 _OutputIterator __result, _Compare __comp)
4559 if (__comp(*__first2, *__first1))
4576 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4582 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4597 if (__comp(*--__last1, *__first1))
4616 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4621 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4622 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4623 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
4634 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4646 if (__comp(*--__last, *__first))
4652 __insertion_sort<_Compare>(__first, __last, __comp);
4661 __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff);
4663 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4665 …merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
4670 // __first, __comp);
4673 __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
4674 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4675 … __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4681 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4695 __debug_less<_Compare> __c(__comp);
4699 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4715 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4725 if (__comp(*__pp, *__cp))
4731 if (__comp(*__pp, *__cp))
4753 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4755 return _VSTD::is_heap_until(__first, __last, __comp) == __last;
4770 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4778 if (__comp(*__ptr, *--__last))
4789 } while (__comp(*__ptr, __t));
4798 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4802 __debug_less<_Compare> __c(__comp);
4806 __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first);
4823 _Compare __comp,
4839 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4846 if (__comp(*__child_i, *__start))
4864 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4871 } while (!__comp(*__child_i, __top));
4878 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4884 __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
4891 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4895 __debug_less<_Compare> __c(__comp);
4899 __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
4915 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4924 __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start);
4932 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4936 __debug_less<_Compare> __c(__comp);
4940 __make_heap<_Comp_ref>(__first, __last, __comp);
4956 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4960 __pop_heap<_Compare>(__first, __last, __comp, __n);
4966 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4970 __debug_less<_Compare> __c(__comp);
4974 __sort_heap<_Comp_ref>(__first, __last, __comp);
4991 _Compare __comp)
4993 __make_heap<_Compare>(__first, __middle, __comp);
4997 if (__comp(*__i, *__first))
5000 __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5003 __sort_heap<_Compare>(__first, __middle, __comp);
5010 _Compare __comp)
5014 __debug_less<_Compare> __c(__comp);
5018 __partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
5036 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5043 __make_heap<_Compare>(__result_first, __r, __comp);
5046 if (__comp(*__first, *__result_first))
5049 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5051 __sort_heap<_Compare>(__result_first, __r, __comp);
5060 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5064 __debug_less<_Compare> __c(__comp);
5068 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
5086 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5103 if (__comp(*--__last, *__first))
5109 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp);
5115 __selection_sort<_Compare>(__first, __last, __comp);
5121 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp);
5130 if (!__comp(*__i, *__m)) // if *__first == *__m
5142 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5148 if (__comp(*__first, *__i))
5163 while (!__comp(*__first, *__i))
5165 while (__comp(*__first, *--__j))
5178 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5182 if (__comp(*__j, *__m))
5199 while (__comp(*__i, *__m))
5202 while (!__comp(*--__j, *__m))
5216 if (__i != __m && __comp(*__m, *__i))
5233 if (__comp(*__j, *__m))
5247 if (__comp(*__j, *__m))
5260 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5265 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5274 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5278 __debug_less<_Compare> __c(__comp);
5282 __nth_element<_Comp_ref>(__first, __nth, __last, __comp);
5299 _Compare __comp)
5303 if (__first1 == __last1 || __comp(*__first2, *__first1))
5305 if (!__comp(*__first1, *__first2))
5315 _Compare __comp)
5319 __debug_less<_Compare> __c(__comp);
5323 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5342 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5348 if (__comp(*__first2, *__first1))
5355 if (!__comp(*__first1, *__first2))
5368 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5372 __debug_less<_Compare> __c(__comp);
5376 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5396 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5400 if (__comp(*__first1, *__first2))
5404 if (!__comp(*__first2, *__first1))
5420 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5424 __debug_less<_Compare> __c(__comp);
5428 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5448 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5454 if (__comp(*__first1, *__first2))
5462 if (!__comp(*__first2, *__first1))
5474 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5478 __debug_less<_Compare> __c(__comp);
5482 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5502 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5508 if (__comp(*__first1, *__first2))
5516 if (__comp(*__first2, *__first1))
5533 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5537 __debug_less<_Compare> __c(__comp);
5541 …turn __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5561 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5565 if (__first1 == __last1 || __comp(*__first1, *__first2))
5567 if (__comp(*__first2, *__first1))
5577 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5581 __debug_less<_Compare> __c(__comp);
5585 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5604 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5612 if (__comp(*--__i, *__ip1))
5615 while (!__comp(*__i, *--__j))
5632 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5636 __debug_less<_Compare> __c(__comp);
5640 return __next_permutation<_Comp_ref>(__first, __last, __comp);
5657 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5665 if (__comp(*__ip1, *--__i))
5668 while (!__comp(*--__j, *__i))
5685 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5689 __debug_less<_Compare> __c(__comp);
5693 return __prev_permutation<_Comp_ref>(__first, __last, __comp);