Lines Matching refs:__j
1051 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1052 if (__pred(*__first1, *__j))
1286 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1287 if (__pred(*__j, *__i))
1292 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1293 if (__pred(*__i, *__j))
1299 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1300 if (__pred(*__i, *__j))
1349 for (_ForwardIterator1 __j = __first1; __j != __i; ++__j)
1350 if (__pred(*__j, *__i))
1355 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j)
1356 if (__pred(*__i, *__j))
1362 for (_ForwardIterator1 __j = _VSTD::next(__i); __j != __last1; ++__j)
1363 if (__pred(*__i, *__j))
3718 _BirdirectionalIterator __j = __i;
3719 value_type __t(_VSTD::move(*__j));
3720 for (_BirdirectionalIterator __k = __i; __k != __first && __comp(__t, *--__k); --__j)
3721 *__j = _VSTD::move(*__k);
3722 *__j = _VSTD::move(__t);
3732 _RandomAccessIterator __j = __first+2;
3733 __sort3<_Compare>(__first, __first+1, __j, __comp);
3734 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3736 if (__comp(*__i, *__j))
3739 _RandomAccessIterator __k = __j;
3740 __j = __i;
3743 *__j = _VSTD::move(*__k);
3744 __j = __k;
3745 } while (__j != __first && __comp(__t, *--__k));
3746 *__j = _VSTD::move(__t);
3748 __j = __i;
3776 _RandomAccessIterator __j = __first+2;
3777 __sort3<_Compare>(__first, __first+1, __j, __comp);
3780 for (_RandomAccessIterator __i = __j+1; __i != __last; ++__i)
3782 if (__comp(*__i, *__j))
3785 _RandomAccessIterator __k = __j;
3786 __j = __i;
3789 *__j = _VSTD::move(*__k);
3790 __j = __k;
3791 } while (__j != __first && __comp(__t, *--__k));
3792 *__j = _VSTD::move(__t);
3796 __j = __i;
3898 _RandomAccessIterator __j = __lm1;
3905 // manually guard downward moving __j against __i
3908 if (__i == --__j)
3913 __j = __last;
3914 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
3918 if (__i == __j)
3922 swap(*__i, *__j);
3930 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
3931 if (__i == __j)
3937 while (__comp(*__first, *--__j))
3939 if (__i >= __j)
3941 swap(*__i, *__j);
3951 if (__comp(*__j, *__m))
3953 swap(*__i, *__j);
3955 break; // found guard for downward moving __j, now use unguarded partition
3963 if (__i < __j)
3972 // It is now known that a guard exists for downward moving __j
3973 while (!__comp(*--__j, *__m))
3975 if (__i > __j)
3977 swap(*__i, *__j);
3979 // It is known that __m != __j
3982 __m = __j;
5167 _RandomAccessIterator __j = __lm1;
5174 // manually guard downward moving __j against __i
5177 if (__i == --__j)
5182 __j = __last;
5183 if (!__comp(*__first, *--__j)) // we need a guard if *__first == *(__last-1)
5187 if (__i == __j)
5191 swap(*__i, *__j);
5199 // [__first, __i) == *__first and *__first < [__j, __last) and __j == __last - 1
5200 if (__i == __j)
5206 while (__comp(*__first, *--__j))
5208 if (__i >= __j)
5210 swap(*__i, *__j);
5223 if (__comp(*__j, *__m))
5225 swap(*__i, *__j);
5227 break; // found guard for downward moving __j, now use unguarded partition
5234 if (__i < __j)
5242 // It is now known that a guard exists for downward moving __j
5243 while (!__comp(*--__j, *__m))
5245 if (__i >= __j)
5247 swap(*__i, *__j);
5249 // It is known that __m != __j
5252 __m = __j;
5271 __j = __m = __first;
5272 while (++__j != __i)
5274 if (__comp(*__j, *__m))
5277 __m = __j;
5285 __j = __m = __i;
5286 while (++__j != __last)
5288 if (__comp(*__j, *__m))
5291 __m = __j;
5655 _BidirectionalIterator __j = __last;
5656 while (!__comp(*__i, *--__j))
5658 swap(*__i, *__j);
5708 _BidirectionalIterator __j = __last;
5709 while (!__comp(*--__j, *__i))
5711 swap(*__i, *__j);