]>
Commit | Line | Data |
---|---|---|
f1717362 | 1 | // Copyright (C) 2001-2016 Free Software Foundation, Inc. |
2b3fc9df | 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, | |
c68c6d54 | 10 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
2b3fc9df | 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.3 list modifiers [lib.list.modifiers] | |
19 | ||
20 | #include <testsuite_hooks.h> | |
21 | ||
22 | // range and fill insert/erase + clear | |
23 | // missing: o fill insert disguised as a range insert in all its variants | |
24 | // o exception effects | |
25 | template<typename _Tp> | |
26 | void | |
27 | modifiers1() | |
28 | { | |
29 | bool test __attribute__((unused)) = true; | |
30 | typedef _Tp list_type; | |
31 | typedef typename list_type::iterator iterator; | |
32 | typedef typename list_type::value_type value_type; | |
b44d17e8 | 33 | |
34 | using __gnu_test::copy_constructor; | |
35 | using __gnu_test::destructor; | |
2b3fc9df | 36 | |
37 | list_type list0301; | |
38 | value_type::reset(); | |
39 | ||
40 | // fill insert at beginning of list / empty list | |
41 | list0301.insert(list0301.begin(), 3, value_type(11)); // should be [11 11 11] | |
42 | VERIFY(list0301.size() == 3); | |
b44d17e8 | 43 | VERIFY(copy_constructor::count() == 3); |
2b3fc9df | 44 | |
45 | // save iterators to verify post-insert validity | |
46 | iterator b = list0301.begin(); | |
47 | iterator m = list0301.end(); --m; | |
48 | iterator e = list0301.end(); | |
49 | ||
50 | // fill insert at end of list | |
51 | value_type::reset(); | |
52 | list0301.insert(list0301.end(), 3, value_type(13)); // should be [11 11 11 13 13 13] | |
53 | VERIFY(list0301.size() == 6); | |
b44d17e8 | 54 | VERIFY(copy_constructor::count() == 3); |
2b3fc9df | 55 | VERIFY(b == list0301.begin() && b->id() == 11); |
56 | VERIFY(e == list0301.end()); | |
57 | VERIFY(m->id() == 11); | |
58 | ||
59 | // fill insert in the middle of list | |
60 | ++m; | |
61 | value_type::reset(); | |
62 | list0301.insert(m, 3, value_type(12)); // should be [11 11 11 12 12 12 13 13 13] | |
63 | VERIFY(list0301.size() == 9); | |
b44d17e8 | 64 | VERIFY(copy_constructor::count() == 3); |
2b3fc9df | 65 | VERIFY(b == list0301.begin() && b->id() == 11); |
66 | VERIFY(e == list0301.end()); | |
67 | VERIFY(m->id() == 13); | |
68 | ||
69 | // single erase | |
70 | value_type::reset(); | |
71 | m = list0301.erase(m); // should be [11 11 11 12 12 12 13 13] | |
72 | VERIFY(list0301.size() == 8); | |
b44d17e8 | 73 | VERIFY(destructor::count() == 1); |
2b3fc9df | 74 | VERIFY(b == list0301.begin() && b->id() == 11); |
75 | VERIFY(e == list0301.end()); | |
76 | VERIFY(m->id() == 13); | |
77 | ||
78 | // range erase | |
79 | value_type::reset(); | |
80 | m = list0301.erase(list0301.begin(), m); // should be [13 13] | |
81 | VERIFY(list0301.size() == 2); | |
b44d17e8 | 82 | VERIFY(destructor::count() == 6); |
2b3fc9df | 83 | VERIFY(m->id() == 13); |
84 | ||
85 | // range fill at beginning | |
86 | const int A[] = {321, 322, 333}; | |
87 | const int N = sizeof(A) / sizeof(int); | |
88 | value_type::reset(); | |
89 | b = list0301.begin(); | |
90 | list0301.insert(b, A, A + N); // should be [321 322 333 13 13] | |
91 | VERIFY(list0301.size() == 5); | |
2293c530 | 92 | #if __cplusplus >= 201103L |
93 | VERIFY(copy_constructor::count() == 0); | |
94 | #else | |
b44d17e8 | 95 | VERIFY(copy_constructor::count() == 3); |
2293c530 | 96 | #endif |
2b3fc9df | 97 | VERIFY(m->id() == 13); |
98 | ||
99 | // range fill at end | |
100 | value_type::reset(); | |
101 | list0301.insert(e, A, A + N); // should be [321 322 333 13 13 321 322 333] | |
102 | VERIFY(list0301.size() == 8); | |
2293c530 | 103 | #if __cplusplus >= 201103L |
104 | VERIFY(copy_constructor::count() == 0); | |
105 | #else | |
b44d17e8 | 106 | VERIFY(copy_constructor::count() == 3); |
2293c530 | 107 | #endif |
2b3fc9df | 108 | VERIFY(e == list0301.end()); |
109 | VERIFY(m->id() == 13); | |
110 | ||
111 | // range fill in middle | |
112 | value_type::reset(); | |
113 | list0301.insert(m, A, A + N); | |
114 | VERIFY(list0301.size() == 11); | |
2293c530 | 115 | #if __cplusplus >= 201103L |
116 | VERIFY(copy_constructor::count() == 0); | |
117 | #else | |
b44d17e8 | 118 | VERIFY(copy_constructor::count() == 3); |
2293c530 | 119 | #endif |
2b3fc9df | 120 | VERIFY(e == list0301.end()); |
121 | VERIFY(m->id() == 13); | |
122 | ||
123 | value_type::reset(); | |
124 | list0301.clear(); | |
125 | VERIFY(list0301.size() == 0); | |
b44d17e8 | 126 | VERIFY(destructor::count() == 11); |
2b3fc9df | 127 | VERIFY(e == list0301.end()); |
128 | } |