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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
|
//===----------------------------------------------------------------------===//
//
// 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 iterator& operator++();
// constexpr iterator operator++(int);
#include <cassert>
#include <ranges>
#include "test_iterators.h"
template <class Iter>
constexpr void testOne() {
constexpr auto make_subrange = []<std::size_t N>(int(&buffer)[N]) {
return std::ranges::subrange<Iter>{Iter{buffer}, Iter{buffer + N}};
};
// next subrange does not reach the end
{
int buffer[] = {0, 1, 2, -1, 4, 5, -1, 7};
auto input = make_subrange(buffer);
std::ranges::split_view sv(input, -1);
using SplitIter = std::ranges::iterator_t<decltype(sv)>;
// ++it
{
auto it = sv.begin();
decltype(auto) it1 = ++it;
static_assert(std::is_same_v<decltype(it1), SplitIter&>);
assert(&it1 == &it);
assert(base((*it).begin()) == buffer + 4);
assert(base((*it).end()) == buffer + 6);
++it;
assert(base((*it).begin()) == buffer + 7);
assert(base((*it).end()) == buffer + 8);
}
// it++
{
auto it = sv.begin();
auto original = it;
decltype(auto) it1 = it++;
static_assert(std::is_same_v<decltype(it1), SplitIter>);
assert(it1 == original);
assert(base((*it).begin()) == buffer + 4);
assert(base((*it).end()) == buffer + 6);
it++;
assert(base((*it).begin()) == buffer + 7);
assert(base((*it).end()) == buffer + 8);
}
}
// next's begin is the end
{
int buffer[] = {0, 1, 2};
auto input = make_subrange(buffer);
std::ranges::split_view sv(input, -1);
using SplitIter = std::ranges::iterator_t<decltype(sv)>;
// ++it
{
auto it = sv.begin();
decltype(auto) it1 = ++it; // trailing_empty is false
static_assert(std::is_same_v<decltype(it1), SplitIter&>);
assert(&it1 == &it);
assert(it == sv.end());
}
// it++
{
auto it = sv.begin();
auto original = it;
decltype(auto) it1 = it++; // trailing_empty is false
static_assert(std::is_same_v<decltype(it1), SplitIter>);
assert(it1 == original);
assert(it == sv.end());
}
}
// next's end is the end
{
int buffer[] = {0, 1, 2, -1};
auto input = make_subrange(buffer);
std::ranges::split_view sv(input, -1);
using SplitIter = std::ranges::iterator_t<decltype(sv)>;
// ++it
{
auto it = sv.begin();
decltype(auto) it1 = ++it; // trailing_empty is true
static_assert(std::is_same_v<decltype(it1), SplitIter&>);
assert(&it1 == &it);
assert(it != sv.end());
assert(base((*it).begin()) == buffer + 4);
assert(base((*it).begin()) == buffer + 4);
++it;
assert(it == sv.end());
}
// it++
{
auto it = sv.begin();
auto original = it;
decltype(auto) it1 = it++; // trailing_empty is true
static_assert(std::is_same_v<decltype(it1), SplitIter>);
assert(it1 == original);
assert(it != sv.end());
assert(base((*it).begin()) == buffer + 4);
assert(base((*it).begin()) == buffer + 4);
it++;
assert(it == sv.end());
}
}
}
constexpr bool test() {
testOne<forward_iterator<int*>>();
testOne<bidirectional_iterator<int*>>();
testOne<random_access_iterator<int*>>();
testOne<contiguous_iterator<int*>>();
testOne<int*>();
return true;
}
int main(int, char**) {
test();
static_assert(test());
return 0;
}
|
