1// -*- C++ -*- 2//===----------------------------------------------------------------------===// 3// 4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 5// See https://llvm.org/LICENSE.txt for license information. 6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7// 8//===----------------------------------------------------------------------===// 9 10#ifndef _LIBCPP_RANGES 11#define _LIBCPP_RANGES 12 13/* 14 15#include <compare> // see [compare.syn] 16#include <initializer_list> // see [initializer.list.syn] 17#include <iterator> // see [iterator.synopsis] 18 19namespace std::ranges { 20 inline namespace unspecified { 21 // [range.access], range access 22 inline constexpr unspecified begin = unspecified; 23 inline constexpr unspecified end = unspecified; 24 inline constexpr unspecified cbegin = unspecified; 25 inline constexpr unspecified cend = unspecified; 26 27 inline constexpr unspecified size = unspecified; 28 inline constexpr unspecified ssize = unspecified; 29 } 30 31 // [range.range], ranges 32 template<class T> 33 concept range = see below; 34 35 template<class T> 36 inline constexpr bool enable_borrowed_range = false; 37 38 template<class T> 39 using iterator_t = decltype(ranges::begin(declval<T&>())); 40 template<range R> 41 using sentinel_t = decltype(ranges::end(declval<R&>())); 42 template<range R> 43 using range_difference_t = iter_difference_t<iterator_t<R>>; 44 template<sized_range R> 45 using range_size_t = decltype(ranges::size(declval<R&>())); 46 template<range R> 47 using range_value_t = iter_value_t<iterator_t<R>>; 48 template<range R> 49 using range_reference_t = iter_reference_t<iterator_t<R>>; 50 template<range R> 51 using range_rvalue_reference_t = iter_rvalue_reference_t<iterator_t<R>>; 52 53 // [range.sized], sized ranges 54 template<class> 55 inline constexpr bool disable_sized_range = false; 56 57 template<class T> 58 concept sized_range = ...; 59 60 // [range.view], views 61 template<class T> 62 inline constexpr bool enable_view = ...; 63 64 struct view_base { }; 65 66 template<class T> 67 concept view = ...; 68 69 // [range.refinements], other range refinements 70 template<class R, class T> 71 concept output_range = see below; 72 73 template<class T> 74 concept input_range = see below; 75 76 template<class T> 77 concept forward_range = see below; 78 79 template<class T> 80 concept bidirectional_range = see below; 81 82 template<class T> 83 concept random_access_range = see below; 84 85 template<class T> 86 concept contiguous_range = see below; 87 88 template <class _Tp> 89 concept common_range = see below; 90 91 template<class T> 92 concept viewable_range = see below; 93 94 // [view.interface], class template view_interface 95 template<class D> 96 requires is_class_v<D> && same_as<D, remove_cv_t<D>> 97 class view_interface; 98 99 // [range.subrange], sub-ranges 100 enum class subrange_kind : bool { unsized, sized }; 101 102 template<input_or_output_iterator I, sentinel_for<I> S = I, subrange_kind K = see below> 103 requires (K == subrange_kind::sized || !sized_sentinel_for<S, I>) 104 class subrange; 105 106 template<class I, class S, subrange_kind K> 107 inline constexpr bool enable_borrowed_range<subrange<I, S, K>> = true; 108 109 // [range.dangling], dangling iterator handling 110 struct dangling; 111 112 template<range R> 113 using borrowed_iterator_t = see below; 114 115 template<range R> 116 using borrowed_subrange_t = see below; 117 118 // [range.empty], empty view 119 template<class T> 120 requires is_object_v<T> 121 class empty_view; 122 123 template<class T> 124 inline constexpr bool enable_borrowed_range<empty_view<T>> = true; 125 126 namespace views { 127 template<class T> 128 inline constexpr empty_view<T> empty{}; 129 } 130 131 // [range.all], all view 132 namespace views { 133 inline constexpr unspecified all = unspecified; 134 135 template<viewable_range R> 136 using all_t = decltype(all(declval<R>())); 137 } 138 139 template<range R> 140 requires is_object_v<R> 141 class ref_view; 142 143 template<class T> 144 inline constexpr bool enable_borrowed_range<ref_view<T>> = true; 145 146 template<range R> 147 requires see below 148 class owning_view; 149 150 template<class T> 151 inline constexpr bool enable_borrowed_range<owning_view<T>> = enable_borrowed_range<T>; 152 153 // [range.drop], drop view 154 template<view V> 155 class drop_view; 156 157 template<class T> 158 inline constexpr bool enable_borrowed_range<drop_view<T>> = enable_borrowed_range<T>; 159 160 // [range.transform], transform view 161 template<input_range V, copy_constructible F> 162 requires view<V> && is_object_v<F> && 163 regular_invocable<F&, range_reference_t<V>> && 164 can-reference<invoke_result_t<F&, range_reference_t<V>>> 165 class transform_view; 166 167 // [range.counted], counted view 168 namespace views { inline constexpr unspecified counted = unspecified; } 169 170 // [range.common], common view 171 template<view V> 172 requires (!common_range<V> && copyable<iterator_t<V>>) 173 class common_view; 174 175 // [range.reverse], reverse view 176 template<view V> 177 requires bidirectional_range<V> 178 class reverse_view; 179 180 template<class T> 181 inline constexpr bool enable_borrowed_range<reverse_view<T>> = enable_borrowed_range<T>; 182 183 template<class T> 184 inline constexpr bool enable_borrowed_range<common_view<T>> = enable_borrowed_range<T>; 185 186 // [range.take], take view 187 template<view> class take_view; 188 189 template<class T> 190 inline constexpr bool enable_borrowed_range<take_view<T>> = enable_borrowed_range<T>; 191 192 template<copy_constructible T> 193 requires is_object_v<T> 194 class single_view; 195 196 template<weakly_incrementable W, semiregular Bound = unreachable_sentinel_t> 197 requires weakly-equality-comparable-with<W, Bound> && copyable<W> 198 class iota_view; 199 200 template<class W, class Bound> 201 inline constexpr bool enable_borrowed_range<iota_view<W, Bound>> = true; 202 203 // [range.join], join view 204 template<input_range V> 205 requires view<V> && input_range<range_reference_t<V>> 206 class join_view; 207 208 // [range.lazy.split], lazy split view 209 template<class R> 210 concept tiny-range = see below; // exposition only 211 212 template<input_range V, forward_range Pattern> 213 requires view<V> && view<Pattern> && 214 indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> && 215 (forward_range<V> || tiny-range<Pattern>) 216 class lazy_split_view; 217 218 namespace views { 219 inline constexpr unspecified lazy_split = unspecified; 220 } 221} 222 223namespace std { 224 namespace views = ranges::views; 225 226 template<class T> struct tuple_size; 227 template<size_t I, class T> struct tuple_element; 228 229 template<class I, class S, ranges::subrange_kind K> 230 struct tuple_size<ranges::subrange<I, S, K>> 231 : integral_constant<size_t, 2> {}; 232 233 template<class I, class S, ranges::subrange_kind K> 234 struct tuple_element<0, ranges::subrange<I, S, K>> { 235 using type = I; 236 }; 237 238 template<class I, class S, ranges::subrange_kind K> 239 struct tuple_element<1, ranges::subrange<I, S, K>> { 240 using type = S; 241 }; 242 243 template<class I, class S, ranges::subrange_kind K> 244 struct tuple_element<0, const ranges::subrange<I, S, K>> { 245 using type = I; 246 }; 247 248 template<class I, class S, ranges::subrange_kind K> 249 struct tuple_element<1, const ranges::subrange<I, S, K>> { 250 using type = S; 251 }; 252} 253*/ 254 255#include <__assert> // all public C++ headers provide the assertion handler 256#include <__config> 257#include <__ranges/access.h> 258#include <__ranges/all.h> 259#include <__ranges/common_view.h> 260#include <__ranges/concepts.h> 261#include <__ranges/counted.h> 262#include <__ranges/dangling.h> 263#include <__ranges/data.h> 264#include <__ranges/drop_view.h> 265#include <__ranges/empty.h> 266#include <__ranges/empty_view.h> 267#include <__ranges/enable_borrowed_range.h> 268#include <__ranges/enable_view.h> 269#include <__ranges/iota_view.h> 270#include <__ranges/join_view.h> 271#include <__ranges/lazy_split_view.h> 272#include <__ranges/rbegin.h> 273#include <__ranges/ref_view.h> 274#include <__ranges/rend.h> 275#include <__ranges/reverse_view.h> 276#include <__ranges/single_view.h> 277#include <__ranges/size.h> 278#include <__ranges/subrange.h> 279#include <__ranges/take_view.h> 280#include <__ranges/transform_view.h> 281#include <__ranges/view_interface.h> 282#include <__ranges/views.h> 283#include <__tuple> // TODO: <ranges> has to export std::tuple_size. Replace this, once <tuple> is granularized. 284#include <compare> // Required by the standard. 285#include <initializer_list> // Required by the standard. 286#include <iterator> // Required by the standard. 287#include <type_traits> 288#include <version> 289 290#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 291# pragma GCC system_header 292#endif 293 294#endif // _LIBCPP_RANGES 295