3 // 2005-2-18 Matt Austern <austern@apple.com>
5 // Copyright (C) 2005-2013 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.4 unordered_map
23 // find, equal_range, count
29 #include <tr1/unordered_map>
30 #include "testsuite_hooks.h"
32 bool test
__attribute__((unused
)) = true;
36 typedef std::tr1::unordered_map
<std::string
, int> Map
;
37 typedef std::pair
<const std::string
, int> Pair
;
42 std::pair
<Map::iterator
, bool> tmp
= m
.insert(Pair("grape", 3));
43 Map::iterator i
= tmp
.first
;
46 Map::iterator i2
= m
.find("grape");
47 VERIFY(i2
!= m
.end());
49 VERIFY(i2
->first
== "grape");
50 VERIFY(i2
->second
== 3);
52 Map::iterator i3
= m
.find("lime");
53 VERIFY(i3
== m
.end());
55 std::pair
<Map::iterator
, Map::iterator
> p
= m
.equal_range("grape");
56 VERIFY(std::distance(p
.first
, p
.second
) == 1);
57 VERIFY(p
.first
== i2
);
59 std::pair
<Map::iterator
, Map::iterator
> p2
= m
.equal_range("lime");
60 VERIFY(p2
.first
== p2
.second
);
62 VERIFY(m
.count("grape") == 1);
63 VERIFY(m
.count("lime") == 0);