summaryrefslogtreecommitdiff
path: root/libstdc++-v3/testsuite/25_algorithms/rotate/1.cc
blob: 745fc9d3dfd0e7110a8e76bff12bfc3c9f8db652 (plain)
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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
// Copyright (C) 2005-2019 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/>.

// 25.2.10 rotate

#include <algorithm>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>

using __gnu_test::test_container;
using __gnu_test::forward_iterator_wrapper;
using __gnu_test::bidirectional_iterator_wrapper;
using __gnu_test::random_access_iterator_wrapper;

typedef test_container<int, forward_iterator_wrapper> Fcontainer; 
typedef test_container<int, bidirectional_iterator_wrapper> Bcontainer; 
typedef test_container<int, random_access_iterator_wrapper> Rcontainer; 



void
test1()
{
  int array[]={1};
  Fcontainer fcon(array, array);
  Bcontainer bcon(array, array);
  Rcontainer rcon(array, array);
  std::rotate(fcon.begin(), fcon.begin(), fcon.end());
  std::rotate(bcon.begin(), bcon.begin(), bcon.end());
  std::rotate(rcon.begin(), rcon.begin(), rcon.end());
}

void
test2()
{
  int array[] = {1};
  Fcontainer fcon(array, array + 1);
  Bcontainer bcon(array, array + 1);
  Rcontainer rcon(array, array + 1);
  std::rotate(fcon.begin(), fcon.begin(), fcon.end());
  std::rotate(bcon.begin(), bcon.begin(), bcon.end());
  std::rotate(rcon.begin(), rcon.begin(), rcon.end());
  std::rotate(fcon.begin(), fcon.end(), fcon.end());
  std::rotate(bcon.begin(), bcon.end(), bcon.end());
  std::rotate(rcon.begin(), rcon.end(), rcon.end());
}

void
test3()
{
  int array[] = {1, 2, 3, 4, 5};
  Fcontainer fcon(array, array + 5);
  Bcontainer bcon(array, array + 5);
  Rcontainer rcon(array, array + 5);
  std::rotate(fcon.begin(), fcon.it(2), fcon.end());
  VERIFY(array[0] == 3 && array[1] == 4 && array[2] == 5 && 
	 array[3] == 1 && array[4] == 2);
  std::rotate(bcon.begin(), bcon.it(2), bcon.end());
  VERIFY(array[0] == 5 && array[1] == 1 && array[2] == 2 && 
	 array[3] == 3 && array[4] == 4);
  std::rotate(rcon.begin(), rcon.it(2), rcon.end());
  VERIFY(array[0] == 2 && array[1] == 3 && array[2] == 4 && 
	 array[3] == 5 && array[4] == 1);
}

void
test4()
{
  int array[] = {1, 2, 3, 4};
  Fcontainer fcon(array, array + 4);
  Bcontainer bcon(array, array + 4);  
  Rcontainer rcon(array, array + 4);

  std::rotate(fcon.begin(), fcon.it(3), fcon.end());
  VERIFY(array[0] == 4 && array[1] == 1 && array[2] == 2 && 
	 array[3] == 3);

  std::rotate(bcon.begin(), bcon.it(3), bcon.end());
  VERIFY(array[0] == 3 && array[1] == 4 && array[2] == 1 && 
	 array[3] == 2);

  std::rotate(rcon.begin(), rcon.it(3), rcon.end());
  VERIFY(array[0] == 2 && array[1] == 3 && array[2] == 4 && 
	 array[3] == 1);
  
}

void
test5()
{
  int array[] = {1, 2, 3, 4};
  Rcontainer con(array, array + 4);
  std::rotate(con.begin(), con.it(2), con.end());
  VERIFY(array[0] == 3 && array[1] == 4 && array[2] == 1 && 
	 array[3] == 2);
}

int 
main()
{
  test1();
  test2();
  test3();
  test4();
  test5();
}