Lines Matching refs:__m1
919 _ForwardIterator1 __m1 = __first1;
929 if (++__m1 == __last1) // Source exhausted, return last answer
931 if (!__pred(*__m1, *__m2)) // mismatch, restart with a new __first
963 _BidirectionalIterator1 __m1 = __l1;
967 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern)
968 return __m1;
969 if (__m1 == __first1) // Otherwise if source exhaused, pattern not found
971 if (!__pred(*--__m1, *--__m2)) // if there is a mismatch, restart with a new __l1
1005 _RandomAccessIterator1 __m1 = __l1;
1010 return __m1;
1011 … // no need to check range on __m1 because __s guarantees we have enough source
1012 if (!__pred(*--__m1, *--__m2))
1437 _ForwardIterator1 __m1 = __first1;
1443 if (++__m1 == __last1) // Otherwise if source exhaused, pattern not found
1445 if (!__pred(*__m1, *__m2)) // if there is a mismatch, restart with a new __first1
1512 _RandomAccessIterator1 __m1 = __first1;
1519 … ++__m1; // no need to check range on __m1 because __s guarantees we have enough source
1520 if (!__pred(*__m1, *__m2))
1528 ++__m1;
1531 if (!__pred(*__m1, *__m2))
1533 if (!__pred(*++__m1, *++__m2))
1535 if (!__pred(*++__m1, *++__m2))
1537 if (!__pred(*++__m1, *++__m2))
1539 ++__m1;
1545 if (!__pred(*__m1, *__m2))
1547 ++__m1;
1550 if (!__pred(*__m1, *__m2))
1552 ++__m1;
1555 if (!__pred(*__m1, *__m2))
2441 const difference_type __m1 = __middle - __first;
2443 if (__m1 == __m2)
2448 const difference_type __g = _VSTD::__gcd(__m1, __m2);
2453 _RandomAccessIterator __p2 = __p1 + __m1;
2459 if (__m1 < __d)
2460 __p2 += __m1;
2462 __p2 = __first + (__m1 - __d);
3344 _ForwardIterator __m1 = __m;
3347 while (__pred(*__m1))
3349 if (++__m1 == __last)
3355 __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __fit);
3471 _BidirectionalIterator __m1 = __m;
3474 while (!__pred(*--__m1))
3476 if (__m1 == __first)
3483 __first_false = __stable_partition<_PredRef>(__first, __m1, __pred, __len_half, __p, __bit);
3488 __m1 = __m;
3492 while (__pred(*__m1))
3494 if (++__m1 == __last)
3500 __second_false = __stable_partition<_PredRef>(__m1, __last, __pred, __len_half, __p, __bit);
4431 // partition [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last) such that
4433 // [__first, __m1) <= [__middle, __m2)
4434 // [__middle, __m2) < [__m1, __middle)
4435 // [__m1, __middle) <= [__m2, __last)
4436 // and __m1 or __m2 is in the middle of its range
4437 _BidirectionalIterator __m1; // "median" of [__first, __middle)
4439 difference_type __len11; // distance(__first, __m1)
4447 __m1 = __upper_bound<_Compare>(__first, __middle, *__m2, __comp);
4448 __len11 = _VSTD::distance(__first, __m1);
4460 __m1 = __first;
4461 _VSTD::advance(__m1, __len11);
4462 __m2 = __lower_bound<_Compare>(__middle, __last, *__m1, __comp);
4465 difference_type __len12 = __len1 - __len11; // distance(__m1, __middle)
4467 // [__first, __m1) [__m1, __middle) [__middle, __m2) [__m2, __last)
4469 __middle = _VSTD::rotate(__m1, __middle, __m2);
4474 … __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __buff_size);
4484 // __inplace_merge<_Compare>(__first, __m1, __middle, __comp, __len11, __len21, __buff, __…
4486 __middle = __m1;