]>
Commit | Line | Data |
---|---|---|
cf1e0371 PC |
1 | // 2006-01-07 Paolo Carlini <pcarlini@suse.de> |
2 | ||
83ffe9cd | 3 | // Copyright (C) 2006-2023 Free Software Foundation, Inc. |
cf1e0371 PC |
4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free | |
6 | // software; you can redistribute it and/or modify it under the | |
7 | // terms of the GNU General Public License as published by the | |
748086b7 | 8 | // Free Software Foundation; either version 3, or (at your option) |
cf1e0371 PC |
9 | // any later version. |
10 | ||
11 | // This library is distributed in the hope that it will be useful, | |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | // GNU General Public License for more details. | |
15 | ||
16 | // You should have received a copy of the GNU General Public License along | |
748086b7 JJ |
17 | // with this library; see the file COPYING3. If not see |
18 | // <http://www.gnu.org/licenses/>. | |
cf1e0371 PC |
19 | |
20 | // 23.3.4 Class template multiset | |
21 | ||
22 | #include <set> | |
23 | #include <testsuite_hooks.h> | |
24 | ||
25 | // libstdc++/22102 | |
26 | void test01() | |
27 | { | |
cf1e0371 PC |
28 | typedef std::multiset<int> Mset; |
29 | typedef Mset::value_type value_type; | |
30 | typedef Mset::iterator iterator; | |
31 | ||
32 | Mset ms1; | |
33 | ||
34 | const iterator it1 = ms1.insert(value_type(0)); | |
35 | const iterator it2 = ms1.insert(value_type(1)); | |
36 | const iterator it3 = ms1.insert(value_type(2)); | |
37 | ||
38 | const value_type vt1(2); | |
39 | const iterator it4 = ms1.insert(it1, vt1); | |
40 | iterator it5 = it4; | |
41 | iterator it6 = it4; | |
42 | VERIFY( ms1.size() == 4 ); | |
43 | VERIFY( *it4 == vt1 ); | |
44 | VERIFY( ++it5 == it3 ); | |
45 | VERIFY( --it6 == it2 ); | |
46 | VERIFY( *it5 == *it3 ); | |
47 | VERIFY( *it6 == *it2 ); | |
48 | ||
49 | const value_type vt2(2); | |
50 | const iterator it7 = ms1.insert(ms1.begin(), vt2); | |
51 | iterator it8 = it7; | |
52 | iterator it9 = it7; | |
53 | VERIFY( ms1.size() == 5 ); | |
54 | VERIFY( *it7 == vt2 ); | |
55 | VERIFY( ++it8 == it4 ); | |
56 | VERIFY( --it9 == it2 ); | |
57 | VERIFY( *it8 == *it4 ); | |
58 | VERIFY( *it9 == *it2 ); | |
59 | ||
60 | const value_type vt3(2); | |
61 | const iterator it10 = ms1.insert(it1, vt3); | |
62 | iterator it11 = it10; | |
63 | iterator it12 = it10; | |
64 | VERIFY( ms1.size() == 6 ); | |
65 | VERIFY( *it10 == vt3 ); | |
66 | VERIFY( ++it11 == it7 ); | |
67 | VERIFY( --it12 == it2 ); | |
68 | VERIFY( *it11 == *it7 ); | |
69 | VERIFY( *it12 == *it2 ); | |
70 | ||
71 | const value_type vt4(0); | |
72 | const iterator it13 = ms1.insert(it10, vt4); | |
73 | iterator it14 = it13; | |
74 | iterator it15 = it13; | |
75 | VERIFY( ms1.size() == 7 ); | |
76 | VERIFY( *it13 == vt4 ); | |
77 | VERIFY( ++it14 == it2 ); | |
78 | VERIFY( --it15 == it1 ); | |
79 | VERIFY( *it14 == *it2 ); | |
80 | VERIFY( *it15 == *it1 ); | |
81 | ||
82 | const value_type vt5(1); | |
83 | const iterator it16 = ms1.insert(it13, vt5); | |
84 | iterator it17 = it16; | |
85 | iterator it18 = it16; | |
86 | VERIFY( ms1.size() == 8 ); | |
87 | VERIFY( *it16 == vt5 ); | |
88 | VERIFY( ++it17 == it2 ); | |
89 | VERIFY( --it18 == it13 ); | |
90 | VERIFY( *it17 == *it2 ); | |
91 | VERIFY( *it18 == *it13 ); | |
92 | ||
93 | const value_type vt6(0); | |
94 | const iterator it19 = ms1.insert(it1, vt6); | |
95 | iterator it20 = it19; | |
96 | VERIFY( ms1.size() == 9 ); | |
97 | VERIFY( *it19 == vt6 ); | |
98 | VERIFY( it19 == ms1.begin() ); | |
99 | VERIFY( ++it20 == it1 ); | |
100 | VERIFY( *it20 == *it1 ); | |
101 | ||
102 | const value_type vt7(3); | |
103 | const iterator it21 = ms1.insert(it19, vt7); | |
104 | iterator it22 = it21; | |
105 | iterator it23 = it21; | |
106 | VERIFY( ms1.size() == 10 ); | |
107 | VERIFY( *it21 == vt7 ); | |
108 | VERIFY( ++it22 == ms1.end() ); | |
109 | VERIFY( --it23 == it3 ); | |
110 | VERIFY( *it23 == *it3 ); | |
111 | ||
112 | const value_type vt8(2); | |
113 | const iterator it24 = ms1.insert(ms1.end(), vt8); | |
114 | iterator it25 = it24; | |
115 | iterator it26 = it24; | |
116 | VERIFY( ms1.size() == 11 ); | |
117 | VERIFY( *it24 == vt8 ); | |
118 | VERIFY( ++it25 == it21 ); | |
119 | VERIFY( --it26 == it3 ); | |
120 | VERIFY( *it25 == *it21 ); | |
121 | VERIFY( *it26 == *it3 ); | |
122 | ||
123 | const value_type vt9(3); | |
124 | const iterator it27 = ms1.insert(it3, vt9); | |
125 | iterator it28 = it27; | |
126 | iterator it29 = it27; | |
127 | VERIFY( ms1.size() == 12 ); | |
128 | VERIFY( *it27 == vt9 ); | |
129 | VERIFY( ++it28 == it21 ); | |
130 | VERIFY( --it29 == it24 ); | |
131 | VERIFY( *it28 == *it21 ); | |
132 | VERIFY( *it29 == *it24 ); | |
133 | } | |
134 | ||
135 | int main() | |
136 | { | |
137 | test01(); | |
138 | return 0; | |
139 | } |