Home
last modified time | relevance | path

Searched refs:__mid (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dshift_right.h81 _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 Dequal_range.h46 _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 Dupper_bound.h39 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()
H A Dranges_partition_point.h49 auto __mid = ranges::next(__first, __half_len); in __partition_point_fn_impl()
51 if (std::invoke(__pred, std::invoke(__proj, *__mid))) { in __partition_point_fn_impl()
52 __first = ++__mid; in __partition_point_fn_impl()
46 auto __mid = ranges::next(__first, __half_len); __partition_point_fn_impl() local
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/
H A Dparallel_stable_sort.h
/freebsd/contrib/llvm-project/libcxx/src/ryu/
H A Dd2s.cpp124 const uint64_t __mid = __tmp + __ryu_umul128(__m, __mul[1], &__hi);
125 __hi += __mid < __tmp; // overflow into __hi
128 const uint64_t __mid2 = __mid + __mul[1] + (__lo2 < __lo);
129 const uint64_t __hi2 = __hi + (__mid2 < __mid);
134 const uint64_t __mid3 = __mid - __mul[1] - (__lo3 > __lo);
135 const uint64_t __hi3 = __hi - (__mid3 > __mid);
139 const uint64_t __mid3 = __mid + __mid + (__lo3 < __lo);
140 const uint64_t __hi3 = __hi + __hi + (__mid3 < __mid);
147 return __ryu_shiftright128(__mid, __h
[all...]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dvector1379 _ForwardIterator __mid = std::next(__first, size());
1380 std::copy(__first, __mid, this->__begin_);
1381 __construct_at_end(__mid, __last, __new_size - size());