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

   1 // Copyright (C) 2001, 2004 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 __attribute__((unused)) = true;
  25
  26 // Range constructor
  27 //
  28 // This test verifies the following.
  29 // 23.2.2.1     template list(InputIterator f, InputIterator l, const Allocator& a = Allocator())
  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 test03()
  36 {
  37   const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
  38   const std::size_t N = sizeof(A) / sizeof(int);
  39   std::size_t count;
  40   std::list<int>::const_iterator i;
  41
  42   // construct from a dissimilar range
  43   std::list<int> list0301(A, A + N);
  44   for (i = list0301.begin(), count = 0;
  45        i != list0301.end();
  46        ++i, ++count)
  47     VERIFY(*i == A[count]);
  48   VERIFY(count == N);
  49   VERIFY(list0301.size() == N);
  50
  51   // construct from a similar range
  52   std::list<int> list0302(list0301.begin(), list0301.end());
  53   for (i = list0302.begin(), count = 0;
  54        i != list0302.end();
  55        ++i, ++count)
  56     VERIFY(*i == A[count]);
  57   VERIFY(count == N);
  58   VERIFY(list0302.size() == N);
  59 }
  60
  61 #if !__GXX_WEAK__ && _MT_ALLOCATOR_H
  62 // Explicitly instantiate for systems with no COMDAT or weak support.
  63 template class __gnu_cxx::__mt_alloc<std::_List_node<int> >;
  64 #endif
  65
  66 int main()
  67 {
  68   test03();
  69   return 0;
  70 }
  71