1 // 2007-02-22 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2007-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 // 6.3.4.6 Class template unordered_multimap
22 #include <tr1/unordered_map>
24 #include <testsuite_hooks.h>
26 // In the occasion of libstdc++/25896
29 bool test
__attribute__((unused
)) = true;
31 typedef std::tr1::unordered_multimap
<std::string
, int> Mmap
;
32 typedef Mmap::iterator iterator
;
33 typedef Mmap::const_iterator const_iterator
;
34 typedef Mmap::value_type value_type
;
38 mm1
.insert(value_type("because to why", 1));
39 mm1
.insert(value_type("the stockholm syndrome", 2));
40 mm1
.insert(value_type("a cereous night", 3));
41 mm1
.insert(value_type("eeilo", 4));
42 mm1
.insert(value_type("protean", 5));
43 mm1
.insert(value_type("the way you are when", 6));
44 mm1
.insert(value_type("tillsammans", 7));
45 mm1
.insert(value_type("umbra/penumbra", 8));
46 mm1
.insert(value_type("belonging (no longer mix)", 9));
47 mm1
.insert(value_type("one line behind", 10));
48 VERIFY( mm1
.size() == 10 );
50 VERIFY( mm1
.erase("eeilo") == 1 );
51 VERIFY( mm1
.size() == 9 );
52 iterator it1
= mm1
.find("eeilo");
53 VERIFY( it1
== mm1
.end() );
55 VERIFY( mm1
.erase("tillsammans") == 1 );
56 VERIFY( mm1
.size() == 8 );
57 iterator it2
= mm1
.find("tillsammans");
58 VERIFY( it2
== mm1
.end() );
60 // Must work (see DR 526)
61 iterator it3
= mm1
.find("belonging (no longer mix)");
62 VERIFY( it3
!= mm1
.end() );
63 VERIFY( mm1
.erase(it3
->first
) == 1 );
64 VERIFY( mm1
.size() == 7 );
65 it3
= mm1
.find("belonging (no longer mix)");
66 VERIFY( it3
== mm1
.end() );
68 VERIFY( !mm1
.erase("abra") );
69 VERIFY( mm1
.size() == 7 );
71 VERIFY( !mm1
.erase("eeilo") );
72 VERIFY( mm1
.size() == 7 );
74 VERIFY( mm1
.erase("because to why") == 1 );
75 VERIFY( mm1
.size() == 6 );
76 iterator it4
= mm1
.find("because to why");
77 VERIFY( it4
== mm1
.end() );
79 iterator it5
= mm1
.find("umbra/penumbra");
80 iterator it6
= mm1
.find("one line behind");
81 VERIFY( it5
!= mm1
.end() );
82 VERIFY( it6
!= mm1
.end() );
84 VERIFY( mm1
.find("the stockholm syndrome") != mm1
.end() );
85 VERIFY( mm1
.find("a cereous night") != mm1
.end() );
86 VERIFY( mm1
.find("the way you are when") != mm1
.end() );
87 VERIFY( mm1
.find("a cereous night") != mm1
.end() );
89 VERIFY( mm1
.erase(it5
->first
) == 1 );
90 VERIFY( mm1
.size() == 5 );
91 it5
= mm1
.find("umbra/penumbra");
92 VERIFY( it5
== mm1
.end() );
94 VERIFY( mm1
.erase(it6
->first
) == 1 );
95 VERIFY( mm1
.size() == 4 );
96 it6
= mm1
.find("one line behind");
97 VERIFY( it6
== mm1
.end() );
99 iterator it7
= mm1
.begin();
105 VERIFY( mm1
.erase(it8
->first
) == 1 );
106 VERIFY( mm1
.size() == 3 );
107 VERIFY( ++it7
== it9
);
111 iterator it11
= it10
;
113 VERIFY( mm1
.erase(it9
->first
) == 1 );
114 VERIFY( mm1
.size() == 2 );
115 VERIFY( ++it10
== mm1
.end() );
117 VERIFY( mm1
.erase(mm1
.begin()) != mm1
.end() );
118 VERIFY( mm1
.size() == 1 );
119 VERIFY( mm1
.begin() == it11
);
121 VERIFY( mm1
.erase(mm1
.begin()->first
) == 1 );
122 VERIFY( mm1
.size() == 0 );
123 VERIFY( mm1
.begin() == mm1
.end() );