1 // 2005-10-08 Paolo Carlini <pcarlini@suse.de>
3 // Copyright (C) 2005, 2009 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.4 Class template unordered_map
22 #include <tr1/unordered_map>
24 #include <testsuite_hooks.h>
29 bool test
__attribute__((unused
)) = true;
31 typedef std::tr1::unordered_map
<std::string
, int> Map
;
32 typedef Map::iterator iterator
;
33 typedef Map::const_iterator const_iterator
;
34 typedef Map::value_type value_type
;
38 m1
.insert(value_type("all the love in the world", 1));
39 m1
.insert(value_type("you know what you are?", 2));
40 m1
.insert(value_type("the collector", 3));
41 m1
.insert(value_type("the hand that feeds", 4));
42 m1
.insert(value_type("love is not enough", 5));
43 m1
.insert(value_type("every day is exactly the same", 6));
44 m1
.insert(value_type("with teeth", 7));
45 m1
.insert(value_type("only", 8));
46 m1
.insert(value_type("getting smaller", 9));
47 m1
.insert(value_type("sunspots", 10));
48 VERIFY( m1
.size() == 10 );
50 iterator it1
= m1
.begin();
54 iterator it3
= m1
.erase(it1
);
55 VERIFY( m1
.size() == 9 );
57 VERIFY( *it3
== *it2
);
59 iterator it4
= m1
.begin();
66 iterator it6
= m1
.erase(it4
, it5
);
67 VERIFY( m1
.size() == 7 );
69 VERIFY( *it6
== *it5
);
71 const_iterator it7
= m1
.begin();
75 const_iterator it8
= it7
;
77 const_iterator it9
= m1
.erase(it7
);
78 VERIFY( m1
.size() == 6 );
80 VERIFY( *it9
== *it8
);
82 const_iterator it10
= m1
.begin();
84 const_iterator it11
= it10
;
89 const_iterator it12
= m1
.erase(it10
, it11
);
90 VERIFY( m1
.size() == 2 );
91 VERIFY( it12
== it11
);
92 VERIFY( *it12
== *it11
);
93 VERIFY( ++it12
== m1
.end() );
95 iterator it13
= m1
.erase(m1
.begin(), m1
.end());
96 VERIFY( m1
.size() == 0 );
97 VERIFY( it13
== it12
);
98 VERIFY( it13
== m1
.begin() );