1// { dg-options "-std=gnu++11" }
2
3// 2010-02-10  Paolo Carlini  <paolo.carlini@oracle.com>
4//
5// Copyright (C) 2010-2015 Free Software Foundation, Inc.
6//
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)
11// any later version.
12//
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.
17//
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/>.
21
22#include <unordered_set>
23#include <string>
24#include <testsuite_hooks.h>
25
26namespace
27{
28  std::size_t
29  get_nb_bucket_elems(const std::unordered_multiset<std::string>& us)
30  {
31    std::size_t nb = 0;
32    for (std::size_t b = 0; b != us.bucket_count(); ++b)
33      nb += us.bucket_size(b);
34    return nb;
35  }
36}
37
38void test01()
39{
40  bool test __attribute__((unused)) = true;
41
42  typedef std::unordered_multiset<std::string> Mset;
43  typedef Mset::iterator       iterator;
44  typedef Mset::const_iterator const_iterator;
45
46  Mset ms1;
47
48  ms1.insert("because to why");
49  ms1.insert("the stockholm syndrome");
50  ms1.insert("a cereous night");
51  ms1.insert("eeilo");
52  ms1.insert("protean");
53  ms1.insert("the way you are when");
54  ms1.insert("tillsammans");
55  ms1.insert("umbra/penumbra");
56  ms1.insert("belonging (no longer mix)");
57  ms1.insert("one line behind");
58  ms1.insert("because to why");
59  VERIFY( ms1.size() == 11 );
60  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
61  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
62
63  VERIFY( ms1.erase("eeilo") == 1 );
64  VERIFY( ms1.size() == 10 );
65  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
66  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
67  iterator it1 = ms1.find("eeilo");
68  VERIFY( it1 == ms1.end() );
69
70  VERIFY( ms1.erase("tillsammans") == 1 );
71  VERIFY( ms1.size() == 9 );
72  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
73  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
74  iterator it2 = ms1.find("tillsammans");
75  VERIFY( it2 == ms1.end() );
76
77  // Must work (see DR 526)
78  iterator it3 = ms1.find("belonging (no longer mix)");
79  VERIFY( it3 != ms1.end() );
80  VERIFY( ms1.erase(*it3) == 1 );
81  VERIFY( ms1.size() == 8 );
82  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
83  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
84  it3 = ms1.find("belonging (no longer mix)");
85  VERIFY( it3 == ms1.end() );
86
87  VERIFY( !ms1.erase("abra") );
88  VERIFY( ms1.size() == 8 );
89  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
90  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
91
92  VERIFY( !ms1.erase("eeilo") );
93  VERIFY( ms1.size() == 8 );
94
95  VERIFY( ms1.erase("because to why") == 2 );
96  VERIFY( ms1.size() == 6 );
97  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
98  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
99  iterator it4 = ms1.find("because to why");
100  VERIFY( it4 == ms1.end() );
101
102  iterator it5 = ms1.find("umbra/penumbra");
103  iterator it6 = ms1.find("one line behind");
104  VERIFY( it5 != ms1.end() );
105  VERIFY( it6 != ms1.end() );
106
107  VERIFY( ms1.find("the stockholm syndrome") != ms1.end() );
108  VERIFY( ms1.find("a cereous night") != ms1.end() );
109  VERIFY( ms1.find("the way you are when") != ms1.end() );
110  VERIFY( ms1.find("a cereous night") != ms1.end() );
111
112  VERIFY( ms1.erase(*it5) == 1 );
113  VERIFY( ms1.size() == 5 );
114  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
115  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
116  it5 = ms1.find("umbra/penumbra");
117  VERIFY( it5 == ms1.end() );
118
119  VERIFY( ms1.erase(*it6) == 1 );
120  VERIFY( ms1.size() == 4 );
121  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
122  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
123  it6 = ms1.find("one line behind");
124  VERIFY( it6 == ms1.end() );
125
126  iterator it7 = ms1.begin();
127  iterator it8 = it7;
128  ++it8;
129  iterator it9 = it8;
130  ++it9;
131
132  VERIFY( ms1.erase(*it8) == 1 );
133  VERIFY( ms1.size() == 3 );
134  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
135  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
136  VERIFY( ++it7 == it9 );
137
138  iterator it10 = it9;
139  ++it10;
140  iterator it11 = it10;
141
142  VERIFY( ms1.erase(*it9) == 1 );
143  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
144  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
145  VERIFY( ms1.size() == 2 );
146  VERIFY( ++it10 == ms1.end() );
147
148  VERIFY( ms1.erase(ms1.begin()) != ms1.end() );
149  VERIFY( ms1.size() == 1 );
150  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
151  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
152  VERIFY( ms1.begin() == it11 );
153
154  VERIFY( ms1.erase(*ms1.begin()) == 1 );
155  VERIFY( ms1.size() == 0 );
156  VERIFY( get_nb_bucket_elems(ms1) == ms1.size() );
157  VERIFY( distance(ms1.begin(), ms1.end()) - ms1.size() == 0 );
158  VERIFY( ms1.begin() == ms1.end() );
159}
160
161int main()
162{
163  test01();
164  return 0;
165}
166