1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * |
5 | * |
6 | * Deliantra is free software: you can redistribute it and/or modify |
6 | * Deliantra is free software: you can redistribute it and/or modify it under |
7 | * it under the terms of the GNU General Public License as published by |
7 | * the terms of the Affero GNU General Public License as published by the |
8 | * the Free Software Foundation, either version 3 of the License, or |
8 | * Free Software Foundation, either version 3 of the License, or (at your |
9 | * (at your option) any later version. |
9 | * option) any later version. |
10 | * |
10 | * |
11 | * This program is distributed in the hope that it will be useful, |
11 | * This program is distributed in the hope that it will be useful, |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | * GNU General Public License for more details. |
14 | * GNU General Public License for more details. |
15 | * |
15 | * |
16 | * You should have received a copy of the GNU General Public License |
16 | * You should have received a copy of the Affero GNU General Public License |
17 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
17 | * and the GNU General Public License along with this program. If not, see |
|
|
18 | * <http://www.gnu.org/licenses/>. |
18 | * |
19 | * |
19 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | * The authors can be reached via e-mail to <support@deliantra.net> |
20 | */ |
21 | */ |
21 | |
22 | |
22 | #ifndef UTIL_H__ |
23 | #ifndef UTIL_H__ |
… | |
… | |
118 | |
119 | |
119 | // sign0 returns -1, 0 or +1 |
120 | // sign0 returns -1, 0 or +1 |
120 | template<typename T> |
121 | template<typename T> |
121 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
122 | static inline T sign0 (T v) { return v ? sign (v) : 0; } |
122 | |
123 | |
|
|
124 | // div* only work correctly for div > 0 |
123 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
125 | // div, with correct rounding (< 0.5 downwards, >=0.5 upwards) |
124 | template<typename T> static inline T div (T val, T div) { return (val + div / 2) / div; } |
126 | template<typename T> static inline T div (T val, T div) |
|
|
127 | { |
|
|
128 | return expect_false (val < 0) ? - ((-val + (div - 1) / 2) / div) : (val + div / 2) / div; |
|
|
129 | } |
125 | // div, round-up |
130 | // div, round-up |
126 | template<typename T> static inline T div_ru (T val, T div) { return (val + div - 1) / div; } |
131 | template<typename T> static inline T div_ru (T val, T div) |
|
|
132 | { |
|
|
133 | return expect_false (val < 0) ? - ((-val ) / div) : (val + div - 1) / div; |
|
|
134 | } |
127 | // div, round-down |
135 | // div, round-down |
128 | template<typename T> static inline T div_rd (T val, T div) { return (val ) / div; } |
136 | template<typename T> static inline T div_rd (T val, T div) |
|
|
137 | { |
|
|
138 | return expect_false (val < 0) ? - ((-val + (div - 1) ) / div) : (val ) / div; |
|
|
139 | } |
129 | |
140 | |
|
|
141 | // lerp* only work correctly for min_in < max_in |
|
|
142 | // Linear intERPolate, scales val from min_in..max_in to min_out..max_out |
130 | template<typename T> |
143 | template<typename T> |
131 | static inline T |
144 | static inline T |
132 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
145 | lerp (T val, T min_in, T max_in, T min_out, T max_out) |
133 | { |
146 | { |
134 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
147 | return min_out + div <T> ((val - min_in) * (max_out - min_out), max_in - min_in); |
… | |
… | |
676 | erase (&obj); |
689 | erase (&obj); |
677 | } |
690 | } |
678 | }; |
691 | }; |
679 | |
692 | |
680 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
693 | // basically does what strncpy should do, but appends "..." to strings exceeding length |
|
|
694 | // returns the number of bytes actually used (including \0) |
681 | void assign (char *dst, const char *src, int maxlen); |
695 | int assign (char *dst, const char *src, int maxsize); |
682 | |
696 | |
683 | // type-safe version of assign |
697 | // type-safe version of assign |
684 | template<int N> |
698 | template<int N> |
685 | inline void assign (char (&dst)[N], const char *src) |
699 | inline int assign (char (&dst)[N], const char *src) |
686 | { |
700 | { |
687 | assign ((char *)&dst, src, N); |
701 | return assign ((char *)&dst, src, N); |
688 | } |
702 | } |
689 | |
703 | |
690 | typedef double tstamp; |
704 | typedef double tstamp; |
691 | |
705 | |
692 | // return current time as timestamp |
706 | // return current time as timestamp |
… | |
… | |
694 | |
708 | |
695 | int similar_direction (int a, int b); |
709 | int similar_direction (int a, int b); |
696 | |
710 | |
697 | // like sprintf, but returns a "static" buffer |
711 | // like sprintf, but returns a "static" buffer |
698 | const char *format (const char *format, ...); |
712 | const char *format (const char *format, ...); |
|
|
713 | |
|
|
714 | // safety-check player input which will become object->msg |
|
|
715 | bool msg_is_safe (const char *msg); |
699 | |
716 | |
700 | ///////////////////////////////////////////////////////////////////////////// |
717 | ///////////////////////////////////////////////////////////////////////////// |
701 | // threads, very very thin wrappers around pthreads |
718 | // threads, very very thin wrappers around pthreads |
702 | |
719 | |
703 | struct thread |
720 | struct thread |