1*a2c6a119SHui Xie //===----------------------------------------------------------------------===//
2*a2c6a119SHui Xie //
3*a2c6a119SHui Xie // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4*a2c6a119SHui Xie // See https://llvm.org/LICENSE.txt for license information.
5*a2c6a119SHui Xie // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6*a2c6a119SHui Xie //
7*a2c6a119SHui Xie //===----------------------------------------------------------------------===//
8*a2c6a119SHui Xie
9*a2c6a119SHui Xie // UNSUPPORTED: c++03, c++11, c++14, c++17
10*a2c6a119SHui Xie
11*a2c6a119SHui Xie // constexpr auto begin() requires (!simple-view<V>)
12*a2c6a119SHui Xie // { return ranges::begin(base_); }
13*a2c6a119SHui Xie //
14*a2c6a119SHui Xie // constexpr auto begin() const
15*a2c6a119SHui Xie // requires range<const V> &&
16*a2c6a119SHui Xie // indirect_unary_predicate<const Pred, iterator_t<const V>>
17*a2c6a119SHui Xie // { return ranges::begin(base_); }
18*a2c6a119SHui Xie
19*a2c6a119SHui Xie #include <cassert>
20*a2c6a119SHui Xie #include <ranges>
21*a2c6a119SHui Xie #include <type_traits>
22*a2c6a119SHui Xie #include <utility>
23*a2c6a119SHui Xie
24*a2c6a119SHui Xie #include "types.h"
25*a2c6a119SHui Xie
26*a2c6a119SHui Xie // Test Constraints
27*a2c6a119SHui Xie template <class T>
28*a2c6a119SHui Xie concept HasConstBegin = requires(const T& ct) { ct.begin(); };
29*a2c6a119SHui Xie
30*a2c6a119SHui Xie template <class T>
31*a2c6a119SHui Xie concept HasBegin = requires(T& t) { t.begin(); };
32*a2c6a119SHui Xie
33*a2c6a119SHui Xie template <class T>
34*a2c6a119SHui Xie concept HasConstAndNonConstBegin =
35*a2c6a119SHui Xie HasConstBegin<T> &&
36*a2c6a119SHui Xie requires(T& t, const T& ct) { requires !std::same_as<decltype(t.begin()), decltype(ct.begin())>; };
37*a2c6a119SHui Xie
38*a2c6a119SHui Xie template <class T>
39*a2c6a119SHui Xie concept HasOnlyNonConstBegin = HasBegin<T> && !HasConstBegin<T>;
40*a2c6a119SHui Xie
41*a2c6a119SHui Xie template <class T>
42*a2c6a119SHui Xie concept HasOnlyConstBegin = HasConstBegin<T> && !HasConstAndNonConstBegin<T>;
43*a2c6a119SHui Xie
44*a2c6a119SHui Xie struct Pred {
operator ()Pred45*a2c6a119SHui Xie constexpr bool operator()(int i) const { return i > 5; }
46*a2c6a119SHui Xie };
47*a2c6a119SHui Xie
48*a2c6a119SHui Xie static_assert(HasOnlyConstBegin<std::ranges::take_while_view<SimpleView, Pred>>);
49*a2c6a119SHui Xie
50*a2c6a119SHui Xie static_assert(HasOnlyNonConstBegin<std::ranges::take_while_view<ConstNotRange, Pred>>);
51*a2c6a119SHui Xie
52*a2c6a119SHui Xie static_assert(HasConstAndNonConstBegin<std::ranges::take_while_view<NonSimple, Pred>>);
53*a2c6a119SHui Xie
54*a2c6a119SHui Xie struct NotPredForConst {
operator ()NotPredForConst55*a2c6a119SHui Xie constexpr bool operator()(int& i) const { return i > 5; }
56*a2c6a119SHui Xie };
57*a2c6a119SHui Xie static_assert(HasOnlyNonConstBegin<std::ranges::take_while_view<NonSimple, NotPredForConst>>);
58*a2c6a119SHui Xie
test()59*a2c6a119SHui Xie constexpr bool test() {
60*a2c6a119SHui Xie // simple-view
61*a2c6a119SHui Xie {
62*a2c6a119SHui Xie int buffer[] = {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1};
63*a2c6a119SHui Xie SimpleView v{buffer};
64*a2c6a119SHui Xie std::ranges::take_while_view twv(v, Pred{});
65*a2c6a119SHui Xie std::same_as<int*> decltype(auto) it1 = twv.begin();
66*a2c6a119SHui Xie assert(it1 == buffer);
67*a2c6a119SHui Xie std::same_as<int*> decltype(auto) it2 = std::as_const(twv).begin();
68*a2c6a119SHui Xie assert(it2 == buffer);
69*a2c6a119SHui Xie }
70*a2c6a119SHui Xie
71*a2c6a119SHui Xie // const not range
72*a2c6a119SHui Xie {
73*a2c6a119SHui Xie int buffer[] = {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1};
74*a2c6a119SHui Xie ConstNotRange v{buffer};
75*a2c6a119SHui Xie std::ranges::take_while_view twv(v, Pred{});
76*a2c6a119SHui Xie std::same_as<int*> decltype(auto) it1 = twv.begin();
77*a2c6a119SHui Xie assert(it1 == buffer);
78*a2c6a119SHui Xie }
79*a2c6a119SHui Xie
80*a2c6a119SHui Xie // NonSimple
81*a2c6a119SHui Xie {
82*a2c6a119SHui Xie int buffer[] = {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1};
83*a2c6a119SHui Xie NonSimple v{buffer};
84*a2c6a119SHui Xie std::ranges::take_while_view twv(v, Pred{});
85*a2c6a119SHui Xie std::same_as<int*> decltype(auto) it1 = twv.begin();
86*a2c6a119SHui Xie assert(it1 == buffer);
87*a2c6a119SHui Xie std::same_as<const int*> decltype(auto) it2 = std::as_const(twv).begin();
88*a2c6a119SHui Xie assert(it2 == buffer);
89*a2c6a119SHui Xie }
90*a2c6a119SHui Xie
91*a2c6a119SHui Xie // NotPredForConst
92*a2c6a119SHui Xie // LWG 3450: The const overloads of `take_while_view::begin/end` are underconstrained
93*a2c6a119SHui Xie {
94*a2c6a119SHui Xie int buffer[] = {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1};
95*a2c6a119SHui Xie NonSimple v{buffer};
96*a2c6a119SHui Xie std::ranges::take_while_view twv(v, NotPredForConst{});
97*a2c6a119SHui Xie std::same_as<int*> decltype(auto) it1 = twv.begin();
98*a2c6a119SHui Xie assert(it1 == buffer);
99*a2c6a119SHui Xie }
100*a2c6a119SHui Xie
101*a2c6a119SHui Xie return true;
102*a2c6a119SHui Xie }
103*a2c6a119SHui Xie
main(int,char **)104*a2c6a119SHui Xie int main(int, char**) {
105*a2c6a119SHui Xie test();
106*a2c6a119SHui Xie static_assert(test());
107*a2c6a119SHui Xie return 0;
108*a2c6a119SHui Xie }
109