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 template <range R> 53 using range_common_reference_t = iter_common_reference_t<iterator_t<R>>; 54 55 // [range.sized], sized ranges 56 template<class> 57 inline constexpr bool disable_sized_range = false; 58 59 template<class T> 60 concept sized_range = ...; 61 62 // [range.view], views 63 template<class T> 64 inline constexpr bool enable_view = ...; 65 66 struct view_base { }; 67 68 template<class T> 69 concept view = ...; 70 71 // [range.refinements], other range refinements 72 template<class R, class T> 73 concept output_range = see below; 74 75 template<class T> 76 concept input_range = see below; 77 78 template<class T> 79 concept forward_range = see below; 80 81 template<class T> 82 concept bidirectional_range = see below; 83 84 template<class T> 85 concept random_access_range = see below; 86 87 template<class T> 88 concept contiguous_range = see below; 89 90 template <class _Tp> 91 concept common_range = see below; 92 93 template<class T> 94 concept viewable_range = see below; 95 96 // [view.interface], class template view_interface 97 template<class D> 98 requires is_class_v<D> && same_as<D, remove_cv_t<D>> 99 class view_interface; 100 101 // [range.subrange], sub-ranges 102 enum class subrange_kind : bool { unsized, sized }; 103 104 template<input_or_output_iterator I, sentinel_for<I> S = I, subrange_kind K = see below> 105 requires (K == subrange_kind::sized || !sized_sentinel_for<S, I>) 106 class subrange; 107 108 template<class I, class S, subrange_kind K> 109 inline constexpr bool enable_borrowed_range<subrange<I, S, K>> = true; 110 111 // [range.dangling], dangling iterator handling 112 struct dangling; 113 114 template<range R> 115 using borrowed_iterator_t = see below; 116 117 template<range R> 118 using borrowed_subrange_t = see below; 119 120 // [range.elements], elements view 121 template<input_range V, size_t N> 122 requires see below 123 class elements_view; 124 125 template<class T, size_t N> 126 inline constexpr bool enable_borrowed_range<elements_view<T, N>> = 127 enable_borrowed_range<T>; 128 129 template<class R> 130 using keys_view = elements_view<R, 0>; 131 template<class R> 132 using values_view = elements_view<R, 1>; 133 134 namespace views { 135 template<size_t N> 136 inline constexpr unspecified elements = unspecified; 137 inline constexpr auto keys = elements<0>; 138 inline constexpr auto values = elements<1>; 139 } 140 141 // [range.empty], empty view 142 template<class T> 143 requires is_object_v<T> 144 class empty_view; 145 146 template<class T> 147 inline constexpr bool enable_borrowed_range<empty_view<T>> = true; 148 149 namespace views { 150 template<class T> 151 inline constexpr empty_view<T> empty{}; 152 } 153 154 // [range.all], all view 155 namespace views { 156 inline constexpr unspecified all = unspecified; 157 158 template<viewable_range R> 159 using all_t = decltype(all(declval<R>())); 160 } 161 162 template<range R> 163 requires is_object_v<R> 164 class ref_view; 165 166 template<class T> 167 inline constexpr bool enable_borrowed_range<ref_view<T>> = true; 168 169 template<range R> 170 requires see below 171 class owning_view; 172 173 template<class T> 174 inline constexpr bool enable_borrowed_range<owning_view<T>> = enable_borrowed_range<T>; 175 176 // [range.filter], filter view 177 template<input_range V, indirect_unary_predicate<iterator_t<V>> Pred> 178 requires view<V> && is_object_v<Pred> 179 class filter_view; 180 181 namespace views { 182 inline constexpr unspecified filter = unspecified; 183 } 184 185 // [range.drop], drop view 186 template<view V> 187 class drop_view; 188 189 template<class T> 190 inline constexpr bool enable_borrowed_range<drop_view<T>> = enable_borrowed_range<T>; 191 192 // [range.drop.while], drop while view 193 template<view V, class Pred> 194 requires input_range<V> && is_object_v<Pred> && 195 indirect_unary_predicate<const Pred, iterator_t<V>> 196 class drop_while_view; 197 198 template<class T, class Pred> 199 inline constexpr bool enable_borrowed_range<drop_while_view<T, Pred>> = 200 enable_borrowed_range<T>; 201 202 namespace views { inline constexpr unspecified drop_while = unspecified; } 203 204 // [range.transform], transform view 205 template<input_range V, copy_constructible F> 206 requires view<V> && is_object_v<F> && 207 regular_invocable<F&, range_reference_t<V>> && 208 can-reference<invoke_result_t<F&, range_reference_t<V>>> 209 class transform_view; 210 211 // [range.counted], counted view 212 namespace views { inline constexpr unspecified counted = unspecified; } 213 214 // [range.common], common view 215 template<view V> 216 requires (!common_range<V> && copyable<iterator_t<V>>) 217 class common_view; 218 219 // [range.reverse], reverse view 220 template<view V> 221 requires bidirectional_range<V> 222 class reverse_view; 223 224 template<class T> 225 inline constexpr bool enable_borrowed_range<reverse_view<T>> = enable_borrowed_range<T>; 226 227 template<class T> 228 inline constexpr bool enable_borrowed_range<common_view<T>> = enable_borrowed_range<T>; 229 230 // [range.take], take view 231 template<view> class take_view; 232 233 template<class T> 234 inline constexpr bool enable_borrowed_range<take_view<T>> = enable_borrowed_range<T>; 235 236 // [range.take.while], take while view 237 template<view V, class Pred> 238 requires input_range<V> && is_object_v<Pred> && 239 indirect_unary_predicate<const Pred, iterator_t<V>> 240 class take_while_view; 241 242 namespace views { inline constexpr unspecified take_while = unspecified; } 243 244 template<copy_constructible T> 245 requires is_object_v<T> 246 class single_view; 247 248 template<weakly_incrementable W, semiregular Bound = unreachable_sentinel_t> 249 requires weakly-equality-comparable-with<W, Bound> && copyable<W> 250 class iota_view; 251 252 template<class W, class Bound> 253 inline constexpr bool enable_borrowed_range<iota_view<W, Bound>> = true; 254 255 // [range.join], join view 256 template<input_range V> 257 requires view<V> && input_range<range_reference_t<V>> 258 class join_view; 259 260 // [range.lazy.split], lazy split view 261 template<class R> 262 concept tiny-range = see below; // exposition only 263 264 template<input_range V, forward_range Pattern> 265 requires view<V> && view<Pattern> && 266 indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> && 267 (forward_range<V> || tiny-range<Pattern>) 268 class lazy_split_view; 269 270 // [range.split], split view 271 template<forward_range V, forward_range Pattern> 272 requires view<V> && view<Pattern> && 273 indirectly_comparable<iterator_t<V>, iterator_t<Pattern>, ranges::equal_to> 274 class split_view; 275 276 namespace views { 277 inline constexpr unspecified lazy_split = unspecified; 278 inline constexpr unspecified split = unspecified; 279 } 280 281 // [range.istream], istream view 282 template<movable Val, class CharT, class Traits = char_traits<CharT>> 283 requires see below 284 class basic_istream_view; 285 286 template<class Val> 287 using istream_view = basic_istream_view<Val, char>; 288 289 template<class Val> 290 using wistream_view = basic_istream_view<Val, wchar_t>; 291 292 namespace views { template<class T> inline constexpr unspecified istream = unspecified; } 293 294 // [range.zip], zip view 295 template<input_range... Views> 296 requires (view<Views> && ...) && (sizeof...(Views) > 0) 297 class zip_view; // C++2b 298 299 template<class... Views> 300 inline constexpr bool enable_borrowed_range<zip_view<Views...>> = // C++2b 301 (enable_borrowed_range<Views> && ...); 302 303 namespace views { inline constexpr unspecified zip = unspecified; } // C++2b 304 305 // [range.as.rvalue] 306 template <view V> 307 requires input_range<V> 308 class as_rvalue_view; // since C++23 309 310 namespace views { inline constexpr unspecified as_rvalue ) unspecified; } // since C++23 311} 312 313namespace std { 314 namespace views = ranges::views; 315 316 template<class T> struct tuple_size; 317 template<size_t I, class T> struct tuple_element; 318 319 template<class I, class S, ranges::subrange_kind K> 320 struct tuple_size<ranges::subrange<I, S, K>> 321 : integral_constant<size_t, 2> {}; 322 323 template<class I, class S, ranges::subrange_kind K> 324 struct tuple_element<0, ranges::subrange<I, S, K>> { 325 using type = I; 326 }; 327 328 template<class I, class S, ranges::subrange_kind K> 329 struct tuple_element<1, ranges::subrange<I, S, K>> { 330 using type = S; 331 }; 332 333 template<class I, class S, ranges::subrange_kind K> 334 struct tuple_element<0, const ranges::subrange<I, S, K>> { 335 using type = I; 336 }; 337 338 template<class I, class S, ranges::subrange_kind K> 339 struct tuple_element<1, const ranges::subrange<I, S, K>> { 340 using type = S; 341 }; 342} 343*/ 344 345#include <__assert> // all public C++ headers provide the assertion handler 346#include <__config> 347#include <__ranges/access.h> 348#include <__ranges/all.h> 349#include <__ranges/as_rvalue_view.h> 350#include <__ranges/common_view.h> 351#include <__ranges/concepts.h> 352#include <__ranges/counted.h> 353#include <__ranges/dangling.h> 354#include <__ranges/data.h> 355#include <__ranges/drop_view.h> 356#include <__ranges/drop_while_view.h> 357#include <__ranges/elements_view.h> 358#include <__ranges/empty.h> 359#include <__ranges/empty_view.h> 360#include <__ranges/enable_borrowed_range.h> 361#include <__ranges/enable_view.h> 362#include <__ranges/filter_view.h> 363#include <__ranges/iota_view.h> 364#include <__ranges/join_view.h> 365#include <__ranges/lazy_split_view.h> 366#include <__ranges/rbegin.h> 367#include <__ranges/ref_view.h> 368#include <__ranges/rend.h> 369#include <__ranges/reverse_view.h> 370#include <__ranges/single_view.h> 371#include <__ranges/size.h> 372#include <__ranges/split_view.h> 373#include <__ranges/subrange.h> 374#include <__ranges/take_view.h> 375#include <__ranges/take_while_view.h> 376#include <__ranges/transform_view.h> 377#include <__ranges/view_interface.h> 378#include <__ranges/views.h> 379#include <__ranges/zip_view.h> 380#include <version> 381 382#if !defined(_LIBCPP_HAS_NO_LOCALIZATION) 383#include <__ranges/istream_view.h> 384#endif 385 386// standard-mandated includes 387 388// [ranges.syn] 389#include <compare> 390#include <initializer_list> 391#include <iterator> 392 393// [tuple.helper] 394#include <__tuple/tuple_element.h> 395#include <__tuple/tuple_size.h> 396 397#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 398# pragma GCC system_header 399#endif 400 401#if !defined(_LIBCPP_REMOVE_TRANSITIVE_INCLUDES) && _LIBCPP_STD_VER <= 20 402# include <cstdlib> 403# include <type_traits> 404#endif 405 406#endif // _LIBCPP_RANGES 407