1 // 2007-02-22 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2007-2024 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 // 6.3.4.5 Class template unordered_multiset
22 #include <tr1/unordered_set>
24 #include <testsuite_hooks.h>
26 // In the occasion of libstdc++/25896
29 typedef std::tr1::unordered_multiset
<std::string
> Mset
;
30 typedef Mset::iterator iterator
;
31 typedef Mset::const_iterator const_iterator
;
35 ms1
.insert("because to why");
36 ms1
.insert("the stockholm syndrome");
37 ms1
.insert("a cereous night");
39 ms1
.insert("protean");
40 ms1
.insert("the way you are when");
41 ms1
.insert("tillsammans");
42 ms1
.insert("umbra/penumbra");
43 ms1
.insert("belonging (no longer mix)");
44 ms1
.insert("one line behind");
45 VERIFY( ms1
.size() == 10 );
47 VERIFY( ms1
.erase("eeilo") == 1 );
48 VERIFY( ms1
.size() == 9 );
49 iterator it1
= ms1
.find("eeilo");
50 VERIFY( it1
== ms1
.end() );
52 VERIFY( ms1
.erase("tillsammans") == 1 );
53 VERIFY( ms1
.size() == 8 );
54 iterator it2
= ms1
.find("tillsammans");
55 VERIFY( it2
== ms1
.end() );
57 // Must work (see DR 526)
58 iterator it3
= ms1
.find("belonging (no longer mix)");
59 VERIFY( it3
!= ms1
.end() );
60 VERIFY( ms1
.erase(*it3
) == 1 );
61 VERIFY( ms1
.size() == 7 );
62 it3
= ms1
.find("belonging (no longer mix)");
63 VERIFY( it3
== ms1
.end() );
65 VERIFY( !ms1
.erase("abra") );
66 VERIFY( ms1
.size() == 7 );
68 VERIFY( !ms1
.erase("eeilo") );
69 VERIFY( ms1
.size() == 7 );
71 VERIFY( ms1
.erase("because to why") == 1 );
72 VERIFY( ms1
.size() == 6 );
73 iterator it4
= ms1
.find("because to why");
74 VERIFY( it4
== ms1
.end() );
76 iterator it5
= ms1
.find("umbra/penumbra");
77 iterator it6
= ms1
.find("one line behind");
78 VERIFY( it5
!= ms1
.end() );
79 VERIFY( it6
!= ms1
.end() );
81 VERIFY( ms1
.find("the stockholm syndrome") != ms1
.end() );
82 VERIFY( ms1
.find("a cereous night") != ms1
.end() );
83 VERIFY( ms1
.find("the way you are when") != ms1
.end() );
84 VERIFY( ms1
.find("a cereous night") != ms1
.end() );
86 VERIFY( ms1
.erase(*it5
) == 1 );
87 VERIFY( ms1
.size() == 5 );
88 it5
= ms1
.find("umbra/penumbra");
89 VERIFY( it5
== ms1
.end() );
91 VERIFY( ms1
.erase(*it6
) == 1 );
92 VERIFY( ms1
.size() == 4 );
93 it6
= ms1
.find("one line behind");
94 VERIFY( it6
== ms1
.end() );
96 iterator it7
= ms1
.begin();
102 VERIFY( ms1
.erase(*it8
) == 1 );
103 VERIFY( ms1
.size() == 3 );
104 VERIFY( ++it7
== it9
);
108 iterator it11
= it10
;
110 VERIFY( ms1
.erase(*it9
) == 1 );
111 VERIFY( ms1
.size() == 2 );
112 VERIFY( ++it10
== ms1
.end() );
114 VERIFY( ms1
.erase(ms1
.begin()) != ms1
.end() );
115 VERIFY( ms1
.size() == 1 );
116 VERIFY( ms1
.begin() == it11
);
118 VERIFY( ms1
.erase(*ms1
.begin()) == 1 );
119 VERIFY( ms1
.size() == 0 );
120 VERIFY( ms1
.begin() == ms1
.end() );