Lines Matching refs:__i
1113 _ForwardIterator __i = __first;
1114 while (++__i != __last)
1116 if (__pred(*__first, *__i))
1118 __first = __i;
1310 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1312 // Have we already counted the number of *__i in [f1, l1)?
1314 for (; __match != __i; ++__match)
1315 if (__pred(*__match, *__i))
1317 if (__match == __i) {
1318 // Count number of *__i in [f2, l2)
1321 if (__pred(*__i, *__j))
1325 // Count number of *__i in [__i, l1) (we can start with 1)
1327 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1328 if (__pred(*__i, *__j))
1375 for (_ForwardIterator1 __i = __first1; __i != __last1; ++__i)
1377 // Have we already counted the number of *__i in [f1, l1)?
1379 for (; __match != __i; ++__match)
1380 if (__pred(*__match, *__i))
1382 if (__match == __i) {
1383 // Count number of *__i in [f2, l2)
1386 if (__pred(*__i, *__j))
1390 // Count number of *__i in [__i, l1) (we can start with 1)
1392 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1393 if (__pred(*__i, *__j))
1583 __unwrap_iter(_Iter __i)
1585 return __i;
1595 __unwrap_iter(move_iterator<_Tp*> __i)
1597 return __i.base();
1609 __unwrap_iter(__wrap_iter<_Tp*> __i)
1611 return __i.base();
1623 __unwrap_iter(__wrap_iter<_Tp*> __i)
1625 return __i;
2007 _ForwardIterator __i = __first;
2008 while (++__i != __last)
2010 if (!(*__i == __value_))
2012 *__first = _VSTD::move(*__i);
2030 _ForwardIterator __i = __first;
2031 while (++__i != __last)
2033 if (!__pred(*__i))
2035 *__first = _VSTD::move(*__i);
2091 _ForwardIterator __i = __first;
2092 for (++__i; ++__i != __last;)
2093 if (!__pred(*__first, *__i))
2094 *++__first = _VSTD::move(*__i);
2141 _ForwardIterator __i = __first;
2142 *__result = *__i;
2146 if (!__pred(*__i, *__first))
2150 __i = __first;
2268 _ForwardIterator __i = __middle;
2271 swap(*__first, *__i);
2273 if (++__i == __last)
2276 __middle = __i;
2281 __i = __middle;
2284 swap(*__first, *__i);
2286 if (++__i == __last)
2290 __i = __middle;
2293 __middle = __i;
2432 _ForwardIterator __i = __first;
2433 while (++__i != __last)
2434 if (__comp(*__i, *__first))
2435 __first = __i;
2498 _ForwardIterator __i = __first;
2499 while (++__i != __last)
2500 if (__comp(*__first, *__i))
2501 __first = __i;
2595 _ForwardIterator __i = __first;
2598 if (__comp(*__i, *__result.first))
2599 __result.first = __i;
2600 else if (!__comp(*__i, *__result.second))
2601 __result.second = __i;
2606 if (__comp(*__first, *__i))
2610 if (!__comp(*__i, *__result.second))
2611 __result.second = __i;
2615 if (__comp(*__i, *__result.first))
2616 __result.first = __i;
2995 difference_type __i = __uid(__g, _Pp(0, __d));
2996 if (__i != difference_type(0))
2997 swap(*__first, *(__first + __i));
3017 difference_type __i = __rand(__d);
3018 if (__i != difference_type(0))
3019 swap(*__first, *(__first + __i));
3114 difference_type __i = __uid(__g, _Pp(0, __d));
3115 if (__i != difference_type(0))
3116 swap(*__first, *(__first + __i));
3277 _ForwardIterator __i = __first;
3278 while (++__i != __last)
3280 if (__pred(*__i))
3282 *__first = _VSTD::move(*__i);
3287 ::new(__t) value_type(_VSTD::move(*__i));
3294 __i = __first;
3295 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3296 *__i = _VSTD::move(*__t2);
3407 _BidirectionalIterator __i = __first;
3408 while (++__i != __last)
3410 if (__pred(*__i))
3412 *__first = _VSTD::move(*__i);
3417 ::new(__t) value_type(_VSTD::move(*__i));
3423 *__first = _VSTD::move(*__i);
3424 __i = ++__first;
3427 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, ++__i)
3428 *__i = _VSTD::move(*__t2);
3535 _ForwardIterator __i = __first;
3536 while (++__i != __last)
3538 if (__comp(*__i, *__first))
3539 return __i;
3540 __first = __i;
3677 _BirdirectionalIterator __i = _VSTD::min_element<_BirdirectionalIterator,
3680 if (__i != __first)
3681 swap(*__first, *__i);
3692 _BirdirectionalIterator __i = __first;
3693 for (++__i; __i != __last; ++__i)
3695 _BirdirectionalIterator __j = __i;
3697 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3711 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3713 if (__comp(*__i, *__j))
3715 value_type __t(_VSTD::move(*__i));
3717 __j = __i;
3725 __j = __i;
3757 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3759 if (__comp(*__i, *__j))
3761 value_type __t(_VSTD::move(*__i));
3763 __j = __i;
3771 return ++__i == __last;
3773 __j = __i;
3874 _RandomAccessIterator __i = __first;
3879 if (!__comp(*__i, *__m)) // if *__first == *__m
3882 // manually guard downward moving __j against __i
3885 if (__i == --__j)
3888 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
3889 ++__i; // __first + 1
3895 if (__i == __j)
3897 if (__comp(*__first, *__i))
3899 swap(*__i, *__j);
3901 ++__i;
3904 ++__i;
3907 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
3908 if (__i == __j)
3912 while (!__comp(*__first, *__i))
3913 ++__i;
3916 if (__i >= __j)
3918 swap(*__i, *__j);
3920 ++__i;
3922 // [__first, __i) == *__first and *__first < [__i, __last)
3924 // _VSTD::__sort<_Compare>(__i, __last, __comp);
3925 __first = __i;
3930 swap(*__i, *__j);
3936 // It is known that *__i < *__m
3937 ++__i;
3940 if (__i < __j)
3942 // known that *(__i - 1) < *__m
3943 // known that __i <= __m
3946 // __m still guards upward moving __i
3947 while (__comp(*__i, *__m))
3948 ++__i;
3952 if (__i > __j)
3954 swap(*__i, *__j);
3958 if (__m == __i)
3960 ++__i;
3963 // [__first, __i) < *__m and *__m <= [__i, __last)
3964 if (__i != __m && __comp(*__m, *__i))
3966 swap(*__i, *__m);
3969 // [__first, __i) < *__i and *__i <= [__i+1, __last)
3973 bool __fs = _VSTD::__insertion_sort_incomplete<_Compare>(__first, __i, __comp);
3974 if (_VSTD::__insertion_sort_incomplete<_Compare>(__i+1, __last, __comp))
3978 __last = __i;
3985 __first = ++__i;
3991 if (__i - __first < __last - __i)
3993 _VSTD::__sort<_Compare>(__first, __i, __comp);
3994 // _VSTD::__sort<_Compare>(__i+1, __last, __comp);
3995 __first = ++__i;
3999 _VSTD::__sort<_Compare>(__i+1, __last, __comp);
4000 // _VSTD::__sort<_Compare>(__first, __i, __comp);
4001 __last = __i;
4363 …for (_BidirectionalIterator __i = __first; __i != __middle; __d.__incr((value_type*)0), (void) ++_…
4364 ::new(__p) value_type(_VSTD::move(*__i));
4370 …for (_BidirectionalIterator __i = __middle; __i != __last; __d.__incr((value_type*)0), (void) ++__…
4371 ::new(__p) value_type(_VSTD::move(*__i));
4995 for (_RandomAccessIterator __i = __middle; __i != __last; ++__i)
4997 if (__comp(*__i, *__first))
4999 swap(*__i, *__first);
5125 _RandomAccessIterator __i = __first;
5130 if (!__comp(*__i, *__m)) // if *__first == *__m
5133 // manually guard downward moving __j against __i
5136 if (__i == --__j)
5139 // Parition instead into [__first, __i) == *__first and *__first < [__i, __last)
5140 ++__i; // __first + 1
5146 if (__i == __j)
5148 if (__comp(*__first, *__i))
5150 swap(*__i, *__j);
5152 ++__i;
5155 ++__i;
5158 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
5159 if (__i == __j)
5163 while (!__comp(*__first, *__i))
5164 ++__i;
5167 if (__i >= __j)
5169 swap(*__i, *__j);
5171 ++__i;
5173 // [__first, __i) == *__first and *__first < [__i, __last)
5175 if (__nth < __i)
5178 // __nth_element<_Compare>(__i, __nth, __last, __comp);
5179 __first = __i;
5184 swap(*__i, *__j);
5190 ++__i;
5193 if (__i < __j)
5195 // known that *(__i - 1) < *__m
5198 // __m still guards upward moving __i
5199 while (__comp(*__i, *__m))
5200 ++__i;
5204 if (__i >= __j)
5206 swap(*__i, *__j);
5210 if (__m == __i)
5212 ++__i;
5215 // [__first, __i) < *__m and *__m <= [__i, __last)
5216 if (__i != __m && __comp(*__m, *__i))
5218 swap(*__i, *__m);
5221 // [__first, __i) < *__i and *__i <= [__i+1, __last)
5222 if (__nth == __i)
5227 if (__nth < __i)
5229 // Check for [__first, __i) already sorted
5231 while (++__j != __i)
5238 // [__first, __i) sorted
5243 // Check for [__i, __last) already sorted
5244 __j = __m = __i;
5252 // [__i, __last) sorted
5258 if (__nth < __i)
5260 // __nth_element<_Compare>(__first, __nth, __i, __comp);
5261 __last = __i;
5265 // __nth_element<_Compare>(__i+1, __nth, __last, __comp);
5266 __first = ++__i;
5606 _BidirectionalIterator __i = __last;
5607 if (__first == __last || __first == --__i)
5611 _BidirectionalIterator __ip1 = __i;
5612 if (__comp(*--__i, *__ip1))
5615 while (!__comp(*__i, *--__j))
5617 swap(*__i, *__j);
5621 if (__i == __first)
5659 _BidirectionalIterator __i = __last;
5660 if (__first == __last || __first == --__i)
5664 _BidirectionalIterator __ip1 = __i;
5665 if (__comp(*__ip1, *--__i))
5668 while (!__comp(*--__j, *__i))
5670 swap(*__i, *__j);
5674 if (__i == __first)