| … | |
… | |
| 55 | #endif |
55 | #endif |
| 56 | |
56 | |
| 57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
57 | // use C0X decltype for auto declarations until ISO C++ sanctifies them (if ever) |
| 58 | #define auto(var,expr) decltype(expr) var = (expr) |
58 | #define auto(var,expr) decltype(expr) var = (expr) |
| 59 | |
59 | |
|
|
60 | #if cplusplus_does_not_suck |
|
|
61 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
|
|
62 | template<typename T, int N> |
|
|
63 | static inline int array_length (const T (&arr)[N]) |
|
|
64 | { |
|
|
65 | return N; |
|
|
66 | } |
|
|
67 | #else |
|
|
68 | #define array_length(name) (sizeof (name) / sizeof (name [0])) |
|
|
69 | #endif |
|
|
70 | |
| 60 | // very ugly macro that basically declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
| 61 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
| 62 | // works only for stuff that can be assigned 0 and converts to false |
73 | // works only for stuff that can be assigned 0 and converts to false |
| 63 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
| 64 | // most ugly macro I ever wrote |
75 | // most ugly macro I ever wrote |
| … | |
… | |
| 93 | // sign returns -1 or +1 |
104 | // sign returns -1 or +1 |
| 94 | template<typename T> |
105 | template<typename T> |
| 95 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
106 | static inline T sign (T v) { return v < 0 ? -1 : +1; } |
| 96 | // relies on 2c representation |
107 | // relies on 2c representation |
| 97 | template<> |
108 | template<> |
| 98 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
109 | inline sint8 sign (sint8 v) { return 1 - (sint8 (uint8 (v) >> 7) * 2); } |
|
|
110 | template<> |
|
|
111 | inline sint16 sign (sint16 v) { return 1 - (sint16 (uint16 (v) >> 15) * 2); } |
|
|
112 | template<> |
|
|
113 | inline sint32 sign (sint32 v) { return 1 - (sint32 (uint32 (v) >> 31) * 2); } |
| 99 | |
114 | |
| 100 | // sign0 returns -1, 0 or +1 |
115 | // sign0 returns -1, 0 or +1 |
| 101 | template<typename T> |
116 | template<typename T> |
| 102 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
117 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
| 103 | |
118 | |
| … | |
… | |
| 108 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
| 109 | template<typename T> static inline T div (T val, T div) |
124 | template<typename T> static inline T div (T val, T div) |
| 110 | { |
125 | { |
| 111 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
126 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
| 112 | } |
127 | } |
|
|
128 | |
|
|
129 | template<> inline float div (float val, float div) { return val / div; } |
|
|
130 | template<> inline double div (double val, double div) { return val / div; } |
|
|
131 | |
| 113 | // div, round-up |
132 | // div, round-up |
| 114 | template<typename T> static inline T div_ru (T val, T div) |
133 | template<typename T> static inline T div_ru (T val, T div) |
| 115 | { |
134 | { |
| 116 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
135 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
| 117 | } |
136 | } |
| … | |
… | |
| 410 | { |
429 | { |
| 411 | p->~Tp (); |
430 | p->~Tp (); |
| 412 | } |
431 | } |
| 413 | }; |
432 | }; |
| 414 | |
433 | |
| 415 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
|
|
| 416 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
|
|
| 417 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
| 418 | struct tausworthe_random_generator |
|
|
| 419 | { |
|
|
| 420 | uint32_t state [4]; |
|
|
| 421 | |
|
|
| 422 | void operator =(const tausworthe_random_generator &src) |
|
|
| 423 | { |
|
|
| 424 | state [0] = src.state [0]; |
|
|
| 425 | state [1] = src.state [1]; |
|
|
| 426 | state [2] = src.state [2]; |
|
|
| 427 | state [3] = src.state [3]; |
|
|
| 428 | } |
|
|
| 429 | |
|
|
| 430 | void seed (uint32_t seed); |
|
|
| 431 | uint32_t next (); |
|
|
| 432 | }; |
|
|
| 433 | |
|
|
| 434 | // Xorshift RNGs, George Marsaglia |
|
|
| 435 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
| 436 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
| 437 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
| 438 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
| 439 | struct xorshift_random_generator |
|
|
| 440 | { |
|
|
| 441 | uint32_t x, y; |
|
|
| 442 | |
|
|
| 443 | void operator =(const xorshift_random_generator &src) |
|
|
| 444 | { |
|
|
| 445 | x = src.x; |
|
|
| 446 | y = src.y; |
|
|
| 447 | } |
|
|
| 448 | |
|
|
| 449 | void seed (uint32_t seed) |
|
|
| 450 | { |
|
|
| 451 | x = seed; |
|
|
| 452 | y = seed * 69069U; |
|
|
| 453 | } |
|
|
| 454 | |
|
|
| 455 | uint32_t next () |
|
|
| 456 | { |
|
|
| 457 | uint32_t t = x ^ (x << 10); |
|
|
| 458 | x = y; |
|
|
| 459 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
| 460 | return y; |
|
|
| 461 | } |
|
|
| 462 | }; |
|
|
| 463 | |
|
|
| 464 | template<class generator> |
|
|
| 465 | struct random_number_generator : generator |
|
|
| 466 | { |
|
|
| 467 | // uniform distribution, 0 .. max (0, num - 1) |
|
|
| 468 | uint32_t operator ()(uint32_t num) |
|
|
| 469 | { |
|
|
| 470 | return !is_constant (num) ? get_range (num) // non-constant |
|
|
| 471 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
|
|
| 472 | : this->next () & (num - 1); // constant, power-of-two |
|
|
| 473 | } |
|
|
| 474 | |
|
|
| 475 | // return a number within (min .. max) |
|
|
| 476 | int operator () (int r_min, int r_max) |
|
|
| 477 | { |
|
|
| 478 | return is_constant (r_min) && is_constant (r_max) && r_min <= r_max |
|
|
| 479 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
| 480 | : get_range (r_min, r_max); |
|
|
| 481 | } |
|
|
| 482 | |
|
|
| 483 | double operator ()() |
|
|
| 484 | { |
|
|
| 485 | return this->next () / (double)0xFFFFFFFFU; |
|
|
| 486 | } |
|
|
| 487 | |
|
|
| 488 | protected: |
|
|
| 489 | uint32_t get_range (uint32_t r_max); |
|
|
| 490 | int get_range (int r_min, int r_max); |
|
|
| 491 | }; |
|
|
| 492 | |
|
|
| 493 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
|
|
| 494 | |
|
|
| 495 | extern rand_gen rndm, rmg_rndm; |
|
|
| 496 | |
|
|
| 497 | INTERFACE_CLASS (attachable) |
434 | INTERFACE_CLASS (attachable) |
| 498 | struct refcnt_base |
435 | struct refcnt_base |
| 499 | { |
436 | { |
| 500 | typedef int refcnt_t; |
437 | typedef int refcnt_t; |
| 501 | mutable refcnt_t ACC (RW, refcnt); |
438 | mutable refcnt_t ACC (RW, refcnt); |
| … | |
… | |
| 562 | typedef refptr<maptile> maptile_ptr; |
499 | typedef refptr<maptile> maptile_ptr; |
| 563 | typedef refptr<object> object_ptr; |
500 | typedef refptr<object> object_ptr; |
| 564 | typedef refptr<archetype> arch_ptr; |
501 | typedef refptr<archetype> arch_ptr; |
| 565 | typedef refptr<client> client_ptr; |
502 | typedef refptr<client> client_ptr; |
| 566 | typedef refptr<player> player_ptr; |
503 | typedef refptr<player> player_ptr; |
|
|
504 | typedef refptr<region> region_ptr; |
| 567 | |
505 | |
| 568 | #define STRHSH_NULL 2166136261 |
506 | #define STRHSH_NULL 2166136261 |
| 569 | |
507 | |
| 570 | static inline uint32_t |
508 | static inline uint32_t |
| 571 | strhsh (const char *s) |
509 | strhsh (const char *s) |
