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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
|
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11, c++14, c++17, c++20
// <flat_set>
// template <class InputIterator>
// flat_set(InputIterator first, InputIterator last, const key_compare& comp = key_compare());
// template<class InputIterator, class Allocator>
// flat_set(InputIterator first, InputIterator last, const Allocator& a);
// template<class InputIterator, class Allocator>
// flat_set(InputIterator first, InputIterator last, const key_compare& comp, const Allocator& a);
#include <algorithm>
#include <deque>
#include <flat_set>
#include <functional>
#include <vector>
#include "MinSequenceContainer.h"
#include "min_allocator.h"
#include "test_allocator.h"
#include "test_iterators.h"
#include "test_macros.h"
#include "../../../test_compare.h"
template <class KeyContainer>
constexpr void test() {
int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
int expected[] = {1, 2, 3};
{
// flat_set(InputIterator , InputIterator)
// cpp17_input_iterator
using M = std::flat_set<int, std::less<int>, KeyContainer>;
auto m = M(cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9));
assert(std::ranges::equal(m, expected));
// explicit(false)
M m2 = {cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9)};
assert(m2 == m);
}
{
// flat_set(InputIterator , InputIterator)
// greater
using M = std::flat_set<int, std::greater<int>, KeyContainer>;
auto m = M(cpp17_input_iterator<const int*>(ar), cpp17_input_iterator<const int*>(ar + 9));
assert(std::ranges::equal(m, KeyContainer{3, 2, 1}));
}
{
// flat_set(InputIterator , InputIterator)
// Test when the operands are of array type (also contiguous iterator type)
using M = std::flat_set<int, std::greater<int>, KeyContainer>;
auto m = M(ar, ar);
assert(m.empty());
}
{
// flat_set(InputIterator , InputIterator, const key_compare&)
using C = test_less<int>;
using M = std::flat_set<int, C, KeyContainer>;
auto m = M(ar, ar + 9, C(3));
assert(std::ranges::equal(m, expected));
assert(m.key_comp() == C(3));
// explicit(false)
M m2 = {ar, ar + 9, C(3)};
assert(m2 == m);
assert(m2.key_comp() == C(3));
}
}
template <template <class...> class KeyContainer>
constexpr void test_alloc() {
int ar[] = {1, 1, 1, 2, 2, 3, 2, 3, 3};
int expected[] = {1, 2, 3};
{
// flat_set(InputIterator , InputIterator, const Allocator&)
using A1 = test_allocator<int>;
using M = std::flat_set<int, std::less<int>, KeyContainer<int, A1>>;
auto m = M(ar, ar + 9, A1(5));
assert(std::ranges::equal(m, expected));
assert(std::move(m).extract().get_allocator() == A1(5));
}
{
// flat_set(InputIterator , InputIterator, const Allocator&)
// explicit(false)
using A1 = test_allocator<int>;
using M = std::flat_set<int, std::less<int>, KeyContainer<int, A1>>;
M m = {ar, ar + 9, A1(5)}; // implicit ctor
assert(std::ranges::equal(m, expected));
assert(std::move(m).extract().get_allocator() == A1(5));
}
{
// flat_set(InputIterator , InputIterator, const key_compare&, const Allocator&)
using C = test_less<int>;
using A1 = test_allocator<int>;
using M = std::flat_set<int, C, KeyContainer<int, A1>>;
auto m = M(ar, ar + 9, C(3), A1(5));
assert(std::ranges::equal(m, expected));
assert(m.key_comp() == C(3));
assert(std::move(m).extract().get_allocator() == A1(5));
}
{
// flat_set(InputIterator , InputIterator, const key_compare&, const Allocator&)
// explicit(false)
using A1 = test_allocator<int>;
using M = std::flat_set<int, std::less<int>, KeyContainer<int, A1>>;
M m = {ar, ar + 9, {}, A1(5)}; // implicit ctor
assert(std::ranges::equal(m, expected));
LIBCPP_ASSERT(std::ranges::equal(m, expected));
assert(std::move(m).extract().get_allocator() == A1(5));
}
}
constexpr bool test() {
{
// The constructors in this subclause shall not participate in overload
// resolution unless uses_allocator_v<container_type, Alloc> is true.
using C = test_less<int>;
using A1 = test_allocator<int>;
using A2 = other_allocator<int>;
using V1 = std::vector<int, A1>;
using V2 = std::vector<int, A2>;
using M1 = std::flat_set<int, C, V1>;
using M2 = std::flat_set<int, C, V2>;
using Iter1 = typename M1::iterator;
using Iter2 = typename M2::iterator;
static_assert(std::is_constructible_v<M1, Iter1, Iter1, const A1&>);
static_assert(std::is_constructible_v<M2, Iter2, Iter2, const A2&>);
static_assert(!std::is_constructible_v<M1, Iter1, Iter1, const A2&>);
static_assert(!std::is_constructible_v<M2, Iter2, Iter2, const A1&>);
static_assert(std::is_constructible_v<M1, Iter1, Iter1, const C&, const A1&>);
static_assert(std::is_constructible_v<M2, Iter2, Iter2, const C&, const A2&>);
static_assert(!std::is_constructible_v<M1, Iter1, Iter1, const C&, const A2&>);
static_assert(!std::is_constructible_v<M2, Iter2, Iter2, const C&, const A1&>);
}
test<std::vector<int>>();
test<MinSequenceContainer<int>>();
test<std::vector<int, min_allocator<int>>>();
test_alloc<std::vector>();
#ifndef __cpp_lib_constexpr_deque
if (!TEST_IS_CONSTANT_EVALUATED)
#endif
{
test<std::deque<int>>();
test_alloc<std::deque>();
}
return true;
}
int main(int, char**) {
test();
#if TEST_STD_VER >= 26
static_assert(test());
#endif
return 0;
}
|
