Lines Matching full:ranges
58 namespace ranges {
61 // We cache begin() whenever ranges::next is not guaranteed O(1) to provide an
94 const auto __dist = std::min(ranges::distance(__base_), __count_);
95 return ranges::begin(__base_) + __dist;
101 auto __tmp = ranges::next(ranges::begin(__base_), __count_, ranges::end(__base_));
110 const auto __dist = std::min(ranges::distance(__base_), __count_);
111 return ranges::begin(__base_) + __dist;
117 return ranges::end(__base_);
123 return ranges::end(__base_);
127 const auto __s = ranges::size(__self.__base_);
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)),
232 ranges::end(__rng))) {
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)),
246 ranges::end(__rng),
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)),
252 ranges::end(__rng),
253 std::__to_unsigned_like(ranges::distance(__rng) -
254 std::min<_Dist>(ranges::distance(__rng), std::forward<_Np>(__n))))) {
257 auto __dist = ranges::distance(__rng);
259 return _RawRange(ranges::begin(__rng) + __clamped, ranges::end(__rng), std::__to_unsigned_like(__dist - __clamped));
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))); }
321 } // namespace ranges