Lines Matching refs:__i
1018 _ForwardIterator __i = __first;
1019 while (++__i != __last)
1021 if (__pred(*__first, *__i))
1023 __first = __i;
1134 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1136 // Have we already counted the number of *__i in [f1, l1)?
1137 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1138 if (__pred(*__j, *__i))
1141 // Count number of *__i in [f2, l2)
1144 if (__pred(*__i, *__j))
1148 // Count number of *__i in [__i, l1) (we can start with 1)
1150 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1151 if (__pred(*__i, *__j))
1467 __unwrap_iter(_Iter __i)
1469 return __i;
1479 __unwrap_iter(move_iterator<_Tp*> __i)
1481 return __i.base();
1491 __unwrap_iter(__wrap_iter<_Tp*> __i)
1493 return __i.base();
1870 _ForwardIterator __i = __first;
1871 while (++__i != __last)
1873 if (!(*__i == __value_))
1875 *__first = _VSTD::move(*__i);
1893 _ForwardIterator __i = __first;
1894 while (++__i != __last)
1896 if (!__pred(*__i))
1898 *__first = _VSTD::move(*__i);
1954 _ForwardIterator __i = __first;
1955 for (++__i; ++__i != __last;)
1956 if (!__pred(*__first, *__i))
1957 *++__first = _VSTD::move(*__i);
2004 _ForwardIterator __i = __first;
2005 *__result = *__i;
2009 if (!__pred(*__i, *__first))
2013 __i = __first;
2131 _ForwardIterator __i = __middle;
2134 swap(*__first, *__i);
2136 if (++__i == __last)
2139 __middle = __i;
2144 __i = __middle;
2147 swap(*__first, *__i);
2149 if (++__i == __last)
2153 __i = __middle;
2156 __middle = __i;
2293 _ForwardIterator __i = __first;
2294 while (++__i != __last)
2295 if (__comp(*__i, *__first))
2296 __first = __i;
2357 _ForwardIterator __i = __first;
2358 while (++__i != __last)
2359 if (__comp(*__first, *__i))
2360 __first = __i;
2429 _ForwardIterator __i = __first;
2432 if (__comp(*__i, *__result.first))
2433 __result.first = __i;
2434 else if (!__comp(*__i, *__result.second))
2435 __result.second = __i;
2440 if (__comp(*__first, *__i))
2444 if (!__comp(*__i, *__result.second))
2445 __result.second = __i;
2449 if (__comp(*__i, *__result.first))
2450 __result.first = __i;
2799 difference_type __i = __uid(__g, _Pp(0, __d));
2800 if (__i != difference_type(0))
2801 swap(*__first, *(__first + __i));
2821 difference_type __i = __rand(__d);
2822 swap(*__first, *(__first + __i));
2844 difference_type __i = __uid(__g, _Pp(0, __d));
2845 if (__i != difference_type(0))
2846 swap(*__first, *(__first + __i));
3004 _ForwardIterator __i = __first;
3005 while (++__i != __last)
3007 if (__pred(*__i))
3009 *__first = _VSTD::move(*__i);
3014 ::new(__t) value_type(_VSTD::move(*__i));
3021 __i = __first;
3022 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3023 *__i = _VSTD::move(*__t2);
3134 _BidirectionalIterator __i = __first;
3135 while (++__i != __last)
3137 if (__pred(*__i))
3139 *__first = _VSTD::move(*__i);
3144 ::new(__t) value_type(_VSTD::move(*__i));
3150 *__first = _VSTD::move(*__i);
3151 __i = ++__first;
3154 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3155 *__i = _VSTD::move(*__t2);
3262 _ForwardIterator __i = __first;
3263 while (++__i != __last)
3265 if (__comp(*__i, *__first))
3266 return __i;
3267 __first = __i;
3403 _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator,
3406 if (__i != __first)
3407 swap(*__first, *__i);
3418 _BirdirectionalIterator __i = __first;
3419 for (++__i; __i != __last; ++__i)
3421 _BirdirectionalIterator __j = __i;
3423 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3437 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3439 if (__comp(*__i, *__j))
3441 value_type __t(_VSTD::move(*__i));
3443 __j = __i;
3451 __j = __i;
3483 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3485 if (__comp(*__i, *__j))
3487 value_type __t(_VSTD::move(*__i));
3489 __j = __i;
3497 return ++__i == __last;
3499 __j = __i;
3600 _RandomAccessIterator __i = __first;
3605 if (!__comp(*__i, *__m)) // if *__first == *__m
3608 // manually guard downward moving __j against __i
3611 if (__i == --__j)
3614 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
3615 ++__i; // __first + 1
3621 if (__i == __j)
3623 if (__comp(*__first, *__i))
3625 swap(*__i, *__j);
3627 ++__i;
3630 ++__i;
3633 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
3634 if (__i == __j)
3638 while (!__comp(*__first, *__i))
3639 ++__i;
3642 if (__i >= __j)
3644 swap(*__i, *__j);
3646 ++__i;
3648 // [__first, __i) == *__first and *__first < [__i, __last)
3650 // _VSTD::__sort<_Compare>(__i, __last, __comp);
3651 __first = __i;
3656 swap(*__i, *__j);
3662 // It is known that *__i < *__m
3663 ++__i;
3666 if (__i < __j)
3668 // known that *(__i - 1) < *__m
3669 // known that __i <= __m
3672 // __m still guards upward moving __i
3673 while (__comp(*__i, *__m))
3674 ++__i;
3678 if (__i > __j)
3680 swap(*__i, *__j);
3684 if (__m == __i)
3686 ++__i;
3689 // [__first, __i) < *__m and *__m <= [__i, __last)
3690 if (__i != __m && __comp(*__m, *__i))
3692 swap(*__i, *__m);
3695 // [__first, __i) < *__i and *__i <= [__i+1, __last)
3699 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
3700 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
3704 __last = __i;
3711 __first = ++__i;
3717 if (__i - __first < __last - __i)
3719 _VSTD::__sort<_Compare>(__first, __i, __comp);
3720 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
3721 __first = ++__i;
3725 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
3726 // _VSTD::__sort<_Compare>(__first, __i, __comp);
3727 __last = __i;
4082 …for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), ++__i, ++_…
4083 ::new(__p) value_type(_VSTD::move(*__i));
4093 …for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), ++__i, ++__…
4094 ::new(__p) value_type(_VSTD::move(*__i));
4646 for (difference_type __i = 1; __i < __n;)
4647 __push_heap_back<_Compare>(__first, ++__last, __comp, ++__i);
4717 for (_RandomAccessIterator __i = __middle; __i != __last; ++__i)
4719 if (__comp(*__i, *__first))
4721 swap(*__i, *__first);
4847 _RandomAccessIterator __i = __first;
4852 if (!__comp(*__i, *__m)) // if *__first == *__m
4855 // manually guard downward moving __j against __i
4858 if (__i == --__j)
4861 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
4862 ++__i; // __first + 1
4868 if (__i == __j)
4870 if (__comp(*__first, *__i))
4872 swap(*__i, *__j);
4874 ++__i;
4877 ++__i;
4880 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
4881 if (__i == __j)
4885 while (!__comp(*__first, *__i))
4886 ++__i;
4889 if (__i >= __j)
4891 swap(*__i, *__j);
4893 ++__i;
4895 // [__first, __i) == *__first and *__first < [__i, __last)
4897 if (__nth < __i)
4900 // __nth_element<_Compare>(__i, __nth, __last, __comp);
4901 __first = __i;
4906 swap(*__i, *__j);
4912 ++__i;
4915 if (__i < __j)
4917 // known that *(__i - 1) < *__m
4920 // __m still guards upward moving __i
4921 while (__comp(*__i, *__m))
4922 ++__i;
4926 if (__i >= __j)
4928 swap(*__i, *__j);
4932 if (__m == __i)
4934 ++__i;
4937 // [__first, __i) < *__m and *__m <= [__i, __last)
4938 if (__i != __m && __comp(*__m, *__i))
4940 swap(*__i, *__m);
4943 // [__first, __i) < *__i and *__i <= [__i+1, __last)
4944 if (__nth == __i)
4949 if (__nth < __i)
4951 // Check for [__first, __i) already sorted
4953 while (++__j != __i)
4960 // [__first, __i) sorted
4965 // Check for [__i, __last) already sorted
4966 __j = __m = __i;
4974 // [__i, __last) sorted
4980 if (__nth < __i)
4982 // __nth_element<_Compare>(__first, __nth, __i, __comp);
4983 __last = __i;
4987 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
4988 __first = ++__i;
5328 _BidirectionalIterator __i = __last;
5329 if (__first == __last || __first == --__i)
5333 _BidirectionalIterator __ip1 = __i;
5334 if (__comp(*--__i, *__ip1))
5337 while (!__comp(*__i, *--__j))
5339 swap(*__i, *__j);
5343 if (__i == __first)
5381 _BidirectionalIterator __i = __last;
5382 if (__first == __last || __first == --__i)
5386 _BidirectionalIterator __ip1 = __i;
5387 if (__comp(*__ip1, *--__i))
5390 while (!__comp(*--__j, *__i))
5392 swap(*__i, *__j);
5396 if (__i == __first)