1*a2b3ab8fSHui //===----------------------------------------------------------------------===//
2*a2b3ab8fSHui //
3*a2b3ab8fSHui // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4*a2b3ab8fSHui // See https://llvm.org/LICENSE.txt for license information.
5*a2b3ab8fSHui // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6*a2b3ab8fSHui //
7*a2b3ab8fSHui //===----------------------------------------------------------------------===//
8*a2b3ab8fSHui
9*a2b3ab8fSHui // UNSUPPORTED: c++03, c++11, c++14, c++17
10*a2b3ab8fSHui
11*a2b3ab8fSHui // friend constexpr bool operator==(const iterator& x, const sentinel& y);
12*a2b3ab8fSHui
13*a2b3ab8fSHui #include <algorithm>
14*a2b3ab8fSHui #include <cassert>
15*a2b3ab8fSHui #include <concepts>
16*a2b3ab8fSHui #include <ranges>
17*a2b3ab8fSHui
18*a2b3ab8fSHui #include "test_iterators.h"
19*a2b3ab8fSHui
20*a2b3ab8fSHui template <class Iter>
testOne()21*a2b3ab8fSHui constexpr void testOne() {
22*a2b3ab8fSHui using Sent = sentinel_wrapper<Iter>;
23*a2b3ab8fSHui using Range = std::ranges::subrange<Iter, Sent>;
24*a2b3ab8fSHui using SplitView = std::ranges::split_view<Range, std::ranges::single_view<int>>;
25*a2b3ab8fSHui static_assert(!std::ranges::common_range<SplitView>);
26*a2b3ab8fSHui
27*a2b3ab8fSHui {
28*a2b3ab8fSHui // simple test
29*a2b3ab8fSHui {
30*a2b3ab8fSHui int buffer[] = {0, 1, 2, -1, 4, 5, 6};
31*a2b3ab8fSHui Range input(Iter{buffer}, Sent{Iter{buffer + 7}});
32*a2b3ab8fSHui SplitView sv(input, -1);
33*a2b3ab8fSHui auto b = sv.begin();
34*a2b3ab8fSHui auto e = sv.end();
35*a2b3ab8fSHui
36*a2b3ab8fSHui assert(!(b == e));
37*a2b3ab8fSHui assert(b != e);
38*a2b3ab8fSHui
39*a2b3ab8fSHui std::advance(b, 2);
40*a2b3ab8fSHui assert(b == e);
41*a2b3ab8fSHui assert(!(b != e));
42*a2b3ab8fSHui }
43*a2b3ab8fSHui
44*a2b3ab8fSHui // iterator at trailing empty position should not equal to end
45*a2b3ab8fSHui {
46*a2b3ab8fSHui int buffer[] = {0, 1, 2, -1};
47*a2b3ab8fSHui Range input(Iter{buffer}, Sent{Iter{buffer + 4}});
48*a2b3ab8fSHui SplitView sv(input, -1);
49*a2b3ab8fSHui auto b = sv.begin();
50*a2b3ab8fSHui auto e = sv.end();
51*a2b3ab8fSHui
52*a2b3ab8fSHui ++b; // cur points to end but trailing_empty is true
53*a2b3ab8fSHui
54*a2b3ab8fSHui assert(b != e);
55*a2b3ab8fSHui assert(!(b == e));
56*a2b3ab8fSHui
57*a2b3ab8fSHui ++b;
58*a2b3ab8fSHui assert(b == e);
59*a2b3ab8fSHui assert(!(b != e));
60*a2b3ab8fSHui }
61*a2b3ab8fSHui }
62*a2b3ab8fSHui }
63*a2b3ab8fSHui
test()64*a2b3ab8fSHui constexpr bool test() {
65*a2b3ab8fSHui testOne<forward_iterator<int*>>();
66*a2b3ab8fSHui testOne<bidirectional_iterator<int*>>();
67*a2b3ab8fSHui testOne<random_access_iterator<int*>>();
68*a2b3ab8fSHui testOne<contiguous_iterator<int*>>();
69*a2b3ab8fSHui testOne<int*>();
70*a2b3ab8fSHui
71*a2b3ab8fSHui return true;
72*a2b3ab8fSHui }
73*a2b3ab8fSHui
main(int,char **)74*a2b3ab8fSHui int main(int, char**) {
75*a2b3ab8fSHui test();
76*a2b3ab8fSHui static_assert(test());
77*a2b3ab8fSHui
78*a2b3ab8fSHui return 0;
79*a2b3ab8fSHui }
80