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