3 // 2005-2-17 Matt Austern <austern@apple.com>
5 // Copyright (C) 2005 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 2, 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 COPYING. If not, write to the Free
20 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
23 // 6.3.4.4 unordered_map
24 // Single-element insert
28 #include <tr1/unordered_map>
29 #include "testsuite_hooks.h"
31 bool test __attribute__((unused)) = true;
35 typedef std::tr1::unordered_map<std::string, int> Map;
36 typedef std::pair<const std::string, int> Pair;
41 std::pair<Map::iterator, bool> p = m.insert(Pair("abcde", 3));
43 VERIFY(m.size() == 1);
44 VERIFY(std::distance(m.begin(), m.end()) == 1);
45 VERIFY(p.first == m.begin());
46 VERIFY(p.first->first == "abcde");
47 VERIFY(p.first->second == 3);
52 typedef std::tr1::unordered_map<std::string, int> Map;
53 typedef std::pair<const std::string, int> Pair;
58 std::pair<Map::iterator, bool> p1 = m.insert(Pair("abcde", 3));
59 std::pair<Map::iterator, bool> p2 = m.insert(Pair("abcde", 7));
63 VERIFY(m.size() == 1);
64 VERIFY(p1.first == p2.first);
65 VERIFY(p1.first->first == "abcde");
66 VERIFY(p2.first->second == 3);