Lines Matching refs:__comp
2527 __min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2533 if (__comp(*__i, *__first))
2542 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2544 return __min_element(__first, __last, __comp);
2561 min(const _Tp& __a, const _Tp& __b, _Compare __comp)
2563 return __comp(__b, __a) ? __b : __a;
2579 min(initializer_list<_Tp> __t, _Compare __comp)
2581 return *__min_element(__t.begin(), __t.end(), __comp);
2599 __max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2605 if (__comp(*__first, *__i))
2615 max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2617 return __max_element(__first, __last, __comp);
2634 max(const _Tp& __a, const _Tp& __b, _Compare __comp)
2636 return __comp(__a, __b) ? __b : __a;
2652 max(initializer_list<_Tp> __t, _Compare __comp)
2654 return *__max_element(__t.begin(), __t.end(), __comp);
2671 minmax_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
2678 if (__comp(*__first, *__result.first))
2687 if (__comp(*__i, *__result.first))
2689 else if (!__comp(*__i, *__result.second))
2695 if (__comp(*__first, *__i))
2697 if (__comp(*__first, *__result.first))
2699 if (!__comp(*__i, *__result.second))
2704 if (__comp(*__i, *__result.first))
2706 if (!__comp(*__first, *__result.second))
2730 minmax(const _Tp& __a, const _Tp& __b, _Compare __comp)
2732 return __comp(__b, __a) ? pair<const _Tp&, const _Tp&>(__b, __a) :
2749 minmax(initializer_list<_Tp> __t, _Compare __comp)
2759 if (__comp(*__first, __result.first))
2769 if (__comp(__prev, *__first)) {
2770 if (__comp(__prev, __result.first)) __result.first = __prev;
2771 if (__comp(__result.second, *__first)) __result.second = *__first;
2774 if (__comp(*__first, __result.first)) __result.first = *__first;
2775 if (__comp(__result.second, __prev)) __result.second = __prev;
3539 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3546 if (__comp(*__i, *__first))
3567 is_sorted(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp)
3569 return _VSTD::is_sorted_until(__first, __last, __comp) == __last;
3679 __selection_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3686 (__first, __last, __comp);
3694 __insertion_sort(_BirdirectionalIterator __first, _BirdirectionalIterator __last, _Compare __comp)
3704 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3713 __insertion_sort_3(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3717 __sort3<_Compare>(__first, __first+1, __j, __comp);
3720 if (__comp(*__i, *__j))
3729 } while (__j != __first && __comp(__t, *--__k));
3738 …rtion_sort_incomplete(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3746 if (__comp(*--__last, *__first))
3750 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3753 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3756 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3761 __sort3<_Compare>(__first, __first+1, __j, __comp);
3766 if (__comp(*__i, *__j))
3775 } while (__j != __first && __comp(__t, *--__k));
3788 … typename iterator_traits<_BirdirectionalIterator>::value_type* __first2, _Compare __comp)
3802 if (__comp(*__first1, *--__i2))
3806 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2)
3822 __sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
3839 if (__comp(*--__last, *__first))
3843 _VSTD::__sort3<_Compare>(__first, __first+1, --__last, __comp);
3846 _VSTD::__sort4<_Compare>(__first, __first+1, __first+2, --__last, __comp);
3849 _VSTD::__sort5<_Compare>(__first, __first+1, __first+2, __first+3, --__last, __comp);
3854 _VSTD::__insertion_sort_3<_Compare>(__first, __last, __comp);
3869 … __n_swaps = _VSTD::__sort5<_Compare>(__first, __first + __delta, __m, __m+__delta, __lm1, __comp);
3875 __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, __lm1, __comp);
3886 if (!__comp(*__i, *__m)) // if *__first == *__m
3898 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
3904 if (__comp(*__first, *__i))
3919 while (!__comp(*__first, *__i))
3921 while (__comp(*__first, *--__j))
3931 // _VSTD::__sort<_Compare>(__i, __last, __comp);
3935 if (__comp(*__j, *__m))
3954 while (__comp(*__i, *__m))
3957 while (!__comp(*--__j, *__m))
3971 if (__i != __m && __comp(*__m, *__i))
3980 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
3981 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
4000 _VSTD::__sort<_Compare>(__first, __i, __comp);
4001 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4006 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4007 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4017 sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4021 __debug_less<_Compare> __c(__comp);
4025 __sort<_Comp_ref>(__first, __last, __comp);
4056 sort(__wrap_iter<_Tp*> __first, __wrap_iter<_Tp*> __last, _Compare __comp)
4059 _VSTD::sort<_Tp*, _Comp_ref>(__first.base(), __last.base(), __comp);
4107 …ower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4116 if (__comp(*__m, __value_))
4130 lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4134 __debug_less<_Compare> __c(__comp);
4138 return __lower_bound<_Comp_ref>(__first, __last, __value_, __comp);
4155 …pper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4164 if (__comp(__value_, *__m))
4178 upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4182 __debug_less<_Compare> __c(__comp);
4186 return __upper_bound<_Comp_ref>(__first, __last, __value_, __comp);
4203 …qual_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4212 if (__comp(*__m, __value_))
4217 else if (__comp(__value_, *__m))
4227 __lower_bound<_Compare>(__first, __m, __value_, __comp),
4228 __upper_bound<_Compare>(++__mp1, __last, __value_, __comp)
4238 equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4242 __debug_less<_Compare> __c(__comp);
4246 return __equal_range<_Comp_ref>(__first, __last, __value_, __comp);
4264 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4266 __first = __lower_bound<_Compare>(__first, __last, __value_, __comp);
4267 return __first != __last && !__comp(__value_, *__first);
4273 …ary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value_, _Compare __comp)
4277 __debug_less<_Compare> __c(__comp);
4281 return __binary_search<_Comp_ref>(__first, __last, __value_, __comp);
4299 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4305 if (__comp(*__first2, *__first1))
4323 _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
4327 __debug_less<_Compare> __c(__comp);
4331 return _VSTD::__merge<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
4351 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4369 __first, __comp);
4380 _RBi(__last), __negate<_Compare>(__comp));
4387 … _Compare __comp, typename iterator_traits<_BidirectionalIterator>::difference_type __len1,
4403 if (__comp(*__middle, *__first))
4408 … __buffered_inplace_merge<_Compare>(__first, __middle, __last, __comp, __len1, __len2, __buff);
4429 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4444 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4456 … __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4457 // __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __b…
4465 … __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);
4466 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __…
4485 _Compare __comp)
4501 __debug_less<_Compare> __c(__comp);
4506 return _VSTD::__inplace_merge<_Comp_ref>(__first, __middle, __last, __comp, __len1, __len2,
4526 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp)
4547 if (__comp(*__first2, *__first1))
4566 _OutputIterator __result, _Compare __comp)
4576 if (__comp(*__first2, *__first1))
4593 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4599 __stable_sort_move(_RandomAccessIterator __first1, _RandomAccessIterator __last1, _Compare __comp,
4614 if (__comp(*--__last1, *__first1))
4633 __insertion_sort_move<_Compare>(__first1, __last1, __first2, __comp);
4638 __stable_sort<_Compare>(__first1, __m, __comp, __l2, __first2, __l2);
4639 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4640 __merge_move_construct<_Compare>(__first1, __m, __m, __last1, __first2, __comp);
4651 __stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4663 if (__comp(*--__last, *__first))
4669 __insertion_sort<_Compare>(__first, __last, __comp);
4678 __stable_sort_move<_Compare>(__first, __m, __comp, __l2, __buff);
4680 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4682 …merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __comp);
4687 // __first, __comp);
4690 __stable_sort<_Compare>(__first, __m, __comp, __l2, __buff, __buff_size);
4691 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4692 … __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4698 stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4712 __debug_less<_Compare> __c(__comp);
4716 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4732 is_heap_until(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4742 if (__comp(*__pp, *__cp))
4748 if (__comp(*__pp, *__cp))
4770 is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4772 return _VSTD::is_heap_until(__first, __last, __comp) == __last;
4787 __push_heap_front(_RandomAccessIterator __first, _RandomAccessIterator, _Compare __comp,
4798 if (__c == __len || __comp(*__cp, *(__cp - 1)))
4803 if (__comp(*__pp, *__cp))
4815 if (__c == __len || __comp(*__cp, *(__cp - 1)))
4820 } while (__comp(__t, *__cp));
4828 __push_heap_back(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4837 if (__comp(*__ptr, *--__last))
4848 } while (__comp(*__ptr, __t));
4857 push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4861 __debug_less<_Compare> __c(__comp);
4865 __push_heap_back<_Comp_ref>(__first, __last, __comp, __last - __first);
4882 __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp,
4888 __push_heap_front<_Compare>(__first, __last, __comp, __len-1);
4895 pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4899 __debug_less<_Compare> __c(__comp);
4903 __pop_heap<_Comp_ref>(__first, __last, __comp, __last - __first);
4919 __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4928 __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i);
4935 make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4939 __debug_less<_Compare> __c(__comp);
4943 __make_heap<_Comp_ref>(__first, __last, __comp);
4959 __sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4963 __pop_heap<_Compare>(__first, __last, __comp, __n);
4969 sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp)
4973 __debug_less<_Compare> __c(__comp);
4977 __sort_heap<_Comp_ref>(__first, __last, __comp);
4994 _Compare __comp)
4996 __make_heap<_Compare>(__first, __middle, __comp);
5000 if (__comp(*__i, *__first))
5003 __push_heap_front<_Compare>(__first, __middle, __comp, __len);
5006 __sort_heap<_Compare>(__first, __middle, __comp);
5013 _Compare __comp)
5017 __debug_less<_Compare> __c(__comp);
5021 __partial_sort<_Comp_ref>(__first, __middle, __last, __comp);
5039 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5047 __make_heap<_Compare>(__result_first, __r, __comp);
5049 if (__comp(*__first, *__result_first))
5052 __push_heap_front<_Compare>(__result_first, __r, __comp, __len);
5054 __sort_heap<_Compare>(__result_first, __r, __comp);
5063 … _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp)
5067 __debug_less<_Compare> __c(__comp);
5071 return __partial_sort_copy<_Comp_ref>(__first, __last, __result_first, __result_last, __comp);
5089 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5106 if (__comp(*--__last, *__first))
5112 _VSTD::__sort3<_Compare>(__first, ++__m, --__last, __comp);
5118 __selection_sort<_Compare>(__first, __last, __comp);
5124 unsigned __n_swaps = _VSTD::__sort3<_Compare>(__first, __m, --__lm1, __comp);
5133 if (!__comp(*__i, *__m)) // if *__first == *__m
5145 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5151 if (__comp(*__first, *__i))
5166 while (!__comp(*__first, *__i))
5168 while (__comp(*__first, *--__j))
5181 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5185 if (__comp(*__j, *__m))
5202 while (__comp(*__i, *__m))
5205 while (!__comp(*--__j, *__m))
5219 if (__i != __m && __comp(*__m, *__i))
5236 if (__comp(*__j, *__m))
5250 if (__comp(*__j, *__m))
5263 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5268 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5277 …AccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp)
5281 __debug_less<_Compare> __c(__comp);
5285 __nth_element<_Comp_ref>(__first, __nth, __last, __comp);
5302 _Compare __comp)
5306 if (__first1 == __last1 || __comp(*__first2, *__first1))
5308 if (!__comp(*__first1, *__first2))
5318 _Compare __comp)
5322 __debug_less<_Compare> __c(__comp);
5326 return __includes<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5345 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5351 if (__comp(*__first2, *__first1))
5359 if (!__comp(*__first1, *__first2))
5371 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5375 __debug_less<_Compare> __c(__comp);
5379 return __set_union<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5399 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5403 if (__comp(*__first1, *__first2))
5407 if (!__comp(*__first2, *__first1))
5423 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5427 __debug_less<_Compare> __c(__comp);
5431 return __set_intersection<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5451 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5457 if (__comp(*__first1, *__first2))
5465 if (!__comp(*__first2, *__first1))
5477 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5481 __debug_less<_Compare> __c(__comp);
5485 return __set_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5505 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5511 if (__comp(*__first1, *__first2))
5519 if (__comp(*__first2, *__first1))
5536 … _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp)
5540 __debug_less<_Compare> __c(__comp);
5544 …turn __set_symmetric_difference<_Comp_ref>(__first1, __last1, __first2, __last2, __result, __comp);
5564 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5568 if (__first1 == __last1 || __comp(*__first1, *__first2))
5570 if (__comp(*__first2, *__first1))
5580 _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp)
5584 __debug_less<_Compare> __c(__comp);
5588 return __lexicographical_compare<_Comp_ref>(__first1, __last1, __first2, __last2, __comp);
5607 __next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5615 if (__comp(*--__i, *__ip1))
5618 while (!__comp(*__i, *--__j))
5635 next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5639 __debug_less<_Compare> __c(__comp);
5643 return __next_permutation<_Comp_ref>(__first, __last, __comp);
5660 __prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5668 if (__comp(*__ip1, *--__i))
5671 while (!__comp(*--__j, *__i))
5688 prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
5692 __debug_less<_Compare> __c(__comp);
5696 return __prev_permutation<_Comp_ref>(__first, __last, __comp);