Lines Matching refs:__len

1525     _Size __len = static_cast<_Size>(__last - __first);
1526     if (__len < __count)
3228     difference_type __len = _VSTD::distance(__first, __last);
3229     while (__len != 0)
3231         difference_type __l2 = _VSTD::__half_positive(__len);
3237             __len -= __l2 + 1;
3240             __len = __l2;
3250                    _Distance __len, _Pair __p, forward_iterator_tag __fit)
3253     // __len >= 1
3254     if (__len == 1)
3256     if (__len == 2)
3266     if (__len <= __p.second)
3301     // __len >= 3
3303     _Distance __len2 = __len / 2;  // __len2 >= 2
3315     _Distance __len_half = __len - __len2;
3358     difference_type __len = _VSTD::distance(__first, __last);
3361     if (__len >= __alloc_limit)
3363         __p = _VSTD::get_temporary_buffer<value_type>(__len);
3367                              (__first, __last, __pred, __len, __p, forward_iterator_tag());
3373                    _Distance __len, _Pair __p, bidirectional_iterator_tag __bit)
3377     // __len >= 2
3378     if (__len == 2)
3383     if (__len == 3)
3396     if (__len <= __p.second)
3433     // __len >= 4
3435     _Distance __len2 = __len / 2;  // __len2 >= 2
3460     __len_half = __len - __len2;
3505     // __len >= 2
3506     difference_type __len = _VSTD::distance(__first, __last) + 1;
3509     if (__len >= __alloc_limit)
3511         __p = _VSTD::get_temporary_buffer<value_type>(__len);
3515                              (__first, __last, __pred, __len, __p, bidirectional_iterator_tag());
3825         difference_type __len = __last - __first;
3826         switch (__len)
3845         if (__len <= __limit)
3850         // __len > 5
3857         if (__len >= 1000)
3859             __delta = __len/2;
3866             __delta = __len/2;
4096     difference_type __len = _VSTD::distance(__first, __last);
4097     while (__len != 0)
4099         difference_type __l2 = _VSTD::__half_positive(__len);
4105             __len -= __l2 + 1;
4108             __len = __l2;
4138     difference_type __len = _VSTD::distance(__first, __last);
4139     while (__len != 0)
4141         difference_type __l2 = _VSTD::__half_positive(__len);
4145             __len = __l2;
4149             __len -= __l2 + 1;
4180     difference_type __len = _VSTD::distance(__first, __last);
4181     while (__len != 0)
4183         difference_type __l2 = _VSTD::__half_positive(__len);
4189             __len -= __l2 + 1;
4194             __len = __l2;
4418         {   // __len >= 1, __len2 >= 2
4577               typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4583                    typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4587     switch (__len)
4614     if (__len <= 8)
4619     typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4622     __stable_sort<_Compare>(__m, __last1, __comp, __len - __l2, __first2 + __l2, __len - __l2);
4635               typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4640     switch (__len)
4650     if (__len <= static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4655     typename iterator_traits<_RandomAccessIterator>::difference_type __l2 = __len / 2;
4657     if (__len <= __buff_size)
4663         __stable_sort_move<_Compare>(__m, __last, __comp, __len - __l2, __buff + __l2);
4664         __d.__set(__len, (value_type*)0);
4665 …__merge_move_assign<_Compare>(__buff, __buff + __l2, __buff + __l2, __buff + __len, __first, __com…
4669 //                           move_iterator<_RandomAccessIterator>(__buff + __len),
4674     __stable_sort<_Compare>(__m, __last, __comp, __len - __l2, __buff, __buff_size);
4675 …  __inplace_merge<_Compare>(__first, __m, __last, __comp, __l2, __len - __l2, __buff, __buff_size);
4685     difference_type __len = __last - __first;
4688     if (__len > static_cast<difference_type>(__stable_sort_switch<value_type>::value))
4690         __buf = _VSTD::get_temporary_buffer<value_type>(__len);
4696     __stable_sort<_Comp_ref>(__first, __last, __c, __len, __buf.first, __buf.second);
4699     __stable_sort<_Comp_ref>(__first, __last, __comp, __len, __buf.first, __buf.second);
4718     difference_type __len = __last - __first;
4722     while (__c < __len)
4729         if (__c == __len)
4771           typename iterator_traits<_RandomAccessIterator>::difference_type __len)
4774     if (__len > 1)
4776         __len = (__len - 2) / 2;
4777         _RandomAccessIterator __ptr = __first + __len;
4785                 if (__len == 0)
4787                 __len = (__len - 1) / 2;
4788                 __ptr = __first + __len;
4824             typename iterator_traits<_RandomAccessIterator>::difference_type __len,
4833     if (__len < 2 || (__len - 2) / 2 < __child)
4839     if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4857         if ((__len - 2) / 2 < __child)
4864         if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4879            typename iterator_traits<_RandomAccessIterator>::difference_type __len)
4881     if (__len > 1)
4884         __sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
4994     typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first;
5000             __sift_down<_Compare>(__first, __middle, __comp, __len, __first);
5044 …     typename iterator_traits<_RandomAccessIterator>::difference_type __len = __r - __result_first;
5049                 __sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
5096         difference_type __len = __last - __first;
5097         switch (__len)
5113         if (__len <= __limit)
5118         // __len > __limit >= 3
5119         _RandomAccessIterator __m = __first + __len/2;