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.24 by root, Mon Dec 25 11:25:49 2006 UTC vs.
Revision 1.32 by root, Thu Jan 18 19:32:37 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>
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
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}
16 85
17// makes dynamically allocated objects zero-initialised 86// makes dynamically allocated objects zero-initialised
18struct zero_initialised 87struct zero_initialised
19{ 88{
20 void *operator new (size_t s, void *p) 89 void *operator new (size_t s, void *p)
… …
119 void destroy (pointer p) 188 void destroy (pointer p)
120 { 189 {
121 p->~Tp (); 190 p->~Tp ();
122 } 191 }
123}; 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 + next () % 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;
124 224
125template<class T> 225template<class T>
126struct refptr 226struct refptr
127{ 227{
128 T *p; 228 T *p;
… …
191 { 291 {
192 return !strcmp (a, b); 292 return !strcmp (a, b);
193 } 293 }
194}; 294};
195 295
196#include <vector>
197
198template<class obj> 296template<class T>
199struct unordered_vector : std::vector<obj, slice_allocator<obj> > 297struct unordered_vector : std::vector<T, slice_allocator<T> >
200{ 298{
201 typedef typename unordered_vector::iterator iterator; 299 typedef typename unordered_vector::iterator iterator;
202 300
203 void erase (unsigned int pos) 301 void erase (unsigned int pos)
204 { 302 {
… …
212 { 310 {
213 erase ((unsigned int )(i - this->begin ())); 311 erase ((unsigned int )(i - this->begin ()));
214 } 312 }
215}; 313};
216 314
217template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 315template<class T, int T::* index>
218template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 316struct object_vector : std::vector<T *, slice_allocator<T *> >
219template<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; } 317{
318 void insert (T *obj)
319 {
320 assert (!(obj->*index));
321 push_back (obj);
322 obj->*index = this->size ();
323 }
220 324
221template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; } 325 void insert (T &obj)
326 {
327 insert (&obj);
328 }
329
330 void erase (T *obj)
331 {
332 assert (obj->*index);
333 int pos = obj->*index;
334 obj->*index = 0;
335
336 if (pos < this->size ())
337 {
338 (*this)[pos - 1] = (*this)[this->size () - 1];
339 (*this)[pos - 1]->*index = pos;
340 }
341
342 this->pop_back ();
343 }
344
345 void erase (T &obj)
346 {
347 errase (&obj);
348 }
349};
222 350
223// 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
224void assign (char *dst, const char *src, int maxlen); 352void assign (char *dst, const char *src, int maxlen);
225 353
226// type-safe version of assign 354// type-safe version of assign
… …
233typedef double tstamp; 361typedef double tstamp;
234 362
235// return current time as timestampe 363// return current time as timestampe
236tstamp now (); 364tstamp now ();
237 365
366int similar_direction (int a, int b);
367
238#endif 368#endif
239 369

Diff Legend

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