old-autovect-branch/libstdc++-v3/testsuite/25_algorithms/copy/3.cc

   1 // Copyright (C) 2004, 2005 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 2, 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 Pred 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 COPYING.  If not, write to the Free
  16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  17 // USA.
  18
  19 // 25.2.1 [lib.alg.copy] Copy.
  20
  21 #include <algorithm>
  22 #include <vector>
  23 #include <deque>
  24 #include <testsuite_hooks.h>
  25
  26 void
  27 test01()
  28 {
  29   using namespace std;
  30   bool test __attribute__((unused)) = true;
  31
  32   const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
  33   const int N = sizeof(A) / sizeof(int);
  34   const deque<int> a(A, A + N);
  35
  36   int i1[N];
  37   copy(a.begin(), a.end(), i1);
  38   VERIFY( equal(i1, i1 + N, a.begin()) );
  39
  40   vector<int> v1(N);
  41   copy(a.begin(), a.end(), v1.begin());
  42   VERIFY( equal(v1.begin(), v1.end(), a.begin()) );
  43
  44   short s1[N];
  45   copy(a.begin(), a.end(), s1);
  46   VERIFY( equal(s1, s1 + N, a.begin()) );
  47
  48   int i2[N];
  49   copy_backward(a.begin(), a.end(), i2 + N);
  50   VERIFY( equal(i2, i2 + N, a.begin()) );
  51
  52   vector<int> v2(N);
  53   copy_backward(a.begin(), a.end(), v2.end());
  54   VERIFY( equal(v2.begin(), v2.end(), a.begin()) );
  55
  56   short s2[N];
  57   copy_backward(a.begin(), a.end(), s2 + N);
  58   VERIFY( equal(s2, s2 + N, a.begin()) );
  59 }
  60
  61 int
  62 main()
  63 {
  64   test01();
  65   return 0;
  66 }