1  // Copyright (C) 2001-2023 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  // 23.2.2.1 list constructors, copy, and assignment
      19  
      20  #include <testsuite_hooks.h>
      21  
      22  // Range assign
      23  //
      24  // This test verifies the following.
      25  // 23.2.2.1     void assign(InputIterator f, InputIterator l)
      26  // 23.2.2       const_iterator begin() const
      27  // 23.2.2       const_iterator end() const
      28  // 23.2.2       size_type size() const
      29  //
      30  template<typename _Tp>
      31  void
      32  cons06()
      33  {
      34    const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
      35    const int B[] = {101, 102, 103, 104, 105};
      36    const std::size_t N = sizeof(A) / sizeof(int);
      37    const std::size_t M = sizeof(B) / sizeof(int);
      38    std::size_t count;
      39  
      40    typedef _Tp list_type;
      41    typedef typename list_type::const_iterator const_iterator;
      42    const_iterator i;
      43  
      44    list_type 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  }