1 // 2006-01-07 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2006-2013 Free Software Foundation, Inc.
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
8 // Free Software Foundation; either version 3, or (at your option)
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.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING3. If not see
18 // <http://www.gnu.org/licenses/>.
20 // 23.3.4 Class template multiset
23 #include <testsuite_hooks.h>
28 bool test __attribute__((unused)) = true;
29 typedef std::multiset<int> Mset;
30 typedef Mset::value_type value_type;
31 typedef Mset::iterator iterator;
35 const iterator it1 = ms1.insert(value_type(0));
36 const iterator it2 = ms1.insert(value_type(1));
37 const iterator it3 = ms1.insert(value_type(2));
39 const value_type vt1(2);
40 const iterator it4 = ms1.insert(it1, vt1);
43 VERIFY( ms1.size() == 4 );
44 VERIFY( *it4 == vt1 );
45 VERIFY( ++it5 == it3 );
46 VERIFY( --it6 == it2 );
47 VERIFY( *it5 == *it3 );
48 VERIFY( *it6 == *it2 );
50 const value_type vt2(2);
51 const iterator it7 = ms1.insert(ms1.begin(), vt2);
54 VERIFY( ms1.size() == 5 );
55 VERIFY( *it7 == vt2 );
56 VERIFY( ++it8 == it4 );
57 VERIFY( --it9 == it2 );
58 VERIFY( *it8 == *it4 );
59 VERIFY( *it9 == *it2 );
61 const value_type vt3(2);
62 const iterator it10 = ms1.insert(it1, vt3);
65 VERIFY( ms1.size() == 6 );
66 VERIFY( *it10 == vt3 );
67 VERIFY( ++it11 == it7 );
68 VERIFY( --it12 == it2 );
69 VERIFY( *it11 == *it7 );
70 VERIFY( *it12 == *it2 );
72 const value_type vt4(0);
73 const iterator it13 = ms1.insert(it10, vt4);
76 VERIFY( ms1.size() == 7 );
77 VERIFY( *it13 == vt4 );
78 VERIFY( ++it14 == it2 );
79 VERIFY( --it15 == it1 );
80 VERIFY( *it14 == *it2 );
81 VERIFY( *it15 == *it1 );
83 const value_type vt5(1);
84 const iterator it16 = ms1.insert(it13, vt5);
87 VERIFY( ms1.size() == 8 );
88 VERIFY( *it16 == vt5 );
89 VERIFY( ++it17 == it2 );
90 VERIFY( --it18 == it13 );
91 VERIFY( *it17 == *it2 );
92 VERIFY( *it18 == *it13 );
94 const value_type vt6(0);
95 const iterator it19 = ms1.insert(it1, vt6);
97 VERIFY( ms1.size() == 9 );
98 VERIFY( *it19 == vt6 );
99 VERIFY( it19 == ms1.begin() );
100 VERIFY( ++it20 == it1 );
101 VERIFY( *it20 == *it1 );
103 const value_type vt7(3);
104 const iterator it21 = ms1.insert(it19, vt7);
105 iterator it22 = it21;
106 iterator it23 = it21;
107 VERIFY( ms1.size() == 10 );
108 VERIFY( *it21 == vt7 );
109 VERIFY( ++it22 == ms1.end() );
110 VERIFY( --it23 == it3 );
111 VERIFY( *it23 == *it3 );
113 const value_type vt8(2);
114 const iterator it24 = ms1.insert(ms1.end(), vt8);
115 iterator it25 = it24;
116 iterator it26 = it24;
117 VERIFY( ms1.size() == 11 );
118 VERIFY( *it24 == vt8 );
119 VERIFY( ++it25 == it21 );
120 VERIFY( --it26 == it3 );
121 VERIFY( *it25 == *it21 );
122 VERIFY( *it26 == *it3 );
124 const value_type vt9(3);
125 const iterator it27 = ms1.insert(it3, vt9);
126 iterator it28 = it27;
127 iterator it29 = it27;
128 VERIFY( ms1.size() == 12 );
129 VERIFY( *it27 == vt9 );
130 VERIFY( ++it28 == it21 );
131 VERIFY( --it29 == it24 );
132 VERIFY( *it28 == *it21 );
133 VERIFY( *it29 == *it24 );