include/__algorithm/sort.h

396     _RandomAccessIterator __first, _RandomAccessIterator __last, uint64_t& __left_bitset, uint64_t& __right_bitset) {
401   while (__left_bitset != 0 && __right_bitset != 0) {
402     difference_type __tz_left  = __libcpp_ctz(__left_bitset);
403     __left_bitset              = __libcpp_blsr(__left_bitset);
414 __populate_left_bitset(_RandomAccessIterator __first, _Compare __comp, _ValueType& __pivot, uint64_t& __left_bitset) {
420     __left_bitset |= (static_cast<uint64_t>(__comp_result) << __j);
451     uint64_t& __left_bitset,
457   if (__left_bitset == 0 && __right_bitset == 0) {
460   } else if (__left_bitset == 0) {
469   if (__left_bitset == 0) {
473       __left_bitset |= (static_cast<uint64_t>(__comp_result) << __j);
487   std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
488   __first += (__left_bitset == 0) ? __l_size : 0;
494     _RandomAccessIterator& __first, _RandomAccessIterator& __lm1, uint64_t& __left_bitset, uint64_t& __right_bitset) {
497   if (__left_bitset) {
500     while (__left_bitset != 0) {
501       difference_type __tz_left = __detail::__block_size - 1 - __libcpp_clz(__left_bitset);
502       __left_bitset &= (static_cast<uint64_t>(1) << __tz_left) - 1;
582   uint64_t __left_bitset      = 0;
589     if (__left_bitset == 0)
590       std::__populate_left_bitset<_Compare>(__first, __comp, __pivot, __left_bitset);
597     std::__swap_bitmap_pos<_AlgPolicy, _RandomAccessIterator>(__first, __lm1, __left_bitset, __right_bitset);
600     __first += (__left_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);