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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
|
//
// immer: immutable data structures for C++
// Copyright (C) 2016, 2017, 2018 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#pragma once
#include <type_traits>
#if defined(__GNUC__) && __GNUC__ == 7 && __GNUC_MINOR__ == 1
#define IMMER_BROKEN_STANDARD_LAYOUT_DETECTION 1
#define immer_offsetof(st, m) ((std::size_t) & (((st*) 0)->m))
#else
#define IMMER_BROKEN_STANDARD_LAYOUT_DETECTION 0
#define immer_offsetof offsetof
#endif
namespace immer {
namespace detail {
//
// Metafunction that returns a standard layout struct that combines
// all the standard layout types in `Ts...`, while making sure that
// empty base optimizations are used.
//
// To query a part of the type do `get<my_part>(x)`;
//
// This is useful when putting together a type that merges various
// types coming from different policies. Some of them might be empty,
// so we shall enable empty base optimizations. But if we just
// inherit from all of them, we would break the "standard layout"
// rules, preventing us from using `offseof(...)`. So metafunction
// will generate the type by sometimes inheriting, sometimes adding as
// member.
//
// Note that the types are added to the combined type from right to
// left!
//
template <typename... Ts>
struct combine_standard_layout;
template <typename... Ts>
using combine_standard_layout_t = typename combine_standard_layout<Ts...>::type;
namespace csl {
template <typename T>
struct type_t
{};
template <typename U, typename T>
U& get(T& x);
template <typename U, typename T>
const U& get(const T& x);
template <typename T, typename Next = void>
struct inherit
{
struct type
: T
, Next
{
using Next::get_;
template <typename U>
friend decltype(auto) get(type& x)
{
return x.get_(type_t<U>{});
}
template <typename U>
friend decltype(auto) get(const type& x)
{
return x.get_(type_t<U>{});
}
T& get_(type_t<T>) { return *this; }
const T& get_(type_t<T>) const { return *this; }
};
};
template <typename T>
struct inherit<T, void>
{
struct type : T
{
template <typename U>
friend decltype(auto) get(type& x)
{
return x.get_(type_t<U>{});
}
template <typename U>
friend decltype(auto) get(const type& x)
{
return x.get_(type_t<U>{});
}
T& get_(type_t<T>) { return *this; }
const T& get_(type_t<T>) const { return *this; }
};
};
template <typename T, typename Next = void>
struct member
{
struct type : Next
{
T d;
using Next::get_;
template <typename U>
friend decltype(auto) get(type& x)
{
return x.get_(type_t<U>{});
}
template <typename U>
friend decltype(auto) get(const type& x)
{
return x.get_(type_t<U>{});
}
T& get_(type_t<T>) { return d; }
const T& get_(type_t<T>) const { return d; }
};
};
template <typename T>
struct member<T, void>
{
struct type
{
T d;
template <typename U>
friend decltype(auto) get(type& x)
{
return x.get_(type_t<U>{});
}
template <typename U>
friend decltype(auto) get(const type& x)
{
return x.get_(type_t<U>{});
}
T& get_(type_t<T>) { return d; }
const T& get_(type_t<T>) const { return d; }
};
};
template <typename T, typename Next>
struct member_two
{
struct type
{
Next n;
T d;
template <typename U>
friend decltype(auto) get(type& x)
{
return x.get_(type_t<U>{});
}
template <typename U>
friend decltype(auto) get(const type& x)
{
return x.get_(type_t<U>{});
}
T& get_(type_t<T>) { return d; }
const T& get_(type_t<T>) const { return d; }
template <typename U>
auto get_(type_t<U> t) -> decltype(auto)
{
return n.get_(t);
}
template <typename U>
auto get_(type_t<U> t) const -> decltype(auto)
{
return n.get_(t);
}
};
};
template <typename... Ts>
struct combine_standard_layout_aux;
template <typename T>
struct combine_standard_layout_aux<T>
{
static_assert(std::is_standard_layout<T>::value, "");
using type = typename std::conditional_t<std::is_empty<T>::value,
csl::inherit<T>,
csl::member<T>>::type;
};
template <typename T, typename... Ts>
struct combine_standard_layout_aux<T, Ts...>
{
static_assert(std::is_standard_layout<T>::value, "");
using this_t = T;
using next_t = typename combine_standard_layout_aux<Ts...>::type;
static constexpr auto empty_this = std::is_empty<this_t>::value;
static constexpr auto empty_next = std::is_empty<next_t>::value;
using type = typename std::conditional_t<
empty_this,
inherit<this_t, next_t>,
std::conditional_t<empty_next,
member<this_t, next_t>,
member_two<this_t, next_t>>>::type;
};
} // namespace csl
using csl::get;
template <typename... Ts>
struct combine_standard_layout
{
using type = typename csl::combine_standard_layout_aux<Ts...>::type;
#if !IMMER_BROKEN_STANDARD_LAYOUT_DETECTION
static_assert(std::is_standard_layout<type>::value, "");
#endif
};
} // namespace detail
} // namespace immer
|
