Lines Matching refs:__len
1595 _Size __len = static_cast<_Size>(__last - __first);
1596 if (__len < __count)
3302 difference_type __len = _VSTD::distance(__first, __last);
3303 while (__len != 0)
3305 difference_type __l2 = __len / 2;
3311 __len -= __l2 + 1;
3314 __len = __l2;
3324 _Distance __len, _Pair __p, forward_iterator_tag __fit)
3327 // __len >= 1
3328 if (__len == 1)
3330 if (__len == 2)
3340 if (__len <= __p.second)
3375 // __len >= 3
3377 _Distance __len2 = __len / 2; // __len2 >= 2
3389 _Distance __len_half = __len - __len2;
3432 difference_type __len = _VSTD::distance(__first, __last);
3435 if (__len >= __alloc_limit)
3437 __p = _VSTD::get_temporary_buffer<value_type>(__len);
3441 (__first, __last, __pred, __len, __p, forward_iterator_tag());
3447 _Distance __len, _Pair __p, bidirectional_iterator_tag __bit)
3451 // __len >= 2
3452 if (__len == 2)
3457 if (__len == 3)
3470 if (__len <= __p.second)
3507 // __len >= 4
3509 _Distance __len2 = __len / 2; // __len2 >= 2
3534 __len_half = __len - __len2;
3579 // __len >= 2
3580 difference_type __len = _VSTD::distance(__first, __last) + 1;
3583 if (__len >= __alloc_limit)
3585 __p = _VSTD::get_temporary_buffer<value_type>(__len);
3589 (__first, __last, __pred, __len, __p, bidirectional_iterator_tag());
3898 difference_type __len = __last - __first;
3899 switch (__len)
3918 if (__len <= __limit)
3923 // __len > 5
3930 if (__len >= 1000)
3932 __delta = __len/2;
3939 __delta = __len/2;
4176 difference_type __len = _VSTD::distance(__first, __last);
4177 while (__len != 0)
4179 difference_type __l2 = __len / 2;
4185 __len -= __l2 + 1;
4188 __len = __l2;
4224 difference_type __len = _VSTD::distance(__first, __last);
4225 while (__len != 0)
4227 difference_type __l2 = __len / 2;
4231 __len = __l2;
4235 __len -= __l2 + 1;
4272 difference_type __len = _VSTD::distance(__first, __last);
4273 while (__len != 0)
4275 difference_type __l2 = __len / 2;
4281 __len -= __l2 + 1;
4286 __len = __l2;
4510 { // __len >= 1, __len2 >= 2
4669 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4675 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4679 switch (__len)
4706 if (__len <= 8)
4711 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4714 __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4727 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4732 switch (__len)
4742 if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4747 typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4749 if (__len <= __buff_size)
4755 __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4756 __d.__set(__len, (value_type*)0);
4757 …__merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __com…
4761 // move_iterator<_RandomAccessIterator>(__buff + __len),
4766 __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4767 … __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4777 difference_type __len = __last - __first;
4780 if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4782 __buf = _VSTD::get_temporary_buffer<value_type>(__len);
4788 __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second);
4791 __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4810 difference_type __len = __last - __first;
4814 while (__c < __len)
4821 if (__c == __len)
4863 typename iterator_traits<_RandomAccessIterator>::difference_type __len)
4866 if (__len > 1)
4868 __len = (__len - 2) / 2;
4869 _RandomAccessIterator __ptr = __first + __len;
4877 if (__len == 0)
4879 __len = (__len - 1) / 2;
4880 __ptr = __first + __len;
4916 typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4925 if (__len < 2 || (__len - 2) / 2 < __child)
4931 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4949 if ((__len - 2) / 2 < __child)
4956 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4971 typename iterator_traits<_RandomAccessIterator>::difference_type __len)
4973 if (__len > 1)
4976 __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
5086 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first;
5092 __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5136 … typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first;
5141 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5188 difference_type __len = __last - __first;
5189 switch (__len)
5205 if (__len <= __limit)
5210 // __len > __limit >= 3
5211 _RandomAccessIterator __m = __first + __len/2;