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.3 unordered_set 23// find, equal_range, count 24 25#include <string> 26#include <iterator> 27#include <algorithm> 28#include <tr1/unordered_set> 29#include "testsuite_hooks.h" 30 31bool test __attribute__((unused)) = true; 32 33void test01() 34{ 35 typedef std::tr1::unordered_set<std::string> Set; 36 Set s; 37 VERIFY(s.empty()); 38 39 std::pair<Set::iterator, bool> tmp = s.insert("grape"); 40 Set::iterator i = tmp.first; 41 42 Set::iterator i2 = s.find("grape"); 43 VERIFY(i2 != s.end()); 44 VERIFY(i2 == i); 45 VERIFY(*i2 == "grape"); 46 47 std::pair<Set::iterator, Set::iterator> p = s.equal_range("grape"); 48 VERIFY(p.first == i2); 49 VERIFY(std::distance(p.first, p.second) == 1); 50 51 Set::iterator i3 = s.find("lime"); 52 VERIFY(i3 == s.end()); 53 54 std::pair<Set::iterator, Set::iterator> p2 = s.equal_range("lime"); 55 VERIFY(p2.first == p2.second); 56 57 VERIFY(s.count("grape") == 1); 58 VERIFY(s.count("lime") == 0); 59} 60 61int main() 62{ 63 test01(); 64 return 0; 65} 66