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.3 Class template unordered_set
22 #include <tr1/unordered_set>
24 #include <testsuite_hooks.h>
29 bool test __attribute__((unused)) = true;
31 typedef std::tr1::unordered_set<std::string> Set;
32 typedef Set::iterator iterator;
33 typedef Set::const_iterator const_iterator;
37 s1.insert("all the love in the world");
38 s1.insert("you know what you are?");
39 s1.insert("the collector");
40 s1.insert("the hand that feeds");
41 s1.insert("love is not enough");
42 s1.insert("every day is exactly the same");
43 s1.insert("with teeth");
45 s1.insert("getting smaller");
46 s1.insert("sunspots");
47 VERIFY( s1.size() == 10 );
49 iterator it1 = s1.begin();
53 iterator it3 = s1.erase(it1);
54 VERIFY( s1.size() == 9 );
56 VERIFY( *it3 == *it2 );
58 iterator it4 = s1.begin();
65 iterator it6 = s1.erase(it4, it5);
66 VERIFY( s1.size() == 7 );
68 VERIFY( *it6 == *it5 );
70 const_iterator it7 = s1.begin();
74 const_iterator it8 = it7;
76 const_iterator it9 = s1.erase(it7);
77 VERIFY( s1.size() == 6 );
79 VERIFY( *it9 == *it8 );
81 const_iterator it10 = s1.begin();
83 const_iterator it11 = it10;
88 const_iterator it12 = s1.erase(it10, it11);
89 VERIFY( s1.size() == 2 );
90 VERIFY( it12 == it11 );
91 VERIFY( *it12 == *it11 );
92 VERIFY( ++it12 == s1.end() );
94 iterator it13 = s1.erase(s1.begin(), s1.end());
95 VERIFY( s1.size() == 0 );
96 VERIFY( it13 == s1.end() );
97 VERIFY( it13 == s1.begin() );