Lines Matching refs:__middle
650 _ForwardIterator __middle;
655 __middle = __first;
656 std::advance(__middle, __half);
657 if (__pred(*__middle))
659 __first = __middle;
1278 _ForwardIterator __middle,
1282 if (__first == __middle || __last == __middle)
1285 _ForwardIterator __first2 = __middle;
1291 if (__first == __middle)
1292 __middle = __first2;
1296 __first2 = __middle;
1303 if (__first == __middle)
1304 __middle = __first2;
1306 __first2 = __middle;
1314 _BidirectionalIterator __middle,
1322 if (__first == __middle || __last == __middle)
1325 std::__reverse(__first, __middle, bidirectional_iterator_tag());
1326 std::__reverse(__middle, __last, bidirectional_iterator_tag());
1328 while (__first != __middle && __middle != __last)
1334 if (__first == __middle)
1335 std::__reverse(__middle, __last, bidirectional_iterator_tag());
1337 std::__reverse(__first, __middle, bidirectional_iterator_tag());
1344 _RandomAccessIterator __middle,
1352 if (__first == __middle || __last == __middle)
1361 _Distance __k = __middle - __first;
1365 std::swap_ranges(__first, __middle, __middle);
1425 * @param __middle A forward iterator.
1430 * @p (__middle - __first) positions so that the element at @p __middle
1431 * is moved to @p __first, the element at @p __middle+1 is moved to
1435 * This effectively swaps the ranges @p [__first,__middle) and
1436 * @p [__middle,__last).
1439 * @p *(__first+(n+(__last-__middle))%(__last-__first))=*(__first+n)
1444 rotate(_ForwardIterator __first, _ForwardIterator __middle,
1450 __glibcxx_requires_valid_range(__first, __middle);
1451 __glibcxx_requires_valid_range(__middle, __last);
1453 std::__rotate(__first, __middle, __last,
1461 * @param __middle A forward iterator.
1468 * @p (__middle-__first) positions so that the element at @p __middle
1469 * is moved to @p __result, the element at @p __middle+1 is moved
1474 * @p *(__result+(n+(__last-__middle))%(__last-__first))=*(__first+n)
1479 rotate_copy(_ForwardIterator __first, _ForwardIterator __middle,
1486 __glibcxx_requires_valid_range(__first, __middle);
1487 __glibcxx_requires_valid_range(__middle, __last);
1489 return std::copy(__first, __middle,
1490 std::copy(__middle, __last, __result));
1558 _ForwardIterator __middle = __first;
1559 std::advance(__middle, __len / 2);
1566 std::__find_if_not_n(__middle, __right_len, __pred);
1568 __right_split = std::__inplace_stable_partition(__middle,
1571 std::rotate(__left_split, __middle, __right_split);
1572 std::advance(__left_split, std::distance(__middle, __right_split));
1617 _ForwardIterator __middle = __first;
1618 std::advance(__middle, __len / 2);
1620 std::__stable_partition_adaptive(__first, __middle, __pred,
1627 std::__find_if_not_n(__middle, __right_len, __pred);
1633 std::rotate(__left_split, __middle, __right_split);
1634 std::advance(__left_split, std::distance(__middle, __right_split));
1704 _RandomAccessIterator __middle,
1707 std::__make_heap(__first, __middle, __comp);
1708 for (_RandomAccessIterator __i = __middle; __i < __last; ++__i)
1710 std::__pop_heap(__first, __middle, __i, __comp);
1962 _RandomAccessIterator __middle,
1966 std::__heap_select(__first, __middle, __last, __comp);
1967 std::__sort_heap(__first, __middle, __comp);
2086 _ForwardIterator __middle = __first;
2087 std::advance(__middle, __half);
2088 if (__comp(__val, __middle))
2092 __first = __middle;
2177 _ForwardIterator __middle = __first;
2178 std::advance(__middle, __half);
2179 if (__comp_it_val(__middle, __val))
2181 __first = __middle;
2185 else if (__comp_val_it(__val, __middle))
2190 = std::__lower_bound(__first, __middle, __val, __comp_it_val);
2193 = std::__upper_bound(++__middle, __first, __val, __comp_val_it);
2424 _BidirectionalIterator1 __middle,
2435 __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2436 _GLIBCXX_MOVE_BACKWARD3(__first, __middle, __last);
2446 __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2447 _GLIBCXX_MOVE3(__middle, __last, __first);
2455 std::rotate(__first, __middle, __last);
2456 std::advance(__first, std::distance(__middle, __last));
2466 _BidirectionalIterator __middle,
2474 _Pointer __buffer_end = _GLIBCXX_MOVE3(__first, __middle, __buffer);
2475 std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last,
2480 _Pointer __buffer_end = _GLIBCXX_MOVE3(__middle, __last, __buffer);
2481 std::__move_merge_adaptive_backward(__first, __middle, __buffer,
2487 _BidirectionalIterator __second_cut = __middle;
2495 = std::__lower_bound(__middle, __last, *__first_cut,
2497 __len22 = std::distance(__middle, __second_cut);
2504 = std::__upper_bound(__first, __middle, *__second_cut,
2509 = std::__rotate_adaptive(__first_cut, __middle, __second_cut,
2526 _BidirectionalIterator __middle,
2535 if (__comp(__middle, __first))
2536 std::iter_swap(__first, __middle);
2540 _BidirectionalIterator __second_cut = __middle;
2548 = std::__lower_bound(__middle, __last, *__first_cut,
2550 __len22 = std::distance(__middle, __second_cut);
2557 = std::__upper_bound(__first, __middle, *__second_cut,
2561 std::rotate(__first_cut, __middle, __second_cut);
2563 std::advance(__new_middle, std::distance(__middle, __second_cut));
2573 _BidirectionalIterator __middle,
2582 if (__first == __middle || __middle == __last)
2585 const _DistanceType __len1 = std::distance(__first, __middle);
2586 const _DistanceType __len2 = std::distance(__middle, __last);
2593 (__first, __middle, __last, __len1, __len2, __comp);
2596 (__first, __middle, __last, __len1, __len2, __buf.begin(),
2604 * @param __middle Another iterator.
2608 * Merges two sorted and consecutive ranges, [__first,__middle) and
2609 * [__middle,__last), and puts the result in [__first,__last). The
2621 _BidirectionalIterator __middle,
2629 __glibcxx_requires_sorted(__first, __middle);
2630 __glibcxx_requires_sorted(__middle, __last);
2632 std::__inplace_merge(__first, __middle, __last,
2640 * @param __middle Another iterator.
2645 * Merges two sorted and consecutive ranges, [__first,__middle) and
2661 _BidirectionalIterator __middle,
2671 __glibcxx_requires_sorted_pred(__first, __middle, __comp);
2672 __glibcxx_requires_sorted_pred(__middle, __last, __comp);
2674 std::__inplace_merge(__first, __middle, __last,
2782 const _RandomAccessIterator __middle = __first + __len;
2785 std::__stable_sort_adaptive(__first, __middle, __buffer,
2787 std::__stable_sort_adaptive(__middle, __last, __buffer,
2792 std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp);
2793 std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp);
2795 std::__merge_adaptive(__first, __middle, __last,
2796 _Distance(__middle - __first),
2797 _Distance(__last - __middle),
2813 _RandomAccessIterator __middle = __first + (__last - __first) / 2;
2814 std::__inplace_stable_sort(__first, __middle, __comp);
2815 std::__inplace_stable_sort(__middle, __last, __comp);
2816 std::__merge_without_buffer(__first, __middle, __last,
2817 __middle - __first,
2818 __last - __middle,
4541 * @param __middle Another iterator.
4545 * Sorts the smallest @p (__middle-__first) elements in the range
4546 * @p [first,last) and moves them to the range @p [__first,__middle). The
4547 * order of the remaining elements in the range @p [__middle,__last) is
4550 * @p [__first,__middle) such that i precedes j and @e k is an iterator in
4551 * the range @p [__middle,__last) then *j<*i and *k<*i are both false.
4556 _RandomAccessIterator __middle,
4564 __glibcxx_requires_valid_range(__first, __middle);
4565 __glibcxx_requires_valid_range(__middle, __last);
4567 std::__partial_sort(__first, __middle, __last,
4576 * @param __middle Another iterator.
4581 * Sorts the smallest @p (__middle-__first) elements in the range
4582 __middle). The
4583 * order of the remaining elements in the range @p [__middle,__last) is
4586 * @p [__first,__middle) such that i precedes j and @e k is an iterator in
4587 * the range @p [__middle,__last) then @p *__comp(j,*i) and @p __comp(*k,*i)
4593 _RandomAccessIterator __middle,
4603 __glibcxx_requires_valid_range(__first, __middle);
4604 __glibcxx_requires_valid_range(__middle, __last);
4606 std::__partial_sort(__first, __middle, __last,
