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
|
// Copyright (C) 2020-2023 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-std=gnu++2a" }
// { dg-do run { target c++2a } }
#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
using __gnu_test::test_container;
using __gnu_test::test_range;
using __gnu_test::forward_iterator_wrapper;
using __gnu_test::bidirectional_iterator_wrapper;
using __gnu_test::random_access_iterator_wrapper;
namespace ranges = std::ranges;
struct X
{
int i;
X (int a) : i(a) { }
friend bool
operator==(const X& lhs, const X& rhs)
{
return lhs.i == rhs.i;
}
};
static_assert(!std::is_trivial_v<X>);
template<template<typename, template<typename> typename> typename container,
template<typename> typename wrapper,
typename T = int>
void
test01()
{
for (int a = 0; a <= 7; a++)
{
T x[] = {1, 2, 3, 4, 5, 6, 7};
container<T, wrapper> rx(x);
auto i = ranges::begin(rx);
std::advance(i, a);
auto res = ranges::rotate(rx, i);
if (a == 0)
VERIFY( ranges::begin(res) == ranges::end(rx) );
else
VERIFY( ranges::begin(res)
== std::next(ranges::begin(rx),
ranges::distance(i, ranges::end(rx))) );
VERIFY( ranges::end(res) == ranges::end(rx) );
for (int k = 0; k < 7; k++)
VERIFY( x[k] == (k+a)%7 + 1 );
}
}
constexpr bool
test02()
{
int x[] = {1, 2, 3, 4};
const int y[] = { 2, 3, 1, 4 };
ranges::rotate(x, x+1, x+3);
return ranges::equal(x, y);
}
int
main()
{
test01<test_container, forward_iterator_wrapper>();
test01<test_range, forward_iterator_wrapper>();
test01<test_container, bidirectional_iterator_wrapper>();
test01<test_range, bidirectional_iterator_wrapper>();
test01<test_container, random_access_iterator_wrapper>();
test01<test_range, random_access_iterator_wrapper>();
test01<test_container, random_access_iterator_wrapper, X>();
test01<test_range, random_access_iterator_wrapper, X>();
static_assert(test02());
}
|
