Lines Matching refs:__m2

946         _ForwardIterator2 __m2 = __first2;
949             if (++__m2 == __last2)
957             if (!__pred(*__m1, *__m2))  // mismatch, restart with a new __first
990         _BidirectionalIterator2 __m2 = __l2;
993 …   if (__m2 == __first2)  // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
997             if (!__pred(*--__m1, *--__m2))  // if there is a mismatch, restart with a new __l1
1032         _RandomAccessIterator2 __m2 = __l2;
1035             if (__m2 == __first2)
1038             if (!__pred(*--__m1, *--__m2))
2321     const difference_type __m2 = __last - __middle;
2322     if (__m1 == __m2)
2327     const difference_type __g = _VSTD::__algo_gcd(__m1, __m2);
2345     return __first + __m2;
4406         // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that
4408         //         [__first, __m1)  <= [__middle, __m2)
4409         //         [__middle, __m2) <  [__m1, __middle)
4410         //         [__m1, __middle) <= [__m2, __last)
4411         //     and __m1 or __m2 is in the middle of its range
4413         _BidirectionalIterator __m2;  // "median" of [__middle, __last)
4415         difference_type __len21;      // distance(__middle, __m2)
4420             __m2 = __middle;
4421             _VSTD::advance(__m2, __len21);
4422             __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4437             __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4438             __len21 = _VSTD::distance(__middle, __m2);
4441         difference_type __len22 = __len2 - __len21;  // distance(__m2, __last)
4442         // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last)
4444         __middle = _VSTD::rotate(__m1, __middle, __m2);
4450 //          __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __b…
4452             __middle = __m2;
4458 …  __inplace_merge<_Compare>(__middle, __m2, __last, __comp, __len12, __len22, __buff, __buff_size);