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