1 // { dg-do run { target c++11 } }
3 // 2010-02-10 Paolo Carlini <paolo.carlini@oracle.com>
5 // Copyright (C) 2010-2022 Free Software Foundation, Inc.
7 // This file is part of the GNU ISO C++ Library. This library is free
8 // software; you can redistribute it and/or modify it under the
9 // terms of the GNU General Public License as published by the
10 // Free Software Foundation; either version 3, or (at your option)
13 // This library is distributed in the hope that it will be useful,
14 // but WITHOUT ANY WARRANTY; without even the implied warranty of
15 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 // GNU General Public License for more details.
18 // You should have received a copy of the GNU General Public License along
19 // with this library; see the file COPYING3. If not see
20 // <http://www.gnu.org/licenses/>.
22 #include <unordered_set>
24 #include <testsuite_hooks.h>
29 get_nb_bucket_elems(const std::unordered_multiset
<std::string
>& us
)
32 for (std::size_t b
= 0; b
!= us
.bucket_count(); ++b
)
33 nb
+= us
.bucket_size(b
);
40 typedef std::unordered_multiset
<std::string
> Mset
;
41 typedef Mset::iterator iterator
;
42 typedef Mset::const_iterator const_iterator
;
46 ms1
.insert("because to why");
47 ms1
.insert("the stockholm syndrome");
48 ms1
.insert("a cereous night");
50 ms1
.insert("protean");
51 ms1
.insert("the way you are when");
52 ms1
.insert("tillsammans");
53 ms1
.insert("umbra/penumbra");
54 ms1
.insert("belonging (no longer mix)");
55 ms1
.insert("one line behind");
56 ms1
.insert("because to why");
57 VERIFY( ms1
.size() == 11 );
58 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
59 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
61 VERIFY( ms1
.erase("eeilo") == 1 );
62 VERIFY( ms1
.size() == 10 );
63 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
64 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
65 iterator it1
= ms1
.find("eeilo");
66 VERIFY( it1
== ms1
.end() );
68 VERIFY( ms1
.erase("tillsammans") == 1 );
69 VERIFY( ms1
.size() == 9 );
70 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
71 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
72 iterator it2
= ms1
.find("tillsammans");
73 VERIFY( it2
== ms1
.end() );
75 // Must work (see DR 526)
76 iterator it3
= ms1
.find("belonging (no longer mix)");
77 VERIFY( it3
!= ms1
.end() );
78 VERIFY( ms1
.erase(*it3
) == 1 );
79 VERIFY( ms1
.size() == 8 );
80 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
81 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
82 it3
= ms1
.find("belonging (no longer mix)");
83 VERIFY( it3
== ms1
.end() );
85 VERIFY( !ms1
.erase("abra") );
86 VERIFY( ms1
.size() == 8 );
87 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
88 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
90 VERIFY( !ms1
.erase("eeilo") );
91 VERIFY( ms1
.size() == 8 );
93 VERIFY( ms1
.erase("because to why") == 2 );
94 VERIFY( ms1
.size() == 6 );
95 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
96 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
97 iterator it4
= ms1
.find("because to why");
98 VERIFY( it4
== ms1
.end() );
100 iterator it5
= ms1
.find("umbra/penumbra");
101 iterator it6
= ms1
.find("one line behind");
102 VERIFY( it5
!= ms1
.end() );
103 VERIFY( it6
!= ms1
.end() );
105 VERIFY( ms1
.find("the stockholm syndrome") != ms1
.end() );
106 VERIFY( ms1
.find("a cereous night") != ms1
.end() );
107 VERIFY( ms1
.find("the way you are when") != ms1
.end() );
108 VERIFY( ms1
.find("a cereous night") != ms1
.end() );
110 VERIFY( ms1
.erase(*it5
) == 1 );
111 VERIFY( ms1
.size() == 5 );
112 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
113 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
114 it5
= ms1
.find("umbra/penumbra");
115 VERIFY( it5
== ms1
.end() );
117 VERIFY( ms1
.erase(*it6
) == 1 );
118 VERIFY( ms1
.size() == 4 );
119 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
120 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
121 it6
= ms1
.find("one line behind");
122 VERIFY( it6
== ms1
.end() );
124 iterator it7
= ms1
.begin();
130 VERIFY( ms1
.erase(*it8
) == 1 );
131 VERIFY( ms1
.size() == 3 );
132 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
133 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
134 VERIFY( ++it7
== it9
);
138 iterator it11
= it10
;
140 VERIFY( ms1
.erase(*it9
) == 1 );
141 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
142 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
143 VERIFY( ms1
.size() == 2 );
144 VERIFY( ++it10
== ms1
.end() );
146 VERIFY( ms1
.erase(ms1
.begin()) != ms1
.end() );
147 VERIFY( ms1
.size() == 1 );
148 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
149 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
150 VERIFY( ms1
.begin() == it11
);
152 VERIFY( ms1
.erase(*ms1
.begin()) == 1 );
153 VERIFY( ms1
.size() == 0 );
154 VERIFY( get_nb_bucket_elems(ms1
) == ms1
.size() );
155 VERIFY( distance(ms1
.begin(), ms1
.end()) - ms1
.size() == 0 );
156 VERIFY( ms1
.begin() == ms1
.end() );