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
|
// included by utils.hpp as a porting aid.
// Eventually it will be promoted to one or more normal headers.
#include <iterator>
#include <type_traits>
template<class T, class E, E max>
struct earray
{
// no ctor/dtor and one public member variable for easy initialization
T _data[size_t(max)];
T& operator[](E v)
{
return _data[size_t(v)];
}
const T& operator[](E v) const
{
return _data[size_t(v)];
}
T *begin()
{
return _data;
}
T *end()
{
return _data + size_t(max);
}
};
template<class T, class E>
class eptr
{
T *_data;
public:
eptr(decltype(nullptr)=nullptr)
: _data(nullptr)
{}
template<E max>
eptr(earray<T, E, max>& arr)
: _data(arr._data)
{}
T& operator [](E v)
{
return _data[size_t(v)];
}
explicit operator bool()
{
return _data;
}
bool operator not()
{
return not _data;
}
};
template<class It>
class IteratorPair
{
It _b, _e;
public:
IteratorPair(It b, It e)
: _b(b), _e(e)
{}
It begin() { return _b; }
It end() { return _e; }
};
template<class It>
IteratorPair<It> iterator_pair(It b, It e)
{
return {b, e};
}
// std::underlying_type isn't supported until gcc 4.7
// this is a poor man's emulation
template<class E>
struct underlying_type
{
static_assert(std::is_enum<E>::value, "Only enums have underlying type!");
typedef typename std::conditional<
std::is_signed<E>::value,
typename std::make_signed<E>::type,
typename std::make_unsigned<E>::type
>::type type;
};
template<class E, bool=std::is_enum<E>::value>
struct remove_enum
{
typedef E type;
};
template<class E>
struct remove_enum<E, true>
{
typedef typename underlying_type<E>::type type;
};
#define ENUM_BITWISE_OPERATORS(E) \
inline \
E operator & (E l, E r) \
{ \
typedef typename underlying_type<E>::type U;\
return E(U(l) & U(r)); \
} \
inline \
E operator | (E l, E r) \
{ \
typedef typename underlying_type<E>::type U;\
return E(U(l) | U(r)); \
} \
inline \
E operator ^ (E l, E r) \
{ \
typedef typename underlying_type<E>::type U;\
return E(U(l) ^ U(r)); \
} \
inline \
E& operator &= (E& l, E r) \
{ \
return l = l & r; \
} \
inline \
E& operator |= (E& l, E r) \
{ \
return l = l | r; \
} \
inline \
E& operator ^= (E& l, E r) \
{ \
return l = l ^ r; \
} \
inline \
E operator ~ (E r) \
{ \
return E(-1) ^ r; \
}
template<class E>
class EnumValueIterator
{
typedef typename underlying_type<E>::type U;
E value;
public:
EnumValueIterator(E v)
: value(v)
{}
E operator *()
{
return value;
}
EnumValueIterator& operator++ ()
{
value = E(U(value) + 1);
return *this;
}
EnumValueIterator& operator-- ()
{
value = E(U(value) - 1);
return *this;
}
friend bool operator == (EnumValueIterator l, EnumValueIterator r)
{
return l.value == r.value;
}
friend bool operator != (EnumValueIterator l, EnumValueIterator r)
{
return !(l == r);
}
};
template<class E>
IteratorPair<EnumValueIterator<E>> erange(E b, E e)
{
return {b, e};
}
namespace std { namespace placeholders {} }
namespace ph = std::placeholders;
template<class A, class B>
typename std::common_type<A, B>::type min(A a, B b)
{
return a < b ? a : b;
}
template<class A, class B>
typename std::common_type<A, B>::type max(A a, B b)
{
return b < a ? a : b;
}
|
