| … | |
… | |
| 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> |
| 11 | #include <new> |
12 | #include <new> |
| 12 | #include <vector> |
13 | #include <vector> |
| 13 | |
14 | |
| 14 | #include <glib.h> |
15 | #include <glib.h> |
| 15 | |
16 | |
| … | |
… | |
| 23 | // that is in scope for the next statement only |
24 | // that is in scope for the next statement only |
| 24 | // works only for stuff that can be assigned 0 and converts to false |
25 | // works only for stuff that can be assigned 0 and converts to false |
| 25 | // (note: works great for pointers) |
26 | // (note: works great for pointers) |
| 26 | // most ugly macro I ever wrote |
27 | // most ugly macro I ever wrote |
| 27 | #define declvar(type, name, value) if (type name = 0) { } else if (((name) = (value)), 1) |
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 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
|
|
41 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
|
|
42 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
|
|
43 | |
|
|
44 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
45 | |
|
|
46 | // this is much faster than crossfires original algorithm |
|
|
47 | // on modern cpus |
|
|
48 | inline int |
|
|
49 | isqrt (int n) |
|
|
50 | { |
|
|
51 | return (int)sqrtf ((float)n); |
|
|
52 | } |
|
|
53 | |
|
|
54 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
|
|
55 | #if 0 |
|
|
56 | // and has a max. error of 6 in the range -100..+100. |
|
|
57 | #else |
|
|
58 | // and has a max. error of 9 in the range -100..+100. |
|
|
59 | #endif |
|
|
60 | inline int |
|
|
61 | idistance (int dx, int dy) |
|
|
62 | { |
|
|
63 | unsigned int dx_ = abs (dx); |
|
|
64 | unsigned int dy_ = abs (dy); |
|
|
65 | |
|
|
66 | #if 0 |
|
|
67 | return dx_ > dy_ |
|
|
68 | ? (dx_ * 61685 + dy_ * 26870) >> 16 |
|
|
69 | : (dy_ * 61685 + dx_ * 26870) >> 16; |
|
|
70 | #else |
|
|
71 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
|
|
72 | #endif |
|
|
73 | } |
|
|
74 | |
|
|
75 | /* |
|
|
76 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
77 | * the "absolute" direction of a number (it actually takes care of |
|
|
78 | * "overflow" in previous calculations of a direction). |
|
|
79 | */ |
|
|
80 | inline int |
|
|
81 | absdir (int d) |
|
|
82 | { |
|
|
83 | return ((d - 1) & 7) + 1; |
|
|
84 | } |
| 28 | |
85 | |
| 29 | // makes dynamically allocated objects zero-initialised |
86 | // makes dynamically allocated objects zero-initialised |
| 30 | struct zero_initialised |
87 | struct zero_initialised |
| 31 | { |
88 | { |
| 32 | void *operator new (size_t s, void *p) |
89 | void *operator new (size_t s, void *p) |
| … | |
… | |
| 131 | void destroy (pointer p) |
188 | void destroy (pointer p) |
| 132 | { |
189 | { |
| 133 | p->~Tp (); |
190 | p->~Tp (); |
| 134 | } |
191 | } |
| 135 | }; |
192 | }; |
|
|
193 | |
|
|
194 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
|
|
195 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
|
|
196 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
197 | struct tausworthe_random_generator |
|
|
198 | { |
|
|
199 | uint32_t state [4]; |
|
|
200 | |
|
|
201 | tausworthe_random_generator (uint32_t seed); |
|
|
202 | uint32_t next (); |
|
|
203 | |
|
|
204 | uint32_t operator ()(uint32_t r_max) |
|
|
205 | { |
|
|
206 | return next () % r_max; |
|
|
207 | } |
|
|
208 | |
|
|
209 | // return a number within (min .. max) |
|
|
210 | int operator () (int r_min, int r_max) |
|
|
211 | { |
|
|
212 | return r_min + next () % max (r_max - r_min + 1, 1); |
|
|
213 | } |
|
|
214 | |
|
|
215 | double operator ()() |
|
|
216 | { |
|
|
217 | return next () / (double)0xFFFFFFFFU; |
|
|
218 | } |
|
|
219 | }; |
|
|
220 | |
|
|
221 | typedef tausworthe_random_generator rand_gen; |
|
|
222 | |
|
|
223 | extern rand_gen rndm; |
| 136 | |
224 | |
| 137 | template<class T> |
225 | template<class T> |
| 138 | struct refptr |
226 | struct refptr |
| 139 | { |
227 | { |
| 140 | T *p; |
228 | T *p; |
| … | |
… | |
| 258 | { |
346 | { |
| 259 | errase (&obj); |
347 | errase (&obj); |
| 260 | } |
348 | } |
| 261 | }; |
349 | }; |
| 262 | |
350 | |
| 263 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
|
|
| 264 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
|
|
| 265 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; } |
|
|
| 266 | |
|
|
| 267 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
| 268 | |
|
|
| 269 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
351 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
| 270 | void assign (char *dst, const char *src, int maxlen); |
352 | void assign (char *dst, const char *src, int maxlen); |
| 271 | |
353 | |
| 272 | // type-safe version of assign |
354 | // type-safe version of assign |
| 273 | template<int N> |
355 | template<int N> |
