ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/include/util.h
(Generate patch)

Comparing deliantra/server/include/util.h (file contents):
Revision 1.27 by root, Mon Jan 15 00:40:49 2007 UTC vs.
Revision 1.33 by root, Thu Jan 18 22:20:00 2007 UTC

… …
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>
11#include <new> 12#include <new>
12#include <vector> 13#include <vector>
13 14
14#include <glib.h> 15#include <glib.h>
15 16
… …
31 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg)) 32 ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
32 33
33// in range excluding end 34// in range excluding end
34#define IN_RANGE_EXC(val,beg,end) \ 35#define IN_RANGE_EXC(val,beg,end) \
35 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg)) 36 ((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
37
38void fork_abort (const char *msg);
39
40template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
41template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
42template<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
44template<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
48inline int
49isqrt (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
60inline int
61idistance (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 */
80inline int
81absdir (int d)
82{
83 return ((d - 1) & 7) + 1;
84}
36 85
37// makes dynamically allocated objects zero-initialised 86// makes dynamically allocated objects zero-initialised
38struct zero_initialised 87struct zero_initialised
39{ 88{
40 void *operator new (size_t s, void *p) 89 void *operator new (size_t s, void *p)
… …
139 void destroy (pointer p) 188 void destroy (pointer p)
140 { 189 {
141 p->~Tp (); 190 p->~Tp ();
142 } 191 }
143}; 192};
193
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
197struct tausworthe_random_generator
198{
199 uint32_t state [4];
200
201 tausworthe_random_generator (uint32_t seed);
202 uint32_t next ();
203
204 uint32_t operator ()(uint32_t r_max)
205 {
206 return next () % r_max;
207 }
208
209 // return a number within (min .. max)
210 int operator () (int r_min, int r_max)
211 {
212 return r_min + (*this) (max (r_max - r_min + 1, 1));
213 }
214
215 double operator ()()
216 {
217 return next () / (double)0xFFFFFFFFU;
218 }
219};
220
221typedef tausworthe_random_generator rand_gen;
222
223extern rand_gen rndm;
144 224
145template<class T> 225template<class T>
146struct refptr 226struct refptr
147{ 227{
148 T *p; 228 T *p;
… …
266 { 346 {
267 errase (&obj); 347 errase (&obj);
268 } 348 }
269}; 349};
270 350
271template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
272template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
273template<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; }
274
275template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
276
277// basically does what strncpy should do, but appends "..." to strings exceeding length 351// basically does what strncpy should do, but appends "..." to strings exceeding length
278void assign (char *dst, const char *src, int maxlen); 352void assign (char *dst, const char *src, int maxlen);
279 353
280// type-safe version of assign 354// type-safe version of assign
281template<int N> 355template<int N>

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines