Lines Matching full:__comp
2555 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2561 if (__comp(*__i, *__first))
2581 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2583 return __comp(__b, __a) ? __b : __a;
2599 min(initializer_list<_Tp> __t, _Compare __comp)
2601 return *_VSTD::min_element(__t.begin(), __t.end(), __comp);
2619 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2625 if (__comp(*__first, *__i))
2646 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2648 return __comp(__a, __b) ? __b : __a;
2664 max(initializer_list<_Tp> __t, _Compare __comp)
2666 return *_VSTD::max_element(__t.begin(), __t.end(), __comp);
2684 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2691 if (__comp(*__first, *__result.first))
2700 if (__comp(*__i, *__result.first))
2702 else if (!__comp(*__i, *__result.second))
2708 if (__comp(*__first, *__i))
2710 if (__comp(*__first, *__result.first))
2712 if (!__comp(*__i, *__result.second))
2717 if (__comp(*__i, *__result.first))
2719 if (!__comp(*__first, *__result.second))
2743 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
2745 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
2762 minmax(initializer_list<_Tp> __t, _Compare __comp)
2772 if (__comp(*__first, __result.first))
2782 if (__comp(*__first, __prev)) {
2783 if ( __comp(*__first, __result.first)) __result.first = *__first;
2784 if (!__comp(__prev, __result.second)) __result.second = __prev;
2787 if ( __comp(__prev, __result.first)) __result.first = __prev;
2788 if (!__comp(*__first, __result.second)) __result.second = *__first;
3555 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3562 if (__comp(*__i, *__first))
3583 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3585 return _VSTD::is_sorted_until(__first, __last, __comp) == __last;
3695 __selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3702 (__first, __last, __comp);
3710 __insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3720 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3729 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3733 __sort3<_Compare>(__first, __first+1, __j, __comp);
3736 if (__comp(*__i, *__j))
3745 } while (__j != __first && __comp(__t, *--__k));
3754 __insertion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3762 if (__comp(*--__last, *__first))
3766 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3769 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3772 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3777 __sort3<_Compare>(__first, __first+1, __j, __comp);
3782 if (__comp(*__i, *__j))
3791 } while (__j != __first && __comp(__t, *--__k));
3804 typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3818 if (__comp(*__first1, *--__i2))
3822 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3838 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3855 if (__comp(*--__last, *__first))
3859 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3862 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3865 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3870 _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp);
3885 __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp);
3891 __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp);
3902 if (!__comp(*__i, *__m)) // if *__first == *__m
3914 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
3920 if (__comp(*__first, *__i))
3935 while (!__comp(*__first, *__i))
3937 while (__comp(*__first, *--__j))
3947 // _VSTD::__sort<_Compare>(__i, __last, __comp);
3951 if (__comp(*__j, *__m))
3970 while (__comp(*__i, *__m))
3973 while (!__comp(*--__j, *__m))
3987 if (__i != __m && __comp(*__m, *__i))
3996 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
3997 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
4016 _VSTD::__sort<_Compare>(__first, __i, __comp);
4017 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4022 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4023 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4033 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4037 __debug_less<_Compare> __c(__comp);
4041 __sort<_Comp_ref>(__first, __last, __comp);
4072 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp)
4075 _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp);
4123 __lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4132 if (__comp(*__m, __value_))
4146 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4150 __debug_less<_Compare> __c(__comp);
4154 return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
4171 __upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4180 if (__comp(__value_, *__m))
4194 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4198 __debug_less<_Compare> __c(__comp);
4202 return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
4219 __equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4228 if (__comp(*__m, __value_))
4233 else if (__comp(__value_, *__m))
4243 __lower_bound<_Compare>(__first, __m, __value_, __comp),
4244 __upper_bound<_Compare>(++__mp1, __last, __value_, __comp)
4254 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4258 __debug_less<_Compare> __c(__comp);
4262 return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
4280 __binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4282 __first = __lower_bound<_Compare>(__first, __last, __value_, __comp);
4283 return __first != __last && !__comp(__value_, *__first);
4289 binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4293 __debug_less<_Compare> __c(__comp);
4297 return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
4315 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4321 if (__comp(*__first2, *__first1))
4339 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4343 __debug_less<_Compare> __c(__comp);
4347 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4368 _OutputIterator __result, _Compare __comp)
4378 if (__comp(*__first2, *__first1))
4395 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4407 __half_inplace_merge(__buff, __p, __middle, __last, __first, __comp);
4418 _RBi(__last), __negate<_Compare>(__comp));
4425 _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4437 (__first, __middle, __last, __comp, __len1, __len2, __buff);
4443 if (__comp(*__middle, *__first))
4464 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4479 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4491 __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4492 // __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4500 __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4501 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4514 _Compare __comp)
4526 __debug_less<_Compare> __c(__comp);
4531 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
4551 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
4572 if (__comp(*__first2, *__first1))
4591 _OutputIterator __result, _Compare __comp)
4601 if (__comp(*__first2, *__first1))
4618 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4624 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4639 if (__comp(*--__last1, *__first1))
4658 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4663 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4664 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4665 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
4676 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4688 if (__comp(*--__last, *__first))
4694 __insertion_sort<_Compare>(__first, __last, __comp);
4703 __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff);
4705 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4707 __merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
4712 // __first, __comp);
4715 __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
4716 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4717 __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4723 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4737 __debug_less<_Compare> __c(__comp);
4741 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4757 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4767 if (__comp(*__pp, *__cp))
4773 if (__comp(*__pp, *__cp))
4795 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4797 return _VSTD::is_heap_until(__first, __last, __comp) == __last;
4812 __sift_up(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4820 if (__comp(*__ptr, *--__last))
4831 } while (__comp(*__ptr, __t));
4840 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4844 __debug_less<_Compare> __c(__comp);
4848 __sift_up<_Comp_ref>(__first, __last, __comp, __last - __first);
4864 __sift_down(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4880 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4887 if (__comp(*__child_i, *__start))
4905 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4912 } while (!__comp(*__child_i, __top));
4919 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4925 __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
4932 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4936 __debug_less<_Compare> __c(__comp);
4940 __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
4956 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4965 __sift_down<_Compare>(__first, __last, __comp, __n, __first + __start);
4973 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4977 __debug_less<_Compare> __c(__comp);
4981 __make_heap<_Comp_ref>(__first, __last, __comp);
4997 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5001 __pop_heap<_Compare>(__first, __last, __comp, __n);
5007 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
5011 __debug_less<_Compare> __c(__comp);
5015 __sort_heap<_Comp_ref>(__first, __last, __comp);
5032 _Compare __comp)
5034 __make_heap<_Compare>(__first, __middle, __comp);
5038 if (__comp(*__i, *__first))
5041 __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5044 __sort_heap<_Compare>(__first, __middle, __comp);
5051 _Compare __comp)
5055 __debug_less<_Compare> __c(__comp);
5059 __partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
5077 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5084 __make_heap<_Compare>(__result_first, __r, __comp);
5087 if (__comp(*__first, *__result_first))
5090 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5092 __sort_heap<_Compare>(__result_first, __r, __comp);
5101 _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5105 __debug_less<_Compare> __c(__comp);
5109 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
5127 __nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5144 if (__comp(*--__last, *__first))
5150 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp);
5156 __selection_sort<_Compare>(__first, __last, __comp);
5162 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp);
5171 if (!__comp(*__i, *__m)) // if *__first == *__m
5183 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5189 if (__comp(*__first, *__i))
5204 while (!__comp(*__first, *__i))
5206 while (__comp(*__first, *--__j))
5219 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5223 if (__comp(*__j, *__m))
5240 while (__comp(*__i, *__m))
5243 while (!__comp(*--__j, *__m))
5257 if (__i != __m && __comp(*__m, *__i))
5274 if (__comp(*__j, *__m))
5288 if (__comp(*__j, *__m))
5301 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5306 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5315 nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5319 __debug_less<_Compare> __c(__comp);
5323 __nth_element<_Comp_ref>(__first, __nth, __last, __comp);
5340 _Compare __comp)
5344 if (__first1 == __last1 || __comp(*__first2, *__first1))
5346 if (!__comp(*__first1, *__first2))
5356 _Compare __comp)
5360 __debug_less<_Compare> __c(__comp);
5364 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5383 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5389 if (__comp(*__first2, *__first1))
5397 if (!__comp(*__first1, *__first2))
5409 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5413 __debug_less<_Compare> __c(__comp);
5417 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5437 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5441 if (__comp(*__first1, *__first2))
5445 if (!__comp(*__first2, *__first1))
5461 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5465 __debug_less<_Compare> __c(__comp);
5469 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5489 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5495 if (__comp(*__first1, *__first2))
5503 if (!__comp(*__first2, *__first1))
5515 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5519 __debug_less<_Compare> __c(__comp);
5523 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5543 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5549 if (__comp(*__first1, *__first2))
5557 if (__comp(*__first2, *__first1))
5574 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5578 __debug_less<_Compare> __c(__comp);
5582 return __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5602 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5606 if (__first1 == __last1 || __comp(*__first1, *__first2))
5608 if (__comp(*__first2, *__first1))
5618 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5622 __debug_less<_Compare> __c(__comp);
5626 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5645 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5653 if (__comp(*--__i, *__ip1))
5656 while (!__comp(*__i, *--__j))
5673 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5677 __debug_less<_Compare> __c(__comp);
5681 return __next_permutation<_Comp_ref>(__first, __last, __comp);
5698 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5706 if (__comp(*__ip1, *--__i))
5709 while (!__comp(*--__j, *__i))
5726 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5730 __debug_less<_Compare> __c(__comp);
5734 return __prev_permutation<_Comp_ref>(__first, __last, __comp);