Home
last modified time | relevance | path

Searched refs:__dist (Results 1 – 9 of 9) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Diterator_operations.h146 __difference_type<_InputIter> __dist = 0;
147 for (; __dist < __count && __iter != __sentinel; ++__dist)
149 return __count - __dist;
159 __difference_type<_BiDirIter> __dist = 0;
161 for (; __dist < __count && __iter != __sentinel; ++__dist)
164 for (__count = -__count; __dist < __count && __iter != __sentinel; ++__dist)
166 return __count - __dist;
176 auto __dist = _IterOps::distance(__iter, __sentinel);
178 … __count == 0 || (__dist < 0) == (__count < 0), "__sentinel must precede __iter when __count < 0");
180 __dist = __dist > __count ? __dist : __count;
[all …]
H A Dlower_bound.h70 auto __dist = __step - _IterOps<_AlgPolicy>::__advance_to(__it, __step, __last); in __lower_bound_onesided() local
76 if (__dist == 1) in __lower_bound_onesided()
78 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound_onesided()
89 const auto __dist = _IterOps<_AlgPolicy>::distance(__first, __last); in __lower_bound() local
90 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound()
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Diterator_operations.h177 __difference_type<_InputIter> __dist = 0;
178 for (; __dist < __count && __iter != __sentinel; ++__dist)
180 return __count - __dist;
190 __difference_type<_BiDirIter> __dist = 0;
192 for (; __dist < __count && __iter != __sentinel; ++__dist)
195 for (__count = -__count; __dist < __count && __iter != __sentinel; ++__dist)
197 return __count - __dist;
207 auto __dist = _IterOps::distance(__iter, __sentinel);
209 … __count == 0 || (__dist < 0) == (__count < 0), "__sentinel must precede __iter when __count < 0");
211 __dist = __dist > __count ? __dist : __count;
[all …]
H A Dlower_bound.h69 auto __dist = __step - _IterOps<_AlgPolicy>::__advance_to(__it, __step, __last); in __lower_bound_onesided() local
75 if (__dist == 1) in __lower_bound_onesided()
77 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound_onesided()
88 const auto __dist = _IterOps<_AlgPolicy>::distance(__first, __last); in __lower_bound() local
89 return std::__lower_bound_bisecting<_AlgPolicy>(__first, __value, __dist, __comp, __proj); in __lower_bound()
/freebsd/contrib/llvm-project/libcxx/src/include/ryu/
H A Dd2s_intrinsics.h58 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI inline uint64_t __ryu_shiftright128(const uint64_t __lo, const uint64_t __hi, const uint32_t __dist) { in __ryu_shiftright128() argument
66 _LIBCPP_ASSERT_INTERNAL(__dist < 64, ""); in __ryu_shiftright128()
67 return __shiftright128(__lo, __hi, static_cast<unsigned char>(__dist)); in __ryu_shiftright128()
82 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI inline uint64_t __ryu_shiftright128(const uint64_t __lo, const uint64_t __hi, const uint32_t __dist) {
88 _LIBCPP_ASSERT_INTERNAL(__dist < 64, "");
92 return static_cast<uint64_t>(__temp >> (__dist & 63));
127 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI inline uint64_t __ryu_shiftright128(const uint64_t __lo, const uint64_t __hi, const uint32_t __dist) {
128 // We don't need to handle the case __dist >= 64 here (see above).
129 _LIBCPP_ASSERT_INTERNAL(__dist < 64, "");
131 _LIBCPP_ASSERT_INTERNAL(__dist >
[all...]
/freebsd/contrib/llvm-project/libcxx/include/__ranges/
H A Ddrop_view.h94 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin() local
95 return ranges::begin(__base_) + __dist; in begin()
110 const auto __dist = std::min(ranges::distance(__base_), __count_); in begin() local
111 return ranges::begin(__base_) + __dist; in begin()
257 auto __dist = ranges::distance(__rng);
258 auto __clamped = std::min<_Dist>(__dist, std::forward<_Np>(__n));
259 …ranges::begin(__rng) + __clamped, ranges::end(__rng), std::__to_unsigned_like(__dist - __clamped));
/freebsd/contrib/llvm-project/libcxx/include/__flat_map/
H A Dflat_map.h927 auto __dist = ranges::distance(__zv.begin(), __dup_start); in __sort_and_unique() local
928 __containers_.keys.erase(__containers_.keys.begin() + __dist, __containers_.keys.end()); in __sort_and_unique()
929 __containers_.values.erase(__containers_.values.begin() + __dist, __containers_.values.end()); in __sort_and_unique()
962 auto __dist = ranges::distance(__zv.begin(), __dup_start); in __append_sort_merge_unique() local
963 __containers_.keys.erase(__containers_.keys.begin() + __dist, __containers_.keys.end()); in __append_sort_merge_unique()
964 __containers_.values.erase(__containers_.values.begin() + __dist, __containers_.values.end()); in __append_sort_merge_unique()
1059 auto __dist = __hint - cbegin(); in __try_emplace_hint() local
1060 …return {iterator(__containers_.keys.begin() + __dist, __containers_.values.begin() + __dist), fals… in __try_emplace_hint()
/freebsd/contrib/llvm-project/libcxx/src/ryu/
H A Dd2fixed.cpp109 const uint32_t __dist = static_cast<uint32_t>(__j - 128); // __dist: [0, 52] in __mulShift_mod1e9() local
110 const uint64_t __shiftedhigh = __s1high >> __dist; in __mulShift_mod1e9()
111 const uint64_t __shiftedlow = __ryu_shiftright128(__s1low, __s1high, __dist); in __mulShift_mod1e9()
/freebsd/contrib/llvm-project/libcxx/include/
H A Dspan281 [[maybe_unused]] auto __dist = __last - __first;
282 …_LIBCPP_ASSERT_VALID_INPUT_RANGE(__dist >= 0, "invalid range in span's constructor (iterator, sent…
284 …__dist == _Extent, "invalid range in span's constructor (iterator, sentinel): last - first != exte…