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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <unordered_set>
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
// class Alloc = allocator<Value>>
// class unordered_multiset
// iterator insert(const_iterator p, value_type&& x);
#include <unordered_set>
#include <cassert>
#include "test_macros.h"
#include "MoveOnly.h"
#include "min_allocator.h"
int main(int, char**)
{
{
typedef std::unordered_multiset<double> C;
typedef C::iterator R;
typedef double P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3.5));
assert(c.size() == 1);
assert(*r == 3.5);
r = c.insert(r, P(3.5));
assert(c.size() == 2);
assert(*r == 3.5);
r = c.insert(c.end(), P(4.5));
assert(c.size() == 3);
assert(*r == 4.5);
r = c.insert(c.end(), P(5.5));
assert(c.size() == 4);
assert(*r == 5.5);
}
#if TEST_STD_VER >= 11
{
typedef std::unordered_multiset<MoveOnly> C;
typedef C::iterator R;
typedef MoveOnly P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3));
assert(c.size() == 1);
assert(*r == 3);
r = c.insert(r, P(3));
assert(c.size() == 2);
assert(*r == 3);
r = c.insert(c.end(), P(4));
assert(c.size() == 3);
assert(*r == 4);
r = c.insert(c.end(), P(5));
assert(c.size() == 4);
assert(*r == 5);
}
{
typedef std::unordered_multiset<double, std::hash<double>,
std::equal_to<double>, min_allocator<double>> C;
typedef C::iterator R;
typedef double P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3.5));
assert(c.size() == 1);
assert(*r == 3.5);
r = c.insert(r, P(3.5));
assert(c.size() == 2);
assert(*r == 3.5);
r = c.insert(c.end(), P(4.5));
assert(c.size() == 3);
assert(*r == 4.5);
r = c.insert(c.end(), P(5.5));
assert(c.size() == 4);
assert(*r == 5.5);
}
{
typedef std::unordered_multiset<MoveOnly, std::hash<MoveOnly>,
std::equal_to<MoveOnly>, min_allocator<MoveOnly>> C;
typedef C::iterator R;
typedef MoveOnly P;
C c;
C::const_iterator e = c.end();
R r = c.insert(e, P(3));
assert(c.size() == 1);
assert(*r == 3);
r = c.insert(r, P(3));
assert(c.size() == 2);
assert(*r == 3);
r = c.insert(c.end(), P(4));
assert(c.size() == 3);
assert(*r == 4);
r = c.insert(c.end(), P(5));
assert(c.size() == 4);
assert(*r == 5);
}
#endif // TEST_STD_VER >= 11
return 0;
}
|
