Lines Matching full:distance

22 #include <__iterator/distance.h>
94       const auto __dist = std::min(ranges::distance(__base_), __count_);
110     const auto __dist = std::min(ranges::distance(__base_), __count_);
228           ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::end(__rng))))
231               ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
234         ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)), ranges::end(__rng));
245       _RawRange(ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
247                 std::__to_unsigned_like(ranges::distance(__rng) -
248                                         std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))))
251           ranges::begin(__rng) + std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n)),
253           std::__to_unsigned_like(ranges::distance(__rng) -
254                                   std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))) {
255     // Introducing local variables avoids calculating `min` and `distance` twice (at the cost of diverging from the
257     auto __dist    = ranges::distance(__rng);
270     noexcept(noexcept(views::repeat(*__range.__value_, ranges::distance(__range) - std::min<_Dist>(ranges::distance(__range), std::forward<_Np>(__n)))))
271     -> decltype(      views::repeat(*__range.__value_, ranges::distance(__range) - std::min<_Dist>(ranges::distance(__range), std::forward<_Np>(__n))))
272     { return          views::repeat(*__range.__value_, ranges::distance(__range) - std::min<_Dist>(ranges::distance(__range), std::forward<_Np>(__n))); }