libstdc++-v3/testsuite/25_algorithms/copy/2.cc

   1 // Copyright (C) 2004-2018 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 // 25.2.1 [lib.alg.copy] Copy.
  19
  20 #include <algorithm>
  21 #include <vector>
  22 #include <testsuite_hooks.h>
  23
  24 void
  25 test01()
  26 {
  27   using namespace std;
  28
  29   const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
  30   const int N = sizeof(A) / sizeof(int);
  31   const vector<int> a(A, A + N);
  32
  33   int i1[N];
  34   copy(a.begin(), a.end(), i1);
  35   VERIFY( equal(i1, i1 + N, a.begin()) );
  36
  37   vector<int> v1(N);
  38   copy(a.begin(), a.end(), v1.begin());
  39   VERIFY( equal(v1.begin(), v1.end(), a.begin()) );
  40
  41   short s1[N];
  42   copy(a.begin(), a.end(), s1);
  43   VERIFY( equal(s1, s1 + N, a.begin()) );
  44
  45   int i2[N];
  46   copy_backward(a.begin(), a.end(), i2 + N);
  47   VERIFY( equal(i2, i2 + N, a.begin()) );
  48
  49   vector<int> v2(N);
  50   copy_backward(a.begin(), a.end(), v2.end());
  51   VERIFY( equal(v2.begin(), v2.end(), a.begin()) );
  52
  53   short s2[N];
  54   copy_backward(a.begin(), a.end(), s2 + N);
  55   VERIFY( equal(s2, s2 + N, a.begin()) );
  56 }
  57
  58 int
  59 main()
  60 {
  61   test01();
  62   return 0;
  63 }