1//===----------------------------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8
9// <unordered_set>
10
11// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
12// class Alloc = allocator<Value>>
13// class unordered_multiset
14
15// iterator insert(value_type&& x);
16
17#include <unordered_set>
18#include <cassert>
19
20#include "test_macros.h"
21#include "MoveOnly.h"
22#include "min_allocator.h"
23
24int main(int, char**) {
25 {
26 typedef std::unordered_multiset<double> C;
27 typedef C::iterator R;
28 typedef double P;
29 C c;
30 R r = c.insert(x: P(3.5));
31 assert(c.size() == 1);
32 assert(*r == 3.5);
33
34 r = c.insert(x: P(3.5));
35 assert(c.size() == 2);
36 assert(*r == 3.5);
37
38 r = c.insert(x: P(4.5));
39 assert(c.size() == 3);
40 assert(*r == 4.5);
41
42 r = c.insert(x: P(5.5));
43 assert(c.size() == 4);
44 assert(*r == 5.5);
45 }
46#if TEST_STD_VER >= 11
47 {
48 typedef std::unordered_multiset<MoveOnly> C;
49 typedef C::iterator R;
50 typedef MoveOnly P;
51 C c;
52 R r = c.insert(P(3));
53 assert(c.size() == 1);
54 assert(*r == 3);
55
56 r = c.insert(P(3));
57 assert(c.size() == 2);
58 assert(*r == 3);
59
60 r = c.insert(P(4));
61 assert(c.size() == 3);
62 assert(*r == 4);
63
64 r = c.insert(P(5));
65 assert(c.size() == 4);
66 assert(*r == 5);
67 }
68 {
69 typedef std::unordered_multiset<double, std::hash<double>, std::equal_to<double>, min_allocator<double>> C;
70 typedef C::iterator R;
71 typedef double P;
72 C c;
73 R r = c.insert(P(3.5));
74 assert(c.size() == 1);
75 assert(*r == 3.5);
76
77 r = c.insert(P(3.5));
78 assert(c.size() == 2);
79 assert(*r == 3.5);
80
81 r = c.insert(P(4.5));
82 assert(c.size() == 3);
83 assert(*r == 4.5);
84
85 r = c.insert(P(5.5));
86 assert(c.size() == 4);
87 assert(*r == 5.5);
88 }
89 {
90 typedef std::unordered_multiset<MoveOnly, std::hash<MoveOnly>, std::equal_to<MoveOnly>, min_allocator<MoveOnly>> C;
91 typedef C::iterator R;
92 typedef MoveOnly P;
93 C c;
94 R r = c.insert(P(3));
95 assert(c.size() == 1);
96 assert(*r == 3);
97
98 r = c.insert(P(3));
99 assert(c.size() == 2);
100 assert(*r == 3);
101
102 r = c.insert(P(4));
103 assert(c.size() == 3);
104 assert(*r == 4);
105
106 r = c.insert(P(5));
107 assert(c.size() == 4);
108 assert(*r == 5);
109 }
110#endif // TEST_STD_VER >= 11
111
112 return 0;
113}
114

source code of libcxx/test/std/containers/unord/unord.multiset/insert_rvalue.pass.cpp