Lines Matching refs:__j
1077 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1078 if (__pred(*__first1, *__j))
1312 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1313 if (__pred(*__j, *__i))
1318 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1319 if (__pred(*__i, *__j))
1325 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1326 if (__pred(*__i, *__j))
1375 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1376 if (__pred(*__j, *__i))
1381 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1382 if (__pred(*__i, *__j))
1388 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1389 if (__pred(*__i, *__j))
3768 _BirdirectionalIterator __j = __i;
3769 value_type __t(_VSTD::move(*__j));
3770 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3771 *__j = _VSTD::move(*__k);
3772 *__j = _VSTD::move(__t);
3782 _RandomAccessIterator __j = __first+2;
3783 __sort3<_Compare>(__first, __first+1, __j, __comp);
3784 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3786 if (__comp(*__i, *__j))
3789 _RandomAccessIterator __k = __j;
3790 __j = __i;
3793 *__j = _VSTD::move(*__k);
3794 __j = __k;
3795 } while (__j != __first && __comp(__t, *--__k));
3796 *__j = _VSTD::move(__t);
3798 __j = __i;
3826 _RandomAccessIterator __j = __first+2;
3827 __sort3<_Compare>(__first, __first+1, __j, __comp);
3830 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3832 if (__comp(*__i, *__j))
3835 _RandomAccessIterator __k = __j;
3836 __j = __i;
3839 *__j = _VSTD::move(*__k);
3840 __j = __k;
3841 } while (__j != __first && __comp(__t, *--__k));
3842 *__j = _VSTD::move(__t);
3846 __j = __i;
3948 _RandomAccessIterator __j = __lm1;
3955 // manually guard downward moving __j against __i
3958 if (__i == --__j)
3963 __j = __last;
3964 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
3968 if (__i == __j)
3972 swap(*__i, *__j);
3980 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
3981 if (__i == __j)
3987 while (__comp(*__first, *--__j))
3989 if (__i >= __j)
3991 swap(*__i, *__j);
4001 if (__comp(*__j, *__m))
4003 swap(*__i, *__j);
4005 break; // found guard for downward moving __j, now use unguarded partition
4013 if (__i < __j)
4022 // It is now known that a guard exists for downward moving __j
4023 while (!__comp(*--__j, *__m))
4025 if (__i > __j)
4027 swap(*__i, *__j);
4029 // It is known that __m != __j
4032 __m = __j;
5218 _RandomAccessIterator __j = __lm1;
5225 // manually guard downward moving __j against __i
5228 if (__i == --__j)
5233 __j = __last;
5234 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5238 if (__i == __j)
5242 swap(*__i, *__j);
5250 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
5251 if (__i == __j)
5257 while (__comp(*__first, *--__j))
5259 if (__i >= __j)
5261 swap(*__i, *__j);
5274 if (__comp(*__j, *__m))
5276 swap(*__i, *__j);
5278 break; // found guard for downward moving __j, now use unguarded partition
5285 if (__i < __j)
5293 // It is now known that a guard exists for downward moving __j
5294 while (!__comp(*--__j, *__m))
5296 if (__i >= __j)
5298 swap(*__i, *__j);
5300 // It is known that __m != __j
5303 __m = __j;
5322 __j = __m = __first;
5323 while (++__j != __i)
5325 if (__comp(*__j, *__m))
5328 __m = __j;
5336 __j = __m = __i;
5337 while (++__j != __last)
5339 if (__comp(*__j, *__m))
5342 __m = __j;
5706 _BidirectionalIterator __j = __last;
5707 while (!__comp(*__i, *--__j))
5709 swap(*__i, *__j);
5759 _BidirectionalIterator __j = __last;
5760 while (!__comp(*--__j, *__i))
5762 swap(*__i, *__j);