| … | |
… | |
| 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 | // rationale for using (U) not (T) is to reduce signed/unsigned issues, |
|
|
41 | // as a is often a constant while b is the variable. it is still a bug, though. |
|
|
42 | template<typename T, typename U> static inline T min (T a, U b) { return (U)a < b ? (U)a : b; } |
|
|
43 | template<typename T, typename U> static inline T max (T a, U b) { return (U)a > b ? (U)a : b; } |
|
|
44 | template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? (T)a : v >(T)b ? (T)b : v; } |
|
|
45 | |
|
|
46 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
|
|
47 | |
|
|
48 | // this is much faster than crossfires original algorithm |
|
|
49 | // on modern cpus |
|
|
50 | inline int |
|
|
51 | isqrt (int n) |
|
|
52 | { |
|
|
53 | return (int)sqrtf ((float)n); |
|
|
54 | } |
|
|
55 | |
|
|
56 | // this is only twice as fast as naive sqrtf (dx*dy+dy*dy) |
|
|
57 | #if 0 |
|
|
58 | // and has a max. error of 6 in the range -100..+100. |
|
|
59 | #else |
|
|
60 | // and has a max. error of 9 in the range -100..+100. |
|
|
61 | #endif |
|
|
62 | inline int |
|
|
63 | idistance (int dx, int dy) |
|
|
64 | { |
|
|
65 | unsigned int dx_ = abs (dx); |
|
|
66 | unsigned int dy_ = abs (dy); |
|
|
67 | |
|
|
68 | #if 0 |
|
|
69 | return dx_ > dy_ |
|
|
70 | ? (dx_ * 61685 + dy_ * 26870) >> 16 |
|
|
71 | : (dy_ * 61685 + dx_ * 26870) >> 16; |
|
|
72 | #else |
|
|
73 | return dx_ + dy_ - min (dx_, dy_) * 5 / 8; |
|
|
74 | #endif |
|
|
75 | } |
|
|
76 | |
|
|
77 | /* |
|
|
78 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
79 | * the "absolute" direction of a number (it actually takes care of |
|
|
80 | * "overflow" in previous calculations of a direction). |
|
|
81 | */ |
|
|
82 | inline int |
|
|
83 | absdir (int d) |
|
|
84 | { |
|
|
85 | return ((d - 1) & 7) + 1; |
|
|
86 | } |
| 16 | |
87 | |
| 17 | // makes dynamically allocated objects zero-initialised |
88 | // makes dynamically allocated objects zero-initialised |
| 18 | struct zero_initialised |
89 | struct zero_initialised |
| 19 | { |
90 | { |
| 20 | void *operator new (size_t s, void *p) |
91 | void *operator new (size_t s, void *p) |
| … | |
… | |
| 120 | { |
191 | { |
| 121 | p->~Tp (); |
192 | p->~Tp (); |
| 122 | } |
193 | } |
| 123 | }; |
194 | }; |
| 124 | |
195 | |
| 125 | struct refcounted |
196 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
|
|
197 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
|
|
198 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
199 | struct tausworthe_random_generator |
| 126 | { |
200 | { |
| 127 | refcounted () : refcnt (0) { } |
201 | // generator |
| 128 | // virtual ~refcounted (); |
202 | uint32_t state [4]; |
| 129 | void refcnt_inc () { ++refcnt; } |
203 | |
| 130 | void refcnt_dec () { --refcnt; } |
204 | void operator =(const tausworthe_random_generator &src) |
| 131 | bool dead () { return refcnt == 0; } |
205 | { |
| 132 | mutable int refcnt; |
206 | state [0] = src.state [0]; |
| 133 | #if 0 |
207 | state [1] = src.state [1]; |
| 134 | private: |
208 | state [2] = src.state [2]; |
| 135 | static refcounted *rc_first; |
209 | state [3] = src.state [3]; |
| 136 | refcounted *rc_next; |
210 | } |
| 137 | #endif |
211 | |
|
|
212 | void seed (uint32_t seed); |
|
|
213 | uint32_t next (); |
|
|
214 | |
|
|
215 | // uniform distribution |
|
|
216 | uint32_t operator ()(uint32_t r_max) |
|
|
217 | { |
|
|
218 | return is_constant (r_max) |
|
|
219 | ? this->next () % r_max |
|
|
220 | : get_range (r_max); |
|
|
221 | } |
|
|
222 | |
|
|
223 | // return a number within (min .. max) |
|
|
224 | int operator () (int r_min, int r_max) |
|
|
225 | { |
|
|
226 | return is_constant (r_min) && is_constant (r_max) |
|
|
227 | ? r_min + (*this) (max (r_max - r_min + 1, 1)) |
|
|
228 | : get_range (r_min, r_max); |
|
|
229 | } |
|
|
230 | |
|
|
231 | double operator ()() |
|
|
232 | { |
|
|
233 | return this->next () / (double)0xFFFFFFFFU; |
|
|
234 | } |
|
|
235 | |
|
|
236 | protected: |
|
|
237 | uint32_t get_range (uint32_t r_max); |
|
|
238 | int get_range (int r_min, int r_max); |
| 138 | }; |
239 | }; |
|
|
240 | |
|
|
241 | typedef tausworthe_random_generator rand_gen; |
|
|
242 | |
|
|
243 | extern rand_gen rndm; |
| 139 | |
244 | |
| 140 | template<class T> |
245 | template<class T> |
| 141 | struct refptr |
246 | struct refptr |
| 142 | { |
247 | { |
| 143 | T *p; |
248 | T *p; |
| … | |
… | |
| 165 | T &operator * () const { return *p; } |
270 | T &operator * () const { return *p; } |
| 166 | T *operator ->() const { return p; } |
271 | T *operator ->() const { return p; } |
| 167 | |
272 | |
| 168 | operator T *() const { return p; } |
273 | operator T *() const { return p; } |
| 169 | }; |
274 | }; |
|
|
275 | |
|
|
276 | typedef refptr<maptile> maptile_ptr; |
|
|
277 | typedef refptr<object> object_ptr; |
|
|
278 | typedef refptr<archetype> arch_ptr; |
|
|
279 | typedef refptr<client> client_ptr; |
|
|
280 | typedef refptr<player> player_ptr; |
| 170 | |
281 | |
| 171 | struct str_hash |
282 | struct str_hash |
| 172 | { |
283 | { |
| 173 | std::size_t operator ()(const char *s) const |
284 | std::size_t operator ()(const char *s) const |
| 174 | { |
285 | { |
| … | |
… | |
| 200 | { |
311 | { |
| 201 | return !strcmp (a, b); |
312 | return !strcmp (a, b); |
| 202 | } |
313 | } |
| 203 | }; |
314 | }; |
| 204 | |
315 | |
| 205 | #include <vector> |
|
|
| 206 | |
|
|
| 207 | template<class obj> |
316 | template<class T> |
| 208 | struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
317 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
| 209 | { |
318 | { |
| 210 | typedef typename unordered_vector::iterator iterator; |
319 | typedef typename unordered_vector::iterator iterator; |
| 211 | |
320 | |
| 212 | void erase (unsigned int pos) |
321 | void erase (unsigned int pos) |
| 213 | { |
322 | { |
| … | |
… | |
| 221 | { |
330 | { |
| 222 | erase ((unsigned int )(i - this->begin ())); |
331 | erase ((unsigned int )(i - this->begin ())); |
| 223 | } |
332 | } |
| 224 | }; |
333 | }; |
| 225 | |
334 | |
| 226 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
335 | template<class T, int T::* index> |
| 227 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
336 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
| 228 | 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; } |
337 | { |
|
|
338 | void insert (T *obj) |
|
|
339 | { |
|
|
340 | assert (!(obj->*index)); |
|
|
341 | push_back (obj); |
|
|
342 | obj->*index = this->size (); |
|
|
343 | } |
| 229 | |
344 | |
| 230 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
345 | void insert (T &obj) |
|
|
346 | { |
|
|
347 | insert (&obj); |
|
|
348 | } |
|
|
349 | |
|
|
350 | void erase (T *obj) |
|
|
351 | { |
|
|
352 | assert (obj->*index); |
|
|
353 | int pos = obj->*index; |
|
|
354 | obj->*index = 0; |
|
|
355 | |
|
|
356 | if (pos < this->size ()) |
|
|
357 | { |
|
|
358 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
|
|
359 | (*this)[pos - 1]->*index = pos; |
|
|
360 | } |
|
|
361 | |
|
|
362 | this->pop_back (); |
|
|
363 | } |
|
|
364 | |
|
|
365 | void erase (T &obj) |
|
|
366 | { |
|
|
367 | errase (&obj); |
|
|
368 | } |
|
|
369 | }; |
| 231 | |
370 | |
| 232 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
371 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
| 233 | void assign (char *dst, const char *src, int maxlen); |
372 | void assign (char *dst, const char *src, int maxlen); |
| 234 | |
373 | |
| 235 | // type-safe version of assign |
374 | // type-safe version of assign |
| … | |
… | |
| 242 | typedef double tstamp; |
381 | typedef double tstamp; |
| 243 | |
382 | |
| 244 | // return current time as timestampe |
383 | // return current time as timestampe |
| 245 | tstamp now (); |
384 | tstamp now (); |
| 246 | |
385 | |
|
|
386 | int similar_direction (int a, int b); |
|
|
387 | |
| 247 | #endif |
388 | #endif |
| 248 | |
389 | |
