blob: 3d17ffb15919dccc40eb43bc6cafca698df13bdc (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// { dg-do run }
// 2005-2-17 Matt Austern <austern@apple.com>
//
// Copyright (C) 2005-2016 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// 6.3.4.3 unordered_set
// Single-element insert
#include <string>
#include <iterator>
#include <tr1/unordered_set>
#include "testsuite_hooks.h"
bool test __attribute__((unused)) = true;
void test01()
{
typedef std::tr1::unordered_set<std::string> Set;
Set s;
VERIFY(s.empty());
std::pair<Set::iterator, bool> p = s.insert("abcde");
VERIFY(p.second);
VERIFY(s.size() == 1);
VERIFY(std::distance(s.begin(), s.end()) == 1);
VERIFY(p.first == s.begin());
VERIFY(*p.first == "abcde");
}
void test02()
{
typedef std::tr1::unordered_set<std::string> Set;
Set s;
VERIFY(s.empty());
std::pair<Set::iterator, bool> p1 = s.insert("abcde");
std::pair<Set::iterator, bool> p2 = s.insert("abcde");
VERIFY(p1.second);
VERIFY(!p2.second);
VERIFY(s.size() == 1);
VERIFY(p1.first == p2.first);
VERIFY(*p1.first == "abcde");
}
int main()
{
test01();
test02();
return 0;
}
|
