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
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03
// <set>
// class set
// iterator insert(const_iterator position, value_type&& v);
#include <set>
#include <cassert>
#include "MoveOnly.h"
#include "min_allocator.h"
int main()
{
{
typedef std::set<MoveOnly> M;
typedef M::iterator R;
M m;
R r = m.insert(m.cend(), M::value_type(2));
assert(r == m.begin());
assert(m.size() == 1);
assert(*r == 2);
r = m.insert(m.cend(), M::value_type(1));
assert(r == m.begin());
assert(m.size() == 2);
assert(*r == 1);
r = m.insert(m.cend(), M::value_type(3));
assert(r == prev(m.end()));
assert(m.size() == 3);
assert(*r == 3);
r = m.insert(m.cend(), M::value_type(3));
assert(r == prev(m.end()));
assert(m.size() == 3);
assert(*r == 3);
}
{
typedef std::set<MoveOnly, std::less<MoveOnly>, min_allocator<MoveOnly>> M;
typedef M::iterator R;
M m;
R r = m.insert(m.cend(), M::value_type(2));
assert(r == m.begin());
assert(m.size() == 1);
assert(*r == 2);
r = m.insert(m.cend(), M::value_type(1));
assert(r == m.begin());
assert(m.size() == 2);
assert(*r == 1);
r = m.insert(m.cend(), M::value_type(3));
assert(r == prev(m.end()));
assert(m.size() == 3);
assert(*r == 3);
r = m.insert(m.cend(), M::value_type(3));
assert(r == prev(m.end()));
assert(m.size() == 3);
assert(*r == 3);
}
}
|
