include/__algorithm/sort.h

272   _BidirectionalIterator __lm1 = __last;
273   for (--__lm1; __first != __lm1; ++__first) {
430 __populate_right_bitset(_RandomAccessIterator __lm1, _Compare __comp, _ValueType& __pivot, uint64_t& __right_bitset) {
433   _RandomAccessIterator __iter = __lm1;
448     _RandomAccessIterator& __lm1,
454   difference_type __remaining_len = __lm1 - __first + 1;
480     _RandomAccessIterator __iter = __lm1;
487   std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
489   __lm1 -= (__right_bitset == 0) ? __r_size : 0;
494     _RandomAccessIterator& __first, _RandomAccessIterator& __lm1, uint64_t& __left_bitset, uint64_t& __right_bitset) {
504       if (__it != __lm1) {
505         _Ops::iter_swap(__it, __lm1);
507       --__lm1;
509     __first = __lm1 + difference_type(1);
516       _RandomAccessIterator __it = __lm1 - __tz_right;
581   _RandomAccessIterator __lm1 = __last - difference_type(1);
585   // Reminder: length = __lm1 - __first + 1.
586   while (__lm1 - __first >= 2 * __detail::__block_size - 1) {
594       std::__populate_right_bitset<_Compare>(__lm1, __comp, __pivot, __right_bitset);
597     std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
601     __lm1 -= (__right_bitset == 0) ? difference_type(__detail::__block_size) : difference_type(0);
606       __first, __lm1, __comp, __pivot, __left_bitset, __right_bitset);
609   std::__swap_bitmap_pos_within<_AlgPolicy>(__first, __lm1, __left_bitset, __right_bitset);