]> git.ipfire.org Git - thirdparty/gcc.git/blob - libstdc++-v3/testsuite/tr1/6_containers/unordered_set/insert/set_single.cc
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / testsuite / tr1 / 6_containers / unordered_set / insert / set_single.cc
1 // { dg-do run }
2
3 // 2005-2-17 Matt Austern <austern@apple.com>
4 //
5 // Copyright (C) 2005-2024 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
30 void test01()
31 {
32 typedef std::tr1::unordered_set<std::string> Set;
33 Set s;
34 VERIFY(s.empty());
35
36 std::pair<Set::iterator, bool> p = s.insert("abcde");
37 VERIFY(p.second);
38 VERIFY(s.size() == 1);
39 VERIFY(std::distance(s.begin(), s.end()) == 1);
40 VERIFY(p.first == s.begin());
41 VERIFY(*p.first == "abcde");
42 }
43
44 void test02()
45 {
46 typedef std::tr1::unordered_set<std::string> Set;
47 Set s;
48 VERIFY(s.empty());
49
50 std::pair<Set::iterator, bool> p1 = s.insert("abcde");
51 std::pair<Set::iterator, bool> p2 = s.insert("abcde");
52 VERIFY(p1.second);
53 VERIFY(!p2.second);
54 VERIFY(s.size() == 1);
55 VERIFY(p1.first == p2.first);
56 VERIFY(*p1.first == "abcde");
57 }
58
59 int main()
60 {
61 test01();
62 test02();
63 return 0;
64 }