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
|
// Copyright (C) 2015-2018 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-do run { target c++11 } }
#include <algorithm>
#include <iterator>
#include <forward_list>
#include <list>
#include <vector>
#include <testsuite_hooks.h>
template<typename Container>
void
test(Container& c)
{
int size = std::distance(c.begin(), c.end());
for (int i=0; i < size; ++i)
{
auto first = c.begin(), middle = std::next(first, i), last = c.end();
auto r = std::rotate(first, middle, last);
auto expected = std::next(first, std::distance(middle, last));
VERIFY( r == expected );
}
}
void
test01()
{
// test random access iterators
std::vector<int> v{ 0, 1, 2, 3, 4 };
test(v);
v.push_back(5);
test(v);
}
void
test02()
{
// test bidirectional iterators
std::list<int> l{ 0, 1, 2, 3, 4 };
test(l);
l.push_back(5);
test(l);
}
void
test03()
{
// test forward iterators
std::forward_list<int> l{ 0, 1, 2, 3, 4 };
test(l);
l.push_front(5);
test(l);
}
int
main()
{
test01();
test02();
test03();
}
|
