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 | // UNSUPPORTED: c++03, c++11, c++14 |
10 | |
11 | // <set> |
12 | |
13 | // class multiset |
14 | |
15 | // template <class C2> |
16 | // void merge(set<Key, C2, Allocator>& source); |
17 | // template <class C2> |
18 | // void merge(set<Key, C2, Allocator>&& source); |
19 | // template <class C2> |
20 | // void merge(multiset<Key, C2, Allocator>& source); |
21 | // template <class C2> |
22 | // void merge(multiset<Key, C2, Allocator>&& source); |
23 | |
24 | #include <set> |
25 | #include <cassert> |
26 | #include "test_macros.h" |
27 | #include "Counter.h" |
28 | |
29 | template <class Set> |
30 | bool set_equal(const Set& set, Set other) |
31 | { |
32 | return set == other; |
33 | } |
34 | |
35 | #ifndef TEST_HAS_NO_EXCEPTIONS |
36 | struct throw_comparator |
37 | { |
38 | bool& should_throw_; |
39 | |
40 | throw_comparator(bool& should_throw) : should_throw_(should_throw) {} |
41 | |
42 | template <class T> |
43 | bool operator()(const T& lhs, const T& rhs) const |
44 | { |
45 | if (should_throw_) |
46 | throw 0; |
47 | return lhs < rhs; |
48 | } |
49 | }; |
50 | #endif |
51 | |
52 | int main(int, char**) |
53 | { |
54 | { |
55 | std::multiset<int> src{1, 3, 5}; |
56 | std::multiset<int> dst{2, 4, 5}; |
57 | dst.merge(source&: src); |
58 | assert(set_equal(src, {})); |
59 | assert(set_equal(dst, {1, 2, 3, 4, 5, 5})); |
60 | } |
61 | |
62 | #ifndef TEST_HAS_NO_EXCEPTIONS |
63 | { |
64 | bool do_throw = false; |
65 | typedef std::multiset<Counter<int>, throw_comparator> set_type; |
66 | set_type src({1, 3, 5}, throw_comparator(do_throw)); |
67 | set_type dst({2, 4, 5}, throw_comparator(do_throw)); |
68 | |
69 | assert(Counter_base::gConstructed == 6); |
70 | |
71 | do_throw = true; |
72 | try |
73 | { |
74 | dst.merge(src); |
75 | } |
76 | catch (int) |
77 | { |
78 | do_throw = false; |
79 | } |
80 | assert(!do_throw); |
81 | assert(set_equal(src, set_type({1, 3, 5}, throw_comparator(do_throw)))); |
82 | assert(set_equal(dst, set_type({2, 4, 5}, throw_comparator(do_throw)))); |
83 | } |
84 | #endif |
85 | assert(Counter_base::gConstructed == 0); |
86 | struct comparator |
87 | { |
88 | comparator() = default; |
89 | |
90 | bool operator()(const Counter<int>& lhs, const Counter<int>& rhs) const |
91 | { |
92 | return lhs < rhs; |
93 | } |
94 | }; |
95 | { |
96 | typedef std::multiset<Counter<int>, std::less<Counter<int>>> first_set_type; |
97 | typedef std::multiset<Counter<int>, comparator> second_set_type; |
98 | typedef std::set<Counter<int>, comparator> third_set_type; |
99 | |
100 | { |
101 | first_set_type first{1, 2, 3}; |
102 | second_set_type second{2, 3, 4}; |
103 | third_set_type third{1, 3}; |
104 | |
105 | assert(Counter_base::gConstructed == 8); |
106 | |
107 | first.merge(second); |
108 | first.merge(third); |
109 | |
110 | assert(set_equal(first, {1, 1, 2, 2, 3, 3, 3, 4})); |
111 | assert(set_equal(second, {})); |
112 | assert(set_equal(third, {})); |
113 | |
114 | assert(Counter_base::gConstructed == 8); |
115 | } |
116 | assert(Counter_base::gConstructed == 0); |
117 | { |
118 | first_set_type first{1, 2, 3}; |
119 | second_set_type second{2, 3, 4}; |
120 | third_set_type third{1, 3}; |
121 | |
122 | assert(Counter_base::gConstructed == 8); |
123 | |
124 | first.merge(std::move(second)); |
125 | first.merge(std::move(third)); |
126 | |
127 | assert(set_equal(first, {1, 1, 2, 2, 3, 3, 3, 4})); |
128 | assert(set_equal(second, {})); |
129 | assert(set_equal(third, {})); |
130 | |
131 | assert(Counter_base::gConstructed == 8); |
132 | } |
133 | assert(Counter_base::gConstructed == 0); |
134 | } |
135 | { |
136 | std::multiset<int> first; |
137 | { |
138 | std::multiset<int> second; |
139 | first.merge(source&: second); |
140 | first.merge(source: std::move(second)); |
141 | } |
142 | { |
143 | std::set<int> second; |
144 | first.merge(source&: second); |
145 | first.merge(source: std::move(second)); |
146 | } |
147 | } |
148 | return 0; |
149 | } |
150 | |