]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/23_containers/list/cons/4.h
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / 23_containers / list / cons / 4.h
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 constructor
23 //
24 // This test verifies the following.
25 // 23.2.2.1 template list(InputIterator f, InputIterator l,
26 // const Allocator& a = Allocator())
27 // 23.2.2 const_iterator begin() const
28 // 23.2.2 const_iterator end() const
29 // 23.2.2 size_type size() const
30 //
31 template<typename _Tp>
32 void
33 cons04()
34 {
35 const int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17};
36 const std::size_t N = sizeof(A) / sizeof(int);
37 std::size_t count;
38
39 typedef _Tp list_type;
40 typedef typename list_type::const_iterator const_iterator;
41 const_iterator i;
42
43 // construct from a dissimilar range
44 list_type list0301(A, A + N);
45 for (i = list0301.begin(), count = 0;
46 i != list0301.end();
47 ++i, ++count)
48 VERIFY(*i == A[count]);
49 VERIFY(count == N);
50 VERIFY(list0301.size() == N);
51
52 // construct from a similar range
53 list_type list0302(list0301.begin(), list0301.end());
54 for (i = list0302.begin(), count = 0;
55 i != list0302.end();
56 ++i, ++count)
57 VERIFY(*i == A[count]);
58 VERIFY(count == N);
59 VERIFY(list0302.size() == N);
60 }