xref: /llvm-project/libcxx/test/std/ranges/range.adaptors/range.split/iterator/equal.pass.cpp (revision a2b3ab8f7786b9bb6e1b8bbb01b88d4bbe28af69)
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 iterator& 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 Range     = std::ranges::subrange<Iter>;
23*a2b3ab8fSHui   using SplitView = std::ranges::split_view<Range, std::ranges::single_view<int>>;
24*a2b3ab8fSHui   static_assert(std::ranges::common_range<SplitView>);
25*a2b3ab8fSHui 
26*a2b3ab8fSHui   {
27*a2b3ab8fSHui     // simple test
28*a2b3ab8fSHui     {
29*a2b3ab8fSHui       int buffer[] = {0, 1, 2, -1, 4, 5, 6};
30*a2b3ab8fSHui       Range input(Iter{buffer}, Iter{buffer + 7});
31*a2b3ab8fSHui       SplitView sv(input, -1);
32*a2b3ab8fSHui       auto b = sv.begin(), e = sv.end();
33*a2b3ab8fSHui 
34*a2b3ab8fSHui       assert(b == b);
35*a2b3ab8fSHui       assert(!(b != b));
36*a2b3ab8fSHui 
37*a2b3ab8fSHui       assert(e == e);
38*a2b3ab8fSHui       assert(!(e != e));
39*a2b3ab8fSHui 
40*a2b3ab8fSHui       assert(!(b == e));
41*a2b3ab8fSHui       assert(b != e);
42*a2b3ab8fSHui 
43*a2b3ab8fSHui       std::advance(b, 2);
44*a2b3ab8fSHui       assert(b == b);
45*a2b3ab8fSHui       assert(!(b != b));
46*a2b3ab8fSHui 
47*a2b3ab8fSHui       assert(e == e);
48*a2b3ab8fSHui       assert(!(e != e));
49*a2b3ab8fSHui 
50*a2b3ab8fSHui       assert(b == e);
51*a2b3ab8fSHui       assert(!(b != e));
52*a2b3ab8fSHui     }
53*a2b3ab8fSHui 
54*a2b3ab8fSHui     // iterator at trailing empty position should not equal to end
55*a2b3ab8fSHui     {
56*a2b3ab8fSHui       int buffer[] = {0, 1, 2, -1};
57*a2b3ab8fSHui       Range input(Iter{buffer}, Iter{buffer + 4});
58*a2b3ab8fSHui       SplitView sv(input, -1);
59*a2b3ab8fSHui       auto b = sv.begin(), e = sv.end();
60*a2b3ab8fSHui 
61*a2b3ab8fSHui       ++b; // cur points to end but trailing_empty is true
62*a2b3ab8fSHui 
63*a2b3ab8fSHui       assert(b != e);
64*a2b3ab8fSHui       assert(!(b == e));
65*a2b3ab8fSHui 
66*a2b3ab8fSHui       ++b;
67*a2b3ab8fSHui       assert(b == e);
68*a2b3ab8fSHui       assert(!(b != e));
69*a2b3ab8fSHui     }
70*a2b3ab8fSHui 
71*a2b3ab8fSHui     // Default-constructed iterators compare equal.
72*a2b3ab8fSHui     {
73*a2b3ab8fSHui       int buffer[] = {0, 1, 2, -1, 4, 5, 6};
74*a2b3ab8fSHui       Range input(Iter{buffer}, Iter{buffer + 7});
75*a2b3ab8fSHui       std::ranges::split_view sv(buffer, -1);
76*a2b3ab8fSHui       using SplitIter = decltype(sv.begin());
77*a2b3ab8fSHui       SplitIter i1, i2;
78*a2b3ab8fSHui       assert(i1 == i2);
79*a2b3ab8fSHui       assert(!(i1 != i2));
80*a2b3ab8fSHui     }
81*a2b3ab8fSHui   }
82*a2b3ab8fSHui }
83*a2b3ab8fSHui 
test()84*a2b3ab8fSHui constexpr bool test() {
85*a2b3ab8fSHui   testOne<forward_iterator<int*>>();
86*a2b3ab8fSHui   testOne<bidirectional_iterator<int*>>();
87*a2b3ab8fSHui   testOne<random_access_iterator<int*>>();
88*a2b3ab8fSHui   testOne<contiguous_iterator<int*>>();
89*a2b3ab8fSHui   testOne<int*>();
90*a2b3ab8fSHui 
91*a2b3ab8fSHui   return true;
92*a2b3ab8fSHui }
93*a2b3ab8fSHui 
main(int,char **)94*a2b3ab8fSHui int main(int, char**) {
95*a2b3ab8fSHui   test();
96*a2b3ab8fSHui   static_assert(test());
97*a2b3ab8fSHui 
98*a2b3ab8fSHui   return 0;
99*a2b3ab8fSHui }
100