Multiple exit loop handling in ivopts. Regression tested on x86-64/linux
[official-gcc.git] / libstdc++-v3 / testsuite / 25_algorithms / copy / 2.cc
blob9a6e3036e2f47c14417e44fdf0d893ae5af69725
1 // Copyright (C) 2004, 2005, 2009 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.
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without Pred the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
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/>.
18 // 25.2.1 [lib.alg.copy] Copy.
20 #include <algorithm>
21 #include <vector>
22 #include <testsuite_hooks.h>
24 void
25 test01()
27 using namespace std;
28 bool test __attribute__((unused)) = true;
30 const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
31 const int N = sizeof(A) / sizeof(int);
32 const vector<int> a(A, A + N);
34 int i1[N];
35 copy(a.begin(), a.end(), i1);
36 VERIFY( equal(i1, i1 + N, a.begin()) );
38 vector<int> v1(N);
39 copy(a.begin(), a.end(), v1.begin());
40 VERIFY( equal(v1.begin(), v1.end(), a.begin()) );
42 short s1[N];
43 copy(a.begin(), a.end(), s1);
44 VERIFY( equal(s1, s1 + N, a.begin()) );
46 int i2[N];
47 copy_backward(a.begin(), a.end(), i2 + N);
48 VERIFY( equal(i2, i2 + N, a.begin()) );
50 vector<int> v2(N);
51 copy_backward(a.begin(), a.end(), v2.end());
52 VERIFY( equal(v2.begin(), v2.end(), a.begin()) );
54 short s2[N];
55 copy_backward(a.begin(), a.end(), s2 + N);
56 VERIFY( equal(s2, s2 + N, a.begin()) );
59 int
60 main()
62 test01();
63 return 0;