libstdc++-v3/testsuite/23_containers/list/cons/6.cc

   1 // Copyright (C) 2001 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 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 COPYING.  If not, write to the Free
  16 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
  17 // USA.
  18
  19 // 23.2.2.1 list constructors, copy, and assignment
  20
  21 #include <list>
  22 #include <testsuite_hooks.h>
  23
  24 bool test = true;
  25
  26 // Range assign
  27 //
  28 // This test verifies the following.
  29 // 23.2.2.1     void assign(InputIterator f, InputIterator l)
  30 // 23.2.2       const_iterator begin() const
  31 // 23.2.2       const_iterator end() const
  32 // 23.2.2       size_type size() const
  33 //
  34 void
  35 test05()
  36 {
  37   const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
  38   const int B[] = {101, 102, 103, 104, 105};
  39   const int N = sizeof(A) / sizeof(int);
  40   const int M = sizeof(B) / sizeof(int);
  41   int count;
  42   std::list<int>::const_iterator i;
  43
  44   std::list<int> list0501;
  45
  46   // make it bigger
  47   list0501.assign(A, A + N);
  48   for (i = list0501.begin(), count = 0;
  49        i != list0501.end();
  50        ++i, ++count)
  51     VERIFY(*i == A[count]);
  52   VERIFY(count == N);
  53   VERIFY(list0501.size() == N);
  54
  55   // make it smaller
  56   list0501.assign(B, B + M);
  57   for (i = list0501.begin(), count = 0;
  58        i != list0501.end();
  59        ++i, ++count)
  60     VERIFY(*i == B[count]);
  61   VERIFY(count == M);
  62   VERIFY(list0501.size() == M);
  63 }
  64
  65 int main()
  66 {
  67   test05();
  68   return 0;
  69 }
  70 // vi:set sw=2 ts=2: