1// { dg-do run } 2 3// 2005-2-18 Matt Austern <austern@apple.com> 4// 5// Copyright (C) 2005, 2009 Free Software Foundation, Inc. 6// 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) 11// any later version. 12// 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. 17// 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/>. 21 22// 6.3.4.4 unordered_map 23// find, equal_range, count 24 25#include <string> 26#include <iterator> 27#include <algorithm> 28#include <utility> 29#include <tr1/unordered_map> 30#include "testsuite_hooks.h" 31 32bool test __attribute__((unused)) = true; 33 34void test01() 35{ 36 typedef std::tr1::unordered_map<std::string, int> Map; 37 typedef std::pair<const std::string, int> Pair; 38 39 Map m; 40 VERIFY(m.empty()); 41 42 std::pair<Map::iterator, bool> tmp = m.insert(Pair("grape", 3)); 43 Map::iterator i = tmp.first; 44 VERIFY(tmp.second); 45 46 Map::iterator i2 = m.find("grape"); 47 VERIFY(i2 != m.end()); 48 VERIFY(i2 == i); 49 VERIFY(i2->first == "grape"); 50 VERIFY(i2->second == 3); 51 52 Map::iterator i3 = m.find("lime"); 53 VERIFY(i3 == m.end()); 54 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); 58 59 std::pair<Map::iterator, Map::iterator> p2 = m.equal_range("lime"); 60 VERIFY(p2.first == p2.second); 61 62 VERIFY(m.count("grape") == 1); 63 VERIFY(m.count("lime") == 0); 64} 65 66int main() 67{ 68 test01(); 69 return 0; 70} 71