… | |
… | |
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 | 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 | } |
16 | |
85 | |
17 | // makes dynamically allocated objects zero-initialised |
86 | // makes dynamically allocated objects zero-initialised |
18 | struct zero_initialised |
87 | struct zero_initialised |
19 | { |
88 | { |
20 | void *operator new (size_t s, void *p) |
89 | void *operator new (size_t s, void *p) |
… | |
… | |
120 | { |
189 | { |
121 | p->~Tp (); |
190 | p->~Tp (); |
122 | } |
191 | } |
123 | }; |
192 | }; |
124 | |
193 | |
125 | struct refcounted |
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 |
126 | { |
198 | { |
127 | refcounted () : refcnt (0) { } |
199 | // generator |
128 | // virtual ~refcounted (); |
200 | uint32_t state [4]; |
129 | void refcnt_inc () { ++refcnt; } |
201 | |
130 | void refcnt_dec () { --refcnt; } |
202 | void operator =(const tausworthe_random_generator &src) |
131 | bool dead () { return refcnt == 0; } |
203 | { |
132 | mutable int refcnt; |
204 | state [0] = src.state [0]; |
133 | #if 0 |
205 | state [1] = src.state [1]; |
134 | private: |
206 | state [2] = src.state [2]; |
135 | static refcounted *rc_first; |
207 | state [3] = src.state [3]; |
136 | refcounted *rc_next; |
208 | } |
137 | #endif |
209 | |
|
|
210 | void seed (uint32_t seed); |
|
|
211 | uint32_t next (); |
|
|
212 | |
|
|
213 | // uniform distribution |
|
|
214 | uint32_t operator ()(uint32_t r_max) |
|
|
215 | { |
|
|
216 | return is_constant (r_max) |
|
|
217 | ? this->next () % r_max |
|
|
218 | : get_range (r_max); |
|
|
219 | } |
|
|
220 | |
|
|
221 | // return a number within (min .. max) |
|
|
222 | int operator () (int r_min, int r_max) |
|
|
223 | { |
|
|
224 | return is_constant (r_min) && is_constant (r_max) |
|
|
225 | ? r_min + (*this) (max (r_max - r_min + 1, 1)) |
|
|
226 | : get_range (r_min, r_max); |
|
|
227 | } |
|
|
228 | |
|
|
229 | double operator ()() |
|
|
230 | { |
|
|
231 | return this->next () / (double)0xFFFFFFFFU; |
|
|
232 | } |
|
|
233 | |
|
|
234 | protected: |
|
|
235 | uint32_t get_range (uint32_t r_max); |
|
|
236 | int get_range (int r_min, int r_max); |
138 | }; |
237 | }; |
|
|
238 | |
|
|
239 | typedef tausworthe_random_generator rand_gen; |
|
|
240 | |
|
|
241 | extern rand_gen rndm; |
139 | |
242 | |
140 | template<class T> |
243 | template<class T> |
141 | struct refptr |
244 | struct refptr |
142 | { |
245 | { |
143 | T *p; |
246 | T *p; |
… | |
… | |
166 | T *operator ->() const { return p; } |
269 | T *operator ->() const { return p; } |
167 | |
270 | |
168 | operator T *() const { return p; } |
271 | operator T *() const { return p; } |
169 | }; |
272 | }; |
170 | |
273 | |
171 | typedef refptr<player> player_ptr; |
274 | typedef refptr<maptile> maptile_ptr; |
172 | typedef refptr<object> object_ptr; |
275 | typedef refptr<object> object_ptr; |
173 | typedef refptr<archetype> arch_ptr; |
276 | typedef refptr<archetype> arch_ptr; |
|
|
277 | typedef refptr<client> client_ptr; |
|
|
278 | typedef refptr<player> player_ptr; |
174 | |
279 | |
175 | struct str_hash |
280 | struct str_hash |
176 | { |
281 | { |
177 | std::size_t operator ()(const char *s) const |
282 | std::size_t operator ()(const char *s) const |
178 | { |
283 | { |
… | |
… | |
204 | { |
309 | { |
205 | return !strcmp (a, b); |
310 | return !strcmp (a, b); |
206 | } |
311 | } |
207 | }; |
312 | }; |
208 | |
313 | |
209 | #include <vector> |
|
|
210 | |
|
|
211 | template<class obj> |
314 | template<class T> |
212 | struct unordered_vector : std::vector<obj, slice_allocator<obj> > |
315 | struct unordered_vector : std::vector<T, slice_allocator<T> > |
213 | { |
316 | { |
214 | typedef typename unordered_vector::iterator iterator; |
317 | typedef typename unordered_vector::iterator iterator; |
215 | |
318 | |
216 | void erase (unsigned int pos) |
319 | void erase (unsigned int pos) |
217 | { |
320 | { |
… | |
… | |
225 | { |
328 | { |
226 | erase ((unsigned int )(i - this->begin ())); |
329 | erase ((unsigned int )(i - this->begin ())); |
227 | } |
330 | } |
228 | }; |
331 | }; |
229 | |
332 | |
230 | template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } |
333 | template<class T, int T::* index> |
231 | template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } |
334 | struct object_vector : std::vector<T *, slice_allocator<T *> > |
232 | 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; } |
335 | { |
|
|
336 | void insert (T *obj) |
|
|
337 | { |
|
|
338 | assert (!(obj->*index)); |
|
|
339 | push_back (obj); |
|
|
340 | obj->*index = this->size (); |
|
|
341 | } |
233 | |
342 | |
234 | template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } |
343 | void insert (T &obj) |
|
|
344 | { |
|
|
345 | insert (&obj); |
|
|
346 | } |
|
|
347 | |
|
|
348 | void erase (T *obj) |
|
|
349 | { |
|
|
350 | assert (obj->*index); |
|
|
351 | int pos = obj->*index; |
|
|
352 | obj->*index = 0; |
|
|
353 | |
|
|
354 | if (pos < this->size ()) |
|
|
355 | { |
|
|
356 | (*this)[pos - 1] = (*this)[this->size () - 1]; |
|
|
357 | (*this)[pos - 1]->*index = pos; |
|
|
358 | } |
|
|
359 | |
|
|
360 | this->pop_back (); |
|
|
361 | } |
|
|
362 | |
|
|
363 | void erase (T &obj) |
|
|
364 | { |
|
|
365 | errase (&obj); |
|
|
366 | } |
|
|
367 | }; |
235 | |
368 | |
236 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
369 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
237 | void assign (char *dst, const char *src, int maxlen); |
370 | void assign (char *dst, const char *src, int maxlen); |
238 | |
371 | |
239 | // type-safe version of assign |
372 | // type-safe version of assign |
… | |
… | |
246 | typedef double tstamp; |
379 | typedef double tstamp; |
247 | |
380 | |
248 | // return current time as timestampe |
381 | // return current time as timestampe |
249 | tstamp now (); |
382 | tstamp now (); |
250 | |
383 | |
|
|
384 | int similar_direction (int a, int b); |
|
|
385 | |
251 | #endif |
386 | #endif |
252 | |
387 | |