| … | |
… | |
| 6 | #else |
6 | #else |
| 7 | # define is_constant(c) 0 |
7 | # define is_constant(c) 0 |
| 8 | #endif |
8 | #endif |
| 9 | |
9 | |
| 10 | #include <cstddef> |
10 | #include <cstddef> |
|
|
11 | #include <cmath> |
|
|
12 | #include <new> |
|
|
13 | #include <vector> |
| 11 | |
14 | |
| 12 | #include <glib.h> |
15 | #include <glib.h> |
|
|
16 | |
|
|
17 | #include <shstr.h> |
|
|
18 | #include <traits.h> |
| 13 | |
19 | |
| 14 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
20 | // use a gcc extension for auto declarations until ISO C++ sanctifies them |
| 15 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
21 | #define AUTODECL(var,expr) typeof(expr) var = (expr) |
|
|
22 | |
|
|
23 | // very ugly macro that basicaly declares and initialises a variable |
|
|
24 | // that is in scope for the next statement only |
|
|
25 | // works only for stuff that can be assigned 0 and converts to false |
|
|
26 | // (note: works great for pointers) |
|
|
27 | // most ugly macro I ever wrote |
|
|
28 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
|
|
29 | |
|
|
30 | // in range including end |
|
|
31 | #define IN_RANGE_INC(val,beg,end) \ |
|
|
32 | ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) |
|
|
33 | |
|
|
34 | // in range excluding end |
|
|
35 | #define IN_RANGE_EXC(val,beg,end) \ |
|
|
36 | ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) |
|
|
37 | |
|
|
38 | void fork_abort (const char *msg); |
|
|
39 | |
|
|
40 | // this is much faster than crossfires original algorithm |
|
|
41 | // on modern cpus |
|
|
42 | inline int |
|
|
43 | isqrt (int n) |
|
|
44 | { |
|
|
45 | return (int)sqrtf ((float)n); |
|
|
46 | } |
|
|
47 | |
|
|
48 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
|
|
49 | #if 0 |
|
|
50 | // and has a max. error of 6 in the range -100..+100. |
|
|
51 | #else |
|
|
52 | // and has a max. error of 9 in the range -100..+100. |
|
|
53 | #endif |
|
|
54 | inline int |
|
|
55 | idistance (int dx, int dy) |
|
|
56 | { |
|
|
57 | unsigned int dx_ = abs (dx); |
|
|
58 | unsigned int dy_ = abs (dy); |
|
|
59 | |
|
|
60 | #if 0 |
|
|
61 | return dx_ > dy_ |
|
|
62 | ? (dx_ * 61685 + dy_ * 26870) >> 16 |
|
|
63 | : (dy_ * 61685 + dx_ * 26870) >> 16; |
|
|
64 | #else |
|
|
65 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
|
|
66 | #endif |
|
|
67 | } |
|
|
68 | |
|
|
69 | /* |
|
|
70 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
71 | * the "absolute" direction of a number (it actually takes care of |
|
|
72 | * "overflow" in previous calculations of a direction). |
|
|
73 | */ |
|
|
74 | inline int |
|
|
75 | absdir (int d) |
|
|
76 | { |
|
|
77 | return ((d - 1) & 7) + 1; |
|
|
78 | } |
| 16 | |
79 | |
| 17 | // makes dynamically allocated objects zero-initialised |
80 | // makes dynamically allocated objects zero-initialised |
| 18 | struct zero_initialised |
81 | struct zero_initialised |
| 19 | { |
82 | { |
| 20 | void *operator new (size_t s, void *p) |
83 | void *operator new (size_t s, void *p) |
| … | |
… | |
| 191 | { |
254 | { |
| 192 | return !strcmp (a, b); |
255 | return !strcmp (a, b); |
| 193 | } |
256 | } |
| 194 | }; |
257 | }; |
| 195 | |
258 | |
| 196 | #include <vector> |
|
|
| 197 | |
|
|
| 198 | template<class obj> |
259 | template<class T> |
| 199 | struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
260 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
| 200 | { |
261 | { |
| 201 | typedef typename unordered_vector::iterator iterator; |
262 | typedef typename unordered_vector::iterator iterator; |
| 202 | |
263 | |
| 203 | void erase (unsigned int pos) |
264 | void erase (unsigned int pos) |
| 204 | { |
265 | { |
| … | |
… | |
| 209 | } |
270 | } |
| 210 | |
271 | |
| 211 | void erase (iterator i) |
272 | void erase (iterator i) |
| 212 | { |
273 | { |
| 213 | erase ((unsigned int )(i - this->begin ())); |
274 | erase ((unsigned int )(i - this->begin ())); |
|
|
275 | } |
|
|
276 | }; |
|
|
277 | |
|
|
278 | template<class T, int T::* index> |
|
|
279 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
|
|
280 | { |
|
|
281 | void insert (T *obj) |
|
|
282 | { |
|
|
283 | assert (!(obj->*index)); |
|
|
284 | push_back (obj); |
|
|
285 | obj->*index = this->size (); |
|
|
286 | } |
|
|
287 | |
|
|
288 | void insert (T &obj) |
|
|
289 | { |
|
|
290 | insert (&obj); |
|
|
291 | } |
|
|
292 | |
|
|
293 | void erase (T *obj) |
|
|
294 | { |
|
|
295 | assert (obj->*index); |
|
|
296 | int pos = obj->*index; |
|
|
297 | obj->*index = 0; |
|
|
298 | |
|
|
299 | if (pos < this->size ()) |
|
|
300 | { |
|
|
301 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
|
|
302 | (*this)[pos - 1]->*index = pos; |
|
|
303 | } |
|
|
304 | |
|
|
305 | this->pop_back (); |
|
|
306 | } |
|
|
307 | |
|
|
308 | void erase (T &obj) |
|
|
309 | { |
|
|
310 | errase (&obj); |
| 214 | } |
311 | } |
| 215 | }; |
312 | }; |
| 216 | |
313 | |
| 217 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
314 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
| 218 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
315 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
| … | |
… | |
| 233 | typedef double tstamp; |
330 | typedef double tstamp; |
| 234 | |
331 | |
| 235 | // return current time as timestampe |
332 | // return current time as timestampe |
| 236 | tstamp now (); |
333 | tstamp now (); |
| 237 | |
334 | |
|
|
335 | int similar_direction (int a, int b); |
|
|
336 | |
| 238 | #endif |
337 | #endif |
| 239 | |
338 | |
