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.22 by root, Sat Dec 23 06:21:02 2006 UTC vs.
Revision 1.29 by root, Mon Jan 15 01:39:42 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
38// this is much faster than crossfires original algorithm
39// on modern cpus
40inline int
41isqrt (int n)
42{
43 return (int)sqrtf ((float)n);
44}
45
46// this is only twice as fast as naive sqrtf (dx*dy+dy*dy)
47#if 0
48// and has a max. error of 6 in the range -100..+100.
49#else
50// and has a max. error of 9 in the range -100..+100.
51#endif
52inline int
53idistance (int dx, int dy)
54{
55 unsigned int dx_ = abs (dx);
56 unsigned int dy_ = abs (dy);
57
58#if 0
59 return dx_ > dy_
60 ? (dx_ * 61685 + dy_ * 26870) >> 16
61 : (dy_ * 61685 + dx_ * 26870) >> 16;
62#else
63 return dx + dy - min (dx, dy) * 5 / 8;
64#endif
65}
66
67/*
68 * absdir(int): Returns a number between 1 and 8, which represent
69 * the "absolute" direction of a number (it actually takes care of
70 * "overflow" in previous calculations of a direction).
71 */
72inline int
73absdir (int d)
74{
75 return ((d - 1) & 7) + 1;
76}
16 77
17// makes dynamically allocated objects zero-initialised 78// makes dynamically allocated objects zero-initialised
18struct zero_initialised 79struct zero_initialised
19{ 80{
20 void *operator new (size_t s, void *p) 81 void *operator new (size_t s, void *p)
… …
120 { 181 {
121 p->~Tp (); 182 p->~Tp ();
122 } 183 }
123}; 184};
124 185
125struct refcounted
126{
127 refcounted () : refcnt (0) { }
128// virtual ~refcounted ();
129 void refcnt_inc () { ++refcnt; }
130 void refcnt_dec () { --refcnt; }
131 bool dead () { return refcnt == 0; }
132 mutable int refcnt;
133#if 0
134private:
135 static refcounted *rc_first;
136 refcounted *rc_next;
137#endif
138};
139
140template<class T> 186template<class T>
141struct refptr 187struct refptr
142{ 188{
143 T *p; 189 T *p;
144 190
… …
166 T *operator ->() const { return p; } 212 T *operator ->() const { return p; }
167 213
168 operator T *() const { return p; } 214 operator T *() const { return p; }
169}; 215};
170 216
171typedef refptr<player> player_ptr; 217typedef refptr<maptile> maptile_ptr;
172typedef refptr<object> object_ptr; 218typedef refptr<object> object_ptr;
173typedef refptr<archetype> arch_ptr; 219typedef refptr<archetype> arch_ptr;
220typedef refptr<client> client_ptr;
221typedef refptr<player> player_ptr;
174 222
175struct str_hash 223struct str_hash
176{ 224{
177 std::size_t operator ()(const char *s) const 225 std::size_t operator ()(const char *s) const
178 { 226 {
… …
204 { 252 {
205 return !strcmp (a, b); 253 return !strcmp (a, b);
206 } 254 }
207}; 255};
208 256
209#include <vector>
210
211template<class obj> 257template<class T>
212struct unordered_vector : std::vector<obj, slice_allocator<obj> > 258struct unordered_vector : std::vector<T, slice_allocator<T> >
213{ 259{
214 typedef typename unordered_vector::iterator iterator; 260 typedef typename unordered_vector::iterator iterator;
215 261
216 void erase (unsigned int pos) 262 void erase (unsigned int pos)
217 { 263 {
… …
222 } 268 }
223 269
224 void erase (iterator i) 270 void erase (iterator i)
225 { 271 {
226 erase ((unsigned int )(i - this->begin ())); 272 erase ((unsigned int )(i - this->begin ()));
273 }
274};
275
276template<class T, int T::* index>
277struct object_vector : std::vector<T *, slice_allocator<T *> >
278{
279 void insert (T *obj)
280 {
281 assert (!(obj->*index));
282 push_back (obj);
283 obj->*index = this->size ();
284 }
285
286 void insert (T &obj)
287 {
288 insert (&obj);
289 }
290
291 void erase (T *obj)
292 {
293 assert (obj->*index);
294 int pos = obj->*index;
295 obj->*index = 0;
296
297 if (pos < this->size ())
298 {
299 (*this)[pos - 1] = (*this)[this->size () - 1];
300 (*this)[pos - 1]->*index = pos;
301 }
302
303 this->pop_back ();
304 }
305
306 void erase (T &obj)
307 {
308 errase (&obj);
227 } 309 }
228}; 310};
229 311
230template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; } 312template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
231template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; } 313template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
… …
246typedef double tstamp; 328typedef double tstamp;
247 329
248// return current time as timestampe 330// return current time as timestampe
249tstamp now (); 331tstamp now ();
250 332
333int similar_direction (int a, int b);
334
251#endif 335#endif
252 336

Diff Legend

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