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
|
template <typename T, size_t N>
class vec_t {
template<size_t index, typename... U>
void load_from_args(void)
{
static_assert(index < N + 1, "too many elements in the initializer");
static_assert(index > N - 1, "too few elements in the initializer");
}
template<size_t index, typename... U>
void load_from_args(T first, U... rest)
{
v[index] = first;
load_from_args<index + 1>(rest...);
}
public:
T v[N];
// Basic operations
vec_t() = default;
template<typename... U>
vec_t(T first, U... rest)
{
load_from_args<0>(first, rest...);
}
template<typename U>
vec_t(vec_t<U, N> b)
{
for (size_t i = 0; i < N; i++)
v[i] = (T)b[i];
}
T& operator[](size_t i)
{
return v[i];
}
const T& operator[](size_t i) const
{
return v[i];
}
void broadcast(T x)
{
for (size_t i = 0; i < N; i++)
v[i] = x;
}
// Comparison
friend bool operator==(const vec_t<T, N> &a, const vec_t<T, N> &b)
{
for (size_t i = 0; i < N; i++)
if (a[i] != b[i])
return false;
return true;
}
// Good enough for maps or sets.
friend bool operator<(const vec_t<T, N> &a, const vec_t<T, N> &b)
{
for (size_t i = 0; i < N; i++) {
if (a[i] < b[i])
return true;
else if (a[i] > b[i])
return false;
}
return false;
}
// Arithmetics
friend vec_t<T, N> operator+(const vec_t<T, N> &v)
{
return v;
}
friend vec_t<T, N> operator+(const vec_t<T, N> &a, const vec_t<T, N> &b)
{
vec_t<T, N> r;
for (size_t i = 0; i < N; i++)
r[i] = a[i] + b[i];
return r;
}
friend vec_t<T, N> &operator+=(vec_t<T, N> &v, const vec_t<T, N> &b)
{
for (size_t i = 0; i < N; i++)
v[i] += b[i];
return v;
}
friend vec_t<T, N> operator-(const vec_t<T, N> &v)
{
return -1 * v;
}
friend vec_t<T, N> operator-(const vec_t<T, N> &a, const vec_t<T, N> &b)
{
vec_t<T, N> r;
for (size_t i = 0; i < N; i++)
r[i] = a[i] - b[i];
return r;
}
friend vec_t<T, N> &operator-=(vec_t<T, N> &v, const vec_t<T, N> &b)
{
for (size_t i = 0; i < N; i++)
v[i] -= b[i];
return v;
}
friend T operator*(const vec_t<T, N> &a, const vec_t<T, N> &b)
{
T r = (T)0;
for (size_t i = 0; i < N; i++)
r += a[i] * b[i];
return r;
}
friend vec_t<T, N> operator*(const vec_t<T, N> &a, const T &b)
{
vec_t<T, N> r;
for (size_t i = 0; i < N; i++)
r[i] = a[i] * b;
return r;
}
friend vec_t<T, N> operator*(const T &b, const vec_t<T, N> &a)
{
return a * b;
}
friend vec_t<T, N> &operator*=(vec_t<T, N> &v, const T &b)
{
for (size_t i = 0; i < N; i++)
v[i] *= b;
return v;
}
friend vec_t<T, N> operator/(const vec_t<T, N> &a, const T &b)
{
vec_t<T, N> r;
for (size_t i = 0; i < N; i++)
r[i] = a[i] / b;
return r;
}
friend vec_t<T, N> operator/(const T &b, const vec_t<T, N> &a)
{
return a / b;
}
friend vec_t<T, N> &operator/=(vec_t<T, N> &v, const T &b)
{
for (size_t i = 0; i < N; i++)
v[i] /= b;
return v;
}
vec_t<T, N> floor(void)
{
vec_t<T, N> r;
for (size_t i = 0; i < N; i++)
r[i] = std::floor(v[i]);
return r;
}
T len(void)
{
return std::sqrt(*this * *this);
}
T angle(void)
{
static_assert(N == 2, "angle called for a vector that's not 2-dimensional");
return atan2(v[1], v[0]);
}
// Compatibility with SFML
template <typename U>
operator sf::Vector2<U>() const
{
static_assert(N == 2, "conversion of vec_t with N != 2 to sf::Vector2");
return sf::Vector2<U>((U)v[0], (U)v[1]);
}
template <typename U>
vec_t(sf::Vector2<U> b)
{
static_assert(N == 2, "conversion of sf::Vector2 to vec_t with N != 2");
v[0] = b.x;
v[1] = b.y;
}
// Compatibility with iostream
friend std::ostream& operator<<(std::ostream& stream, vec_t<T, N> v)
{
stream << "(";
for (size_t i = 0; i < N; i++) {
if (i)
stream << ", ";
stream << v.v[i];
}
stream << ")";
return stream;
}
};
template <typename T, size_t N>
class rect_t {
public:
vec_t<T, N> v[2];
rect_t() = default;
rect_t(vec_t<T, N> a, vec_t<T, N> b)
{
v[0] = a;
v[1] = b;
}
vec_t<T, N>& operator[](size_t i)
{
return v[i];
}
const vec_t<T, N>& operator[](size_t i) const
{
return v[i];
}
bool intersects(const rect_t<T, N> &b) const
{
for (size_t i = 0; i < N; i++)
if (v[1][i] < b[0][i] || v[0][i] > b[1][i])
return false;
return true;
}
T dim(size_t i) const
{
return v[1][i] - v[0][i];
}
friend rect_t<T, N> operator+(const rect_t<T, N> &a, const rect_t<T, N> &b)
{
rect_t r;
r[0][0] = std::min(a[0][0], b[0][0]);
r[0][1] = std::min(a[0][1], b[0][1]);
r[1][0] = std::max(a[1][0], b[1][0]);
r[1][1] = std::max(a[1][1], b[1][1]);
return r;
}
friend std::ostream& operator<<(std::ostream& stream, rect_t<T, N> r)
{
stream << "(" << r[0] << " x " << r[1] << ")";
return stream;
}
};
// Shorthands
typedef vec_t<float, 2> v2f_t;
typedef vec_t<double, 2> v2d_t;
typedef rect_t<float, 2> rectf_t;
typedef rect_t<double, 2> rectd_t;
|
