| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | shift_right.h | 81 _ForwardIterator __mid = __first; in shift_right()
84 __trail = std::move(__mid, __ret, __trail); in shift_right()
85 std::move(__first, __mid, __trail); in shift_right()
88 swap(*__mid, *__trail); in shift_right()
89 ++__mid; in shift_right()
92 if (__mid == __ret) { in shift_right()
93 __mid = __first; in shift_right()
79 _ForwardIterator __mid = __first; shift_right() local
|
| H A D | equal_range.h | 42 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range() local
43 if (std::__invoke(__comp, std::__invoke(__proj, *__mid), __value)) { in __equal_range()
44 __first = ++__mid; in __equal_range()
46 } else if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) { in __equal_range()
47 __end = __mid; in __equal_range()
50 _Iter __mp1 = __mid; in __equal_range()
51 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
|
| H A D | ranges_partition_point.h | 47 auto __mid = ranges::next(__first, __half_len); in __partition_point_fn_impl() local
49 if (std::invoke(__pred, std::invoke(__proj, *__mid))) { in __partition_point_fn_impl()
50 __first = ++__mid; in __partition_point_fn_impl()
|
| H A D | upper_bound.h | 41 auto __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __upper_bound() local
42 if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) in __upper_bound()
45 __first = ++__mid; in __upper_bound()
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/ |
| H A D | equal_range.h | 46 _Iter __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __equal_range() local
47 if (std::__invoke(__comp, std::__invoke(__proj, *__mid), __value)) { in __equal_range()
48 __first = ++__mid; in __equal_range()
50 } else if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) { in __equal_range()
51 __end = __mid; in __equal_range()
54 _Iter __mp1 = __mid; in __equal_range()
55 … return pair<_Iter, _Iter>(std::__lower_bound<_AlgPolicy>(__first, __mid, __value, __comp, __proj), in __equal_range()
|
| H A D | upper_bound.h | 39 auto __mid = _IterOps<_AlgPolicy>::next(__first, __half_len); in __upper_bound() local
40 if (std::__invoke(__comp, __value, std::__invoke(__proj, *__mid))) in __upper_bound()
43 __first = ++__mid; in __upper_bound()
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/ |
| H A D | parallel_stable_sort.h | |
| /freebsd/contrib/llvm-project/libcxx/src/ryu/ |
| H A D | d2s.cpp | 125 const uint64_t __mid = __tmp + __ryu_umul128(__m, __mul[1], &__hi);
126 __hi += __mid < __tmp; // overflow into __hi
129 const uint64_t __mid2 = __mid + __mul[1] + (__lo2 < __lo);
130 const uint64_t __hi2 = __hi + (__mid2 < __mid);
135 const uint64_t __mid3 = __mid - __mul[1] - (__lo3 > __lo);
136 const uint64_t __hi3 = __hi - (__mid3 > __mid);
140 const uint64_t __mid3 = __mid + __mid + (__lo3 < __lo);
141 const uint64_t __hi3 = __hi + __hi + (__mid3 < __mid);
148 return __ryu_shiftright128(__mid, __hi, static_cast<uint32_t>(__j - 64 - 1));
|
| /freebsd/contrib/llvm-project/libcxx/include/__vector/ |
| H A D | vector.h | 1061 auto __mid = ranges::copy_n(std::move(__first), size(), this->__begin_).in; in __assign_with_size() local
1062 __construct_at_end(std::move(__mid), std::move(__last), __new_size - size()); in __assign_with_size()
1064 _Iterator __mid = std::next(__first, size()); in __assign_with_size()
1065 std::copy(__first, __mid, this->__begin_); in __assign_with_size()
1066 __construct_at_end(__mid, __last, __new_size - size()); in __assign_with_size()
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/ |
| H A D | vector | 1130 _ForwardIterator __mid = std::next(__first, size());
1131 std::copy(__first, __mid, this->__begin_);
1132 __construct_at_end(__mid, __last, __new_size - size());
|