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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
// class Alloc = allocator<Value>>
// class unordered_set
// pair<iterator, bool> insert(value_type&& x);
#include <unordered_set>
#include <cassert>
#include "test_macros.h"
#include "MoveOnly.h"
#include "min_allocator.h"
int main()
{
{
typedef std::unordered_set<double> C;
typedef std::pair<C::iterator, bool> R;
typedef double P;
C c;
R r = c.insert(P(3.5));
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(r.second);
r = c.insert(P(3.5));
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(!r.second);
r = c.insert(P(4.5));
assert(c.size() == 2);
assert(*r.first == 4.5);
assert(r.second);
r = c.insert(P(5.5));
assert(c.size() == 3);
assert(*r.first == 5.5);
assert(r.second);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_set<MoveOnly> C;
typedef std::pair<C::iterator, bool> R;
typedef MoveOnly P;
C c;
R r = c.insert(P(3));
assert(c.size() == 1);
assert(*r.first == 3);
assert(r.second);
r = c.insert(P(3));
assert(c.size() == 1);
assert(*r.first == 3);
assert(!r.second);
r = c.insert(P(4));
assert(c.size() == 2);
assert(*r.first == 4);
assert(r.second);
r = c.insert(P(5));
assert(c.size() == 3);
assert(*r.first == 5);
assert(r.second);
}
{
typedef std::unordered_set<double, std::hash<double>,
std::equal_to<double>, min_allocator<double>> C;
typedef std::pair<C::iterator, bool> R;
typedef double P;
C c;
R r = c.insert(P(3.5));
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(r.second);
r = c.insert(P(3.5));
assert(c.size() == 1);
assert(*r.first == 3.5);
assert(!r.second);
r = c.insert(P(4.5));
assert(c.size() == 2);
assert(*r.first == 4.5);
assert(r.second);
r = c.insert(P(5.5));
assert(c.size() == 3);
assert(*r.first == 5.5);
assert(r.second);
}
{
typedef std::unordered_set<MoveOnly, std::hash<MoveOnly>,
std::equal_to<MoveOnly>, min_allocator<MoveOnly>> C;
typedef std::pair<C::iterator, bool> R;
typedef MoveOnly P;
C c;
R r = c.insert(P(3));
assert(c.size() == 1);
assert(*r.first == 3);
assert(r.second);
r = c.insert(P(3));
assert(c.size() == 1);
assert(*r.first == 3);
assert(!r.second);
r = c.insert(P(4));
assert(c.size() == 2);
assert(*r.first == 4);
assert(r.second);
r = c.insert(P(5));
assert(c.size() == 3);
assert(*r.first == 5);
assert(r.second);
}
#endif // TEST_STD_VER >= 11
}
|
