1// { dg-do run } 2 3// 2005-2-17 Matt Austern <austern@apple.com> 4// 5// Copyright (C) 2005-2015 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// Single-element insert 24 25#include <string> 26#include <iterator> 27#include <tr1/unordered_set> 28#include "testsuite_hooks.h" 29 30bool test __attribute__((unused)) = true; 31 32void test01() 33{ 34 typedef std::tr1::unordered_set<std::string> Set; 35 Set s; 36 VERIFY(s.empty()); 37 38 std::pair<Set::iterator, bool> p = s.insert("abcde"); 39 VERIFY(p.second); 40 VERIFY(s.size() == 1); 41 VERIFY(std::distance(s.begin(), s.end()) == 1); 42 VERIFY(p.first == s.begin()); 43 VERIFY(*p.first == "abcde"); 44} 45 46void test02() 47{ 48 typedef std::tr1::unordered_set<std::string> Set; 49 Set s; 50 VERIFY(s.empty()); 51 52 std::pair<Set::iterator, bool> p1 = s.insert("abcde"); 53 std::pair<Set::iterator, bool> p2 = s.insert("abcde"); 54 VERIFY(p1.second); 55 VERIFY(!p2.second); 56 VERIFY(s.size() == 1); 57 VERIFY(p1.first == p2.first); 58 VERIFY(*p1.first == "abcde"); 59} 60 61int main() 62{ 63 test01(); 64 test02(); 65 return 0; 66} 67