Home | History | Annotate | Download | only in stl

Lines Matching refs:__middle

43                             _BidirectionalIter __middle,
371 _ForwardIter __middle,
375 if (__first == __middle)
377 if (__last == __middle)
380 _ForwardIter __first2 = __middle;
383 if (__first == __middle)
384 __middle = __first2;
389 __first2 = __middle;
393 if (__first == __middle)
394 __middle = __first2;
396 __first2 = __middle;
404 _BidirectionalIter __middle,
408 if (__first == __middle)
410 if (__last == __middle)
413 _STLP_PRIV __reverse(__first, __middle, bidirectional_iterator_tag());
414 _STLP_PRIV __reverse(__middle, __last, bidirectional_iterator_tag());
416 while (__first != __middle && __middle != __last)
419 if (__first == __middle) {
420 _STLP_PRIV __reverse(__middle, __last, bidirectional_iterator_tag());
424 _STLP_PRIV __reverse(__first, __middle, bidirectional_iterator_tag());
444 _RandomAccessIter __middle,
449 _Distance __k = __middle - __first;
451 _RandomAccessIter __result = __first + (__last - __middle);
457 _STLP_STD::swap_ranges(__first, __middle, __middle);
500 __rotate_aux(_RandomAccessIter __first, _RandomAccessIter __middle, _RandomAccessIter __last,
502 return _STLP_PRIV __rotate_aux(__first, __middle, __last,
508 __rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) {
509 _STLP_DEBUG_CHECK(__check_range(__first, __middle))
510 _STLP_DEBUG_CHECK(__check_range(__middle, __last))
511 return __rotate_aux(__first, __middle, __last,
519 void rotate(_ForwardIter __first, _ForwardIter __middle, _ForwardIter __last) {
520 _STLP_PRIV __rotate(__first, __middle, __last);
758 _ForwardIter __middle = __first;
760 _STLP_STD::advance(__middle, __half_len);
761 return _STLP_PRIV __rotate(_STLP_PRIV __inplace_stable_partition(__first, __middle, __pred, __half_len, __pred_of_first, false),
762 __middle,
763 _STLP_PRIV __inplace_stable_partition(__middle, __last, __pred, __len - __half_len, true, __pred_of_before_last));
795 _ForwardIter __middle = __first;
797 _STLP_STD::advance(__middle, __half_len);
798 return _STLP_PRIV __rotate(_STLP_PRIV __stable_partition_adaptive(__first, __middle, __pred,
801 __middle,
802 _STLP_PRIV __stable_partition_adaptive(__middle, __last, __pred,
1026 _RandomAccessIter __middle = __first + (__last - __first) / 2;
1027 __inplace_stable_sort(__first, __middle, __comp);
1028 __inplace_stable_sort(__middle, __last, __comp);
1029 __merge_without_buffer(__first, __middle, __last,
1030 __middle - __first,
1031 __last - __middle,
1094 _BidirectionalIter1 __middle,
1100 _BidirectionalIter2 __buffer_end = _STLP_STD::copy(__middle, __last, __buffer);
1101 _STLP_STD::copy_backward(__first, __middle, __last);
1105 _BidirectionalIter2 __buffer_end = _STLP_STD::copy(__first, __middle, __buffer);
1106 _STLP_STD::copy(__middle, __last, __first);
1110 return _STLP_PRIV __rotate(__first, __middle, __last);
1116 _BidirectionalIter __middle,
1122 _Pointer __buffer_end = _STLP_STD::copy(__first, __middle, __buffer);
1123 _STLP_STD::merge(__buffer, __buffer_end, __middle, __last, __first, __comp);
1126 _Pointer __buffer_end = _STLP_STD::copy(__middle, __last, __buffer);
1127 _STLP_PRIV __merge_backward(__first, __middle, __buffer, __buffer_end, __last,
1132 _BidirectionalIter __second_cut = __middle;
1138 __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp);
1139 __len22 += _STLP_STD::distance(__middle, __second_cut);
1144 __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp);
1148 __rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11,
1163 _RandomAccessIter __middle = __first + __len;
1165 __stable_sort_adaptive(__first, __middle, __buffer, __buffer_size,
1167 __stable_sort_adaptive(__middle, __last, __buffer, __buffer_size,
1171 __merge_sort_with_buffer(__first, __middle, __buffer, (_Distance*)0,
1173 __merge_sort_with_buffer(__middle, __last, __buffer, (_Distance*)0,
1176 __merge_adaptive(__first, __middle, __last, _Distance(__middle - __first),
1177 _Distance(__last - __middle), __buffer, __buffer_size,
1220 void __partial_sort(_RandomAccessIter __first, _RandomAccessIter __middle,
1222 make_heap(__first, __middle, __comp);
1223 for (_RandomAccessIter __i = __middle; __i < __last; ++__i) {
1226 __pop_heap(__first, __middle, __i, _Tp(*__i), __comp,
1230 sort_heap(__first, __middle, __comp);
1236 void partial_sort(_RandomAccessIter __first,_RandomAccessIter __middle,
1238 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
1239 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
1240 _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter),
1245 void partial_sort(_RandomAccessIter __first,_RandomAccessIter __middle,
1247 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
1248 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
1249 _STLP_PRIV __partial_sort(__first, __middle, __last, _STLP_VALUE_TYPE(__first, _RandomAccessIter), __comp);
1363 _ForwardIter __middle = __first;
1364 _STLP_STD::advance(__middle, __half);
1365 if (__comp2(__val, *__middle)) {
1366 _STLP_VERBOSE_ASSERT(!__comp1(*__middle, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
1370 __first = __middle;
1388 _ForwardIter __middle = __first;
1389 _STLP_STD::advance(__middle, __half);
1390 if (__comp1(*__middle, __val)) {
1391 _STLP_VERBOSE_ASSERT(!__comp2(__val, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
1392 __first = __middle;
1396 else if (__comp2(__val, *__middle)) {
1397 _STLP_VERBOSE_ASSERT(!__comp1(*__middle, __val), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
1401 _ForwardIter __left = _STLP_PRIV __lower_bound(__first, __middle, __val, __comp1, __comp2, __dist);
1409 _ForwardIter __right = _STLP_PRIV __upper_bound(++__middle, __first, __val, __comp1, __comp2, __dist);
1464 _BidirectionalIter __middle,
1471 if (__comp(*__middle, *__first)) {
1472 _STLP_VERBOSE_ASSERT(!__comp(*__first, *__middle), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
1473 iter_swap(__first, __middle);
1478 _BidirectionalIter __second_cut = __middle;
1484 __second_cut = _STLP_STD::lower_bound(__middle, __last, *__first_cut, __comp);
1485 __len22 += _STLP_STD::distance(__middle, __second_cut);
1490 __first_cut = _STLP_STD::upper_bound(__first, __middle, *__second_cut, __comp);
1494 = _STLP_PRIV __rotate(__first_cut, __middle, __second_cut);
1535 _BidirectionalIter __middle,
1538 _Distance __len1 = _STLP_STD::distance(__first, __middle);
1539 _Distance __len2 = _STLP_STD::distance(__middle, __last);
1543 __merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp);
1545 __merge_adaptive(__first, __middle, __last, __len1, __len2,
1554 _BidirectionalIter __middle,
1556 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
1557 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
1558 if (__first == __middle || __middle == __last)
1560 _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,
1567 _BidirectionalIter __middle,
1569 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __middle))
1570 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__middle, __last))
1571 if (__first == __middle || __middle == __last)
1573 _STLP_PRIV __inplace_merge_aux(__first, __middle, __last,