Mercurial > hg > CbC > CbC_gcc

comparison libstdc++-v3/testsuite/std/ranges/subrange/lwg3433.cc @ 152:2b5abeee2509

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update gcc11
author anatofuz
date Mon, 25 May 2020 07:50:57 +0900
parents
children
comparison
equal deleted inserted replaced
145:1830386684a0 152:2b5abeee2509
1 // Copyright (C) 2020 Free Software Foundation, Inc.
2 //
3 // This file is part of the GNU ISO C++ Library. This library is free
4 // software; you can redistribute it and/or modify it under the
5 // terms of the GNU General Public License as published by the
6 // Free Software Foundation; either version 3, or (at your option)
7 // any later version.
8
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13
14 // You should have received a copy of the GNU General Public License along
15 // with this library; see the file COPYING3. If not see
16 // <http://www.gnu.org/licenses/>.
17
18 // { dg-options "-std=gnu++2a" }
19 // { dg-do run { target c++2a } }
20
21 #include <algorithm>
22 #include <ranges>
23 #include <testsuite_iterators.h>
24 #include <testsuite_hooks.h>
25
26 using __gnu_test::bidirectional_iterator_wrapper;
27 using __gnu_test::forward_iterator_wrapper;
28 using __gnu_test::test_range;
29 using __gnu_test::test_sized_range;
30 using __gnu_test::test_sized_range_sized_sent;
31
32 namespace ranges = std::ranges;
33
34 template<typename Container>
35 void
36 test01()
37 {
38 int x[] = {1,2,3,4,5};
39 Container r{x};
40 ranges::subrange sr = r;
41 constexpr bool sized_range_p = ranges::sized_range<decltype(sr)>;
42 constexpr bool bidirectional_p = ranges::bidirectional_range<decltype(sr)>;
43 VERIFY( ranges::equal(sr, (int[]){1,2,3,4,5}) );
44 if constexpr (sized_range_p)
45 VERIFY( sr.size() == 5 );
46
47 sr = sr.next();
48 VERIFY( ranges::equal(sr, (int[]){2,3,4,5}) );
49 if constexpr (sized_range_p)
50 VERIFY( sr.size() == 4 );
51
52 sr = std::move(sr).next(2);
53 VERIFY( ranges::equal(sr, (int[]){4,5}) );
54 if constexpr (sized_range_p)
55 VERIFY( sr.size() == 2 );
56
57 if constexpr (bidirectional_p)
58 {
59 sr = sr.prev(2);
60 VERIFY( ranges::equal(sr, (int[]){2,3,4,5}) );
61 if constexpr (sized_range_p)
62 VERIFY( sr.size() == 4 );
63
64 sr = sr.prev();
65 VERIFY( ranges::equal(sr, (int[]){1,2,3,4,5}) );
66 if constexpr (sized_range_p)
67 VERIFY( sr.size() == 5 );
68 }
69 else
70 sr = r;
71
72 sr.advance(1);
73 VERIFY( ranges::equal(sr, (int[]){2,3,4,5}) );
74 if constexpr (sized_range_p)
75 VERIFY( sr.size() == 4 );
76
77 if constexpr (bidirectional_p)
78 {
79 sr.advance(-1);
80 VERIFY( ranges::equal(sr, (int[]){1,2,3,4,5}) );
81 if constexpr (sized_range_p)
82 VERIFY( sr.size() == 5 );
83 }
84 }
85
86 int
87 main()
88 {
89 test01<test_sized_range_sized_sent<int, bidirectional_iterator_wrapper>>();
90 test01<test_sized_range<int, bidirectional_iterator_wrapper>>();
91 test01<test_range<int, bidirectional_iterator_wrapper>>();
92
93 test01<test_sized_range_sized_sent<int, forward_iterator_wrapper>>();
94 test01<test_sized_range<int, forward_iterator_wrapper>>();
95 test01<test_range<int, forward_iterator_wrapper>>();
96 }