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
171
172
173
174
175
176
177
|
// RUN: %clang_cc1 -std=c++11 -fsyntax-only -verify %s
// This must obviously come before the definition of std::initializer_list.
void missing_initializerlist() {
auto l = {1, 2, 3, 4}; // expected-error {{std::initializer_list was not found}}
}
namespace std {
typedef decltype(sizeof(int)) size_t;
// libc++'s implementation
template <class _E>
class initializer_list
{
const _E* __begin_;
size_t __size_;
initializer_list(const _E* __b, size_t __s)
: __begin_(__b),
__size_(__s)
{}
public:
typedef _E value_type;
typedef const _E& reference;
typedef const _E& const_reference;
typedef size_t size_type;
typedef const _E* iterator;
typedef const _E* const_iterator;
initializer_list() : __begin_(nullptr), __size_(0) {}
size_t size() const {return __size_;}
const _E* begin() const {return __begin_;}
const _E* end() const {return __begin_ + __size_;}
};
}
template <typename T, typename U>
struct same_type { static const bool value = false; };
template <typename T>
struct same_type<T, T> { static const bool value = true; };
struct one { char c[1]; };
struct two { char c[2]; };
struct A {
int a, b;
};
struct B {
B();
B(int, int);
};
void simple_list() {
std::initializer_list<int> il = { 1, 2, 3 };
std::initializer_list<double> dl = { 1.0, 2.0, 3 };
std::initializer_list<A> al = { {1, 2}, {2, 3}, {3, 4} };
std::initializer_list<B> bl = { {1, 2}, {2, 3}, {} };
}
void function_call() {
void f(std::initializer_list<int>);
f({1, 2, 3});
void g(std::initializer_list<B>);
g({ {1, 2}, {2, 3}, {} });
}
struct C {
C(int);
};
struct D {
D();
operator int();
operator C();
};
void overloaded_call() {
one overloaded(std::initializer_list<int>);
two overloaded(std::initializer_list<B>);
static_assert(sizeof(overloaded({1, 2, 3})) == sizeof(one), "bad overload");
static_assert(sizeof(overloaded({ {1, 2}, {2, 3}, {} })) == sizeof(two), "bad overload");
void ambiguous(std::initializer_list<A>); // expected-note {{candidate}}
void ambiguous(std::initializer_list<B>); // expected-note {{candidate}}
ambiguous({ {1, 2}, {2, 3}, {3, 4} }); // expected-error {{ambiguous}}
one ov2(std::initializer_list<int>); // expected-note {{candidate}}
two ov2(std::initializer_list<C>); // expected-note {{candidate}}
// Worst sequence to int is identity, whereas to C it's user-defined.
static_assert(sizeof(ov2({1, 2, 3})) == sizeof(one), "bad overload");
// But here, user-defined is worst in both cases.
ov2({1, 2, D()}); // expected-error {{ambiguous}}
}
template <typename T>
T deduce(std::initializer_list<T>); // expected-note {{conflicting types for parameter 'T' ('int' vs. 'double')}}
template <typename T>
T deduce_ref(const std::initializer_list<T>&); // expected-note {{conflicting types for parameter 'T' ('int' vs. 'double')}}
void argument_deduction() {
static_assert(same_type<decltype(deduce({1, 2, 3})), int>::value, "bad deduction");
static_assert(same_type<decltype(deduce({1.0, 2.0, 3.0})), double>::value, "bad deduction");
deduce({1, 2.0}); // expected-error {{no matching function}}
static_assert(same_type<decltype(deduce_ref({1, 2, 3})), int>::value, "bad deduction");
static_assert(same_type<decltype(deduce_ref({1.0, 2.0, 3.0})), double>::value, "bad deduction");
deduce_ref({1, 2.0}); // expected-error {{no matching function}}
}
void auto_deduction() {
auto l = {1, 2, 3, 4};
static_assert(same_type<decltype(l), std::initializer_list<int>>::value, "");
auto bl = {1, 2.0}; // expected-error {{cannot deduce}}
for (int i : {1, 2, 3, 4}) {}
}
void dangle() {
new auto{1, 2, 3}; // expected-error {{cannot use list-initialization}}
new std::initializer_list<int>{1, 2, 3}; // expected-warning {{at the end of the full-expression}}
}
struct haslist1 {
std::initializer_list<int> il = {1, 2, 3}; // expected-warning{{at the end of the constructor}}
std::initializer_list<int> jl{1, 2, 3}; // expected-warning{{at the end of the constructor}}
haslist1();
};
haslist1::haslist1()
: il{1, 2, 3} // expected-warning{{at the end of the constructor}}
{}
namespace PR12119 {
// Deduction with nested initializer lists.
template<typename T> void f(std::initializer_list<T>);
template<typename T> void g(std::initializer_list<std::initializer_list<T>>);
void foo() {
f({0, {1}});
g({{0, 1}, {2, 3}});
std::initializer_list<int> il = {1, 2};
g({il, {2, 3}});
}
}
namespace Decay {
template<typename T>
void f(std::initializer_list<T>) {
T x = 1; // expected-error{{cannot initialize a variable of type 'const char *' with an rvalue of type 'int'}}
}
void g() {
f({"A", "BB", "CCC"}); // expected-note{{in instantiation of function template specialization 'Decay::f<const char *>' requested here}}
auto x = { "A", "BB", "CCC" };
std::initializer_list<const char *> *il = &x;
for( auto s : {"A", "BB", "CCC", "DDD"}) { }
}
}
namespace PR12436 {
struct X {
template<typename T>
X(std::initializer_list<int>, T);
};
X x({}, 17);
}
|
