blob: 11fa6ef65cefa494d51ab5212fb8f15dd3fabf26 (
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
67
68
69
70
71
72
73
74
75
76
77
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. 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 "../../MoveOnly.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);
}
#ifdef _LIBCPP_MOVE
{
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);
}
#endif // _LIBCPP_MOVE
}
|
