-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy pathMetaProgram.h
323 lines (304 loc) · 9.58 KB
/
MetaProgram.h
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
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
#pragma once
#include "Types.h"
namespace Scan
{
namespace MPL
{
template<typename DestType, typename SrcType>
void assertTypeCast()
{
DestType *p = (SrcType*)0;
}
#define SCAN_ASSERT_TYPECAST(dest, src) (void(*)())Scan::MPL::assertTypeCast<dest, src>
/**
@brief 去掉类型的const修饰符
*/
template<typename T>
struct ToNoConst
{
typedef T Type;
};
template<typename T>
struct ToNoConst<const T>
{
typedef T Type;
};
/**
@brief 容器的特征
*/
template<typename ContainerType, bool reverse>
struct ContainerTraits
{
typedef typename ContainerType::value_type ValueType;
typedef typename ContainerType::iterator IterType;
static IterType begin(ContainerType& c)
{
return c.begin();
}
static IterType end(ContainerType& c)
{
return c.end();
}
static IterType& move(IterType& i, int step = 1)
{
std::advance(i, step);
return i;
}
static uint32 getSize(const ContainerType& conn)
{
return (uint32)conn.size();
}
};
template<typename ContainerType>
struct ContainerTraits<ContainerType, true>
{
typedef typename ContainerType::value_type ValueType;
typedef typename ContainerType::reverse_iterator IterType;
static IterType begin(ContainerType& c)
{
return c.rbegin();
}
static IterType end(ContainerType& c)
{
return c.rend();
}
static IterType& move(IterType& i, int step = 1)
{
std::advance(i, step);
return i;
}
static uint32 getSize(const ContainerType& conn)
{
return (uint32)conn.size();
}
};
template<typename ContainerType>
struct ContainerTraits<const ContainerType, false>
{
typedef typename const ContainerType::value_type ValueType;
typedef typename ContainerType::const_iterator IterType;
static IterType begin(const ContainerType& c)
{
return c.begin();
}
static IterType end(const ContainerType& c)
{
return c.end();
}
static IterType& move(IterType& i, int step = 1)
{
std::advance(i, step);
return i;
}
static uint32 getSize(const ContainerType& conn)
{
return (uint32)conn.size();
}
};
template<typename ContainerType>
struct ContainerTraits<const ContainerType, true>
{
typedef typename const ContainerType::value_type ValueType;
typedef typename ContainerType::const_reverse_iterator IterType;
static IterType begin(const ContainerType& c)
{
return c.rbegin();
}
static IterType end(const ContainerType& c)
{
return c.rend();
}
static IterType& move(IterType& i, int step = 1)
{
std::advance(i, step);
return i;
}
static uint32 getSize(const ContainerType& conn)
{
return (uint32)conn.size();
}
};
template<typename T, int len>
struct ContainerTraits<T[len], false>
{
typedef T* IterType;
typedef T ValueType;
static IterType begin(T (&a)[len])
{
return a;
}
static IterType end(T (&a)[len])
{
return a + len;
}
static IterType& move(IterType& i, int step = 1)
{
i += step;
return i;
}
static uint32 getSize(T(&a)[len])
{
return len;
}
};
template<typename T, int len>
struct ContainerTraits<T[len], true>
{
typedef T* IterType;
typedef T ValueType;
static IterType begin(T (&a)[len])
{
return a + len - 1;
}
static IterType end(T (&a)[len])
{
return a - 1;
}
static IterType& move(IterType& i, int step = 1)
{
i += -step;
return i;
}
static uint32 getSize(T(&a)[len])
{
return len;
}
};
template<typename T, int len>
struct ContainerTraits<const T[len], false>
{
typedef const T* IterType;
typedef const T ValueType;
static IterType begin(const T (&a)[len])
{
return a;
}
static IterType end(const T (&a)[len])
{
return a + len;
}
static IterType& move(IterType& i, int step = 1)
{
i += step;
return i;
}
static uint32 getSize(T(&a)[len])
{
return len;
}
};
template<typename T, int len>
struct ContainerTraits<const T[len], true>
{
typedef const T* IterType;
typedef const T ValueType;
static IterType begin(const T (&a)[len])
{
return a + len - 1;
}
static IterType end(const T (&a)[len])
{
return a - 1;
}
static IterType& move(IterType& i, int step = 1)
{
i += -step;
return i;
}
static uint32 getSize(T(&a)[len])
{
return len;
}
};
// 类型计数器, 辅助类
template<int N> struct DefaultTypeCounter;
/**
@brief 类型到数字的转化
复杂度是currentTypeCount / max(#即256) + (currentTypeCount % max)->转化到4进制后的各位和
*/
template<typename T, template<int> class CounterSet = DefaultTypeCounter, int n = 0>
struct TypeToInt
{
__if_exists(CounterSet<n + 256>)
{
enum { value = TypeToInt<T, CounterSet, n + 257>::value };
}
__if_not_exists(CounterSet<n + 256>)
{
__if_exists(CounterSet<n + 64>)
{
enum { value = TypeToInt<T, CounterSet, n + 65>::value };
}
__if_not_exists(CounterSet<n + 64>)
{
__if_exists(CounterSet<n + 16>)
{
enum { value = TypeToInt<T, CounterSet, n + 17>::value };
}
__if_not_exists(CounterSet<n + 16>)
{
__if_exists(CounterSet<n + 4>)
{
enum { value = TypeToInt<T, CounterSet, n + 5>::value };
}
__if_not_exists(CounterSet<n + 4>)
{
__if_exists(CounterSet<n>)
{
enum { value = TypeToInt<T, CounterSet, n + 1>::value };
}
__if_not_exists(CounterSet<n>)
{
enum { value = n };
typedef CounterSet<n> Type;
}
}
}
}
}
};
// 由于产生了更多的类型, 下面的二分查找算法反而更慢
/* template<int n>
struct Counter;
template<typename T, int min, int max>
struct TypeToIntTween
{
__if_exists(Counter<min + 1>)
{
__if_exists(Counter<(min + max) / 2>)
{
enum { value = TypeToIntTween<T, (min + max) / 2, max>::value };
}
__if_not_exists(Counter<(min + max) / 2>)
{
enum { value = TypeToIntTween<T, min, (min + max) / 2>::value };
}
}
__if_not_exists(Counter<min + 1>)
{
enum { value = min + 1 };
typedef Counter<min + 1> Type;
}
};
template<typename T, int n = 1>
struct TypeToInt
{
__if_exists(Counter<n>)
{
__if_exists(Counter<n * 2>)
{
enum { value = TypeToInt<T, n * 2>::value };
};
__if_not_exists(Counter<n * 2>)
{
enum { value = TypeToIntTween<T, n, n * 2>::value };
}
};
__if_not_exists(Counter<n>)
{
enum { value = n };
typedef Counter<n> Type;
}
};*/
}
}