… | |
… | |
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 | // could use the sizeof (arr) /( sizeof (arr [0]) here, but C++ is |
60 | #if cplusplus_does_not_suck |
61 | // much more obfuscated... :) |
61 | // does not work for local types (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2657.htm) |
62 | |
|
|
63 | template<typename T, int N> |
62 | template<typename T, int N> |
64 | inline int array_length (const T (&arr)[N]) |
63 | static inline int array_length (const T (&arr)[N]) |
65 | { |
64 | { |
66 | return N; |
65 | return N; |
67 | } |
66 | } |
|
|
67 | #else |
|
|
68 | #define array_length(name) (sizeof (name) / sizeof (name [0])) |
|
|
69 | #endif |
68 | |
70 | |
69 | // very ugly macro that basically declares and initialises a variable |
71 | // very ugly macro that basically declares and initialises a variable |
70 | // that is in scope for the next statement only |
72 | // that is in scope for the next statement only |
71 | // 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 |
72 | // (note: works great for pointers) |
74 | // (note: works great for pointers) |
… | |
… | |
121 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
122 | template<typename T> static inline T div (T val, T div) |
124 | template<typename T> static inline T div (T val, T div) |
123 | { |
125 | { |
124 | 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; |
125 | } |
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 | |
126 | // div, round-up |
132 | // div, round-up |
127 | 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) |
128 | { |
134 | { |
129 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
135 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
130 | } |
136 | } |
… | |
… | |
422 | void destroy (pointer p) |
428 | void destroy (pointer p) |
423 | { |
429 | { |
424 | p->~Tp (); |
430 | p->~Tp (); |
425 | } |
431 | } |
426 | }; |
432 | }; |
427 | |
|
|
428 | // P. L'Ecuyer, “Maximally Equidistributed Combined Tausworthe Generators”, Mathematics of Computation, 65, 213 (1996), 203–213. |
|
|
429 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme.ps |
|
|
430 | // http://www.iro.umontreal.ca/~lecuyer/myftp/papers/tausme2.ps |
|
|
431 | struct tausworthe_random_generator |
|
|
432 | { |
|
|
433 | uint32_t state [4]; |
|
|
434 | |
|
|
435 | void operator =(const tausworthe_random_generator &src) |
|
|
436 | { |
|
|
437 | state [0] = src.state [0]; |
|
|
438 | state [1] = src.state [1]; |
|
|
439 | state [2] = src.state [2]; |
|
|
440 | state [3] = src.state [3]; |
|
|
441 | } |
|
|
442 | |
|
|
443 | void seed (uint32_t seed); |
|
|
444 | uint32_t next (); |
|
|
445 | }; |
|
|
446 | |
|
|
447 | // Xorshift RNGs, George Marsaglia |
|
|
448 | // http://www.jstatsoft.org/v08/i14/paper |
|
|
449 | // this one is about 40% faster than the tausworthe one above (i.e. not much), |
|
|
450 | // despite the inlining, and has the issue of only creating 2**32-1 numbers. |
|
|
451 | // see also http://www.iro.umontreal.ca/~lecuyer/myftp/papers/xorshift.pdf |
|
|
452 | struct xorshift_random_generator |
|
|
453 | { |
|
|
454 | uint32_t x, y; |
|
|
455 | |
|
|
456 | void operator =(const xorshift_random_generator &src) |
|
|
457 | { |
|
|
458 | x = src.x; |
|
|
459 | y = src.y; |
|
|
460 | } |
|
|
461 | |
|
|
462 | void seed (uint32_t seed) |
|
|
463 | { |
|
|
464 | x = seed; |
|
|
465 | y = seed * 69069U; |
|
|
466 | } |
|
|
467 | |
|
|
468 | uint32_t next () |
|
|
469 | { |
|
|
470 | uint32_t t = x ^ (x << 10); |
|
|
471 | x = y; |
|
|
472 | y = y ^ (y >> 13) ^ t ^ (t >> 10); |
|
|
473 | return y; |
|
|
474 | } |
|
|
475 | }; |
|
|
476 | |
|
|
477 | template<class generator> |
|
|
478 | struct random_number_generator : generator |
|
|
479 | { |
|
|
480 | // uniform distribution, 0 .. max (0, num - 1) |
|
|
481 | uint32_t operator ()(uint32_t num) |
|
|
482 | { |
|
|
483 | return !is_constant (num) ? get_range (num) // non-constant |
|
|
484 | : num & (num - 1) ? (this->next () * (uint64_t)num) >> 32U // constant, non-power-of-two |
|
|
485 | : this->next () & (num - 1); // constant, power-of-two |
|
|
486 | } |
|
|
487 | |
|
|
488 | // return a number within the closed interval [min .. max] |
|
|
489 | int operator () (int r_min, int r_max) |
|
|
490 | { |
|
|
491 | return is_constant (r_min <= r_max) && r_min <= r_max |
|
|
492 | ? r_min + operator ()(r_max - r_min + 1) |
|
|
493 | : get_range (r_min, r_max); |
|
|
494 | } |
|
|
495 | |
|
|
496 | // return a number within the closed interval [0..1] |
|
|
497 | double operator ()() |
|
|
498 | { |
|
|
499 | return this->next () / (double)0xFFFFFFFFU; |
|
|
500 | } |
|
|
501 | |
|
|
502 | protected: |
|
|
503 | uint32_t get_range (uint32_t r_max); |
|
|
504 | int get_range (int r_min, int r_max); |
|
|
505 | }; |
|
|
506 | |
|
|
507 | typedef random_number_generator<tausworthe_random_generator> rand_gen; |
|
|
508 | |
|
|
509 | extern rand_gen rndm, rmg_rndm; |
|
|
510 | |
433 | |
511 | INTERFACE_CLASS (attachable) |
434 | INTERFACE_CLASS (attachable) |
512 | struct refcnt_base |
435 | struct refcnt_base |
513 | { |
436 | { |
514 | typedef int refcnt_t; |
437 | typedef int refcnt_t; |
… | |
… | |
718 | { |
641 | { |
719 | erase (&obj); |
642 | erase (&obj); |
720 | } |
643 | } |
721 | }; |
644 | }; |
722 | |
645 | |
|
|
646 | ///////////////////////////////////////////////////////////////////////////// |
|
|
647 | |
|
|
648 | // something like a vector or stack, but without |
|
|
649 | // out of bounds checking |
|
|
650 | template<typename T> |
|
|
651 | struct fixed_stack |
|
|
652 | { |
|
|
653 | T *data; |
|
|
654 | int size; |
|
|
655 | int max; |
|
|
656 | |
|
|
657 | fixed_stack () |
|
|
658 | : size (0), data (0) |
|
|
659 | { |
|
|
660 | } |
|
|
661 | |
|
|
662 | fixed_stack (int max) |
|
|
663 | : size (0), max (max) |
|
|
664 | { |
|
|
665 | data = salloc<T> (max); |
|
|
666 | } |
|
|
667 | |
|
|
668 | void reset (int new_max) |
|
|
669 | { |
|
|
670 | sfree (data, max); |
|
|
671 | size = 0; |
|
|
672 | max = new_max; |
|
|
673 | data = salloc<T> (max); |
|
|
674 | } |
|
|
675 | |
|
|
676 | void free () |
|
|
677 | { |
|
|
678 | sfree (data, max); |
|
|
679 | data = 0; |
|
|
680 | } |
|
|
681 | |
|
|
682 | ~fixed_stack () |
|
|
683 | { |
|
|
684 | sfree (data, max); |
|
|
685 | } |
|
|
686 | |
|
|
687 | T &operator[](int idx) |
|
|
688 | { |
|
|
689 | return data [idx]; |
|
|
690 | } |
|
|
691 | |
|
|
692 | void push (T v) |
|
|
693 | { |
|
|
694 | data [size++] = v; |
|
|
695 | } |
|
|
696 | |
|
|
697 | T &pop () |
|
|
698 | { |
|
|
699 | return data [--size]; |
|
|
700 | } |
|
|
701 | |
|
|
702 | T remove (int idx) |
|
|
703 | { |
|
|
704 | T v = data [idx]; |
|
|
705 | |
|
|
706 | data [idx] = data [--size]; |
|
|
707 | |
|
|
708 | return v; |
|
|
709 | } |
|
|
710 | }; |
|
|
711 | |
|
|
712 | ///////////////////////////////////////////////////////////////////////////// |
|
|
713 | |
723 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
714 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
724 | // returns the number of bytes actually used (including \0) |
715 | // returns the number of bytes actually used (including \0) |
725 | int assign (char *dst, const char *src, int maxsize); |
716 | int assign (char *dst, const char *src, int maxsize); |
726 | |
717 | |
727 | // type-safe version of assign |
718 | // type-safe version of assign |