3 // 2005-2-17 Matt Austern <austern@apple.com>
5 // Copyright (C) 2005, 2009 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 // 6.3.4.5 unordered_multiset
23 // Single-element insert
27 #include <tr1/unordered_set>
28 #include "testsuite_hooks.h"
30 bool test __attribute__((unused)) = true;
34 typedef std::tr1::unordered_multiset<std::string> Set;
38 Set::iterator i = s.insert("abcde");
39 VERIFY(s.size() == 1);
40 VERIFY(std::distance(s.begin(), s.end()) == 1);
41 VERIFY(i == s.begin());
42 VERIFY(*i == "abcde");
47 typedef std::tr1::unordered_multiset<std::string> Set;
52 Set::iterator i = s.insert("abcde");
53 VERIFY(s.size() == 2);
54 VERIFY(std::distance(s.begin(), s.end()) == 2);
55 VERIFY(*i == "abcde");
57 Set::iterator i2 = s.begin();
59 VERIFY(i == s.begin() || i == i2);
60 VERIFY(*(s.begin()) == "abcde" && *i2 == "abcde");